Searched refs:kMinLinearMatch (Results 1 - 8 of 8) sorted by relevance

/macosx-10.9.5/ICU-511.35/icuSources/common/
H A Dbytestrie.cpp152 if(node<kMinLinearMatch) {
156 int32_t length=node-kMinLinearMatch; // Actual match length minus 1.
266 if(node<kMinLinearMatch) {
291 length=node-kMinLinearMatch; // Actual match length minus 1.
354 if(node<kMinLinearMatch) {
365 pos+=node-kMinLinearMatch+1; // Ignore the match bytes.
405 if(node<kMinLinearMatch) {
H A Ducharstrie.cpp125 if(node<kMinLinearMatch) {
129 int32_t length=node-kMinLinearMatch; // Actual match length minus 1.
235 if(node<kMinLinearMatch) {
261 length=node-kMinLinearMatch; // Actual match length minus 1.
324 if(node<kMinLinearMatch) {
336 pos+=node-kMinLinearMatch+1; // Ignore the match units.
382 if(node<kMinLinearMatch) {
H A Dbytestrieiterator.cpp148 if(node<kMinLinearMatch) {
158 int32_t length=node-kMinLinearMatch+1;
H A Ducharstrieiterator.cpp161 if(node<kMinLinearMatch) {
171 int32_t length=node-kMinLinearMatch+1;
/macosx-10.9.5/ICU-511.35/icuSources/common/unicode/
H A Dbytestriebuilder.h135 virtual int32_t getMinLinearMatch() const { return BytesTrie::kMinLinearMatch; }
H A Ducharstriebuilder.h142 virtual int32_t getMinLinearMatch() const { return UCharsTrie::kMinLinearMatch; }
H A Dbytestrie.h467 static const int32_t kMinLinearMatch=0x10; member in class:BytesTrie
475 static const int32_t kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x20
H A Ducharstrie.h526 static const int32_t kMinLinearMatch=0x30; member in class:UCharsTrie
532 static const int32_t kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x0040

Completed in 183 milliseconds