Searched refs:kValueIsFinal (Results 1 – 11 of 11) sorted by relevance
202 valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in current()245 valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in next()290 valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in next()332 } else if((node&kValueIsFinal)!=0) { in next()400 if((node&kValueIsFinal)!=0) { in getNextBytes()614 boolean isFinal=(node&kValueIsFinal)!=0; in next()676 boolean isFinal=(node&kValueIsFinal)!=0; in branchNext()810 if((node&kValueIsFinal)!=0) { in branchNext()836 … result= node>=kMinValueLead ? valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in branchNext()847 return node>=kMinValueLead ? valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in branchNext()[all …]
295 } else if((node&kValueIsFinal)!=0) { in next()321 return (leadUnit&kValueIsFinal)!=0 ? in getValue()363 if((node&kValueIsFinal)!=0) { in getNextChars()535 boolean isFinal=(node&kValueIsFinal)!=0; in next()611 boolean isFinal=(node&kValueIsFinal)!=0; in branchNext()680 assert(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal); in readNodeValue()692 assert(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal); in skipNodeValue()755 if((node&kValueIsFinal)!=0) { in branchNext()810 } else if((node&kValueIsFinal)!=0) { in nextImpl()843 boolean isFinal=(node&kValueIsFinal)!=0; in findUniqueValueFromBranch()[all …]
203 return write(i|(isFinal ? CharsTrie.kValueIsFinal : 0)); in writeValueAndFinal()219 intUnits[0]=(char)(intUnits[0]|(isFinal ? CharsTrie.kValueIsFinal : 0)); in writeValueAndFinal()
187 valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in current()228 valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in next()272 valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in next()314 } else if((node&kValueIsFinal)!=0) { in next()379 if((node&kValueIsFinal)!=0) { in getNextBytes()580 boolean isFinal=(node&kValueIsFinal)!=0; in next()641 boolean isFinal=(node&kValueIsFinal)!=0; in branchNext()775 if((node&kValueIsFinal)!=0) { in branchNext()801 … result= node>=kMinValueLead ? valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in branchNext()812 return node>=kMinValueLead ? valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in branchNext()[all …]
283 } else if((node&kValueIsFinal)!=0) { in next()308 return (leadUnit&kValueIsFinal)!=0 ? in getValue()348 if((node&kValueIsFinal)!=0) { in getNextChars()510 boolean isFinal=(node&kValueIsFinal)!=0; in next()585 boolean isFinal=(node&kValueIsFinal)!=0; in branchNext()654 assert(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal); in readNodeValue()666 assert(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal); in skipNodeValue()729 if((node&kValueIsFinal)!=0) { in branchNext()784 } else if((node&kValueIsFinal)!=0) { in nextImpl()817 boolean isFinal=(node&kValueIsFinal)!=0; in findUniqueValueFromBranch()[all …]
199 return write(i|(isFinal ? CharsTrie.kValueIsFinal : 0)); in writeValueAndFinal()215 intUnits[0]=(char)(intUnits[0]|(isFinal ? CharsTrie.kValueIsFinal : 0)); in writeValueAndFinal()
106 if(node&kValueIsFinal) { in branchNext()168 } else if(node&kValueIsFinal) { in nextImpl()301 } else if(node&kValueIsFinal) { in next()330 UBool isFinal=(UBool)(node&kValueIsFinal); in findUniqueValueFromBranch()369 UBool isFinal=(UBool)(node&kValueIsFinal); in findUniqueValue()399 if(node&kValueIsFinal) { in getNextBytes()
86 if(node&kValueIsFinal) { in branchNext()141 } else if(node&kValueIsFinal) { in nextImpl()271 } else if(node&kValueIsFinal) { in next()377 if(node&kValueIsFinal) { in getNextUChars()
137 UBool isFinal=(UBool)(node&kValueIsFinal); in next()199 UBool isFinal=(UBool)(node&kValueIsFinal); in branchNext()
403 return (UStringTrieResult)(USTRINGTRIE_INTERMEDIATE_VALUE-(node&kValueIsFinal)); in valueResult()478 static const int32_t kValueIsFinal=1; variable
226 return leadUnit&kValueIsFinal ? in getValue()538 static const int32_t kValueIsFinal=0x8000; variable