Lines Matching defs:Subset
221 typedef slist<Element> Subset;
222 typedef map<Label, Subset*> LabelMap;
246 Subset *subset = new Subset;
252 Subset *subset = subsets_[s];
254 for (typename Subset::iterator siter = subset->begin();
275 StateId FindState(Subset *subset) {
305 Subset *src_subset = subsets_[s];
307 for (typename Subset::iterator siter = src_subset->begin();
317 Subset* &dest_subset = (*label_map)[arc.ilabel];
319 dest_subset = new Subset;
327 void AddArc(StateId s, Label label, Subset *dest_subset) {
333 typename Subset::iterator oiter;
334 for (typename Subset::iterator diter = dest_subset->begin();
360 for (typename Subset::iterator diter = dest_subset->begin();
374 // Comparison object for hashing Subset(s). Subsets are not sorted in this
388 bool operator()(Subset* subset1, Subset* subset2) const {
393 for (typename Subset::iterator iter1 = subset1->begin();
401 for (typename Subset::iterator iter2 = subset2->begin();
408 for (typename Subset::iterator iter1 = subset1->begin();
423 // Hash function for Subset to Fst states. Subset elements are not
428 size_t operator()(const Subset* subset) const {
430 for (typename Subset::const_iterator iter = subset->begin();
453 // Maps from StateId to Subset.
454 vector<Subset *> subsets_;
456 // Hashes from Subset to its StateId in the output automaton.
457 typedef hash_map<Subset *, StateId, SubsetKey, SubsetEqual>