Searched refs:kMaxBranchLinearSubNodeLength (Results 1 - 18 of 18) sorted by relevance
| /external/icu/icu4c/source/common/unicode/ |
| H A D | stringtriebuilder.h | 136 // max(BytesTrie::kMaxBranchLinearSubNodeLength, UCharsTrie::kMaxBranchLinearSubNodeLength).
138 static const int32_t kMaxBranchLinearSubNodeLength=5; member in class:StringTrieBuilder
141 // log2(2^16/kMaxBranchLinearSubNodeLength) rounded up.
356 Node *equal[kMaxBranchLinearSubNodeLength]; // NULL means "has final value".
358 int32_t values[kMaxBranchLinearSubNodeLength];
359 UChar units[kMaxBranchLinearSubNodeLength];
|
| H A D | bytestriebuilder.h | 141 virtual int32_t getMaxBranchLinearSubNodeLength() const { return BytesTrie::kMaxBranchLinearSubNodeLength; }
|
| H A D | ucharstriebuilder.h | 149 virtual int32_t getMaxBranchLinearSubNodeLength() const { return UCharsTrie::kMaxBranchLinearSubNodeLength; }
|
| H A D | bytestrie.h | 444 // - If the length is at most kMaxBranchLinearSubNodeLength, then
450 // - If the length is greater than kMaxBranchLinearSubNodeLength, then
465 static const int32_t kMaxBranchLinearSubNodeLength=5; member in class:BytesTrie
|
| H A D | ucharstrie.h | 504 // - If the length is at most kMaxBranchLinearSubNodeLength, then
510 // - If the length is greater than kMaxBranchLinearSubNodeLength, then
525 static const int32_t kMaxBranchLinearSubNodeLength=5; member in class:UCharsTrie
|
| /external/icu/icu4c/source/common/ |
| H A D | bytestrie.cpp | 89 while(length>kMaxBranchLinearSubNodeLength) {
99 // length>=2 because the loop body above sees length>kMaxBranchLinearSubNodeLength>=3
318 while(length>kMaxBranchLinearSubNodeLength) {
422 while(length>kMaxBranchLinearSubNodeLength) {
|
| H A D | ucharstrie.cpp | 70 while(length>kMaxBranchLinearSubNodeLength) {
80 // length>=2 because the loop body above sees length>kMaxBranchLinearSubNodeLength>=3
287 while(length>kMaxBranchLinearSubNodeLength) {
400 while(length>kMaxBranchLinearSubNodeLength) {
|
| H A D | stringtriebuilder.cpp | 152 int32_t starts[kMaxBranchLinearSubNodeLength];
153 UBool isFinal[kMaxBranchLinearSubNodeLength-1];
169 int32_t jumpTargets[kMaxBranchLinearSubNodeLength-1];
|
| H A D | bytestrieiterator.cpp | 186 while(length>kMaxBranchLinearSubNodeLength) {
|
| H A D | ucharstrieiterator.cpp | 187 while(length>kMaxBranchLinearSubNodeLength) {
|
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| H A D | BytesTrie.java | 629 while(length>kMaxBranchLinearSubNodeLength) {
758 while(length>kMaxBranchLinearSubNodeLength) {
768 // length>=2 because the loop body above sees length>kMaxBranchLinearSubNodeLength>=3
858 while(length>kMaxBranchLinearSubNodeLength) {
932 while(length>kMaxBranchLinearSubNodeLength) {
970 // - If the length is at most kMaxBranchLinearSubNodeLength, then
976 // - If the length is greater than kMaxBranchLinearSubNodeLength, then
991 /*package*/ static final int kMaxBranchLinearSubNodeLength=5; field in class:BytesTrie
|
| H A D | CharsTrie.java | 573 while(length>kMaxBranchLinearSubNodeLength) {
713 while(length>kMaxBranchLinearSubNodeLength) {
723 // length>=2 because the loop body above sees length>kMaxBranchLinearSubNodeLength>=3
804 while(length>kMaxBranchLinearSubNodeLength) {
887 while(length>kMaxBranchLinearSubNodeLength) {
929 // - If the length is at most kMaxBranchLinearSubNodeLength, then
935 // - If the length is greater than kMaxBranchLinearSubNodeLength, then
950 /*package*/ static final int kMaxBranchLinearSubNodeLength=5; field in class:CharsTrie
|
| H A D | BytesTrieBuilder.java | 139 protected int getMaxBranchLinearSubNodeLength() /*const*/ { return BytesTrie.kMaxBranchLinearSubNodeLength; }
|
| H A D | CharsTrieBuilder.java | 117 protected int getMaxBranchLinearSubNodeLength() /*const*/ { return CharsTrie.kMaxBranchLinearSubNodeLength; }
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| H A D | BytesTrie.java | 664 while(length>kMaxBranchLinearSubNodeLength) {
793 while(length>kMaxBranchLinearSubNodeLength) {
803 // length>=2 because the loop body above sees length>kMaxBranchLinearSubNodeLength>=3
893 while(length>kMaxBranchLinearSubNodeLength) {
967 while(length>kMaxBranchLinearSubNodeLength) {
1005 // - If the length is at most kMaxBranchLinearSubNodeLength, then
1011 // - If the length is greater than kMaxBranchLinearSubNodeLength, then
1026 /*package*/ static final int kMaxBranchLinearSubNodeLength=5; field in class:BytesTrie
|
| H A D | CharsTrie.java | 599 while(length>kMaxBranchLinearSubNodeLength) {
739 while(length>kMaxBranchLinearSubNodeLength) {
749 // length>=2 because the loop body above sees length>kMaxBranchLinearSubNodeLength>=3
830 while(length>kMaxBranchLinearSubNodeLength) {
913 while(length>kMaxBranchLinearSubNodeLength) {
955 // - If the length is at most kMaxBranchLinearSubNodeLength, then
961 // - If the length is greater than kMaxBranchLinearSubNodeLength, then
976 /*package*/ static final int kMaxBranchLinearSubNodeLength=5; field in class:CharsTrie
|
| H A D | BytesTrieBuilder.java | 143 protected int getMaxBranchLinearSubNodeLength() /*const*/ { return BytesTrie.kMaxBranchLinearSubNodeLength; }
|
| H A D | CharsTrieBuilder.java | 121 protected int getMaxBranchLinearSubNodeLength() /*const*/ { return CharsTrie.kMaxBranchLinearSubNodeLength; }
|
Completed in 174 milliseconds