Blame view
tools/openfst-1.6.7/include/fst/arcsort.h
6.36 KB
8dcb6dfcb first commit |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 |
// See www.openfst.org for extensive documentation on this weighted // finite-state transducer library. // // Functions and classes to sort arcs in an FST. #ifndef FST_ARCSORT_H_ #define FST_ARCSORT_H_ #include <algorithm> #include <string> #include <vector> #include <fst/cache.h> #include <fst/state-map.h> #include <fst/test-properties.h> namespace fst { template <class Arc, class Compare> class ArcSortMapper { public: using FromArc = Arc; using ToArc = Arc; using StateId = typename Arc::StateId; using Weight = typename Arc::Weight; ArcSortMapper(const Fst<Arc> &fst, const Compare &comp) : fst_(fst), comp_(comp), i_(0) {} // Allows updating Fst argument; pass only if changed. ArcSortMapper(const ArcSortMapper<Arc, Compare> &mapper, const Fst<Arc> *fst = nullptr) : fst_(fst ? *fst : mapper.fst_), comp_(mapper.comp_), i_(0) {} StateId Start() { return fst_.Start(); } Weight Final(StateId s) const { return fst_.Final(s); } void SetState(StateId s) { i_ = 0; arcs_.clear(); arcs_.reserve(fst_.NumArcs(s)); for (ArcIterator<Fst<Arc>> aiter(fst_, s); !aiter.Done(); aiter.Next()) { arcs_.push_back(aiter.Value()); } std::sort(arcs_.begin(), arcs_.end(), comp_); } bool Done() const { return i_ >= arcs_.size(); } const Arc &Value() const { return arcs_[i_]; } void Next() { ++i_; } MapSymbolsAction InputSymbolsAction() const { return MAP_COPY_SYMBOLS; } MapSymbolsAction OutputSymbolsAction() const { return MAP_COPY_SYMBOLS; } uint64 Properties(uint64 props) const { return comp_.Properties(props); } private: const Fst<Arc> &fst_; const Compare &comp_; std::vector<Arc> arcs_; ssize_t i_; // current arc position ArcSortMapper &operator=(const ArcSortMapper &) = delete; }; // Sorts the arcs in an FST according to function object 'comp' of type Compare. // This version modifies its input. Comparison function objects ILabelCompare // and OLabelCompare are provided by the library. In general, Compare must meet // the requirements for a comparison function object (e.g., similar to those // used by std::sort). It must also have a member Properties(uint64) that // specifies the known properties of the sorted FST; it takes as argument the // input FST's known properties before the sort. // // Complexity: // // - Time: O(v d log d) // - Space: O(d) // // where v = # of states and d = maximum out-degree. template <class Arc, class Compare> void ArcSort(MutableFst<Arc> *fst, Compare comp) { ArcSortMapper<Arc, Compare> mapper(*fst, comp); StateMap(fst, mapper); } using ArcSortFstOptions = CacheOptions; // Sorts the arcs in an FST according to function object 'comp' of type Compare. // This version is a delayed FST. Comparsion function objects ILabelCompare and // OLabelCompare are provided by the library. In general, Compare must meet the // requirements for a comparision function object (e.g., similar to those // used by std::sort). It must also have a member Properties(uint64) that // specifies the known properties of the sorted FST; it takes as argument the // input FST's known properties. // // Complexity: // // - Time: O(v d log d) // - Space: O(d) // // where v = # of states visited, d = maximum out-degree of states visited. // Constant time and space to visit an input state is assumed and exclusive of // caching. template <class Arc, class Compare> class ArcSortFst : public StateMapFst<Arc, Arc, ArcSortMapper<Arc, Compare>> { using StateMapFst<Arc, Arc, ArcSortMapper<Arc, Compare>>::GetImpl; public: using StateId = typename Arc::StateId; using Mapper = ArcSortMapper<Arc, Compare>; ArcSortFst(const Fst<Arc> &fst, const Compare &comp) : StateMapFst<Arc, Arc, Mapper>(fst, ArcSortMapper<Arc, Compare>(fst, comp)) {} ArcSortFst(const Fst<Arc> &fst, const Compare &comp, const ArcSortFstOptions &opts) : StateMapFst<Arc, Arc, Mapper>(fst, Mapper(fst, comp), opts) {} // See Fst<>::Copy() for doc. ArcSortFst(const ArcSortFst<Arc, Compare> &fst, bool safe = false) : StateMapFst<Arc, Arc, Mapper>(fst, safe) {} // Gets a copy of this ArcSortFst. See Fst<>::Copy() for further doc. ArcSortFst<Arc, Compare> *Copy(bool safe = false) const override { return new ArcSortFst(*this, safe); } size_t NumArcs(StateId s) const override { return GetImpl()->GetFst()->NumArcs(s); } size_t NumInputEpsilons(StateId s) const override { return GetImpl()->GetFst()->NumInputEpsilons(s); } size_t NumOutputEpsilons(StateId s) const override { return GetImpl()->GetFst()->NumOutputEpsilons(s); } }; // Specialization for ArcSortFst. template <class Arc, class Compare> class StateIterator<ArcSortFst<Arc, Compare>> : public StateIterator<StateMapFst<Arc, Arc, ArcSortMapper<Arc, Compare>>> { public: explicit StateIterator(const ArcSortFst<Arc, Compare> &fst) : StateIterator<StateMapFst<Arc, Arc, ArcSortMapper<Arc, Compare>>>(fst) { } }; // Specialization for ArcSortFst. template <class Arc, class Compare> class ArcIterator<ArcSortFst<Arc, Compare>> : public ArcIterator<StateMapFst<Arc, Arc, ArcSortMapper<Arc, Compare>>> { public: ArcIterator(const ArcSortFst<Arc, Compare> &fst, typename Arc::StateId s) : ArcIterator<StateMapFst<Arc, Arc, ArcSortMapper<Arc, Compare>>>(fst, s) {} }; // Compare class for comparing input labels of arcs. template <class Arc> class ILabelCompare { public: ILabelCompare() {} bool operator()(const Arc &arc1, const Arc &arc2) const { return arc1.ilabel < arc2.ilabel; } uint64 Properties(uint64 props) const { return (props & kArcSortProperties) | kILabelSorted | (props & kAcceptor ? kOLabelSorted : 0); } }; // Compare class for comparing output labels of arcs. template <class Arc> class OLabelCompare { public: OLabelCompare() {} bool operator()(const Arc &arc1, const Arc &arc2) const { return arc1.olabel < arc2.olabel; } uint64 Properties(uint64 props) const { return (props & kArcSortProperties) | kOLabelSorted | (props & kAcceptor ? kILabelSorted : 0); } }; // Useful aliases when using StdArc. template <class Compare> using StdArcSortFst = ArcSortFst<StdArc, Compare>; using StdILabelCompare = ILabelCompare<StdArc>; using StdOLabelCompare = OLabelCompare<StdArc>; } // namespace fst #endif // FST_ARCSORT_H_ |