Lines Matching refs:length
60 UCharsTrie::branchNext(const UChar *pos, int32_t length, int32_t uchar) {
62 if(length==0) {
63 length=*pos++;
65 ++length;
66 // The length of the branch is the number of units to select from.
68 while(length>kMaxBranchLinearSubNodeLength) {
70 length>>=1;
73 length=length-(length>>1);
78 // length>=2 because the loop body above sees length>kMaxBranchLinearSubNodeLength>=3
79 // and divides length by 2.
108 --length;
110 } while(length>1);
128 // Match the first of length+1 units.
129 int32_t length=node-kMinLinearMatch; // Actual match length minus 1.
131 remainingMatchLength_=--length;
133 return (length<0 && (node=*pos)>=kMinValueLead) ?
158 int32_t length=remainingMatchLength_; // Actual remaining match length minus 1.
159 if(length>=0) {
162 remainingMatchLength_=--length;
165 return (length<0 && (node=*pos)>=kMinValueLead) ?
185 int32_t length=remainingMatchLength_; // Actual remaining match length minus 1.
193 remainingMatchLength_=length;
196 return (length<0 && (node=*pos)>=kMinValueLead) ?
199 if(length<0) {
200 remainingMatchLength_=length;
208 --length;
213 remainingMatchLength_=length;
216 return (length<0 && (node=*pos)>=kMinValueLead) ?
221 if(length<0) {
222 remainingMatchLength_=length;
230 --length;
260 // Match length+1 units.
261 length=node-kMinLinearMatch; // Actual match length minus 1.
267 --length;
283 UCharsTrie::findUniqueValueFromBranch(const UChar *pos, int32_t length,
285 while(length>kMaxBranchLinearSubNodeLength) {
287 if(NULL==findUniqueValueFromBranch(jumpByDelta(pos), length>>1, haveUniqueValue, uniqueValue)) {
290 length=length-(length>>1);
316 } while(--length>1);
397 UCharsTrie::getNextBranchUChars(const UChar *pos, int32_t length, Appendable &out) {
398 while(length>kMaxBranchLinearSubNodeLength) {
400 getNextBranchUChars(jumpByDelta(pos), length>>1, out);
401 length=length-(length>>1);
407 } while(--length>1);