Struct rustc_data_structures::graph::vec_graph::VecGraph[−][src]

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>

Struct rustc_data_structures::graph::vec_graph::VecGraph[−][src]

Fields

Implementations

impl<N: Idx> VecGraph<N>

pub fn new(num_nodes: usize, edge_pairs: Vec<(N, N)>) -> Self

pub fn successors(&self, source: N) -> &[N]

Trait Implementations

impl<N: Idx> DirectedGraph for VecGraph<N>

type Node = N

impl<N: Idx, 'graph> GraphSuccessors<'graph> for VecGraph<N>

type Item = N

type Iter = Cloned<Iter<'graph, N>>

impl<N: Idx> WithNumEdges for VecGraph<N>

fn num_edges(&self) -> usize

impl<N: Idx> WithNumNodes for VecGraph<N>

fn num_nodes(&self) -> usize

impl<N: Idx> WithSuccessors for VecGraph<N>

fn successors(&self, node: N) -> Cloned<Iter<'_, N>>ⓘNotable traits for Cloned<I>impl<'a, I, T> Iterator for Cloned<I> where T: 'a + Clone, I: Iterator<Item = &'a T>, type Item = T;

fn depth_first_search(&self, from: Self::Node) -> DepthFirstSearch<'_, Self>ⓘNotable traits for DepthFirstSearch<'_, G>impl<G> Iterator for DepthFirstSearch<'_, G> where G: ?Sized + DirectedGraph + WithNumNodes + WithSuccessors, type Item = G::Node; 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

impl<T> Any for T where T: 'static + ?Sized,

pub fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where T: ?Sized,

pub fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where T: ?Sized,

pub fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

pub fn from(t: T) -> T

impl<T, U> Into<U> for T where U: From<T>,

pub fn into(self) -> U

impl<T, U> TryFrom<U> for T where U: Into<T>,

type Error = Infallible

pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for T where U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<'a, T> Captures<'a> for T where T: ?Sized,

impl<T> Erased for T

Layout

fn successors(&self, node: N) -> Cloned<Iter<'_, N>>ⓘ
Notable traits for Cloned<I>
`impl<'a, I, T> Iterator for Cloned<I> where T: 'a + Clone, I: Iterator<Item = &'a T>, type Item = T;`

fn depth_first_search(&self, from: Self::Node) -> DepthFirstSearch<'_, Self>ⓘ
Notable traits for DepthFirstSearch<'_, G>
`impl<G> Iterator for DepthFirstSearch<'_, G> where G: ?Sized + DirectedGraph + WithNumNodes + WithSuccessors, type Item = G::Node;`
where
Self: WithNumNodes,

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,

impl<T> Any for T where
T: 'static + ?Sized,

impl<T> Borrow<T> for T where
T: ?Sized,

impl<T> BorrowMut<T> for T where
T: ?Sized,

impl<T, U> Into<U> for T where
U: From<T>,

impl<T, U> TryFrom<U> for T where
U: Into<T>,

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,

impl<'a, T> Captures<'a> for T where
T: ?Sized,