Searched refs:arc (Results 51 - 75 of 228) sorted by relevance

12345678910

/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Darc.h0 // arc.h
17 // Commonly used Fst arc types.
119 GallicArc(const A &arc) argument
120 : ilabel(arc.ilabel), olabel(arc.ilabel),
121 weight(arc.olabel, arc.weight), nextstate(arc.nextstate) {}
H A Dtopsort.h51 bool TreeArc(StateId s, const A &arc) { return true; } argument
53 bool BackArc(StateId s, const A &arc) { return (*acyclic_ = false); } argument
55 bool ForwardOrCrossArc(StateId s, const A &arc) { return true; } argument
H A Dshortest-path.h53 // such as the queue discipline, the arc filter and delta.
115 const Arc &arc = aiter.Value(); local
116 while (distance->size() <= arc.nextstate) {
123 Weight &nd = (*distance)[arc.nextstate];
124 Weight w = Times(sd, arc.weight);
127 parent[arc.nextstate] = s;
128 arc_parent[arc.nextstate] = arc;
129 if (!enqueued[arc.nextstate]) {
130 state_queue->Enqueue(arc
[all...]
H A Dequivalent.h192 const Arc &arc = arc_iter.Value(); local
193 if (arc.weight != Weight::Zero()) { // Zero-weight arcs
196 arc_pairs[arc.ilabel].first = Util::MapState(arc.nextstate, FST1);
204 const Arc &arc = arc_iter.Value(); local
205 if (arc.weight != Weight::Zero()) { // Zero-weight arcs
208 arc_pairs[arc.ilabel].second = Util::MapState(arc.nextstate, FST2);
H A Dreplace.h31 // By default ReplaceFst will copy the input label of the 'replace arc'.
33 // create an epsilon arc when recursing into the appropriate Fst.
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
319 if (arc
[all...]
/external/openfst/src/include/fst/
H A Dtopsort.h56 bool TreeArc(StateId s, const A &arc) { return true; } argument
58 bool BackArc(StateId s, const A &arc) { return (*acyclic_ = false); } argument
60 bool ForwardOrCrossArc(StateId s, const A &arc) { return true; } argument
H A Dstatesort.h85 Arc arc = (*arcs1)[i]; local
86 arc.nextstate = order[arc.nextstate];
87 fst->AddArc(s2, arc);
H A Dvector-fst.h77 void AddArc(StateId s, const Arc &arc) { argument
78 states_[s]->arcs.push_back(arc);
149 // Provide information needed for generic arc iterator
230 void AddArc(StateId s, const A &arc) { argument
232 if (arc.ilabel == 0) {
235 if (arc.olabel == 0) {
240 SetProperties(AddArcProperties(Properties(), s, arc, parc));
242 BaseImpl::AddArc(s, arc);
312 const A &arc = aiter.Value(); local
313 BaseImpl::AddArc(s, arc);
353 A arc; local
557 const A &arc = aiter.Value(); local
647 SetValue(const A &arc) argument
[all...]
H A Dlabel-reachable.h131 // 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
218 Arc arc = aiter.Value(); local
220 arc.ilabel = Relabel(arc.ilabel);
222 arc.olabel = Relabel(arc
327 const A &arc = aiter->Value(); local
420 Arc arc = aiter.Value(); local
[all...]
H A Dequivalent.h228 const Arc &arc = arc_iter.Value(); local
229 if (arc.weight != Weight::Zero()) { // Zero-weight arcs
232 arc_pairs[arc.ilabel].first = Util::MapState(arc.nextstate, FST1);
240 const Arc &arc = arc_iter.Value(); local
241 if (arc.weight != Weight::Zero()) { // Zero-weight arcs
244 arc_pairs[arc.ilabel].second = Util::MapState(arc.nextstate, FST2);
H A Dstate-reachable.h96 bool TreeArc(StateId s, const A &arc) { argument
100 bool BackArc(StateId s, const A &arc) { argument
106 bool ForwardOrCrossArc(StateId s, const A &arc) { argument
108 (*isets_)[s].Union((*isets_)[arc.nextstate]);
112 void FinishState(StateId s, StateId p, const A *arc) { argument
H A Dshortest-path.h70 // such as the queue discipline, the arc filter and delta.
158 const Arc &arc = aiter.Value(); local
159 while (distance->size() <= arc.nextstate) {
166 Weight &nd = (*distance)[arc.nextstate];
167 Weight w = Times(sd, arc.weight);
174 parent[arc.nextstate] = s;
175 arc_parent[arc.nextstate] = arc;
176 if (!enqueued[arc.nextstate]) {
177 state_queue->Enqueue(arc
448 const ReverseArc &arc = aiter.Value(); local
[all...]
H A Dproperties.h63 // ilabel == olabel for each arc
65 // ilabel != olabel for some arc
103 // Non-trivial arc or final weights
105 // Only trivial arc and final weights
208 // Properties that are preserved when an FST arc is added
214 // Properties that are preserved when an FST arc is set
329 uint64 AddArcProperties(uint64 inprops, typename A::StateId s, const A &arc,
405 /// \param s the id of the state to which an arc is being added
406 /// \param arc the arc bein
410 AddArcProperties(uint64 inprops, typename A::StateId s, const A &arc, const A *prev_arc) argument
[all...]
/external/openfst/src/script/
H A Dweight-class.cc19 #include <fst/arc.h>
/external/lzma/CPP/7zip/UI/Common/
H A DExtract.cpp19 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,
18 DecompressArchive( const CArc &arc, UInt64 packSize, const NWildcard::CCensorNode &wildcardCensor, const CExtractOptions &options, IExtractCallbackUI *callback, CArchiveExtractCallback *extractCallbackSpec, UString &errorMessage, UInt64 &stdInProcessed) argument
/external/srec/srec/crec/
H A Dsrec_context.c105 int sprintf_arc(char* buf, srec_context* fst, FSMarc* arc);
106 int printf_arc1(srec_context* fst, char* msg, FSMarc* arc);
113 int fst_push_arc_olabel(srec_context* fst, FSMarc* arc);
114 int fst_push_arc_cost(srec_context* fst, FSMarc* arc);
115 int fst_pull_arc_olabel(srec_context* fst, FSMarc* arc);
116 int fst_free_arc(srec_context* fst, FSMarc* arc);
118 int fst_free_arc_net(srec_context* fst, FSMarc* arc);
985 /* setup the arc freelist */
1011 IF_DEBUG_WDADD(printf("read arc %s", line));
1168 /* regular arc */
1254 FSMarc* arc; local
1519 FSMarc *arc = NULL, *arc2; local
1545 FSMarc *arc = NULL, *arc2; local
1578 FSMarc_t *arc, *arc2, *arc3; local
2009 fst_free_arc(srec_context* fst, FSMarc* arc) argument
2024 fst_free_arc_net(srec_context* fst, FSMarc* arc) argument
2034 fst_push_arc_olabel(srec_context* fst, FSMarc* arc) argument
2064 fst_push_arc_cost(srec_context* fst, FSMarc* arc) argument
2081 fst_pull_arc_olabel(srec_context* fst, FSMarc* arc) argument
2214 remove_arc_arriving(srec_context* fst, FSMnode* to_node, FSMarc* arc) argument
2230 split_node_for_arc(srec_context* fst, FSMarc* arc) argument
2658 append_arc_leaving_node(srec_context* fst, FSMnode* fr_node, FSMarc_ptr arc) argument
2669 append_arc_arriving_node(srec_context* fst, FSMnode* to_node, FSMarc_ptr arc) argument
2686 printf_arc1(srec_context* fst, char* msg, FSMarc* arc) argument
2693 sprintf_arc(char* buf, srec_context* fst, FSMarc* arc) argument
3061 FSMarc* arc; local
3613 FSMarc* arc; local
3646 FSMarc* arc; local
3763 FSMarc* arc; local
[all...]
/external/chromium_org/third_party/freetype/src/smooth/
H A Dftgrays.c921 FT_Vector* arc; local
926 arc = ras.bez_stack;
927 arc[0].x = UPSCALE( to->x );
928 arc[0].y = UPSCALE( to->y );
929 arc[1].x = UPSCALE( control->x );
930 arc[1].y = UPSCALE( control->y );
931 arc[2].x = ras.x;
932 arc[2].y = ras.y;
935 dx = FT_ABS( arc[2].x + arc[
1020 FT_Vector* arc; local
[all...]
/external/freetype/src/smooth/
H A Dftgrays.c943 FT_Vector* arc; local
948 arc = ras.bez_stack;
949 arc[0].x = UPSCALE( to->x );
950 arc[0].y = UPSCALE( to->y );
951 arc[1].x = UPSCALE( control->x );
952 arc[1].y = UPSCALE( control->y );
953 arc[2].x = ras.x;
954 arc[2].y = ras.y;
957 dx = FT_ABS( arc[2].x + arc[
1042 FT_Vector* arc; local
[all...]
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/smooth/
H A Dftgrays.c933 FT_Vector* arc; local
938 arc = ras.bez_stack;
939 arc[0].x = UPSCALE( to->x );
940 arc[0].y = UPSCALE( to->y );
941 arc[1].x = UPSCALE( control->x );
942 arc[1].y = UPSCALE( control->y );
943 arc[2].x = ras.x;
944 arc[2].y = ras.y;
947 dx = FT_ABS( arc[2].x + arc[
1032 FT_Vector* arc; local
[all...]
/external/srec/tools/test_g2g/
H A Dtest_g2g.c249 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
[all...]
/external/chromium_org/third_party/freetype/src/raster/
H A Dftraster.c342 /* States of each line, arc, and profile */
484 TPoint* arc; /* current Bezier arc pointer */ member in struct:black_TWorker_
497 Bool joint; /* signals that the last arc ended */
674 * given y-monotonous Bezier arc that crosses a scanline before
1026 /* Subdivide a third-order Bezier arc into two joint sub-arcs in the */
1258 /* Compute the x-coordinates of an ascending Bezier arc and store */
1262 /* degree :: The degree of the Bezier arc (either 2 or 3). */
1282 TPoint* arc; local
1288 arc
1412 TPoint* arc = ras.arc; local
[all...]
/external/freetype/src/raster/
H A Dftraster.c342 /* States of each line, arc, and profile */
486 TPoint* arc; /* current Bezier arc pointer */ member in struct:black_TWorker_
499 Bool joint; /* signals that the last arc ended */
676 * given y-monotonous Bezier arc that crosses a scanline before
1028 /* Subdivide a third-order Bezier arc into two joint sub-arcs in the */
1260 /* Compute the x-coordinates of an ascending Bezier arc and store */
1264 /* degree :: The degree of the Bezier arc (either 2 or 3). */
1284 TPoint* arc; local
1290 arc
1414 TPoint* arc = ras.arc; local
[all...]
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/raster/
H A Dftraster.c342 /* States of each line, arc, and profile */
486 TPoint* arc; /* current Bezier arc pointer */ member in struct:black_TWorker_
499 Bool joint; /* signals that the last arc ended */
676 * given y-monotonous Bezier arc that crosses a scanline before
1028 /* Subdivide a third-order Bezier arc into two joint sub-arcs in the */
1260 /* Compute the x-coordinates of an ascending Bezier arc and store */
1264 /* degree :: The degree of the Bezier arc (either 2 or 3). */
1284 TPoint* arc; local
1290 arc
1414 TPoint* arc = ras.arc; local
[all...]
/external/chromium_org/third_party/WebKit/Source/core/html/canvas/
H A DCanvasPathMethods.h49 void arc(float x, float y, float radius, float startAngle, float endAngle, bool anticlockwise, ExceptionState&);
/external/chromium_org/third_party/skia/experimental/SkV8Example/
H A Dpath.js10 p.arc(0, 300, 40, Math.PI/2, 3/2*Math.PI);

Completed in 586 milliseconds

12345678910