| /dports/graphics/quickqanava/QuickQanava-ab88d77ec62175b9fd499a154ffaf92f7bf23989/GTpo/tests/ |
| H A D | gtpo_algorithm_tests.cpp | 64 g.create_edge(n1, n2); in TEST()
78 g.create_edge(n1, n2); in TEST()
79 g.create_edge(n1, n3); in TEST()
89 g.create_edge(n1, n3); in TEST()
90 g.create_edge(n2, n3); in TEST()
98 g.create_edge(n1, n2); in TEST()
99 g.create_edge(n2, n1); in TEST()
119 g.create_edge(n1, n2); in TEST()
133 g.create_edge(n1, n2); in TEST()
134 g.create_edge(n1, n3); in TEST()
[all …]
|
| H A D | gtpo_topology_tests.cpp | 178 g.create_edge( n1, n1 ); in TEST()
212 g.create_edge(n1, n2); in TEST()
253 g.create_edge(n1, n2); in TEST()
255 g.create_edge(n2, n3); in TEST()
256 g.create_edge(n2, n3); in TEST()
257 g.create_edge(n2, n3); in TEST()
315 g.create_edge(n1, n2); in TEST()
317 g.create_edge(n2, n3); in TEST()
318 g.create_edge(n2, n4); in TEST()
356 g.create_edge(wn1, wn2); in TEST()
[all …]
|
| H A D | gtpo_groups_tests.cpp | 190 auto e1 = g.create_edge(n1, n2); in TEST()
211 auto e1 = g.create_edge(n1, n2); in TEST()
248 g.create_edge( n1, n2 ); in TEST()
255 auto e2 = g.create_edge( n1, n2 ); in TEST()
276 auto e1 = g.create_edge( n1, n2 ); in TEST()
277 auto e2 = g.create_edge( n1, n3 ); in TEST()
278 auto e3 = g.create_edge( n2, n4 ); in TEST()
279 auto e4 = g.create_edge( n3, n5 ); in TEST()
280 auto e5 = g.create_edge( n4, n3 ); in TEST()
|
| H A D | gtpo_functional_tests.cpp | 125 src.create_edge(n1, n2); in TEST()
179 src.create_edge(n1, n2); in TEST()
180 src.create_edge(n1, n3); in TEST()
181 src.create_edge(n3, n2); in TEST()
|
| H A D | gtpo_behaviours_tests.cpp | 119 auto e = g.create_edge(s, d); in TEST()
263 auto e1 = g.create_edge(n2, n); in TEST()
274 auto e2 = g.create_edge(n, n3); in TEST()
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/Boolean_set_operations_2/ |
| H A D | Gps_base_functor.h | 74 void create_edge(Halfedge_const_handle , in create_edge() function
79 void create_edge(Halfedge_const_handle , in create_edge() function
84 void create_edge(Face_const_handle , in create_edge() function
|
| H A D | Gps_do_intersect_functor.h | 89 void create_edge(Halfedge_const_handle , in create_edge() function
96 void create_edge(Halfedge_const_handle , in create_edge() function
101 void create_edge(Face_const_handle , in create_edge() function
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/Surface_sweep_2/ |
| H A D | Arr_default_overlay_traits_base.h | 105 virtual void create_edge (Halfedge_handle_A /* e1 */, in create_edge() function
113 virtual void create_edge (Halfedge_handle_A /* e1 */, in create_edge() function
121 virtual void create_edge (Face_handle_A /* f1 */, in create_edge() function
|
| /dports/graphics/vcg/vcg.1.30/demo/ |
| H A D | animation2.c | 103 void create_edge _PP((char *so,char *ta));
337 create_edge("A","B");
404 void create_edge(char *so,char *ta) in create_edge() function
406 void create_edge(so,ta) in create_edge()
|
| H A D | animation1.c | 101 void create_edge _PP((char *so,char *ta));
341 create_edge("A","B");
411 void create_edge(char *so, char *ta) in create_edge() function
413 void create_edge(so,ta) in create_edge()
|
| H A D | vcgdemomaker.c | 83 void create_edge _PP((int x,int y));
222 void create_edge(int x,int y) in create_edge() function
224 void create_edge(x,y) in create_edge()
283 create_edge(i,j);
317 create_edge(i,n/2+i);
318 create_edge(i,n-i-1);
366 create_edge(me,son);
424 create_edge(me,son);
|
| /dports/graphics/quickqanava/QuickQanava-ab88d77ec62175b9fd499a154ffaf92f7bf23989/GTpo/src/gtpo/ |
| H A D | generator.hpp | 57 tree.create_edge(node, sub_tree); in complete_tree_impl_rec()
91 graph.create_edge(root, sub_tree); in complete_tree_rec()
|
| H A D | functional.h | 130 dst.create_edge(dst_src_node, dst_dst_node);
189 dst.create_edge(dst_src_node, dst_dst_node);
293 dst.create_edge(dst_src_node, dst_dst_node);
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/Arr_spherical_gaussian_map_3/ |
| H A D | Arr_polyhedral_sgm_overlay.h | 161 void create_edge(Halfedge_const_handle /*h1*/, Halfedge_const_handle /*h2*/, in create_edge() function
176 void create_edge(Halfedge_const_handle /*h1*/, Face_const_handle /*f2*/, in create_edge() function
189 void create_edge(Face_const_handle /*f1*/, Halfedge_const_handle /*h2*/, in create_edge() function
|
| /dports/databases/grass7/grass-7.8.6/vector/v.delaunay/ |
| H A D | edge.c | 62 new_edge = create_edge(v1, v2); in join()
156 struct edge *create_edge(struct vertex *v1, struct vertex *v2) in create_edge() function
|
| H A D | geometry.c | 78 *l_ccw = *r_cw = create_edge(&(sites[l]), &(sites[r])); in divide()
82 a = create_edge(&(sites[l]), &(sites[l + 1])); in divide()
83 b = create_edge(&(sites[l + 1]), &(sites[r])); in divide()
|
| H A D | edge.h | 68 struct edge *create_edge(struct vertex *v1, struct vertex *v2);
|
| /dports/x11-toolkits/libdazzle/libdazzle-3.42.0/src/panel/ |
| H A D | dzl-dock-bin.h | 38 GtkWidget *(*create_edge) (DzlDockBin *self, member
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/Envelope_3/ |
| H A D | Envelope_overlay_functor.h | 169 void create_edge(Halfedge_const_handle1 h1, in create_edge() function
206 void create_edge(Halfedge_const_handle1 h1, in create_edge() function
241 void create_edge(Face_const_handle1 f1, in create_edge() function
|
| /dports/lang/gcc11-devel/gcc-11-20211009/gcc/ |
| H A D | cgraphclones.c | 114 new_edge = n->create_edge (callee, call_stmt, prof_count, true); in clone()
126 new_edge = n->create_edge (callee, call_stmt, prof_count, true); in clone()
249 cgraph_edge *e = new_thunk->create_edge (node, NULL, new_thunk->count); in duplicate_thunk_for_node()
818 cgraph_edge *edge = create_edge (callee, stmt, count); in create_edge_including_clones()
838 edge = node->create_edge (callee, stmt, count); in create_edge_including_clones()
|
| /dports/lang/gcc12-devel/gcc-12-20211205/gcc/ |
| H A D | cgraphclones.c | 114 new_edge = n->create_edge (callee, call_stmt, prof_count, true); in clone()
126 new_edge = n->create_edge (callee, call_stmt, prof_count, true); in clone()
250 cgraph_edge *e = new_thunk->create_edge (node, NULL, new_thunk->count); in duplicate_thunk_for_node()
824 cgraph_edge *edge = create_edge (callee, stmt, count); in create_edge_including_clones()
844 edge = node->create_edge (callee, stmt, count); in create_edge_including_clones()
|
| /dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/ |
| H A D | cgraphclones.c | 114 new_edge = n->create_edge (callee, call_stmt, prof_count, true); in clone()
126 new_edge = n->create_edge (callee, call_stmt, prof_count, true); in clone()
249 cgraph_edge *e = new_thunk->create_edge (node, NULL, new_thunk->count); in duplicate_thunk_for_node()
818 cgraph_edge *edge = create_edge (callee, stmt, count); in create_edge_including_clones()
838 edge = node->create_edge (callee, stmt, count); in create_edge_including_clones()
|
| /dports/lang/gcc11/gcc-11.2.0/gcc/ |
| H A D | cgraphclones.c | 114 new_edge = n->create_edge (callee, call_stmt, prof_count, true); in clone()
126 new_edge = n->create_edge (callee, call_stmt, prof_count, true); in clone()
249 cgraph_edge *e = new_thunk->create_edge (node, NULL, new_thunk->count); in duplicate_thunk_for_node()
818 cgraph_edge *edge = create_edge (callee, stmt, count); in create_edge_including_clones()
838 edge = node->create_edge (callee, stmt, count); in create_edge_including_clones()
|
| /dports/devel/zpu-gcc/zpu-toolchain-1.0/toolchain/gcc/gcc/ |
| H A D | cgraph.c | 70 static struct cgraph_edge *create_edge (struct cgraph_node *,
155 create_edge (struct cgraph_node *caller, struct cgraph_node *callee) in create_edge() function
298 return create_edge (cgraph_node (caller), cgraph_node (callee)); in cgraph_record_call()
|
| /dports/devel/zpu-binutils/zpu-toolchain-1.0/toolchain/gcc/gcc/ |
| H A D | cgraph.c | 70 static struct cgraph_edge *create_edge (struct cgraph_node *,
155 create_edge (struct cgraph_node *caller, struct cgraph_node *callee) in create_edge() function
298 return create_edge (cgraph_node (caller), cgraph_node (callee)); in cgraph_record_call()
|