Searched refs:kValueIsFinal (Results 1 – 14 of 14) sorted by relevance
234 valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in current()275 valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in next()319 valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in next()361 } else if((node&kValueIsFinal)!=0) { in next()426 if((node&kValueIsFinal)!=0) { in getNextBytes()629 boolean isFinal=(node&kValueIsFinal)!=0; in next()690 boolean isFinal=(node&kValueIsFinal)!=0; in branchNext()824 if((node&kValueIsFinal)!=0) { in branchNext()850 … result= node>=kMinValueLead ? valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in branchNext()861 return node>=kMinValueLead ? valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in branchNext()[all …]
329 } else if((node&kValueIsFinal)!=0) { in next()354 return (leadUnit&kValueIsFinal)!=0 ? in getValue()394 if((node&kValueIsFinal)!=0) { in getNextChars()558 boolean isFinal=(node&kValueIsFinal)!=0; in next()633 boolean isFinal=(node&kValueIsFinal)!=0; in branchNext()702 assert(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal); in readNodeValue()714 assert(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal); in skipNodeValue()777 if((node&kValueIsFinal)!=0) { in branchNext()832 } else if((node&kValueIsFinal)!=0) { in nextImpl()865 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()
251 valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in current()294 valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in next()339 valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in next()381 } else if((node&kValueIsFinal)!=0) { in next()449 if((node&kValueIsFinal)!=0) { in getNextBytes()663 boolean isFinal=(node&kValueIsFinal)!=0; in next()725 boolean isFinal=(node&kValueIsFinal)!=0; in branchNext()859 if((node&kValueIsFinal)!=0) { in branchNext()885 … result= node>=kMinValueLead ? valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in branchNext()896 return node>=kMinValueLead ? valueResults_[node&kValueIsFinal] : Result.NO_VALUE; in branchNext()[all …]
344 } else if((node&kValueIsFinal)!=0) { in next()370 return (leadUnit&kValueIsFinal)!=0 ? in getValue()412 if((node&kValueIsFinal)!=0) { in getNextChars()584 boolean isFinal=(node&kValueIsFinal)!=0; in next()660 boolean isFinal=(node&kValueIsFinal)!=0; in branchNext()729 assert(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal); in readNodeValue()741 assert(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal); in skipNodeValue()804 if((node&kValueIsFinal)!=0) { in branchNext()859 } else if((node&kValueIsFinal)!=0) { in nextImpl()892 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()
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()
439 return (UStringTrieResult)(USTRINGTRIE_INTERMEDIATE_VALUE-(node&kValueIsFinal)); in valueResult()514 static const int32_t kValueIsFinal=1; variable
262 return leadUnit&kValueIsFinal ? in getValue()574 static const int32_t kValueIsFinal=0x8000; variable
META-INF/ META-INF/MANIFEST.MF com/ com/ibm/ com/ ...