Lines Matching refs:toRules
204 * ALSO test that the result of toRules() for each rule is a valid
264 // Now test toRules
266 t->toRules(rules, TRUE);
1513 // as toRules() is going to return it. If toRules() changes
1530 t->toRules(r, TRUE);
1532 logln((UnicodeString)"OK: toRules() => " + r);
1534 errln((UnicodeString)"FAIL: toRules() => " + r +
1539 // Now test toRules
1546 t->toRules(r, TRUE);
1548 errln((UnicodeString)"FAIL: toRules() => " + r +
1551 logln((UnicodeString)"OK: toRules() => " + r);
1555 // Round trip the result of toRules
1564 // Test toRules again
1565 t->toRules(r, TRUE);
1567 errln((UnicodeString)"FAIL: toRules() => " + r +
1570 logln((UnicodeString)"OK: toRules() => " + r);
1745 t->toRules(rules, FALSE);
1746 t->toRules(escapedRules, TRUE);
2490 t->toRules(rr, TRUE);
2492 errln((UnicodeString)"FAIL: \"" + r + "\" x toRules() => \"" + rr + "\"");
2494 logln((UnicodeString)"Ok: \"" + r + "\" x toRules() => \"" + rr + "\"");
2507 t->toRules(rr, TRUE);
2509 errln((UnicodeString)"FAIL: \"" + r + "\" x toRules() => \"" + rr + "\"");
2511 logln((UnicodeString)"Ok: \"" + r + "\" x toRules() => \"" + rr + "\"");
3125 UnicodeString rules2; t2.toRules(rules2, TRUE);
3141 * Mark's toRules test.
3189 checkRules("Failed toRules FORWARD", *t2, UnicodeString(testRulesForward, -1, US_INV));
3190 checkRules("Failed toRules BACKWARD", *t3, UnicodeString(testRulesBackward, -1, US_INV));
3631 // as toRules() is going to return it. If toRules() changes
3645 t->toRules(r, TRUE);
3647 logln((UnicodeString)"OK: toRules() => " + r);
3649 errln((UnicodeString)"FAIL: toRules
4382 // a Transliterator from the rules, do toRules() on it, instantiate a Transliterator from
4394 t->toRules(rules, TRUE);
4420 reversed->toRules(rules, FALSE);
4467 t1->toRules(rules1, TRUE);
4468 t2->toRules(rules2, TRUE);
4503 t1->toRules(rules1, TRUE);
4504 t2->toRules(rules2, TRUE);
