HomeSort by relevance Sort by last modified time
    Searched refs:Arc (Results 26 - 48 of 48) sorted by null

12

  /external/srec/tools/thirdparty/OpenFst/fst/lib/
project.h 31 // Mapper to implement projection per arc.
37 A operator()(const A &arc) {
39 ? arc.ilabel : arc.olabel;
40 return A(label, label, arc.weight, arc.nextstate);
62 template<class Arc> inline
63 void Project(MutableFst<Arc> *fst, ProjectType project_type) {
64 Map(fst, ProjectMapper<Arc>(project_type));
68 // Projects an FST onto its domain or range by either copying each arc'
    [all...]
test-properties.h 73 template<class Arc>
74 uint64 ComputeProperties(const Fst<Arc> &fst, uint64 mask, uint64 *known,
76 typedef typename Arc::Label Label;
77 typedef typename Arc::Weight Weight;
78 typedef typename Arc::StateId StateId;
104 SccVisitor<Arc> scc_visitor(&comp_props);
121 for (StateIterator< Fst<Arc> > siter(fst);
126 Arc prev_arc(kNoLabel, kNoLabel, Weight::One(), 0);
133 for (ArcIterator< Fst<Arc> > aiter(fst, s);
136 const Arc &arc =aiter.Value() local
    [all...]
fst.h 18 // state and arc iterator interface, and suggested base implementation.
23 #include "fst/lib/arc.h"
114 // A generic FST, templated on the arc definition, with
120 typedef A Arc;
130 virtual size_t NumArcs(StateId) const = 0; // State's arc count
164 << "\" (arc type = \"" << A::Type()
205 // For generic arc iterator construction; not normally called
212 // STATE and ARC ITERATOR DEFINITIONS
215 // State iterator interface templated on the Arc definition; used
220 typedef A Arc;
    [all...]
arcsort.h 42 template<class Arc, class Compare>
43 void ArcSort(MutableFst<Arc> *fst, Compare comp) {
44 typedef typename Arc::StateId StateId;
48 vector<Arc> arcs;
49 for (StateIterator< MutableFst<Arc> > siter(*fst);
54 for (ArcIterator< MutableFst<Arc> > aiter(*fst, s);
190 typedef A Arc;
307 typedef StdArc Arc;
connect.h 33 typedef A Arc;
34 typedef typename Arc::Weight Weight;
102 bool TreeArc(StateId s, const A &arc) { return true; }
104 bool BackArc(StateId s, const A &arc) {
105 StateId t = arc.nextstate;
112 if (arc.nextstate == start_) {
119 bool ForwardOrCrossArc(StateId s, const A &arc) {
120 StateId t = arc.nextstate;
201 template<class Arc>
202 void Connect(MutableFst<Arc> *fst)
    [all...]
queue.h 286 // This constructor computes the top. order. It accepts an arc filter
289 template <class Arc, class ArcFilter>
291 TopOrderQueue(const Fst<Arc> &fst, ArcFilter filter)
295 TopOrderVisitor<Arc> top_order_visitor(&order_, &acyclic);
504 template <class Arc, class ArcFilter>
505 AutoQueue(const Fst<Arc> &fst, const vector<typename Arc::Weight> *distance,
507 typedef typename Arc::Weight Weight;
525 SccVisitor<Arc> scc_visitor(&scc_, 0, 0, &props);
615 template <class Arc, class ArcFilter, class Less
666 const Arc &arc = ait.Value(); local
    [all...]
synchronize.h 51 typedef A Arc;
215 const A &arc = ait.Value(); local
216 if (!Empty(e.istring, arc.ilabel) && !Empty(e.ostring, arc.olabel)) {
217 const String *istring = Cdr(e.istring, arc.ilabel);
218 const String *ostring = Cdr(e.ostring, arc.olabel);
219 StateId d = FindState(Element(arc.nextstate, istring, ostring));
220 AddArc(s, Arc(Car(e.istring, arc.ilabel),
221 Car(e.ostring, arc.olabel), arc.weight, d))
    [all...]
arc.h 0 // arc.h
17 // Commonly used Fst arc types.
28 // Arc with integer labels and state Ids and float weights over the
40 static const string &Type() { // Arc type name
52 // Arc with integer labels and state Ids and float weights over the
64 static const string &Type() { // Arc type name
76 // Arc with integer labels and state Ids and string weights.
89 static const string &Type() { // Arc type name
105 // Arc with label and state Id type the same as template arg and with
109 typedef A Arc;
    [all...]
replace.h 32 // By default ReplaceFst will copy the input label of the 'replace arc'.
34 // create an epsilon arc when recursing into the appropriate Fst.
77 typedef A Arc;
180 // an arc from each state (representing the fst) to the
187 const A& arc = aiter.Value(); local
190 nonterminal_hash_.find(arc.olabel);
193 depfst.AddArc(i - 1, A(arc.olabel, arc.olabel, Weight::One(), j));
273 // return the base arc iterator, if arcs have not been computed yet,
319 const Arc& arc = aiter.Value() local
    [all...]
factor-weight.h 147 typedef A Arc;
261 const A &arc = ait.Value(); local
262 Weight w = Times(e.weight, arc.weight);
265 StateId d = FindState(Element(arc.nextstate, Weight::One()));
266 AddArc(s, Arc(arc.ilabel, arc.olabel, w, d));
270 StateId d = FindState(Element(arc.nextstate,
272 AddArc(s, Arc(arc.ilabel, arc.olabel, p.first, d))
    [all...]
vector-fst.h 36 class VectorFstBaseImpl : public FstImpl<typename State::Arc> {
38 typedef typename State::Arc Arc;
39 typedef typename Arc::Weight Weight;
40 typedef typename Arc::StateId StateId;
71 void AddArc(StateId s, const Arc &arc) {
72 states_[s]->arcs.push_back(arc);
92 vector<Arc> &arcs = states_[s]->arcs;
138 void InitStateIterator(StateIteratorData<Arc> *data) const
339 const A &arc = aiter.Value(); local
371 A arc; local
435 const A &arc = state->arcs[a]; local
    [all...]
determinize.h 203 // It is templated on the arc type A and the common divisor C.
314 const A &arc = aiter.Value(); local
315 Element dest_element(arc.nextstate,
316 Times(src_element.weight, arc.weight));
317 Subset* &dest_subset = (*label_map)[arc.ilabel];
325 // Adds an arc from state S to the destination state associated
328 A arc; local
329 arc.ilabel = label;
330 arc.olabel = label;
331 arc.weight = Weight::Zero()
    [all...]
compose.h 430 // Generates arc for composition state s from matched input Fst arcs.
433 A arc; local
435 arc.ilabel = arcb.ilabel;
436 arc.olabel = arca.olabel;
437 arc.weight = Times(arcb.weight, arca.weight);
439 arc.nextstate = FindState(tuple);
441 arc.ilabel = arca.ilabel;
442 arc.olabel = arcb.olabel;
443 arc.weight = Times(arca.weight, arcb.weight);
445 arc.nextstate = FindState(tuple)
    [all...]
encode.h 46 // Encoded data consists of arc input/output labels and arc weight
111 // Given an arc encode either input/ouptut labels or input/costs or both
112 Label Encode(const A &arc) {
113 const Tuple tuple(arc.ilabel,
114 flags_ & kEncodeLabels ? arc.olabel : 0,
115 flags_ & kEncodeWeights ? arc.weight : Weight::One());
126 // Given an encode arc Label decode back to input/output labels and costs
230 A operator()(const A &arc) {
232 if ((arc.nextstate == kNoStateId && !(flags_ & kEncodeWeights)) |
    [all...]
complement.h 38 // corresponds to input state s - 1. The first arc in the output at
113 typedef A Arc;
rational.h 196 typedef A Arc;
const-fst.h 31 // Arc definition.
80 // Provide information needed for the generic arc iterator
149 const A &arc = aiter.Value(); local
151 if (arc.ilabel == 0)
153 if (arc.olabel == 0)
155 arcs_[pos++] = arc;
227 typedef A Arc;
relabel.h 67 A arc = aiter.Value(); local
72 input_map.find(arc.ilabel);
73 if (it != input_map.end()) {arc.ilabel = it->second; }
76 it = output_map.find(arc.olabel);
77 if (it != output_map.end()) { arc.olabel = it->second; }
79 aiter.SetValue(arc);
276 A arc = aiter.Value(); local
281 input_map_.find(arc.ilabel);
282 if (it != input_map_.end()) { arc.ilabel = it->second; }
288 output_map_.find(arc.olabel)
    [all...]
map.h 35 // A final weight is mapped to an arc to the superfinal state
40 // A final weight is mapped to an arc to the superfinal state
52 // // Maps an arc type A to arc type B.
53 // B operator()(const A &arc);
78 // Maps an arc type A using a mapper function object C, passed
100 const A &arc = aiter.Value(); local
101 aiter.SetValue((*mapper)(arc));
146 // Maps an arc type A using a mapper function object C, passed
154 // Maps an arc type A to an arc type B using mapper functio
    [all...]
  /external/srec/tools/grxmlcompile/
fst-io.h 27 // on the arc type to support multiple and extensible arc types.
43 typedef A Arc;
100 PrintId(l, isyms_, "arc input label");
104 PrintId(l, osyms_, "arc output label");
112 Arc arc = aiter.Value(); local
115 PrintStateId(arc.nextstate);
117 PrintILabel(arc.ilabel);
120 PrintOLabel(arc.olabel)
239 Arc arc; local
    [all...]
  /external/dbus/test/
decode-gcov.c 404 printf (" Arc has destination block %ld flags 0x%lx\n",
464 printf ("%ld executions of arc %d\n",
496 * . 8 bytes each, a count of execution for each arc
563 die ("no arc count for function\n");
577 die ("did not get execution count for arc\n");
581 printf (" %ld executions of arc %d (total arcs %d)\n",
606 typedef struct Arc Arc;
612 struct Arc
621 Arc *pred_next
679 Arc *arc; local
1118 Arc *arc; local
    [all...]
  /prebuilt/windows/swt/
swt.jar 
  /prebuilt/windows-x86_64/swt/
swt.jar 

Completed in 326 milliseconds

12