| /dports/devel/avr-gcc/gcc-10.2.0/gcc/ |
| H A D | digraph.cc | 37 struct test_edge;
45 typedef test_edge edge_t;
62 struct test_edge : public dedge<test_graph_traits> struct
64 test_edge (node_t *src, node_t *dest) in test_edge() function
85 test_edge *result = new test_edge (src, dst); in add_test_edge()
97 auto_vec<const test_edge *> m_edges;
141 test_edge *ab = g.add_test_edge (a, b); in test_shortest_paths()
142 test_edge *ac = g.add_test_edge (a, c); in test_shortest_paths()
143 test_edge *cd = g.add_test_edge (c, d); in test_shortest_paths()
144 test_edge *be = g.add_test_edge (b, e); in test_shortest_paths()
[all …]
|
| /dports/lang/gcc10-devel/gcc-10-20211008/gcc/ |
| H A D | digraph.cc | 37 struct test_edge;
45 typedef test_edge edge_t;
62 struct test_edge : public dedge<test_graph_traits> struct
64 test_edge (node_t *src, node_t *dest) in test_edge() function
85 test_edge *result = new test_edge (src, dst); in add_test_edge()
97 auto_vec<const test_edge *> m_edges;
141 test_edge *ab = g.add_test_edge (a, b); in test_shortest_paths()
142 test_edge *ac = g.add_test_edge (a, c); in test_shortest_paths()
143 test_edge *cd = g.add_test_edge (c, d); in test_shortest_paths()
144 test_edge *be = g.add_test_edge (b, e); in test_shortest_paths()
[all …]
|
| /dports/lang/gcc10/gcc-10.3.0/gcc/ |
| H A D | digraph.cc | 37 struct test_edge;
45 typedef test_edge edge_t;
62 struct test_edge : public dedge<test_graph_traits> struct
64 test_edge (node_t *src, node_t *dest) in test_edge() function
85 test_edge *result = new test_edge (src, dst); in add_test_edge()
97 auto_vec<const test_edge *> m_edges;
141 test_edge *ab = g.add_test_edge (a, b); in test_shortest_paths()
142 test_edge *ac = g.add_test_edge (a, c); in test_shortest_paths()
143 test_edge *cd = g.add_test_edge (c, d); in test_shortest_paths()
144 test_edge *be = g.add_test_edge (b, e); in test_shortest_paths()
[all …]
|
| /dports/misc/vxl/vxl-3.3.2/contrib/brl/bbas/bgrl2/tests/ |
| H A D | test_edge.h | 20 class test_edge : public bgrl2_edge<test_node>
26 test_edge() : bgrl2_edge<test_node>(), id_(-1){} in test_edge() function
27 test_edge(int id) : bgrl2_edge<test_node>(), id_(id){} in test_edge() function
28 test_edge(test_node_sptr v1, test_node_sptr v2) : bgrl2_edge<test_node>(v1,v2), id_(-1){} in test_edge() function
29 test_edge(int id, test_node_sptr v1, test_node_sptr v2) : bgrl2_edge<test_node>(v1,v2), id_(id){} in test_edge() function
30 ~test_edge() override= default;
|
| H A D | test_node.h | 16 class test_edge; variable
19 class test_node : public bgrl2_vertex<test_edge>
25 test_node(): bgrl2_vertex<test_edge>(), id_(0) {} in test_node()
26 test_node(int id): bgrl2_vertex<test_edge>(), id_(id) {} in test_node()
|
| H A D | test_edge_sptr.h | 6 class test_edge; variable
8 typedef vbl_smart_ptr<test_edge> test_edge_sptr;
|
| H A D | test_graph.h | 19 class test_graph : public bgrl2_graph<test_node, test_edge>
22 test_graph() : bgrl2_graph<test_node, test_edge>() {} in test_graph()
|
| /dports/lang/gcc11-devel/gcc-11-20211009/gcc/ |
| H A D | digraph.cc | 37 struct test_edge;
45 typedef test_edge edge_t;
64 test_edge (node_t *src, node_t *dest) in test_edge() function
85 test_edge *result = new test_edge (src, dst); in add_test_edge()
97 auto_vec<const test_edge *> m_edges;
141 test_edge *ab = g.add_test_edge (a, b); in test_shortest_paths()
142 test_edge *ac = g.add_test_edge (a, c); in test_shortest_paths()
143 test_edge *cd = g.add_test_edge (c, d); in test_shortest_paths()
144 test_edge *be = g.add_test_edge (b, e); in test_shortest_paths()
145 test_edge *ef = g.add_test_edge (e, f); in test_shortest_paths()
[all …]
|
| /dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/ |
| H A D | digraph.cc | 37 struct test_edge;
45 typedef test_edge edge_t;
64 test_edge (node_t *src, node_t *dest) in test_edge() argument
85 test_edge *result = new test_edge (src, dst); in add_test_edge()
97 auto_vec<const test_edge *> m_edges;
141 test_edge *ab = g.add_test_edge (a, b); in test_shortest_paths()
142 test_edge *ac = g.add_test_edge (a, c); in test_shortest_paths()
143 test_edge *cd = g.add_test_edge (c, d); in test_shortest_paths()
144 test_edge *be = g.add_test_edge (b, e); in test_shortest_paths()
145 test_edge *ef = g.add_test_edge (e, f); in test_shortest_paths()
[all …]
|
| /dports/lang/gcc11/gcc-11.2.0/gcc/ |
| H A D | digraph.cc | 37 struct test_edge;
45 typedef test_edge edge_t;
64 test_edge (node_t *src, node_t *dest) in test_edge() argument
85 test_edge *result = new test_edge (src, dst); in add_test_edge()
97 auto_vec<const test_edge *> m_edges;
141 test_edge *ab = g.add_test_edge (a, b); in test_shortest_paths()
142 test_edge *ac = g.add_test_edge (a, c); in test_shortest_paths()
143 test_edge *cd = g.add_test_edge (c, d); in test_shortest_paths()
144 test_edge *be = g.add_test_edge (b, e); in test_shortest_paths()
145 test_edge *ef = g.add_test_edge (e, f); in test_shortest_paths()
[all …]
|
| /dports/lang/gcc12-devel/gcc-12-20211205/gcc/ |
| H A D | digraph.cc | 37 struct test_edge;
45 typedef test_edge edge_t;
64 test_edge (node_t *src, node_t *dest) in test_edge() function
85 test_edge *result = new test_edge (src, dst); in add_test_edge()
97 auto_vec<const test_edge *> m_edges;
141 test_edge *ab = g.add_test_edge (a, b); in test_shortest_paths()
142 test_edge *ac = g.add_test_edge (a, c); in test_shortest_paths()
143 test_edge *cd = g.add_test_edge (c, d); in test_shortest_paths()
144 test_edge *be = g.add_test_edge (b, e); in test_shortest_paths()
145 test_edge *ef = g.add_test_edge (e, f); in test_shortest_paths()
[all …]
|
| /dports/cad/opencascade/opencascade-7.6.0/tests/bugs/moddata_1/ |
| H A D | buc60854 | 12 edge test_edge test_vertex_1 test_vertex_2
14 splitshape test_shape test_face test_face test_edge
30 BUC60854 result test_shape test_face test_edge_2 test_edge_3 @ test_edge test_edge_1 # L
38 BUC60854 result_2 test_shape test_face test_edge_2 test_edge_3 @ test_edge test_edge_1 # R
|
| /dports/games/openrct2/OpenRCT2-0.3.5.1/src/openrct2/peep/ |
| H A D | GuestPathfinding.cpp | 527 int32_t test_edge = bitscanforward(edges); in path_is_thin_junction() local
528 if (test_edge == -1) in path_is_thin_junction()
550 edges &= ~(1 << test_edge); in path_is_thin_junction()
551 } while ((test_edge = bitscanforward(edges)) != -1); in path_is_thin_junction()
696 loc += TileDirectionDelta[test_edge]; in peep_pathfind_heuristic_search()
782 if (direction == test_edge) in peep_pathfind_heuristic_search()
802 if (direction == test_edge) in peep_pathfind_heuristic_search()
1000 edges &= ~(1 << direction_reverse(test_edge)); in peep_pathfind_heuristic_search()
1444 for (int32_t test_edge = chosen_edge; test_edge != -1; test_edge = bitscanforward(edges)) in peep_pathfind_choose_direction() local
1446 edges &= ~(1 << test_edge); in peep_pathfind_choose_direction()
[all …]
|
| /dports/textproc/xsv-rs/xsv-0.13.0/cargo-crates/num-traits-0.2.4/tests/ |
| H A D | cast.rs | 251 fn test_edge() {
282 test_edge();
290 macro_rules! test_edge { in cast_int_to_int_edge_cases() macro
297 test_edge!(isize i8 i16 i32 i64); in cast_int_to_int_edge_cases()
298 test_edge!(usize u8 u16 u32 u64); in cast_int_to_int_edge_cases()
306 macro_rules! test_edge { in cast_int_to_128_edge_cases() macro
316 test_edge!(isize i8 i16 i32 i64 i128); in cast_int_to_128_edge_cases()
317 test_edge!(usize u8 u16 u32 u64 u128); in cast_int_to_128_edge_cases()
|
| /dports/graphics/blender/blender-2.91.0/source/blender/blenkernel/intern/ |
| H A D | multires_unsubdivide.c | 513 BMEdge *test_edge; in edge_step() local
519 BM_ITER_ELEM (test_edge, &iter, (*r_next_vertex), BM_EDGES_OF_VERT) { in edge_step()
520 if (!BM_edge_share_quad_check(test_edge, edge)) { in edge_step()
521 return test_edge; in edge_step()
547 BMEdge *test_edge; in get_initial_edge_y() local
548 BM_ITER_ELEM (test_edge, &iter, f, BM_EDGES_OF_FACE) { in get_initial_edge_y()
549 if (edge_x != test_edge) { in get_initial_edge_y()
550 if (test_edge->v1 != initial_vertex && test_edge->v2 == initial_vertex) { in get_initial_edge_y()
551 return test_edge; in get_initial_edge_y()
553 if (test_edge->v2 != initial_vertex && test_edge->v1 == initial_vertex) { in get_initial_edge_y()
[all …]
|
| /dports/graphics/gimp-app/gimp-2.10.30/plug-ins/selection-to-path/ |
| H A D | edge.c | 95 edge_type test_edge = FIND_TEST_EDGE (dir); \
98 && is_outline_edge (test_edge, test_row, test_col)) \
102 *edge = test_edge; \
|
| /dports/multimedia/librespot/librespot-0.1.3/cargo-crates/num-traits-0.2.12/tests/ |
| H A D | cast.rs | 253 fn test_edge() {
284 test_edge();
292 macro_rules! test_edge { in cast_int_to_int_edge_cases() macro
299 test_edge!(isize i8 i16 i32 i64); in cast_int_to_int_edge_cases()
300 test_edge!(usize u8 u16 u32 u64); in cast_int_to_int_edge_cases()
308 macro_rules! test_edge { in cast_int_to_128_edge_cases() macro
318 test_edge!(isize i8 i16 i32 i64 i128); in cast_int_to_128_edge_cases()
319 test_edge!(usize u8 u16 u32 u64 u128); in cast_int_to_128_edge_cases()
|
| /dports/devel/stylua/StyLua-0.11.0/cargo-crates/num-traits-0.2.14/tests/ |
| H A D | cast.rs | 254 fn test_edge() {
285 test_edge();
293 macro_rules! test_edge { in cast_int_to_int_edge_cases() macro
300 test_edge!(isize i8 i16 i32 i64); in cast_int_to_int_edge_cases()
301 test_edge!(usize u8 u16 u32 u64); in cast_int_to_int_edge_cases()
309 macro_rules! test_edge { in cast_int_to_128_edge_cases() macro
319 test_edge!(isize i8 i16 i32 i64 i128); in cast_int_to_128_edge_cases()
320 test_edge!(usize u8 u16 u32 u64 u128); in cast_int_to_128_edge_cases()
|
| /dports/multimedia/rav1e/rav1e-0.5.1/cargo-crates/num-traits-0.2.14/tests/ |
| H A D | cast.rs | 254 fn test_edge() {
285 test_edge();
293 macro_rules! test_edge { in cast_int_to_int_edge_cases() macro
300 test_edge!(isize i8 i16 i32 i64); in cast_int_to_int_edge_cases()
301 test_edge!(usize u8 u16 u32 u64); in cast_int_to_int_edge_cases()
309 macro_rules! test_edge { in cast_int_to_128_edge_cases() macro
319 test_edge!(isize i8 i16 i32 i64 i128); in cast_int_to_128_edge_cases()
320 test_edge!(usize u8 u16 u32 u64 u128); in cast_int_to_128_edge_cases()
|
| /dports/devel/interactive_rebase_tool/git-interactive-rebase-tool-1.2.1/cargo-crates/num-traits-0.2.6/tests/ |
| H A D | cast.rs | 253 fn test_edge() {
284 test_edge();
292 macro_rules! test_edge { in cast_int_to_int_edge_cases() macro
299 test_edge!(isize i8 i16 i32 i64); in cast_int_to_int_edge_cases()
300 test_edge!(usize u8 u16 u32 u64); in cast_int_to_int_edge_cases()
308 macro_rules! test_edge { in cast_int_to_128_edge_cases() macro
318 test_edge!(isize i8 i16 i32 i64 i128); in cast_int_to_128_edge_cases()
319 test_edge!(usize u8 u16 u32 u64 u128); in cast_int_to_128_edge_cases()
|
| /dports/misc/broot/broot-1.7.0/cargo-crates/num-traits-0.2.14/tests/ |
| H A D | cast.rs | 254 fn test_edge() {
285 test_edge();
293 macro_rules! test_edge { in cast_int_to_int_edge_cases() macro
300 test_edge!(isize i8 i16 i32 i64); in cast_int_to_int_edge_cases()
301 test_edge!(usize u8 u16 u32 u64); in cast_int_to_int_edge_cases()
309 macro_rules! test_edge { in cast_int_to_128_edge_cases() macro
319 test_edge!(isize i8 i16 i32 i64 i128); in cast_int_to_128_edge_cases()
320 test_edge!(usize u8 u16 u32 u64 u128); in cast_int_to_128_edge_cases()
|
| /dports/net/gemserv/gemserv-v0.4.5/cargo-crates/num-traits-0.2.14/tests/ |
| H A D | cast.rs | 254 fn test_edge() {
285 test_edge();
293 macro_rules! test_edge { in cast_int_to_int_edge_cases() macro
300 test_edge!(isize i8 i16 i32 i64); in cast_int_to_int_edge_cases()
301 test_edge!(usize u8 u16 u32 u64); in cast_int_to_int_edge_cases()
309 macro_rules! test_edge { in cast_int_to_128_edge_cases() macro
319 test_edge!(isize i8 i16 i32 i64 i128); in cast_int_to_128_edge_cases()
320 test_edge!(usize u8 u16 u32 u64 u128); in cast_int_to_128_edge_cases()
|
| /dports/devel/sccache/sccache-0.2.15/cargo-crates/num-traits-0.2.14/tests/ |
| H A D | cast.rs | 254 fn test_edge() {
285 test_edge();
293 macro_rules! test_edge { in cast_int_to_int_edge_cases() macro
300 test_edge!(isize i8 i16 i32 i64); in cast_int_to_int_edge_cases()
301 test_edge!(usize u8 u16 u32 u64); in cast_int_to_int_edge_cases()
309 macro_rules! test_edge { in cast_int_to_128_edge_cases() macro
319 test_edge!(isize i8 i16 i32 i64 i128); in cast_int_to_128_edge_cases()
320 test_edge!(usize u8 u16 u32 u64 u128); in cast_int_to_128_edge_cases()
|
| /dports/games/jaggedalliance2/ja2-stracciatella-0.18.0/cargo-crates/num-traits-0.2.12/tests/ |
| H A D | cast.rs | 253 fn test_edge() {
284 test_edge();
292 macro_rules! test_edge { in cast_int_to_int_edge_cases() macro
299 test_edge!(isize i8 i16 i32 i64); in cast_int_to_int_edge_cases()
300 test_edge!(usize u8 u16 u32 u64); in cast_int_to_int_edge_cases()
308 macro_rules! test_edge { in cast_int_to_128_edge_cases() macro
318 test_edge!(isize i8 i16 i32 i64 i128); in cast_int_to_128_edge_cases()
319 test_edge!(usize u8 u16 u32 u64 u128); in cast_int_to_128_edge_cases()
|
| /dports/multimedia/gstreamer1-plugins-rust/gst-plugins-rs-d0466b3eee114207f851b37cae0015c0e718f021/cargo-crates/num-traits-0.2.14/tests/ |
| H A D | cast.rs | 254 fn test_edge() {
285 test_edge();
293 macro_rules! test_edge { in cast_int_to_int_edge_cases() macro
300 test_edge!(isize i8 i16 i32 i64); in cast_int_to_int_edge_cases()
301 test_edge!(usize u8 u16 u32 u64); in cast_int_to_int_edge_cases()
309 macro_rules! test_edge { in cast_int_to_128_edge_cases() macro
319 test_edge!(isize i8 i16 i32 i64 i128); in cast_int_to_128_edge_cases()
320 test_edge!(usize u8 u16 u32 u64 u128); in cast_int_to_128_edge_cases()
|