Lines Matching refs:str_
30 str_(NULL), maxLength_(maxStringLength), value_(0), stack_(NULL) {
34 // str_ and stack_ are pointers so that it's easy to turn bytestrie.h into
40 str_=new CharString();
42 if(U_SUCCESS(errorCode) && (str_==NULL || stack_==NULL)) {
52 str_(NULL), maxLength_(maxStringLength), value_(0), stack_(NULL) {
56 str_=new CharString();
61 if(str_==NULL || stack_==NULL) {
67 // Pending linear-match node, append remaining bytes to str_.
72 str_->append(reinterpret_cast<const char *>(pos_), length, errorCode);
79 delete str_;
91 str_->truncate(length);
117 str_->truncate(length&0xffff);
125 str_->append((char)*pos++, 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_.
160 if(maxLength_>0 && str_->length()+length>maxLength_) {
161 str_->append(reinterpret_cast<const char *>(pos),
162 maxLength_-str_->length(), errorCode);
165 str_->append(reinterpret_cast<const char *>(pos), length, errorCode);
173 return str_ == NULL ? StringPiece() : str_->toStringPiece();
190 stack_->addElement(((length-(length>>1))<<16)|str_->length(), errorCode);
203 stack_->addElement(((length-1)<<16)|str_->length(), errorCode);
204 str_->append((char)trieByte, errorCode);