/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/vega/ |
arc.h | 37 struct arc { struct 55 void arc_init(struct arc *arc, 62 void arc_add_to_polygon(struct arc *arc, 67 void arc_to_path(struct arc *arc, 71 void arc_stroke_cb(struct arc *arc, 75 void arc_stroker_emit(struct arc *arc [all...] |
arc.c | 27 #include "arc.h" 165 try_to_fix_radii(struct arc *arc) 171 rot = DEGREES_TO_RADIANS(arc->theta); 178 x0p = (arc->x1*COS + arc->y1*SIN)/arc->a; 179 y0p = (-arc->x1*SIN + arc->y1*COS)/arc->b [all...] |
/external/mesa3d/src/gallium/state_trackers/vega/ |
arc.h | 37 struct arc { struct 55 void arc_init(struct arc *arc, 62 void arc_add_to_polygon(struct arc *arc, 67 void arc_to_path(struct arc *arc, 71 void arc_stroke_cb(struct arc *arc, 75 void arc_stroker_emit(struct arc *arc [all...] |
arc.c | 27 #include "arc.h" 165 try_to_fix_radii(struct arc *arc) 171 rot = DEGREES_TO_RADIANS(arc->theta); 178 x0p = (arc->x1*COS + arc->y1*SIN)/arc->a; 179 y0p = (-arc->x1*SIN + arc->y1*COS)/arc->b [all...] |
/external/openfst/src/include/fst/ |
arcfilter.h | 35 bool operator()(const A &arc) const { return true; } 43 bool operator()(const A &arc) const { 44 return arc.ilabel == 0 && arc.olabel == 0; 53 bool operator()(const A &arc) const { 54 return arc.ilabel == 0; 63 bool operator()(const A &arc) const { 64 return arc.olabel == 0; 81 bool operator()(const A &arc) const { 82 Label label = match_input_ ? arc.ilabel : arc.olabel [all...] |
reweight.h | 39 // An arc of weight w, with an origin state of potential p and 43 template <class Arc> 44 void Reweight(MutableFst<Arc> *fst, 45 const vector<typename Arc::Weight> &potential, 47 typedef typename Arc::Weight Weight; 68 StateIterator< MutableFst<Arc> > sit(*fst); 70 typename Arc::StateId state = sit.Value(); 73 typename Arc::Weight weight = potential[state]; 75 for (MutableArcIterator< MutableFst<Arc> > ait(fst, state); 78 Arc arc = ait.Value() local 114 Arc arc = ait.Value(); local [all...] |
verify.h | 31 template<class Arc> 32 bool Verify(const Fst<Arc> &fst, bool allow_negative_labels = false) { 33 typedef typename Arc::Label Label; 34 typedef typename Arc::Weight Weight; 35 typedef typename Arc::StateId StateId; 43 for (StateIterator< Fst<Arc> > siter(fst); 56 for (StateIterator< Fst<Arc> > siter(fst); 61 for (ArcIterator< Fst<Arc> > aiter(fst, s); 64 const Arc &arc =aiter.Value() local [all...] |
prune.h | 44 // Arc filter. 99 template <class Arc, class ArcFilter> 100 void Prune(MutableFst<Arc> *fst, 101 const PruneOptions<Arc, ArcFilter> &opts) { 102 typedef typename Arc::Weight Weight; 103 typedef typename Arc::StateId StateId; 153 for (MutableArcIterator< MutableFst<Arc> > ait(fst, s); 156 Arc arc = ait.Value(); local 157 if (!opts.filter(arc)) continue 282 const Arc &arc = ait.Value(); local [all...] |
rmfinalepsilon.h | 57 const A& arc = aiter.Value(); local 58 if (coaccess[arc.nextstate]) { 77 const A& arc = aiter.Value(); local 79 if (finals.find(arc.nextstate) != finals.end()) { 81 if (arc.ilabel == 0 && arc.olabel == 0) { 82 w = Plus(Times(fst->Final(arc.nextstate), arc.weight), w); 84 arcs.push_back(arc); 87 arcs.push_back(arc); [all...] |
visit.h | 40 // template <class Arc> 43 // typedef typename Arc::StateId StateId; 47 // void InitVisit(const Fst<Arc> &fst); 50 // // Invoked when arc to white/undiscovered state examined 51 // bool WhiteArc(StateId s, const Arc &a); 52 // // Invoked when arc to grey/unfinished state examined 53 // bool GreyArc(StateId s, const Arc &a); 54 // // Invoked when arc to black/finished state examined 55 // bool BlackArc(StateId s, const Arc &a); 68 template <class Arc, class V, class Q, class ArcFilter 137 const Arc &arc = aiter->Value(); local [all...] |
test-properties.h | 75 template<class Arc> 76 uint64 ComputeProperties(const Fst<Arc> &fst, uint64 mask, uint64 *known, 78 typedef typename Arc::Label Label; 79 typedef typename Arc::Weight Weight; 80 typedef typename Arc::StateId StateId; 106 SccVisitor<Arc> scc_visitor(&comp_props); 123 for (StateIterator< Fst<Arc> > siter(fst); 128 Arc prev_arc; 136 for (ArcIterator< Fst<Arc> > aiter(fst, s); 139 const Arc &arc =aiter.Value() local [all...] |
dfs-visit.h | 44 // template <class Arc> 47 // typedef typename Arc::StateId StateId; 51 // void InitVisit(const Fst<Arc> &fst); 54 // // Invoked when tree arc examined (to white/undiscovered state) 55 // bool TreeArc(StateId s, const Arc &a); 56 // // Invoked when back arc examined (to grey/unfinished state) 57 // bool BackArc(StateId s, const Arc &a); 58 // // Invoked when forward or cross arc examined (to black/finished state) 59 // bool ForwardOrCrossArc(StateId s, const Arc &a); 60 // // Invoked when state finished (PARENT is kNoStateID and ARC == NUL 147 const Arc &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...] |
invert.h | 24 #include <fst/arc-map.h> 30 // Mapper to implement inversion of an arc. 34 A operator()(const A &arc) { 35 return A(arc.olabel, arc.ilabel, arc.weight, arc.nextstate); 55 template<class Arc> inline 56 void Invert(MutableFst<Arc> *fst) { 59 ArcMap(fst, InvertMapper<Arc>()); [all...] |
project.h | 24 #include <fst/arc-map.h> 34 // Mapper to implement projection per arc. 40 A operator()(const A &arc) { 42 ? arc.ilabel : arc.olabel; 43 return A(label, label, arc.weight, arc.nextstate); 76 template<class Arc> inline 77 void Project(MutableFst<Arc> *fst, ProjectType project_type) { 78 ArcMap(fst, ProjectMapper<Arc>(project_type)) [all...] |
shortest-distance.h | 38 template <class Arc, class Queue, class ArcFilter> 40 typedef typename Arc::StateId StateId; 43 ArcFilter arc_filter; // Arc filter (e.g., limit to only epsilon graph) 71 template<class Arc, class Queue, class ArcFilter> 74 typedef typename Arc::StateId StateId; 75 typedef typename Arc::Weight Weight; 78 const Fst<Arc> &fst, 80 const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts, 96 const Fst<Arc> &fst_; 115 template <class Arc, class Queue, class ArcFilter 181 const Arc &arc = aiter.Value(); local [all...] |
encode.h | 32 #include <fst/arc-map.h> 61 // Encoded data consists of arc input/output labels and arc weight 130 // Given an arc encode either input/ouptut labels or input/costs or both 131 Label Encode(const A &arc) { 132 const Tuple tuple(arc.ilabel, 133 flags_ & kEncodeLabels ? arc.olabel : 0, 134 flags_ & kEncodeWeights ? arc.weight : Weight::One()); 145 // Given an arc, look up its encoded label. Returns kNoLabel if not found. 146 Label GetLabel(const A &arc) const [all...] |
/external/lzma/CPP/7zip/Archive/ |
ArchiveExports.cpp | 68 const CArcInfo &arc = *g_Arcs[formatIndex];
local 71 *outObject = arc.CreateInArchive();
76 if (!arc.CreateOutArchive)
78 *outObject = arc.CreateOutArchive();
91 const CArcInfo &arc = *g_Arcs[formatIndex];
local 96 prop = arc.Name;
101 CLS_ARC_ID_ITEM(clsId) = arc.ClassId;
105 if (arc.Ext != 0)
106 prop = arc.Ext;
109 if (arc.AddExt != 0) [all...] |
/external/openfst/src/include/fst/script/ |
compile-impl.h | 48 typedef A Arc; 86 Arc arc; local 96 arc.nextstate = d = StrToStateId(col[1]); 97 arc.ilabel = StrToILabel(col[2]); 98 arc.olabel = arc.ilabel; 99 arc.weight = Weight::One(); 100 fst_.AddArc(s, arc); 103 arc.nextstate = d = StrToStateId(col[1]) [all...] |
print-impl.h | 40 typedef A Arc; 99 PrintId(l, isyms_, "arc input label"); 103 PrintId(l, osyms_, "arc output label"); 111 Arc arc = aiter.Value(); local 114 PrintStateId(arc.nextstate); 116 PrintILabel(arc.ilabel); 119 PrintOLabel(arc.olabel); 121 if (show_weight_one_ || arc.weight != Weight::One()) 122 *ostrm_ << FLAGS_fst_field_separator[0] << arc.weight [all...] |
/external/chromium_org/third_party/skia/gm/ |
arcofzorro.cpp | 47 for (float arc = 134.0f; arc < 136.0f; arc += 0.01f) { 54 canvas->drawArc(rect, 0, arc, false, p);
|
/external/oprofile/libop/ |
op_alloc_counter.c | 59 counter_arc * arc = local 61 arc->counter = j; 69 list_add_tail(&arc->next, &ctr_arc[i].next); 91 counter_arc * arc = list_entry(pos, counter_arc, next); local 92 list_del(&arc->next); 93 free(arc); 143 counter_arc const * arc = list_entry(pos, counter_arc, next); local 145 if (allocated_mask & (1 << arc->counter)) 148 counter_map[depth] = arc->counter; 151 allocated_mask | (1 << arc->counter) [all...] |
/external/openfst/src/include/fst/extensions/pdt/ |
replace.h | 50 template <class Arc> 51 void Replace(const vector<pair<typename Arc::Label, 52 const Fst<Arc>* > >& ifst_array, 53 MutableFst<Arc> *ofst, 54 vector<pair<typename Arc::Label, 55 typename Arc::Label> > *parens, 56 typename Arc::Label root) { 57 typedef typename Arc::Label Label; 58 typedef typename Arc::StateId StateId; 59 typedef typename Arc::Weight Weight 108 Arc arc = aiter.Value(); local 153 Arc arc = aiter->Value(); local [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/openfst/src/test/ |
fst_test.h | 43 typedef typename F::Arc Arc; 44 typedef typename Arc::StateId StateId; 45 typedef typename Arc::Weight Weight; 46 typedef typename Arc::Label Label; 49 VectorFst<Arc> vfst; 80 const Arc &arc = aiter.Value(); local 81 CHECK_EQ(arc.ilabel, na); 82 CHECK_EQ(arc.olabel, 0) 137 Arc arc = aiter.Value(); local [all...] |