Searched refs:chars_ (Results 1 – 3 of 3) sorted by relevance
47 chars_=trieChars; in CharsTrie()99 state.chars=chars_; in saveState()117 if(chars_==state.chars && chars_!=null && root_==state.root) { in resetToState()138 return (remainingMatchLength_<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in current()185 if(inUnit==chars_.charAt(pos++)) { in next()189 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in next()249 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in next()257 if(inUnit!=chars_.charAt(pos)) { in next()264 int node=chars_.charAt(pos++); in next()282 node=chars_.charAt(pos++); in next()[all …]
235 int chars_; member in ConsStringStats246 chars_ = 0; in Reset()255 CHECK_EQ(this->chars_, that.chars_); in VerifyEqual()330 stats->chars_ += left_length; in AccumulateStats()342 stats->chars_ += right_length; in AccumulateStats()353 stats->chars_ += cons_string->length(); in AccumulateStats()366 stats->chars_ += string->length(); in AccumulateStatsWithOperator()374 CHECK_EQ(root->length(), data->stats_.chars_); in VerifyConsString()416 data->stats_.chars_ += left->length(); in ConstructRandomString()425 data->stats_.chars_ += right->length(); in ConstructRandomString()[all …]
596 hash_field_ = StringHasher::ComputeUtf8Hash(string_, seed_, &chars_); in Hash()609 string_, chars_, hash_field_); in AsHandle()614 int chars_; // Caches the number of characters when computing the hash code. variable