Struct vrp_core::construction::heuristics::InsertionCost

pub struct InsertionCost { /* private fields */ }

A hierarchical cost of job’s insertion.

Implementations

impl InsertionCost

pub fn new(data: &[Cost]) -> Self

Creates a new instance of InsertionCost.

pub fn iter(&self) -> impl Iterator<Item = Cost> + '_

Returns iterator over cost values.

pub fn max_value() -> Self

Returns highest* possible insertion cost.

Trait Implementations

impl<'a, B> Add<B> for &'a InsertionCost

where B: Borrow<InsertionCost>,

type Output = InsertionCost

The resulting type after applying the + operator.

fn add(self, rhs: B) -> Self::Output

Performs the + operation.

impl<B> Add<B> for InsertionCost

where B: Borrow<InsertionCost>,

type Output = InsertionCost

The resulting type after applying the + operator.

fn add(self, rhs: B) -> Self::Output

Performs the + operation.

impl Clone for InsertionCost

fn clone(&self) -> InsertionCost

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for InsertionCost

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

Formats the value using the given formatter.

impl Default for InsertionCost

fn default() -> InsertionCost

Returns the “default value” for a type.

impl FromIterator<f64> for InsertionCost

fn from_iter<T: IntoIterator<Item = Cost>>(iter: T) -> Self

Creates a value from an iterator.

impl Index<usize> for InsertionCost

type Output = f64

The returned type after indexing.

fn index(&self, index: usize) -> &Self::Output

Performs the indexing (container[index]) operation.

impl IntoIterator for InsertionCost

type Item = f64

The type of the elements being iterated over.

type IntoIter = TinyVecIterator<[f64; 6]>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl Ord for InsertionCost

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

Restrict a value to a certain interval.

impl PartialEq for InsertionCost

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

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

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for InsertionCost

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

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

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

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

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

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

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

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

impl<'a, B> Sub<B> for &'a InsertionCost

where B: Borrow<InsertionCost>,

type Output = InsertionCost

The resulting type after applying the - operator.

fn sub(self, rhs: B) -> Self::Output

Performs the - operation.

impl<B> Sub<B> for InsertionCost

where B: Borrow<InsertionCost>,

type Output = InsertionCost

The resulting type after applying the - operator.

fn sub(self, rhs: B) -> Self::Output

Performs the - operation.

impl Eq for InsertionCost