Lines Matching full:complement
271 // Throw in a test of complement
272 set.complement();
392 set.complement();
592 c.complement();
596 logln((UnicodeString)"c.complement(): " + c);
598 errln((UnicodeString)"FAIL: c.complement() = " + c + ", expect " + exp);
600 c.complement();
603 logln((UnicodeString)"c.complement(): " + c);
605 errln((UnicodeString)"FAIL: c.complement() = " + c + ", expect " + exp);
626 //UnicodeSet::complement(class UnicodeString const &)
638 set.complement("ab");
641 if (set != exp) { errln("FAIL: complement(\"ab\")"); return; }
839 &((new UnicodeSet('a','z'))->add('A', 'Z').retain('M','m').complement('X')),
1509 set.complement();
1514 set.complement(start, end);
1515 set.complement();
1516 expectRange((UnicodeString)"!complement(" + start + "," + end + ")",
1518 set.complement(start);
1749 z.complement();
1755 checkCanonicalRep(z, (UnicodeString)"complement " + a);
1804 errln((UnicodeString)"FAILED: complement: " + x + " ^ " + y + " != " + z);
1805 errln((UnicodeString)"FAILED: complement: " + a + " ^ " + b + " != " + c);
1807 checkCanonicalRep(z, (UnicodeString)"complement " + a + "," + b);
2280 complement().
2281 complement(0x62).
2282 complement(0x64, 0x69).
2283 complement(idPattern).
2850 * The set may be the complement of the original.
3045 * and using the set or its complement (switching the spanConditions accordingly).
3047 * set.span(spanCondition) == set.complement().span(!spanCondition).
3463 // c -- set.span() and set.complement().span() boundaries may differ.
3513 "xyaxyaxyaxya" // set.complement().span(longest match) will stop here.
3514 "xx" // set.complement().span(contained) will stop between the two 'x'es.
3533 "byayaxy", // span() -> { 4, 7 } complement.span() -> { 7 }
3534 "byayax", // span() -> { 4, 6 } complement.span() -> { 6 }
3583 // On complement sets, span() and spanBack() get different results
3584 // because b is not in the complement set and there is an odd number of b's
3635 sets[SLOW_NOT]->complement();
