Lines Matching refs:pos
31 const UChar *pos=pos_; in current() local
32 if(pos==NULL) { in current()
36 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ? in current()
60 UCharsTrie::branchNext(const UChar *pos, int32_t length, int32_t uchar) { in branchNext() argument
63 length=*pos++; in branchNext()
69 if(uchar<*pos++) { in branchNext()
71 pos=jumpByDelta(pos); in branchNext()
74 pos=skipDelta(pos); in branchNext()
81 if(uchar==*pos++) { in branchNext()
83 int32_t node=*pos; in branchNext()
89 ++pos; in branchNext()
95 delta=((node-kMinTwoUnitValueLead)<<16)|*pos++; in branchNext()
97 delta=(pos[0]<<16)|pos[1]; in branchNext()
98 pos+=2; in branchNext()
101 pos+=delta; in branchNext()
102 node=*pos; in branchNext()
105 pos_=pos; in branchNext()
109 pos=skipValue(pos); in branchNext()
111 if(uchar==*pos++) { in branchNext()
112 pos_=pos; in branchNext()
113 int32_t node=*pos; in branchNext()
122 UCharsTrie::nextImpl(const UChar *pos, int32_t uchar) { in nextImpl() argument
123 int32_t node=*pos++; in nextImpl()
126 return branchNext(pos, node, uchar); in nextImpl()
130 if(uchar==*pos++) { in nextImpl()
132 pos_=pos; in nextImpl()
133 return (length<0 && (node=*pos)>=kMinValueLead) ? in nextImpl()
144 pos=skipNodeValue(pos, node); in nextImpl()
154 const UChar *pos=pos_; in next() local
155 if(pos==NULL) { in next()
161 if(uchar==*pos++) { in next()
163 pos_=pos; in next()
165 return (length<0 && (node=*pos)>=kMinValueLead) ? in next()
172 return nextImpl(pos, uchar); in next()
181 const UChar *pos=pos_; in next() local
182 if(pos==NULL) { in next()
194 pos_=pos; in next()
196 return (length<0 && (node=*pos)>=kMinValueLead) ? in next()
203 if(uchar!=*pos) { in next()
207 ++pos; in next()
214 pos_=pos; in next()
216 return (length<0 && (node=*pos)>=kMinValueLead) ? in next()
225 if(uchar!=*pos) { in next()
229 ++pos; in next()
233 int32_t node=*pos++; in next()
236 UStringTrieResult result=branchNext(pos, node, uchar); in next()
257 pos=pos_; // branchNext() advanced pos and wrote it to pos_ . in next()
258 node=*pos++; in next()
262 if(uchar!=*pos) { in next()
266 ++pos; in next()
275 pos=skipNodeValue(pos, node); in next()
283 UCharsTrie::findUniqueValueFromBranch(const UChar *pos, int32_t length, in findUniqueValueFromBranch() argument
286 ++pos; // ignore the comparison unit in findUniqueValueFromBranch()
287 … if(NULL==findUniqueValueFromBranch(jumpByDelta(pos), length>>1, haveUniqueValue, uniqueValue)) { in findUniqueValueFromBranch()
291 pos=skipDelta(pos); in findUniqueValueFromBranch()
294 ++pos; // ignore a comparison unit in findUniqueValueFromBranch()
296 int32_t node=*pos++; in findUniqueValueFromBranch()
299 int32_t value=readValue(pos, node); in findUniqueValueFromBranch()
300 pos=skipValue(pos, node); in findUniqueValueFromBranch()
311 if(!findUniqueValue(pos+value, haveUniqueValue, uniqueValue)) { in findUniqueValueFromBranch()
317 return pos+1; // ignore the last comparison unit in findUniqueValueFromBranch()
321 UCharsTrie::findUniqueValue(const UChar *pos, UBool haveUniqueValue, int32_t &uniqueValue) { in findUniqueValue() argument
322 int32_t node=*pos++; in findUniqueValue()
326 node=*pos++; in findUniqueValue()
328 pos=findUniqueValueFromBranch(pos, node+1, haveUniqueValue, uniqueValue); in findUniqueValue()
329 if(pos==NULL) { in findUniqueValue()
333 node=*pos++; in findUniqueValue()
336 pos+=node-kMinLinearMatch+1; // Ignore the match units. in findUniqueValue()
337 node=*pos++; in findUniqueValue()
342 value=readValue(pos, node&0x7fff); in findUniqueValue()
344 value=readNodeValue(pos, node); in findUniqueValue()
357 pos=skipNodeValue(pos, node); in findUniqueValue()
365 const UChar *pos=pos_; in getNextUChars() local
366 if(pos==NULL) { in getNextUChars()
370 out.appendCodeUnit(*pos); // Next unit of a pending linear-match node. in getNextUChars()
373 int32_t node=*pos++; in getNextUChars()
378 pos=skipNodeValue(pos, node); in getNextUChars()
384 node=*pos++; in getNextUChars()
387 getNextBranchUChars(pos, node, out); in getNextUChars()
391 out.appendCodeUnit(*pos); in getNextUChars()
397 UCharsTrie::getNextBranchUChars(const UChar *pos, int32_t length, Appendable &out) { in getNextBranchUChars() argument
399 ++pos; // ignore the comparison unit in getNextBranchUChars()
400 getNextBranchUChars(jumpByDelta(pos), length>>1, out); in getNextBranchUChars()
402 pos=skipDelta(pos); in getNextBranchUChars()
405 out.appendCodeUnit(*pos++); in getNextBranchUChars()
406 pos=skipValue(pos); in getNextBranchUChars()
408 out.appendCodeUnit(*pos); in getNextBranchUChars()