Lines Matching refs:cpCount
164 int32_t cpCount = 0; in TestString() local
182 cpCount++; in TestString()
194 TestAccess(sa, ut, cpCount, cpMap); in TestString()
205 TestAccess(sa, ut, cpCount, cpMap); in TestString()
214 TestAccess(sa, ut, cpCount, cpMap); in TestString()
215 TestCMR(sa, ut, cpCount, cpMap, cpMap); in TestString()
223 TestAccess(sa, ut, cpCount, cpMap); in TestString()
231 TestAccess(sa, ut, cpCount, cpMap); in TestString()
232 TestCMR(sa, ut, cpCount, cpMap, cpMap); in TestString()
242 TestAccess(sa, ut, cpCount, cpMap); in TestString()
252 TestAccess(sa, ut, cpCount, cpMap); in TestString()
267 for (j=0; j<cpCount ; j++) { // code point number in TestString()
272 u8Map[cpCount].nativeIdx = u8Len; // position following the last char in utf-8 string. in TestString()
278 TestAccess(sa, ut, cpCount, u8Map); in TestString()
298 void UTextTest::TestCMR(const UnicodeString &us, UText *ut, int cpCount, m *nativeMap, m *u16Map) { in TestCMR() argument
325 case 3: srcLength = cpCount / 3; in TestCMR()
331 case 3: srcIndex = cpCount - srcLength; break; in TestCMR()
332 case 4: srcIndex = cpCount - srcLength - 1; break; in TestCMR()
333 case 5: srcIndex = cpCount / 2; break; in TestCMR()
335 if (srcIndex < 0 || srcIndex + srcLength > cpCount) { in TestCMR()
351 case 5: destIndex = cpCount-1; break; in TestCMR()
352 case 6: destIndex = cpCount; break; in TestCMR()
354 if (destIndex<0 || destIndex>cpCount) { in TestCMR()
552 void UTextTest::TestAccess(const UnicodeString &us, UText *ut, int cpCount, m *cpMap) { in TestAccess() argument
554 TestAccessNoClone(us, ut, cpCount, cpMap); in TestAccess()
561 TestAccessNoClone(us, shallowClone, cpCount, cpMap); in TestAccess()
574 TestAccessNoClone(us, deepClone, cpCount, cpMap); in TestAccess()
585 void UTextTest::TestAccessNoClone(const UnicodeString &us, UText *ut, int cpCount, m *cpMap) { in TestAccessNoClone() argument
592 int64_t expectedLen = cpMap[cpCount].nativeIdx; in TestAccessNoClone()
608 for (i=0; i<cpCount; i++) { in TestAccessNoClone()
626 for (i=0; i<cpCount; i++) { in TestAccessNoClone()
653 for (i=cpCount-1; i>=0; i--) { in TestAccessNoClone()
687 for (i=cpCount-1; i>=0; i--) { in TestAccessNoClone()
718 for (i=0; i<cpCount; i++) { in TestAccessNoClone()
719 cpIndex = (cpIndex + 9973) % cpCount; in TestAccessNoClone()
730 for (i=0; i<cpCount; i++) { in TestAccessNoClone()
731 cpIndex = (cpIndex + 9973) % cpCount; in TestAccessNoClone()
748 for (i=1; i<=cpCount; i++) { in TestAccessNoClone()
759 for (i=2; i<cpCount; i+=2) { in TestAccessNoClone()
769 i = cpMap[cpCount].nativeIdx; in TestAccessNoClone()
771 for (i=cpCount; i>=0; i--) { in TestAccessNoClone()
782 i = cpMap[cpCount].nativeIdx; in TestAccessNoClone()
784 for (i=cpCount; i>=0; i-=3) { in TestAccessNoClone()