Struct Max

pub struct Max<T> { /* private fields */ }

Implementation of range max for generic type T, it only implements Node.

Trait Implementations

impl<T: Clone> Clone for Max<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for Max<T>

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

Formats the value using the given formatter.

impl<T> Node for Max<T>

where T: Ord + Clone,

type Value = T

This type corresponds to the type of the information to create the node with Node::initialize.

fn initialize(v: &Self::Value) -> Self

Function to create nodes from saved value, it is assumed that even if there’s more data saved in the node, value should have enough data to create all of the data of a node of a segment segment of exactly one element.

fn combine(a: &Self, b: &Self) -> Self

Function which will combine nodes a and b, where each corresponds to segments [i,j] and [j+1,k] respectively, into a node which corresponds to the segment [i,k]. This function must be associative (taking * as a symbol for combine, we have that a*(b*c)==(a*b)*c is true), but need not be commutative (it’s not necessarily true that a*b==b*a).

fn value(&self) -> &Self::Value

Method which returns a reference to the current saved value.

impl<T: PartialEq> PartialEq for Max<T>

fn eq(&self, other: &Max<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl<T: Eq> Eq for Max<T>

impl<T> StructuralPartialEq for Max<T>