Struct librsnek::compiler::graph::DiGraph

pub struct DiGraph<T: Node + ?Sized + Serialize> {
    nodes: RefCell<Vec<Box<T>>>,
}

Adjacency List Style Directed Graph

Fields

nodes: RefCell<Vec<Box<T>>>

Methods

impl<T> DiGraph<T> where
    T: Node + Clone + Serialize, 

fn new(root: T) -> Self

Trait Implementations

impl<T: Debug + Node + ?Sized + Serialize> Debug for DiGraph<T>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<T: PartialEq + Node + ?Sized + Serialize> PartialEq for DiGraph<T>

fn eq(&self, __arg_0: &DiGraph<T>) -> bool

This method tests for self and other values to be equal, and is used

fn ne(&self, __arg_0: &DiGraph<T>) -> bool

This method tests for !=.

impl<T: Eq + Node + ?Sized + Serialize> Eq for DiGraph<T>

fn assert_receiver_is_total_eq(&self)

impl<T: Ord + Node + ?Sized + Serialize> Ord for DiGraph<T>

fn cmp(&self, __arg_0: &DiGraph<T>) -> Ordering

This method returns an Ordering between self and other.

impl<T: PartialOrd + Node + ?Sized + Serialize> PartialOrd for DiGraph<T>

fn partial_cmp(&self, __arg_0: &DiGraph<T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, __arg_0: &DiGraph<T>) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, __arg_0: &DiGraph<T>) -> bool

This method tests less than or equal to (for self and other) and is used by the <=

fn gt(&self, __arg_0: &DiGraph<T>) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, __arg_0: &DiGraph<T>) -> bool

This method tests greater than or equal to (for self and other) and is used by the >=

impl<T: Clone + Node + ?Sized + Serialize> Clone for DiGraph<T>

fn clone(&self) -> DiGraph<T>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T> Graph for DiGraph<T> where
    T: Node + Clone + Serialize, 

type Node = T

fn count(&self) -> usize

The number of nodes in the Graph.

fn add_node(&self, node: Self::Node)

Insert a node into the graph when it already defines its id and the id of its

fn get_node(&self, id: usize) -> Box<Self::Node>

Get a node by id.