/frameworks/base/libs/hwui/ |
PathCache.h | 140 struct Arc { 146 } arc; member in union:android::uirenderer::PathDescription::Shape
|
/external/openfst/src/include/fst/ |
accumulator.h | 19 // Classes to accumulate arc weights. Useful for weight lookahead. 40 // This class accumulates arc weights using the semiring Plus(). 44 typedef A Arc; 77 // This class accumulates arc weights using the log semiring Plus() 78 // assuming an arc weight has a WeightConvert specialization to 83 typedef A Arc; 157 // This class accumulates arc weights using the log semiring Plus() 158 // assuming an arc weight has a WeightConvert specialization to and 164 typedef A Arc; 267 const A &arc = aiter.Value() local [all...] |
compose.h | 39 // Delayed composition options templated on the arc type, the matcher, 44 // version controls composition implemented between generic Fst<Arc> 45 // types and a shared matcher type M for Fst<Arc>. This should be 74 // (of the same Arc type but otherwise arbitrary Fst type). The user 81 class T = GenericComposeStateTable<typename M1::Arc, 204 class ComposeFstImpl : public ComposeFstImplBase<typename M1::Arc> { 207 typedef typename M1::Arc Arc; 208 typedef typename Arc::StateId StateId; 209 typedef typename Arc::Label Label [all...] |
edit-fst.h | 60 // A the type of arc to use 71 typedef A Arc; 193 // Adds the specified arc to the specified state of this fst. 194 const A *AddArc(StateId s, const Arc &arc, const WrappedFstT *wrapped) { 201 // grab the final arc associated with this state in edits_ 205 edits_.AddArc(internal_id, arc); 228 // Provides information for the generic arc iterator. 229 void InitArcIterator(StateId s, ArcIteratorData<Arc> *data, 243 // Provides information for the generic mutable arc iterator [all...] |
lookahead-matcher.h | 44 // typedef F::Arc Arc; 45 // typedef typename Arc::StateId StateId; 46 // typedef typename Arc::Label Label; 47 // typedef typename Arc::Weight Weight; 72 // bool LookAheadFst(const Fst<Arc>& fst, StateId s); 80 // // Is there is a single non-epsilon arc found in the lookahead FST 82 // // call LookAheadFst? If so, return true and copy it to '*arc', o.w. 85 // bool LookAheadPrefix(Arc *arc); 370 const Arc &arc = aiter.Value(); local [all...] |
matcher.h | 43 // typedef F::Arc Arc; 44 // typedef typename Arc::StateId StateId; 45 // typedef typename Arc::Label Label; 46 // typedef typename Arc::Weight Weight; 76 // const A& Value() const; // Current arc (when !Done) 77 // void Next(); // Advance to next arc (when !Done) 100 // Matcher interface, templated on the Arc definition; used 106 typedef A Arc; 134 // Arc(kNoLabel, 0, Weight::One(), current_state) as well as an [all...] |
queue.h | 317 // This constructor computes the top. order. It accepts an arc filter 320 template <class Arc, class ArcFilter> 321 TopOrderQueue(const Fst<Arc> &fst, ArcFilter filter) 325 TopOrderVisitor<Arc> top_order_visitor(&order_, &acyclic); 542 template <class Arc, class ArcFilter> 543 AutoQueue(const Fst<Arc> &fst, const vector<typename Arc::Weight> *distance, 545 typedef typename Arc::Weight Weight; 563 SccVisitor<Arc> scc_visitor(&scc_, 0, 0, &properties); 652 template <class Arc, class ArcFilter, class Less 708 const Arc &arc = ait.Value(); local [all...] |
randgen.h | 37 // ARC SELECTORS - these function objects are used to select a random 82 const A &arc = aiter.Value(); local 83 sum += exp(-to_log_weight_(arc.weight).Value()); 92 const A &arc = aiter.Value(); local 93 p += exp(-to_log_weight_(arc.weight).Value()); 146 size_t select; // previous sample arc selection 156 // This class, given an arc selector, samples, with raplacement, 158 // version with a straight-forward use of the arc selector. 159 // Specializations may be defined for arc selectors for greater 306 // is an arc sampler, typically class 'ArcSampler' above. Ownership o [all...] |
vector-fst.h | 42 class VectorFstBaseImpl : public FstImpl<typename State::Arc> { 44 typedef typename State::Arc Arc; 45 typedef typename Arc::Weight Weight; 46 typedef typename Arc::StateId StateId; 77 void AddArc(StateId s, const Arc &arc) { 78 states_[s]->arcs.push_back(arc); 98 vector<Arc> &arcs = states_[s]->arcs; 144 void InitStateIterator(StateIteratorData<Arc> *data) const 312 const A &arc = aiter.Value(); local 353 A arc; local 557 const A &arc = aiter.Value(); local [all...] |
arc-map.h | 0 // arc-map.h 45 // A final weight is mapped to an arc to the superfinal state 50 // A final weight is mapped to an arc to the superfinal state 79 // // Maps an arc type A to arc type B. 80 // B operator()(const A &arc); 109 // Maps an arc type A using a mapper function object C, passed 137 const A &arc = aiter.Value(); local 138 aiter.SetValue((*mapper)(arc)); 146 FSTERROR() << "ArcMap: non-zero arc labels for superfinal arc" [all...] |
cache.h | 59 typedef typename S::Arc::StateId StateId; 96 // is 'true', garbage collection of states (not in use in an arc 107 typedef typename State::Arc Arc; 108 typedef typename Arc::Weight Weight; 109 typedef typename Arc::StateId StateId; 111 using FstImpl<Arc>::Type; 112 using FstImpl<Arc>::Properties; 113 using FstImpl<Arc>::SetProperties; 225 // AddArc adds a single arc to state s and does incremental cach 263 const Arc &arc = arcs[a]; local [all...] |
compact-fst.h | 73 // // Return the compacted representation of a transition 'arc' 75 // Element Compact(StateId s, const Arc &arc); 78 // Arc Expand(StateId s, const Element &e); 283 typedef typename C::Arc Arc; 284 typedef typename Arc::Weight Weight; 293 Arc arc = compactor.Expand(ncompacts_ - 1, local 295 if (arc.ilabel != kNoLabel 326 Arc arc = compactor.Expand(i, *it); local 342 Arc arc = compactor.Expand(i, *it); local 577 const A &arc = ComputeArc(s, i, kArcILabelValue); local 608 const A &arc = ComputeArc( local 684 const Arc &arc = ComputeArc(s, i); local [all...] |
determinize.h | 36 #include <fst/arc-map.h> 147 template <class Arc> 149 typedef typename Arc::StateId StateId; 150 typedef typename Arc::Label Label; 151 typedef slist< DeterminizeElement<Arc> > Subset; 165 // template <class Arc> 168 // typedef typename Arc::StateId StateId; 169 // typedef DeterminizeElement<Arc> Element; 191 template <class Arc> 194 typedef typename Arc::StateId StateId 599 const A &arc = aiter.Value(); local 624 A arc; local [all...] |
fst.h | 20 // state and arc iterator interface, and suggested base implementation. 34 #include <fst/arc.h> 158 // A generic FST, templated on the arc definition, with 164 typedef A Arc; 174 virtual size_t NumArcs(StateId) const = 0; // State's arc count 221 << "\" (arc type = \"" << A::Type() 268 // For generic arc iterator construction; not normally called 293 // STATE and ARC ITERATOR DEFINITIONS 296 // State iterator interface templated on the Arc definition; used 302 typedef A Arc; [all...] |
replace.h | 53 // typedef A Arc; 174 typedef A Arc; 242 typedef A Arc; 265 // By default ReplaceFst will copy the input label of the 'replace arc'. 267 // create an epsilon arc when recursing into the appropriate Fst. 332 typedef A Arc; 538 // state instead of deleting the arc as done currently. 568 // in the underlying machine also become input epsilon arc. 621 return FstImpl<Arc>::Properties(mask); 624 // return the base arc iterator, if arcs have not been computed yet 648 Arc arc; local 672 Arc arc; local 1159 const A& arc = arcs_[pos_ - offset_]; local [all...] |
/external/openfst/src/include/fst/extensions/pdt/ |
compose.h | 45 typedef typename M::Arc Arc; 46 typedef typename Arc::StateId StateId; 47 typedef typename Arc::Label Label; 48 typedef typename Arc::Weight Weight; 93 const Arc& Value() const { 175 bool paren_loop_; // Current arc is the implicit paren loop 176 mutable Arc loop_; // For non-consuming symbols 281 typedef typename F::Arc Arc; [all...] |
expand.h | 39 template <class Arc> 42 PdtStack<typename Arc::StateId, typename Arc::Label> *stack; 43 PdtStateTable<typename Arc::StateId, typename Arc::StateId> *state_table; 48 PdtStack<typename Arc::StateId, typename Arc::Label> *s = 0, 49 PdtStateTable<typename Arc::StateId, typename Arc::StateId> *st = 0) 78 typedef A Arc; 180 Arc arc = aiter.Value(); local 531 const Arc &arc = aiter.Value(); local 856 const Arc &arc = iter->second; local 896 Arc arc = aiter.Value(); local [all...] |
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
determinize.h | 201 // It is templated on the arc type A and the common divisor C. 312 const A &arc = aiter.Value(); local 313 Element dest_element(arc.nextstate, 314 Times(src_element.weight, arc.weight)); 315 Subset* &dest_subset = (*label_map)[arc.ilabel]; 323 // Adds an arc from state S to the destination state associated 326 A arc; local 327 arc.ilabel = label; 328 arc.olabel = label; 329 arc.weight = Weight::Zero() [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...] |
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...] |
replace.h | 31 // By default ReplaceFst will copy the input label of the 'replace arc'. 33 // create an epsilon arc when recursing into the appropriate Fst. 76 typedef A Arc; 179 // an arc from each state (representing the fst) to the 186 const A& arc = aiter.Value(); local 189 nonterminal_hash_.find(arc.olabel); 192 depfst.AddArc(i - 1, A(arc.olabel, arc.olabel, Weight::One(), j)); 272 // return the base arc iterator, if arcs have not been computed yet, 318 const Arc& arc = aiter.Value() local [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...] |
compose.h | 427 // Generates arc for composition state s from matched input Fst arcs. 430 A arc; local 432 arc.ilabel = arcb.ilabel; 433 arc.olabel = arca.olabel; 434 arc.weight = Times(arcb.weight, arca.weight); 436 arc.nextstate = FindState(tuple); 438 arc.ilabel = arca.ilabel; 439 arc.olabel = arcb.olabel; 440 arc.weight = Times(arca.weight, arcb.weight); 442 arc.nextstate = FindState(tuple) [all...] |
/external/openfst/src/include/fst/extensions/ngram/ |
ngram-fst.h | 75 typedef A Arc; 281 typedef A Arc; 282 typedef typename Arc::Label Label; 283 typedef typename Arc::Weight Weight; 284 typedef typename Arc::StateId StateId; 337 const Arc &arc = aiter.Value(); local 338 if (arc.ilabel != 0) { 339 label_queue.push(make_pair(arc.nextstate, now.second)); 347 // The arc from the start state should be assigned an epsilon to put i 371 const Arc &arc = aiter.Value(); local 472 const Arc &arc = aiter.Value(); local 482 const Arc &arc = aiter.Value(); local [all...] |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.apache.ant_1.7.1.v20090120-1145/lib/ |
ant-jai.jar | |