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()97 state.chars=chars_; in saveState()114 if(chars_==state.chars && chars_!=null && root_==state.root) { in resetToState()134 return (remainingMatchLength_<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in current()178 if(inUnit==chars_.charAt(pos++)) { in next()182 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in next()240 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? in next()248 if(inUnit!=chars_.charAt(pos)) { in next()255 int node=chars_.charAt(pos++); in next()273 node=chars_.charAt(pos++); in next()[all …]
270 : StringTableKey(StringHasher::ComputeUtf8Hash(string, seed, &chars_)), in Utf8StringKey()278 return isolate->factory()->NewInternalizedStringFromUtf8(string_, chars_, in AsHandle()284 int chars_; // Caches the number of characters when computing the hash code. variable