Struct Add

pub struct Add;

Each node contains the sum of the interval it represents.

Trait Implementations

impl Clone for Add

fn clone(&self) -> Add

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Add

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

Formats the value using the given formatter.

impl Default for Add

fn default() -> Add

Returns the “default value” for a type.

impl Hash for Add

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Identity<BigInt> for Add

fn identity(&self) -> BigInt

Returns zero.

impl Identity<BigUint> for Add

fn identity(&self) -> BigUint

Returns zero.

impl Identity<Wrapping<i128>> for Add

fn identity(&self) -> Wrapping<i128>

Returns zero.

impl Identity<Wrapping<i16>> for Add

fn identity(&self) -> Wrapping<i16>

Returns zero.

impl Identity<Wrapping<i32>> for Add

fn identity(&self) -> Wrapping<i32>

Returns zero.

impl Identity<Wrapping<i64>> for Add

fn identity(&self) -> Wrapping<i64>

Returns zero.

impl Identity<Wrapping<i8>> for Add

fn identity(&self) -> Wrapping<i8>

Returns zero.

impl Identity<Wrapping<isize>> for Add

fn identity(&self) -> Wrapping<isize>

Returns zero.

impl Identity<Wrapping<u128>> for Add

fn identity(&self) -> Wrapping<u128>

Returns zero.

impl Identity<Wrapping<u16>> for Add

fn identity(&self) -> Wrapping<u16>

Returns zero.

impl Identity<Wrapping<u32>> for Add

fn identity(&self) -> Wrapping<u32>

Returns zero.

impl Identity<Wrapping<u64>> for Add

fn identity(&self) -> Wrapping<u64>

Returns zero.

impl Identity<Wrapping<u8>> for Add

fn identity(&self) -> Wrapping<u8>

Returns zero.

impl Identity<Wrapping<usize>> for Add

fn identity(&self) -> Wrapping<usize>

Returns zero.

impl Identity<f32> for Add

fn identity(&self) -> f32

Returns zero.

impl Identity<f64> for Add

fn identity(&self) -> f64

Returns zero.

impl Identity<i128> for Add

fn identity(&self) -> i128

Returns zero.

impl Identity<i16> for Add

fn identity(&self) -> i16

Returns zero.

impl Identity<i32> for Add

fn identity(&self) -> i32

Returns zero.

impl Identity<i64> for Add

fn identity(&self) -> i64

Returns zero.

impl Identity<i8> for Add

fn identity(&self) -> i8

Returns zero.

impl Identity<isize> for Add

fn identity(&self) -> isize

Returns zero.

impl Identity<u128> for Add

fn identity(&self) -> u128

Returns zero.

impl Identity<u16> for Add

fn identity(&self) -> u16

Returns zero.

impl Identity<u32> for Add

fn identity(&self) -> u32

Returns zero.

impl Identity<u64> for Add

fn identity(&self) -> u64

Returns zero.

impl Identity<u8> for Add

fn identity(&self) -> u8

Returns zero.

impl Identity<usize> for Add

fn identity(&self) -> usize

Returns zero.

impl Invertible<BigInt> for Add

fn uncombine(&self, a: &mut BigInt, b: &BigInt)

Computes the difference, while reusing memory in a.

impl Invertible<Wrapping<i128>> for Add

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

Returns the difference.

impl Invertible<Wrapping<i16>> for Add

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

Returns the difference.

impl Invertible<Wrapping<i32>> for Add

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

Returns the difference.

impl Invertible<Wrapping<i64>> for Add

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

Returns the difference.

impl Invertible<Wrapping<i8>> for Add

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

Returns the difference.

impl Invertible<Wrapping<isize>> for Add

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

Returns the difference.

impl Invertible<Wrapping<u128>> for Add

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

Returns the difference.

impl Invertible<Wrapping<u16>> for Add

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

Returns the difference.

impl Invertible<Wrapping<u32>> for Add

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

Returns the difference.

impl Invertible<Wrapping<u64>> for Add

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

Returns the difference.

impl Invertible<Wrapping<u8>> for Add

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

Returns the difference.

impl Invertible<Wrapping<usize>> for Add

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

Returns the difference.

impl Invertible<f32> for Add

fn uncombine(&self, a: &mut f32, b: &f32)

Returns the difference.

impl Invertible<f64> for Add

fn uncombine(&self, a: &mut f64, b: &f64)

Returns the difference.

impl Invertible<i128> for Add

fn uncombine(&self, a: &mut i128, b: &i128)

Returns the difference.

impl Invertible<i16> for Add

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

Returns the difference.

impl Invertible<i32> for Add

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

Returns the difference.

impl Invertible<i64> for Add

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

Returns the difference.

impl Invertible<i8> for Add

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

Returns the difference.

impl Invertible<isize> for Add

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

Returns the difference.

impl Operation<BigInt> for Add

fn combine(&self, a: &BigInt, b: &BigInt) -> BigInt

Returns the sum. This usually allocates memory.

fn combine_mut(&self, a: &mut BigInt, b: &BigInt)

Computes the sum while reusing memory in a.

fn combine_mut2(&self, a: &BigInt, b: &mut BigInt)

Computes the sum while reusing memory in b.

fn combine_left(&self, a: BigInt, b: &BigInt) -> BigInt

Computes the sum while reusing memory from a.

fn combine_right(&self, a: &BigInt, b: BigInt) -> BigInt

Computes the sum while reusing memory from b.

fn combine_both(&self, a: BigInt, b: BigInt) -> BigInt

Computes the sum while reusing memory from the larger of a and b.

impl Operation<BigUint> for Add

fn combine(&self, a: &BigUint, b: &BigUint) -> BigUint

Returns the sum. This usually allocates memory.

fn combine_mut(&self, a: &mut BigUint, b: &BigUint)

Computes the sum while reusing memory in a.

fn combine_mut2(&self, a: &BigUint, b: &mut BigUint)

Computes the sum while reusing memory in b.

fn combine_left(&self, a: BigUint, b: &BigUint) -> BigUint

Computes the sum while reusing memory from a.

fn combine_right(&self, a: &BigUint, b: BigUint) -> BigUint

Computes the sum while reusing memory from b.

fn combine_both(&self, a: BigUint, b: BigUint) -> BigUint

Computes the sum while reusing memory from the larger of a and b.

impl Operation<Wrapping<i128>> for Add

fn combine(&self, a: &Wrapping<i128>, b: &Wrapping<i128>) -> Wrapping<i128>

Returns the sum.

fn combine_mut(&self, 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(&self, a: &N, b: &mut N)

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

fn combine_left(&self, 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(&self, 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(&self, 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 Operation<Wrapping<i16>> for Add

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

Returns the sum.

fn combine_mut(&self, 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(&self, a: &N, b: &mut N)

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

fn combine_left(&self, 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(&self, 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(&self, 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 Operation<Wrapping<i32>> for Add

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

Returns the sum.

fn combine_mut(&self, 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(&self, a: &N, b: &mut N)

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

fn combine_left(&self, 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(&self, 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(&self, 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 Operation<Wrapping<i64>> for Add

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

Returns the sum.

fn combine_mut(&self, 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(&self, a: &N, b: &mut N)

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

fn combine_left(&self, 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(&self, 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(&self, 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 Operation<Wrapping<i8>> for Add

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

Returns the sum.

fn combine_mut(&self, 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(&self, a: &N, b: &mut N)

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

fn combine_left(&self, 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(&self, 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(&self, 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 Operation<Wrapping<isize>> for Add

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

Returns the sum.

fn combine_mut(&self, 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(&self, a: &N, b: &mut N)

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

fn combine_left(&self, 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(&self, 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(&self, 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 Operation<Wrapping<u128>> for Add

fn combine(&self, a: &Wrapping<u128>, b: &Wrapping<u128>) -> Wrapping<u128>

Returns the sum.

fn combine_mut(&self, 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(&self, a: &N, b: &mut N)

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

fn combine_left(&self, 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(&self, 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(&self, 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 Operation<Wrapping<u16>> for Add

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

Returns the sum.

fn combine_mut(&self, 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(&self, a: &N, b: &mut N)

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

fn combine_left(&self, 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(&self, 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(&self, 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 Operation<Wrapping<u32>> for Add

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

Returns the sum.

fn combine_mut(&self, 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(&self, a: &N, b: &mut N)

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

fn combine_left(&self, 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(&self, 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(&self, 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 Operation<Wrapping<u64>> for Add

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

Returns the sum.

fn combine_mut(&self, 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(&self, a: &N, b: &mut N)

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

fn combine_left(&self, 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(&self, 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(&self, 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 Operation<Wrapping<u8>> for Add

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

Returns the sum.

fn combine_mut(&self, 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(&self, a: &N, b: &mut N)

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

fn combine_left(&self, 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(&self, 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(&self, 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 Operation<Wrapping<usize>> for Add

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

Returns the sum.

fn combine_mut(&self, 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(&self, a: &N, b: &mut N)

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

fn combine_left(&self, 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(&self, 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(&self, 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 Operation<f32> for Add

fn combine(&self, a: &f32, b: &f32) -> f32

Returns the sum.

fn combine_mut(&self, 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(&self, a: &N, b: &mut N)

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

fn combine_left(&self, 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(&self, 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(&self, 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 Operation<f64> for Add

fn combine(&self, a: &f64, b: &f64) -> f64

Returns the sum.

fn combine_mut(&self, 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(&self, a: &N, b: &mut N)

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

fn combine_left(&self, 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(&self, 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(&self, 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 Operation<i128> for Add

fn combine(&self, a: &i128, b: &i128) -> i128

Returns the sum.

fn combine_mut(&self, 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(&self, a: &N, b: &mut N)

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

fn combine_left(&self, 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(&self, 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(&self, 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 Operation<i16> for Add

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

Returns the sum.

fn combine_mut(&self, 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(&self, a: &N, b: &mut N)

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

fn combine_left(&self, 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(&self, 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(&self, 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 Operation<i32> for Add

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

Returns the sum.

fn combine_mut(&self, 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(&self, a: &N, b: &mut N)

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

fn combine_left(&self, 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(&self, 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(&self, 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 Operation<i64> for Add

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

Returns the sum.

fn combine_mut(&self, 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(&self, a: &N, b: &mut N)

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

fn combine_left(&self, 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(&self, 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(&self, 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 Operation<i8> for Add

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

Returns the sum.

fn combine_mut(&self, 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(&self, a: &N, b: &mut N)

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

fn combine_left(&self, 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(&self, 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(&self, 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 Operation<isize> for Add

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

Returns the sum.

fn combine_mut(&self, 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(&self, a: &N, b: &mut N)

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

fn combine_left(&self, 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(&self, 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(&self, 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 Operation<u128> for Add

fn combine(&self, a: &u128, b: &u128) -> u128

Returns the sum.

fn combine_mut(&self, 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(&self, a: &N, b: &mut N)

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

fn combine_left(&self, 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(&self, 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(&self, 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 Operation<u16> for Add

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

Returns the sum.

fn combine_mut(&self, 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(&self, a: &N, b: &mut N)

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

fn combine_left(&self, 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(&self, 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(&self, 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 Operation<u32> for Add

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

Returns the sum.

fn combine_mut(&self, 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(&self, a: &N, b: &mut N)

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

fn combine_left(&self, 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(&self, 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(&self, 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 Operation<u64> for Add

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

Returns the sum.

fn combine_mut(&self, 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(&self, a: &N, b: &mut N)

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

fn combine_left(&self, 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(&self, 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(&self, 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 Operation<u8> for Add

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

Returns the sum.

fn combine_mut(&self, 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(&self, a: &N, b: &mut N)

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

fn combine_left(&self, 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(&self, 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(&self, 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 Operation<usize> for Add

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

Returns the sum.

fn combine_mut(&self, 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(&self, a: &N, b: &mut N)

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

fn combine_left(&self, 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(&self, 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(&self, 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 Ord for Add

fn cmp(&self, other: &Add) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for Add

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

fn partial_cmp(&self, other: &Add) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Commutative<BigInt> for Add

impl Commutative<BigUint> for Add

impl Commutative<Wrapping<i128>> for Add

impl Commutative<Wrapping<i16>> for Add

impl Commutative<Wrapping<i32>> for Add

impl Commutative<Wrapping<i64>> for Add

impl Commutative<Wrapping<i8>> for Add

impl Commutative<Wrapping<isize>> for Add

impl Commutative<Wrapping<u128>> for Add

impl Commutative<Wrapping<u16>> for Add

impl Commutative<Wrapping<u32>> for Add

impl Commutative<Wrapping<u64>> for Add

impl Commutative<Wrapping<u8>> for Add

impl Commutative<Wrapping<usize>> for Add

impl Commutative<f32> for Add

impl Commutative<f64> for Add

impl Commutative<i128> for Add

impl Commutative<i16> for Add

impl Commutative<i32> for Add

impl Commutative<i64> for Add

impl Commutative<i8> for Add

impl Commutative<isize> for Add

impl Commutative<u128> for Add

impl Commutative<u16> for Add

impl Commutative<u32> for Add

impl Commutative<u64> for Add

impl Commutative<u8> for Add

impl Commutative<usize> for Add

impl Copy for Add

impl Eq for Add

impl StructuralPartialEq for Add