Home
last modified time | relevance | path

Searched refs:arcs (Results 1 – 25 of 90) sorted by relevance

1234

/external/python/cpython3/Parser/pgen/
Dautomata.py38 for arc in state.arcs:
57 for arc in state.arcs:
110 self.arcs = []
128 self.arcs.append(NFAArc(target, label))
235 for nfa_arc in nfa_state.arcs:
253 arcs = {}
255 for nfa_arc in nfa_state.arcs:
257 nfa_set = arcs.setdefault(nfa_arc.label, set())
267 for label, nfa_set in sorted(arcs.items()):
321 for label, next in sorted(state.arcs.items()):
[all …]
Dpgen.py188 arcs = []
189 for label, next in sorted(state.arcs.items()):
191 arcs.append((self.make_label(c, label), dfa.states.index(next)))
193 arcs.append((0, dfa.states.index(state)))
194 states.append(arcs)
286 for label, next in state.arcs.items():
/external/python/cpython2/Lib/lib2to3/pgen2/
Dpgen.py41 arcs = []
42 for label, next in sorted(state.arcs.iteritems()):
43 arcs.append((self.make_label(c, label), dfa.index(next)))
45 arcs.append((0, dfa.index(state)))
46 states.append(arcs)
121 for label, next in state.arcs.iteritems():
185 for label, next in state.arcs:
190 arcs = {}
192 for label, next in nfastate.arcs:
194 addclosure(next, arcs.setdefault(label, {}))
[all …]
Dconv.py136 arcs = []
142 arcs.append((i, j))
145 allarcs[(n, m)] = arcs
157 arcs = allarcs[n, m]
158 assert k == len(arcs), (lineno, line)
159 state.append(arcs)
Dparse.py121 arcs = states[state]
123 for i, newstate in arcs:
150 if (0, state) in arcs:
/external/python/cpython3/Lib/lib2to3/pgen2/
Dpgen.py41 arcs = []
42 for label, next in sorted(state.arcs.items()):
43 arcs.append((self.make_label(c, label), dfa.index(next)))
45 arcs.append((0, dfa.index(state)))
46 states.append(arcs)
121 for label, next in state.arcs.items():
185 for label, next in state.arcs:
190 arcs = {}
192 for label, next in nfastate.arcs:
194 addclosure(next, arcs.setdefault(label, {}))
[all …]
Dconv.py136 arcs = []
142 arcs.append((i, j))
145 allarcs[(n, m)] = arcs
157 arcs = allarcs[n, m]
158 assert k == len(arcs), (lineno, line)
159 state.append(arcs)
Dparse.py124 arcs = states[state]
126 for i, newstate in arcs:
153 if (0, state) in arcs:
/external/libxml2/os400/libxmlrpg/
Dxlink.rpgle95 * @nbArcs: the number of arcs detected on the link
96 * @from: pointer to the array of source roles found on the arcs
97 * @to: pointer to the array of target roles found on the arcs
98 * @show: array of values for the show attributes found on the arcs
99 * @actuate: array of values for the actuate attributes found on the arcs
/external/skqp/gm/
Dcirculararcs.cpp147 const Arc arcs[] = { variable
194 SkScalar midX = SK_ARRAY_COUNT(arcs) * (kS + kPad) - kPad/2.f;
201 for (auto arc : arcs) {
205 for (auto arc : arcs) {
/external/freetype/docs/
Draster.txt111 facilitates the definition of successive Bézier arcs.
128 They exhibit, however, one very useful property of Bézier arcs:
395 We first need to be able to easily detect non-monotonic arcs,
448 Bézier arcs have the special property of being very easily
449 decomposed into two sub-arcs, which are themselves Bézier arcs.
452 conditions can be found for third-order arcs).
455 two sub-arcs Q1Q2Q3 and R1R2R3:
496 smaller sub-arcs. Note that in the above drawing, both sub-arcs
517 extremum. We can then re-subdivide Q1Q2Q3 into two sub-arcs and
533 However, for Bézier arcs, the job is a little more complicated.
[all …]
/external/skia/gm/
Dcirculararcs.cpp164 const Arc arcs[] = { variable
211 SkScalar midX = SK_ARRAY_COUNT(arcs) * (kS + kPad) - kPad/2.f;
218 for (auto arc : arcs) {
222 for (auto arc : arcs) {
/external/autotest/client/site_tests/example_UnitTest/src/
DMakefile8 OPTIONS = -fprofile-arcs -ftest-coverage -fno-inline -O0
/external/google-fruit/extras/scripts/
Dtest_coverage.sh8 COMPILE_COMMAND=(g++ -O0 -W -Wall -Werror -std=c++11 -fprofile-arcs -fno-exceptions -ftest-coverage…
/external/grpc-grpc/src/php/ext/grpc/
Dconfig.m4149 CFLAGS="$CFLAGS -O0 -ggdb -fprofile-arcs -ftest-coverage"
150 CXXFLAGS="$CXXFLAGS -ggdb -O0 -fprofile-arcs -ftest-coverage"
/external/llvm-project/llvm/test/tools/llvm-cov/Inputs/
DREADME7 clang++ -g -ftest-coverage -fprofile-arcs test.cpp
/external/llvm/test/tools/llvm-cov/Inputs/
DREADME7 clang++ -g -ftest-coverage -fprofile-arcs test.cpp
/external/rust/crates/libz-sys/src/zlib/contrib/puff/
DMakefile13 cc -fprofile-arcs -ftest-coverage -o puft puff.c pufftest.o
/external/cn-cbor/cmake/
DCoveralls.cmake117 set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -g -O0 -fprofile-arcs -ftest-coverage")
118 set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -g -O0 -fprofile-arcs -ftest-coverage")
/external/eigen/cmake/
DEigenConfigureTesting.cmake47 set(COVERAGE_FLAGS "-fprofile-arcs -ftest-coverage")
/external/libevent/cmake/
DCodeCoverage.cmake43 # SET(CMAKE_CXX_FLAGS "-g -O0 -fprofile-arcs -ftest-coverage")
44 # SET(CMAKE_C_FLAGS "-g -O0 -fprofile-arcs -ftest-coverage")
/external/google-fruit/
DCMakeLists.txt62 …set(FRUIT_ADDITIONAL_COMPILE_FLAGS "${FRUIT_ADDITIONAL_COMPILE_FLAGS} -fprofile-arcs -ftest-covera…
63 …set(FRUIT_ADDITIONAL_LINKER_FLAGS "${FRUIT_ADDITIONAL_LINKER_FLAGS} -fprofile-arcs -ftest-coverage…
/external/llvm/test/tools/llvm-cov/
Dllvm-cov.test114 # Has arcs from exit blocks
116 EXIT_BLOCK_ARCS: (main) has arcs from exit block.
/external/llvm-project/llvm/lib/ProfileData/
DGCOV.cpp172 fn->arcs.push_back(std::move(arc)); in readGCNO()
268 if (length != 2 * fn->arcs.size()) { in readGCDA()
272 length, unsigned(2 * fn->arcs.size())); in readGCDA()
275 for (std::unique_ptr<GCOVArc> &arc : fn->arcs) { in readGCDA()
/external/freetype/src/base/
Dftstroke.c544 FT_Int i, arcs = 1; in ft_stroke_border_arcto() local
549 while ( angle_diff > FT_ARC_CUBIC_ANGLE * arcs || in ft_stroke_border_arcto()
550 -angle_diff > FT_ARC_CUBIC_ANGLE * arcs ) in ft_stroke_border_arcto()
551 arcs++; in ft_stroke_border_arcto()
554 coef = FT_Tan( angle_diff / ( 4 * arcs ) ); in ft_stroke_border_arcto()
567 for ( i = 1; i <= arcs; i++ ) in ft_stroke_border_arcto()
571 angle_start + i * angle_diff / arcs ); in ft_stroke_border_arcto()

1234