| /dports/x11-toolkits/libdazzle/libdazzle-3.42.0/src/panel/ |
| H A D | dzl-dock-paned.c | 30 GtkPositionType child_edge; member
47 dzl_dock_stack_set_edge (DZL_DOCK_STACK (widget), priv->child_edge); in dzl_dock_paned_add()
76 priv->child_edge = GTK_POS_TOP; in dzl_dock_paned_init()
89 GtkPositionType child_edge = GPOINTER_TO_INT (user_data); in dzl_dock_paned_update_child_edge() local
94 dzl_dock_stack_set_edge (DZL_DOCK_STACK (widget), child_edge); in dzl_dock_paned_update_child_edge()
99 GtkPositionType child_edge) in dzl_dock_paned_set_child_edge() argument
105 if (priv->child_edge != child_edge) in dzl_dock_paned_set_child_edge()
107 priv->child_edge = child_edge; in dzl_dock_paned_set_child_edge()
111 GINT_TO_POINTER (child_edge)); in dzl_dock_paned_set_child_edge()
|
| H A D | dzl-dock-paned-private.h | 31 GtkPositionType child_edge);
|
| /dports/science/py-dlib/dlib-19.22/dlib/test/ |
| H A D | directed_graph.cpp | 242 DLIB_TEST_MSG(b.node(0).child_edge(0) == b.node(0).child(0).index()+1, in directed_graph_test()
243 b.node(0).child_edge(0) << " " << b.node(0).child(0).index()+1); in directed_graph_test()
244 DLIB_TEST_MSG(b.node(1).child_edge(0) == b.node(1).child(0).index()+1, in directed_graph_test()
245 b.node(1).child_edge(0) << " " << b.node(1).child(0).index()+1); in directed_graph_test()
246 DLIB_TEST_MSG(b.node(2).child_edge(0) == b.node(2).child(0).index()+1, in directed_graph_test()
247 b.node(2).child_edge(0) << " " << b.node(2).child(0).index()+1); in directed_graph_test()
277 DLIB_TEST_MSG(a.node(0).child_edge(0) == a.node(0).child(0).index()+1, in directed_graph_test()
278 a.node(0).child_edge(0) << " " << a.node(0).child(0).index()+1); in directed_graph_test()
279 DLIB_TEST_MSG(a.node(1).child_edge(0) == a.node(1).child(0).index()+1, in directed_graph_test()
280 a.node(1).child_edge(0) << " " << a.node(1).child(0).index()+1); in directed_graph_test()
[all …]
|
| H A D | graph_cuts.cpp | 569 … dlog << LTRACE << i << " -(" << g.node(i).child_edge(n) << ")-> " << g.node(i).child(n).index(); in print_graph()
583 dest.node(i).child_edge(n) = src.node(i).child_edge(n); in copy_edge_weights()
770 DLIB_TEST_MSG(g1.node(i).child_edge(j) == 0, g1.node(i).child_edge(j)); in run_test_on_graphs()
|
| /dports/science/dlib-cpp/dlib-19.22/dlib/test/ |
| H A D | directed_graph.cpp | 242 DLIB_TEST_MSG(b.node(0).child_edge(0) == b.node(0).child(0).index()+1, in directed_graph_test()
243 b.node(0).child_edge(0) << " " << b.node(0).child(0).index()+1); in directed_graph_test()
244 DLIB_TEST_MSG(b.node(1).child_edge(0) == b.node(1).child(0).index()+1, in directed_graph_test()
245 b.node(1).child_edge(0) << " " << b.node(1).child(0).index()+1); in directed_graph_test()
246 DLIB_TEST_MSG(b.node(2).child_edge(0) == b.node(2).child(0).index()+1, in directed_graph_test()
247 b.node(2).child_edge(0) << " " << b.node(2).child(0).index()+1); in directed_graph_test()
277 DLIB_TEST_MSG(a.node(0).child_edge(0) == a.node(0).child(0).index()+1, in directed_graph_test()
278 a.node(0).child_edge(0) << " " << a.node(0).child(0).index()+1); in directed_graph_test()
279 DLIB_TEST_MSG(a.node(1).child_edge(0) == a.node(1).child(0).index()+1, in directed_graph_test()
280 a.node(1).child_edge(0) << " " << a.node(1).child(0).index()+1); in directed_graph_test()
[all …]
|
| H A D | graph_cuts.cpp | 569 … dlog << LTRACE << i << " -(" << g.node(i).child_edge(n) << ")-> " << g.node(i).child(n).index(); in print_graph()
583 dest.node(i).child_edge(n) = src.node(i).child_edge(n); in copy_edge_weights()
770 DLIB_TEST_MSG(g1.node(i).child_edge(j) == 0, g1.node(i).child_edge(j)); in run_test_on_graphs()
|
| /dports/science/py-dlib/dlib-19.22/dlib/directed_graph/ |
| H A D | directed_graph_kernel_abstract.h | 204 const E& child_edge (
215 E& child_edge (
|
| H A D | directed_graph_kernel_1.h | 350 const E& child_edge (
354 E& child_edge (
429 serialize(item.node(i).child_edge(c), out);
481 deserialize(item.node(i).child_edge(j), in);
|
| /dports/science/dlib-cpp/dlib-19.22/dlib/directed_graph/ |
| H A D | directed_graph_kernel_abstract.h | 204 const E& child_edge (
215 E& child_edge (
|
| H A D | directed_graph_kernel_1.h | 350 const E& child_edge (
354 E& child_edge (
429 serialize(item.node(i).child_edge(c), out);
481 deserialize(item.node(i).child_edge(j), in);
|
| /dports/dns/unbound/unbound-1.14.0/edns-subnet/ |
| H A D | addrtree.c | 215 struct addredge *parent_edge, *child_edge = NULL; in purge_node() local
224 child_edge = node->edge[!node->edge[0]]; in purge_node()
225 if (child_edge) { in purge_node()
226 child_edge->parent_node = parent_edge->parent_node; in purge_node()
227 child_edge->parent_index = index; in purge_node()
229 parent_edge->parent_node->edge[index] = child_edge; in purge_node()
|
| /dports/devel/boost-docs/boost_1_72_0/libs/graph/test/ |
| H A D | incremental_components_test.cpp | 100 BOOST_FOREACH(edge_descriptor child_edge, in test_graph()
103 if (component_vertices.count(target(child_edge, graph)) > 0) { in test_graph()
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/graph/test/ |
| H A D | incremental_components_test.cpp | 100 BOOST_FOREACH(edge_descriptor child_edge, in test_graph()
103 if (component_vertices.count(target(child_edge, graph)) > 0) { in test_graph()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/test/ |
| H A D | incremental_components_test.cpp | 100 BOOST_FOREACH(edge_descriptor child_edge, in test_graph()
103 if (component_vertices.count(target(child_edge, graph)) > 0) { in test_graph()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/test/ |
| H A D | incremental_components_test.cpp | 100 BOOST_FOREACH(edge_descriptor child_edge, in test_graph()
103 if (component_vertices.count(target(child_edge, graph)) > 0) { in test_graph()
|
| /dports/databases/percona57-server/boost_1_59_0/libs/graph/test/ |
| H A D | incremental_components_test.cpp | 100 BOOST_FOREACH(edge_descriptor child_edge, in test_graph()
103 if (component_vertices.count(target(child_edge, graph)) > 0) { in test_graph()
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/graph/test/ |
| H A D | incremental_components_test.cpp | 100 BOOST_FOREACH(edge_descriptor child_edge, in test_graph()
103 if (component_vertices.count(target(child_edge, graph)) > 0) { in test_graph()
|
| /dports/databases/percona57-client/boost_1_59_0/libs/graph/test/ |
| H A D | incremental_components_test.cpp | 100 BOOST_FOREACH(edge_descriptor child_edge, in test_graph()
103 if (component_vertices.count(target(child_edge, graph)) > 0) { in test_graph()
|
| /dports/devel/boost-libs/boost_1_72_0/libs/graph/test/ |
| H A D | incremental_components_test.cpp | 100 BOOST_FOREACH(edge_descriptor child_edge, in test_graph()
103 if (component_vertices.count(target(child_edge, graph)) > 0) { in test_graph()
|
| /dports/devel/hyperscan/boost_1_75_0/libs/graph/test/ |
| H A D | incremental_components_test.cpp | 109 edge_descriptor child_edge, out_edges(child_vertex, graph)) in test_graph()
112 if (component_vertices.count(target(child_edge, graph)) > 0) in test_graph()
|
| /dports/mail/thunderbird/thunderbird-91.8.0/third_party/rust/rose_tree/src/ |
| H A D | lib.rs | 186 while let Some((child_edge, child_node)) = children.next(&self.graph) { in remove_node()
187 self.graph.remove_edge(child_edge); in remove_node()
|
| /dports/www/firefox-esr/firefox-91.8.0/third_party/rust/rose_tree/src/ |
| H A D | lib.rs | 186 while let Some((child_edge, child_node)) = children.next(&self.graph) { in remove_node()
187 self.graph.remove_edge(child_edge); in remove_node()
|
| /dports/science/py-dlib/dlib-19.22/dlib/graph_cuts/ |
| H A D | general_flow_graph.h | 131 return g.node(it.idx).child_edge(it.cnt); in get_flow()
|
| /dports/science/dlib-cpp/dlib-19.22/dlib/graph_cuts/ |
| H A D | general_flow_graph.h | 131 return g.node(it.idx).child_edge(it.cnt); in get_flow()
|
| /dports/science/py-dlib/dlib-19.22/dlib/graph_utils/ |
| H A D | graph_utils.h | 103 return g.node(parent_idx).child_edge(i); in edge()
134 return g.node(parent_idx).child_edge(i); in edge()
410 dest.node(i).child_edge(j) = src.node(i).child_edge(j); in copy_graph()
|