(
&mut self,
left_endpoint: &L,
edge_kind: E,
direction: EdgeDirection,
right_endpoint: R,
)
| 70 | } |
| 71 | |
| 72 | pub fn insert_edge<L, E, R>( |
| 73 | &mut self, |
| 74 | left_endpoint: &L, |
| 75 | edge_kind: E, |
| 76 | direction: EdgeDirection, |
| 77 | right_endpoint: R, |
| 78 | ) where |
| 79 | L: VertexId<BaseId: Eq + Clone + Hash, RevisionId: Ord + Clone>, |
| 80 | R: EdgeEndpoint, |
| 81 | E: EdgeKind<L, R, EdgeSet: Default> + Eq + Hash, |
| 82 | { |
| 83 | edge_kind.subgraph_entry_mut(&mut self.edges).insert( |
| 84 | left_endpoint, |
| 85 | edge_kind, |
| 86 | direction, |
| 87 | right_endpoint, |
| 88 | ); |
| 89 | } |
| 90 | |
| 91 | /// Returns an iterator over all entities in the subgraph with their valid temporal intervals. |
| 92 | /// |
no test coverage detected