Struct segment_tree::ops::Pair

pub struct Pair<A, B> { /* fields omitted */ }

Store more information in each node.

Trait Implementations

impl<TA, TB, A: Operation<TA>, B: Operation<TB>> Operation<(TA, TB)> for Pair<A, B>

fn combine(a: &(TA, TB), b: &(TA, TB)) -> (TA, TB)

The operation that is performed to combine two intervals in the segment tree.

fn combine_mut(a: &mut (TA, TB), b: &(TA, TB))

Replace the value in a with combine(a, b). This function exists to allow certain optimizations and by default simply calls combine.

fn combine_mut2(a: &(TA, TB), b: &mut (TA, TB))

Replace the value in a with combine(a, b). This function exists to allow certain optimizations and by default simply calls combine.

fn combine_left(a: (TA, TB), b: &(TA, TB)) -> (TA, TB)

Must return the same as combine. This function exists to allow certain optimizations and by default simply calls combine_mut.

fn combine_right(a: &(TA, TB), b: (TA, TB)) -> (TA, TB)

Must return the same as combine. This function exists to allow certain optimizations and by default simply calls combine_mut2.

fn combine_both(a: (TA, TB), b: (TA, TB)) -> (TA, TB)

Must return the same as combine. This function exists to allow certain optimizations and by default simply calls combine_left.

impl<TA, TB, A: Inverse<TA>, B: Inverse<TB>> Inverse<(TA, TB)> for Pair<A, B>

fn uncombine(a: &mut (TA, TB), b: &(TA, TB))

Returns some value such that combine(uncombine(a, b), b) = a.

impl<TA, TB, A: CommutativeOperation<TA>, B: CommutativeOperation<TB>> CommutativeOperation<(TA, TB)> for Pair<A, B>

impl<TA, TB, A: Identity<TA>, B: Identity<TB>> Identity<(TA, TB)> for Pair<A, B>

fn identity() -> (TA, TB)

Returns any identity.