-
Notifications
You must be signed in to change notification settings - Fork 144
/
Copy pathopennurbs_textrun.cpp
1532 lines (1392 loc) · 37.5 KB
/
opennurbs_textrun.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
//
// Copyright (c) 1993-2022 Robert McNeel & Associates. All rights reserved.
// OpenNURBS, Rhinoceros, and Rhino3D are registered trademarks of Robert
// McNeel & Associates.
//
// THIS SOFTWARE IS PROVIDED "AS IS" WITHOUT EXPRESS OR IMPLIED WARRANTY.
// ALL IMPLIED WARRANTIES OF FITNESS FOR ANY PARTICULAR PURPOSE AND OF
// MERCHANTABILITY ARE HEREBY DISCLAIMED.
//
// For complete openNURBS copyright information see <http://www.opennurbs.org>.
////////////////////////////////////////////////////////////////
#include "opennurbs.h"
#if !defined(ON_COMPILING_OPENNURBS)
// This check is included in all opennurbs source .c and .cpp files to insure
// ON_COMPILING_OPENNURBS is defined when opennurbs source is compiled.
// When opennurbs source is being compiled, ON_COMPILING_OPENNURBS is defined
// and the opennurbs .h files alter what is declared and how it is declared.
#error ON_COMPILING_OPENNURBS must be defined when compiling opennurbs
#endif
class ON_TextRunPool : public ON_FixedSizePool
{
public:
static ON_TextRunPool thePool;
private:
ON_TextRunPool()
{
ON_FixedSizePool::Create(sizeof(ON_TextRun), 0, 0);
}
~ON_TextRunPool() = default;
ON_TextRunPool(const ON_TextRunPool&) = delete;
ON_TextRunPool& operator=(const ON_TextRunPool&) = delete;
};
ON_TextRunPool ON_TextRunPool::thePool;
ON_TextRun::ON_TextRun(bool bManagedTextRun)
: m_managed_status(bManagedTextRun ? 1 : 0)
{}
ON_TextRun* ON_TextRun::GetManagedTextRun()
{
// .NET wrappers manage objects with test runs and .NET GC runs in its own thread,
// so text run allocation/return using the global ON_TextRunPool::thePool resource
// must be thread safe.
void* p = ON_TextRunPool::thePool.ThreadSafeAllocateDirtyElement();
ON_TextRun* run
= (nullptr != p)
? new(p)ON_TextRun(true) // always happens in practice
: new ON_TextRun(false); // could occur if a crashing working thread leaves the pool locked.
return run;
}
ON_TextRun* ON_TextRun::GetManagedTextRun(
const ON_TextRun& src
)
{
ON_TextRun* run = ON_TextRun::GetManagedTextRun();
*run = src;
return run;
}
/*
Description:
Returns an ON_TextRun to the pool for reuse.
*/
bool ON_TextRun::ReturnManagedTextRun(
ON_TextRun* run
)
{
if ( nullptr == run )
return true;
if (1 == run->m_managed_status)
{
if (0 == run->m_active_status)
{
run->Internal_Destroy();
run->m_active_status = 1;
// .NET wrappers manage objects with test runs and .NET GC runs in its own thread,
// so text run allocation/return using the global ON_TextRunPool::thePool resource
// must be thread safe.
ON_TextRunPool::thePool.ThreadSafeReturnElement(run);
return true;
}
ON_ERROR("Attempt to return a managed run that is not active.");
return false;
}
ON_ERROR("Attempt to return a run that is not managed.");
return false;
}
bool ON_TextRun::IsManagedTextRun() const
{
return (1 == m_managed_status);
}
bool ON_TextRun::IsActiveManagedTextRun() const
{
return (1 == m_managed_status && 0 == m_active_status);
}
void ON_TextRunArray::InsertRun(int i, ON_TextRun*& run)
{
ON_SimpleArray< ON_TextRun* >::Insert(i, run);
run = nullptr;
}
void ON_TextRunArray::RemoveRun(int i)
{
ON_SimpleArray< ON_TextRun* >::Remove(i);
}
void ON_TextRunArray::AppendRun(ON_TextRun*& run)
{
ON_TextRun*& new_run = ON_SimpleArray< ON_TextRun* >::AppendNew();
new_run = run; // copy pointer, not data
run = 0; // null source pointer
}
void ON_TextRunArray::Internal_Destroy()
{
for (int i = 0; i < m_count; i++)
{
ON_TextRun* text_run = m_a[i];
if (nullptr != text_run)
{
m_a[i] = nullptr;
if (text_run->IsManagedTextRun())
{
ON_TextRun::ReturnManagedTextRun(text_run);
}
else
{
delete text_run;
}
}
}
Empty();
}
ON_TextRun*const* ON_TextRunArray::Array() const
{
return (m_count > 0) ? m_a : nullptr;
}
const ON_TextRun* ON_TextRunArray::operator[](int i) const
{
return (i >= 0 && i < m_count) ? m_a[i] : nullptr;
}
ON_TextRun* ON_TextRunArray::operator[](int i)
{
return (i >= 0 && i < m_count) ? m_a[i] : nullptr;
}
int ON_TextRunArray::Count() const
{
return m_count;
}
unsigned int ON_TextRunArray::UnsignedCount() const
{
return (unsigned int)m_count;
}
void ON_TextRunArray::SetTextHeight(double height)
{
for (int ri = 0; ri < Count(); ri++)
{
ON_TextRun* run = m_a[ri];
if (nullptr == run)
continue;
run->SetTextHeight(height);
}
}
bool ON_TextRunArray::Get2dCorners(ON_2dPoint corners[4]) const
{
ON_2dPoint minpt(0.0, 0.0), maxpt(0.0, 0.0);
bool rc = false;
for (int ri = 0; ri < Count(); ri++)
{
const ON_TextRun* run = m_a[ri];
if (nullptr == run)
continue;
rc = true;
const ON_2dVector& offset = run->Offset();
const ON_BoundingBox run_bbox = run->BoundingBox();
if (minpt.x > run_bbox.m_min.x + offset.x)
minpt.x = run_bbox.m_min.x + offset.x;
if (minpt.y > run_bbox.m_min.y + offset.y)
minpt.y = run_bbox.m_min.y + offset.y;
if (maxpt.x < run_bbox.m_max.x + offset.x)
maxpt.x = run_bbox.m_max.x + offset.x;
if (maxpt.y < run_bbox.m_max.y + offset.y)
maxpt.y = run_bbox.m_max.y + offset.y;
#if defined(ON_DEBUG) && defined(ON_COMPILER_MSC)
rc = rc; // good place for a breakpoint
#endif
}
corners[0].Set(minpt.x, minpt.y);
corners[1].Set(maxpt.x, minpt.y);
corners[2].Set(maxpt.x, maxpt.y);
corners[3].Set(minpt.x, maxpt.y);
return rc;
}
void ON_TextRunArray::Internal_CopyFrom(const ON_TextRunArray& src)
{
SetCount(0);
Reserve(src.m_count);
for (int i = 0; i < src.m_count; i++)
{
const ON_TextRun* src_text_run = src.m_a[i];
if ( nullptr != src_text_run )
AppendNew() = ON_TextRun::GetManagedTextRun(*src_text_run);
}
}
ON_TextRunArray::~ON_TextRunArray()
{
Internal_Destroy();
}
ON_TextRunArray& ON_TextRunArray::operator=(const ON_TextRunArray& src)
{
if (this != &src)
{
Internal_Destroy();
Internal_CopyFrom(src);
}
return *this;
}
ON_TextRunArray::ON_TextRunArray(const ON_TextRunArray& src)
{
Internal_CopyFrom(src);
}
//------------------------------------------------------------
ON_StackedText::~ON_StackedText()
{
// NOTE WELL:
// https://mcneel.myjetbrains.com/youtrack/issue/RH-57616
// ON_StackedText::Empty is a global const instance.
// Compilers like VS 2019 16.5.0 set the memory for that instance to read-only.
// This destructor must not write to memory used by const instances.
//
// m_top_run, m_bottom_run, and m_parent_run are set to nullptr to prevent crashes
// if in-place classes are referenced after destruction.
// This is done because bugs are better than crashes in the released product.
if (nullptr != m_top_run)
{
ON_TextRun::ReturnManagedTextRun(m_top_run);
m_top_run = nullptr;
}
if (nullptr != m_bottom_run)
{
ON_TextRun::ReturnManagedTextRun(m_bottom_run);
m_bottom_run = nullptr;
}
if (nullptr != m_parent_run)
{
m_parent_run = nullptr;
}
}
ON_StackedText::ON_StackedText(const ON_StackedText& src)
: ON_StackedText()
{
if (this != &src)
*this = src;
}
ON_StackedText& ON_StackedText::operator=(const ON_StackedText& src)
{
if (&src != this)
{
ON_TextRun::ReturnManagedTextRun(m_top_run);
ON_TextRun::ReturnManagedTextRun(m_bottom_run);
m_top_run = nullptr;
m_bottom_run = nullptr;
if (nullptr != src.m_top_run)
{
m_top_run = ON_TextRun::GetManagedTextRun();
*m_top_run = *src.m_top_run;
}
if (nullptr != src.m_bottom_run)
{
m_bottom_run = ON_TextRun::GetManagedTextRun();
*m_bottom_run = *src.m_bottom_run;
}
m_separator = src.m_separator;
m_parent_run = nullptr;
}
return *this;
}
//bool ON_StackedText::Write(
// ON_BinaryArchive& archive
// ) const
//{
// return WriteNested(0,archive);
//}
//
//bool ON_StackedText::Read(
// ON_BinaryArchive& archive
// )
//{
// return ReadNested(0,archive);
//}
//
//bool ON_StackedText::WriteNested(
// unsigned int nested_depth,
// ON_BinaryArchive& archive
// ) const
//{
// if ( nested_depth > 8 )
// return false;
//
// if ( !archive.BeginWrite3dmChunk(TCODE_ANONYMOUS_CHUNK,1,0))
// return false;
//
// nested_depth++;
//
// bool rc = false;
// for (;;)
// {
// if (!archive.WriteBool(nullptr != m_top_run))
// break;
// if (nullptr != m_top_run)
// {
// if (!m_top_run->WriteNested(nested_depth,archive))
// break;
// }
//
// if (!archive.WriteBool(nullptr != m_bottom_run))
// break;
// if (nullptr != m_bottom_run)
// {
// if (!m_bottom_run->WriteNested(nested_depth,archive))
// break;
// }
//
// unsigned int u = static_cast<unsigned int>(m_separator);
// if (!archive.WriteInt(u))
// break;
//
// rc = true;
// break;
// }
//
// if (!archive.EndWrite3dmChunk())
// rc = false;
//
// return rc;
//}
//
//bool ON_StackedText::ReadNested(
// unsigned int nested_depth,
// ON_BinaryArchive& archive
// )
//{
// *this = ON_StackedText::Empty;
// if ( nested_depth > 8 )
// return false;
//
// int major_version = 0;
// int minor_version = 0;
// if ( !archive.BeginRead3dmChunk(TCODE_ANONYMOUS_CHUNK,&major_version,&minor_version))
// return false;
//
// nested_depth++;
//
// bool rc = false;
// for (;;)
// {
// if (1 != major_version)
// {
// // This is prototype IO code and increasing major_version is not an error
// // until we are sure we got it right.
// rc = true;
// break;
// }
//
// bool b = false;
// if (!archive.ReadBool(&b))
// break;
// if (b)
// {
// m_top_run = ON_TextRun::GetManagedTextRun();
// if (!m_top_run->ReadNested(nested_depth, archive))
// {
// ON_TextRun::ReturnManagedTextRun(m_top_run);
// m_top_run = nullptr;
// break;
// }
// }
//
// if (!archive.ReadBool(&b))
// break;
// if (b)
// {
// m_bottom_run = ON_TextRun::GetManagedTextRun();
// if (!m_bottom_run->ReadNested(nested_depth, archive))
// {
// ON_TextRun::ReturnManagedTextRun(m_bottom_run);
// m_bottom_run = nullptr;
// break;
// }
// }
//
// unsigned int u = 0;
// if (!archive.ReadInt(&u))
// break;
//
// m_separator = static_cast<wchar_t>(u);
//
// rc = true;
// break;
// }
//
// if (!archive.EndRead3dmChunk())
// rc = false;
//
// return rc;
//}
//
//------------------------------------------------------------
ON_TextRun::~ON_TextRun()
{
Internal_Destroy();
}
ON_TextRun::ON_TextRun(const ON_TextRun& src)
{
Internal_CopyFrom(src);
}
void ON_TextRun::Internal_Destroy()
{
m_managed_font = nullptr;
if (nullptr != m_codepoints)
{
onfree(m_codepoints);
m_codepoints = nullptr;
}
m_text_string.Destroy();
m_display_string.Destroy();
if (nullptr != m_stacked_text)
{
delete m_stacked_text;
m_stacked_text = nullptr;
}
}
void ON_TextRun::Internal_CopyFrom(const ON_TextRun& src)
{
// "this" is clean.
m_managed_font = src.m_managed_font;
size_t cplen = CodepointCount(src.m_codepoints);
SetUnicodeString(cplen, src.m_codepoints);
m_text_string = src.m_text_string;
m_display_string = src.m_display_string;
m_text_stacked = src.m_text_stacked;
if (nullptr != src.m_stacked_text)
{
m_stacked_text = new ON_StackedText(*src.m_stacked_text);
m_stacked_text->m_parent_run = this;
}
m_color = src.m_color;
m_run_type = src.m_run_type;
m_direction = src.m_direction;
m_run_text_height = src.m_run_text_height;
m_offset = src.m_offset;
m_advance = src.m_advance;
m_bbox = src.m_bbox;
m_height_scale = src.m_height_scale;
m_stackscale = src.m_stackscale;
m_indent = src.m_indent;
m_left_margin = src.m_left_margin;
m_right_margin = src.m_right_margin;
m_line_index = src.m_line_index;
}
ON_TextRun& ON_TextRun::operator=(const ON_TextRun& src)
{
if ( &src != this )
{
Internal_Destroy();
Internal_CopyFrom(src);
}
return *this;
}
void ON_TextRun::Init(
const ON_Font* managed_font,
double height,
double stackscale,
ON_Color color,
bool bold,
bool italic,
bool underlined,
bool strikethrough,
bool deletedisplay)
{
*this = ON_TextRun::Empty;
m_color = color;
m_run_text_height = height;
m_stackscale = stackscale;
if (nullptr == managed_font)
managed_font = &ON_Font::Default;
if (
false == managed_font->IsManagedFont()
|| managed_font->IsBoldInQuartet() != bold // NEVER call IsBold() - it doesn't work with light, heavy, black, ... fonts!
|| managed_font->IsItalicInQuartet() != italic
|| managed_font->IsUnderlined() != underlined
|| managed_font->IsStrikethrough() != strikethrough
)
{
// Dale Lear - March 2021 - RH-62974
// There are multiple places in the text run, rich text parsing, and Rhino UI code
// that need find a font from rich text properties.
// They must all do it the same way. If for some reason, you must change this call,
// please take the time to create a single function that replaces this call, search
// for all the places ON_Font::FontFromRichTextProperties is called in
// src4/rhino/...
// opennurbs_textrun.cpp
// opennurbs_textiterator.cpp
// and replace every call to ON_Font::FontFromRichTextProperties with a call to
// your new function.
managed_font = ON_Font::FontFromRichTextProperties(
ON_Font::RichTextFontName(managed_font, true),
bold,
italic,
underlined,
strikethrough);
}
m_managed_font = managed_font;
}
bool ON_TextRun::IsText() const
{
return Type() == RunType::kText;
}
bool ON_TextRun::IsNewline() const
{
return Type() == RunType::kNewline;
}
bool ON_TextRun::IsColumn() const
{
return Type() == RunType::kColumn;
}
static bool RunIsInvalid()
{
return false;
}
bool ON_TextRun::IsValid() const
{
switch (Type())
{
case RunType::kField:
case RunType::kText:
{
Stacked is_stacked = IsStacked();
if ( IsStacked() != Stacked::kStacked &&
(nullptr == m_codepoints ||
0 == ON_TextRun::CodepointCount(m_codepoints)) &&
!m_text_string.IsEmpty())
return RunIsInvalid();
if (!(m_run_text_height > 0.0))
return RunIsInvalid();
switch (is_stacked)
{
case Stacked::kNone:
{
if (nullptr != m_stacked_text)
return RunIsInvalid();
break;
}
case Stacked::kStacked:
{
if (nullptr == m_stacked_text)
return RunIsInvalid();
if (nullptr == m_stacked_text->m_top_run)
return RunIsInvalid();
if (!m_stacked_text->m_top_run->IsValid())
return RunIsInvalid();
if (nullptr == m_stacked_text->m_bottom_run)
return RunIsInvalid();
if (!m_stacked_text->m_bottom_run->IsValid())
return RunIsInvalid();
break;
}
case Stacked::kTop:
{
if (nullptr == m_stacked_text)
return RunIsInvalid();
if (nullptr == m_stacked_text->m_top_run)
return RunIsInvalid();
if (!m_stacked_text->m_top_run->IsValid())
return RunIsInvalid();
break;
}
case Stacked::kBottom:
{
if (nullptr == m_stacked_text)
return RunIsInvalid();
if (nullptr == m_stacked_text->m_bottom_run)
return RunIsInvalid();
if (!m_stacked_text->m_bottom_run->IsValid())
return RunIsInvalid();
break;
}
}
break;
}
case RunType::kNewline:
case RunType::kParagraph:
case RunType::kSoftreturn:
{
if (!(m_run_text_height > 0.0))
return RunIsInvalid();
break;
}
default:
return RunIsInvalid();
}
return true;
}
void ON_TextRun::Internal_ContentChanged() const
{
m_text_run_hash = ON_SHA1_Hash::ZeroDigest;
m_text_run_display_hash = ON_SHA1_Hash::ZeroDigest;
}
void ON_TextRun::SetType(ON_TextRun::RunType type)
{
//if (type == ON_TextRun::RunType::kField)
// type = type;
if (m_run_type != type)
{
Internal_ContentChanged();
m_run_type = type;
}
}
ON_TextRun::RunType ON_TextRun::Type() const
{
//if (m_run_type == ON_TextRun::RunType::kField)
// int i = 2;
return m_run_type;
}
ON_TextRun::RunDirection ON_TextRun::FlowDirection() const
{
return m_direction;
}
void ON_TextRun::SetDisplayString(const wchar_t* str)
{
if (str != m_display_string.Array())
{
ON_wString local(str);
if (m_display_string != local)
{
Internal_ContentChanged();
m_display_string = local;
}
}
}
const wchar_t* ON_TextRun::DisplayString() const
{
if (m_display_string.IsEmpty())
return TextString();
else
return m_display_string.Array();
}
const wchar_t* ON_TextRun::TextString() const
{
if (m_text_string.IsEmpty())
{
if (nullptr != m_codepoints)
{
bool b = sizeof(wchar_t) == sizeof(m_codepoints[0]);
if (b)
return (const wchar_t*)m_codepoints;
size_t cplen = ON_TextRun::CodepointCount(m_codepoints);
if (0 < cplen)
ON_TextContext::ConvertCodepointsToString((int)cplen, m_codepoints, m_text_string);
}
}
return m_text_string.Array();
}
ON_TextRun::Stacked ON_TextRun::IsStacked() const
{
return m_text_stacked;
}
void ON_TextRun::SetStacked(Stacked stacked)
{
if (m_text_stacked != stacked)
{
Internal_ContentChanged();
m_text_stacked = stacked;
}
}
void ON_TextRun::SetStackedOff()
{
SetStacked(Stacked::kNone);
}
double ON_TextRun::TextHeight() const
{
return m_run_text_height;
}
void ON_TextRun::SetTextHeight(double h)
{
if(h > 0.0)
{
if (!(m_run_text_height == h))
{
Internal_ContentChanged();
m_run_text_height = h;
}
if (!(m_height_scale == -1.0))
{
Internal_ContentChanged();
m_height_scale = -1.0;
}
}
}
ON_Color ON_TextRun::Color() const
{
return m_color;
}
void ON_TextRun::SetColor(ON_Color color)
{
if (m_color != color)
{
Internal_ContentChanged();
m_color = color;
}
}
void ON_TextRun::SetFont(const ON_Font* font)
{
const ON_Font* managed_font
= (nullptr != font)
? font->ManagedFont()
: nullptr;
if (m_managed_font != managed_font)
{
Internal_ContentChanged();
m_managed_font = managed_font;
}
if (!(m_height_scale == -1.0))
{
Internal_ContentChanged();
m_height_scale = -1.0;
}
}
const ON_Font* ON_TextRun::Font() const
{
return m_managed_font;
}
const ON_BoundingBox& ON_TextRun::BoundingBox() const
{
return m_bbox;
};
void ON_TextRun::SetBoundingBox(ON_2dPoint pmin, ON_2dPoint pmax)
{
// If this function is removed and bounding box lazy evaluation
// is used, then remove m_bbox from the SHA1 hash calculation.
if (
!(m_bbox.m_min.x == pmin.x && m_bbox.m_min.y == pmin.y && 0.0 == m_bbox.m_min.z
&& m_bbox.m_max.x == pmax.x && m_bbox.m_max.y == pmax.y && 0.0 == m_bbox.m_max.z
)
)
{
Internal_ContentChanged();
m_bbox.m_min.x = pmin.x;
m_bbox.m_min.y = pmin.y;
m_bbox.m_min.z = 0.0;
m_bbox.m_max.x = pmax.x;
m_bbox.m_max.y = pmax.y;
m_bbox.m_max.z = 0.0;
}
}
const ON_2dVector& ON_TextRun::Offset() const
{
return m_offset;
}
void ON_TextRun::SetOffset(ON_2dVector offset)
{
if (!(m_offset == offset))
{
Internal_ContentChanged();
m_offset = offset;
}
}
const ON_2dVector& ON_TextRun::Advance() const
{
return m_advance;
}
void ON_TextRun::SetAdvance(ON_2dVector advance)
{
if (m_advance != advance)
{
Internal_ContentChanged();
m_advance = advance;
}
}
ON_SHA1_Hash ON_TextRun::TextRunContentHash() const
{
return TextRunContentHash(true);
}
ON_SHA1_Hash ON_TextRun::TextRunContentHash(
bool bEvaluateFields
) const
{
if (ON_SHA1_Hash::ZeroDigest == m_text_run_hash)
{
ON_SHA1 sha1;
const bool bIsStacked = (
ON_TextRun::Stacked::kStacked == IsStacked()
&& nullptr != m_stacked_text
&& this != m_stacked_text->m_top_run
&& this != m_stacked_text->m_bottom_run
&& (nullptr != m_stacked_text->m_top_run || nullptr != m_stacked_text->m_bottom_run)
);
if (nullptr != m_managed_font)
{
sha1.AccumulateSubHash(m_managed_font->FontCharacteristicsHash());
}
TextString(); // insure m_text_string is set.
sha1.AccumulateString(m_text_string);
sha1.AccumulateDouble(m_run_text_height);
if ( m_height_scale > 0.0 )
sha1.AccumulateDouble(m_height_scale);
sha1.AccumulateDouble(m_stackscale);
sha1.Accumulate2dVector(m_advance);
sha1.Accumulate2dVector(m_offset);
sha1.AccumulateDouble(m_indent);
sha1.AccumulateDouble(m_left_margin);
sha1.AccumulateDouble(m_right_margin);
sha1.AccumulateUnsigned32(static_cast<unsigned int>(m_color));
sha1.AccumulateUnsigned8(static_cast<unsigned char>(m_text_stacked));
sha1.AccumulateUnsigned8(static_cast<unsigned char>(m_run_type));
sha1.AccumulateUnsigned8(static_cast<unsigned char>(m_direction));
if ( m_bbox.IsValid() )
sha1.AccumulateBoundingBox(m_bbox);
if( bIsStacked )
{
sha1.AccumulateUnsigned32(static_cast<unsigned int>(m_stacked_text->m_separator));
if (nullptr != m_stacked_text->m_top_run)
{
sha1.AccumulateSubHash(m_stacked_text->m_top_run->TextRunContentHash(false));
}
if (nullptr != m_stacked_text->m_bottom_run)
{
sha1.AccumulateSubHash(m_stacked_text->m_bottom_run->TextRunContentHash(false));
}
}
m_text_run_hash = sha1.Hash();
if (m_display_string.IsEmpty())
{
m_text_run_display_hash = m_text_run_hash;
}
else
{
sha1.AccumulateString(m_display_string);
if( bIsStacked )
{
if (nullptr != m_stacked_text->m_top_run && m_stacked_text->m_top_run->m_display_string.IsNotEmpty() )
{
sha1.AccumulateString(m_stacked_text->m_top_run->m_display_string);
}
if (nullptr != m_stacked_text->m_bottom_run && m_stacked_text->m_bottom_run->m_display_string.IsNotEmpty() )
{
sha1.AccumulateString(m_stacked_text->m_bottom_run->m_display_string);
}
}
m_text_run_display_hash = sha1.Hash();
}
}
return
bEvaluateFields
? m_text_run_display_hash
: m_text_run_hash;
}
void ON_TextRun::SetStackFractionHeight(double stackscale)
{
if (ON_SQRT_EPSILON < stackscale && 10000.0 > stackscale)
{
if (!(m_stackscale == stackscale))
{
Internal_ContentChanged();
m_stackscale = stackscale;
}
}
}
double ON_TextRun::StackHeightFraction() const
{
return m_stackscale;
}
//static
double ON_TextRun::DefaultStackFractionHeight()
{
return 0.7;
}
void ON_TextRun::Get2dCorners(ON_2dPoint corners[4]) const
{
const ON_2dVector& offset = Offset();
corners[0].Set(m_bbox.m_min.x + offset.x, m_bbox.m_min.y + offset.y);
corners[1].Set(m_bbox.m_max.x + offset.x, m_bbox.m_min.y + offset.y);
corners[2].Set(m_bbox.m_max.x + offset.x, m_bbox.m_max.y + offset.y);
corners[3].Set(m_bbox.m_min.x + offset.x, m_bbox.m_max.y + offset.y);
}
// This returns the scale of run.m_height(the wcs text height) / HeightOfI. to
// convert from font native units to model units.
// It doesn't take into account anything about annotation scaling
double ON_TextRun::HeightScale(const ON_Font* font) const
{
if(m_height_scale <= 0.0)
{
if (0 != font)
const_cast< ON_TextRun* >(this)->m_height_scale = font->FontMetrics().GlyphScale(m_run_text_height);
}
return m_height_scale;
}
// Does not include terminating 0
// static
size_t ON_TextRun::CodepointCount(const ON__UINT32* cp)
{
if (0 == cp)