Searched refs:kMinLinearMatch (Results 1 – 12 of 12) sorted by relevance
125 if(node<kMinLinearMatch) { in nextImpl()129 int32_t length=node-kMinLinearMatch; // Actual match length minus 1. in nextImpl()235 if(node<kMinLinearMatch) { in next()261 length=node-kMinLinearMatch; // Actual match length minus 1. in next()324 if(node<kMinLinearMatch) { in findUniqueValue()336 pos+=node-kMinLinearMatch+1; // Ignore the match units. in findUniqueValue()382 if(node<kMinLinearMatch) { in getNextUChars()
152 if(node<kMinLinearMatch) { in nextImpl()156 int32_t length=node-kMinLinearMatch; // Actual match length minus 1. in nextImpl()266 if(node<kMinLinearMatch) { in next()291 length=node-kMinLinearMatch; // Actual match length minus 1. in next()354 if(node<kMinLinearMatch) { in findUniqueValue()365 pos+=node-kMinLinearMatch+1; // Ignore the match bytes. in findUniqueValue()405 if(node<kMinLinearMatch) { in getNextBytes()
161 if(node<kMinLinearMatch) { in next()171 int32_t length=node-kMinLinearMatch+1; in next()
148 if(node<kMinLinearMatch) { in next()158 int32_t length=node-kMinLinearMatch+1; in next()
304 if(node<kMinLinearMatch) { in next()322 length=node-kMinLinearMatch; // Actual match length minus 1. in next()406 if(node<kMinLinearMatch) { in getNextBytes()621 if(node<kMinLinearMatch) { in next()631 int length=node-kMinLinearMatch+1; in next()852 if(node<kMinLinearMatch) { in nextImpl()856 int length=node-kMinLinearMatch; // Actual match length minus 1. in nextImpl()928 if(node<kMinLinearMatch) { in findUniqueValue()939 pos+=node-kMinLinearMatch+1; // Ignore the match bytes. in findUniqueValue()1023 /*package*/ static final int kMinLinearMatch=0x10; local[all …]
266 if(node<kMinLinearMatch) { in next()285 length=node-kMinLinearMatch; // Actual match length minus 1. in next()368 if(node<kMinLinearMatch) { in getNextChars()553 if(node<kMinLinearMatch) { in next()563 int length=node-kMinLinearMatch+1; in next()790 if(node<kMinLinearMatch) { in nextImpl()794 int length=node-kMinLinearMatch; // Actual match length minus 1. in nextImpl()866 if(node<kMinLinearMatch) { in findUniqueValue()878 pos+=node-kMinLinearMatch+1; // Ignore the match units. in findUniqueValue()973 /*package*/ static final int kMinLinearMatch=0x30; field in CharsTrie[all …]
127 protected int getMinLinearMatch() /*const*/ { return CharsTrie.kMinLinearMatch; } in getMinLinearMatch()
149 protected int getMinLinearMatch() /*const*/ { return BytesTrie.kMinLinearMatch; } in getMinLinearMatch()
467 static const int32_t kMinLinearMatch=0x10; variable475 static const int32_t kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x20
526 static const int32_t kMinLinearMatch=0x30; variable532 static const int32_t kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x0040
148 virtual int32_t getMinLinearMatch() const { return UCharsTrie::kMinLinearMatch; } in getMinLinearMatch()
141 virtual int32_t getMinLinearMatch() const { return BytesTrie::kMinLinearMatch; } in getMinLinearMatch()