Struct rustc_data_structures::graph::vec_graph::VecGraph
source · pub struct VecGraph<N: Idx> {
node_starts: IndexVec<N, usize>,
edge_targets: Vec<N>,
}
Fields§
§node_starts: IndexVec<N, usize>
Maps from a given node to an index where the set of successors
for that node starts. The index indexes into the edges
vector. To find the range for a given node, we look up the
start for that node and then the start for the next node
(i.e., with an index 1 higher) and get the range between the
two. This vector always has an extra entry so that this works
even for the max element.
edge_targets: Vec<N>
Implementations§
Trait Implementations§
source§impl<'graph, N: Idx> GraphSuccessors<'graph> for VecGraph<N>
impl<'graph, N: Idx> GraphSuccessors<'graph> for VecGraph<N>
source§impl<N: Idx + Ord> WithSuccessors for VecGraph<N>
impl<N: Idx + Ord> WithSuccessors for VecGraph<N>
fn successors(&self, node: N) -> <Self as GraphSuccessors<'_>>::Iter
fn depth_first_search(&self, from: Self::Node) -> DepthFirstSearch<'_, Self> ⓘwhere Self: WithNumNodes,
Auto Trait Implementations§
impl<N> RefUnwindSafe for VecGraph<N>where N: RefUnwindSafe,
impl<N> Send for VecGraph<N>where N: Send,
impl<N> Sync for VecGraph<N>where N: Sync,
impl<N> Unpin for VecGraph<N>where N: Unpin,
impl<N> UnwindSafe for VecGraph<N>where N: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<'a, T> Captures<'a> for Twhere T: ?Sized,
Layout§
Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...)
attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.
Size: 48 bytes