Lines Matching refs:node
35 int32_t node; in current() local
36 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ? in current()
37 valueResult(node) : USTRINGTRIE_NO_VALUE; in current()
83 int32_t node=*pos; in branchNext() local
84 if(node&kValueIsFinal) { in branchNext()
92 if(node<kMinTwoUnitValueLead) { in branchNext()
93 delta=node; in branchNext()
94 } else if(node<kThreeUnitValueLead) { in branchNext()
95 delta=((node-kMinTwoUnitValueLead)<<16)|*pos++; in branchNext()
102 node=*pos; in branchNext()
103 result= node>=kMinValueLead ? valueResult(node) : USTRINGTRIE_NO_VALUE; in branchNext()
113 int32_t node=*pos; in branchNext() local
114 return node>=kMinValueLead ? valueResult(node) : USTRINGTRIE_NO_VALUE; in branchNext()
123 int32_t node=*pos++; in nextImpl() local
125 if(node<kMinLinearMatch) { in nextImpl()
126 return branchNext(pos, node, uchar); in nextImpl()
127 } else if(node<kMinValueLead) { in nextImpl()
129 int32_t length=node-kMinLinearMatch; // Actual match length minus 1. in nextImpl()
133 return (length<0 && (node=*pos)>=kMinValueLead) ? in nextImpl()
134 valueResult(node) : USTRINGTRIE_NO_VALUE; in nextImpl()
139 } else if(node&kValueIsFinal) { in nextImpl()
144 pos=skipNodeValue(pos, node); in nextImpl()
145 node&=kNodeTypeMask; in nextImpl()
164 int32_t node; in next() local
165 return (length<0 && (node=*pos)>=kMinValueLead) ? in next()
166 valueResult(node) : USTRINGTRIE_NO_VALUE; in next()
195 int32_t node; in next() local
196 return (length<0 && (node=*pos)>=kMinValueLead) ? in next()
197 valueResult(node) : USTRINGTRIE_NO_VALUE; in next()
215 int32_t node; in next() local
216 return (length<0 && (node=*pos)>=kMinValueLead) ? in next()
217 valueResult(node) : USTRINGTRIE_NO_VALUE; in next()
233 int32_t node=*pos++; in next() local
235 if(node<kMinLinearMatch) { in next()
236 UStringTrieResult result=branchNext(pos, node, uchar); in next()
258 node=*pos++; in next()
259 } else if(node<kMinValueLead) { in next()
261 length=node-kMinLinearMatch; // Actual match length minus 1. in next()
269 } else if(node&kValueIsFinal) { in next()
275 pos=skipNodeValue(pos, node); in next()
276 node&=kNodeTypeMask; in next()
296 int32_t node=*pos++; in findUniqueValueFromBranch() local
297 UBool isFinal=(UBool)(node>>15); in findUniqueValueFromBranch()
298 node&=0x7fff; in findUniqueValueFromBranch()
299 int32_t value=readValue(pos, node); in findUniqueValueFromBranch()
300 pos=skipValue(pos, node); in findUniqueValueFromBranch()
322 int32_t node=*pos++; in findUniqueValue() local
324 if(node<kMinLinearMatch) { in findUniqueValue()
325 if(node==0) { in findUniqueValue()
326 node=*pos++; in findUniqueValue()
328 pos=findUniqueValueFromBranch(pos, node+1, haveUniqueValue, uniqueValue); in findUniqueValue()
333 node=*pos++; in findUniqueValue()
334 } else if(node<kMinValueLead) { in findUniqueValue()
336 pos+=node-kMinLinearMatch+1; // Ignore the match units. in findUniqueValue()
337 node=*pos++; in findUniqueValue()
339 UBool isFinal=(UBool)(node>>15); in findUniqueValue()
342 value=readValue(pos, node&0x7fff); in findUniqueValue()
344 value=readNodeValue(pos, node); in findUniqueValue()
357 pos=skipNodeValue(pos, node); in findUniqueValue()
358 node&=kNodeTypeMask; in findUniqueValue()
373 int32_t node=*pos++; in getNextUChars() local
374 if(node>=kMinValueLead) { in getNextUChars()
375 if(node&kValueIsFinal) { in getNextUChars()
378 pos=skipNodeValue(pos, node); in getNextUChars()
379 node&=kNodeTypeMask; in getNextUChars()
382 if(node<kMinLinearMatch) { in getNextUChars()
383 if(node==0) { in getNextUChars()
384 node=*pos++; in getNextUChars()
386 out.reserveAppendCapacity(++node); in getNextUChars()
387 getNextBranchUChars(pos, node, out); in getNextUChars()
388 return node; in getNextUChars()