Lines Matching full:expectedcount
358 static void printStringBreaks(UText *tstr, int expected[], int expectedCount) {
365 if (nextExpectedIndex < expectedCount && j >= expected[nextExpectedIndex] ) {
396 static void printStringBreaks(const UnicodeString &ustr, int expected[], int expectedCount) {
404 printStringBreaks(tstr, expected, expectedCount);
3599 int expectedcount)
3607 if (count < expectedcount && expected[count] != i) {
3614 if (count != expectedcount) {
3615 printStringBreaks(ustr, expected, expectedcount);
3617 expectedcount - count);
3621 for (i = 1; i < expectedcount; i ++) {
3624 printStringBreaks(ustr, expected, expectedcount);
3630 printStringBreaks(ustr, expected, expectedcount);
3640 printStringBreaks(ustr, expected, expectedcount);
3647 printStringBreaks(ustr, expected, expectedcount);
3653 for (i = 0; i < expectedcount - 1; i ++) {
3658 expectedcount);
3731 int expectedcount = 0;
3736 expected[expectedcount ++] = i;
3739 testBreakBoundPreceding(this, ustr, bi, expected, expectedcount);
3905 int expectedcount = 0;
3910 if (expectedcount >= EXPECTEDSIZE) {
3911 TEST_ASSERT(expectedcount < EXPECTEDSIZE);
3914 expected[expectedcount ++] = i;
3917 testBreakBoundPreceding(this, ustr, bi, expected, expectedcount);
3969 int expectedcount = 0;
3974 if (expectedcount >= EXPECTEDSIZE) {
3975 TEST_ASSERT(expectedcount < EXPECTEDSIZE);
3978 expected[expectedcount ++] = i;
3981 testBreakBoundPreceding(this, ustr, bi, expected, expectedcount);
4117 int expectedCount = 0;
4178 expectedCount = 0;
4188 U_ASSERT(expectedCount<testText.length());
4189 expected[expectedCount ++] = breakPos;
4334 printStringBreaks(testText, expected, expectedCount);
