Struct SendableCostNode 

pub struct SendableCostNode<D, S, C, L> { /* private fields */ }

Node ordered by the cost.

Implementations

impl<D, S, C, L> SendableCostNode<D, S, C, L>

where D: DpMut<State = S, CostType = C>, C: Neg<Output = C>, L: Copy + Default,

pub fn create_root(dp: &D, state: S, cost: C) -> Self

Creates a new root node given the state and the cost.

pub fn create_child(&self, dp: &D, state: S, cost: C, transition: L) -> Self

Creates a new child node given the state, the cost, and the transition.

Trait Implementations

impl<D, S, C, L> Clone for SendableCostNode<D, S, C, L>

where S: Clone, C: Clone,

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<D, S, C, L> Eq for SendableCostNode<D, S, C, L>

where C: Eq,

impl<D, S, C, L> Ord for SendableCostNode<D, S, C, L>

where C: Eq + Ord,

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

fn clamp_to<R>(self, range: R) -> Self

where Self: Sized, R: ClampBounds<Self>,

🔬This is a nightly-only experimental API. (clamp_to)

Restrict a value to a certain range.

impl<D, S, C, L> PartialEq for SendableCostNode<D, S, C, L>

where C: PartialEq,

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

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl<D, S, C, L> PartialOrd for SendableCostNode<D, S, C, L>

where C: Eq + Ord,

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

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

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<D, S, C, L> SearchNode for SendableCostNode<D, S, C, L>

where D: DpMut<State = S, CostType = C, Label = L>, C: Copy + Neg<Output = C>, L: Copy,

type DpData = D

Type of the DP data.

type State = S

Type of the state.

type CostType = C

Type of the cost.

type Label = L

Type of the transition label.

fn get_state(&self, _: &Self::DpData) -> &Self::State

Returns the state of the node.

fn get_state_mut(&mut self, _: &Self::DpData) -> &mut Self::State

Returns the state of the node.

fn get_cost(&self, dp: &Self::DpData) -> Self::CostType

Returns the cost of the node.

fn get_bound(&self, _: &Self::DpData) -> Option<Self::CostType>

Returns the dual bound of the path cost extending the node.

fn is_closed(&self) -> bool

Returns whether the node is closed.

fn close(&self)

Closes the node.

fn get_transitions(&self, _: &D) -> Vec<L>

Returns the transitions to reach the node.

fn check_solution( &self, dp: &mut Self::DpData, ) -> Option<(Self::CostType, Vec<Self::Label>)>

Checks if the node is a solution and returns the cost and transitions if it is.

fn ordered_by_bound() -> bool

Returns whether the nodes are ordered by dual bound values.