Home
last modified time | relevance | path

Searched defs:arc (Results 1 – 25 of 97) sorted by relevance

1234

/external/openfst/src/include/fst/
Dvisit.h137 const Arc &arc = aiter->Value(); in Visit() local
214 bool WhiteArc(StateId s, const Arc &arc) { in WhiteArc()
219 bool GreyArc(StateId s, const Arc &arc) { in GreyArc()
224 bool BlackArc(StateId s, const Arc &arc) { in BlackArc()
267 bool WhiteArc(StateId s, const Arc &arc) { return true; } in WhiteArc()
268 bool GreyArc(StateId s, const Arc &arc) { return true; } in GreyArc()
269 bool BlackArc(StateId s, const Arc &arc) { return true; } in BlackArc()
Drmfinalepsilon.h57 const A& arc = aiter.Value(); in RmFinalEpsilon() local
77 const A& arc = aiter.Value(); in RmFinalEpsilon() local
Dconnect.h68 bool WhiteArc(StateId s, const A &arc) { in WhiteArc()
74 bool GreyArc(StateId s, const A &arc) { in GreyArc()
79 bool BlackArc(StateId s, const A &arc) { in BlackArc()
144 bool TreeArc(StateId s, const A &arc) { return true; } in TreeArc()
146 bool BackArc(StateId s, const A &arc) { in BackArc()
161 bool ForwardOrCrossArc(StateId s, const A &arc) { in ForwardOrCrossArc()
Dtopsort.h56 bool TreeArc(StateId s, const A &arc) { return true; } in TreeArc()
58 bool BackArc(StateId s, const A &arc) { return (*acyclic_ = false); } in BackArc()
60 bool ForwardOrCrossArc(StateId s, const A &arc) { return true; } in ForwardOrCrossArc()
Dstate-reachable.h96 bool TreeArc(StateId s, const A &arc) { in TreeArc()
100 bool BackArc(StateId s, const A &arc) { in BackArc()
106 bool ForwardOrCrossArc(StateId s, const A &arc) { in ForwardOrCrossArc()
112 void FinishState(StateId s, StateId p, const A *arc) { in FinishState()
Dreweight.h78 Arc arc = ait.Value(); in Reweight() local
114 Arc arc = ait.Value(); in Reweight() local
Dminimize.h253 const RevA& arc = aiter->Value(); in Split() local
348 bool TreeArc(StateId s, const A& arc) { in TreeArc()
353 bool BackArc(StateId s, const A& arc) { in BackArc()
358 bool ForwardOrCrossArc(StateId s, const A& arc) { in ForwardOrCrossArc()
471 A arc = aiter.Value(); in MergeStates() local
Dstatesort.h85 Arc arc = (*arcs1)[i]; in StateSort() local
Dcompact-fst.h293 Arc arc = compactor.Expand(ncompacts_ - 1, in CompactFstData() local
326 Arc arc = compactor.Expand(i, *it); in CompactFstData() local
342 Arc arc = compactor.Expand(i, *it); in CompactFstData() local
577 const A &arc = ComputeArc(s, i, kArcILabelValue); in NumArcs() local
608 const A &arc = ComputeArc( in CountEpsilons() local
684 const Arc &arc = ComputeArc(s, i); in Expand() local
1225 Element Compact(StateId s, const A &arc) const { return arc.ilabel; } in Compact()
1265 Element Compact(StateId s, const A &arc) const { in Compact()
1308 Element Compact(StateId s, const A &arc) const { in Compact()
1350 Element Compact(StateId s, const A &arc) const { in Compact()
[all …]
Dprune.h156 Arc arc = ait.Value(); in Prune() local
282 const Arc &arc = ait.Value(); in Prune() local
/external/srec/tools/thirdparty/OpenFst/fst/lib/
Dreweight.h65 Arc arc = ait.Value(); in Reweight() local
94 Arc arc = ait.Value(); in Reweight() local
Drmfinalepsilon.h51 const A& arc = aiter.Value(); in RmFinalEpsilon() local
71 const A& arc = aiter.Value(); in RmFinalEpsilon() local
Dtopsort.h51 bool TreeArc(StateId s, const A &arc) { return true; } in TreeArc()
53 bool BackArc(StateId s, const A &arc) { return (*acyclic_ = false); } in BackArc()
55 bool ForwardOrCrossArc(StateId s, const A &arc) { return true; } in ForwardOrCrossArc()
Dconnect.h102 bool TreeArc(StateId s, const A &arc) { return true; } in TreeArc()
104 bool BackArc(StateId s, const A &arc) { in BackArc()
119 bool ForwardOrCrossArc(StateId s, const A &arc) { in ForwardOrCrossArc()
Dminimize.h240 const RevA& arc = aiter->Value(); in Split() local
335 bool TreeArc(StateId s, const A& arc) { in TreeArc()
340 bool BackArc(StateId s, const A& arc) { in BackArc()
345 bool ForwardOrCrossArc(StateId s, const A& arc) { in ForwardOrCrossArc()
458 A arc = aiter.Value(); in MergeStates() local
Dequivalent.h193 const Arc &arc = arc_iter.Value(); in Equivalent() local
205 const Arc &arc = arc_iter.Value(); in Equivalent() local
Dprune.h100 Arc arc = it.Value(); in Prune() local
199 Arc arc = ait.Value(); in Prune() local
Drandgen.h74 const A &arc = aiter.Value(); in operator() local
84 const A &arc = aiter.Value(); in operator() local
Dverify.h61 const Arc &arc =aiter.Value(); in Verify() local
Dstatesort.h76 Arc arc = (*arcs1)[i]; in StateSort() local
/external/oprofile/libop/
Dop_alloc_counter.c59 counter_arc * arc = in build_counter_arc() local
91 counter_arc * arc = list_entry(pos, counter_arc, next); in delete_counter_arc() local
143 counter_arc const * arc = list_entry(pos, counter_arc, next); in allocate_counter() local
/external/openfst/src/include/fst/extensions/pdt/
Dexpand.h180 Arc arc = aiter.Value(); in ExpandState() local
531 const Arc &arc = aiter.Value(); in InitCloseParenMultimap() local
631 void PrunedExpand<A>::Relax(StateId s, const A &arc, Weight fd) { in Relax()
647 bool PrunedExpand<A>::PruneArc(StateId s, const A &arc) { in PruneArc()
725 bool PrunedExpand<A>::ProcNonParen(StateId s, const A &arc, bool add_arc) { in ProcNonParen()
745 bool PrunedExpand<A>::ProcOpenParen(StateId s, const A &arc, StackId si, in ProcOpenParen()
814 bool PrunedExpand<A>::ProcCloseParen(StateId s, const A &arc) { in ProcCloseParen()
856 const Arc &arc = iter->second; in ProcDestStates() local
896 Arc arc = aiter.Value(); in Expand() local
Dreplace.h108 Arc arc = aiter.Value(); in Replace() local
153 Arc arc = aiter->Value(); in Replace() local
/external/srec/tools/grxmlcompile/
Dgrxmlcompile.cpp366 fst::StdArc arc = aiter.Value(); in FstMergeOLabelsToILabels() local
406 fst::StdArc arc = aiter.Value(); in FstSplitOLabelsFromILabels() local
429 fst::StdArc arc = aiter.Value(); in FstReplaceILabel() local
461 fst::StdArc arc = aiter.Value(); in FstPushSlotLikeOLabels() local
498 fst::StdArc arc = aiter.Value(); in FstPushSlotLikeOLabels() local
555 fst::StdArc arc = aiter.Value(); in FstAddSlotMarkersToCFst() local
/external/srec/srec/crec/
Dsrec_context.c1253 FSMarc* arc; in FST_AddWordToGrammar() local
1518 FSMarc *arc = NULL, *arc2; in remove_added_arcs_leaving() local
1544 FSMarc *arc = NULL, *arc2; in remove_added_arcs_arriving() local
1577 FSMarc_t *arc, *arc2, *arc3; in FST_ResetGrammar() local
2008 int fst_free_arc(srec_context* fst, FSMarc* arc) in fst_free_arc()
2023 int fst_free_arc_net(srec_context* fst, FSMarc* arc) in fst_free_arc_net()
2033 int fst_push_arc_olabel(srec_context* fst, FSMarc* arc) in fst_push_arc_olabel()
2063 int fst_push_arc_cost(srec_context* fst, FSMarc* arc) in fst_push_arc_cost()
2080 int fst_pull_arc_olabel(srec_context* fst, FSMarc* arc) in fst_pull_arc_olabel()
2213 static void remove_arc_arriving(srec_context* fst, FSMnode* to_node, FSMarc* arc) in remove_arc_arriving()
[all …]

1234