Struct rustc_data_structures::graph::implementation::Graph[−][src]

pub struct Graph<N, E> {
    nodes: SnapshotVec<Node<N>>,
    edges: SnapshotVec<Edge<E>>,
}

Fields

nodes: SnapshotVec<Node<N>>edges: SnapshotVec<Edge<E>>

Implementations

[src]

pub fn add_edge(
    &mut self,
    source: NodeIndex,
    target: NodeIndex,
    data: E
) -> EdgeIndex

[src]

pub fn edge(&self, idx: EdgeIndex) -> &Edge<E>

[src]

pub fn enumerated_nodes(&self) -> impl Iterator<Item = (NodeIndex, &Node<N>)>

[src]

pub fn enumerated_edges(&self) -> impl Iterator<Item = (EdgeIndex, &Edge<E>)>

[src]

pub fn each_node<'a>(
&'a self,
f: impl FnMut(NodeIndex, &'a Node<N>) -> bool
) -> bool

Iterates over all edges defined in the graph.

[src]

pub fn each_edge<'a>(
&'a self,
f: impl FnMut(EdgeIndex, &'a Edge<E>) -> bool
) -> bool

Iterates over all edges defined in the graph

[src]

pub fn outgoing_edges(&self, source: NodeIndex) -> AdjacentEdges<'_, N, E>ⓘ
Notable traits for AdjacentEdges<'g, N, E>
`impl<'g, N: Debug, E: Debug> Iterator for AdjacentEdges<'g, N, E> type Item = (EdgeIndex, &'g Edge<E>);`

[src]

pub fn incoming_edges(&self, source: NodeIndex) -> AdjacentEdges<'_, N, E>ⓘ
Notable traits for AdjacentEdges<'g, N, E>
`impl<'g, N: Debug, E: Debug> Iterator for AdjacentEdges<'g, N, E> type Item = (EdgeIndex, &'g Edge<E>);`

[src]

pub fn adjacent_edges(
 &self,
 source: NodeIndex,
 direction: Direction
) -> AdjacentEdges<'_, N, E>ⓘ
Notable traits for AdjacentEdges<'g, N, E>
`impl<'g, N: Debug, E: Debug> Iterator for AdjacentEdges<'g, N, E> type Item = (EdgeIndex, &'g Edge<E>);`

[src]

pub fn successor_nodes<'a>(
&'a self,
source: NodeIndex
) -> impl Iterator<Item = NodeIndex> + 'a

[src]

pub fn predecessor_nodes<'a>(
&'a self,
target: NodeIndex
) -> impl Iterator<Item = NodeIndex> + 'a

[src]

pub fn depth_traverse(
 &self,
 start: NodeIndex,
 direction: Direction
) -> DepthFirstTraversal<'_, N, E>ⓘ
Notable traits for DepthFirstTraversal<'g, N, E>
`impl<'g, N: Debug, E: Debug> Iterator for DepthFirstTraversal<'g, N, E> type Item = NodeIndex;`

[src]

pub fn nodes_in_postorder(
 &self,
 direction: Direction,
 entry_node: NodeIndex
) -> Vec<NodeIndex>

Auto Trait Implementations

impl<N, E> RefUnwindSafe for Graph<N, E> where
E: RefUnwindSafe,
N: RefUnwindSafe,

impl<N, E> Send for Graph<N, E> where
E: Send,
N: Send,

impl<N, E> Sync for Graph<N, E> where
E: Sync,
N: Sync,

impl<N, E> Unpin for Graph<N, E> where
E: Unpin,
N: Unpin,

impl<N, E> UnwindSafe for Graph<N, E> where
E: UnwindSafe,
N: UnwindSafe,

Blanket Implementations

[src]

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

[src]

pub fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

[src]

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

[src]

pub fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

[src]

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

[src]

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

Mutably borrows from an owned value. Read more

[src]

impl<T> From<T> for T

[src]

pub fn from(t: T) -> T

Performs the conversion.

[src]

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

[src]

pub fn into(self) -> U

Performs the conversion.

[src]

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

type Error = Infallible

The type returned in the event of a conversion error.

[src]

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

Performs the conversion.

[src]

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

type Error = >::Error

The type returned in the event of a conversion error.

[src]

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

Performs the conversion.

[src]

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

[src]

impl<T> Erased for T

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: 112 bytes

Struct rustc_data_structures::graph::implementation::Graph[−][src]

Fields

Implementations

impl<N: Debug, E: Debug> Graph<N, E>

pub fn new() -> Graph<N, E>

pub fn with_capacity(nodes: usize, edges: usize) -> Graph<N, E>

pub fn all_nodes(&self) -> &[Node<N>]

pub fn len_nodes(&self) -> usize

pub fn all_edges(&self) -> &[Edge<E>]

pub fn len_edges(&self) -> usize

pub fn next_node_index(&self) -> NodeIndex

pub fn add_node(&mut self, data: N) -> NodeIndex

pub fn mut_node_data(&mut self, idx: NodeIndex) -> &mut N

pub fn node_data(&self, idx: NodeIndex) -> &N

pub fn node(&self, idx: NodeIndex) -> &Node<N>

pub fn next_edge_index(&self) -> EdgeIndex

pub fn add_edge( &mut self, source: NodeIndex, target: NodeIndex, data: E) -> EdgeIndex

pub fn edge(&self, idx: EdgeIndex) -> &Edge<E>

pub fn enumerated_nodes(&self) -> impl Iterator<Item = (NodeIndex, &Node<N>)>

pub fn enumerated_edges(&self) -> impl Iterator<Item = (EdgeIndex, &Edge<E>)>

pub fn each_node<'a>( &'a self, f: impl FnMut(NodeIndex, &'a Node<N>) -> bool) -> bool

pub fn each_edge<'a>( &'a self, f: impl FnMut(EdgeIndex, &'a Edge<E>) -> bool) -> bool

pub fn outgoing_edges(&self, source: NodeIndex) -> AdjacentEdges<'_, N, E>ⓘNotable traits for AdjacentEdges<'g, N, E>impl<'g, N: Debug, E: Debug> Iterator for AdjacentEdges<'g, N, E> type Item = (EdgeIndex, &'g Edge<E>);

pub fn incoming_edges(&self, source: NodeIndex) -> AdjacentEdges<'_, N, E>ⓘNotable traits for AdjacentEdges<'g, N, E>impl<'g, N: Debug, E: Debug> Iterator for AdjacentEdges<'g, N, E> type Item = (EdgeIndex, &'g Edge<E>);

pub fn adjacent_edges( &self, source: NodeIndex, direction: Direction) -> AdjacentEdges<'_, N, E>ⓘNotable traits for AdjacentEdges<'g, N, E>impl<'g, N: Debug, E: Debug> Iterator for AdjacentEdges<'g, N, E> type Item = (EdgeIndex, &'g Edge<E>);

pub fn successor_nodes<'a>( &'a self, source: NodeIndex) -> impl Iterator<Item = NodeIndex> + 'a

pub fn predecessor_nodes<'a>( &'a self, target: NodeIndex) -> impl Iterator<Item = NodeIndex> + 'a

pub fn depth_traverse( &self, start: NodeIndex, direction: Direction) -> DepthFirstTraversal<'_, N, E>ⓘNotable traits for DepthFirstTraversal<'g, N, E>impl<'g, N: Debug, E: Debug> Iterator for DepthFirstTraversal<'g, N, E> type Item = NodeIndex;

pub fn nodes_in_postorder( &self, direction: Direction, entry_node: NodeIndex) -> Vec<NodeIndex>

Auto Trait Implementations

impl<N, E> RefUnwindSafe for Graph<N, E> where E: RefUnwindSafe, N: RefUnwindSafe,

impl<N, E> Send for Graph<N, E> where E: Send, N: Send,

impl<N, E> Sync for Graph<N, E> where E: Sync, N: Sync,

impl<N, E> Unpin for Graph<N, E> where E: Unpin, N: Unpin,

impl<N, E> UnwindSafe for Graph<N, E> where E: UnwindSafe, 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

pub fn add_edge(
&mut self,
source: NodeIndex,
target: NodeIndex,
data: E
) -> EdgeIndex

pub fn each_node<'a>(
&'a self,
f: impl FnMut(NodeIndex, &'a Node<N>) -> bool
) -> bool

pub fn each_edge<'a>(
&'a self,
f: impl FnMut(EdgeIndex, &'a Edge<E>) -> bool
) -> bool

pub fn outgoing_edges(&self, source: NodeIndex) -> AdjacentEdges<'_, N, E>ⓘ
Notable traits for AdjacentEdges<'g, N, E>
`impl<'g, N: Debug, E: Debug> Iterator for AdjacentEdges<'g, N, E> type Item = (EdgeIndex, &'g Edge<E>);`

pub fn incoming_edges(&self, source: NodeIndex) -> AdjacentEdges<'_, N, E>ⓘ
Notable traits for AdjacentEdges<'g, N, E>
`impl<'g, N: Debug, E: Debug> Iterator for AdjacentEdges<'g, N, E> type Item = (EdgeIndex, &'g Edge<E>);`

pub fn adjacent_edges(
&self,
source: NodeIndex,
direction: Direction
) -> AdjacentEdges<'_, N, E>ⓘ
Notable traits for AdjacentEdges<'g, N, E>
`impl<'g, N: Debug, E: Debug> Iterator for AdjacentEdges<'g, N, E> type Item = (EdgeIndex, &'g Edge<E>);`

pub fn successor_nodes<'a>(
&'a self,
source: NodeIndex
) -> impl Iterator<Item = NodeIndex> + 'a

pub fn predecessor_nodes<'a>(
&'a self,
target: NodeIndex
) -> impl Iterator<Item = NodeIndex> + 'a

pub fn depth_traverse(
&self,
start: NodeIndex,
direction: Direction
) -> DepthFirstTraversal<'_, N, E>ⓘ
Notable traits for DepthFirstTraversal<'g, N, E>
`impl<'g, N: Debug, E: Debug> Iterator for DepthFirstTraversal<'g, N, E> type Item = NodeIndex;`

pub fn nodes_in_postorder(
&self,
direction: Direction,
entry_node: NodeIndex
) -> Vec<NodeIndex>

impl<N, E> RefUnwindSafe for Graph<N, E> where
E: RefUnwindSafe,
N: RefUnwindSafe,

impl<N, E> Send for Graph<N, E> where
E: Send,
N: Send,

impl<N, E> Sync for Graph<N, E> where
E: Sync,
N: Sync,

impl<N, E> Unpin for Graph<N, E> where
E: Unpin,
N: Unpin,

impl<N, E> UnwindSafe for Graph<N, E> where
E: UnwindSafe,
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,