#include "unicode/utypes.h"
#include "usettest.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 "hash.h"
UnicodeString operator+(const UnicodeString& left, const UnicodeSet& set) {
UnicodeString pat;
set.toPattern(pat);
return left + UnicodeSetTest::escape(pat);
}
#define CASE(id,test) case id: \
name = #test; \
if (exec) { \
logln(#test "---"); \
logln((UnicodeString)""); \
test(); \
} \
break
void
UnicodeSetTest::runIndexedTest(int32_t index, UBool exec,
const char* &name, char* ) {
switch (index) {
CASE(0,TestPatterns);
CASE(1,TestAddRemove);
CASE(2,TestCategories);
CASE(3,TestCloneEqualHash);
CASE(4,TestMinimalRep);
CASE(5,TestAPI);
CASE(6,TestScriptSet);
CASE(7,TestPropertySet);
CASE(8,TestClone);
CASE(9,TestExhaustive);
CASE(10,TestToPattern);
CASE(11,TestIndexOf);
CASE(12,TestStrings);
CASE(13,Testj2268);
CASE(14,TestCloseOver);
CASE(15,TestEscapePattern);
CASE(16,TestInvalidCodePoint);
CASE(17,TestSymbolTable);
CASE(18,TestSurrogate);
default: name = ""; break;
}
}
static const char NOT[] = "%%%%";
void UnicodeSetTest::Testj2268() {
UnicodeSet t;
t.add(UnicodeString("abc"));
UnicodeSet test(t);
UnicodeString ustrPat;
test.toPattern(ustrPat, TRUE);
}
void UnicodeSetTest::TestToPattern() {
UErrorCode ec = U_ZERO_ERROR;
{
static const char* OTHER_TOPATTERN_TESTS[] = {
"[[:latin:]&[:greek:]]",
"[[:latin:]-[:greek:]]",
"[:nonspacing mark:]",
NULL
};
for (int32_t j=0; OTHER_TOPATTERN_TESTS[j]!=NULL; ++j) {
ec = U_ZERO_ERROR;
UnicodeSet s(OTHER_TOPATTERN_TESTS[j], ec);
if (U_FAILURE(ec)) {
errln((UnicodeString)"FAIL: bad pattern " + OTHER_TOPATTERN_TESTS[j]);
continue;
}
checkPat(OTHER_TOPATTERN_TESTS[j], s);
}
for (UChar32 i = 0; i <= 0x10FFFF; ++i) {
if ((i <= 0xFF && !u_isalpha(i)) || u_isspace(i)) {
if (i != 0 && !toPatternAux(i, i)){
continue;
}
if (!toPatternAux(0, i)){
continue;
}
if (!toPatternAux(i, 0xFFFF)){
continue;
}
}
}
}
{
ec = U_ZERO_ERROR;
UnicodeSet* s = new UnicodeSet("[a-z {aa} {ab}]", ec);
for (;;) {
if (U_FAILURE(ec)) break;
const char* exp1[] = {"aa", "ab", NOT, "ac", NULL};
expectToPattern(*s, "[a-z{aa}{ab}]", exp1);
s->add("ac");
const char* exp2[] = {"aa", "ab", "ac", NOT, "xy", NULL};
expectToPattern(*s, "[a-z{aa}{ab}{ac}]", exp2);
s->applyPattern("[a-z {\\{l} {r\\}}]", ec);
if (U_FAILURE(ec)) break;
const char* exp3[] = {"{l", "r}", NOT, "xy", NULL};
expectToPattern(*s, "[a-z{r\\}}{\\{l}]", exp3);
s->add("[]");
const char* exp4[] = {"{l", "r}", "[]", NOT, "xy", NULL};
expectToPattern(*s, "[a-z{\\[\\]}{r\\}}{\\{l}]", exp4);
s->applyPattern("[a-z {\\u4E01\\u4E02}{\\n\\r}]", ec);
if (U_FAILURE(ec)) break;
const char* exp5[] = {"\\u4E01\\u4E02", "\n\r", NULL};
expectToPattern(*s, "[a-z{\\u000A\\u000D}{\\u4E01\\u4E02}]", exp5);
s->clear();
s->add(UnicodeString("abc", ""));
s->add(UnicodeString("abc", ""));
const char* exp6[] = {"abc", NOT, "ab", NULL};
expectToPattern(*s, "[{abc}]", exp6);
break;
}
if (U_FAILURE(ec)) errln("FAIL: pattern parse error");
delete s;
}
UnicodeSet s;
s.add((UChar)97, (UChar)98); expectToPattern(s, "[ab]", NULL);
}
UBool UnicodeSetTest::toPatternAux(UChar32 start, UChar32 end) {
UnicodeString pat = "";
UnicodeString source;
source = source + (uint32_t)start;
if (start != end)
source = source + ".." + (uint32_t)end;
UnicodeSet testSet;
testSet.add(start, end);
return checkPat(source, testSet);
}
UBool UnicodeSetTest::checkPat(const UnicodeString& source,
const UnicodeSet& testSet) {
UnicodeString pat0;
testSet.toPattern(pat0, TRUE);
if (!checkPat(source + " (escaped)", testSet, pat0)) return FALSE;
UnicodeString pat2;
testSet.toPattern(pat2, FALSE);
if (!checkPat(source, testSet, pat2)) return FALSE;
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(void) {
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");
set.complement();
UnicodeString exp;
exp.append((UChar)0x0000).append("aeeoouu").append((UChar)(0x007a+1)).append((UChar)0xFFFF);
expectPairs(set, exp);
}
void
UnicodeSetTest::TestCategories(void) {
UErrorCode status = U_ZERO_ERROR;
const char* pat = " [:Lu:] "; UnicodeSet set(pat, status);
if (U_FAILURE(status)) {
errln((UnicodeString)"Fail: Can't construct set with " + pat);
} else {
expectContainment(set, pat, "ABC", "abc");
}
UChar32 i;
int32_t failures = 0;
set.applyPattern("[:L:]", status);
if (U_FAILURE(status)) { errln("FAIL"); return; }
for (i=0; i<0x200; ++i) {
UBool l = u_isalpha((UChar)i);
if (l != set.contains(i)) {
errln((UnicodeString)"FAIL: L contains " + (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((UChar)i) == U_UPPERCASE_LETTER);
if (lu != set.contains(i)) {
errln((UnicodeString)"FAIL: Lu contains " + (unsigned short)i + " = " +
set.contains(i));
if (++failures == 20) break;
}
}
}
void
UnicodeSetTest::TestCloneEqualHash(void) {
UErrorCode status = U_ZERO_ERROR;
UnicodeSet *set1=new UnicodeSet("\\p{Lowercase Letter}", status); UnicodeSet *set1a=new UnicodeSet("[:Ll:]", status); if (U_FAILURE(status)){
errln((UnicodeString)"FAIL: Can't construst set with category->Ll");
return;
}
UnicodeSet *set2=new UnicodeSet("\\p{Decimal Number}", status); UnicodeSet *set2a=new UnicodeSet("[:Nd:]", status); 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=(UnicodeSet*)set1->clone();
UnicodeSet *set2clone=(UnicodeSet*)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(void) {
UnicodeSet 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");
expectPattern(set, "[c-x]", "cx");
UnicodeSet set2;
expectPattern(set2, "[f-ky-za-bc[vw]]", "acfkvwyz");
set.removeAll(set2);
expectPairs(set, "deluxx");
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");
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()");
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");
}
void UnicodeSetTest::TestMinimalRep() {
UErrorCode status = U_ZERO_ERROR;
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");
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");
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");
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;
UnicodeSet set;
if (!set.isEmpty() || set.getRangeCount() != 0) {
errln((UnicodeString)"FAIL, set should be empty but isn't: " +
set);
}
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);
}
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);
}
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 " + (unsigned short)a + '-' + (unsigned short)b +
" but doesn't: " + set);
}
if (set.contains((UChar32)(a-1), b)) {
errln((UnicodeString)"FAIL, shouldn't contain " +
(unsigned short)(a-1) + '-' + (unsigned short)b +
" but does: " + set);
}
if (set.contains(a, (UChar32)(b+1))) {
errln((UnicodeString)"FAIL, shouldn't contain " +
(unsigned short)a + '-' + (unsigned short)(b+1) +
" but does: " + set);
}
}
UnicodeSet a((UChar32)3,(UChar32)10);
UnicodeSet b((UChar32)7,(UChar32)15);
UnicodeSet c;
logln((UnicodeString)"a [3-10]: " + a);
logln((UnicodeString)"b [7-15]: " + b);
c = a;
c.addAll(b);
UnicodeSet exp((UChar32)3,(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((UChar32)0, (UChar32)2);
exp.add((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((UChar32)3, (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((UChar32)3,(UChar32)6);
exp.add((UChar32)11,(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);
}
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((UChar32)0x61, (UChar32)0x7A);
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((UChar32)0x61, (UChar32)0x7A)) {
errln("FAIL: containsNone(UChar32, UChar32)");
}
if (!set.containsSome((UChar32)0x61, (UChar32)0x7A)) {
errln("FAIL: containsSome(UChar32, UChar32)");
}
if (!set.containsNone((UChar32)0x41, (UChar32)0x5A)) {
errln("FAIL: containsNone(UChar32, UChar32)");
}
if (set.containsSome((UChar32)0x41, (UChar32)0x5A)) {
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((UChar32)0x73);
exp.applyPattern("[s]", status);
if (U_FAILURE(status)) { errln("FAIL"); return; }
if (set != exp) { errln("FAIL: retain('s')"); return; }
uint16_t buf[32];
int32_t slen = set.serialize(buf, sizeof(buf)/sizeof(buf[0]), status);
if (U_FAILURE(status)) { errln("FAIL: serialize"); return; }
if (slen != 3 || buf[0] != 2 || buf[1] != 0x73 || buf[2] != 0x74) {
errln("FAIL: serialize");
return;
}
}
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),
NULL
};
if (U_FAILURE(ec)) {
errln("FAIL: couldn't construct test sets");
}
for (int32_t i = 0; testList[i] != NULL; 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];
}
}
void UnicodeSetTest::TestScriptSet() {
expectContainment("[:Latin:]", "aA", CharsToUnicodeString("\\u0391\\u03B1"));
expectContainment("[:Greek:]", CharsToUnicodeString("\\u0391\\u03B1"), "aA");
expectContainment("[[:Common:][:Inherited:]]", CharsToUnicodeString("\\U00003099\\U0001D169\\u0000"), "aA");
}
void UnicodeSetTest::TestPropertySet() {
static const char* DATA[] = {
"[:Latin:]",
"aA",
"\\u0391\\u03B1",
"[\\p{Greek}]",
"\\u0391\\u03B1",
"aA",
"\\P{ GENERAL Category = upper case letter }",
"abc",
"ABC",
"\\p{ccc=Nukta}",
"\\u0ABC",
"abc",
"\\p{Canonical Combining Class = 11}",
"\\u05B1",
"\\u05B2",
"[:c c c = iota subscript :]",
"\\u0345",
"xyz",
"\\p{bidiclass=lefttoright}",
"abc",
"\\u0671\\u0672",
"\\p{ideographic}",
"\\u4E0A",
"x",
"[:math=false:]",
"q)*(",
"+<>^",
"[:Ascii:]",
"abc\\u0000\\u007F",
"\\u0080\\u4E00",
"[\\N{ latin small letter a }[:name= latin small letter z:]]",
"az",
"qrs",
"[:any:]",
"a\\U0010FFFF",
"",
"[:nv=0.5:]",
"\\u00BD\\u0F2A",
"\\u00BC",
"[:Age=1.1:]",
"\\u03D6", "\\u03D8\\u03D9",
"[:Age=3.1:]",
"\\u1800\\u3400\\U0002f800",
"\\u0220\\u034f\\u30ff\\u33ff\\ufe73\\U00010000\\U00050000",
"[:Case Sensitive:]",
"A\\u1FFC\\U00010410",
";\\u00B4\\U00010500",
"[:blank:]",
" \\u0009",
"1-9A-Z",
"[:graph:]",
"19AZ",
" \\u0003\\u0007\\u0009\\u000A\\u000D",
"[:punct:]",
"!@#%&*()[]{}-_\\/;:,.?'\"",
"09azAZ",
"[:xdigit:]",
"09afAF",
"gG!",
"[-b]", "-b",
"ac",
"[^-b]", "ac",
"-b",
"[b-]", "-b",
"ac",
"[^b-]", "ac",
"-b",
"[a-b-]", "ab-",
"c=",
"[[a-q]&[p-z]-]", "pq-",
"or=",
"[\\s|\\)|:|$|\\>]", "s|):$>",
"abc",
"[\\uDC00cd]", "cd\\uDC00",
"ab\\uD800\\U00010000",
"[ab\\uD800]", "ab\\uD800",
"cd\\uDC00\\U00010000",
"[ab\\uD800cd]", "abcd\\uD800",
"ef\\uDC00\\U00010000",
"[ab\\uDC00cd]", "abcd\\uDC00",
"ef\\uD800\\U00010000",
"[:^lccc=0:]", "\\u0300\\u0301",
"abcd\\u00c0\\u00c5",
"[:^tccc=0:]", "\\u0300\\u0301\\u00c0\\u00c5",
"abcd",
"[[:^lccc=0:][:^tccc=0:]]", "\\u0300\\u0301\\u00c0\\u00c5",
"abcd",
"[[:^lccc=0:]-[:^tccc=0:]]", "",
"abcd\\u0300\\u0301\\u00c0\\u00c5",
"[[:ccc=0:]-[:lccc=0:]-[:tccc=0:]]", "\\u0F73\\u0F75\\u0F81",
"abcd\\u0300\\u0301\\u00c0\\u00c5",
};
static const int32_t DATA_LEN = sizeof(DATA)/sizeof(DATA[0]);
for (int32_t i=0; i<DATA_LEN; i+=3) {
expectContainment(DATA[i], CharsToUnicodeString(DATA[i+1]),
CharsToUnicodeString(DATA[i+2]));
}
}
void UnicodeSetTest::TestClone() {
UErrorCode ec = U_ZERO_ERROR;
UnicodeSet s("[abcxyz]", ec);
UnicodeSet t(s);
expectContainment(t, "abc", "def");
}
void UnicodeSetTest::TestIndexOf() {
UErrorCode ec = U_ZERO_ERROR;
UnicodeSet set("[a-cx-y3578]", ec);
if (U_FAILURE(ec)) {
errln("FAIL: UnicodeSet constructor");
return;
}
for (int32_t i=0; i<set.size(); ++i) {
UChar32 c = set.charAt(i);
if (set.indexOf(c) != i) {
errln("FAIL: charAt(%d) = %X => indexOf() => %d",
i, c, set.indexOf(c));
}
}
UChar32 c = set.charAt(set.size());
if (c != -1) {
errln("FAIL: charAt(<out of range>) = %X", c);
}
int32_t j = set.indexOf((UChar32)0x71);
if (j != -1) {
errln((UnicodeString)"FAIL: indexOf('q') = " + j);
}
}
void UnicodeSetTest::TestCloseOver() {
UErrorCode ec = U_ZERO_ERROR;
char CASE[] = {(char)USET_CASE};
char CASE_MAPPINGS[] = {(char)USET_ADD_CASE_MAPPINGS};
const char* DATA[] = {
CASE,
"[aq\\u00DF{Bc}{bC}{Fi}]",
"[aAqQ\\u00DF\\uFB01{ss}{bc}{fi}]",
CASE,
"[\\u01F1]", "[\\u01F1\\u01F2\\u01F3]",
CASE,
"[\\u1FB4]",
"[\\u1FB4{\\u03AC\\u03B9}]",
CASE,
"[{F\\uFB01}]",
"[\\uFB03{ffi}]",
CASE, "[a\\uFF3A]",
"[aA\\uFF3A\\uFF5A]",
CASE,
"[a-z]","[A-Za-z\\u017F\\u212A]",
CASE,
"[abc]","[A-Ca-c]",
CASE,
"[ABC]","[A-Ca-c]",
CASE_MAPPINGS,
"[aq\\u00DF{Bc}{bC}{Fi}]",
"[aAqQ\\u00DF{ss}{Ss}{SS}{Bc}{BC}{bC}{bc}{FI}{Fi}{fi}]",
CASE_MAPPINGS,
"[\\u01F1]", "[\\u01F1\\u01F2\\u01F3]",
CASE_MAPPINGS,
"[a-z]",
"[A-Za-z]",
NULL
};
UnicodeSet s;
UnicodeSet t;
for (int32_t i=0; DATA[i]!=NULL; i+=3) {
int32_t selector = DATA[i][0];
UnicodeString pat(DATA[i+1]);
UnicodeString exp(DATA[i+2]);
s.applyPattern(pat, ec);
s.closeOver(selector);
t.applyPattern(exp, ec);
if (U_FAILURE(ec)) {
errln("FAIL: applyPattern failed");
continue;
}
if (s == t) {
logln((UnicodeString)"Ok: " + pat + ".closeOver(" + selector + ") => " + exp);
} else {
UnicodeString buf;
errln((UnicodeString)"FAIL: " + pat + ".closeOver(" + selector + ") => " +
s.toPattern(buf, TRUE) + ", expected " + exp);
}
}
s.applyPattern("[abc]", USET_CASE_INSENSITIVE, NULL, ec);
if (U_FAILURE(ec)) {
errln("FAIL: applyPattern failed");
} else {
expectContainment(s, "abcABC", "defDEF");
}
UnicodeSet v("[^abc]", USET_CASE_INSENSITIVE, NULL, ec);
if (U_FAILURE(ec)) {
errln("FAIL: constructor failed");
} else {
expectContainment(v, "defDEF", "abcABC");
}
UnicodeSet cm("[abck]", USET_ADD_CASE_MAPPINGS, NULL, ec);
if (U_FAILURE(ec)) {
errln("FAIL: construct w/case mappings failed");
} else {
expectContainment(cm, "abckABCK", CharsToUnicodeString("defDEF\\u212A"));
}
}
void UnicodeSetTest::TestEscapePattern() {
const char pattern[] =
"[\\uFEFF \\u200A-\\u200E \\U0001D173-\\U0001D17A \\U000F0000-\\U000FFFFD ]";
const char exp[] =
"[\\u200A-\\u200E\\uFEFF\\U0001D173-\\U0001D17A\\U000F0000-\\U000FFFFD]";
for (int32_t pass=1; pass<=2; ++pass) {
UErrorCode ec = U_ZERO_ERROR;
UnicodeString pat(pattern);
if (pass==2) {
pat = pat.unescape();
}
UBool isPatternValid = (pass==1);
UnicodeSet set(pat, ec);
if (U_SUCCESS(ec) != isPatternValid){
errln((UnicodeString)"FAIL: applyPattern(" +
escape(pat) + ") => " +
u_errorName(ec));
continue;
}
if (U_FAILURE(ec)) {
continue;
}
if (set.contains((UChar)0x0644)){
errln((UnicodeString)"FAIL: " + escape(pat) + " contains(U+0664)");
}
UnicodeString newpat;
set.toPattern(newpat, TRUE);
if (newpat == exp) {
logln(escape(pat) + " => " + newpat);
} else {
errln((UnicodeString)"FAIL: " + escape(pat) + " => " + newpat);
}
for (int32_t i=0; i<set.getRangeCount(); ++i) {
UnicodeString str("Range ");
str.append((UChar)(0x30 + i))
.append(": ")
.append((UChar32)set.getRangeStart(i))
.append(" - ")
.append((UChar32)set.getRangeEnd(i));
str = str + " (" + set.getRangeStart(i) + " - " +
set.getRangeEnd(i) + ")";
if (set.getRangeStart(i) < 0) {
errln((UnicodeString)"FAIL: " + escape(str));
} else {
logln(escape(str));
}
}
}
}
void UnicodeSetTest::expectRange(const UnicodeString& label,
const UnicodeSet& set,
UChar32 start, UChar32 end) {
UnicodeSet exp(start, end);
UnicodeString pat;
if (set == exp) {
logln(label + " => " + set.toPattern(pat, TRUE));
} else {
UnicodeString xpat;
errln((UnicodeString)"FAIL: " + label + " => " +
set.toPattern(pat, TRUE) +
", expected " + exp.toPattern(xpat, TRUE));
}
}
void UnicodeSetTest::TestInvalidCodePoint() {
const UChar32 DATA[] = {
0, 0x10FFFF, 0, 0x10FFFF,
(UChar32)-1, 8, 0, 8,
8, 0x110000, 8, 0x10FFFF
};
const int32_t DATA_LENGTH = sizeof(DATA)/sizeof(DATA[0]);
UnicodeString pat;
int32_t i;
for (i=0; i<DATA_LENGTH; i+=4) {
UChar32 start = DATA[i];
UChar32 end = DATA[i+1];
UChar32 xstart = DATA[i+2];
UChar32 xend = DATA[i+3];
UnicodeSet set(start, end);
expectRange((UnicodeString)"ct(" + start + "," + end + ")",
set, xstart, xend);
set.clear();
set.set(start, end);
expectRange((UnicodeString)"set(" + start + "," + end + ")",
set, xstart, xend);
UBool b = set.contains(start);
b = set.contains(start, end);
b = set.containsNone(start, end);
b = set.containsSome(start, end);
set.clear();
set.add(start);
set.add(start, end);
expectRange((UnicodeString)"add(" + start + "," + end + ")",
set, xstart, xend);
set.set(0, 0x10FFFF);
set.retain(start, end);
expectRange((UnicodeString)"retain(" + start + "," + end + ")",
set, xstart, xend);
set.retain(start);
set.set(0, 0x10FFFF);
set.remove(start);
set.remove(start, end);
set.complement();
expectRange((UnicodeString)"!remove(" + start + "," + end + ")",
set, xstart, xend);
set.set(0, 0x10FFFF);
set.complement(start, end);
set.complement();
expectRange((UnicodeString)"!complement(" + start + "," + end + ")",
set, xstart, xend);
set.complement(start);
}
const UChar32 DATA2[] = {
0,
0x10FFFF,
(UChar32)-1,
0x110000
};
const int32_t DATA2_LENGTH = sizeof(DATA2)/sizeof(DATA2[0]);
for (i=0; i<DATA2_LENGTH; ++i) {
UChar32 c = DATA2[i], end = 0x10FFFF;
UBool valid = (c >= 0 && c <= 0x10FFFF);
UnicodeSet set(0, 0x10FFFF);
UBool b = set.contains(c);
if (b == valid) {
logln((UnicodeString)"[\\u0000-\\U0010FFFF].contains(" + c +
") = " + b);
} else {
errln((UnicodeString)"FAIL: [\\u0000-\\U0010FFFF].contains(" + c +
") = " + b);
}
b = set.contains(c, end);
logln((UnicodeString)"* [\\u0000-\\U0010FFFF].contains(" + c +
"," + end + ") = " + b);
b = set.containsNone(c, end);
logln((UnicodeString)"* [\\u0000-\\U0010FFFF].containsNone(" + c +
"," + end + ") = " + b);
b = set.containsSome(c, end);
logln((UnicodeString)"* [\\u0000-\\U0010FFFF].containsSome(" + c +
"," + end + ") = " + b);
int32_t index = set.indexOf(c);
if ((index >= 0) == valid) {
logln((UnicodeString)"[\\u0000-\\U0010FFFF].indexOf(" + c +
") = " + index);
} else {
errln((UnicodeString)"FAIL: [\\u0000-\\U0010FFFF].indexOf(" + c +
") = " + index);
}
}
}
class TokenSymbolTable : public SymbolTable {
public:
Hashtable contents;
TokenSymbolTable(UErrorCode& ec) : contents(FALSE, ec) {
contents.setValueDeleter(uhash_deleteUnicodeString);
}
~TokenSymbolTable() {}
void add(const UnicodeString& var, const UnicodeString& value,
UErrorCode& ec) {
if (U_SUCCESS(ec)) {
contents.put(var, new UnicodeString(value), ec);
}
}
virtual const UnicodeString* lookup(const UnicodeString& s) const {
return (const UnicodeString*) contents.get(s);
}
virtual const UnicodeFunctor* lookupMatcher(UChar32 ) const {
return NULL;
}
virtual UnicodeString parseReference(const UnicodeString& text,
ParsePosition& pos, int32_t limit) const {
int32_t start = pos.getIndex();
int32_t i = start;
UnicodeString result;
while (i < limit) {
UChar c = text.charAt(i);
if ((i==start && !u_isIDStart(c)) || !u_isIDPart(c)) {
break;
}
++i;
}
if (i == start) { return result; }
pos.setIndex(i);
text.extractBetween(start, i, result);
return result;
}
};
void UnicodeSetTest::TestSymbolTable() {
const char* DATA[] = {
"us", "a-z", "[0-1$us]", "[0-1a-z]", NULL,
"us", "[a-z]", "[0-1$us]", "[0-1[a-z]]", NULL,
"us", "\\[a\\-z\\]", "[0-1$us]", "[-01\\[\\]az]", NULL,
NULL
};
for (int32_t i=0; DATA[i]!=NULL; ++i) {
UErrorCode ec = U_ZERO_ERROR;
TokenSymbolTable sym(ec);
if (U_FAILURE(ec)) {
errln("FAIL: couldn't construct TokenSymbolTable");
continue;
}
while (DATA[i+2] != NULL) {
sym.add(DATA[i], DATA[i+1], ec);
if (U_FAILURE(ec)) {
errln("FAIL: couldn't add to TokenSymbolTable");
continue;
}
i += 2;
}
UnicodeString inpat = DATA[i], exppat = DATA[i+1];
i += 2;
ParsePosition pos(0);
UnicodeSet us(inpat, pos, USET_IGNORE_SPACE, &sym, ec);
if (U_FAILURE(ec)) {
errln("FAIL: couldn't construct UnicodeSet");
continue;
}
if (pos.getIndex() != inpat.length()) {
errln((UnicodeString)"Failed to read to end of string \""
+ inpat + "\": read to "
+ pos.getIndex() + ", length is "
+ inpat.length());
}
UnicodeSet us2(exppat, ec);
if (U_FAILURE(ec)) {
errln("FAIL: couldn't construct expected UnicodeSet");
continue;
}
UnicodeString a, b;
if (us != us2) {
errln((UnicodeString)"Failed, got " + us.toPattern(a, TRUE) +
", expected " + us2.toPattern(b, TRUE));
} else {
logln((UnicodeString)"Ok, got " + us.toPattern(a, TRUE));
}
}
}
void UnicodeSetTest::TestSurrogate() {
const char* DATA[] = {
"[abc\\uD800\\uDC00]",
"[abc\\U00010000]",
0
};
for (int i=0; DATA[i] != 0; ++i) {
UErrorCode ec = U_ZERO_ERROR;
logln((UnicodeString)"Test pattern " + i + " :" + DATA[i]);
UnicodeSet set(DATA[i], ec);
if (U_FAILURE(ec)) {
errln("FAIL: UnicodeSet constructor");
continue;
}
expectContainment(set,
CharsToUnicodeString("abc\\U00010000"),
CharsToUnicodeString("\\uD800;\\uDC00")); if (set.size() != 4) {
errln((UnicodeString)"FAIL: " + DATA[i] + ".size() == " +
set.size() + ", expected 4");
}
}
}
void UnicodeSetTest::TestExhaustive() {
int32_t limit = 128;
UnicodeSet x, y, z, aa;
for (int32_t i = 0; i < limit; ++i) {
bitsToSet(i, x);
logln((UnicodeString)"Testing " + i + ", " + x);
_testComplement(i, x, y);
checkRoundTrip(bitsToSet(i, aa));
for (int32_t j = 0; j < limit; ++j) {
_testAdd(i,j, x,y,z);
_testXor(i,j, x,y,z);
_testRetain(i,j, x,y,z);
_testRemove(i,j, x,y,z);
}
}
}
void UnicodeSetTest::_testComplement(int32_t a, UnicodeSet& x, UnicodeSet& z) {
bitsToSet(a, x);
z = x;
z.complement();
int32_t c = setToBits(z);
if (c != (~a)) {
errln((UnicodeString)"FAILED: add: ~" + x + " != " + z);
errln((UnicodeString)"FAILED: add: ~" + a + " != " + c);
}
checkCanonicalRep(z, (UnicodeString)"complement " + a);
}
void UnicodeSetTest::_testAdd(int32_t a, int32_t b, UnicodeSet& x, UnicodeSet& y, UnicodeSet& z) {
bitsToSet(a, x);
bitsToSet(b, y);
z = x;
z.addAll(y);
int32_t c = setToBits(z);
if (c != (a | b)) {
errln((UnicodeString)"FAILED: add: " + x + " | " + y + " != " + z);
errln((UnicodeString)"FAILED: add: " + a + " | " + b + " != " + c);
}
checkCanonicalRep(z, (UnicodeString)"add " + a + "," + b);
}
void UnicodeSetTest::_testRetain(int32_t a, int32_t b, UnicodeSet& x, UnicodeSet& y, UnicodeSet& z) {
bitsToSet(a, x);
bitsToSet(b, y);
z = x;
z.retainAll(y);
int32_t c = setToBits(z);
if (c != (a & b)) {
errln((UnicodeString)"FAILED: retain: " + x + " & " + y + " != " + z);
errln((UnicodeString)"FAILED: retain: " + a + " & " + b + " != " + c);
}
checkCanonicalRep(z, (UnicodeString)"retain " + a + "," + b);
}
void UnicodeSetTest::_testRemove(int32_t a, int32_t b, UnicodeSet& x, UnicodeSet& y, UnicodeSet& z) {
bitsToSet(a, x);
bitsToSet(b, y);
z = x;
z.removeAll(y);
int32_t c = setToBits(z);
if (c != (a &~ b)) {
errln((UnicodeString)"FAILED: remove: " + x + " &~ " + y + " != " + z);
errln((UnicodeString)"FAILED: remove: " + a + " &~ " + b + " != " + c);
}
checkCanonicalRep(z, (UnicodeString)"remove " + a + "," + b);
}
void UnicodeSetTest::_testXor(int32_t a, int32_t b, UnicodeSet& x, UnicodeSet& y, UnicodeSet& z) {
bitsToSet(a, x);
bitsToSet(b, y);
z = x;
z.complementAll(y);
int32_t c = setToBits(z);
if (c != (a ^ b)) {
errln((UnicodeString)"FAILED: complement: " + x + " ^ " + y + " != " + z);
errln((UnicodeString)"FAILED: complement: " + a + " ^ " + b + " != " + c);
}
checkCanonicalRep(z, (UnicodeString)"complement " + a + "," + b);
}
void UnicodeSetTest::checkCanonicalRep(const UnicodeSet& set, const UnicodeString& msg) {
int32_t n = set.getRangeCount();
if (n < 0) {
errln((UnicodeString)"FAIL result of " + msg +
": range count should be >= 0 but is " +
n );
return;
}
UChar32 last = 0;
for (int32_t i=0; i<n; ++i) {
UChar32 start = set.getRangeStart(i);
UChar32 end = set.getRangeEnd(i);
if (start > end) {
errln((UnicodeString)"FAIL result of " + msg +
": range " + (i+1) +
" start > end: " + (int)start + ", " + (int)end +
" for " + set);
}
if (i > 0 && start <= last) {
errln((UnicodeString)"FAIL result of " + msg +
": range " + (i+1) +
" overlaps previous range: " + (int)start + ", " + (int)end +
" for " + set);
}
last = end;
}
}
UnicodeSet& UnicodeSetTest::bitsToSet(int32_t a, UnicodeSet& result) {
result.clear();
for (UChar32 i = 0; i < 32; ++i) {
if ((a & (1<<i)) != 0) {
result.add(i);
}
}
return result;
}
int32_t UnicodeSetTest::setToBits(const UnicodeSet& x) {
int32_t result = 0;
for (int32_t i = 0; i < 32; ++i) {
if (x.contains((UChar32)i)) {
result |= (1<<i);
}
}
return result;
}
UnicodeString UnicodeSetTest::getPairs(const UnicodeSet& set) {
UnicodeString pairs;
for (int32_t i=0; i<set.getRangeCount(); ++i) {
UChar32 start = set.getRangeStart(i);
UChar32 end = set.getRangeEnd(i);
if (end > 0xFFFF) {
end = 0xFFFF;
i = set.getRangeCount(); }
pairs.append((UChar)start).append((UChar)end);
}
return pairs;
}
void UnicodeSetTest::checkRoundTrip(const UnicodeSet& s) {
UErrorCode ec = U_ZERO_ERROR;
UnicodeSet t(s);
checkEqual(s, t, "copy ct");
t = s;
checkEqual(s, t, "operator=");
copyWithIterator(t, s, FALSE);
checkEqual(s, t, "iterator roundtrip");
copyWithIterator(t, s, TRUE); checkEqual(s, t, "iterator roundtrip");
UnicodeString pat; s.toPattern(pat, FALSE);
t.applyPattern(pat, ec);
if (U_FAILURE(ec)) {
errln("FAIL: applyPattern");
return;
} else {
checkEqual(s, t, "toPattern(false)");
}
s.toPattern(pat, TRUE);
t.applyPattern(pat, ec);
if (U_FAILURE(ec)) {
errln("FAIL: applyPattern");
return;
} else {
checkEqual(s, t, "toPattern(true)");
}
}
void UnicodeSetTest::copyWithIterator(UnicodeSet& t, const UnicodeSet& s, UBool withRange) {
t.clear();
UnicodeSetIterator it(s);
if (withRange) {
while (it.nextRange()) {
if (it.isString()) {
t.add(it.getString());
} else {
t.add(it.getCodepoint(), it.getCodepointEnd());
}
}
} else {
while (it.next()) {
if (it.isString()) {
t.add(it.getString());
} else {
t.add(it.getCodepoint());
}
}
}
}
UBool UnicodeSetTest::checkEqual(const UnicodeSet& s, const UnicodeSet& t, const char* message) {
UnicodeString source; s.toPattern(source, TRUE);
UnicodeString result; t.toPattern(result, TRUE);
if (s != t) {
errln((UnicodeString)"FAIL: " + message
+ "; source = " + source
+ "; result = " + result
);
return FALSE;
} else {
logln((UnicodeString)"Ok: " + message
+ "; source = " + source
+ "; result = " + result
);
}
return TRUE;
}
void
UnicodeSetTest::expectContainment(const UnicodeString& pat,
const UnicodeString& charsIn,
const UnicodeString& charsOut) {
UErrorCode ec = U_ZERO_ERROR;
UnicodeSet set(pat, ec);
if (U_FAILURE(ec)) {
errln((UnicodeString)"FAIL: pattern \"" +
pat + "\" => " + u_errorName(ec));
return;
}
expectContainment(set, pat, charsIn, charsOut);
}
void
UnicodeSetTest::expectContainment(const UnicodeSet& set,
const UnicodeString& charsIn,
const UnicodeString& charsOut) {
UnicodeString pat;
set.toPattern(pat);
expectContainment(set, pat, charsIn, charsOut);
}
void
UnicodeSetTest::expectContainment(const UnicodeSet& set,
const UnicodeString& setName,
const UnicodeString& charsIn,
const UnicodeString& charsOut) {
UnicodeString bad;
UChar32 c;
int32_t i;
for (i=0; i<charsIn.length(); i+=U16_LENGTH(c)) {
c = charsIn.char32At(i);
if (!set.contains(c)) {
bad.append(c);
}
}
if (bad.length() > 0) {
errln((UnicodeString)"Fail: set " + setName + " does not contain " + prettify(bad) +
", expected containment of " + prettify(charsIn));
} else {
logln((UnicodeString)"Ok: set " + setName + " contains " + prettify(charsIn));
}
bad.truncate(0);
for (i=0; i<charsOut.length(); i+=U16_LENGTH(c)) {
c = charsOut.char32At(i);
if (set.contains(c)) {
bad.append(c);
}
}
if (bad.length() > 0) {
errln((UnicodeString)"Fail: set " + setName + " contains " + prettify(bad) +
", expected non-containment of " + prettify(charsOut));
} else {
logln((UnicodeString)"Ok: set " + setName + " does not contain " + prettify(charsOut));
}
}
void
UnicodeSetTest::expectPattern(UnicodeSet& set,
const UnicodeString& pattern,
const UnicodeString& expectedPairs){
UErrorCode status = U_ZERO_ERROR;
set.applyPattern(pattern, status);
if (U_FAILURE(status)) {
errln(UnicodeString("FAIL: applyPattern(\"") + pattern +
"\") failed");
return;
} else {
if (getPairs(set) != expectedPairs ) {
errln(UnicodeString("FAIL: applyPattern(\"") + pattern +
"\") => pairs \"" +
escape(getPairs(set)) + "\", expected \"" +
escape(expectedPairs) + "\"");
} else {
logln(UnicodeString("Ok: applyPattern(\"") + pattern +
"\") => pairs \"" +
escape(getPairs(set)) + "\"");
}
}
UnicodeString temppattern;
set.toPattern(temppattern);
UnicodeSet *tempset=new UnicodeSet(temppattern, status);
if (U_FAILURE(status)) {
errln(UnicodeString("FAIL: applyPattern(\""+ pattern + "\").toPattern() => " + temppattern + " => invalid pattern"));
return;
}
if(*tempset != set || getPairs(*tempset) != getPairs(set)){
errln(UnicodeString("FAIL: applyPattern(\""+ pattern + "\").toPattern() => " + temppattern + " => pairs \""+ escape(getPairs(*tempset)) + "\", expected pairs \"" +
escape(getPairs(set)) + "\""));
} else{
logln(UnicodeString("Ok: applyPattern(\""+ pattern + "\").toPattern() => " + temppattern + " => pairs \"" + escape(getPairs(*tempset)) + "\""));
}
delete tempset;
}
void
UnicodeSetTest::expectPairs(const UnicodeSet& set, const UnicodeString& expectedPairs) {
if (getPairs(set) != expectedPairs) {
errln(UnicodeString("FAIL: Expected pair list \"") +
escape(expectedPairs) + "\", got \"" +
escape(getPairs(set)) + "\"");
}
}
void UnicodeSetTest::expectToPattern(const UnicodeSet& set,
const UnicodeString& expPat,
const char** expStrings) {
UnicodeString pat;
set.toPattern(pat, TRUE);
if (pat == expPat) {
logln((UnicodeString)"Ok: toPattern() => \"" + pat + "\"");
} else {
errln((UnicodeString)"FAIL: toPattern() => \"" + pat + "\", expected \"" + expPat + "\"");
return;
}
if (expStrings == NULL) {
return;
}
UBool in = TRUE;
for (int32_t i=0; expStrings[i] != NULL; ++i) {
if (expStrings[i] == NOT) { in = FALSE;
continue;
}
UnicodeString s = CharsToUnicodeString(expStrings[i]);
UBool contained = set.contains(s);
if (contained == in) {
logln((UnicodeString)"Ok: " + expPat +
(contained ? " contains {" : " does not contain {") +
escape(expStrings[i]) + "}");
} else {
errln((UnicodeString)"FAIL: " + expPat +
(contained ? " contains {" : " does not contain {") +
escape(expStrings[i]) + "}");
}
}
}
static UChar toHexString(int32_t i) { return (UChar)(i + (i < 10 ? 0x30 : (0x41 - 10))); }
void
UnicodeSetTest::doAssert(UBool condition, const char *message)
{
if (!condition) {
errln(UnicodeString("ERROR : ") + message);
}
}
UnicodeString
UnicodeSetTest::escape(const UnicodeString& s) {
UnicodeString buf;
for (int32_t i=0; i<s.length(); )
{
UChar32 c = s.char32At(i);
if (0x0020 <= c && c <= 0x007F) {
buf += c;
} else {
if (c <= 0xFFFF) {
buf += (UChar)0x5c; buf += (UChar)0x75;
} else {
buf += (UChar)0x5c; buf += (UChar)0x55;
buf += toHexString((c & 0xF0000000) >> 28);
buf += toHexString((c & 0x0F000000) >> 24);
buf += toHexString((c & 0x00F00000) >> 20);
buf += toHexString((c & 0x000F0000) >> 16);
}
buf += toHexString((c & 0xF000) >> 12);
buf += toHexString((c & 0x0F00) >> 8);
buf += toHexString((c & 0x00F0) >> 4);
buf += toHexString(c & 0x000F);
}
i += U16_LENGTH(c);
}
return buf;
}