/dports/lang/erlang-runtime24/otp-OTP-24.1.7/lib/compiler/src/ |
H A D | beam_digraph.erl | 31 del_edge/2, del_edges/2, 115 -spec del_edges(graph(), [edge()]) -> graph(). 116 del_edges(G, Es) when is_list(Es) -> function
|
/dports/lang/erlang-runtime23/otp-OTP-23.3.4.10/lib/compiler/src/ |
H A D | beam_digraph.erl | 31 del_edge/2, del_edges/2, 115 -spec del_edges(graph(), [edge()]) -> graph(). 116 del_edges(G, Es) when is_list(Es) -> function
|
/dports/lang/erlang-wx/otp-OTP-24.1.7/lib/compiler/src/ |
H A D | beam_digraph.erl | 31 del_edge/2, del_edges/2, 115 -spec del_edges(graph(), [edge()]) -> graph(). 116 del_edges(G, Es) when is_list(Es) -> function
|
/dports/lang/erlang/otp-OTP-24.1.7/lib/compiler/src/ |
H A D | beam_digraph.erl | 31 del_edge/2, del_edges/2, 115 -spec del_edges(graph(), [edge()]) -> graph(). 116 del_edges(G, Es) when is_list(Es) -> function
|
/dports/lang/erlang-java/otp-OTP-24.1.7/lib/compiler/src/ |
H A D | beam_digraph.erl | 31 del_edge/2, del_edges/2, 115 -spec del_edges(graph(), [edge()]) -> graph(). 116 del_edges(G, Es) when is_list(Es) -> function
|
/dports/lang/yap/yap-6.2.2/library/ |
H A D | wgraphs.yap | 19 wdgraph_del_edges/3 as del_edges,
|
H A D | undgraphs.yap | 146 rb_partial_map(Vs0, TrueBackEdges, del_edges(SortedVs), Vsf). 148 del_edges(ToRemove,E0,E) :-
|
H A D | dgraphs.yap | 184 rb_apply(Vs0, V, del_edges(Children), Vs). 186 del_edges(ToRemove,E0,E) :- 209 rb_map(Vs0, del_edges(SortedVs), Vsf).
|
/dports/devel/pijul/pijul-1.0.0.a55/cargo-crates/libpijul-1.0.0-alpha.49/src/unrecord/ |
H A D | mod.rs | 233 del_edges: Vec<(Vertex<ChangeId>, SerializedEdge)>, field 507 debug!("remove_zombies = {:#?}", ws.del_edges); in remove_zombies() 508 for (v, mut e) in ws.del_edges.drain(..) { in remove_zombies() 548 ws.del_edges.push((v, *e)) in collect_zombies()
|
/dports/lang/swi-pl/swipl-8.2.3/library/ |
H A D | ugraphs.pl | 41 del_edges/3, % +Graph, +Edges, -NewGraph
|
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/concorde97/LINKERN/ |
H A D | linkern.c | 174 #define markedge_del(n1, n2) del_edges[n1 ^ n2] = 1 176 #define unmarkedge_del(n1, n2) del_edges[n1 ^ n2] = 0 178 #define is_it_deleted(n1, n2) del_edges[n1 ^ n2] 343 static char *del_edges = (char *) NULL; variable 546 CC_IFFREE (del_edges, char); 2683 del_edges = CC_SAFE_MALLOC (M, char); 2684 if (!del_edges) { 2690 del_edges[i] = 0; 2696 CC_FREE (del_edges, char); 2702 CC_FREE (del_edges, char);
|
/dports/lang/swi-pl/swipl-8.2.3/man/lib/ |
H A D | ugraphs.doc | 104 \predicate{del_edges}{3}{+Graph, +Edges, -NewGraph} 109 ?- del_edges([1-[3,5],2-[4],3-[],4-[5],5-[],6-[],7-[],8-[]],
|
/dports/math/concorde/concorde/LINKERN/ |
H A D | linkern_fixed.c | 88 #define markedge_del(n1, n2, E) E->del_edges[n1 ^ n2] = 1 90 #define unmarkedge_del(n1, n2, E) E->del_edges[n1 ^ n2] = 0 92 #define is_it_deleted(n1, n2, E) E->del_edges[n1 ^ n2] 149 char *del_edges; member 1624 E->del_edges = (char *) NULL; 1631 CC_IFFREE (E->del_edges, char); 1646 E->del_edges = CC_SAFE_MALLOC (M, char); 1647 if (E->add_edges == (char *) NULL || E->del_edges == (char *) NULL) { 1653 E->del_edges[i] = 0;
|
H A D | linkern_path.c | 91 #define markedge_del(n1, n2, E) E->del_edges[n1 ^ n2] = 1 93 #define unmarkedge_del(n1, n2, E) E->del_edges[n1 ^ n2] = 0 95 #define is_it_deleted(n1, n2, E) E->del_edges[n1 ^ n2] 154 char *del_edges; member 1676 E->del_edges = (char *) NULL; 1683 CC_IFFREE (E->del_edges, char); 1698 E->del_edges = CC_SAFE_MALLOC (M, char); 1699 if (E->add_edges == (char *) NULL || E->del_edges == (char *) NULL) { 1705 E->del_edges[i] = 0;
|
/dports/lang/erlang-runtime22/otp-OTP-22.3.4.24/lib/dialyzer/test/opaque_SUITE_data/src/modules/ |
H A D | opaque_digraph.erl | 34 -export([del_edge/2, del_edges/2, del_path/3]). 301 -spec del_edges(G, Edges) -> 'true' when 305 del_edges(G, Es) -> function
|
/dports/lang/erlang-runtime23/otp-OTP-23.3.4.10/lib/dialyzer/test/opaque_SUITE_data/src/modules/ |
H A D | opaque_digraph.erl | 34 -export([del_edge/2, del_edges/2, del_path/3]). 301 -spec del_edges(G, Edges) -> 'true' when 305 del_edges(G, Es) -> function
|
/dports/lang/erlang-runtime23/otp-OTP-23.3.4.10/lib/stdlib/src/ |
H A D | digraph.erl | 30 -export([del_edge/2, del_edges/2, del_path/3]). 294 -spec del_edges(G, Edges) -> 'true' when 298 del_edges(G, Es) -> function
|
/dports/lang/erlang-runtime24/otp-OTP-24.1.7/lib/dialyzer/test/opaque_SUITE_data/src/modules/ |
H A D | opaque_digraph.erl | 34 -export([del_edge/2, del_edges/2, del_path/3]). 301 -spec del_edges(G, Edges) -> 'true' when 305 del_edges(G, Es) -> function
|
/dports/lang/erlang-runtime22/otp-OTP-22.3.4.24/lib/stdlib/src/ |
H A D | digraph.erl | 30 -export([del_edge/2, del_edges/2, del_path/3]). 294 -spec del_edges(G, Edges) -> 'true' when 298 del_edges(G, Es) -> function
|
/dports/lang/erlang-runtime21/otp-OTP-21.3.8.24/lib/stdlib/src/ |
H A D | digraph.erl | 30 -export([del_edge/2, del_edges/2, del_path/3]). 294 -spec del_edges(G, Edges) -> 'true' when 298 del_edges(G, Es) -> function
|
/dports/lang/erlang-wx/otp-OTP-24.1.7/lib/stdlib/src/ |
H A D | digraph.erl | 30 -export([del_edge/2, del_edges/2, del_path/3]). 294 -spec del_edges(G, Edges) -> 'true' when 298 del_edges(G, Es) -> function
|
/dports/lang/erlang-runtime24/otp-OTP-24.1.7/lib/stdlib/src/ |
H A D | digraph.erl | 30 -export([del_edge/2, del_edges/2, del_path/3]). 294 -spec del_edges(G, Edges) -> 'true' when 298 del_edges(G, Es) -> function
|
/dports/lang/erlang-wx/otp-OTP-24.1.7/lib/dialyzer/test/opaque_SUITE_data/src/modules/ |
H A D | opaque_digraph.erl | 34 -export([del_edge/2, del_edges/2, del_path/3]). 301 -spec del_edges(G, Edges) -> 'true' when 305 del_edges(G, Es) -> function
|
/dports/lang/erlang/otp-OTP-24.1.7/lib/dialyzer/test/opaque_SUITE_data/src/modules/ |
H A D | opaque_digraph.erl | 34 -export([del_edge/2, del_edges/2, del_path/3]). 301 -spec del_edges(G, Edges) -> 'true' when 305 del_edges(G, Es) -> function
|
/dports/lang/erlang/otp-OTP-24.1.7/lib/stdlib/src/ |
H A D | digraph.erl | 30 -export([del_edge/2, del_edges/2, del_path/3]). 294 -spec del_edges(G, Edges) -> 'true' when 298 del_edges(G, Es) -> function
|