Struct MaxSubArraySum

pub struct MaxSubArraySum { /* private fields */ }

Implementation of the solution to the maximum subarray problem. It just implements Node.

Trait Implementations

impl Clone for MaxSubArraySum

fn clone(&self) -> MaxSubArraySum

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for MaxSubArraySum

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

Formats the value using the given formatter.

impl Default for MaxSubArraySum

fn default() -> MaxSubArraySum

Returns the “default value” for a type.

impl Node for MaxSubArraySum

type Value = i64

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

fn initialize(value: &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 PartialEq for MaxSubArraySum

fn eq(&self, other: &MaxSubArraySum) -> 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 Eq for MaxSubArraySum

impl StructuralPartialEq for MaxSubArraySum