Lines Matching refs:length
64 int32_t length=remainingMatchLength_; // Actual remaining match length minus 1.
65 if(length>=0) {
67 ++length;
68 if(maxLength_>0 && length>maxLength_) {
69 length=maxLength_; // This will leave remainingMatchLength>=0 as a signal.
71 str_.append(pos_, length);
72 pos_+=length;
73 remainingMatchLength_-=length;
86 int32_t length=remainingMatchLength_+1; // Remaining match length.
87 if(maxLength_>0 && length>maxLength_) {
88 length=maxLength_;
90 str_.truncate(length);
91 pos_+=length;
92 remainingMatchLength_-=length;
113 int32_t length=stack_->elementAti(stackSize-1);
116 str_.truncate(length&0xffff);
117 length=(int32_t)((uint32_t)length>>16);
118 if(length>1) {
119 pos=branchNext(pos, length, errorCode);
147 if(isFinal || (maxLength_>0 && str_.length()==maxLength_)) {
160 if(maxLength_>0 && str_.length()==maxLength_) {
172 // Linear-match node, append length units to str_.
173 int32_t length=node-kMinLinearMatch+1;
174 if(maxLength_>0 && str_.length()+length>maxLength_) {
175 str_.append(pos, maxLength_-str_.length());
178 str_.append(pos, length);
179 pos+=length;
186 UCharsTrie::Iterator::branchNext(const UChar *pos, int32_t length, UErrorCode &errorCode) {
187 while(length>kMaxBranchLinearSubNodeLength) {
191 stack_->addElement(((length-(length>>1))<<16)|str_.length(), errorCode);
193 length>>=1;
204 stack_->addElement(((length-1)<<16)|str_.length(), errorCode);
