| /external/s2-geometry-library-java/tests/com/google/common/geometry/ |
| D | S2EdgeIndexTest.java | 78 double edgeLengthMetersMax, double capSpanMeters, int numEdges, List<S2Edge> edges) { in generateRandomEarthEdges() argument
81 for (int i = 0; i < numEdges; ++i) { in generateRandomEarthEdges()
145 private void tryCrossingsRandomInCap(int numEdges, double edgeLengthMax, double capSpanMeters, in tryCrossingsRandomInCap() argument
148 generateRandomEarthEdges(edgeLengthMax, capSpanMeters, numEdges, allEdges); in tryCrossingsRandomInCap()
|
| /external/skia/bench/ |
| D | TopoSortBench.cpp | 36 int numEdges = fRand.nextU() % (kMaxEdges+1); in onDelayedSetup() local
38 for (int j = 0; j < numEdges; ++j) { in onDelayedSetup()
|
| /external/skqp/bench/ |
| D | TopoSortBench.cpp | 36 int numEdges = fRand.nextU() % (kMaxEdges+1); in onDelayedSetup() local
38 for (int j = 0; j < numEdges; ++j) { in onDelayedSetup()
|
| /external/skia/src/gpu/tessellate/ |
| D | GrStrokeFixedCountTessellator.cpp | 184 int numEdges = GrStrokeTessellateShader::NumFixedEdgesInJoin(joinType); in worst_case_edges_in_join() local
188 numEdges += std::max(SkScalarCeilToInt(numRadialSegmentsPerRadian * SK_ScalarPI) - 1, 0); in worst_case_edges_in_join()
190 return numEdges; in worst_case_edges_in_join()
|
| D | GrStrokeIndirectTessellator.cpp | 654 int numEdges = numExtraEdgesInJoin + num_edges_in_resolve_level(i); in BinningInstanceWriter() local
656 numEdges * 2, 0); in BinningInstanceWriter()
659 fNumEdgesPerResolveLevel[i] = numEdges; in BinningInstanceWriter()
691 float numEdges = fNumEdgesPerResolveLevel[resolveLevel]; in writeStroke() local
697 (isInternalChop) ? -numEdges : +numEdges); in writeStroke()
|
| /external/skqp/src/utils/ |
| D | SkPolyUtils.cpp | 1158 unsigned int numEdges = 0; in SkOffsetSimplePolygon() local
1180 numEdges += SkTMax(numSteps, 1); in SkOffsetSimplePolygon()
1183 numEdges++; in SkOffsetSimplePolygon()
1193 numEdges += SkTMax(numSteps, 1); in SkOffsetSimplePolygon()
1199 if (numEdges > (unsigned int)std::numeric_limits<int32_t>::max()) { in SkOffsetSimplePolygon()
1204 SkSTArray<64, OffsetEdge> edgeData(numEdges); in SkOffsetSimplePolygon()
1265 SkASSERT(edgeData.count() == (int)numEdges); in SkOffsetSimplePolygon()
1268 unsigned int offsetVertexCount = numEdges; in SkOffsetSimplePolygon()
1270 unsigned long long maxIterations = (unsigned long long)(numEdges) * numEdges; in SkOffsetSimplePolygon()
|
| /external/llvm-project/lld/MachO/ |
| D | ExportTrie.cpp | 279 uint8_t numEdges = *buf++; in parse() local
280 for (uint8_t i = 0; i < numEdges; ++i) { in parse()
|
| /external/s2-geometry-library-java/src/com/google/common/geometry/ |
| D | S2EdgeIndex.java | 562 private int numEdges; field in S2EdgeIndex.DataEdgeIterator
591 numEdges = edgeIndex.getNumEdges(); in getCandidates()
615 return (currentIndex < numEdges); in hasNext()
|
| /external/skia/src/utils/ |
| D | SkPolyUtils.cpp | 1206 unsigned int numEdges = 0; in SkOffsetSimplePolygon() local
1228 numEdges += std::max(numSteps, 1); in SkOffsetSimplePolygon()
1231 numEdges++; in SkOffsetSimplePolygon()
1241 numEdges += std::max(numSteps, 1); in SkOffsetSimplePolygon()
1247 if (numEdges > (unsigned int)std::numeric_limits<int32_t>::max()) { in SkOffsetSimplePolygon()
1252 SkSTArray<64, OffsetEdge> edgeData(numEdges); in SkOffsetSimplePolygon()
1313 SkASSERT(edgeData.count() == (int)numEdges); in SkOffsetSimplePolygon()
1316 unsigned int offsetVertexCount = numEdges; in SkOffsetSimplePolygon()
1318 unsigned long long maxIterations = (unsigned long long)(numEdges) * numEdges; in SkOffsetSimplePolygon()
|
| /external/guava/android/guava/src/com/google/common/graph/ |
| D | Graphs.java | 59 int numEdges = graph.edges().size(); in hasCycle() local
60 if (numEdges == 0) { in hasCycle()
63 if (!graph.isDirected() && numEdges >= graph.nodes().size()) { in hasCycle()
|
| /external/guava/guava/src/com/google/common/graph/ |
| D | Graphs.java | 60 int numEdges = graph.edges().size(); in hasCycle() local
61 if (numEdges == 0) { in hasCycle()
64 if (!graph.isDirected() && numEdges >= graph.nodes().size()) { in hasCycle()
|
| /external/deqp/external/vulkancts/modules/vulkan/tessellation/ |
| D | vktTessellationInvarianceTests.cpp | 1698 const int numEdges = m_caseDef.primitiveType == TESSPRIMITIVETYPE_TRIANGLES ? 3 in genTessLevelCases() local
1711 for (int edgeNdx = 0; edgeNdx < numEdges; ++edgeNdx) in genTessLevelCases()
|
| /external/antlr/tool/src/main/java/org/antlr/tool/ |
| D | Grammar.java | 1290 int numEdges = edges.size(); in makeEdgeSetsDisjoint() local
1291 for (int e = 0; e < numEdges; e++) { in makeEdgeSetsDisjoint()
|
| /external/tensorflow/tensorflow/stream_executor/cuda/ |
| D | cuda_runtime_10_2.inc | 1744 size_t *numEdges) {
1749 return func_ptr(graph, from, to, numEdges);
|
| D | cuda_runtime_10_1.inc | 1735 size_t *numEdges) {
1740 return func_ptr(graph, from, to, numEdges);
|
| D | cuda_runtime_10_0.inc | 1738 size_t *numEdges) {
1743 return func_ptr(graph, from, to, numEdges);
|
| D | cuda_runtime_11_0.inc | 1822 size_t *numEdges) {
1827 return func_ptr(graph, from, to, numEdges);
|
| D | cuda_10_1.inc | 1627 CUgraphNode *to, size_t *numEdges) {
1632 return func_ptr(hGraph, from, to, numEdges);
|
| D | cuda_10_0.inc | 1605 CUgraphNode *to, size_t *numEdges) {
1610 return func_ptr(hGraph, from, to, numEdges);
|
| D | cuda_runtime_11_2.inc | 1992 size_t *numEdges) {
1997 return func_ptr(graph, from, to, numEdges);
|
| D | cuda_10_2.inc | 1748 CUgraphNode *to, size_t *numEdges) {
1753 return func_ptr(hGraph, from, to, numEdges);
|
| D | cuda_11_0.inc | 1788 CUgraphNode *to, size_t *numEdges) {
1793 return func_ptr(hGraph, from, to, numEdges);
|
| D | cuda_11_2.inc | 2115 CUgraphNode *to, size_t *numEdges) {
2120 return func_ptr(hGraph, from, to, numEdges);
|
| /external/deqp/modules/gles31/functional/ |
| D | es31fTessellationTests.cpp | 4821 const int numEdges = m_primitiveType == TESSPRIMITIVETYPE_TRIANGLES ? 3 in genTessLevelCases() local
4835 for (int edgeNdx = 0; edgeNdx < numEdges; edgeNdx++) in genTessLevelCases()
|