Home
last modified time | relevance | path

Searched refs:vertex_p (Results 1 – 25 of 56) sorted by relevance

123

/dports/devel/boost-docs/boost_1_72_0/libs/graph/test/
H A Dgraphviz_test.cpp167 vertex_p, edge_p, graph_p > graph_t;
176 vertex_p, edge_p, graph_p > graph_t;
189 vertex_p, edge_p, graph_p > graph_t;
199 vertex_p, edge_p, graph_p > graph_t;
210 vertex_p, edge_p, graph_p > graph_t;
221 vertex_p, edge_p, graph_p > graph_t;
274 vertex_p, edge_p, graph_p > graph_t;
285 vertex_p, edge_p, graph_p > graph_t;
297 vertex_p, edge_p, graph_p > graph_t;
309 vertex_p, edge_p, graph_p > graph_t;
[all …]
/dports/devel/boost-python-libs/boost_1_72_0/libs/graph/test/
H A Dgraphviz_test.cpp167 vertex_p, edge_p, graph_p > graph_t;
176 vertex_p, edge_p, graph_p > graph_t;
189 vertex_p, edge_p, graph_p > graph_t;
199 vertex_p, edge_p, graph_p > graph_t;
210 vertex_p, edge_p, graph_p > graph_t;
221 vertex_p, edge_p, graph_p > graph_t;
274 vertex_p, edge_p, graph_p > graph_t;
285 vertex_p, edge_p, graph_p > graph_t;
297 vertex_p, edge_p, graph_p > graph_t;
309 vertex_p, edge_p, graph_p > graph_t;
[all …]
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/test/
H A Dgraphviz_test.cpp167 vertex_p, edge_p, graph_p > graph_t;
176 vertex_p, edge_p, graph_p > graph_t;
189 vertex_p, edge_p, graph_p > graph_t;
199 vertex_p, edge_p, graph_p > graph_t;
210 vertex_p, edge_p, graph_p > graph_t;
221 vertex_p, edge_p, graph_p > graph_t;
274 vertex_p, edge_p, graph_p > graph_t;
285 vertex_p, edge_p, graph_p > graph_t;
297 vertex_p, edge_p, graph_p > graph_t;
309 vertex_p, edge_p, graph_p > graph_t;
[all …]
/dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/test/
H A Dgraphviz_test.cpp167 vertex_p, edge_p, graph_p > graph_t;
176 vertex_p, edge_p, graph_p > graph_t;
189 vertex_p, edge_p, graph_p > graph_t;
199 vertex_p, edge_p, graph_p > graph_t;
210 vertex_p, edge_p, graph_p > graph_t;
221 vertex_p, edge_p, graph_p > graph_t;
274 vertex_p, edge_p, graph_p > graph_t;
285 vertex_p, edge_p, graph_p > graph_t;
297 vertex_p, edge_p, graph_p > graph_t;
309 vertex_p, edge_p, graph_p > graph_t;
[all …]
/dports/databases/percona57-server/boost_1_59_0/libs/graph/test/
H A Dgraphviz_test.cpp167 vertex_p, edge_p, graph_p > graph_t;
176 vertex_p, edge_p, graph_p > graph_t;
189 vertex_p, edge_p, graph_p > graph_t;
199 vertex_p, edge_p, graph_p > graph_t;
210 vertex_p, edge_p, graph_p > graph_t;
221 vertex_p, edge_p, graph_p > graph_t;
274 vertex_p, edge_p, graph_p > graph_t;
285 vertex_p, edge_p, graph_p > graph_t;
297 vertex_p, edge_p, graph_p > graph_t;
309 vertex_p, edge_p, graph_p > graph_t;
[all …]
/dports/databases/xtrabackup/boost_1_59_0/libs/graph/test/
H A Dgraphviz_test.cpp167 vertex_p, edge_p, graph_p > graph_t;
176 vertex_p, edge_p, graph_p > graph_t;
189 vertex_p, edge_p, graph_p > graph_t;
199 vertex_p, edge_p, graph_p > graph_t;
210 vertex_p, edge_p, graph_p > graph_t;
221 vertex_p, edge_p, graph_p > graph_t;
274 vertex_p, edge_p, graph_p > graph_t;
285 vertex_p, edge_p, graph_p > graph_t;
297 vertex_p, edge_p, graph_p > graph_t;
309 vertex_p, edge_p, graph_p > graph_t;
[all …]
/dports/databases/percona57-client/boost_1_59_0/libs/graph/test/
H A Dgraphviz_test.cpp167 vertex_p, edge_p, graph_p > graph_t;
176 vertex_p, edge_p, graph_p > graph_t;
189 vertex_p, edge_p, graph_p > graph_t;
199 vertex_p, edge_p, graph_p > graph_t;
210 vertex_p, edge_p, graph_p > graph_t;
221 vertex_p, edge_p, graph_p > graph_t;
274 vertex_p, edge_p, graph_p > graph_t;
285 vertex_p, edge_p, graph_p > graph_t;
297 vertex_p, edge_p, graph_p > graph_t;
309 vertex_p, edge_p, graph_p > graph_t;
[all …]
/dports/devel/boost-libs/boost_1_72_0/libs/graph/test/
H A Dgraphviz_test.cpp167 vertex_p, edge_p, graph_p > graph_t;
176 vertex_p, edge_p, graph_p > graph_t;
189 vertex_p, edge_p, graph_p > graph_t;
199 vertex_p, edge_p, graph_p > graph_t;
210 vertex_p, edge_p, graph_p > graph_t;
221 vertex_p, edge_p, graph_p > graph_t;
274 vertex_p, edge_p, graph_p > graph_t;
285 vertex_p, edge_p, graph_p > graph_t;
297 vertex_p, edge_p, graph_p > graph_t;
309 vertex_p, edge_p, graph_p > graph_t;
[all …]
/dports/devel/hyperscan/boost_1_75_0/libs/graph/test/
H A Dgraphviz_test.cpp154 vertex_p; typedef
174 typedef adjacency_list< vecS, vecS, directedS, vertex_p, edge_p, graph_p >
184 typedef adjacency_list< vecS, vecS, directedS, vertex_p, edge_p, graph_p >
198 typedef adjacency_list< vecS, vecS, directedS, vertex_p, edge_p, graph_p >
246 typedef adjacency_list< vecS, vecS, directedS, vertex_p, edge_p,
270 typedef adjacency_list< vecS, vecS, undirectedS, vertex_p, edge_p,
290 typedef adjacency_list< setS, vecS, directedS, vertex_p, edge_p,
307 typedef adjacency_list< vecS, vecS, directedS, vertex_p, edge_p, graph_p >
320 typedef adjacency_list< vecS, vecS, directedS, vertex_p, edge_p, graph_p >
333 typedef adjacency_list< vecS, vecS, directedS, vertex_p, edge_p, graph_p >
[all …]
/dports/games/OpenTomb/OpenTomb-win32-2018-02-03_alpha/src/core/
H A Dpolygon.c23 p->vertices = (vertex_p)realloc(p->vertices, count * sizeof(vertex_t)); in Polygon_Resize()
44 vertex_p next_v, curr_v; in Polygon_IsBroken()
114 vertex_p v; in Polygon_MoveSelf()
128 vertex_p ret_v, src_v; in Polygon_Move()
145 vertex_p vp; in Polygon_TransformSelf()
164 vertex_p ret_v, src_v; in Polygon_Transform()
182 vertex_p vp; in Polygon_RayIntersect()
222 vertex_p prev_v, curr_v; in Polygon_IntersectPolygon()
377 vertex_p v; in Polygon_SplitClassify()
505 vertex_p v = p->vertices; in Polygon_IsInsideBBox()
[all …]
/dports/biology/fasta3/fasta-36.3.8/src/
H A Dlsim4.h24 } vertex, *vertex_p; typedef
44 vertex_p LIST, most;
86 static bool no_cross(int *flag_p, vertex_p LIST, struct l_struct *l_ptr);
100 static vertex_p findmax(struct vert_str *v_ptr);
/dports/games/OpenTomb/OpenTomb-win32-2018-02-03_alpha/src/render/
H A Dbsp_tree.cpp36 ret->vertices = (vertex_p)(m_temp_buffer + m_temp_allocated); in CreatePolygon()
114 vertex_p v = p->vertices; in AddPolygon()
188 m_vertex_buffer = (vertex_p)malloc(size * sizeof(vertex_t)); in CDynamicBSP()
244 vertex_p src_v, dst_v; in AddNewPolygonList()
346 vertex_p new_buffer = (vertex_p)malloc(new_buffer_size * sizeof(vertex_t)); in Reset()
/dports/math/polymake/polymake-4.5/lib/core/src/perl/
H A DSchedulerHeap.xxs265 …for (SV **vertex_p = AvARRAY(vertex_list), ** const vertex_last = vertex_p + AvFILLp(vertex_list);…
266 vertex_filter += static_cast<Int>(SvIVX(*vertex_p));
277 …for (SV **vertex_p = AvARRAY(vertex_list), ** const vertex_last = vertex_p + AvFILLp(vertex_list);…
278 const Int v = SvIVX(*vertex_p);
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/example/
H A Dread_graphviz.cpp24 property < vertex_color_t, float > > vertex_p; in main() typedef
31 vertex_p, edge_p, graph_p > graph_t; in main()
H A Dgraph-thingie.cpp35 property < vertex_root_t, int > > > vertex_p; in main() typedef
43 vertex_p, edge_p, graph_p > graph_t; in main()
/dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/example/
H A Dread_graphviz.cpp24 property < vertex_color_t, float > > vertex_p; in main() typedef
31 vertex_p, edge_p, graph_p > graph_t; in main()
H A Dgraph-thingie.cpp35 property < vertex_root_t, int > > > vertex_p; in main() typedef
43 vertex_p, edge_p, graph_p > graph_t; in main()
/dports/databases/percona57-server/boost_1_59_0/libs/graph/example/
H A Dread_graphviz.cpp24 property < vertex_color_t, float > > vertex_p; in main() typedef
31 vertex_p, edge_p, graph_p > graph_t; in main()
/dports/databases/xtrabackup/boost_1_59_0/libs/graph/example/
H A Dread_graphviz.cpp24 property < vertex_color_t, float > > vertex_p; in main() typedef
31 vertex_p, edge_p, graph_p > graph_t; in main()
/dports/databases/percona57-client/boost_1_59_0/libs/graph/example/
H A Dread_graphviz.cpp24 property < vertex_color_t, float > > vertex_p; in main() typedef
31 vertex_p, edge_p, graph_p > graph_t; in main()
/dports/devel/boost-docs/boost_1_72_0/libs/graph/example/
H A Dread_graphviz.cpp24 property < vertex_color_t, float > > vertex_p; in main() typedef
31 vertex_p, edge_p, graph_p > graph_t; in main()
/dports/devel/boost-python-libs/boost_1_72_0/libs/graph/example/
H A Dread_graphviz.cpp24 property < vertex_color_t, float > > vertex_p; in main() typedef
31 vertex_p, edge_p, graph_p > graph_t; in main()
/dports/devel/boost-libs/boost_1_72_0/libs/graph/example/
H A Dread_graphviz.cpp24 property < vertex_color_t, float > > vertex_p; in main() typedef
31 vertex_p, edge_p, graph_p > graph_t; in main()
/dports/devel/hyperscan/boost_1_75_0/libs/graph/example/
H A Dread_graphviz.cpp25 vertex_p; in main() typedef
31 typedef adjacency_list< vecS, vecS, directedS, vertex_p, edge_p, graph_p > in main()
/dports/games/prboom-plus/prboom-plus-2.5.1.3/src/
H A Dgl_sky.c687 vbo_vertex_t *vertex_p; in gld_BuildSky() local
715 vertex_p = &vbo->data[0]; in gld_BuildSky()
720 vbo->loops[vbo->loopcount].vertexindex = vertex_p - &vbo->data[0]; in gld_BuildSky()
741 SkyVertex(vertex_p, 1, c); in gld_BuildSky()
742 vertex_p->r = SkyColor->r; in gld_BuildSky()
743 vertex_p->g = SkyColor->g; in gld_BuildSky()
744 vertex_p->b = SkyColor->b; in gld_BuildSky()
745 vertex_p->a = 255; in gld_BuildSky()
746 vertex_p++; in gld_BuildSky()
762 SkyVertex(vertex_p++, r + (yflip ? 1 : 0), (c ? c : 0)); in gld_BuildSky()
[all …]

123