Cross Reference: /external/openfst/src/include/fst/determinize.h

Lines Matching refs:Subset
256   typedef slist<Element> Subset;
257   typedef map<Label, Subset*> LabelMap;
317     Subset *subset = new Subset;
323     Subset *subset = subsets_[s];
325     for (typename Subset::iterator siter = subset->begin();
348   StateId FindState(Subset *subset) {
360   StateId CreateState(Subset *subset) {
370   Weight ComputeDistance(const Subset *subset) {
372     for (typename Subset::const_iterator siter = subset->begin();
401     Subset *src_subset = subsets_[s];
403     for (typename Subset::iterator siter = src_subset->begin();
413         Subset* &dest_subset = (*label_map)[arc.ilabel];
415           dest_subset = new Subset;
423   void AddArc(StateId s, Label label, Subset *dest_subset) {
429     typename Subset::iterator oiter;
430     for (typename Subset::iterator diter = dest_subset->begin();
458     for (typename Subset::iterator diter = dest_subset->begin();
472   // Comparison object for hashing Subset(s). Subsets are not sorted in this
485     bool operator()(Subset* subset1, Subset* subset2) const {
490       for (typename Subset::iterator iter1 = subset1->begin();
500       for (typename Subset::iterator iter2 = subset2->begin();
509           for (typename Subset::iterator iter1 = subset1->begin();
524   // Hash function for Subset to Fst states. Subset elements are not
529     size_t operator()(const Subset* subset) const {
531       for (typename Subset::const_iterator iter = subset->begin();
553   // Maps from StateId to Subset.
554   vector<Subset *> subsets_;
556   // Hashes from Subset to its StateId in the output automaton.
557   typedef unordered_map<Subset *, StateId, SubsetKey, SubsetEqual>