Searched refs:numEdges (Results 1 – 9 of 9) sorted by relevance
37 int const numEdges = sizeof(edge_array) / sizeof(Edge); in main() local38 int const weight[numEdges] = { 11 }; in main()44 Graph g(edge_array, edge_array + numEdges, numVertex); in main()
36 int numEdges = fRand.nextU() % (kMaxEdges+1); in onDelayedSetup() local38 for (int j = 0; j < numEdges; ++j) { in onDelayedSetup()
225 int numEdges = StrokeFixedCountTessellator::NumFixedEdgesInJoin(joinType); in worst_case_edges_in_join() local229 numEdges += std::max(SkScalarCeilToInt(numRadialSegmentsPerRadian * SK_ScalarPI) - 1, 0); in worst_case_edges_in_join()231 return numEdges; in worst_case_edges_in_join()
1206 unsigned int numEdges = 0; in SkOffsetSimplePolygon() local1228 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()
1190 unsigned int numEdges = 0; in SkOffsetSimplePolygon() local1212 numEdges += SkTMax(numSteps, 1); in SkOffsetSimplePolygon()1215 numEdges++; in SkOffsetSimplePolygon()1225 numEdges += SkTMax(numSteps, 1); in SkOffsetSimplePolygon()1231 if (numEdges > (unsigned int)std::numeric_limits<int32_t>::max()) { in SkOffsetSimplePolygon()1236 SkSTArray<64, OffsetEdge> edgeData(numEdges); in SkOffsetSimplePolygon()1297 SkASSERT(edgeData.count() == (int)numEdges); in SkOffsetSimplePolygon()1300 unsigned int offsetVertexCount = numEdges; in SkOffsetSimplePolygon()1302 unsigned long long maxIterations = (unsigned long long)(numEdges) * numEdges; in SkOffsetSimplePolygon()
602 std::size_t numEdges = 0; in advance_() local609 eraseItrs[numEdges] = lowIter; in advance_()610 ++numEdges; in advance_()613 if(numEdges == 1) { in advance_()621 for(std::size_t i = 0; i < numEdges; ++i) { in advance_()627 for(std::size_t i = 0; i < numEdges; ++i) { in advance_()
1698 const int numEdges = m_caseDef.primitiveType == TESSPRIMITIVETYPE_TRIANGLES ? 3 in genTessLevelCases() local1711 for (int edgeNdx = 0; edgeNdx < numEdges; ++edgeNdx) in genTessLevelCases()
4914 const int numEdges = m_primitiveType == TESSPRIMITIVETYPE_TRIANGLES ? 3 in genTessLevelCases() local4928 for (int edgeNdx = 0; edgeNdx < numEdges; edgeNdx++) in genTessLevelCases()