Lines Matching full:str_
28 str_(NULL), maxLength_(maxStringLength), value_(0), stack_(NULL) {
32 // str_ and stack_ are pointers so that it's easy to turn bytestrie.h into
38 str_=new CharString();
40 if(U_SUCCESS(errorCode) && (str_==NULL || stack_==NULL)) {
50 str_(NULL), maxLength_(maxStringLength), value_(0), stack_(NULL) {
54 str_=new CharString();
59 if(str_==NULL || stack_==NULL) {
65 // Pending linear-match node, append remaining bytes to str_.
70 str_->append(reinterpret_cast<const char *>(pos_), length, errorCode);
77 delete str_;
89 str_->truncate(length);
115 str_->truncate(length&0xffff);
123 str_->append((char)*pos++, 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_.
159 if(maxLength_>0 && str_->length()+length>maxLength_) {
160 str_->append(reinterpret_cast<const char *>(pos),
161 maxLength_-str_->length(), errorCode);
164 str_->append(reinterpret_cast<const char *>(pos), length, errorCode);
173 sp_.set(str_->data(), str_->length());
185 stack_->addElement(((length-(length>>1))<<16)|str_->length(), errorCode);
198 stack_->addElement(((length-1)<<16)|str_->length(), errorCode);
199 str_->append((char)trieByte, errorCode);
202 sp_.set(str_->data(), str_->length());
