Struct segment_tree::ops::Min

pub struct Min;

Each node contains the minimum value in the interval it represents.

Trait Implementations

impl Operation<u8> for Min

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

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

fn combine_mut(a: &mut N, b: &N)

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: &N, b: &mut N)

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: N, b: &N) -> N

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

fn combine_right(a: &N, b: N) -> N

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

fn combine_both(a: N, b: N) -> N

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

impl CommutativeOperation<u8> for Min

impl Identity<u8> for Min

fn identity() -> u8

Returns any identity.

impl Operation<u16> for Min

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

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

fn combine_mut(a: &mut N, b: &N)

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: &N, b: &mut N)

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: N, b: &N) -> N

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

fn combine_right(a: &N, b: N) -> N

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

fn combine_both(a: N, b: N) -> N

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

impl CommutativeOperation<u16> for Min

impl Identity<u16> for Min

fn identity() -> u16

Returns any identity.

impl Operation<u32> for Min

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

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

fn combine_mut(a: &mut N, b: &N)

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: &N, b: &mut N)

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: N, b: &N) -> N

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

fn combine_right(a: &N, b: N) -> N

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

fn combine_both(a: N, b: N) -> N

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

impl CommutativeOperation<u32> for Min

impl Identity<u32> for Min

fn identity() -> u32

Returns any identity.

impl Operation<u64> for Min

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

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

fn combine_mut(a: &mut N, b: &N)

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: &N, b: &mut N)

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: N, b: &N) -> N

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

fn combine_right(a: &N, b: N) -> N

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

fn combine_both(a: N, b: N) -> N

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

impl CommutativeOperation<u64> for Min

impl Identity<u64> for Min

fn identity() -> u64

Returns any identity.

impl Operation<i8> for Min

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

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

fn combine_mut(a: &mut N, b: &N)

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: &N, b: &mut N)

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: N, b: &N) -> N

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

fn combine_right(a: &N, b: N) -> N

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

fn combine_both(a: N, b: N) -> N

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

impl CommutativeOperation<i8> for Min

impl Identity<i8> for Min

fn identity() -> i8

Returns any identity.

impl Operation<i16> for Min

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

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

fn combine_mut(a: &mut N, b: &N)

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: &N, b: &mut N)

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: N, b: &N) -> N

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

fn combine_right(a: &N, b: N) -> N

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

fn combine_both(a: N, b: N) -> N

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

impl CommutativeOperation<i16> for Min

impl Identity<i16> for Min

fn identity() -> i16

Returns any identity.

impl Operation<i32> for Min

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

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

fn combine_mut(a: &mut N, b: &N)

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: &N, b: &mut N)

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: N, b: &N) -> N

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

fn combine_right(a: &N, b: N) -> N

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

fn combine_both(a: N, b: N) -> N

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

impl CommutativeOperation<i32> for Min

impl Identity<i32> for Min

fn identity() -> i32

Returns any identity.

impl Operation<i64> for Min

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

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

fn combine_mut(a: &mut N, b: &N)

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: &N, b: &mut N)

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: N, b: &N) -> N

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

fn combine_right(a: &N, b: N) -> N

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

fn combine_both(a: N, b: N) -> N

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

impl CommutativeOperation<i64> for Min

impl Identity<i64> for Min

fn identity() -> i64

Returns any identity.

impl Operation<usize> for Min

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

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

fn combine_mut(a: &mut N, b: &N)

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: &N, b: &mut N)

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: N, b: &N) -> N

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

fn combine_right(a: &N, b: N) -> N

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

fn combine_both(a: N, b: N) -> N

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

impl CommutativeOperation<usize> for Min

impl Identity<usize> for Min

fn identity() -> usize

Returns any identity.

impl Operation<isize> for Min

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

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

fn combine_mut(a: &mut N, b: &N)

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: &N, b: &mut N)

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: N, b: &N) -> N

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

fn combine_right(a: &N, b: N) -> N

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

fn combine_both(a: N, b: N) -> N

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

impl CommutativeOperation<isize> for Min

impl Identity<isize> for Min

fn identity() -> isize

Returns any identity.