Lines Matching refs:toRules
202 * ALSO test that the result of toRules() for each rule is a valid
258 // Now test toRules
260 t->toRules(rules, TRUE);
1507 // as toRules() is going to return it. If toRules() changes
1524 t->toRules(r, TRUE);
1526 logln((UnicodeString)"OK: toRules() => " + r);
1528 errln((UnicodeString)"FAIL: toRules() => " + r +
1533 // Now test toRules
1540 t->toRules(r, TRUE);
1542 errln((UnicodeString)"FAIL: toRules() => " + r +
1545 logln((UnicodeString)"OK: toRules() => " + r);
1549 // Round trip the result of toRules
1558 // Test toRules again
1559 t->toRules(r, TRUE);
1561 errln((UnicodeString)"FAIL: toRules() => " + r +
1564 logln((UnicodeString)"OK: toRules() => " + r);
1739 t->toRules(rules, FALSE);
1740 t->toRules(escapedRules, TRUE);
2484 t->toRules(rr, TRUE);
2486 errln((UnicodeString)"FAIL: \"" + r + "\" x toRules() => \"" + rr + "\"");
2488 logln((UnicodeString)"Ok: \"" + r + "\" x toRules() => \"" + rr + "\"");
2501 t->toRules(rr, TRUE);
2503 errln((UnicodeString)"FAIL: \"" + r + "\" x toRules() => \"" + rr + "\"");
2505 logln((UnicodeString)"Ok: \"" + r + "\" x toRules() => \"" + rr + "\"");
3119 UnicodeString rules2; t2.toRules(rules2, TRUE);
3135 * Mark's toRules test.
3183 checkRules("Failed toRules FORWARD", *t2, UnicodeString(testRulesForward, -1, US_INV));
3184 checkRules("Failed toRules BACKWARD", *t3, UnicodeString(testRulesBackward, -1, US_INV));
3620 // as toRules() is going to return it. If toRules() changes
3634 t->toRules(r, TRUE);
3636 logln((UnicodeString)"OK: toRules() => " + r);
3638 errln((UnicodeString)"FAIL: toRules() => " + r +
4371 // a Transliterator from the rules, do toRules() on it, instantiate a Transliterator from
4383 t->toRules(rules, TRUE);
4409 reversed->toRules(rules, FALSE);
4456 t1->toRules(rules1, TRUE);
4457 t2->toRules(rules2, TRUE);
4492 t1->toRules(rules1, TRUE);
4493 t2->toRules(rules2, TRUE);
