Lines Matching refs:length
65 int32_t length=remainingMatchLength_; // Actual remaining match length minus 1.
66 if(length>=0) {
68 ++length;
69 if(maxLength_>0 && length>maxLength_) {
70 length=maxLength_; // This will leave remainingMatchLength>=0 as a signal.
72 str_->append(reinterpret_cast<const char *>(pos_), length, errorCode);
73 pos_+=length;
74 remainingMatchLength_-=length;
87 int32_t length=remainingMatchLength_+1; // Remaining match length.
88 if(maxLength_>0 && length>maxLength_) {
89 length=maxLength_;
91 str_->truncate(length);
92 pos_+=length;
93 remainingMatchLength_-=length;
114 int32_t length=stack_->elementAti(stackSize-1);
117 str_->truncate(length&0xffff);
118 length=(int32_t)((uint32_t)length>>16);
119 if(length>1) {
120 pos=branchNext(pos, length, errorCode);
139 if(isFinal || (maxLength_>0 && str_->length()==maxLength_)) {
146 if(maxLength_>0 && str_->length()==maxLength_) {
158 // Linear-match node, append length bytes to str_.
159 int32_t length=node-kMinLinearMatch+1;
160 if(maxLength_>0 && str_->length()+length>maxLength_) {
162 maxLength_-str_->length(), errorCode);
165 str_->append(reinterpret_cast<const char *>(pos), length, errorCode);
166 pos+=length;
185 BytesTrie::Iterator::branchNext(const uint8_t *pos, int32_t length, UErrorCode &errorCode) {
186 while(length>kMaxBranchLinearSubNodeLength) {
190 stack_->addElement(((length-(length>>1))<<16)|str_->length(), errorCode);
192 length>>=1;
203 stack_->addElement(((length-1)<<16)|str_->length(), errorCode);
