Searched refs:chars_ (Results 1 – 3 of 3) sorted by relevance
49 chars_=trieChars; in CharsTrie()101 state.chars=chars_; in saveState()119 if(chars_==state.chars && chars_!=null && root_==state.root) { in resetToState()140 return (remainingMatchLength_<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in current()187 if(inUnit==chars_.charAt(pos++)) { in next()191 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in next()251 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in next()259 if(inUnit!=chars_.charAt(pos)) { in next()266 int node=chars_.charAt(pos++); in next()284 node=chars_.charAt(pos++); in next()[all …]
49 chars_=trieChars; in CharsTrie()96 state.chars=chars_; in saveState()113 if(chars_==state.chars && chars_!=null && root_==state.root) { in resetToState()133 return (remainingMatchLength_<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in current()177 if(inUnit==chars_.charAt(pos++)) { in next()181 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in next()239 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in next()247 if(inUnit!=chars_.charAt(pos)) { in next()254 int node=chars_.charAt(pos++); in next()272 node=chars_.charAt(pos++); in next()[all …]
1027 hash_field_ = StringHasher::ComputeUtf8Hash(string_, seed_, &chars_); in Hash()1039 return isolate->factory()->NewInternalizedStringFromUtf8(string_, chars_, in AsHandle()1045 int chars_; // Caches the number of characters when computing the hash code. variable