Struct And

pub struct And;

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

Trait Implementations

impl Clone for And

fn clone(&self) -> And

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for And

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

Formats the value using the given formatter.

impl Default for And

fn default() -> And

Returns the “default value” for a type.

impl Hash for And

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<bool> for And

fn identity(&self) -> bool

Returns true.

impl Identity<i128> for And

fn identity(&self) -> i128

Returns negative one.

impl Identity<i16> for And

fn identity(&self) -> i16

Returns negative one.

impl Identity<i32> for And

fn identity(&self) -> i32

Returns negative one.

impl Identity<i64> for And

fn identity(&self) -> i64

Returns negative one.

impl Identity<i8> for And

fn identity(&self) -> i8

Returns negative one.

impl Identity<isize> for And

fn identity(&self) -> isize

Returns negative one.

impl Identity<u128> for And

fn identity(&self) -> u128

Returns the largest possible value.

impl Identity<u16> for And

fn identity(&self) -> u16

Returns the largest possible value.

impl Identity<u32> for And

fn identity(&self) -> u32

Returns the largest possible value.

impl Identity<u64> for And

fn identity(&self) -> u64

Returns the largest possible value.

impl Identity<u8> for And

fn identity(&self) -> u8

Returns the largest possible value.

impl Identity<usize> for And

fn identity(&self) -> usize

Returns the largest possible value.

impl Operation<bool> for And

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

Returns the boolean and.

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 And

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

Returns the bitwise and.

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 And

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

Returns the bitwise and.

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 And

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

Returns the bitwise and.

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 And

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

Returns the bitwise and.

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 And

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

Returns the bitwise and.

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 And

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

Returns the bitwise and.

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 And

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

Returns the bitwise and.

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 And

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

Returns the bitwise and.

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 And

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

Returns the bitwise and.

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 And

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

Returns the bitwise and.

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 And

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

Returns the bitwise and.

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 And

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

Returns the bitwise and.

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 And

fn cmp(&self, other: &And) -> 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 And

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

fn partial_cmp(&self, other: &And) -> 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<i128> for And

impl Commutative<i16> for And

impl Commutative<i32> for And

impl Commutative<i64> for And

impl Commutative<i8> for And

impl Commutative<isize> for And

impl Commutative<u128> for And

impl Commutative<u16> for And

impl Commutative<u32> for And

impl Commutative<u64> for And

impl Commutative<u8> for And

impl Commutative<usize> for And

impl Copy for And

impl Eq for And

impl StructuralPartialEq for And