forked from Kitware/VTK
-
Notifications
You must be signed in to change notification settings - Fork 0
/
vtkStringArray.cxx
1001 lines (875 loc) · 26.8 KB
/
vtkStringArray.cxx
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
/*=========================================================================
Program: Visualization Toolkit
Module: vtkStringArray.cxx
Language: C++
Copyright 2004 Sandia Corporation.
Under the terms of Contract DE-AC04-94AL85000, there is a non-exclusive
license for use of this work by or on behalf of the
U.S. Government. Redistribution and use in source and binary forms, with
or without modification, are permitted provided that this Notice and any
statement of authorship are reproduced on all copies.
=========================================================================*/
// We do not provide a definition for the copy constructor or
// operator=. Block the warning.
#ifdef _MSC_VER
#pragma warning(disable : 4661)
#endif
#include "vtkStdString.h"
#include "vtkStringArray.h"
#include "vtkArrayIteratorTemplate.h"
#include "vtkCharArray.h"
#include "vtkIdList.h"
#include "vtkIdTypeArray.h"
#include "vtkObjectFactory.h"
#include "vtkSortDataArray.h"
#include <algorithm>
#include <map>
#include <utility>
#include <vector>
// Map containing updates to a vtkStringArray that have occurred
// since we last build the vtkStringArrayLookup.
typedef std::multimap<vtkStdString, vtkIdType> vtkStringCachedUpdates;
namespace
{
auto DefaultDeleteFunction = [](void* ptr) { delete[] reinterpret_cast<vtkStdString*>(ptr); };
}
//------------------------------------------------------------------------------
class vtkStringArrayLookup
{
public:
vtkStringArrayLookup()
: Rebuild(true)
{
this->SortedArray = nullptr;
this->IndexArray = nullptr;
}
~vtkStringArrayLookup()
{
if (this->SortedArray)
{
this->SortedArray->Delete();
this->SortedArray = nullptr;
}
if (this->IndexArray)
{
this->IndexArray->Delete();
this->IndexArray = nullptr;
}
}
vtkStringArray* SortedArray;
vtkIdList* IndexArray;
vtkStringCachedUpdates CachedUpdates;
bool Rebuild;
};
vtkStandardNewMacro(vtkStringArray);
vtkStandardExtendedNewMacro(vtkStringArray);
//------------------------------------------------------------------------------
vtkStringArray::vtkStringArray()
{
this->Array = nullptr;
this->DeleteFunction = DefaultDeleteFunction;
this->Lookup = nullptr;
}
//------------------------------------------------------------------------------
vtkStringArray::~vtkStringArray()
{
if (this->DeleteFunction)
{
this->DeleteFunction(this->Array);
}
delete this->Lookup;
}
//------------------------------------------------------------------------------
vtkArrayIterator* vtkStringArray::NewIterator()
{
vtkArrayIteratorTemplate<vtkStdString>* iter = vtkArrayIteratorTemplate<vtkStdString>::New();
iter->Initialize(this);
return iter;
}
//------------------------------------------------------------------------------
// This method lets the user specify data to be held by the array. The
// array argument is a pointer to the data. size is the size of
// the array supplied by the user. Set save to 1 to keep the class
// from deleting the array when it cleans up or reallocates memory.
// The class uses the actual array provided; it does not copy the data
// from the suppled array.
void vtkStringArray::SetArray(vtkStdString* array, vtkIdType size, int save, int deleteMethod)
{
if (this->Array && this->DeleteFunction)
{
vtkDebugMacro(<< "Deleting the array...");
this->DeleteFunction(this->Array);
}
else
{
vtkDebugMacro(<< "Warning, array not deleted, but will point to new array.");
}
vtkDebugMacro(<< "Setting array to: " << array);
this->Array = array;
this->Size = size;
this->MaxId = size - 1;
if (save != 0)
{
this->DeleteFunction = nullptr;
}
else if (deleteMethod == VTK_DATA_ARRAY_DELETE || deleteMethod == VTK_DATA_ARRAY_USER_DEFINED)
{
this->DeleteFunction = DefaultDeleteFunction;
}
else if (deleteMethod == VTK_DATA_ARRAY_ALIGNED_FREE)
{
#ifdef _WIN32
this->DeleteFunction = _aligned_free;
#else
this->DeleteFunction = free;
#endif
}
else if (deleteMethod == VTK_DATA_ARRAY_FREE)
{
this->DeleteFunction = free;
}
this->DataChanged();
}
//------------------------------------------------------------------------------
void vtkStringArray::SetArrayFreeFunction(void (*callback)(void*))
{
this->DeleteFunction = callback;
}
//------------------------------------------------------------------------------
// Allocate memory for this array. Delete old storage only if necessary.
vtkTypeBool vtkStringArray::Allocate(vtkIdType sz, vtkIdType)
{
if (sz > this->Size)
{
if (this->DeleteFunction)
{
this->DeleteFunction(this->Array);
}
this->Size = (sz > 0 ? sz : 1);
this->Array = new vtkStdString[this->Size];
if (!this->Array)
{
return 0;
}
this->DeleteFunction = DefaultDeleteFunction;
}
this->MaxId = -1;
this->DataChanged();
return 1;
}
//------------------------------------------------------------------------------
// Release storage and reset array to initial state.
void vtkStringArray::Initialize()
{
if (this->DeleteFunction)
{
this->DeleteFunction(this->Array);
}
this->Array = nullptr;
this->Size = 0;
this->MaxId = -1;
this->DeleteFunction = DefaultDeleteFunction;
this->DataChanged();
}
//------------------------------------------------------------------------------
// Deep copy of another string array.
void vtkStringArray::DeepCopy(vtkAbstractArray* aa)
{
// Do nothing on a nullptr input.
if (!aa)
{
return;
}
// Avoid self-copy.
if (this == aa)
{
return;
}
// If data type does not match, we can't copy.
if (aa->GetDataType() != this->GetDataType())
{
vtkErrorMacro(<< "Incompatible types: tried to copy an array of type "
<< aa->GetDataTypeAsString() << " into a string array ");
return;
}
vtkStringArray* fa = vtkArrayDownCast<vtkStringArray>(aa);
if (fa == nullptr)
{
vtkErrorMacro(<< "Shouldn't Happen: Couldn't downcast array into a vtkStringArray.");
return;
}
// Free our previous memory.
if (this->DeleteFunction)
{
this->DeleteFunction(this->Array);
}
this->Superclass::DeepCopy(aa); // copy information objects.
// Copy the given array into new memory.
this->NumberOfComponents = aa->GetNumberOfComponents();
this->MaxId = fa->GetMaxId();
this->Size = fa->GetSize();
this->DeleteFunction = DefaultDeleteFunction;
this->Array = new vtkStdString[this->Size];
for (int i = 0; i < this->Size; ++i)
{
this->Array[i] = fa->Array[i];
}
this->DataChanged();
}
//------------------------------------------------------------------------------
// Interpolate array value from other array value given the
// indices and associated interpolation weights.
// This method assumes that the two arrays are of the same time.
void vtkStringArray::InterpolateTuple(
vtkIdType i, vtkIdList* ptIndices, vtkAbstractArray* source, double* weights)
{
if (this->GetDataType() != source->GetDataType())
{
vtkErrorMacro("Cannot CopyValue from array of type " << source->GetDataTypeAsString());
return;
}
if (ptIndices->GetNumberOfIds() == 0)
{
// nothing to do.
return;
}
// We use nearest neighbour for interpolating strings.
// First determine which is the nearest neighbour using the weights-
// it's the index with maximum weight.
vtkIdType nearest = ptIndices->GetId(0);
double max_weight = weights[0];
for (int k = 1; k < ptIndices->GetNumberOfIds(); k++)
{
if (weights[k] > max_weight)
{
nearest = ptIndices->GetId(k);
max_weight = weights[k];
}
}
this->InsertTuple(i, nearest, source);
}
//------------------------------------------------------------------------------
// Interpolate value from the two values, p1 and p2, and an
// interpolation factor, t. The interpolation factor ranges from (0,1),
// with t=0 located at p1. This method assumes that the three arrays are of
// the same type. p1 is value at index id1 in fromArray1, while, p2 is
// value at index id2 in fromArray2.
void vtkStringArray::InterpolateTuple(vtkIdType i, vtkIdType id1, vtkAbstractArray* source1,
vtkIdType id2, vtkAbstractArray* source2, double t)
{
if (source1->GetDataType() != VTK_STRING || source2->GetDataType() != VTK_STRING)
{
vtkErrorMacro("All arrays to InterpolateValue() must be of same type.");
return;
}
if (t >= 0.5)
{
// Use p2
this->InsertTuple(i, id2, source2);
}
else
{
// Use p1.
this->InsertTuple(i, id1, source1);
}
}
//------------------------------------------------------------------------------
void vtkStringArray::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os, indent);
if (this->Array)
{
os << indent << "Array: " << this->Array << "\n";
}
else
{
os << indent << "Array: (null)\n";
}
}
//------------------------------------------------------------------------------
// Protected function does "reallocate"
vtkStdString* vtkStringArray::ResizeAndExtend(vtkIdType sz)
{
vtkStdString* newArray;
vtkIdType newSize;
if (sz > this->Size)
{
// Requested size is bigger than current size. Allocate enough
// memory to fit the requested size and be more than double the
// currently allocated memory.
newSize = (this->Size + 1) + sz;
}
else if (sz == this->Size)
{
// Requested size is equal to current size. Do nothing.
return this->Array;
}
else
{
// Requested size is smaller than current size. Squeeze the
// memory.
newSize = sz;
}
if (newSize <= 0)
{
this->Initialize();
return nullptr;
}
newArray = new vtkStdString[newSize];
if (!newArray)
{
vtkErrorMacro("Cannot allocate memory\n");
return nullptr;
}
if (this->Array)
{
// can't use memcpy here
vtkIdType numCopy = (newSize < this->Size ? newSize : this->Size);
for (vtkIdType i = 0; i < numCopy; ++i)
{
newArray[i] = this->Array[i];
}
if (this->DeleteFunction)
{
this->DeleteFunction(this->Array);
}
}
if (newSize < this->Size)
{
this->MaxId = newSize - 1;
}
this->Size = newSize;
this->Array = newArray;
this->DeleteFunction = DefaultDeleteFunction;
this->DataChanged();
return this->Array;
}
//------------------------------------------------------------------------------
vtkTypeBool vtkStringArray::Resize(vtkIdType sz)
{
vtkStdString* newArray;
vtkIdType newSize = sz * this->NumberOfComponents;
if (newSize == this->Size)
{
return 1;
}
if (newSize <= 0)
{
this->Initialize();
return 1;
}
newArray = new vtkStdString[newSize];
if (!newArray)
{
vtkErrorMacro(<< "Cannot allocate memory\n");
return 0;
}
if (this->Array)
{
vtkIdType numCopy = (newSize < this->Size ? newSize : this->Size);
for (vtkIdType i = 0; i < numCopy; ++i)
{
newArray[i] = this->Array[i];
}
if (this->DeleteFunction)
{
this->DeleteFunction = DefaultDeleteFunction;
this->DeleteFunction(this->Array);
}
}
if (newSize < this->Size)
{
this->MaxId = newSize - 1;
}
this->Size = newSize;
this->Array = newArray;
this->DeleteFunction = DefaultDeleteFunction;
this->DataChanged();
return 1;
}
//------------------------------------------------------------------------------
vtkStdString* vtkStringArray::WritePointer(vtkIdType id, vtkIdType number)
{
vtkIdType newSize = id + number;
if (newSize > this->Size)
{
this->ResizeAndExtend(newSize);
}
if ((--newSize) > this->MaxId)
{
this->MaxId = newSize;
}
this->DataChanged();
return this->Array + id;
}
//------------------------------------------------------------------------------
void vtkStringArray::InsertValue(vtkIdType id, vtkStdString f)
{
if (id >= this->Size)
{
if (!this->ResizeAndExtend(id + 1))
{
return;
}
}
this->Array[id] = f;
if (id > this->MaxId)
{
this->MaxId = id;
}
this->DataElementChanged(id);
}
//------------------------------------------------------------------------------
vtkIdType vtkStringArray::InsertNextValue(vtkStdString f)
{
this->InsertValue(++this->MaxId, f);
this->DataElementChanged(this->MaxId);
return this->MaxId;
}
//------------------------------------------------------------------------------
int vtkStringArray::GetDataTypeSize() const
{
return static_cast<int>(sizeof(vtkStdString));
}
//------------------------------------------------------------------------------
unsigned long vtkStringArray::GetActualMemorySize() const
{
size_t totalSize = 0;
size_t numPrims = static_cast<size_t>(this->GetSize());
for (size_t i = 0; i < numPrims; ++i)
{
totalSize += sizeof(vtkStdString);
totalSize += this->Array[i].size() * sizeof(vtkStdString::value_type);
}
return static_cast<unsigned long>(ceil(static_cast<double>(totalSize) / 1024.0)); // kibibytes
}
//------------------------------------------------------------------------------
vtkIdType vtkStringArray::GetDataSize() const
{
size_t size = 0;
size_t numStrs = static_cast<size_t>(this->GetMaxId() + 1);
for (size_t i = 0; i < numStrs; i++)
{
size += this->Array[i].size() + 1;
// (+1) for termination character.
}
return static_cast<vtkIdType>(size);
}
//------------------------------------------------------------------------------
// Set the tuple at the ith location using the jth tuple in the source array.
// This method assumes that the two arrays have the same type
// and structure. Note that range checking and memory allocation is not
// performed; use in conjunction with SetNumberOfTuples() to allocate space.
void vtkStringArray::SetTuple(vtkIdType i, vtkIdType j, vtkAbstractArray* source)
{
vtkStringArray* sa = vtkArrayDownCast<vtkStringArray>(source);
if (!sa)
{
vtkWarningMacro("Input and outputs array data types do not match.");
return;
}
vtkIdType loci = i * this->NumberOfComponents;
vtkIdType locj = j * sa->GetNumberOfComponents();
for (vtkIdType cur = 0; cur < this->NumberOfComponents; cur++)
{
this->SetValue(loci + cur, sa->GetValue(locj + cur));
}
this->DataChanged();
}
//------------------------------------------------------------------------------
// Insert the jth tuple in the source array, at ith location in this array.
// Note that memory allocation is performed as necessary to hold the data.
void vtkStringArray::InsertTuple(vtkIdType i, vtkIdType j, vtkAbstractArray* source)
{
vtkStringArray* sa = vtkArrayDownCast<vtkStringArray>(source);
if (!sa)
{
vtkWarningMacro("Input and outputs array data types do not match.");
return;
}
vtkIdType loci = i * this->NumberOfComponents;
vtkIdType locj = j * sa->GetNumberOfComponents();
for (vtkIdType cur = 0; cur < this->NumberOfComponents; cur++)
{
this->InsertValue(loci + cur, sa->GetValue(locj + cur));
}
this->DataChanged();
}
//------------------------------------------------------------------------------
void vtkStringArray::InsertTuples(vtkIdList* dstIds, vtkIdList* srcIds, vtkAbstractArray* source)
{
vtkStringArray* sa = vtkArrayDownCast<vtkStringArray>(source);
if (!sa)
{
vtkWarningMacro("Input and outputs array data types do not match.");
return;
}
if (this->NumberOfComponents != source->GetNumberOfComponents())
{
vtkWarningMacro("Input and output component sizes do not match.");
return;
}
vtkIdType numIds = dstIds->GetNumberOfIds();
if (srcIds->GetNumberOfIds() != numIds)
{
vtkWarningMacro("Input and output id array sizes do not match.");
return;
}
for (vtkIdType idIndex = 0; idIndex < numIds; ++idIndex)
{
vtkIdType numComp = this->NumberOfComponents;
vtkIdType srcLoc = srcIds->GetId(idIndex) * this->NumberOfComponents;
vtkIdType dstLoc = dstIds->GetId(idIndex) * this->NumberOfComponents;
while (numComp-- > 0)
{
this->InsertValue(dstLoc++, sa->GetValue(srcLoc++));
}
}
this->DataChanged();
}
//------------------------------------------------------------------------------
void vtkStringArray::InsertTuples(
vtkIdType dstStart, vtkIdType n, vtkIdType srcStart, vtkAbstractArray* source)
{
vtkStringArray* sa = vtkArrayDownCast<vtkStringArray>(source);
if (!sa)
{
vtkWarningMacro("Input and outputs array data types do not match.");
return;
}
if (this->NumberOfComponents != source->GetNumberOfComponents())
{
vtkWarningMacro("Input and output component sizes do not match.");
return;
}
vtkIdType srcEnd = srcStart + n;
if (srcEnd > source->GetNumberOfTuples())
{
vtkWarningMacro("Source range exceeds array size (srcStart="
<< srcStart << ", n=" << n << ", numTuples=" << source->GetNumberOfTuples() << ").");
return;
}
for (vtkIdType i = 0; i < n; ++i)
{
vtkIdType numComp = this->NumberOfComponents;
vtkIdType srcLoc = (srcStart + i) * this->NumberOfComponents;
vtkIdType dstLoc = (dstStart + i) * this->NumberOfComponents;
while (numComp-- > 0)
{
this->InsertValue(dstLoc++, sa->GetValue(srcLoc++));
}
}
this->DataChanged();
}
//------------------------------------------------------------------------------
// Insert the jth tuple in the source array, at the end in this array.
// Note that memory allocation is performed as necessary to hold the data.
// Returns the location at which the data was inserted.
vtkIdType vtkStringArray::InsertNextTuple(vtkIdType j, vtkAbstractArray* source)
{
vtkStringArray* sa = vtkArrayDownCast<vtkStringArray>(source);
if (!sa)
{
vtkWarningMacro("Input and outputs array data types do not match.");
return -1;
}
vtkIdType locj = j * sa->GetNumberOfComponents();
for (vtkIdType cur = 0; cur < this->NumberOfComponents; cur++)
{
this->InsertNextValue(sa->GetValue(locj + cur));
}
this->DataChanged();
return (this->GetNumberOfTuples() - 1);
}
//------------------------------------------------------------------------------
const vtkStdString& vtkStringArray::GetValue(vtkIdType id) const
{
return this->Array[id];
}
vtkStdString& vtkStringArray::GetValue(vtkIdType id)
{
return this->Array[id];
}
//------------------------------------------------------------------------------
void vtkStringArray::GetTuples(vtkIdList* indices, vtkAbstractArray* aa)
{
if (aa == nullptr)
{
vtkErrorMacro(<< "GetTuples: Output array is null!");
return;
}
vtkStringArray* output = vtkArrayDownCast<vtkStringArray>(aa);
if (output == nullptr)
{
vtkErrorMacro(<< "Can't copy values from a string array into an array "
<< "of type " << aa->GetDataTypeAsString());
return;
}
for (vtkIdType i = 0; i < indices->GetNumberOfIds(); ++i)
{
vtkIdType index = indices->GetId(i);
output->SetValue(i, this->GetValue(index));
}
}
//------------------------------------------------------------------------------
void vtkStringArray::GetTuples(vtkIdType startIndex, vtkIdType endIndex, vtkAbstractArray* aa)
{
if (aa == nullptr)
{
vtkErrorMacro(<< "GetTuples: Output array is null!");
return;
}
vtkStringArray* output = vtkArrayDownCast<vtkStringArray>(aa);
if (output == nullptr)
{
vtkErrorMacro(<< "Can't copy values from a string array into an array "
<< "of type " << aa->GetDataTypeAsString());
return;
}
for (vtkIdType i = 0; i < (endIndex - startIndex) + 1; ++i)
{
vtkIdType index = startIndex + i;
output->SetValue(i, this->GetValue(index));
}
}
//------------------------------------------------------------------------------
void vtkStringArray::UpdateLookup()
{
if (!this->Lookup)
{
this->Lookup = new vtkStringArrayLookup();
this->Lookup->SortedArray = vtkStringArray::New();
this->Lookup->IndexArray = vtkIdList::New();
}
if (this->Lookup->Rebuild)
{
int numComps = this->GetNumberOfComponents();
vtkIdType numTuples = this->GetNumberOfTuples();
this->Lookup->SortedArray->Initialize();
this->Lookup->SortedArray->SetNumberOfComponents(numComps);
this->Lookup->SortedArray->SetNumberOfTuples(numTuples);
this->Lookup->IndexArray->SetNumberOfIds(numComps * numTuples);
std::vector<std::pair<vtkStdString, vtkIdType>> v;
for (vtkIdType i = 0; i < numComps * numTuples; i++)
{
v.emplace_back(this->Array[i], i);
}
std::sort(v.begin(), v.end());
for (vtkIdType i = 0; i < numComps * numTuples; i++)
{
this->Lookup->SortedArray->SetValue(i, v[i].first);
this->Lookup->IndexArray->SetId(i, v[i].second);
}
this->Lookup->Rebuild = false;
this->Lookup->CachedUpdates.clear();
}
}
//------------------------------------------------------------------------------
vtkIdType vtkStringArray::LookupValue(vtkVariant var)
{
return this->LookupValue(var.ToString());
}
//------------------------------------------------------------------------------
void vtkStringArray::LookupValue(vtkVariant var, vtkIdList* ids)
{
this->LookupValue(var.ToString(), ids);
}
//------------------------------------------------------------------------------
vtkIdType vtkStringArray::LookupValue(const vtkStdString& value)
{
this->UpdateLookup();
// First look into the cached updates, to see if there were any
// cached changes. Find an equivalent element in the set of cached
// indices for this value. Some of the indices may have changed
// values since the cache was built, so we need to do this equality
// check.
typedef vtkStringCachedUpdates::iterator CacheIterator;
CacheIterator cached = this->Lookup->CachedUpdates.lower_bound(value),
cachedEnd = this->Lookup->CachedUpdates.end();
while (cached != cachedEnd)
{
// Check that we are still in the same equivalence class as the
// value.
if (value == cached->first)
{
// Check that the value in the original array hasn't changed.
vtkStdString currentValue = this->GetValue(cached->second);
if (value == currentValue)
{
return cached->second;
}
}
else
{
break;
}
++cached;
}
int numComps = this->Lookup->SortedArray->GetNumberOfComponents();
vtkIdType numTuples = this->Lookup->SortedArray->GetNumberOfTuples();
vtkStdString* ptr = this->Lookup->SortedArray->GetPointer(0);
vtkStdString* ptrEnd = ptr + numComps * numTuples;
vtkStdString* found = std::lower_bound(ptr, ptrEnd, value);
// Find an index with a matching value. Non-matching values might
// show up here when the underlying value at that index has been
// changed (so the sorted array is out-of-date).
vtkIdType offset = static_cast<vtkIdType>(found - ptr);
while (found != ptrEnd)
{
// Check whether we still have a value equivalent to what we're
// looking for.
if (value == *found)
{
// Check that the value in the original array hasn't changed.
vtkIdType index = this->Lookup->IndexArray->GetId(offset);
vtkStdString currentValue = this->GetValue(index);
if (value == currentValue)
{
return index;
}
}
else
{
break;
}
++found;
++offset;
}
return -1;
}
//------------------------------------------------------------------------------
void vtkStringArray::LookupValue(const vtkStdString& value, vtkIdList* ids)
{
this->UpdateLookup();
ids->Reset();
// First look into the cached updates, to see if there were any
// cached changes. Find an equivalent element in the set of cached
// indices for this value. Some of the indices may have changed
// values since the cache was built, so we need to do this equality
// check.
typedef vtkStringCachedUpdates::iterator CacheIterator;
std::pair<CacheIterator, CacheIterator> cached = this->Lookup->CachedUpdates.equal_range(value);
while (cached.first != cached.second)
{
// Check that the value in the original array hasn't changed.
vtkStdString currentValue = this->GetValue(cached.first->second);
if (cached.first->first == currentValue)
{
ids->InsertNextId(cached.first->second);
}
++cached.first;
}
// Perform a binary search of the sorted array using STL equal_range.
int numComps = this->GetNumberOfComponents();
vtkIdType numTuples = this->GetNumberOfTuples();
vtkStdString* ptr = this->Lookup->SortedArray->GetPointer(0);
std::pair<vtkStdString*, vtkStdString*> found =
std::equal_range(ptr, ptr + numComps * numTuples, value);
// Add the indices of the found items to the ID list.
vtkIdType offset = static_cast<vtkIdType>(found.first - ptr);
while (found.first != found.second)
{
// Check that the value in the original array hasn't changed.
vtkIdType index = this->Lookup->IndexArray->GetId(offset);
vtkStdString currentValue = this->GetValue(index);
if (*found.first == currentValue)
{
ids->InsertNextId(index);
}
++found.first;
++offset;
}
}
//------------------------------------------------------------------------------
void vtkStringArray::DataChanged()
{
if (this->Lookup)
{
this->Lookup->Rebuild = true;
}
}
//------------------------------------------------------------------------------
void vtkStringArray::DataElementChanged(vtkIdType id)
{
if (this->Lookup)
{
if (this->Lookup->Rebuild)
{
// We're already going to rebuild the lookup table. Do nothing.
return;
}
if (this->Lookup->CachedUpdates.size() > static_cast<size_t>(this->GetNumberOfTuples() / 10))
{
// At this point, just rebuild the full table.
this->Lookup->Rebuild = true;
}
else
{
// Insert this change into the set of cached updates
std::pair<const vtkStdString, vtkIdType> value(this->GetValue(id), id);
this->Lookup->CachedUpdates.insert(value);
}
}
}
//------------------------------------------------------------------------------
void vtkStringArray::ClearLookup()
{
delete this->Lookup;
this->Lookup = nullptr;
}
//------------------------------------------------------------------------------
//
//
// Below here are interface methods to allow values to be inserted as
// const char * instead of vtkStdString. Yes, they're trivial. The
// wrapper code needs them.
//
//
void vtkStringArray::SetValue(vtkIdType id, const char* value)
{
if (value)
{
this->SetValue(id, vtkStdString(value));
}
}
void vtkStringArray::InsertValue(vtkIdType id, const char* value)
{
if (value)
{
this->InsertValue(id, vtkStdString(value));
}
}
void vtkStringArray::SetVariantValue(vtkIdType id, vtkVariant value)
{
this->SetValue(id, value.ToString());
}
void vtkStringArray::InsertVariantValue(vtkIdType id, vtkVariant value)
{
this->InsertValue(id, value.ToString());
}
vtkIdType vtkStringArray::InsertNextValue(const char* value)
{
if (value)
{
return this->InsertNextValue(vtkStdString(value));
}
return this->MaxId;
}
vtkIdType vtkStringArray::LookupValue(const char* value)
{
if (value)
{
return this->LookupValue(vtkStdString(value));
}
return -1;
}
void vtkStringArray::LookupValue(const char* value, vtkIdList* ids)
{
if (value)
{
this->LookupValue(vtkStdString(value), ids);
return;
}
ids->Reset();
}