Searched refs:kMaxBranchLinearSubNodeLength (Results 1 - 18 of 18) sorted by relevance
| /external/icu/icu4c/source/common/unicode/ |
| H A D | stringtriebuilder.h | 134 // max(BytesTrie::kMaxBranchLinearSubNodeLength, UCharsTrie::kMaxBranchLinearSubNodeLength).
136 static const int32_t kMaxBranchLinearSubNodeLength=5; member in class:StringTrieBuilder
139 // log2(2^16/kMaxBranchLinearSubNodeLength) rounded up.
344 Node *equal[kMaxBranchLinearSubNodeLength]; // NULL means "has final value".
346 int32_t values[kMaxBranchLinearSubNodeLength];
347 UChar units[kMaxBranchLinearSubNodeLength];
|
| H A D | bytestriebuilder.h | 140 virtual int32_t getMaxBranchLinearSubNodeLength() const { return BytesTrie::kMaxBranchLinearSubNodeLength; }
|
| H A D | ucharstriebuilder.h | 147 virtual int32_t getMaxBranchLinearSubNodeLength() const { return UCharsTrie::kMaxBranchLinearSubNodeLength; }
|
| H A D | bytestrie.h | 443 // - If the length is at most kMaxBranchLinearSubNodeLength, then
449 // - If the length is greater than kMaxBranchLinearSubNodeLength, then
464 static const int32_t kMaxBranchLinearSubNodeLength=5; member in class:BytesTrie
|
| H A D | ucharstrie.h | 502 // - If the length is at most kMaxBranchLinearSubNodeLength, then
508 // - If the length is greater than kMaxBranchLinearSubNodeLength, then
523 static const int32_t kMaxBranchLinearSubNodeLength=5; member in class:UCharsTrie
|
| /external/icu/icu4c/source/common/ |
| H A D | bytestrie.cpp | 87 while(length>kMaxBranchLinearSubNodeLength) {
97 // length>=2 because the loop body above sees length>kMaxBranchLinearSubNodeLength>=3
316 while(length>kMaxBranchLinearSubNodeLength) {
420 while(length>kMaxBranchLinearSubNodeLength) {
|
| H A D | ucharstrie.cpp | 68 while(length>kMaxBranchLinearSubNodeLength) {
78 // length>=2 because the loop body above sees length>kMaxBranchLinearSubNodeLength>=3
285 while(length>kMaxBranchLinearSubNodeLength) {
398 while(length>kMaxBranchLinearSubNodeLength) {
|
| H A D | stringtriebuilder.cpp | 150 int32_t starts[kMaxBranchLinearSubNodeLength];
151 UBool isFinal[kMaxBranchLinearSubNodeLength-1];
167 int32_t jumpTargets[kMaxBranchLinearSubNodeLength-1];
|
| H A D | bytestrieiterator.cpp | 181 while(length>kMaxBranchLinearSubNodeLength) {
|
| H A D | ucharstrieiterator.cpp | 185 while(length>kMaxBranchLinearSubNodeLength) {
|
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| H A D | BytesTrie.java | 623 while(length>kMaxBranchLinearSubNodeLength) {
752 while(length>kMaxBranchLinearSubNodeLength) {
762 // length>=2 because the loop body above sees length>kMaxBranchLinearSubNodeLength>=3
852 while(length>kMaxBranchLinearSubNodeLength) {
926 while(length>kMaxBranchLinearSubNodeLength) {
964 // - If the length is at most kMaxBranchLinearSubNodeLength, then
970 // - If the length is greater than kMaxBranchLinearSubNodeLength, then
985 /*package*/ static final int kMaxBranchLinearSubNodeLength=5; field in class:BytesTrie
|
| H A D | CharsTrie.java | 567 while(length>kMaxBranchLinearSubNodeLength) {
707 while(length>kMaxBranchLinearSubNodeLength) {
717 // length>=2 because the loop body above sees length>kMaxBranchLinearSubNodeLength>=3
798 while(length>kMaxBranchLinearSubNodeLength) {
881 while(length>kMaxBranchLinearSubNodeLength) {
923 // - If the length is at most kMaxBranchLinearSubNodeLength, then
929 // - If the length is greater than kMaxBranchLinearSubNodeLength, then
944 /*package*/ static final int kMaxBranchLinearSubNodeLength=5; field in class:CharsTrie
|
| H A D | BytesTrieBuilder.java | 137 protected int getMaxBranchLinearSubNodeLength() /*const*/ { return BytesTrie.kMaxBranchLinearSubNodeLength; }
|
| H A D | CharsTrieBuilder.java | 115 protected int getMaxBranchLinearSubNodeLength() /*const*/ { return CharsTrie.kMaxBranchLinearSubNodeLength; }
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| H A D | BytesTrie.java | 658 while(length>kMaxBranchLinearSubNodeLength) {
787 while(length>kMaxBranchLinearSubNodeLength) {
797 // length>=2 because the loop body above sees length>kMaxBranchLinearSubNodeLength>=3
887 while(length>kMaxBranchLinearSubNodeLength) {
961 while(length>kMaxBranchLinearSubNodeLength) {
999 // - If the length is at most kMaxBranchLinearSubNodeLength, then
1005 // - If the length is greater than kMaxBranchLinearSubNodeLength, then
1020 /*package*/ static final int kMaxBranchLinearSubNodeLength=5; field in class:BytesTrie
|
| H A D | CharsTrie.java | 593 while(length>kMaxBranchLinearSubNodeLength) {
733 while(length>kMaxBranchLinearSubNodeLength) {
743 // length>=2 because the loop body above sees length>kMaxBranchLinearSubNodeLength>=3
824 while(length>kMaxBranchLinearSubNodeLength) {
907 while(length>kMaxBranchLinearSubNodeLength) {
949 // - If the length is at most kMaxBranchLinearSubNodeLength, then
955 // - If the length is greater than kMaxBranchLinearSubNodeLength, then
970 /*package*/ static final int kMaxBranchLinearSubNodeLength=5; field in class:CharsTrie
|
| H A D | BytesTrieBuilder.java | 141 protected int getMaxBranchLinearSubNodeLength() /*const*/ { return BytesTrie.kMaxBranchLinearSubNodeLength; }
|
| H A D | CharsTrieBuilder.java | 119 protected int getMaxBranchLinearSubNodeLength() /*const*/ { return CharsTrie.kMaxBranchLinearSubNodeLength; }
|
Completed in 333 milliseconds