Lines Matching defs:Replace
0 // replace.h
39 #include <fst/replace-util.h>
46 // REPLACE STATE TUPLES AND TABLES
48 // The replace state table has the form
75 // \brief Tuple of information that uniquely defines a state in replace
94 // Equality of replace state tuples.
116 // Fingerprint for general replace state tuples.
146 // A generic hash function for replace state tuples.
168 // A two-level state table for replace.
236 // Default replace state table
262 // REPLACE FST CLASS
265 // By default ReplaceFst will copy the input label of the 'replace arc'.
301 // \brief Implementation class for replace class Fst
303 // The replace implementation class supports a dynamic
339 // constructor for replace class implementation.
348 SetType("replace");
442 SetType("replace");
465 // Computes the dependency graph of the replace class and returns
467 // in an un-expandable replace fst.
473 // Return or compute start state of replace fst
476 if (fst_array_.size() == 1) { // no fsts defined for replace
536 // Use also in ComputeArc, this would require changes to replace
717 // Compute the arc in the replace fst corresponding to a given
719 // corresponds to no arc in the replace.
744 // if start state is valid replace, else arc is implicitly
1000 VLOG(2) << "Not using replace matcher";
1033 // ReplaceFst<A> replace;
1034 // ArcIterator< ReplaceFst<A> > aiter(replace, s);
1047 // // in the replace state table.
1266 // Create a local matcher for each component Fst of replace.
1352 // Compute loop directly, saving Replace::ComputeArc
1424 // Replace supports replacement of arcs in one Fst with another
1425 // Fst. This replacement is recursive. Replace takes an array of
1428 // non-terminals with the matching non-terminal Fst. Currently Replace
1435 void Replace(const vector<pair<typename Arc::Label,
1445 void Replace(const vector<pair<typename Arc::Label,
1448 Replace(ifst_array, ofst, root, false);
