Lines Matching refs:length
62 int32_t length=remainingMatchLength_; // Actual remaining match length minus 1.
63 if(length>=0) {
65 ++length;
66 if(maxLength_>0 && length>maxLength_) {
67 length=maxLength_; // This will leave remainingMatchLength>=0 as a signal.
69 str_.append(pos_, length);
70 pos_+=length;
71 remainingMatchLength_-=length;
84 int32_t length=remainingMatchLength_+1; // Remaining match length.
85 if(maxLength_>0 && length>maxLength_) {
86 length=maxLength_;
88 str_.truncate(length);
89 pos_+=length;
90 remainingMatchLength_-=length;
111 int32_t length=stack_->elementAti(stackSize-1);
114 str_.truncate(length&0xffff);
115 length=(int32_t)((uint32_t)length>>16);
116 if(length>1) {
117 pos=branchNext(pos, length, errorCode);
145 if(isFinal || (maxLength_>0 && str_.length()==maxLength_)) {
158 if(maxLength_>0 && str_.length()==maxLength_) {
170 // Linear-match node, append length units to str_.
171 int32_t length=node-kMinLinearMatch+1;
172 if(maxLength_>0 && str_.length()+length>maxLength_) {
173 str_.append(pos, maxLength_-str_.length());
176 str_.append(pos, length);
177 pos+=length;
184 UCharsTrie::Iterator::branchNext(const UChar *pos, int32_t length, UErrorCode &errorCode) {
185 while(length>kMaxBranchLinearSubNodeLength) {
189 stack_->addElement(((length-(length>>1))<<16)|str_.length(), errorCode);
191 length>>=1;
202 stack_->addElement(((length-1)<<16)|str_.length(), errorCode);
