Lines Matching defs:it
66 // // Lookup state ID by tuple. If it doesn't exist, then add it.
540 typename NonTerminalHash::const_iterator it =
542 return it != nonterminal_hash_.end();
688 // actually compute it.
736 typename NonTerminalHash::const_iterator it =
738 if (it != nonterminal_hash_.end()) { // recurse into non terminal
739 Label nonterminal = it->second;
866 typename StackPrefixHash::iterator it = prefix_hash_.find(prefix);
867 if (it == prefix_hash_.end()) {
873 return it->second;
924 // transition networks, union, or closure. It is constructed with an
936 // Fst is a single Arc on the start State that self loops, it references
941 // The ReplaceFst need to be built such that it is known to be ilabel
947 // In order to obtain the most efficient behaviour, it is recommended
1031 // Implements optional caching. It can be used as follows:
1046 // aiter.Value(); // Does compute the destination state and inserts it
1278 typename set<Label>::iterator it = impl_->nonterminal_set_.begin();
1279 for (; it != impl_->nonterminal_set_.end(); ++it) {
1280 matcher_[i]->AddMultiEpsLabel(*it);
