/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
reweight.h | 34 // An arc of weight w, with an origin state of potential p and 38 template <class Arc> 39 void Reweight(MutableFst<Arc> *fst, vector<typename Arc::Weight> potential, 41 typedef typename Arc::Weight Weight; 58 for (StateIterator< MutableFst<Arc> > sit(*fst); 61 typename Arc::StateId state = sit.Value(); 62 for (MutableArcIterator< MutableFst<Arc> > ait(fst, state); 65 Arc arc = ait.Value() local 94 Arc arc = ait.Value(); local [all...] |
rmfinalepsilon.h | 50 const A& arc = aiter.Value(); local 51 if (coaccess[arc.nextstate]) { 70 const A& arc = aiter.Value(); local 72 if (finals.find(arc.nextstate) != finals.end()) { 74 if (arc.ilabel == 0 && arc.olabel == 0) { 75 w = Plus(Times(fst->Final(arc.nextstate), arc.weight), w); 77 arcs.push_back(arc); 80 arcs.push_back(arc); [all...] |
statesort.h | 32 template <class Arc> 33 void StateSort(MutableFst<Arc> *fst, 34 const vector<typename Arc::StateId> &order) { 35 typedef typename Arc::StateId StateId; 36 typedef typename Arc::Weight Weight; 46 vector<Arc> arcsa, arcsb; 47 vector<Arc> *arcs1 = &arcsa, *arcs2 = &arcsb; 51 for (StateIterator< MutableFst<Arc> > siter(*fst); 59 for (ArcIterator< MutableFst<Arc> > aiter(*fst, s1); 68 for (ArcIterator< MutableFst<Arc> > aiter(*fst, s2) 76 Arc arc = (*arcs1)[i]; local [all...] |
verify.h | 28 template<class Arc> 29 bool Verify(const Fst<Arc> &fst) { 30 typedef typename Arc::Label Label; 31 typedef typename Arc::Weight Weight; 32 typedef typename Arc::StateId StateId; 40 for (StateIterator< Fst<Arc> > siter(fst); 53 for (StateIterator< Fst<Arc> > siter(fst); 58 for (ArcIterator< Fst<Arc> > aiter(fst, s); 61 const Arc &arc =aiter.Value() local [all...] |
prune.h | 35 // Arc filter. 55 template <class Arc, class ArcFilter> 56 void Prune(MutableFst<Arc> *fst, 57 const PruneOptions<Arc, ArcFilter> &opts) { 58 typedef typename Arc::Weight Weight; 59 typedef typename Arc::StateId StateId; 97 for (MutableArcIterator< MutableFst<Arc> > it(fst, state); 100 Arc arc = it.Value(); local 101 if (!opts.filter(arc)) continue 199 Arc arc = ait.Value(); local [all...] |
concat.h | 38 template<class Arc> 39 void Concat(MutableFst<Arc> *fst1, const Fst<Arc> &fst2) { 40 typedef typename Arc::StateId StateId; 41 typedef typename Arc::Label Label; 42 typedef typename Arc::Weight Weight; 53 for (StateIterator< Fst<Arc> > siter2(fst2); 59 for (ArcIterator< Fst<Arc> > aiter(fst2, s2); 62 Arc arc = aiter.Value() local [all...] |
dfs-visit.h | 34 // template <class Arc> 37 // typedef typename Arc::StateId StateId; 41 // void InitVisit(const Fst<Arc> &fst); 44 // // Invoked when tree arc examined (to white/undiscovered state) 45 // bool TreeArc(StateId s, const Arc &a); 46 // // Invoked when back arc examined (to grey/unfinished state) 47 // bool BackArc(StateId s, const Arc &a); 48 // // Invoked when forward or cross arc examined (to black/finished state) 49 // bool ForwardOrCrossArc(StateId s, const Arc &a); 50 // // Invoked when state finished (PARENT is kNoStateID and ARC == NUL 123 const Arc &arc = aiter.Value(); local [all...] |
equivalent.h | 37 // disjoint, we map Arc::StateId on the type MappedId. The states of 44 template <class Arc> 46 typedef typename Arc::StateId StateId; 47 typedef typename Arc::Weight Weight; 73 static bool IsFinal(const Fst<Arc> &fa, MappedId s) { 111 template <class Arc> 112 bool Equivalent(const Fst<Arc> &fst1, const Fst<Arc> &fst2) { 113 typedef typename Arc::Weight Weight; 127 VectorFst<Arc> efst1(fst1) 192 const Arc &arc = arc_iter.Value(); local 204 const Arc &arc = arc_iter.Value(); local [all...] |
randgen.h | 31 // ARC SELECTORS - these function objects are used to select a random 74 const A &arc = aiter.Value(); local 75 sum += exp(-arc.weight.Value()); 84 const A &arc = aiter.Value(); local 85 p += exp(-arc.weight.Value()); 100 const S &arc_selector; // How an arc is selected at a state 116 template<class Arc, class ArcSelector> 117 void RandGen(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, 119 typedef typename Arc::Weight Weight [all...] |
test-properties.h | 71 template<class Arc> 72 uint64 ComputeProperties(const Fst<Arc> &fst, uint64 mask, uint64 *known, 74 typedef typename Arc::Label Label; 75 typedef typename Arc::Weight Weight; 76 typedef typename Arc::StateId StateId; 102 SccVisitor<Arc> scc_visitor(&comp_props); 119 for (StateIterator< Fst<Arc> > siter(fst); 124 Arc prev_arc(kNoLabel, kNoLabel, Weight::One(), 0); 131 for (ArcIterator< Fst<Arc> > aiter(fst, s); 134 const Arc &arc =aiter.Value() local [all...] |
union.h | 36 template <class Arc> 37 void Union(MutableFst<Arc> *fst1, const Fst<Arc> &fst2) { 38 typedef typename Arc::StateId StateId; 39 typedef typename Arc::Label Label; 40 typedef typename Arc::Weight Weight; 51 for (StateIterator< Fst<Arc> > siter(fst2); 57 for (ArcIterator< Fst<Arc> > aiter(fst2, s2); 60 Arc arc = aiter.Value() local [all...] |
shortest-distance.h | 33 template <class Arc, class Queue, class ArcFilter> 35 typedef typename Arc::StateId StateId; 38 ArcFilter arc_filter; // Arc filter (e.g., limit to only epsilon graph) 54 template<class Arc, class Queue, class ArcFilter> 57 typedef typename Arc::StateId StateId; 58 typedef typename Arc::Weight Weight; 61 const Fst<Arc> &fst, 63 const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts, 78 const Fst<Arc> *fst_; 93 template <class Arc, class Queue, class ArcFilter 144 const Arc &arc = aiter.Value(); local [all...] |
/packages/apps/Camera2/src/com/android/camera/util/ |
AccessibilityUtils.java | 27 AccessibilityRecordCompat arc = new AccessibilityRecordCompat(event); local 28 arc.setSource(view);
|
/packages/apps/Gallery2/src/com/android/gallery3d/util/ |
AccessibilityUtils.java | 45 AccessibilityRecordCompat arc = new AccessibilityRecordCompat(event); local 46 arc.setSource(view);
|
/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...] |
/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...] |
/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/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/srec/srec/crec/ |
srec_debug.c | 97 FSMarc* arc = &context->FSMarc_list[stoken->FSMarc_index]; local 105 printf("%sstoken %4d at arc %4d ilabel %4d nextnode %4d states", msg, token_index, 106 stoken->FSMarc_index, arc->ilabel, arc->to_node);
|
/external/chromium_org/third_party/WebKit/Source/core/html/canvas/ |
CanvasPathMethods.cpp | 139 /* http://www.whatwg.org/specs/web-apps/current-work/multipage/the-canvas-element.html#dom-context-2d-arc 142 * then the arc is the whole circumference of this ellipse, and the point at startAngle along this circle's circumference, 151 * Otherwise, the arc is the path along the circumference of this ellipse from the start point to the end point, 154 * the arc can never cover an angle greater than 2pi radians. 157 * We draw the entire circle, because some web sites use arc(x, y, r, 0, 2*Math.PI, true) to draw circle. 234 // First, if the object's path has any subpaths, then the method must add a straight line from the last point in the subpath to the start point of the arc. 254 void CanvasPathMethods::arc(float x, float y, float radius, float startAngle, float endAngle, bool anticlockwise, ExceptionState& exceptionState) function in class:WebCore::CanvasPathMethods 268 // The arc is empty but we still need to draw the connecting line.
|
/external/lzma/CPP/7zip/UI/Common/ |
Extract.cpp | 19 const CArc &arc,
29 IInArchive *archive = arc.Archive;
39 RINOK(arc.GetItemPath(i, filePath));
56 outDir.Replace(L"*", GetCorrectFsPath(arc.DefaultName));
75 &arc,
240 CArc &arc = archiveLink.Arcs.Back();
local 241 arc.MTimeDefined = (!options.StdInMode && !fi.IsDevice);
242 arc.MTime = fi.MTime;
245 RINOK(DecompressArchive(arc,
|
LoadCodecs.h | 220 const CArcInfoEx &arc = Formats[i];
local 221 if (!arc.UpdateEnabled)
223 if (arc.Name.CompareNoCase(name) == 0)
|
/prebuilts/python/darwin-x86/2.7.5/include/python2.7/ |
grammar.h | 12 /* A label of an arc */ 28 /* An arc from one state to another */ 31 short a_lbl; /* Label of this arc */ 32 short a_arrow; /* State where this arc goes to */ 33 } arc; typedef in typeref:struct:__anon80732 39 arc *s_arc; /* Array of arcs */
|
/prebuilts/python/linux-x86/2.7.5/include/python2.7/ |
grammar.h | 12 /* A label of an arc */ 28 /* An arc from one state to another */ 31 short a_lbl; /* Label of this arc */ 32 short a_arrow; /* State where this arc goes to */ 33 } arc; typedef in typeref:struct:__anon80855 39 arc *s_arc; /* Array of arcs */
|
/external/lzma/CPP/7zip/UI/Console/ |
Main.cpp | 253 const CArcInfoEx &arc = codecs->Formats[i];
local 255 if (arc.LibIndex >= 0)
258 ConvertUInt32ToString(arc.LibIndex, s);
265 stdStream << (char)(arc.UpdateEnabled ? 'C' : ' ');
266 stdStream << (char)(arc.KeepName ? 'K' : ' ');
268 PrintString(stdStream, arc.Name, 6);
271 for (int t = 0; t < arc.Exts.Size(); t++)
273 const CArcExtInfo &ext = arc.Exts[t];
285 const CByteBuffer &sig = arc.StartSignature;
|