Trait grafix_toolbox::uses::ops::BitAnd 1.0.0[−][src]
Expand description
The bitwise AND operator &.
Note that Rhs is Self by default, but this is not mandatory.
Examples
An implementation of BitAnd for a wrapper around bool.
use std::ops::BitAnd; #[derive(Debug, PartialEq)] struct Scalar(bool); impl BitAnd for Scalar { type Output = Self; // rhs is the "right-hand side" of the expression `a & b` fn bitand(self, rhs: Self) -> Self::Output { Self(self.0 & rhs.0) } } assert_eq!(Scalar(true) & Scalar(true), Scalar(true)); assert_eq!(Scalar(true) & Scalar(false), Scalar(false)); assert_eq!(Scalar(false) & Scalar(true), Scalar(false)); assert_eq!(Scalar(false) & Scalar(false), Scalar(false));
An implementation of BitAnd for a wrapper around Vec<bool>.
use std::ops::BitAnd; #[derive(Debug, PartialEq)] struct BooleanVector(Vec<bool>); impl BitAnd for BooleanVector { type Output = Self; fn bitand(self, Self(rhs): Self) -> Self::Output { let Self(lhs) = self; assert_eq!(lhs.len(), rhs.len()); Self( lhs.iter() .zip(rhs.iter()) .map(|(x, y)| *x & *y) .collect() ) } } let bv1 = BooleanVector(vec![true, true, false, false]); let bv2 = BooleanVector(vec![true, false, true, false]); let expected = BooleanVector(vec![true, false, false, false]); assert_eq!(bv1 & bv2, expected);
Associated Types
Required methods
Implementations on Foreign Types
Returns the intersection of self and rhs as a new HashSet<T, S>.
Examples
use std::collections::HashSet; let a: HashSet<_> = vec![1, 2, 3].into_iter().collect(); let b: HashSet<_> = vec![2, 3, 4].into_iter().collect(); let set = &a & &b; let mut i = 0; let expected = [2, 3]; for x in &set { assert!(expected.contains(x)); i += 1; } assert_eq!(i, expected.len());
Returns the intersection between the two sets of flags.
type Output = JoystickHatsimpl BitAnd<Transformations> for Transformations
impl BitAnd<Transformations> for Transformationspub fn bitand(self, rhs: &AHashSet<T, S>) -> AHashSet<T, S>
pub fn bitand(self, rhs: &AHashSet<T, S>) -> AHashSet<T, S>Returns the intersection of self and rhs as a new AHashSet<T, S>.
Examples
use ahash::AHashSet; let a: AHashSet<_> = vec![1, 2, 3].into_iter().collect(); let b: AHashSet<_> = vec![2, 3, 4].into_iter().collect(); let set = &a & &b; let mut i = 0; let expected = [2, 3]; for x in &set { assert!(expected.contains(x)); i += 1; } assert_eq!(i, expected.len());
type Output = AHashSet<T, S>impl<Ur> BitAnd<Ur> for UTerm where
Ur: Unsigned,
impl<Ur> BitAnd<Ur> for UTerm where
Ur: Unsigned, 0 & X = 0
impl BitAnd<B0> for B1
impl BitAnd<B0> for B1And with 1 ( 1 & 0 = 0)
impl<Ul, Bl, Ur> BitAnd<Ur> for UInt<Ul, Bl> where
Ul: Unsigned,
Ur: Unsigned,
Bl: Bit,
UInt<Ul, Bl>: PrivateAnd<Ur>,
<UInt<Ul, Bl> as PrivateAnd<Ur>>::Output: Trim,
impl<Ul, Bl, Ur> BitAnd<Ur> for UInt<Ul, Bl> where
Ul: Unsigned,
Ur: Unsigned,
Bl: Bit,
UInt<Ul, Bl>: PrivateAnd<Ur>,
<UInt<Ul, Bl> as PrivateAnd<Ur>>::Output: Trim, Anding unsigned integers.
We use our PrivateAnd operator and then Trim the output.
impl<Rhs> BitAnd<Rhs> for B0 where
Rhs: Bit,
impl<Rhs> BitAnd<Rhs> for B0 where
Rhs: Bit, And with 0 ( 0 & B = 0)
impl BitAnd<B1> for B1
impl BitAnd<B1> for B1And with 1 ( 1 & 1 = 1)