Searched refs:kMinLinearMatch (Results 1 – 16 of 16) sorted by relevance
127 if(node<kMinLinearMatch) { in nextImpl()131 int32_t length=node-kMinLinearMatch; // Actual match length minus 1. in nextImpl()238 if(node<kMinLinearMatch) { in next()264 length=node-kMinLinearMatch; // Actual match length minus 1. in next()327 if(node<kMinLinearMatch) { in findUniqueValue()339 pos+=node-kMinLinearMatch+1; // Ignore the match units. in findUniqueValue()385 if(node<kMinLinearMatch) { in getNextUChars()
154 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()
163 if(node<kMinLinearMatch) { in next()173 int32_t length=node-kMinLinearMatch+1; in next()
149 if(node<kMinLinearMatch) { in next()159 int32_t length=node-kMinLinearMatch+1; in next()
290 if(node<kMinLinearMatch) { in next()308 length=node-kMinLinearMatch; // Actual match length minus 1. in next()389 if(node<kMinLinearMatch) { in getNextBytes()596 if(node<kMinLinearMatch) { in next()606 int length=node-kMinLinearMatch+1; in next()827 if(node<kMinLinearMatch) { in nextImpl()831 int length=node-kMinLinearMatch; // Actual match length minus 1. in nextImpl()903 if(node<kMinLinearMatch) { in findUniqueValue()914 pos+=node-kMinLinearMatch+1; // Ignore the match bytes. in findUniqueValue()998 /*package*/ static final int kMinLinearMatch=0x10; local[all …]
257 if(node<kMinLinearMatch) { in next()276 length=node-kMinLinearMatch; // Actual match length minus 1. in next()356 if(node<kMinLinearMatch) { in getNextChars()536 if(node<kMinLinearMatch) { in next()546 int length=node-kMinLinearMatch+1; in next()773 if(node<kMinLinearMatch) { in nextImpl()777 int length=node-kMinLinearMatch; // Actual match length minus 1. in nextImpl()849 if(node<kMinLinearMatch) { in findUniqueValue()861 pos+=node-kMinLinearMatch+1; // Ignore the match units. in findUniqueValue()956 /*package*/ static final int kMinLinearMatch=0x30; field in CharsTrie[all …]
125 protected int getMinLinearMatch() /*const*/ { return CharsTrie.kMinLinearMatch; } in getMinLinearMatch()
147 protected int getMinLinearMatch() /*const*/ { return BytesTrie.kMinLinearMatch; } in getMinLinearMatch()
306 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 …]
268 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 …]
129 protected int getMinLinearMatch() /*const*/ { return CharsTrie.kMinLinearMatch; } in getMinLinearMatch()
151 protected int getMinLinearMatch() /*const*/ { return BytesTrie.kMinLinearMatch; } in getMinLinearMatch()
468 static const int32_t kMinLinearMatch=0x10; variable476 static const int32_t kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x20
528 static const int32_t kMinLinearMatch=0x30; variable534 static const int32_t kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength; // 0x0040
150 virtual int32_t getMinLinearMatch() const { return UCharsTrie::kMinLinearMatch; } in getMinLinearMatch()
142 virtual int32_t getMinLinearMatch() const { return BytesTrie::kMinLinearMatch; } in getMinLinearMatch()