Struct ddo::core::common::Node

pub struct Node<T> {
    pub state: T,
    pub info: NodeInfo,
}

A node is the simplest constituent of an MDD. It basically consists of an user specified state together with some meta data (stored in a NodeInfo which does some bookkeeping about the position, longest path.. of this node in the decision diagram).

Fields

state: T

This is the (user-specified) state. It is the state reached by following the best path from the root node applying the transition relation at each decision.

info: NodeInfo

This is the node info which stores the metadata about the node.

Methods

impl<T> Node<T>

pub fn new(
    state: T,
    lp_len: i32,
    lp_arc: Option<Edge>,
    is_exact: bool,
    is_relaxed: bool
) -> Node<T>

Constructor.

Creates a new node info from the state, longest path information (lp_len and lp_arc) and a flag indicating if this denotes an exaxct node or not. The upper bound is set to a default value (the greatest i32)

pub fn merged(state: T, lp_len: i32, lp_arc: Option<Edge>) -> Node<T>

Alt-Constructor

This constructor explicitly creates a merged node. That is, a node which is going to be marked as 'not exact'.

Trait Implementations

impl<T: Clone> Clone for Node<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> Compare<Node<T>, Node<T>> for MinLP

fn compare(&self, a: &Node<T>, b: &Node<T>) -> Ordering

Compares two values, returning Less, Equal, or Greater if l is less than, equal to, or greater than r, respectively.

fn compares_lt(&self, l: &L, r: &R) -> bool

Checks if l is less than r.

fn compares_le(&self, l: &L, r: &R) -> bool

Checks if l is less than or equal to r.

fn compares_ge(&self, l: &L, r: &R) -> bool

Checks if l is greater than or equal to r.

fn compares_gt(&self, l: &L, r: &R) -> bool

Checks if l is greater than r.

fn compares_eq(&self, l: &L, r: &R) -> bool

Checks if l is equal to r.

fn compares_ne(&self, l: &L, r: &R) -> bool

Checks if l is not equal to r.

fn borrowing(self) -> Borrowing<Self, L, R>

Borrows the comparator's parameters before comparing them.

fn rev(self) -> Rev<Self>

Reverses the ordering of the comparator.

fn swap(self) -> Swap<Self>

Swaps the comparator's parameters, maintaining the underlying ordering.

fn then<D>(self, then: D) -> Then<Self, D> where
    D: Compare<L, R>, 

Lexicographically combines the comparator with another.

impl<T> Compare<Node<T>, Node<T>> for MaxUB

fn compare(&self, a: &Node<T>, b: &Node<T>) -> Ordering

Compares two values, returning Less, Equal, or Greater if l is less than, equal to, or greater than r, respectively.

fn compares_lt(&self, l: &L, r: &R) -> bool

Checks if l is less than r.

fn compares_le(&self, l: &L, r: &R) -> bool

Checks if l is less than or equal to r.

fn compares_ge(&self, l: &L, r: &R) -> bool

Checks if l is greater than or equal to r.

fn compares_gt(&self, l: &L, r: &R) -> bool

Checks if l is greater than r.

fn compares_eq(&self, l: &L, r: &R) -> bool

Checks if l is equal to r.

fn compares_ne(&self, l: &L, r: &R) -> bool

Checks if l is not equal to r.

fn borrowing(self) -> Borrowing<Self, L, R>

Borrows the comparator's parameters before comparing them.

fn rev(self) -> Rev<Self>

Reverses the ordering of the comparator.

fn swap(self) -> Swap<Self>

Swaps the comparator's parameters, maintaining the underlying ordering.

fn then<D>(self, then: D) -> Then<Self, D> where
    D: Compare<L, R>, 

Lexicographically combines the comparator with another.

impl<T, F> Compare<Node<T>, Node<T>> for Func<F> where
    F: Clone + Fn(&Node<T>, &Node<T>) -> Ordering, 

If the function is a node comparator, then Func will auto implement the Compare trait for that function.

fn compare(&self, a: &Node<T>, b: &Node<T>) -> Ordering

Compares two values, returning Less, Equal, or Greater if l is less than, equal to, or greater than r, respectively.

fn compares_lt(&self, l: &L, r: &R) -> bool

Checks if l is less than r.

fn compares_le(&self, l: &L, r: &R) -> bool

Checks if l is less than or equal to r.

fn compares_ge(&self, l: &L, r: &R) -> bool

Checks if l is greater than or equal to r.

fn compares_gt(&self, l: &L, r: &R) -> bool

Checks if l is greater than r.

fn compares_eq(&self, l: &L, r: &R) -> bool

Checks if l is equal to r.

fn compares_ne(&self, l: &L, r: &R) -> bool

Checks if l is not equal to r.

fn borrowing(self) -> Borrowing<Self, L, R>

Borrows the comparator's parameters before comparing them.

fn rev(self) -> Rev<Self>

Reverses the ordering of the comparator.

fn swap(self) -> Swap<Self>

Swaps the comparator's parameters, maintaining the underlying ordering.

fn then<D>(self, then: D) -> Then<Self, D> where
    D: Compare<L, R>, 

Lexicographically combines the comparator with another.

impl<T: Debug> Debug for Node<T>

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

Formats the value using the given formatter.

impl<T: Eq> Eq for Node<T>

impl<T> Hash for Node<T> where
    T: Hash, 

fn hash<H: Hasher>(&self, state: &mut H)

A node acts as a mere pass through for the state. Hence it is hashed on basis of the state only.

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given [Hasher].

impl<T> PartialEq<Node<T>> for Node<T> where
    T: Eq, 

fn eq(&self, other: &Self) -> bool

To be coherent with Hash, nodes implement an equality test that bears on the node state only.

#[must_use]fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl<T> StructuralEq for Node<T>