-
-
Notifications
You must be signed in to change notification settings - Fork 736
/
usettest.cpp
4491 lines (4042 loc) · 157 KB
/
usettest.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
// © 2016 and later: Unicode, Inc. and others.
// License & terms of use: http://www.unicode.org/copyright.html
/*
********************************************************************************
* Copyright (C) 1999-2016 International Business Machines Corporation and
* others. All Rights Reserved.
********************************************************************************
* Date Name Description
* 10/20/99 alan Creation.
* 03/22/2000 Madhu Added additional tests
********************************************************************************
*/
#include <stdio.h>
#include <string.h>
#include <string_view>
#include <unordered_map>
#include "unicode/utypes.h"
#include "usettest.h"
#include "unicode/ucnv.h"
#include "unicode/uniset.h"
#include "unicode/uchar.h"
#include "unicode/usetiter.h"
#include "unicode/ustring.h"
#include "unicode/parsepos.h"
#include "unicode/symtable.h"
#include "unicode/utf8.h"
#include "unicode/utf16.h"
#include "unicode/uversion.h"
#include "cmemory.h"
#include "hash.h"
#define TEST_ASSERT_SUCCESS(status) UPRV_BLOCK_MACRO_BEGIN { \
if (U_FAILURE(status)) { \
dataerrln("fail in file \"%s\", line %d: \"%s\"", __FILE__, __LINE__, \
u_errorName(status)); \
} \
} UPRV_BLOCK_MACRO_END
#define TEST_ASSERT(expr) UPRV_BLOCK_MACRO_BEGIN { \
if (!(expr)) { \
dataerrln("fail in file \"%s\", line %d", __FILE__, __LINE__); \
} \
} UPRV_BLOCK_MACRO_END
UnicodeString operator+(const UnicodeString& left, const UnicodeSet& set) {
UnicodeString pat;
set.toPattern(pat);
return left + UnicodeSetTest::escape(pat);
}
UnicodeSetTest::UnicodeSetTest() : utf8Cnv(nullptr) {
}
UConverter *UnicodeSetTest::openUTF8Converter() {
if(utf8Cnv==nullptr) {
UErrorCode errorCode=U_ZERO_ERROR;
utf8Cnv=ucnv_open("UTF-8", &errorCode);
}
return utf8Cnv;
}
UnicodeSetTest::~UnicodeSetTest() {
ucnv_close(utf8Cnv);
}
void
UnicodeSetTest::runIndexedTest(int32_t index, UBool exec,
const char* &name, char* /*par*/) {
if (exec) {
logln(u"TestSuite UnicodeSetTest");
}
TESTCASE_AUTO_BEGIN;
TESTCASE_AUTO(TestPatterns);
TESTCASE_AUTO(TestAddRemove);
TESTCASE_AUTO(TestCategories);
TESTCASE_AUTO(TestCloneEqualHash);
TESTCASE_AUTO(TestMinimalRep);
TESTCASE_AUTO(TestAPI);
TESTCASE_AUTO(TestScriptSet);
TESTCASE_AUTO(TestPropertySet);
TESTCASE_AUTO(TestClone);
TESTCASE_AUTO(TestExhaustive);
TESTCASE_AUTO(TestToPattern);
TESTCASE_AUTO(TestIndexOf);
TESTCASE_AUTO(TestStrings);
TESTCASE_AUTO(Testj2268);
TESTCASE_AUTO(TestCloseOver);
TESTCASE_AUTO(TestCloseOverSimpleCaseFolding);
TESTCASE_AUTO(TestCloseOverLargeSets);
TESTCASE_AUTO(TestEscapePattern);
TESTCASE_AUTO(TestInvalidCodePoint);
TESTCASE_AUTO(TestSymbolTable);
TESTCASE_AUTO(TestSurrogate);
TESTCASE_AUTO(TestPosixClasses);
TESTCASE_AUTO(TestIteration);
TESTCASE_AUTO(TestFreezable);
TESTCASE_AUTO(TestSpan);
TESTCASE_AUTO(TestStringSpan);
TESTCASE_AUTO(TestPatternWithSurrogates);
TESTCASE_AUTO(TestIntOverflow);
TESTCASE_AUTO(TestUnusedCcc);
TESTCASE_AUTO(TestDeepPattern);
TESTCASE_AUTO(TestEmptyString);
TESTCASE_AUTO(TestSkipToStrings);
TESTCASE_AUTO(TestPatternCodePointComplement);
TESTCASE_AUTO(TestCodePointIterator);
TESTCASE_AUTO(TestUSetCodePointIterator);
TESTCASE_AUTO(TestRangeIterator);
TESTCASE_AUTO(TestUSetRangeIterator);
TESTCASE_AUTO(TestStringIterator);
TESTCASE_AUTO(TestUSetStringIterator);
TESTCASE_AUTO(TestElementIterator);
TESTCASE_AUTO(TestUSetElementIterator);
TESTCASE_AUTO_END;
}
static const char NOT[] = "%%%%";
/**
* UVector was improperly copying contents
* This code will crash this is still true
*/
void UnicodeSetTest::Testj2268() {
UnicodeSet t;
t.add(UnicodeString("abc"));
UnicodeSet test(t);
UnicodeString ustrPat;
test.toPattern(ustrPat, true);
}
/**
* Test toPattern().
*/
void UnicodeSetTest::TestToPattern() {
UErrorCode ec = U_ZERO_ERROR;
// Test that toPattern() round trips with syntax characters and
// whitespace.
{
static const char* OTHER_TOPATTERN_TESTS[] = {
"[[:latin:]&[:greek:]]",
"[[:latin:]-[:greek:]]",
"[:nonspacing mark:]",
nullptr
};
for (int32_t j=0; OTHER_TOPATTERN_TESTS[j]!=nullptr; ++j) {
ec = U_ZERO_ERROR;
UnicodeSet s(OTHER_TOPATTERN_TESTS[j], ec);
if (U_FAILURE(ec)) {
dataerrln(UnicodeString("FAIL: bad pattern ") + OTHER_TOPATTERN_TESTS[j] + " - " + UnicodeString(u_errorName(ec)));
continue;
}
checkPat(OTHER_TOPATTERN_TESTS[j], s);
}
for (UChar32 i = 0; i <= 0x10FFFF; ++i) {
if ((i <= 0xFF && !u_isalpha(i)) || u_isspace(i)) {
// check various combinations to make sure they all work.
if (i != 0 && !toPatternAux(i, i)){
continue;
}
if (!toPatternAux(0, i)){
continue;
}
if (!toPatternAux(i, 0xFFFF)){
continue;
}
}
}
}
// Test pattern behavior of multicharacter strings.
{
ec = U_ZERO_ERROR;
UnicodeSet* s = new UnicodeSet("[a-z {aa} {ab}]", ec);
// This loop isn't a loop. It's here to make the compiler happy.
// If you're curious, try removing it and changing the 'break'
// statements (except for the last) to goto's.
for (;;) {
if (U_FAILURE(ec)) break;
const char* exp1[] = {"aa", "ab", NOT, "ac", nullptr};
expectToPattern(*s, "[a-z{aa}{ab}]", exp1);
s->add("ac");
const char* exp2[] = {"aa", "ab", "ac", NOT, "xy", nullptr};
expectToPattern(*s, "[a-z{aa}{ab}{ac}]", exp2);
s->applyPattern(u"[a-z {\\{l} {r\\}}]", ec);
if (U_FAILURE(ec)) break;
const char* exp3[] = {"{l", "r}", NOT, "xy", nullptr};
expectToPattern(*s, u"[a-z{r\\}}{\\{l}]", exp3);
s->add("[]");
const char* exp4[] = {"{l", "r}", "[]", NOT, "xy", nullptr};
expectToPattern(*s, u"[a-z{\\[\\]}{r\\}}{\\{l}]", exp4);
s->applyPattern(u"[a-z {\\u4E01\\u4E02}{\\n\\r}]", ec);
if (U_FAILURE(ec)) break;
const char* exp5[] = {"\\u4E01\\u4E02", "\n\r", nullptr};
expectToPattern(*s, u"[a-z{\\u000A\\u000D}{\\u4E01\\u4E02}]", exp5);
// j2189
s->clear();
s->add(UnicodeString("abc", ""));
s->add(UnicodeString("abc", ""));
const char* exp6[] = {"abc", NOT, "ab", nullptr};
expectToPattern(*s, "[{abc}]", exp6);
break;
}
if (U_FAILURE(ec)) errln("FAIL: pattern parse error");
delete s;
}
// JB#3400: For 2 character ranges prefer [ab] to [a-b]
UnicodeSet s;
s.add(u'a', u'b');
expectToPattern(s, "[ab]", nullptr);
}
UBool UnicodeSetTest::toPatternAux(UChar32 start, UChar32 end) {
// use Integer.toString because Utility.hex doesn't handle ints
UnicodeString pat = "";
// TODO do these in hex
//String source = "0x" + Integer.toString(start,16).toUpperCase();
//if (start != end) source += "..0x" + Integer.toString(end,16).toUpperCase();
UnicodeString source;
source = source + static_cast<uint32_t>(start);
if (start != end)
source = source + ".." + static_cast<uint32_t>(end);
UnicodeSet testSet;
testSet.add(start, end);
return checkPat(source, testSet);
}
UBool UnicodeSetTest::checkPat(const UnicodeString& source,
const UnicodeSet& testSet) {
// What we want to make sure of is that a pattern generated
// by toPattern(), with or without escaped unprintables, can
// be passed back into the UnicodeSet constructor.
UnicodeString pat0;
testSet.toPattern(pat0, true);
if (!checkPat(source + " (escaped)", testSet, pat0)) return false;
//String pat1 = unescapeLeniently(pat0);
//if (!checkPat(source + " (in code)", testSet, pat1)) return false;
UnicodeString pat2;
testSet.toPattern(pat2, false);
if (!checkPat(source, testSet, pat2)) return false;
//String pat3 = unescapeLeniently(pat2);
// if (!checkPat(source + " (in code)", testSet, pat3)) return false;
//logln(source + " => " + pat0 + ", " + pat1 + ", " + pat2 + ", " + pat3);
logln(UnicodeString(source) + " => " + pat0 + ", " + pat2);
return true;
}
UBool UnicodeSetTest::checkPat(const UnicodeString& source,
const UnicodeSet& testSet,
const UnicodeString& pat) {
UErrorCode ec = U_ZERO_ERROR;
UnicodeSet testSet2(pat, ec);
if (testSet2 != testSet) {
errln(UnicodeString("Fail toPattern: ") + source + " => " + pat);
return false;
}
return true;
}
void
UnicodeSetTest::TestPatterns() {
UnicodeSet set;
expectPattern(set, UnicodeString("[[a-m]&[d-z]&[k-y]]", ""), "km");
expectPattern(set, UnicodeString("[[a-z]-[m-y]-[d-r]]", ""), "aczz");
expectPattern(set, UnicodeString("[a\\-z]", ""), "--aazz");
expectPattern(set, UnicodeString("[-az]", ""), "--aazz");
expectPattern(set, UnicodeString("[az-]", ""), "--aazz");
expectPattern(set, UnicodeString("[[[a-z]-[aeiou]i]]", ""), "bdfnptvz");
// Throw in a test of complement
set.complement();
UnicodeString exp;
exp.append(static_cast<char16_t>(0x0000)).append("aeeoouu").append(static_cast<char16_t>(u'z' + 1)).append(static_cast<char16_t>(0xFFFF));
expectPairs(set, exp);
}
void
UnicodeSetTest::TestCategories() {
UErrorCode status = U_ZERO_ERROR;
const char* pat = " [:Lu:] "; // Whitespace ok outside [:..:]
UnicodeSet set(pat, status);
if (U_FAILURE(status)) {
dataerrln(UnicodeString("Fail: Can't construct set with ") + pat + " - " + UnicodeString(u_errorName(status)));
return;
} else {
expectContainment(set, pat, "ABC", "abc");
}
UChar32 i;
int32_t failures = 0;
// Make sure generation of L doesn't pollute cached Lu set
// First generate L, then Lu
set.applyPattern("[:L:]", status);
if (U_FAILURE(status)) { errln("FAIL"); return; }
for (i=0; i<0x200; ++i) {
UBool l = u_isalpha(static_cast<char16_t>(i));
if (l != set.contains(i)) {
errln(UnicodeString("FAIL: L contains ") + static_cast<unsigned short>(i) + " = " +
set.contains(i));
if (++failures == 10) break;
}
}
set.applyPattern("[:Lu:]", status);
if (U_FAILURE(status)) { errln("FAIL"); return; }
for (i=0; i<0x200; ++i) {
UBool lu = (u_charType(static_cast<char16_t>(i)) == U_UPPERCASE_LETTER);
if (lu != set.contains(i)) {
errln(UnicodeString("FAIL: Lu contains ") + static_cast<unsigned short>(i) + " = " +
set.contains(i));
if (++failures == 20) break;
}
}
}
void
UnicodeSetTest::TestCloneEqualHash() {
UErrorCode status = U_ZERO_ERROR;
// set1 and set2 used to be built with the obsolete constructor taking
// UCharCategory values; replaced with pattern constructors
// markus 20030502
UnicodeSet *set1=new UnicodeSet(u"\\p{Lowercase Letter}", status); // :Ll: Letter, lowercase
UnicodeSet *set1a=new UnicodeSet(u"[:Ll:]", status); // Letter, lowercase
if (U_FAILURE(status)){
dataerrln(UnicodeString("FAIL: Can't construst set with category->Ll") + " - " + UnicodeString(u_errorName(status)));
return;
}
UnicodeSet *set2=new UnicodeSet(u"\\p{Decimal Number}", status); //Number, Decimal digit
UnicodeSet *set2a=new UnicodeSet(u"[:Nd:]", status); //Number, Decimal digit
if (U_FAILURE(status)){
errln(UnicodeString("FAIL: Can't construct set with category->Nd"));
return;
}
if (*set1 != *set1a) {
errln("FAIL: category constructor for Ll broken");
}
if (*set2 != *set2a) {
errln("FAIL: category constructor for Nd broken");
}
delete set1a;
delete set2a;
logln("Testing copy construction");
UnicodeSet *set1copy=new UnicodeSet(*set1);
if(*set1 != *set1copy || *set1 == *set2 ||
getPairs(*set1) != getPairs(*set1copy) ||
set1->hashCode() != set1copy->hashCode()){
errln("FAIL : Error in copy construction");
return;
}
logln("Testing =operator");
UnicodeSet set1equal=*set1;
UnicodeSet set2equal=*set2;
if(set1equal != *set1 || set1equal != *set1copy || set2equal != *set2 ||
set2equal == *set1 || set2equal == *set1copy || set2equal == set1equal){
errln("FAIL: Error in =operator");
}
logln("Testing clone()");
UnicodeSet *set1clone=set1->clone();
UnicodeSet *set2clone=set2->clone();
if(*set1clone != *set1 || *set1clone != *set1copy || *set1clone != set1equal ||
*set2clone != *set2 || *set2clone == *set1copy || *set2clone != set2equal ||
*set2clone == *set1 || *set2clone == set1equal || *set2clone == *set1clone){
errln("FAIL: Error in clone");
}
logln("Testing hashcode");
if(set1->hashCode() != set1equal.hashCode() || set1->hashCode() != set1clone->hashCode() ||
set2->hashCode() != set2equal.hashCode() || set2->hashCode() != set2clone->hashCode() ||
set1copy->hashCode() != set1equal.hashCode() || set1copy->hashCode() != set1clone->hashCode() ||
set1->hashCode() == set2->hashCode() || set1copy->hashCode() == set2->hashCode() ||
set2->hashCode() == set1clone->hashCode() || set2->hashCode() == set1equal.hashCode() ){
errln("FAIL: Error in hashCode()");
}
delete set1;
delete set1copy;
delete set2;
delete set1clone;
delete set2clone;
}
void
UnicodeSetTest::TestAddRemove() {
UnicodeSet set; // Construct empty set
doAssert(set.isEmpty() == true, "set should be empty");
doAssert(set.size() == 0, "size should be 0");
set.complement();
doAssert(set.size() == 0x110000, "size should be 0x110000");
set.clear();
set.add(0x0061, 0x007a);
expectPairs(set, "az");
doAssert(set.isEmpty() == false, "set should not be empty");
doAssert(set.size() != 0, "size should not be equal to 0");
doAssert(set.size() == 26, "size should be equal to 26");
set.remove(0x006d, 0x0070);
expectPairs(set, "alqz");
doAssert(set.size() == 22, "size should be equal to 22");
set.remove(0x0065, 0x0067);
expectPairs(set, "adhlqz");
doAssert(set.size() == 19, "size should be equal to 19");
set.remove(0x0064, 0x0069);
expectPairs(set, "acjlqz");
doAssert(set.size() == 16, "size should be equal to 16");
set.remove(0x0063, 0x0072);
expectPairs(set, "absz");
doAssert(set.size() == 10, "size should be equal to 10");
set.add(0x0066, 0x0071);
expectPairs(set, "abfqsz");
doAssert(set.size() == 22, "size should be equal to 22");
set.remove(0x0061, 0x0067);
expectPairs(set, "hqsz");
set.remove(0x0061, 0x007a);
expectPairs(set, "");
doAssert(set.isEmpty() == true, "set should be empty");
doAssert(set.size() == 0, "size should be 0");
set.add(0x0061);
doAssert(set.isEmpty() == false, "set should not be empty");
doAssert(set.size() == 1, "size should not be equal to 1");
set.add(0x0062);
set.add(0x0063);
expectPairs(set, "ac");
doAssert(set.size() == 3, "size should not be equal to 3");
set.add(0x0070);
set.add(0x0071);
expectPairs(set, "acpq");
doAssert(set.size() == 5, "size should not be equal to 5");
set.clear();
expectPairs(set, "");
doAssert(set.isEmpty() == true, "set should be empty");
doAssert(set.size() == 0, "size should be 0");
// Try removing an entire set from another set
expectPattern(set, "[c-x]", "cx");
UnicodeSet set2;
expectPattern(set2, "[f-ky-za-bc[vw]]", "acfkvwyz");
set.removeAll(set2);
expectPairs(set, "deluxx");
// Try adding an entire set to another set
expectPattern(set, "[jackiemclean]", "aacceein");
expectPattern(set2, "[hitoshinamekatajamesanderson]", "aadehkmort");
set.addAll(set2);
expectPairs(set, "aacehort");
doAssert(set.containsAll(set2) == true, "set should contain all the elements in set2");
// Try retaining an set of elements contained in another set (intersection)
UnicodeSet set3;
expectPattern(set3, "[a-c]", "ac");
doAssert(set.containsAll(set3) == false, "set doesn't contain all the elements in set3");
set3.remove(0x0062);
expectPairs(set3, "aacc");
doAssert(set.containsAll(set3) == true, "set should contain all the elements in set3");
set.retainAll(set3);
expectPairs(set, "aacc");
doAssert(set.size() == set3.size(), "set.size() should be set3.size()");
doAssert(set.containsAll(set3) == true, "set should contain all the elements in set3");
set.clear();
doAssert(set.size() != set3.size(), "set.size() != set3.size()");
// Test commutativity
expectPattern(set, "[hitoshinamekatajamesanderson]", "aadehkmort");
expectPattern(set2, "[jackiemclean]", "aacceein");
set.addAll(set2);
expectPairs(set, "aacehort");
doAssert(set.containsAll(set2) == true, "set should contain all the elements in set2");
}
/**
* Make sure minimal representation is maintained.
*/
void UnicodeSetTest::TestMinimalRep() {
UErrorCode status = U_ZERO_ERROR;
// This is pretty thoroughly tested by checkCanonicalRep()
// run against the exhaustive operation results. Use the code
// here for debugging specific spot problems.
// 1 overlap against 2
UnicodeSet set("[h-km-q]", status);
if (U_FAILURE(status)) { errln("FAIL"); return; }
UnicodeSet set2("[i-o]", status);
if (U_FAILURE(status)) { errln("FAIL"); return; }
set.addAll(set2);
expectPairs(set, "hq");
// right
set.applyPattern("[a-m]", status);
if (U_FAILURE(status)) { errln("FAIL"); return; }
set2.applyPattern("[e-o]", status);
if (U_FAILURE(status)) { errln("FAIL"); return; }
set.addAll(set2);
expectPairs(set, "ao");
// left
set.applyPattern("[e-o]", status);
if (U_FAILURE(status)) { errln("FAIL"); return; }
set2.applyPattern("[a-m]", status);
if (U_FAILURE(status)) { errln("FAIL"); return; }
set.addAll(set2);
expectPairs(set, "ao");
// 1 overlap against 3
set.applyPattern("[a-eg-mo-w]", status);
if (U_FAILURE(status)) { errln("FAIL"); return; }
set2.applyPattern("[d-q]", status);
if (U_FAILURE(status)) { errln("FAIL"); return; }
set.addAll(set2);
expectPairs(set, "aw");
}
void UnicodeSetTest::TestAPI() {
UErrorCode status = U_ZERO_ERROR;
// default ct
UnicodeSet set;
if (!set.isEmpty() || set.getRangeCount() != 0) {
errln(UnicodeString("FAIL, set should be empty but isn't: ") + set);
}
// clear(), isEmpty()
set.add(0x0061);
if (set.isEmpty()) {
errln(UnicodeString("FAIL, set shouldn't be empty but is: ") + set);
}
set.clear();
if (!set.isEmpty()) {
errln(UnicodeString("FAIL, set should be empty but isn't: ") + set);
}
// size()
set.clear();
if (set.size() != 0) {
errln(UnicodeString("FAIL, size should be 0, but is ") + set.size() +
": " + set);
}
set.add(0x0061);
if (set.size() != 1) {
errln(UnicodeString("FAIL, size should be 1, but is ") + set.size() +
": " + set);
}
set.add(0x0031, 0x0039);
if (set.size() != 10) {
errln(UnicodeString("FAIL, size should be 10, but is ") + set.size() +
": " + set);
}
// contains(first, last)
set.clear();
set.applyPattern("[A-Y 1-8 b-d l-y]", status);
if (U_FAILURE(status)) { errln("FAIL"); return; }
for (int32_t i = 0; i<set.getRangeCount(); ++i) {
UChar32 a = set.getRangeStart(i);
UChar32 b = set.getRangeEnd(i);
if (!set.contains(a, b)) {
errln(UnicodeString("FAIL, should contain ") + static_cast<unsigned short>(a) + '-' + static_cast<unsigned short>(b) +
" but doesn't: " + set);
}
if (set.contains(static_cast<UChar32>(a - 1), b)) {
errln(UnicodeString("FAIL, shouldn't contain ") +
static_cast<unsigned short>(a - 1) + '-' + static_cast<unsigned short>(b) +
" but does: " + set);
}
if (set.contains(a, static_cast<UChar32>(b + 1))) {
errln(UnicodeString("FAIL, shouldn't contain ") +
static_cast<unsigned short>(a) + '-' + static_cast<unsigned short>(b + 1) +
" but does: " + set);
}
}
// Ported InversionList test.
UnicodeSet a(static_cast<UChar32>(3), static_cast<UChar32>(10));
UnicodeSet b(static_cast<UChar32>(7), static_cast<UChar32>(15));
UnicodeSet c;
logln(UnicodeString("a [3-10]: ") + a);
logln(UnicodeString("b [7-15]: ") + b);
c = a;
c.addAll(b);
UnicodeSet exp(static_cast<UChar32>(3), static_cast<UChar32>(15));
if (c == exp) {
logln(UnicodeString("c.set(a).add(b): ") + c);
} else {
errln(UnicodeString("FAIL: c.set(a).add(b) = ") + c + ", expect " + exp);
}
c.complement();
exp.set(static_cast<UChar32>(0), static_cast<UChar32>(2));
exp.add(static_cast<UChar32>(16), UnicodeSet::MAX_VALUE);
if (c == exp) {
logln(UnicodeString("c.complement(): ") + c);
} else {
errln(UnicodeString("FAIL: c.complement() = ") + c + ", expect " + exp);
}
c.complement();
exp.set(static_cast<UChar32>(3), static_cast<UChar32>(15));
if (c == exp) {
logln(UnicodeString("c.complement(): ") + c);
} else {
errln(UnicodeString("FAIL: c.complement() = ") + c + ", expect " + exp);
}
c = a;
c.complementAll(b);
exp.set(static_cast<UChar32>(3), static_cast<UChar32>(6));
exp.add(static_cast<UChar32>(11), static_cast<UChar32>(15));
if (c == exp) {
logln(UnicodeString("c.set(a).exclusiveOr(b): ") + c);
} else {
errln(UnicodeString("FAIL: c.set(a).exclusiveOr(b) = ") + c + ", expect " + exp);
}
exp = c;
bitsToSet(setToBits(c), c);
if (c == exp) {
logln(UnicodeString("bitsToSet(setToBits(c)): ") + c);
} else {
errln(UnicodeString("FAIL: bitsToSet(setToBits(c)) = ") + c + ", expect " + exp);
}
// Additional tests for coverage JB#2118
//UnicodeSet::complement(class UnicodeString const &)
//UnicodeSet::complementAll(class UnicodeString const &)
//UnicodeSet::containsNone(class UnicodeSet const &)
//UnicodeSet::containsNone(long,long)
//UnicodeSet::containsSome(class UnicodeSet const &)
//UnicodeSet::containsSome(long,long)
//UnicodeSet::removeAll(class UnicodeString const &)
//UnicodeSet::retain(long)
//UnicodeSet::retainAll(class UnicodeString const &)
//UnicodeSet::serialize(unsigned short *,long,enum UErrorCode &)
//UnicodeSetIterator::getString()
set.clear();
set.complement("ab");
exp.applyPattern("[{ab}]", status);
if (U_FAILURE(status)) { errln("FAIL"); return; }
if (set != exp) { errln("FAIL: complement(\"ab\")"); return; }
UnicodeSetIterator iset(set);
if (!iset.next() || !iset.isString()) {
errln("FAIL: UnicodeSetIterator::next/isString");
} else if (iset.getString() != "ab") {
errln("FAIL: UnicodeSetIterator::getString");
}
set.add(u'a', u'z');
set.complementAll("alan");
exp.applyPattern("[{ab}b-kmo-z]", status);
if (U_FAILURE(status)) { errln("FAIL"); return; }
if (set != exp) { errln("FAIL: complementAll(\"alan\")"); return; }
exp.applyPattern("[a-z]", status);
if (U_FAILURE(status)) { errln("FAIL"); return; }
if (set.containsNone(exp)) { errln("FAIL: containsNone(UnicodeSet)"); }
if (!set.containsSome(exp)) { errln("FAIL: containsSome(UnicodeSet)"); }
exp.applyPattern("[aln]", status);
if (U_FAILURE(status)) { errln("FAIL"); return; }
if (!set.containsNone(exp)) { errln("FAIL: containsNone(UnicodeSet)"); }
if (set.containsSome(exp)) { errln("FAIL: containsSome(UnicodeSet)"); }
if (set.containsNone(u'a', u'z')) {
errln("FAIL: containsNone(UChar32, UChar32)");
}
if (!set.containsSome(u'a', u'z')) {
errln("FAIL: containsSome(UChar32, UChar32)");
}
if (!set.containsNone(u'A', u'Z')) {
errln("FAIL: containsNone(UChar32, UChar32)");
}
if (set.containsSome(u'A', u'Z')) {
errln("FAIL: containsSome(UChar32, UChar32)");
}
set.removeAll("liu");
exp.applyPattern("[{ab}b-hj-kmo-tv-z]", status);
if (U_FAILURE(status)) { errln("FAIL"); return; }
if (set != exp) { errln("FAIL: removeAll(\"liu\")"); return; }
set.retainAll("star");
exp.applyPattern("[rst]", status);
if (U_FAILURE(status)) { errln("FAIL"); return; }
if (set != exp) { errln("FAIL: retainAll(\"star\")"); return; }
set.retain(u's');
exp.applyPattern("[s]", status);
if (U_FAILURE(status)) { errln("FAIL"); return; }
if (set != exp) { errln("FAIL: retain('s')"); return; }
// ICU 2.6 coverage tests
// public final UnicodeSet retain(String s);
// public final UnicodeSet remove(int c);
// public final UnicodeSet remove(String s);
// public int hashCode();
set.applyPattern(u"[a-z{ab}{cd}]", status);
if (U_FAILURE(status)) { errln("FAIL"); return; }
set.retain(u"cd");
exp.applyPattern(u"[{cd}]", status);
if (U_FAILURE(status)) { errln("FAIL"); return; }
if (set != exp) { errln("FAIL: (with cd).retain(\"cd\")"); return; }
set.applyPattern(u"[a-z{ab}{yz}]", status);
if (U_FAILURE(status)) { errln("FAIL"); return; }
set.retain(u"cd");
exp.clear();
if (set != exp) { errln("FAIL: (without cd).retain(\"cd\")"); return; }
set.applyPattern(u"[a-z{ab}{cd}]", status);
if (U_FAILURE(status)) { errln("FAIL"); return; }
set.remove(u'c');
exp.applyPattern(u"[abd-z{ab}{cd}]", status);
if (set != exp) { errln("FAIL: remove('c')"); return; }
set.remove(u"cd");
exp.applyPattern(u"[abd-z{ab}]", status);
if (U_FAILURE(status)) { errln("FAIL"); return; }
if (set != exp) { errln("FAIL: remove(\"cd\")"); return; }
set.applyPattern("[s]", status);
if (U_FAILURE(status)) { errln("FAIL"); return; }
uint16_t buf[32];
int32_t slen = set.serialize(buf, UPRV_LENGTHOF(buf), status);
if (U_FAILURE(status)) { errln("FAIL: serialize"); return; }
if (slen != 3 || buf[0] != 2 || buf[1] != u's' || buf[2] != u't') {
errln("FAIL: serialize");
return;
}
// Conversions to and from USet
UnicodeSet *uniset = &set;
USet *uset = uniset->toUSet();
TEST_ASSERT((void *)uset == (void *)uniset);
UnicodeSet *setx = UnicodeSet::fromUSet(uset);
TEST_ASSERT((void *)setx == (void *)uset);
const UnicodeSet *constSet = uniset;
const USet *constUSet = constSet->toUSet();
TEST_ASSERT((void *)constUSet == (void *)constSet);
const UnicodeSet *constSetx = UnicodeSet::fromUSet(constUSet);
TEST_ASSERT((void *)constSetx == (void *)constUSet);
// span(UnicodeString) and spanBack(UnicodeString) convenience methods
UnicodeString longString=u"aaaaaaaaaabbbbbbbbbbcccccccccc";
UnicodeSet ac(0x61, 0x63);
ac.remove(0x62).freeze();
if( ac.span(longString, -5, USET_SPAN_CONTAINED)!=10 ||
ac.span(longString, 0, USET_SPAN_CONTAINED)!=10 ||
ac.span(longString, 5, USET_SPAN_CONTAINED)!=10 ||
ac.span(longString, 10, USET_SPAN_CONTAINED)!=10 ||
ac.span(longString, 15, USET_SPAN_CONTAINED)!=15 ||
ac.span(longString, 20, USET_SPAN_CONTAINED)!=30 ||
ac.span(longString, 25, USET_SPAN_CONTAINED)!=30 ||
ac.span(longString, 30, USET_SPAN_CONTAINED)!=30 ||
ac.span(longString, 35, USET_SPAN_CONTAINED)!=30 ||
ac.span(longString, INT32_MAX, USET_SPAN_CONTAINED)!=30
) {
errln("UnicodeSet.span(UnicodeString, ...) returns incorrect end indexes");
}
if( ac.spanBack(longString, -5, USET_SPAN_CONTAINED)!=0 ||
ac.spanBack(longString, 0, USET_SPAN_CONTAINED)!=0 ||
ac.spanBack(longString, 5, USET_SPAN_CONTAINED)!=0 ||
ac.spanBack(longString, 10, USET_SPAN_CONTAINED)!=0 ||
ac.spanBack(longString, 15, USET_SPAN_CONTAINED)!=15 ||
ac.spanBack(longString, 20, USET_SPAN_CONTAINED)!=20 ||
ac.spanBack(longString, 25, USET_SPAN_CONTAINED)!=20 ||
ac.spanBack(longString, 30, USET_SPAN_CONTAINED)!=20 ||
ac.spanBack(longString, 35, USET_SPAN_CONTAINED)!=20 ||
ac.spanBack(longString, INT32_MAX, USET_SPAN_CONTAINED)!=20
) {
errln("UnicodeSet.spanBack(UnicodeString, ...) returns incorrect start indexes");
}
}
void UnicodeSetTest::TestIteration() {
UErrorCode ec = U_ZERO_ERROR;
int i = 0;
int outerLoop;
// 6 code points, 3 ranges, 2 strings, 8 total elements
// Iteration will access them in sorted order - a, b, c, y, z, U0001abcd, "str1", "str2"
UnicodeSet set(u"[zabyc\\U0001abcd{str1}{str2}]", ec);
TEST_ASSERT_SUCCESS(ec);
UnicodeSetIterator it(set);
for (outerLoop=0; outerLoop<3; outerLoop++) {
// Run the test multiple times, to check that iterator.reset() is working.
for (i=0; i<10; i++) {
UBool nextv = it.next();
UBool isString = it.isString();
int32_t codePoint = it.getCodepoint();
//int32_t codePointEnd = it.getCodepointEnd();
UnicodeString s = it.getString();
switch (i) {
case 0:
TEST_ASSERT(nextv == true);
TEST_ASSERT(isString == false);
TEST_ASSERT(codePoint==0x61);
TEST_ASSERT(s == "a");
break;
case 1:
TEST_ASSERT(nextv == true);
TEST_ASSERT(isString == false);
TEST_ASSERT(codePoint==0x62);
TEST_ASSERT(s == "b");
break;
case 2:
TEST_ASSERT(nextv == true);
TEST_ASSERT(isString == false);
TEST_ASSERT(codePoint==0x63);
TEST_ASSERT(s == "c");
break;
case 3:
TEST_ASSERT(nextv == true);
TEST_ASSERT(isString == false);
TEST_ASSERT(codePoint==0x79);
TEST_ASSERT(s == "y");
break;
case 4:
TEST_ASSERT(nextv == true);
TEST_ASSERT(isString == false);
TEST_ASSERT(codePoint==0x7a);
TEST_ASSERT(s == "z");
break;
case 5:
TEST_ASSERT(nextv == true);
TEST_ASSERT(isString == false);
TEST_ASSERT(codePoint==0x1abcd);
TEST_ASSERT(s == UnicodeString((UChar32)0x1abcd));
break;
case 6:
TEST_ASSERT(nextv == true);
TEST_ASSERT(isString == true);
TEST_ASSERT(s == "str1");
break;
case 7:
TEST_ASSERT(nextv == true);
TEST_ASSERT(isString == true);
TEST_ASSERT(s == "str2");
break;
case 8:
TEST_ASSERT(nextv == false);
break;
case 9:
TEST_ASSERT(nextv == false);
break;
}
}
it.reset(); // prepare to run the iteration again.
}
}
void UnicodeSetTest::TestStrings() {
UErrorCode ec = U_ZERO_ERROR;
UnicodeSet* testList[] = {
UnicodeSet::createFromAll("abc"),
new UnicodeSet("[a-c]", ec),
&(UnicodeSet::createFrom("ch")->add('a','z').add("ll")),
new UnicodeSet("[{ll}{ch}a-z]", ec),
UnicodeSet::createFrom("ab}c"),
new UnicodeSet("[{ab\\}c}]", ec),
&((new UnicodeSet('a','z'))->add('A', 'Z').retain('M','m').complement('X')),
new UnicodeSet("[[a-zA-Z]&[M-m]-[X]]", ec),
nullptr
};
if (U_FAILURE(ec)) {
errln("FAIL: couldn't construct test sets");
}
assertFalse("[a-c].hasStrings()", testList[0]->hasStrings());
assertTrue("[{ll}{ch}a-z].hasStrings()", testList[2]->hasStrings());
for (int32_t i = 0; testList[i] != nullptr; i+=2) {
if (U_SUCCESS(ec)) {
UnicodeString pat0, pat1;
testList[i]->toPattern(pat0, true);
testList[i+1]->toPattern(pat1, true);
if (*testList[i] == *testList[i+1]) {
logln(UnicodeString("Ok: ") + pat0 + " == " + pat1);
} else {
logln(UnicodeString("FAIL: ") + pat0 + " != " + pat1);
}
}
delete testList[i];
delete testList[i+1];
}
}
/**
* Test the [:Latin:] syntax.
*/
void UnicodeSetTest::TestScriptSet() {
expectContainment(u"[:Latin:]", "aA", CharsToUnicodeString("\\u0391\\u03B1"));
expectContainment(u"[:Greek:]", CharsToUnicodeString("\\u0391\\u03B1"), "aA");
/* Jitterbug 1423 */
expectContainment(u"[[:Common:][:Inherited:]]", CharsToUnicodeString("\\U00003099\\U0001D169\\u0000"), "aA");
}
/**
* Test the [:Latin:] syntax.
*/
void UnicodeSetTest::TestPropertySet() {
static const char* const DATA[] = {
// Pattern, Chars IN, Chars NOT in
"[:Latin:]",
"aA",
"\\u0391\\u03B1",
"[\\p{Greek}]",
"\\u0391\\u03B1",
"aA",
"\\P{ GENERAL Category = upper case letter }",
"abc",
"ABC",
#if !UCONFIG_NO_NORMALIZATION
// Combining class: @since ICU 2.2
// Check both symbolic and numeric
"\\p{ccc=Nukta}",
"\\u0ABC",
"abc",
"\\p{Canonical Combining Class = 11}",
"\\u05B1",
"\\u05B2",
"[:c c c = iota subscript :]",
"\\u0345",
"xyz",
#endif
// Bidi class: @since ICU 2.2
"\\p{bidiclass=lefttoright}",
"abc",
"\\u0671\\u0672",
// Binary properties: @since ICU 2.2
"\\p{ideographic}",
"\\u4E0A",
"x",
"[:math=false:]",
"q)*(",
// weiv: )(and * were removed from math in Unicode 4.0.1
//"(*+)",
"+<>^",
// JB#1767 \N{}, \p{ASCII}
"[:Ascii:]",
"abc\\u0000\\u007F",
"\\u0080\\u4E00",
"[\\N{ latin small letter a }[:name= latin small letter z:]]",
"az",
"qrs",
// JB#2015
"[:any:]",
"a\\U0010FFFF",
"",
"[:nv=0.5:]",
"\\u00BD\\u0F2A",
"\\u00BC",
// JB#2653: Age
"[:Age=1.1:]",
"\\u03D6", // 1.1