Home
last modified time | relevance | path

Searched refs:kMinLinearMatch (Results 1 – 16 of 16) sorted by relevance

/external/icu/icu4c/source/common/
Ducharstrie.cpp127 if(node<kMinLinearMatch) { in nextImpl()
131 int32_t length=node-kMinLinearMatch; // Actual match length minus 1. in nextImpl()
237 if(node<kMinLinearMatch) { in next()
263 length=node-kMinLinearMatch; // Actual match length minus 1. in next()
326 if(node<kMinLinearMatch) { in findUniqueValue()
338 pos+=node-kMinLinearMatch+1; // Ignore the match units. in findUniqueValue()
384 if(node<kMinLinearMatch) { in getNextUChars()
Dbytestrie.cpp154 if(node<kMinLinearMatch) { in nextImpl()
158 int32_t length=node-kMinLinearMatch; // Actual match length minus 1. in nextImpl()
268 if(node<kMinLinearMatch) { in next()
293 length=node-kMinLinearMatch; // Actual match length minus 1. in next()
356 if(node<kMinLinearMatch) { in findUniqueValue()
367 pos+=node-kMinLinearMatch+1; // Ignore the match bytes. in findUniqueValue()
407 if(node<kMinLinearMatch) { in getNextBytes()
Ducharstrieiterator.cpp163 if(node<kMinLinearMatch) { in next()
173 int32_t length=node-kMinLinearMatch+1; in next()
Dbytestrieiterator.cpp149 if(node<kMinLinearMatch) { in next()
159 int32_t length=node-kMinLinearMatch+1; in next()
/external/icu/android_icu4j/src/main/java/android/icu/util/
DBytesTrie.java288 if(node<kMinLinearMatch) { in next()
306 length=node-kMinLinearMatch; // Actual match length minus 1. in next()
387 if(node<kMinLinearMatch) { in getNextBytes()
592 if(node<kMinLinearMatch) { in next()
602 int length=node-kMinLinearMatch+1; in next()
823 if(node<kMinLinearMatch) { in nextImpl()
827 int length=node-kMinLinearMatch; // Actual match length minus 1. in nextImpl()
899 if(node<kMinLinearMatch) { in findUniqueValue()
910 pos+=node-kMinLinearMatch+1; // Ignore the match bytes. in findUniqueValue()
994 /*package*/ static final int kMinLinearMatch=0x10; local
[all …]
DCharsTrie.java256 if(node<kMinLinearMatch) { in next()
275 length=node-kMinLinearMatch; // Actual match length minus 1. in next()
355 if(node<kMinLinearMatch) { in getNextChars()
533 if(node<kMinLinearMatch) { in next()
543 int length=node-kMinLinearMatch+1; in next()
770 if(node<kMinLinearMatch) { in nextImpl()
774 int length=node-kMinLinearMatch; // Actual match length minus 1. in nextImpl()
846 if(node<kMinLinearMatch) { in findUniqueValue()
858 pos+=node-kMinLinearMatch+1; // Ignore the match units. in findUniqueValue()
953 /*package*/ static final int kMinLinearMatch=0x30; field in CharsTrie
[all …]
DCharsTrieBuilder.java125 protected int getMinLinearMatch() /*const*/ { return CharsTrie.kMinLinearMatch; } in getMinLinearMatch()
DBytesTrieBuilder.java147 protected int getMinLinearMatch() /*const*/ { return BytesTrie.kMinLinearMatch; } in getMinLinearMatch()
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
DBytesTrie.java306 if(node<kMinLinearMatch) { in next()
324 length=node-kMinLinearMatch; // Actual match length minus 1. in next()
408 if(node<kMinLinearMatch) { in getNextBytes()
626 if(node<kMinLinearMatch) { in next()
636 int length=node-kMinLinearMatch+1; in next()
858 if(node<kMinLinearMatch) { in nextImpl()
862 int length=node-kMinLinearMatch; // Actual match length minus 1. in nextImpl()
934 if(node<kMinLinearMatch) { in findUniqueValue()
945 pos+=node-kMinLinearMatch+1; // Ignore the match bytes. in findUniqueValue()
1029 /*package*/ static final int kMinLinearMatch=0x10; local
[all …]
DCharsTrie.java268 if(node<kMinLinearMatch) { in next()
287 length=node-kMinLinearMatch; // Actual match length minus 1. in next()
370 if(node<kMinLinearMatch) { in getNextChars()
558 if(node<kMinLinearMatch) { in next()
568 int length=node-kMinLinearMatch+1; in next()
796 if(node<kMinLinearMatch) { in nextImpl()
800 int length=node-kMinLinearMatch; // Actual match length minus 1. in nextImpl()
872 if(node<kMinLinearMatch) { in findUniqueValue()
884 pos+=node-kMinLinearMatch+1; // Ignore the match units. in findUniqueValue()
979 /*package*/ static final int kMinLinearMatch=0x30; field in CharsTrie
[all …]
DCharsTrieBuilder.java129 protected int getMinLinearMatch() /*const*/ { return CharsTrie.kMinLinearMatch; } in getMinLinearMatch()
DBytesTrieBuilder.java151 protected int getMinLinearMatch() /*const*/ { return BytesTrie.kMinLinearMatch; } in getMinLinearMatch()
/external/icu/icu4c/source/common/unicode/
Dbytestrie.h468 static const int32_t kMinLinearMatch=0x10; variable
476 static const int32_t kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x20
Ducharstrie.h528 static const int32_t kMinLinearMatch=0x30; variable
534 static const int32_t kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x0040
Ducharstriebuilder.h150 virtual int32_t getMinLinearMatch() const { return UCharsTrie::kMinLinearMatch; } in getMinLinearMatch()
Dbytestriebuilder.h142 virtual int32_t getMinLinearMatch() const { return BytesTrie::kMinLinearMatch; } in getMinLinearMatch()