Home
last modified time | relevance | path

Searched refs:COUNT_REPEAT_SEGMENTS (Results 1 – 3 of 3) sorted by relevance

/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/bidi/
DTestInverse.java82 private static final int COUNT_REPEAT_SEGMENTS = 6; field in TestInverse
91 for (i = 0; i < COUNT_REPEAT_SEGMENTS; ++i) { in _testManyInverseBidi()
94 for (j = 0; j < COUNT_REPEAT_SEGMENTS; ++j) { in _testManyInverseBidi()
97 for (k = 0; k < COUNT_REPEAT_SEGMENTS; ++k) { in _testManyInverseBidi()
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/bidi/
DTestInverse.java83 private static final int COUNT_REPEAT_SEGMENTS = 6; field in TestInverse
92 for (i = 0; i < COUNT_REPEAT_SEGMENTS; ++i) { in _testManyInverseBidi()
95 for (j = 0; j < COUNT_REPEAT_SEGMENTS; ++j) { in _testManyInverseBidi()
98 for (k = 0; k < COUNT_REPEAT_SEGMENTS; ++k) { in _testManyInverseBidi()
/external/icu/icu4c/source/test/cintltst/
Dcbiditst.c2230 #define COUNT_REPEAT_SEGMENTS 6 macro
2232 static const UChar repeatSegments[COUNT_REPEAT_SEGMENTS][2]={
2249 for(i=0; i<COUNT_REPEAT_SEGMENTS; ++i) { in _testManyInverseBidi()
2252 for(j=0; j<COUNT_REPEAT_SEGMENTS; ++j) { in _testManyInverseBidi()
2255 for(k=0; k<COUNT_REPEAT_SEGMENTS; ++k) { in _testManyInverseBidi()