Searched refs:kValueIsFinal (Results 1 – 11 of 11) sorted by relevance
254 valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in current()297 valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in next()342 valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in next()384 } else if((node&kValueIsFinal)!=0) { in next()452 if((node&kValueIsFinal)!=0) { in getNextBytes()666 boolean isFinal=(node&kValueIsFinal)!=0; in next()728 boolean isFinal=(node&kValueIsFinal)!=0; in branchNext()862 if((node&kValueIsFinal)!=0) { in branchNext()888 … result= node>=kMinValueLead ? valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in branchNext()899 return node>=kMinValueLead ? valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in branchNext()[all …]
347 } else if((node&kValueIsFinal)!=0) { in next()373 return (leadUnit&kValueIsFinal)!=0 ? in getValue()415 if((node&kValueIsFinal)!=0) { in getNextChars()587 boolean isFinal=(node&kValueIsFinal)!=0; in next()663 boolean isFinal=(node&kValueIsFinal)!=0; in branchNext()732 assert(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal); in readNodeValue()744 assert(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal); in skipNodeValue()807 if((node&kValueIsFinal)!=0) { in branchNext()862 } else if((node&kValueIsFinal)!=0) { in nextImpl()895 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()
238 valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in current()279 valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in next()323 valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in next()365 } else if((node&kValueIsFinal)!=0) { in next()430 if((node&kValueIsFinal)!=0) { in getNextBytes()633 boolean isFinal=(node&kValueIsFinal)!=0; in next()694 boolean isFinal=(node&kValueIsFinal)!=0; in branchNext()828 if((node&kValueIsFinal)!=0) { in branchNext()854 … result= node>=kMinValueLead ? valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in branchNext()865 return node>=kMinValueLead ? valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in branchNext()[all …]
333 } else if((node&kValueIsFinal)!=0) { in next()358 return (leadUnit&kValueIsFinal)!=0 ? in getValue()398 if((node&kValueIsFinal)!=0) { in getNextChars()562 boolean isFinal=(node&kValueIsFinal)!=0; in next()637 boolean isFinal=(node&kValueIsFinal)!=0; in branchNext()706 assert(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal); in readNodeValue()718 assert(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal); in skipNodeValue()781 if((node&kValueIsFinal)!=0) { in branchNext()836 } else if((node&kValueIsFinal)!=0) { in nextImpl()869 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()272 } else if(node&kValueIsFinal) { in next()378 if(node&kValueIsFinal) { in getNextUChars()
137 UBool isFinal=(UBool)(node&kValueIsFinal); in next()199 UBool isFinal=(UBool)(node&kValueIsFinal); in branchNext()
441 return (UStringTrieResult)(USTRINGTRIE_INTERMEDIATE_VALUE-(node&kValueIsFinal)); in valueResult()516 static const int32_t kValueIsFinal=1; variable
264 return leadUnit&kValueIsFinal ? in getValue()576 static const int32_t kValueIsFinal=0x8000; variable