Lines Matching refs:cpCount

165     int32_t       cpCount = 0;  in TestString()  local
183 cpCount++; in TestString()
195 TestAccess(sa, ut, cpCount, cpMap); in TestString()
206 TestAccess(sa, ut, cpCount, cpMap); in TestString()
215 TestAccess(sa, ut, cpCount, cpMap); in TestString()
216 TestCMR(sa, ut, cpCount, cpMap, cpMap); in TestString()
224 TestAccess(sa, ut, cpCount, cpMap); in TestString()
232 TestAccess(sa, ut, cpCount, cpMap); in TestString()
233 TestCMR(sa, ut, cpCount, cpMap, cpMap); in TestString()
243 TestAccess(sa, ut, cpCount, cpMap); in TestString()
253 TestAccess(sa, ut, cpCount, cpMap); in TestString()
268 for (j=0; j<cpCount ; j++) { // code point number in TestString()
273 u8Map[cpCount].nativeIdx = u8Len; // position following the last char in utf-8 string. in TestString()
279 TestAccess(sa, ut, cpCount, u8Map); in TestString()
299 void UTextTest::TestCMR(const UnicodeString &us, UText *ut, int cpCount, m *nativeMap, m *u16Map) { in TestCMR() argument
326 case 3: srcLength = cpCount / 3; in TestCMR()
332 case 3: srcIndex = cpCount - srcLength; break; in TestCMR()
333 case 4: srcIndex = cpCount - srcLength - 1; break; in TestCMR()
334 case 5: srcIndex = cpCount / 2; break; in TestCMR()
336 if (srcIndex < 0 || srcIndex + srcLength > cpCount) { in TestCMR()
352 case 5: destIndex = cpCount-1; break; in TestCMR()
353 case 6: destIndex = cpCount; break; in TestCMR()
355 if (destIndex<0 || destIndex>cpCount) { in TestCMR()
553 void UTextTest::TestAccess(const UnicodeString &us, UText *ut, int cpCount, m *cpMap) { in TestAccess() argument
555 TestAccessNoClone(us, ut, cpCount, cpMap); in TestAccess()
562 TestAccessNoClone(us, shallowClone, cpCount, cpMap); in TestAccess()
575 TestAccessNoClone(us, deepClone, cpCount, cpMap); in TestAccess()
586 void UTextTest::TestAccessNoClone(const UnicodeString &us, UText *ut, int cpCount, m *cpMap) { in TestAccessNoClone() argument
593 int64_t expectedLen = cpMap[cpCount].nativeIdx; in TestAccessNoClone()
609 for (i=0; i<cpCount; i++) { in TestAccessNoClone()
627 for (i=0; i<cpCount; i++) { in TestAccessNoClone()
654 for (i=cpCount-1; i>=0; i--) { in TestAccessNoClone()
688 for (i=cpCount-1; i>=0; i--) { in TestAccessNoClone()
719 for (i=0; i<cpCount; i++) { in TestAccessNoClone()
720 cpIndex = (cpIndex + 9973) % cpCount; in TestAccessNoClone()
731 for (i=0; i<cpCount; i++) { in TestAccessNoClone()
732 cpIndex = (cpIndex + 9973) % cpCount; in TestAccessNoClone()
749 for (i=1; i<=cpCount; i++) { in TestAccessNoClone()
760 for (i=2; i<cpCount; i+=2) { in TestAccessNoClone()
770 i = cpMap[cpCount].nativeIdx; in TestAccessNoClone()
772 for (i=cpCount; i>=0; i--) { in TestAccessNoClone()
783 i = cpMap[cpCount].nativeIdx; in TestAccessNoClone()
785 for (i=cpCount; i>=0; i-=3) { in TestAccessNoClone()