/dports/dns/unbound/unbound-1.14.0/edns-subnet/ |
H A D | addrtree.c | 75 node->parent_edge = edge; in edge_create() 102 node->parent_edge = NULL; in node_create() 116 return sizeof *n + sizeof *n->parent_edge + n->parent_edge->len + in node_size() 220 parent_edge = node->parent_edge; in purge_node() 221 if (keep || !parent_edge) return; in purge_node() 223 index = parent_edge->parent_index; in purge_node() 231 free(parent_edge->str); in purge_node() 232 free(parent_edge); in purge_node() 257 p = n->parent_edge->parent_node; in lru_cleanup() 286 free(n->parent_edge->str); in addrtree_delete() [all …]
|
H A D | addrtree.h | 101 struct addredge *parent_edge; member
|
/dports/math/polymake/polymake-4.5/apps/polytope/src/ |
H A D | edge_orientable.cc | 43 Int parent_edge; in edge_middle() 49 , parent_edge(arg_parent_edge) {} in edge_middle() 59 Array<Int> parent_edge; in edge_middle() 74 parent_edge (m, -1) in edge_middle() 149 … (e.head == HD.face(e.id+first_edge_in_HD).front()) ? LEFT : RIGHT, e.parent_edge); in edge_middle() 181 process_parent_edges(e, parent_edge[e], std::back_inserter(moebius_strip)); in edge_middle() 197 parent_edge[e] = p; in edge_middle() 225 for (; p != -1; p = parent_edge[p]) { in edge_middle()
|
/dports/science/py-dlib/dlib-19.22/dlib/test/ |
H A D | directed_graph.cpp | 249 DLIB_TEST_MSG(b.node(2).parent_edge(0) == 2+1, in directed_graph_test() 250 b.node(2).parent_edge(0) << " " << 2+1); in directed_graph_test() 251 DLIB_TEST_MSG(b.node(3).parent_edge(0) == 3+1, in directed_graph_test() 252 b.node(3).parent_edge(0) << " " << 3+1); in directed_graph_test() 253 DLIB_TEST_MSG(b.node(3).parent_edge(1) == 3+1, in directed_graph_test() 254 b.node(3).parent_edge(1) << " " << 3+1); in directed_graph_test() 283 DLIB_TEST_MSG(a.node(2).parent_edge(0) == 2+1, in directed_graph_test() 284 a.node(2).parent_edge(0) << " " << 2+1); in directed_graph_test() 285 DLIB_TEST_MSG(a.node(3).parent_edge(0) == 3+1, in directed_graph_test() 286 a.node(3).parent_edge(0) << " " << 3+1); in directed_graph_test() [all …]
|
/dports/science/dlib-cpp/dlib-19.22/dlib/test/ |
H A D | directed_graph.cpp | 249 DLIB_TEST_MSG(b.node(2).parent_edge(0) == 2+1, in directed_graph_test() 250 b.node(2).parent_edge(0) << " " << 2+1); in directed_graph_test() 251 DLIB_TEST_MSG(b.node(3).parent_edge(0) == 3+1, in directed_graph_test() 252 b.node(3).parent_edge(0) << " " << 3+1); in directed_graph_test() 253 DLIB_TEST_MSG(b.node(3).parent_edge(1) == 3+1, in directed_graph_test() 254 b.node(3).parent_edge(1) << " " << 3+1); in directed_graph_test() 283 DLIB_TEST_MSG(a.node(2).parent_edge(0) == 2+1, in directed_graph_test() 284 a.node(2).parent_edge(0) << " " << 2+1); in directed_graph_test() 285 DLIB_TEST_MSG(a.node(3).parent_edge(0) == 3+1, in directed_graph_test() 286 a.node(3).parent_edge(0) << " " << 3+1); in directed_graph_test() [all …]
|
/dports/dns/unbound/unbound-1.14.0/testcode/ |
H A D | unitecs.c | 95 struct addredge* parent_edge, addrlen_t depth) in addrtree_inconsistent_subtree() argument 98 struct addrnode* node = parent_edge->node; in addrtree_inconsistent_subtree() 109 if (edge->len <= parent_edge->len) return 13; in addrtree_inconsistent_subtree() 110 if (!unittest_wrapper_addrtree_issub(parent_edge->str, in addrtree_inconsistent_subtree() 111 parent_edge->len, edge->str, edge->len, 0)) in addrtree_inconsistent_subtree()
|
/dports/lang/rust/rustc-1.58.1-src/library/alloc/src/collections/btree/ |
H A D | navigate.rs | 376 Ok(parent_edge) => parent_edge.forget_node_type(), in next_kv() 397 Ok(parent_edge) => parent_edge.forget_node_type(), in next_back_kv() 422 Ok(parent_edge) => parent_edge, in next_kv() 453 Some(parent_edge) => parent_edge.forget_node_type(), in deallocating_next() 482 Some(parent_edge) => parent_edge.forget_node_type(), in deallocating_next_back() 497 while let Some(parent_edge) = unsafe { edge.into_node().deallocate_and_ascend() } { in deallocating_end() 498 edge = parent_edge.forget_node_type(); in deallocating_end()
|
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/ |
H A D | planarity.py | 245 self.parent_edge = defaultdict(lambda: None) 338 self.parent_edge = None 404 e = self.parent_edge[v] 419 self.parent_edge[w] = vw 448 e = self.parent_edge[v] 458 self.parent_edge[w] = vw 490 e = self.parent_edge[v] 530 e = self.parent_edge[v] 534 if ei == self.parent_edge[w]: # tree edge 652 if ei == self.parent_edge[w]: # tree edge [all …]
|
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/flow/ |
H A D | networksimplex.py | 55 self.parent_edge = None # edges to parents 73 self.parent_edge = list( 115 We.append(self.parent_edge[p]) 169 self.parent_edge[t] = None 201 self.parent_edge[p] = self.parent_edge[q] 202 self.parent_edge[q] = None 231 self.parent_edge[q] = i
|
/dports/science/py-dlib/dlib-19.22/dlib/directed_graph/ |
H A D | directed_graph_kernel_abstract.h | 182 const E& parent_edge ( 193 E& parent_edge (
|
H A D | directed_graph_kernel_1.h | 342 const E& parent_edge ( 346 E& parent_edge (
|
/dports/science/dlib-cpp/dlib-19.22/dlib/directed_graph/ |
H A D | directed_graph_kernel_abstract.h | 182 const E& parent_edge ( 193 E& parent_edge (
|
H A D | directed_graph_kernel_1.h | 342 const E& parent_edge ( 346 E& parent_edge (
|
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/MATCH/ |
H A D | match.c | 125 int parent_edge; member 669 n->parent_edge = -1; 760 n->parent_edge = -1; 916 newnode->parent_edge = node_k->parent_edge; 1147 y->parent_edge = oldnode->parent_edge; 1234 n->parent_edge = -1; 1259 oldnode->parent_edge = -1; 1380 edgelist[n->parent_edge].x = 1 - edgelist[n->parent_edge].x; 1496 node_j->parent_edge = IEDGE(e); 2943 newnode->parent_edge = -1; [all …]
|
/dports/emulators/qemu-utils/qemu-4.2.1/tests/libqos/ |
H A D | qgraph.c | 53 QOSGraphEdge *parent_edge; member 338 .parent_edge = e, in qos_push() 375 el->parent->node->path_edge = el->parent_edge; in qos_reverse_path()
|
/dports/emulators/qemu5/qemu-5.2.0/tests/qtest/libqos/ |
H A D | qgraph.c | 53 QOSGraphEdge *parent_edge; member 338 .parent_edge = e, in qos_push() 375 el->parent->node->path_edge = el->parent_edge; in qos_reverse_path()
|
/dports/emulators/qemu-guest-agent/qemu-5.0.1/tests/qtest/libqos/ |
H A D | qgraph.c | 53 QOSGraphEdge *parent_edge; member 338 .parent_edge = e, in qos_push() 375 el->parent->node->path_edge = el->parent_edge; in qos_reverse_path()
|
/dports/emulators/qemu42/qemu-4.2.1/tests/libqos/ |
H A D | qgraph.c | 53 QOSGraphEdge *parent_edge; member 338 .parent_edge = e, in qos_push() 375 el->parent->node->path_edge = el->parent_edge; in qos_reverse_path()
|
/dports/emulators/qemu-cheri/qemu-0a323821042c36e21ea80e58b9545dfc3b0cb8ef/tests/qtest/libqos/ |
H A D | qgraph.c | 53 QOSGraphEdge *parent_edge; member 338 .parent_edge = e, in qos_push() 375 el->parent->node->path_edge = el->parent_edge; in qos_reverse_path()
|
/dports/games/fs2open/fs2open.github.com-release_21_4_1/lib/libRocket/Source/Core/ |
H A D | LayoutBlockBoxSpace.cpp | 130 float parent_edge = parent->GetBox().GetSize().x + parent_origin - parent_scrollbar_width; in PositionBox() local 187 …float maximum_box_width = box_edge == LEFT ? parent_edge - box_position.x : box_position.x + dimen… in PositionBox()
|
/dports/emulators/qemu-devel/qemu-de8ed1055c2ce18c95f597eb10df360dcb534f99/tests/qtest/libqos/ |
H A D | qgraph.c | 53 QOSGraphEdge *parent_edge; member 340 .parent_edge = e, in qos_push() 377 el->parent->node->path_edge = el->parent_edge; in qos_reverse_path()
|
/dports/emulators/qemu/qemu-6.2.0/tests/qtest/libqos/ |
H A D | qgraph.c | 53 QOSGraphEdge *parent_edge; member 340 .parent_edge = e, in qos_push() 377 el->parent->node->path_edge = el->parent_edge; in qos_reverse_path()
|
/dports/emulators/qemu60/qemu-6.0.0/tests/qtest/libqos/ |
H A D | qgraph.c | 53 QOSGraphEdge *parent_edge; member 340 .parent_edge = e, in qos_push() 377 el->parent->node->path_edge = el->parent_edge; in qos_reverse_path()
|
/dports/science/py-dlib/dlib-19.22/dlib/graph_cuts/ |
H A D | general_flow_graph.h | 135 return g.node(it.idx).parent_edge(it.cnt); in get_flow()
|
/dports/science/dlib-cpp/dlib-19.22/dlib/graph_cuts/ |
H A D | general_flow_graph.h | 135 return g.node(it.idx).parent_edge(it.cnt); in get_flow()
|