Lines Matching refs:length
63 int32_t length=remainingMatchLength_; // Actual remaining match length minus 1.
64 if(length>=0) {
66 ++length;
67 if(maxLength_>0 && length>maxLength_) {
68 length=maxLength_; // This will leave remainingMatchLength>=0 as a signal.
70 str_->append(reinterpret_cast<const char *>(pos_), length, errorCode);
71 pos_+=length;
72 remainingMatchLength_-=length;
85 int32_t length=remainingMatchLength_+1; // Remaining match length.
86 if(maxLength_>0 && length>maxLength_) {
87 length=maxLength_;
89 str_->truncate(length);
90 pos_+=length;
91 remainingMatchLength_-=length;
112 int32_t length=stack_->elementAti(stackSize-1);
115 str_->truncate(length&0xffff);
116 length=(int32_t)((uint32_t)length>>16);
117 if(length>1) {
118 pos=branchNext(pos, length, errorCode);
137 if(isFinal || (maxLength_>0 && str_->length()==maxLength_)) {
142 sp_.set(str_->data(), str_->length());
145 if(maxLength_>0 && str_->length()==maxLength_) {
157 // Linear-match node, append length bytes to str_.
158 int32_t length=node-kMinLinearMatch+1;
159 if(maxLength_>0 && str_->length()+length>maxLength_) {
161 maxLength_-str_->length(), errorCode);
164 str_->append(reinterpret_cast<const char *>(pos), length, errorCode);
165 pos+=length;
173 sp_.set(str_->data(), str_->length());
180 BytesTrie::Iterator::branchNext(const uint8_t *pos, int32_t length, UErrorCode &errorCode) {
181 while(length>kMaxBranchLinearSubNodeLength) {
185 stack_->addElement(((length-(length>>1))<<16)|str_->length(), errorCode);
187 length>>=1;
198 stack_->addElement(((length-1)<<16)|str_->length(), errorCode);
202 sp_.set(str_->data(), str_->length());