Struct segment_tree::ops::And

pub struct And;

Each node contains the bitwise and of the interval it represents.

Trait Implementations

impl Operation<u8> for And

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 And

impl Identity<u8> for And

fn identity() -> u8

Returns any identity.

impl Inverse<u8> for And

fn uncombine(a: &mut u8, b: &u8)

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

impl Operation<Wrapping<u8>> for And

fn combine(a: &Wrapping<u8>, b: &Wrapping<u8>) -> Wrapping<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<Wrapping<u8>> for And

impl Identity<Wrapping<u8>> for And

fn identity() -> Wrapping<u8>

Returns any identity.

impl Inverse<Wrapping<u8>> for And

fn uncombine(a: &mut Wrapping<u8>, b: &Wrapping<u8>)

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

impl Operation<u16> for And

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 And

impl Identity<u16> for And

fn identity() -> u16

Returns any identity.

impl Inverse<u16> for And

fn uncombine(a: &mut u16, b: &u16)

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

impl Operation<Wrapping<u16>> for And

fn combine(a: &Wrapping<u16>, b: &Wrapping<u16>) -> Wrapping<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<Wrapping<u16>> for And

impl Identity<Wrapping<u16>> for And

fn identity() -> Wrapping<u16>

Returns any identity.

impl Inverse<Wrapping<u16>> for And

fn uncombine(a: &mut Wrapping<u16>, b: &Wrapping<u16>)

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

impl Operation<u32> for And

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 And

impl Identity<u32> for And

fn identity() -> u32

Returns any identity.

impl Inverse<u32> for And

fn uncombine(a: &mut u32, b: &u32)

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

impl Operation<Wrapping<u32>> for And

fn combine(a: &Wrapping<u32>, b: &Wrapping<u32>) -> Wrapping<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<Wrapping<u32>> for And

impl Identity<Wrapping<u32>> for And

fn identity() -> Wrapping<u32>

Returns any identity.

impl Inverse<Wrapping<u32>> for And

fn uncombine(a: &mut Wrapping<u32>, b: &Wrapping<u32>)

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

impl Operation<u64> for And

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 And

impl Identity<u64> for And

fn identity() -> u64

Returns any identity.

impl Inverse<u64> for And

fn uncombine(a: &mut u64, b: &u64)

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

impl Operation<Wrapping<u64>> for And

fn combine(a: &Wrapping<u64>, b: &Wrapping<u64>) -> Wrapping<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<Wrapping<u64>> for And

impl Identity<Wrapping<u64>> for And

fn identity() -> Wrapping<u64>

Returns any identity.

impl Inverse<Wrapping<u64>> for And

fn uncombine(a: &mut Wrapping<u64>, b: &Wrapping<u64>)

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

impl Operation<i8> for And

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 And

impl Identity<i8> for And

fn identity() -> i8

Returns any identity.

impl Inverse<i8> for And

fn uncombine(a: &mut i8, b: &i8)

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

impl Operation<Wrapping<i8>> for And

fn combine(a: &Wrapping<i8>, b: &Wrapping<i8>) -> Wrapping<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<Wrapping<i8>> for And

impl Identity<Wrapping<i8>> for And

fn identity() -> Wrapping<i8>

Returns any identity.

impl Inverse<Wrapping<i8>> for And

fn uncombine(a: &mut Wrapping<i8>, b: &Wrapping<i8>)

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

impl Operation<i16> for And

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 And

impl Identity<i16> for And

fn identity() -> i16

Returns any identity.

impl Inverse<i16> for And

fn uncombine(a: &mut i16, b: &i16)

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

impl Operation<Wrapping<i16>> for And

fn combine(a: &Wrapping<i16>, b: &Wrapping<i16>) -> Wrapping<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<Wrapping<i16>> for And

impl Identity<Wrapping<i16>> for And

fn identity() -> Wrapping<i16>

Returns any identity.

impl Inverse<Wrapping<i16>> for And

fn uncombine(a: &mut Wrapping<i16>, b: &Wrapping<i16>)

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

impl Operation<i32> for And

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 And

impl Identity<i32> for And

fn identity() -> i32

Returns any identity.

impl Inverse<i32> for And

fn uncombine(a: &mut i32, b: &i32)

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

impl Operation<Wrapping<i32>> for And

fn combine(a: &Wrapping<i32>, b: &Wrapping<i32>) -> Wrapping<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<Wrapping<i32>> for And

impl Identity<Wrapping<i32>> for And

fn identity() -> Wrapping<i32>

Returns any identity.

impl Inverse<Wrapping<i32>> for And

fn uncombine(a: &mut Wrapping<i32>, b: &Wrapping<i32>)

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

impl Operation<i64> for And

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 And

impl Identity<i64> for And

fn identity() -> i64

Returns any identity.

impl Inverse<i64> for And

fn uncombine(a: &mut i64, b: &i64)

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

impl Operation<Wrapping<i64>> for And

fn combine(a: &Wrapping<i64>, b: &Wrapping<i64>) -> Wrapping<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<Wrapping<i64>> for And

impl Identity<Wrapping<i64>> for And

fn identity() -> Wrapping<i64>

Returns any identity.

impl Inverse<Wrapping<i64>> for And

fn uncombine(a: &mut Wrapping<i64>, b: &Wrapping<i64>)

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

impl Operation<usize> for And

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 And

impl Identity<usize> for And

fn identity() -> usize

Returns any identity.

impl Inverse<usize> for And

fn uncombine(a: &mut usize, b: &usize)

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

impl Operation<Wrapping<usize>> for And

fn combine(a: &Wrapping<usize>, b: &Wrapping<usize>) -> Wrapping<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<Wrapping<usize>> for And

impl Identity<Wrapping<usize>> for And

fn identity() -> Wrapping<usize>

Returns any identity.

impl Inverse<Wrapping<usize>> for And

fn uncombine(a: &mut Wrapping<usize>, b: &Wrapping<usize>)

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

impl Operation<isize> for And

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 And

impl Identity<isize> for And

fn identity() -> isize

Returns any identity.

impl Inverse<isize> for And

fn uncombine(a: &mut isize, b: &isize)

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

impl Operation<Wrapping<isize>> for And

fn combine(a: &Wrapping<isize>, b: &Wrapping<isize>) -> Wrapping<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<Wrapping<isize>> for And

impl Identity<Wrapping<isize>> for And

fn identity() -> Wrapping<isize>

Returns any identity.

impl Inverse<Wrapping<isize>> for And

fn uncombine(a: &mut Wrapping<isize>, b: &Wrapping<isize>)

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