Lines Matching full:testcases
1324 } testCases[]={
1352 LENGTHOF(testCases));
1354 for(i=0; i<LENGTHOF(testCases); ++i) {
1355 dir = ubidi_getBaseDirection(testCases[i].s, testCases[i].length );
2172 } testCases[]={
2191 log_verbose("inverse Bidi: testInverse(L) with %u test cases ---\n", LENGTHOF(testCases));
2192 for(i=0; i<LENGTHOF(testCases); ++i) {
2195 _testInverseBidi(pBiDi, testCases[i].s, testCases[i].length, 0, &errorCode);
2198 log_verbose("inverse Bidi: testInverse(R) with %u test cases ---\n", LENGTHOF(testCases));
2199 for(i=0; i<LENGTHOF(testCases); ++i) {
2202 _testInverseBidi(pBiDi, testCases[i].s, testCases[i].length, 1, &errorCode);
3898 } testCases[] = {
3956 for (i = 0, nCases = LENGTHOF(testCases); i < nCases; i++) {
3957 srcLen = strlen(testCases[i].textIn);
3958 pseudoToU16(srcLen, testCases[i].textIn, src);
3969 checkWhatYouCan(pBiDi, testCases[i].textIn, destChars);
3970 assertStringsEqual(testCases[i].textOut[option][level], destChars,
3971 testCases[i].textIn, "UBIDI_REORDER_RUNS_ONLY",
3975 if((option==0) && testCases[i].noroundtrip[level]) {
3984 checkWhatYouCan(pL2VBiDi, testCases[i].textIn, vis1Chars);
3993 testCases[i].textIn, "UBIDI_REORDER_RUNS_ONLY (2)",
