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>

Struct rustc_data_structures::graph::vec_graph::VecGraph

Fields§

Implementations§

impl<N: Idx + Ord> 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<'graph, N: Idx> 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 + 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> DynSend for VecGraph<N>where N: DynSend,

impl<N> DynSync for VecGraph<N>where N: DynSync,

impl<N> Freeze for VecGraph<N>

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> Aligned for T

const ALIGN: Alignment = const ALIGN: Alignment = Alignment::of::<Self>();

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

fn type_id(&self) -> TypeId

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

fn borrow(&self) -> &T

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

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

impl<T> From<T> for T

fn from(t: T) -> T

impl<T> Instrument for T

fn instrument(self, span: Span) -> Instrumented<Self>

fn in_current_span(self) -> Instrumented<Self>

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

fn into(self) -> U

impl<T> Pointable for T

const ALIGN: usize = _

type Init = T

unsafe fn init(init: <T as Pointable>::Init) -> usize

unsafe fn deref<'a>(ptr: usize) -> &'a T

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

unsafe fn drop(ptr: usize)

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

type Error = Infallible

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

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

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

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

impl<T> WithSubscriber for T

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>where S: Into<Dispatch>,

fn with_current_subscriber(self) -> WithDispatch<Self>

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

Layout§

fn depth_first_search(&self, from: Self::Node) -> DepthFirstSearch<'_, Self> ⓘ
where Self: WithNumNodes,

impl<N> DynSend for VecGraph<N>
where N: DynSend,

impl<N> DynSync for VecGraph<N>
where N: DynSync,

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>,

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

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