Lines Matching refs:length
62 UCharsTrie::branchNext(const UChar *pos, int32_t length, int32_t uchar) {
64 if(length==0) {
65 length=*pos++;
67 ++length;
68 // The length of the branch is the number of units to select from.
70 while(length>kMaxBranchLinearSubNodeLength) {
72 length>>=1;
75 length=length-(length>>1);
80 // length>=2 because the loop body above sees length>kMaxBranchLinearSubNodeLength>=3
81 // and divides length by 2.
110 --length;
112 } while(length>1);
130 // Match the first of length+1 units.
131 int32_t length=node-kMinLinearMatch; // Actual match length minus 1.
133 remainingMatchLength_=--length;
135 return (length<0 && (node=*pos)>=kMinValueLead) ?
160 int32_t length=remainingMatchLength_; // Actual remaining match length minus 1.
161 if(length>=0) {
164 remainingMatchLength_=--length;
167 return (length<0 && (node=*pos)>=kMinValueLead) ?
188 int32_t length=remainingMatchLength_; // Actual remaining match length minus 1.
196 remainingMatchLength_=length;
199 return (length<0 && (node=*pos)>=kMinValueLead) ?
202 if(length<0) {
203 remainingMatchLength_=length;
211 --length;
216 remainingMatchLength_=length;
219 return (length<0 && (node=*pos)>=kMinValueLead) ?
224 if(length<0) {
225 remainingMatchLength_=length;
233 --length;
263 // Match length+1 units.
264 length=node-kMinLinearMatch; // Actual match length minus 1.
270 --length;
286 UCharsTrie::findUniqueValueFromBranch(const UChar *pos, int32_t length,
288 while(length>kMaxBranchLinearSubNodeLength) {
290 if(NULL==findUniqueValueFromBranch(jumpByDelta(pos), length>>1, haveUniqueValue, uniqueValue)) {
293 length=length-(length>>1);
319 } while(--length>1);
400 UCharsTrie::getNextBranchUChars(const UChar *pos, int32_t length, Appendable &out) {
401 while(length>kMaxBranchLinearSubNodeLength) {
403 getNextBranchUChars(jumpByDelta(pos), length>>1, out);
404 length=length-(length>>1);
410 } while(--length>1);
