HomeSort by relevance Sort by last modified time
    Searched refs:UTRIE2_INDEX_2_BLOCK_LENGTH (Results 1 - 11 of 11) sorted by null

  /external/icu/icu4c/source/common/
utrie2_impl.h 98 * Round up to UTRIE2_INDEX_2_BLOCK_LENGTH for proper compacting.
116 UTRIE2_INDEX_2_BLOCK_LENGTH,
utrie2_builder.cpp 76 UNEWTRIE2_INDEX_2_START_OFFSET=UNEWTRIE2_INDEX_2_NULL_OFFSET+UTRIE2_INDEX_2_BLOCK_LENGTH,
202 for(i=0; i<UTRIE2_INDEX_2_BLOCK_LENGTH; ++i) {
211 ++i, j+=UTRIE2_INDEX_2_BLOCK_LENGTH
476 newTop=newBlock+UTRIE2_INDEX_2_BLOCK_LENGTH;
486 uprv_memcpy(trie->index2+newBlock, trie->index2+trie->index2NullOffset, UTRIE2_INDEX_2_BLOCK_LENGTH*4);
867 index2Length-=UTRIE2_INDEX_2_BLOCK_LENGTH;
870 if(equal_int32(idx+block, idx+otherBlock, UTRIE2_INDEX_2_BLOCK_LENGTH)) {
939 for(i2=UTRIE2_INDEX_2_BLOCK_LENGTH; i2>0;) {
    [all...]
utrie2.h 738 UTRIE2_INDEX_2_BLOCK_LENGTH=1<<UTRIE2_SHIFT_1_2,
741 UTRIE2_INDEX_2_MASK=UTRIE2_INDEX_2_BLOCK_LENGTH-1,
    [all...]
utrie2.cpp 653 i2Limit=UTRIE2_INDEX_2_BLOCK_LENGTH;
  /external/icu/android_icu4j/src/main/java/android/icu/impl/
Trie2Writable.java 109 for(i=0; i<UTRIE2_INDEX_2_BLOCK_LENGTH; ++i) {
118 ++i, j+=UTRIE2_INDEX_2_BLOCK_LENGTH
172 newTop=newBlock+UTRIE2_INDEX_2_BLOCK_LENGTH;
182 System.arraycopy(index2, index2NullOffset, index2, newBlock, UTRIE2_INDEX_2_BLOCK_LENGTH);
631 index2Length-=UTRIE2_INDEX_2_BLOCK_LENGTH;
634 if(equal_int(index2, block, otherBlock, UTRIE2_INDEX_2_BLOCK_LENGTH)) {
696 for(i2=UTRIE2_INDEX_2_BLOCK_LENGTH; i2>0;) {
849 for(start=0, i=0; start<newStart; start+=UTRIE2_INDEX_2_BLOCK_LENGTH, ++i) {
871 start+=UTRIE2_INDEX_2_BLOCK_LENGTH;
879 for(overlap=UTRIE2_INDEX_2_BLOCK_LENGTH-1
    [all...]
Trie2.java 715 static final int UTRIE2_INDEX_2_BLOCK_LENGTH=1<<UTRIE2_SHIFT_1_2;
718 static final int UTRIE2_INDEX_2_MASK=UTRIE2_INDEX_2_BLOCK_LENGTH-1;
805 * Round up to UTRIE2_INDEX_2_BLOCK_LENGTH for proper compacting.
823 UTRIE2_INDEX_2_BLOCK_LENGTH;
    [all...]
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
Trie2Writable.java 107 for(i=0; i<UTRIE2_INDEX_2_BLOCK_LENGTH; ++i) {
116 ++i, j+=UTRIE2_INDEX_2_BLOCK_LENGTH
170 newTop=newBlock+UTRIE2_INDEX_2_BLOCK_LENGTH;
180 System.arraycopy(index2, index2NullOffset, index2, newBlock, UTRIE2_INDEX_2_BLOCK_LENGTH);
629 index2Length-=UTRIE2_INDEX_2_BLOCK_LENGTH;
632 if(equal_int(index2, block, otherBlock, UTRIE2_INDEX_2_BLOCK_LENGTH)) {
694 for(i2=UTRIE2_INDEX_2_BLOCK_LENGTH; i2>0;) {
847 for(start=0, i=0; start<newStart; start+=UTRIE2_INDEX_2_BLOCK_LENGTH, ++i) {
869 start+=UTRIE2_INDEX_2_BLOCK_LENGTH;
877 for(overlap=UTRIE2_INDEX_2_BLOCK_LENGTH-1
    [all...]
Trie2.java 713 static final int UTRIE2_INDEX_2_BLOCK_LENGTH=1<<UTRIE2_SHIFT_1_2;
716 static final int UTRIE2_INDEX_2_MASK=UTRIE2_INDEX_2_BLOCK_LENGTH-1;
803 * Round up to UTRIE2_INDEX_2_BLOCK_LENGTH for proper compacting.
821 UTRIE2_INDEX_2_BLOCK_LENGTH;
    [all...]
  /prebuilts/misc/common/icu4j/
icu4j.jar 
  /prebuilts/tools/common/m2/repository/com/ibm/icu/icu4j/53.1/
icu4j-53.1.jar 
  /prebuilts/tools/common/m2/repository/com/ibm/icu/icu4j/54.1.1/
icu4j-54.1.1.jar 

Completed in 707 milliseconds