| /dports/math/libmesh/libmesh-1.6.2/src/mesh/ |
| H A D | mesh_refinement_smoothing.C | 180 std::pair<unsigned int, unsigned int> edge_key = in limit_level_mismatch_at_edge() local
183 if (max_level_at_edge.find(edge_key) == in limit_level_mismatch_at_edge()
186 max_level_at_edge[edge_key] = elem_level; in limit_level_mismatch_at_edge()
187 max_p_level_at_edge[edge_key] = elem_p_level; in limit_level_mismatch_at_edge()
191 max_level_at_edge[edge_key] = in limit_level_mismatch_at_edge()
192 std::max (max_level_at_edge[edge_key], elem_level); in limit_level_mismatch_at_edge()
193 max_p_level_at_edge[edge_key] = in limit_level_mismatch_at_edge()
194 std::max (max_p_level_at_edge[edge_key], elem_p_level); in limit_level_mismatch_at_edge()
223 std::pair<dof_id_type, dof_id_type> edge_key = in limit_level_mismatch_at_edge() local
228 if ((elem_level + max_mismatch) < max_level_at_edge[edge_key] in limit_level_mismatch_at_edge()
[all …]
|
| /dports/math/py-networkx/networkx-2.6.3/networkx/ |
| H A D | convert_matrix.py | 218 edge_key=None, argument
297 if G.is_multigraph() and edge_key is not None:
298 if edge_key in all_attrs:
301 edgelistdict = {source: source_nodes, target: target_nodes, edge_key: edge_keys}
315 edge_key=None, argument
448 if edge_key is not None:
450 multigraph_edge_keys = df[edge_key]
457 if edge_key is not None:
|
| /dports/devel/rust-analyzer/rust-analyzer-2021-12-20/cargo-crates/petgraph-0.5.1/src/ |
| H A D | graphmap.rs | 124 fn edge_key(a: N, b: N) -> (N, N) { in edge_key() function
198 self.edges.swap_remove(&Self::edge_key(n, succ)); in remove_node()
230 if let old @ Some(_) = self.edges.insert(Self::edge_key(a, b), weight) { in add_edge()
302 let weight = self.edges.remove(&Self::edge_key(a, b)); in remove_edge()
309 self.edges.contains_key(&Self::edge_key(a, b)) in contains_edge()
379 self.edges.get(&Self::edge_key(a, b)) in edge_weight()
385 self.edges.get_mut(&Self::edge_key(a, b)) in edge_weight_mut()
596 match self.edges.get(&GraphMap::<N, E, Ty>::edge_key(a, b)) { in next()
747 let index = Self::edge_key(index.0, index.1); in index()
760 let index = Self::edge_key(index.0, index.1); in index_mut()
|
| /dports/net-im/libsignal-client/libsignal-client-0.9.6/cargo-crates/petgraph-0.5.1/src/ |
| H A D | graphmap.rs | 124 fn edge_key(a: N, b: N) -> (N, N) { in edge_key() function
198 self.edges.swap_remove(&Self::edge_key(n, succ)); in remove_node()
230 if let old @ Some(_) = self.edges.insert(Self::edge_key(a, b), weight) { in add_edge()
302 let weight = self.edges.remove(&Self::edge_key(a, b)); in remove_edge()
309 self.edges.contains_key(&Self::edge_key(a, b)) in contains_edge()
379 self.edges.get(&Self::edge_key(a, b)) in edge_weight()
385 self.edges.get_mut(&Self::edge_key(a, b)) in edge_weight_mut()
596 match self.edges.get(&GraphMap::<N, E, Ty>::edge_key(a, b)) { in next()
747 let index = Self::edge_key(index.0, index.1); in index()
760 let index = Self::edge_key(index.0, index.1); in index_mut()
|
| /dports/sysutils/vector/vector-0.10.0/cargo-crates/petgraph-0.5.1/src/ |
| H A D | graphmap.rs | 124 fn edge_key(a: N, b: N) -> (N, N) { in edge_key() function
198 self.edges.swap_remove(&Self::edge_key(n, succ)); in remove_node()
230 if let old @ Some(_) = self.edges.insert(Self::edge_key(a, b), weight) { in add_edge()
302 let weight = self.edges.remove(&Self::edge_key(a, b)); in remove_edge()
309 self.edges.contains_key(&Self::edge_key(a, b)) in contains_edge()
379 self.edges.get(&Self::edge_key(a, b)) in edge_weight()
385 self.edges.get_mut(&Self::edge_key(a, b)) in edge_weight_mut()
596 match self.edges.get(&GraphMap::<N, E, Ty>::edge_key(a, b)) { in next()
747 let index = Self::edge_key(index.0, index.1); in index()
760 let index = Self::edge_key(index.0, index.1); in index_mut()
|
| /dports/textproc/ripgrep-all/ripgrep-all-0.9.6/cargo-crates/petgraph-0.4.13/src/ |
| H A D | graphmap.rs | 137 fn edge_key(a: N, b: N) -> (N, N) { in edge_key() function
208 self.edges.swap_remove(&Self::edge_key(n, succ)); in remove_node()
240 if let old @ Some(_) = self.edges.insert(Self::edge_key(a, b), weight) { in add_edge()
299 let weight = self.edges.remove(&Self::edge_key(a, b)); in remove_edge()
306 self.edges.contains_key(&Self::edge_key(a, b)) in contains_edge()
375 self.edges.get(&Self::edge_key(a, b)) in edge_weight()
381 self.edges.get_mut(&Self::edge_key(a, b)) in edge_weight_mut()
576 match self.edges.get(&GraphMap::<N, E, Ty>::edge_key(a, b)) { in next()
701 let index = Self::edge_key(index.0, index.1); in index()
712 let index = Self::edge_key(index.0, index.1); in index_mut()
|
| /dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/petgraph-0.4.13/src/ |
| H A D | graphmap.rs | 137 fn edge_key(a: N, b: N) -> (N, N) { in edge_key() function
208 self.edges.swap_remove(&Self::edge_key(n, succ)); in remove_node()
240 if let old @ Some(_) = self.edges.insert(Self::edge_key(a, b), weight) { in add_edge()
299 let weight = self.edges.remove(&Self::edge_key(a, b)); in remove_edge()
306 self.edges.contains_key(&Self::edge_key(a, b)) in contains_edge()
375 self.edges.get(&Self::edge_key(a, b)) in edge_weight()
381 self.edges.get_mut(&Self::edge_key(a, b)) in edge_weight_mut()
576 match self.edges.get(&GraphMap::<N, E, Ty>::edge_key(a, b)) { in next()
701 let index = Self::edge_key(index.0, index.1); in index()
712 let index = Self::edge_key(index.0, index.1); in index_mut()
|
| /dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/petgraph-0.5.0/src/ |
| H A D | graphmap.rs | 124 fn edge_key(a: N, b: N) -> (N, N) { in edge_key() function
196 self.edges.swap_remove(&Self::edge_key(n, succ)); in remove_node()
228 if let old @ Some(_) = self.edges.insert(Self::edge_key(a, b), weight) { in add_edge()
300 let weight = self.edges.remove(&Self::edge_key(a, b)); in remove_edge()
307 self.edges.contains_key(&Self::edge_key(a, b)) in contains_edge()
377 self.edges.get(&Self::edge_key(a, b)) in edge_weight()
383 self.edges.get_mut(&Self::edge_key(a, b)) in edge_weight_mut()
594 match self.edges.get(&GraphMap::<N, E, Ty>::edge_key(a, b)) { in next()
745 let index = Self::edge_key(index.0, index.1); in index()
758 let index = Self::edge_key(index.0, index.1); in index_mut()
|
| /dports/mail/thunderbird/thunderbird-91.8.0/third_party/rust/petgraph/src/ |
| H A D | graphmap.rs | 124 fn edge_key(a: N, b: N) -> (N, N) { in edge_key() function
198 self.edges.swap_remove(&Self::edge_key(n, succ)); in remove_node()
230 if let old @ Some(_) = self.edges.insert(Self::edge_key(a, b), weight) { in add_edge()
302 let weight = self.edges.remove(&Self::edge_key(a, b)); in remove_edge()
309 self.edges.contains_key(&Self::edge_key(a, b)) in contains_edge()
379 self.edges.get(&Self::edge_key(a, b)) in edge_weight()
385 self.edges.get_mut(&Self::edge_key(a, b)) in edge_weight_mut()
596 match self.edges.get(&GraphMap::<N, E, Ty>::edge_key(a, b)) { in next()
747 let index = Self::edge_key(index.0, index.1); in index()
760 let index = Self::edge_key(index.0, index.1); in index_mut()
|
| /dports/net/krill/krill-0.9.4/cargo-crates/petgraph-0.5.1/src/ |
| H A D | graphmap.rs | 124 fn edge_key(a: N, b: N) -> (N, N) { in edge_key() function
198 self.edges.swap_remove(&Self::edge_key(n, succ)); in remove_node()
230 if let old @ Some(_) = self.edges.insert(Self::edge_key(a, b), weight) { in add_edge()
302 let weight = self.edges.remove(&Self::edge_key(a, b)); in remove_edge()
309 self.edges.contains_key(&Self::edge_key(a, b)) in contains_edge()
379 self.edges.get(&Self::edge_key(a, b)) in edge_weight()
385 self.edges.get_mut(&Self::edge_key(a, b)) in edge_weight_mut()
596 match self.edges.get(&GraphMap::<N, E, Ty>::edge_key(a, b)) { in next()
747 let index = Self::edge_key(index.0, index.1); in index()
760 let index = Self::edge_key(index.0, index.1); in index_mut()
|
| /dports/devel/texlab/texlab-3.3.0/cargo-crates/petgraph-0.5.1/src/ |
| H A D | graphmap.rs | 124 fn edge_key(a: N, b: N) -> (N, N) { in edge_key() function
198 self.edges.swap_remove(&Self::edge_key(n, succ)); in remove_node()
230 if let old @ Some(_) = self.edges.insert(Self::edge_key(a, b), weight) { in add_edge()
302 let weight = self.edges.remove(&Self::edge_key(a, b)); in remove_edge()
309 self.edges.contains_key(&Self::edge_key(a, b)) in contains_edge()
379 self.edges.get(&Self::edge_key(a, b)) in edge_weight()
385 self.edges.get_mut(&Self::edge_key(a, b)) in edge_weight_mut()
596 match self.edges.get(&GraphMap::<N, E, Ty>::edge_key(a, b)) { in next()
747 let index = Self::edge_key(index.0, index.1); in index()
760 let index = Self::edge_key(index.0, index.1); in index_mut()
|
| /dports/security/cargo-audit/rustsec-cargo-audit-v0.15.2/cargo-audit/cargo-crates/petgraph-0.5.1/src/ |
| H A D | graphmap.rs | 124 fn edge_key(a: N, b: N) -> (N, N) { in edge_key() function
198 self.edges.swap_remove(&Self::edge_key(n, succ)); in remove_node()
230 if let old @ Some(_) = self.edges.insert(Self::edge_key(a, b), weight) { in add_edge()
302 let weight = self.edges.remove(&Self::edge_key(a, b)); in remove_edge()
309 self.edges.contains_key(&Self::edge_key(a, b)) in contains_edge()
379 self.edges.get(&Self::edge_key(a, b)) in edge_weight()
385 self.edges.get_mut(&Self::edge_key(a, b)) in edge_weight_mut()
596 match self.edges.get(&GraphMap::<N, E, Ty>::edge_key(a, b)) { in next()
747 let index = Self::edge_key(index.0, index.1); in index()
760 let index = Self::edge_key(index.0, index.1); in index_mut()
|
| /dports/security/sequoia/sequoia-383133f6be990237044900a4df676488bf8dd71e/cargo-crates/petgraph-0.4.13/src/ |
| H A D | graphmap.rs | 137 fn edge_key(a: N, b: N) -> (N, N) { in edge_key() function
208 self.edges.swap_remove(&Self::edge_key(n, succ)); in remove_node()
240 if let old @ Some(_) = self.edges.insert(Self::edge_key(a, b), weight) { in add_edge()
299 let weight = self.edges.remove(&Self::edge_key(a, b)); in remove_edge()
306 self.edges.contains_key(&Self::edge_key(a, b)) in contains_edge()
375 self.edges.get(&Self::edge_key(a, b)) in edge_weight()
381 self.edges.get_mut(&Self::edge_key(a, b)) in edge_weight_mut()
576 match self.edges.get(&GraphMap::<N, E, Ty>::edge_key(a, b)) { in next()
701 let index = Self::edge_key(index.0, index.1); in index()
712 let index = Self::edge_key(index.0, index.1); in index_mut()
|
| /dports/lang/rust/rustc-1.58.1-src/vendor/petgraph/src/ |
| H A D | graphmap.rs | 124 fn edge_key(a: N, b: N) -> (N, N) { in edge_key() function
198 self.edges.swap_remove(&Self::edge_key(n, succ)); in remove_node()
230 if let old @ Some(_) = self.edges.insert(Self::edge_key(a, b), weight) { in add_edge()
302 let weight = self.edges.remove(&Self::edge_key(a, b)); in remove_edge()
309 self.edges.contains_key(&Self::edge_key(a, b)) in contains_edge()
379 self.edges.get(&Self::edge_key(a, b)) in edge_weight()
385 self.edges.get_mut(&Self::edge_key(a, b)) in edge_weight_mut()
596 match self.edges.get(&GraphMap::<N, E, Ty>::edge_key(a, b)) { in next()
747 let index = Self::edge_key(index.0, index.1); in index()
760 let index = Self::edge_key(index.0, index.1); in index_mut()
|
| /dports/www/firefox-esr/firefox-91.8.0/third_party/rust/petgraph/src/ |
| H A D | graphmap.rs | 124 fn edge_key(a: N, b: N) -> (N, N) { in edge_key() function
198 self.edges.swap_remove(&Self::edge_key(n, succ)); in remove_node()
230 if let old @ Some(_) = self.edges.insert(Self::edge_key(a, b), weight) { in add_edge()
302 let weight = self.edges.remove(&Self::edge_key(a, b)); in remove_edge()
309 self.edges.contains_key(&Self::edge_key(a, b)) in contains_edge()
379 self.edges.get(&Self::edge_key(a, b)) in edge_weight()
385 self.edges.get_mut(&Self::edge_key(a, b)) in edge_weight_mut()
596 match self.edges.get(&GraphMap::<N, E, Ty>::edge_key(a, b)) { in next()
747 let index = Self::edge_key(index.0, index.1); in index()
760 let index = Self::edge_key(index.0, index.1); in index_mut()
|
| /dports/audio/ncspot/ncspot-0.9.3/cargo-crates/petgraph-0.5.1/src/ |
| H A D | graphmap.rs | 124 fn edge_key(a: N, b: N) -> (N, N) { in edge_key() function
198 self.edges.swap_remove(&Self::edge_key(n, succ)); in remove_node()
230 if let old @ Some(_) = self.edges.insert(Self::edge_key(a, b), weight) { in add_edge()
302 let weight = self.edges.remove(&Self::edge_key(a, b)); in remove_edge()
309 self.edges.contains_key(&Self::edge_key(a, b)) in contains_edge()
379 self.edges.get(&Self::edge_key(a, b)) in edge_weight()
385 self.edges.get_mut(&Self::edge_key(a, b)) in edge_weight_mut()
596 match self.edges.get(&GraphMap::<N, E, Ty>::edge_key(a, b)) { in next()
747 let index = Self::edge_key(index.0, index.1); in index()
760 let index = Self::edge_key(index.0, index.1); in index_mut()
|
| /dports/sysutils/fselect/fselect-0.7.7/cargo-crates/petgraph-0.5.1/src/ |
| H A D | graphmap.rs | 124 fn edge_key(a: N, b: N) -> (N, N) {
198 self.edges.swap_remove(&Self::edge_key(n, succ));
230 if let old @ Some(_) = self.edges.insert(Self::edge_key(a, b), weight) {
302 let weight = self.edges.remove(&Self::edge_key(a, b));
309 self.edges.contains_key(&Self::edge_key(a, b))
379 self.edges.get(&Self::edge_key(a, b))
385 self.edges.get_mut(&Self::edge_key(a, b))
596 match self.edges.get(&GraphMap::<N, E, Ty>::edge_key(a, b)) {
747 let index = Self::edge_key(index.0, index.1);
760 let index = Self::edge_key(index.0, index.1);
|
| /dports/math/py-networkx/networkx-2.6.3/networkx/tests/ |
| H A D | test_convert_pandas.py | 206 nx.NetworkXError, nx.to_pandas_edgelist, G, edge_key="edge_key_name"
269 edge_key="attr1",
274 df_roundtrip = nx.to_pandas_edgelist(G, edge_key="attr1")
289 G = nx.from_pandas_edgelist(self.df, 0, "b", True, edge_key="weight")
298 edge_key="Not_real",
|
| /dports/lang/gleam/gleam-0.18.2/cargo-crates/petgraph-0.6.0/src/ |
| H A D | graphmap.rs | 145 fn edge_key(a: N, b: N) -> (N, N) { in edge_key() function
217 Self::edge_key(n, succ) in remove_node()
219 Self::edge_key(succ, n) in remove_node()
325 let weight = self.edges.remove(&Self::edge_key(a, b)); in remove_edge()
332 self.edges.contains_key(&Self::edge_key(a, b)) in contains_edge()
423 self.edges.get(&Self::edge_key(a, b)) in edge_weight()
429 self.edges.get_mut(&Self::edge_key(a, b)) in edge_weight_mut()
634 match self.edges.get(&GraphMap::<N, E, Ty>::edge_key(a, b)) { in next()
670 match self.edges.get(&GraphMap::<N, E, Ty>::edge_key(a, b)) { in next()
798 let index = Self::edge_key(index.0, index.1); in index()
[all …]
|
| /dports/devel/grex/grex-1.3.0/cargo-crates/petgraph-0.6.0/src/ |
| H A D | graphmap.rs | 145 fn edge_key(a: N, b: N) -> (N, N) { in edge_key() function
217 Self::edge_key(n, succ) in remove_node()
219 Self::edge_key(succ, n) in remove_node()
325 let weight = self.edges.remove(&Self::edge_key(a, b)); in remove_edge()
332 self.edges.contains_key(&Self::edge_key(a, b)) in contains_edge()
423 self.edges.get(&Self::edge_key(a, b)) in edge_weight()
429 self.edges.get_mut(&Self::edge_key(a, b)) in edge_weight_mut()
634 match self.edges.get(&GraphMap::<N, E, Ty>::edge_key(a, b)) { in next()
670 match self.edges.get(&GraphMap::<N, E, Ty>::edge_key(a, b)) { in next()
798 let index = Self::edge_key(index.0, index.1); in index()
[all …]
|
| /dports/devel/texlab/texlab-3.3.0/cargo-crates/petgraph-0.6.0/src/ |
| H A D | graphmap.rs | 145 fn edge_key(a: N, b: N) -> (N, N) { in edge_key() function
217 Self::edge_key(n, succ) in remove_node()
219 Self::edge_key(succ, n) in remove_node()
325 let weight = self.edges.remove(&Self::edge_key(a, b)); in remove_edge()
332 self.edges.contains_key(&Self::edge_key(a, b)) in contains_edge()
423 self.edges.get(&Self::edge_key(a, b)) in edge_weight()
429 self.edges.get_mut(&Self::edge_key(a, b)) in edge_weight_mut()
634 match self.edges.get(&GraphMap::<N, E, Ty>::edge_key(a, b)) { in next()
670 match self.edges.get(&GraphMap::<N, E, Ty>::edge_key(a, b)) { in next()
798 let index = Self::edge_key(index.0, index.1); in index()
[all …]
|
| /dports/security/cargo-audit/rustsec-cargo-audit-v0.15.2/cargo-audit/cargo-crates/petgraph-0.6.0/src/ |
| H A D | graphmap.rs | 145 fn edge_key(a: N, b: N) -> (N, N) { in edge_key() function
217 Self::edge_key(n, succ) in remove_node()
219 Self::edge_key(succ, n) in remove_node()
325 let weight = self.edges.remove(&Self::edge_key(a, b)); in remove_edge()
332 self.edges.contains_key(&Self::edge_key(a, b)) in contains_edge()
423 self.edges.get(&Self::edge_key(a, b)) in edge_weight()
429 self.edges.get_mut(&Self::edge_key(a, b)) in edge_weight_mut()
634 match self.edges.get(&GraphMap::<N, E, Ty>::edge_key(a, b)) { in next()
670 match self.edges.get(&GraphMap::<N, E, Ty>::edge_key(a, b)) { in next()
798 let index = Self::edge_key(index.0, index.1); in index()
[all …]
|
| /dports/sysutils/dua-cli/dua-cli-2.14.11/cargo-crates/petgraph-0.6.0/src/ |
| H A D | graphmap.rs | 145 fn edge_key(a: N, b: N) -> (N, N) { in edge_key() function
217 Self::edge_key(n, succ) in remove_node()
219 Self::edge_key(succ, n) in remove_node()
325 let weight = self.edges.remove(&Self::edge_key(a, b)); in remove_edge()
332 self.edges.contains_key(&Self::edge_key(a, b)) in contains_edge()
423 self.edges.get(&Self::edge_key(a, b)) in edge_weight()
429 self.edges.get_mut(&Self::edge_key(a, b)) in edge_weight_mut()
634 match self.edges.get(&GraphMap::<N, E, Ty>::edge_key(a, b)) { in next()
670 match self.edges.get(&GraphMap::<N, E, Ty>::edge_key(a, b)) { in next()
798 let index = Self::edge_key(index.0, index.1); in index()
[all …]
|
| /dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/bipartite/ |
| H A D | edgelist.py | 254 for (edge_key, edge_type), edge_value in zip(data, d):
262 edgedata.update({edge_key: edge_value})
|
| /dports/graphics/blender/blender-2.91.0/release/scripts/addons/io_scene_obj/ |
| H A D | import_obj.py | 624 edge_key = (prev_vidx, vidx) if (prev_vidx < vidx) else (vidx, prev_vidx)
626 edge_dict[edge_key] = edge_dict.get(edge_key, 0) + 1
664 … edge_key = (prev_vidx, vidx) if (prev_vidx < vidx) else (vidx, prev_vidx)
666 if edge_key in edge_users:
667 fgon_edges.add(edge_key)
669 edge_users.add(edge_key)
1120 … edge_key = (prev_vidx, vidx) if (prev_vidx < vidx) else (vidx, prev_vidx)
1121 if edge_key in face_items_usage:
1124 face_items_usage.add(edge_key)
|