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

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

`impl<N: Idx> VecGraph<N>`[src]

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

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

Gets the successors for source as a slice.

Trait Implementations

`impl<N: Idx> DirectedGraph for VecGraph<N>`[src]

`type Node = N`

`impl<N: Idx, 'graph> GraphSuccessors<'graph> for VecGraph<N>`[src]

`type Item = N`

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

`impl<N: Idx> WithNumEdges for VecGraph<N>`[src]

`pub fn num_edges(&self) -> usize`[src]

`impl<N: Idx> WithNumNodes for VecGraph<N>`[src]

`pub fn num_nodes(&self) -> usize`[src]

`impl<N: Idx> WithSuccessors for VecGraph<N>`[src]

`pub fn successors(&self, node: N) -> Self::Iter`[src]

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

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,` [src]

`pub fn type_id(&self) -> TypeId`[src]

`impl<T> Borrow<T> for T where T: ?Sized,` [src]

`pub fn borrow(&self) -> &TⓘNotable traits for &'_ mut I impl<'_, I> Iterator for &'_ mut I where I: Iterator + ?Sized, type Item = ::Item;`[src]

`impl<T> BorrowMut<T> for T where T: ?Sized,` [src]

`pub fn borrow_mut(&mut self) -> &mut TⓘNotable traits for &'_ mut I impl<'_, I> Iterator for &'_ mut I where I: Iterator + ?Sized, type Item = ::Item;`[src]

`impl<'a, T> Captures<'a> for T where T: ?Sized,` [src]

`impl<T> Erased for T`[src]

`impl<T> From<T> for T`[src]

`pub fn from(t: T) -> T`[src]

`impl<T, U> Into for T where U: From<T>,` [src]

`pub fn into(self) -> U`[src]

`impl<T, U> TryFrom for T where U: Into<T>,` [src]

`type Error = Infallible`

The type returned in the event of a conversion error.

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

`impl<T, U> TryInto for T where U: TryFrom<T>,` [src]

`type Error = >::Error`

The type returned in the event of a conversion error.

`pub fn try_into(self) -> Result<U, >::Error>`[src]

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

Fields

Implementations

impl<N: Idx> VecGraph<N>[src]

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

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

Trait Implementations

impl<N: Idx> DirectedGraph for VecGraph<N>[src]

type Node = N

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

type Item = N

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

impl<N: Idx> WithNumEdges for VecGraph<N>[src]

pub fn num_edges(&self) -> usize[src]

impl<N: Idx> WithNumNodes for VecGraph<N>[src]

pub fn num_nodes(&self) -> usize[src]

impl<N: Idx> WithSuccessors for VecGraph<N>[src]

pub fn successors(&self, node: N) -> Self::Iter[src]

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

Notable traits for DepthFirstSearch<'_, G>

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, [src]

pub fn type_id(&self) -> TypeId[src]

impl<T> Borrow<T> for T where T: ?Sized, [src]

pub fn borrow(&self) -> &TⓘNotable traits for &'_ mut Iimpl<'_, I> Iterator for &'_ mut I where I: Iterator + ?Sized, type Item = <I as Iterator>::Item;[src]

Notable traits for &'_ mut I

impl<T> BorrowMut<T> for T where T: ?Sized, [src]

pub fn borrow_mut(&mut self) -> &mut TⓘNotable traits for &'_ mut Iimpl<'_, I> Iterator for &'_ mut I where I: Iterator + ?Sized, type Item = <I as Iterator>::Item;[src]

Notable traits for &'_ mut I

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

impl<T> Erased for T[src]

impl<T> From<T> for T[src]

pub fn from(t: T) -> T[src]

impl<T, U> Into<U> for T where U: From<T>, [src]

pub fn into(self) -> U[src]

impl<T, U> TryFrom<U> for T where U: Into<T>, [src]

type Error = Infallible

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

impl<T, U> TryInto<U> for T where U: TryFrom<T>, [src]

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

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