| /third_party/boost/boost/graph/ |
| D | mcgregor_common_subgraphs.hpp | 434 BGL_FORALL_VERTICES_T(vertex1, graph1, GraphFirst) in mcgregor_common_subgraphs_internal_init()
436 put(correspondence_map_1_to_2, vertex1, in mcgregor_common_subgraphs_internal_init()
606 BGL_FORALL_VERTICES_T(vertex1, m_graph1, GraphFirst) in operator ()()
608 put(new_subgraph_1_to_2, vertex1, in operator ()()
609 get(correspondence_map_1_to_2, vertex1)); in operator ()()
767 BGL_FORALL_VERTICES_T(vertex1, m_graph1, GraphFirst) in operator ()()
769 put(new_subgraph_1_to_2, vertex1, in operator ()()
770 get(correspondence_map_1_to_2, vertex1)); in operator ()()
962 BGL_FORALL_VERTICES_T(vertex1, m_graph1, GraphFirst) in operator ()()
964 put(new_subgraph_1_to_2, vertex1, in operator ()()
[all …]
|
| /third_party/boost/libs/graph/test/ |
| D | mcgregor_subgraphs_test.cpp | 105 BGL_FORALL_VERTICES_T(vertex1, subgraph1, MembershipFilteredGraph) in operator ()()
109 = vertex(get(vindex_map1, vertex1), m_common_subgraph); in operator ()()
113 != get(vname_map1, vertex1)) in operator ()()
127 EdgeInfo edge1 = edge(vertex1, vertex1_2, subgraph1); in operator ()()
226 BGL_FORALL_VERTICES_T(vertex1, m_graph1, Graph) in operator ()()
229 Vertex vertex2 = get(correspondence_map_1_to_2, vertex1); in operator ()()
233 subgraph_string << vertex1 << "," << vertex2 << " "; in operator ()()
|
| D | isomorphism.cpp | 66 typedef typename graph_traits< Graph1 >::vertex_descriptor vertex1; in randomly_permute_graph() typedef
77 std::vector< vertex1 > orig_vertices; in randomly_permute_graph()
85 std::map< vertex1, vertex2 > vertex_map; in randomly_permute_graph()
|
| D | vf2_sub_graph_iso_test.cpp | 65 typedef typename graph_traits< Graph1 >::vertex_descriptor vertex1; in randomly_permute_graph() typedef
84 std::map< vertex2, vertex1 > vertex_map; in randomly_permute_graph()
97 typename std::map< vertex2, vertex1 >::iterator si in randomly_permute_graph()
|
| /third_party/boost/libs/geometry/example/ |
| D | 07_b_graph_route_example.cpp | 194 typename boost::graph_traits<Graph>::vertex_descriptor vertex1, in add_edge_to_route() argument
202 > opt_edge = boost::edge(vertex1, vertex2, graph); in add_edge_to_route()
230 typename boost::graph_traits<Graph>::vertex_descriptor vertex1, in build_route() argument
238 while (pred != vertex1) in build_route()
|
| D | 07_a_graph_route_example.cpp | 209 typename boost::graph_traits<Graph>::vertex_descriptor vertex1, in add_edge_to_route() argument
217 > opt_edge = boost::edge(vertex1, vertex2, graph); in add_edge_to_route()
245 typename boost::graph_traits<Graph>::vertex_descriptor vertex1, in build_route() argument
253 while (pred != vertex1) in build_route()
|
| /third_party/boost/boost/polygon/ |
| D | voronoi_diagram.hpp | 179 voronoi_vertex_type* vertex1() { return twin_->vertex0(); } in vertex1() function in boost::polygon::voronoi_edge
180 const voronoi_vertex_type* vertex1() const { return twin_->vertex0(); } in vertex1() function in boost::polygon::voronoi_edge
206 bool is_finite() const { return vertex0() && vertex1(); } in is_finite()
210 bool is_infinite() const { return !vertex0() || !vertex1(); } in is_infinite()
447 const vertex_type* v2 = it->vertex1(); in _build()
|
| D | polygon_set_data.hpp | 206 iT vertex1 = begin_vertex; in insert_vertex_sequence() local
207 if (++vertex1 == end_vertex) { in insert_vertex_sequence()
220 assign(p1, *vertex1); in insert_vertex_sequence()
227 ++vertex1; in insert_vertex_sequence()
228 if (vertex1 == end_vertex) { in insert_vertex_sequence()
229 vertex1 = begin_vertex; in insert_vertex_sequence()
|
| /third_party/vk-gl-cts/external/openglcts/modules/glesext/tessellation_shader/ |
| D | esextcTessellationShaderIsolines.cpp | 264 const float* vertex1 = (&test_result.rendered_data[0]) + n_vertex * 3; /* components */ in checkSecondOuterTessellationLevelEffect() local
265 float vertex1_x = vertex1[0]; in checkSecondOuterTessellationLevelEffect()
|
| /third_party/vk-gl-cts/modules/gles3/functional/ |
| D | es3fShaderInvarianceTests.cpp | 214 const tcu::Vec4 vertex1 = genRandomVector(rnd); in init() local
218 triangles[triNdx*3 + 0] = vertex1; in init()
|
| D | es3fClippingTests.cpp | 1269 tcu::Vec3 vertex1; in TriangleFanFillTest() local
1285 vertex1 = visit.exitPoint; in TriangleFanFillTest()
1292 …vertex1 = visit.corner + tcu::normalize(tcu::mix(v1, v2, tcu::Vec3(float(tri+1)/trianglesPerVisit)… in TriangleFanFillTest()
1304 triangle.v2 = tcu::Vec4(vertex1.x() * radius, vertex1.y() * radius, vertex1.z() * radius, 1.0f); in TriangleFanFillTest()
|
| /third_party/vk-gl-cts/modules/gles2/functional/ |
| D | es2fShaderInvarianceTests.cpp | 214 const tcu::Vec4 vertex1 = genRandomVector(rnd); in init() local
218 triangles[triNdx*3 + 0] = vertex1; in init()
|
| D | es2fClippingTests.cpp | 1265 tcu::Vec3 vertex1; in TriangleFanFillTest() local
1281 vertex1 = visit.exitPoint; in TriangleFanFillTest()
1288 …vertex1 = visit.corner + tcu::normalize(tcu::mix(v1, v2, tcu::Vec3(float(tri+1)/trianglesPerVisit)… in TriangleFanFillTest()
1300 triangle.v2 = tcu::Vec4(vertex1.x() * radius, vertex1.y() * radius, vertex1.z() * radius, 1.0f); in TriangleFanFillTest()
|
| /third_party/vk-gl-cts/external/vulkancts/modules/vulkan/shaderrender/ |
| D | vktShaderRenderInvarianceTests.cpp | 180 const tcu::Vec4 vertex1 = genRandomVector(rnd); in iterate() local
184 vertices[triNdx * 3 + 0] = vertex1; in iterate()
|
| /third_party/boost/boost/geometry/formulas/ |
| D | sjoberg_intersection.hpp | 957 , vertex1(geod1.get_vertex_data()) in geodesics_type()
963 typename geodesic_type::vertex_data vertex1; member
1131 bool ok = converge_07_one_geod(sin_beta, t, geodesics.geod1, geodesics.vertex1, lon_sph, in converge_07_step_one()
|
| /third_party/vk-gl-cts/external/vulkancts/modules/vulkan/pipeline/ |
| D | vktPipelineDepthRangeUnrestrictedTests.cpp | 246 const Vertex4RGBA vertex1 = in createPoints() local
284 vertices.push_back(vertex1); in createPoints()
|