| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| 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...] |
| shortest-path.h | 32 template <class Arc, class Queue, class ArcFilter>
34 : public ShortestDistanceOptions<Arc, Queue, ArcFilter> {
35 typedef typename Arc::StateId StateId;
44 : ShortestDistanceOptions<Arc, Queue, ArcFilter>(q, filt, kNoStateId, d),
53 // such as the queue discipline, the arc filter and delta.
60 template<class Arc, class Queue, class ArcFilter>
61 void SingleShortestPath(const Fst<Arc> &ifst,
62 MutableFst<Arc> *ofst,
63 vector<typename Arc::Weight> *distance,
64 ShortestPathOptions<Arc, Queue, ArcFilter> &opts)
115 const Arc &arc = aiter.Value(); local
[all...] |
| cache.h | 53 // garbage collection of states (not in use in an arc iterator) is
61 using FstImpl<typename S::Arc>::Type;
66 typedef typename S::Arc Arc;
67 typedef typename Arc::Weight Weight;
68 typedef typename Arc::StateId StateId;
140 cache_first_state_->arcs.capacity() * sizeof(Arc);
170 void AddArc(StateId s, const Arc &arc) {
172 state->arcs.push_back(arc);
181 const Arc &arc = arcs[a]; 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 this->AddArc(s, Arc(arc.ilabel, arc.olabel, w, d));
270 StateId d = FindState(Element(arc.nextstate,
272 this->AddArc(s, Arc(arc.ilabel, arc.olabel, p.first, d))
[all...] |
| minimize.h | 79 // # arcs are equal, check for arc match
213 // allocate arc iterator queue
220 // Prep priority queue. Open arc iterator for each state in C, and
229 // Now pop arc iterator from queue, split entering equivalence class
240 const RevA& arc = aiter->Value(); local
242 Label from_label = arc.ilabel;
283 // Priority queue of open arc iterators for all states in the 'splitter'
334 // invoked when tree arc examined (to undiscoverted state)
335 bool TreeArc(StateId s, const A& arc) {
339 // invoked when back arc examined (to unfinished state
458 A arc = aiter.Value(); local
[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...] |
| rmepsilon.h | 40 template <class Arc, class Queue>
42 : public ShortestDistanceOptions<Arc, Queue, EpsilonArcFilter<Arc> > {
43 typedef typename Arc::StateId StateId;
48 : ShortestDistanceOptions<Arc, Queue, EpsilonArcFilter<Arc> >(
49 q, EpsilonArcFilter<Arc>(), kNoStateId, d), connect(c) {}
55 template <class Arc, class Queue>
58 typedef typename Arc::Label Label;
59 typedef typename Arc::StateId StateId
154 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...] |
| /external/lzma/CPP/7zip/UI/Common/ |
| OpenArchive.cpp | 404 CArc arc;
local
405 arc.Path = filePath;
406 arc.SubfileIndex = (UInt32)(Int32)-1;
407 RINOK(arc.OpenStreamOrFile(codecs, formatIndex, stdInMode, stream, callback));
408 Arcs.Add(arc);
412 const CArc &arc = Arcs.Back();
local
419 RINOK(arc.Archive->GetArchiveProperty(kpidMainSubfile, &prop));
425 RINOK(arc.Archive->GetNumberOfItems(&numItems));
432 if (arc.Archive->QueryInterface(IID_IInArchiveGetStream, (void **)&getStream) != S_OK || !getStream)
444 RINOK(arc.GetItemPath(mainSubfile, arc2.Path));
[all...] |
| LoadCodecs.cpp | 431 const CArcInfo &arc = *g_Arcs[i];
local
433 item.Name = arc.Name;
434 item.CreateInArchive = arc.CreateInArchive;
435 item.CreateOutArchive = arc.CreateOutArchive;
436 item.AddExts(arc.Ext, arc.AddExt);
437 item.UpdateEnabled = (arc.CreateOutArchive != 0);
438 item.KeepName = arc.KeepName;
441 SetBuffer(item.StartSignature, arc.Signature, arc.SignatureSize);
466 const CArcInfoEx &arc = Formats[i]; local
[all...] |
| Update.cpp | 514 const CArc &arc,
519 IInArchive *archive = arc.Archive;
526 RINOK(arc.GetItemPath(i, ai.Name));
529 RINOK(arc.GetItemMTime(i, ai.MTime, ai.MTimeDefined));
706 CArc &arc = arcLink.Arcs.Back();
local
707 arc.MTimeDefined = !fi.IsDevice;
708 arc.MTime = fi.MTime;
|
| /external/openfst/src/include/fst/ |
| const-fst.h | 42 // Arc definition. The unsigned type U is used to represent indices into
43 // the arc array.
53 typedef A Arc;
100 // Provide information needed for the generic arc iterator
190 const A &arc = aiter.Value(); local
192 if (arc.ilabel == 0)
194 if (arc.olabel == 0)
196 arcs_[pos++] = arc;
255 // represent indices into the arc array (uint32 by default, declared
264 typedef A Arc;
402 const A &arc = aiter.Value(); local
[all...] |
| factor-weight.h | 43 template <class Arc>
45 typedef typename Arc::Label Label;
47 uint32 mode; // factor arc weights and/or final weights
48 Label final_ilabel; // input label of arc created when factoring final w's
49 Label final_olabel; // output label of arc created when factoring final w's
168 typedef A Arc;
199 << "factoring neither arc weights nor final weights.";
270 return FstImpl<Arc>::Properties(mask);
312 const A &arc = ait.Value(); local
313 Weight w = Times(e.weight, arc.weight)
[all...] |
| label-reachable.h | 131 // an arc iterator, useful for FST composition. In particular,
133 // the transitions of the arc iterator, when iter_input is true
137 // With the arc iterator test of reachability, the begin position, end
138 // position and accumulated arc weight of the matches can be
139 // returned. The optional template argument controls how reachable arc
146 typedef A Arc;
154 : fst_(new VectorFst<Arc>(fst)),
211 void Relabel(MutableFst<Arc> *fst, bool relabel_input) {
212 for (StateIterator< MutableFst<Arc> > siter(*fst);
215 for (MutableArcIterator< MutableFst<Arc> > aiter(fst, s)
218 Arc arc = aiter.Value(); local
327 const A &arc = aiter->Value(); local
420 Arc arc = aiter.Value(); local
[all...] |
| minimize.h | 86 // # arcs are equal, check for arc match
226 // allocate arc iterator queue
233 // Prep priority queue. Open arc iterator for each state in C, and
242 // Now pop arc iterator from queue, split entering equivalence class
253 const RevA& arc = aiter->Value(); local
255 Label from_label = arc.ilabel;
296 // Priority queue of open arc iterators for all states in the 'splitter'
347 // invoked when tree arc examined (to undiscoverted state)
348 bool TreeArc(StateId s, const A& arc) {
352 // invoked when back arc examined (to unfinished state
471 A arc = aiter.Value(); local
[all...] |
| replace-util.h | 43 template <class Arc>
44 void Replace(const vector<pair<typename Arc::Label, const Fst<Arc>* > >&,
45 MutableFst<Arc> *, typename Arc::Label, bool);
54 template <class Arc>
57 typedef typename Arc::Label Label;
58 typedef typename Arc::Weight Weight;
59 typedef typename Arc::StateId StateId;
61 typedef pair<Label, const Fst<Arc>*> FstPair
295 const Arc& arc = aiter.Value(); local
438 const Arc &arc = aiter.Value(); local
461 const Arc &arc = aiter.Value(); local
[all...] |
| rmepsilon.h | 48 template <class Arc, class Queue>
50 : public ShortestDistanceOptions<Arc, Queue, EpsilonArcFilter<Arc> > {
52 typedef typename Arc::StateId StateId;
53 typedef typename Arc::Weight Weight;
62 : ShortestDistanceOptions< Arc, Queue, EpsilonArcFilter<Arc> >(
63 q, EpsilonArcFilter<Arc>(), kNoStateId, d),
70 template <class Arc, class Queue>
73 typedef typename Arc::Label Label
180 Arc arc = ait.Value(); local
[all...] |
| /external/openfst/src/include/fst/extensions/pdt/ |
| paren.h | 243 const A &arc = aiter.Value(); local
246 = paren_id_map_.find(arc.ilabel);
249 if (arc.ilabel == parens_[paren_id].first) { // open paren
250 if (!DFSearch(arc.nextstate))
252 for (SetIterator set_iter = FindStates(paren_id, arc.nextstate);
265 if(!DFSearch(arc.nextstate))
282 const A &arc = aiter.Value(); local
285 = paren_id_map_.find(arc.ilabel);
288 if (arc.ilabel == parens_[paren_id].first) { // open paren
290 FindStates(paren_id, arc.nextstate)
[all...] |
| /external/openfst/src/include/fst/script/ |
| info-impl.h | 46 typedef A Arc;
100 const A &arc = aiter.Value(); local
102 if (arc.ilabel == 0 && arc.olabel == 0)
104 if (arc.ilabel == 0)
106 if (arc.olabel == 0)
113 CcVisitor<Arc> cc_visitor(&cc);
118 Visit(fst, &cc_visitor, &fifo_queue, EpsilonArcFilter<Arc>());
120 Visit(fst, &cc_visitor, &fifo_queue, InputEpsilonArcFilter<Arc>());
122 Visit(fst, &cc_visitor, &fifo_queue, OutputEpsilonArcFilter<Arc>());
[all...] |
| /external/srec/tools/grxmlcompile/ |
| sub_grph.h | 133 delete arc[ii];
135 delete [] arc;
215 NUANArc **arc; member in class:SubGraph
|
| /external/srec/tools/test_g2g/ |
| test_g2g.c | 249 FSMarc* arc = &fst->FSMarc_list[i]; local
250 nodeID fr_node = arc->fr_node;
252 ilabels_following[0] = arc->ilabel;
255 for( ; fr_node!=fst->start_node; fr_node=arc->fr_node) {
258 for( ; iarc!=MAXarcID; iarc=arc->linkl_prev_arc) {
259 arc = &fst->FSMarc_list[iarc];
260 if(arc->fr_node != fr_node) break;
266 if(arc->ilabel == WORD_BOUNDARY) break;
267 ilabels_preceding[num_ilabels_preceding++] = arc->ilabel;
269 arc = &fst->FSMarc_list[i]
[all...] |
| /frameworks/base/libs/hwui/ |
| PathCache.h | 138 struct Arc {
144 } arc; member in union:android::uirenderer::PathDescription::Shape
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/plat-mac/lib-scriptpackages/StdSuites/ |
| QuickDraw_Graphics_Suite.py | 18 class arc(aetools.ComponentItem): class in inherits:aetools.ComponentItem
19 """arc - An arc """
22 """arc angle - the angle of the arc in degrees """
26 """bounds - the smallest rectangle that contains the entire arc """
30 """definition rect - the rectangle that contains the circle or oval used to define the arc """
54 """start angle - the angle that defines the start of the arc, in degrees """
62 arcs = arc
229 arc._superclassnames = [
[all...] |
| /external/lzma/CPP/7zip/UI/Console/ |
| List.cpp | 181 HRESULT PrintItemInfo(const CArc &arc, UInt32 index, bool techMode);
285 HRESULT CFieldPrinter::PrintItemInfo(const CArc &arc, UInt32 index, bool techMode)
305 RINOK(arc.GetItemPath(index, s));
310 RINOK(arc.Archive->GetProperty(index, fieldInfo.PropID, &prop));
321 RINOK(IsArchiveItemFolder(arc.Archive, index, isFolder));
504 const CArc &arc = archiveLink.Arcs[i];
local
507 PrintPropPair(L"Path", arc.Path);
508 PrintPropPair(L"Type", codecs->Formats[arc.FormatIndex].Name);
509 if (!arc.ErrorMessage.IsEmpty())
510 PrintPropPair(L"Error", arc.ErrorMessage);
564 const CArc &arc = archiveLink.Arcs.Back(); local
[all...] |
