Trait wasmer_types::lib::std::ops::BitOr 1.0.0[−][src]
Expand description
The bitwise OR operator |
.
Note that Rhs
is Self
by default, but this is not mandatory.
Examples
An implementation of BitOr
for a wrapper around bool
.
use std::ops::BitOr; #[derive(Debug, PartialEq)] struct Scalar(bool); impl BitOr for Scalar { type Output = Self; // rhs is the "right-hand side" of the expression `a | b` fn bitor(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(true)); assert_eq!(Scalar(false) | Scalar(true), Scalar(true)); assert_eq!(Scalar(false) | Scalar(false), Scalar(false));
An implementation of BitOr
for a wrapper around Vec<bool>
.
use std::ops::BitOr; #[derive(Debug, PartialEq)] struct BooleanVector(Vec<bool>); impl BitOr for BooleanVector { type Output = Self; fn bitor(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, true, true, false]); assert_eq!(bv1 | bv2, expected);
Associated Types
Required methods
Implementations on Foreign Types
impl<'_, '_, T, S> BitOr<&'_ HashSet<T, S>> for &'_ HashSet<T, S> where
T: Eq + Hash + Clone,
S: BuildHasher + Default,
[src]
impl<'_, '_, T, S> BitOr<&'_ HashSet<T, S>> for &'_ HashSet<T, S> where
T: Eq + Hash + Clone,
S: BuildHasher + Default,
[src]pub fn bitor(self, rhs: &HashSet<T, S>) -> HashSet<T, S>
[src]
pub fn bitor(self, rhs: &HashSet<T, S>) -> HashSet<T, S>
[src]Returns the union 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![3, 4, 5].into_iter().collect(); let set = &a | &b; let mut i = 0; let expected = [1, 2, 3, 4, 5]; for x in &set { assert!(expected.contains(x)); i += 1; } assert_eq!(i, expected.len());
type Output = HashSet<T, S>
impl BitOr<u16> for NonZeroU16
[src]
impl BitOr<u16> for NonZeroU16
[src]type Output = NonZeroU16
pub fn bitor(self, rhs: u16) -> <NonZeroU16 as BitOr<u16>>::Output
[src]
impl BitOr<NonZeroU32> for u32
[src]
impl BitOr<NonZeroU32> for u32
[src]type Output = NonZeroU32
pub fn bitor(self, rhs: NonZeroU32) -> <u32 as BitOr<NonZeroU32>>::Output
[src]
impl BitOr<isize> for NonZeroIsize
[src]
impl BitOr<isize> for NonZeroIsize
[src]type Output = NonZeroIsize
pub fn bitor(self, rhs: isize) -> <NonZeroIsize as BitOr<isize>>::Output
[src]
impl BitOr<NonZeroU16> for NonZeroU16
[src]
impl BitOr<NonZeroU16> for NonZeroU16
[src]type Output = NonZeroU16
pub fn bitor(self, rhs: NonZeroU16) -> <NonZeroU16 as BitOr<NonZeroU16>>::Output
[src]
impl BitOr<NonZeroU16> for u16
[src]
impl BitOr<NonZeroU16> for u16
[src]type Output = NonZeroU16
pub fn bitor(self, rhs: NonZeroU16) -> <u16 as BitOr<NonZeroU16>>::Output
[src]
impl BitOr<NonZeroUsize> for usize
[src]
impl BitOr<NonZeroUsize> for usize
[src]type Output = NonZeroUsize
pub fn bitor(self, rhs: NonZeroUsize) -> <usize as BitOr<NonZeroUsize>>::Output
[src]
impl BitOr<NonZeroI128> for i128
[src]
impl BitOr<NonZeroI128> for i128
[src]type Output = NonZeroI128
pub fn bitor(self, rhs: NonZeroI128) -> <i128 as BitOr<NonZeroI128>>::Output
[src]
impl BitOr<NonZeroU64> for u64
[src]
impl BitOr<NonZeroU64> for u64
[src]type Output = NonZeroU64
pub fn bitor(self, rhs: NonZeroU64) -> <u64 as BitOr<NonZeroU64>>::Output
[src]
impl BitOr<NonZeroI16> for NonZeroI16
[src]
impl BitOr<NonZeroI16> for NonZeroI16
[src]type Output = NonZeroI16
pub fn bitor(self, rhs: NonZeroI16) -> <NonZeroI16 as BitOr<NonZeroI16>>::Output
[src]
impl BitOr<i16> for NonZeroI16
[src]
impl BitOr<i16> for NonZeroI16
[src]type Output = NonZeroI16
pub fn bitor(self, rhs: i16) -> <NonZeroI16 as BitOr<i16>>::Output
[src]
impl BitOr<NonZeroI64> for NonZeroI64
[src]
impl BitOr<NonZeroI64> for NonZeroI64
[src]type Output = NonZeroI64
pub fn bitor(self, rhs: NonZeroI64) -> <NonZeroI64 as BitOr<NonZeroI64>>::Output
[src]
impl BitOr<u128> for NonZeroU128
[src]
impl BitOr<u128> for NonZeroU128
[src]type Output = NonZeroU128
pub fn bitor(self, rhs: u128) -> <NonZeroU128 as BitOr<u128>>::Output
[src]
impl BitOr<u32> for NonZeroU32
[src]
impl BitOr<u32> for NonZeroU32
[src]type Output = NonZeroU32
pub fn bitor(self, rhs: u32) -> <NonZeroU32 as BitOr<u32>>::Output
[src]
impl BitOr<NonZeroI64> for i64
[src]
impl BitOr<NonZeroI64> for i64
[src]type Output = NonZeroI64
pub fn bitor(self, rhs: NonZeroI64) -> <i64 as BitOr<NonZeroI64>>::Output
[src]
impl BitOr<i32> for NonZeroI32
[src]
impl BitOr<i32> for NonZeroI32
[src]type Output = NonZeroI32
pub fn bitor(self, rhs: i32) -> <NonZeroI32 as BitOr<i32>>::Output
[src]
impl BitOr<u64> for NonZeroU64
[src]
impl BitOr<u64> for NonZeroU64
[src]type Output = NonZeroU64
pub fn bitor(self, rhs: u64) -> <NonZeroU64 as BitOr<u64>>::Output
[src]
impl BitOr<i128> for NonZeroI128
[src]
impl BitOr<i128> for NonZeroI128
[src]type Output = NonZeroI128
pub fn bitor(self, rhs: i128) -> <NonZeroI128 as BitOr<i128>>::Output
[src]
impl BitOr<NonZeroIsize> for isize
[src]
impl BitOr<NonZeroIsize> for isize
[src]type Output = NonZeroIsize
pub fn bitor(self, rhs: NonZeroIsize) -> <isize as BitOr<NonZeroIsize>>::Output
[src]
impl BitOr<NonZeroIsize> for NonZeroIsize
[src]
impl BitOr<NonZeroIsize> for NonZeroIsize
[src]type Output = NonZeroIsize
pub fn bitor(
self,
rhs: NonZeroIsize
) -> <NonZeroIsize as BitOr<NonZeroIsize>>::Output
[src]
self,
rhs: NonZeroIsize
) -> <NonZeroIsize as BitOr<NonZeroIsize>>::Output
impl BitOr<NonZeroUsize> for NonZeroUsize
[src]
impl BitOr<NonZeroUsize> for NonZeroUsize
[src]type Output = NonZeroUsize
pub fn bitor(
self,
rhs: NonZeroUsize
) -> <NonZeroUsize as BitOr<NonZeroUsize>>::Output
[src]
self,
rhs: NonZeroUsize
) -> <NonZeroUsize as BitOr<NonZeroUsize>>::Output
impl BitOr<NonZeroI32> for i32
[src]
impl BitOr<NonZeroI32> for i32
[src]type Output = NonZeroI32
pub fn bitor(self, rhs: NonZeroI32) -> <i32 as BitOr<NonZeroI32>>::Output
[src]
impl BitOr<NonZeroU64> for NonZeroU64
[src]
impl BitOr<NonZeroU64> for NonZeroU64
[src]type Output = NonZeroU64
pub fn bitor(self, rhs: NonZeroU64) -> <NonZeroU64 as BitOr<NonZeroU64>>::Output
[src]
impl BitOr<NonZeroI32> for NonZeroI32
[src]
impl BitOr<NonZeroI32> for NonZeroI32
[src]type Output = NonZeroI32
pub fn bitor(self, rhs: NonZeroI32) -> <NonZeroI32 as BitOr<NonZeroI32>>::Output
[src]
impl BitOr<NonZeroU32> for NonZeroU32
[src]
impl BitOr<NonZeroU32> for NonZeroU32
[src]type Output = NonZeroU32
pub fn bitor(self, rhs: NonZeroU32) -> <NonZeroU32 as BitOr<NonZeroU32>>::Output
[src]
impl BitOr<NonZeroU128> for NonZeroU128
[src]
impl BitOr<NonZeroU128> for NonZeroU128
[src]type Output = NonZeroU128
pub fn bitor(
self,
rhs: NonZeroU128
) -> <NonZeroU128 as BitOr<NonZeroU128>>::Output
[src]
self,
rhs: NonZeroU128
) -> <NonZeroU128 as BitOr<NonZeroU128>>::Output
impl BitOr<NonZeroI16> for i16
[src]
impl BitOr<NonZeroI16> for i16
[src]type Output = NonZeroI16
pub fn bitor(self, rhs: NonZeroI16) -> <i16 as BitOr<NonZeroI16>>::Output
[src]
impl BitOr<NonZeroU128> for u128
[src]
impl BitOr<NonZeroU128> for u128
[src]type Output = NonZeroU128
pub fn bitor(self, rhs: NonZeroU128) -> <u128 as BitOr<NonZeroU128>>::Output
[src]
impl BitOr<NonZeroI128> for NonZeroI128
[src]
impl BitOr<NonZeroI128> for NonZeroI128
[src]type Output = NonZeroI128
pub fn bitor(
self,
rhs: NonZeroI128
) -> <NonZeroI128 as BitOr<NonZeroI128>>::Output
[src]
self,
rhs: NonZeroI128
) -> <NonZeroI128 as BitOr<NonZeroI128>>::Output
impl BitOr<usize> for NonZeroUsize
[src]
impl BitOr<usize> for NonZeroUsize
[src]type Output = NonZeroUsize
pub fn bitor(self, rhs: usize) -> <NonZeroUsize as BitOr<usize>>::Output
[src]
impl BitOr<i64> for NonZeroI64
[src]
impl BitOr<i64> for NonZeroI64
[src]type Output = NonZeroI64
pub fn bitor(self, rhs: i64) -> <NonZeroI64 as BitOr<i64>>::Output
[src]
impl<'_, '_, T> BitOr<&'_ BTreeSet<T>> for &'_ BTreeSet<T> where
T: Ord + Clone,
[src]
impl<'_, '_, T> BitOr<&'_ BTreeSet<T>> for &'_ BTreeSet<T> where
T: Ord + Clone,
[src]pub fn bitor(self, rhs: &BTreeSet<T>) -> BTreeSet<T>
[src]
pub fn bitor(self, rhs: &BTreeSet<T>) -> BTreeSet<T>
[src]Returns the union of self
and rhs
as a new BTreeSet<T>
.
Examples
use std::collections::BTreeSet; let a: BTreeSet<_> = vec![1, 2, 3].into_iter().collect(); let b: BTreeSet<_> = vec![3, 4, 5].into_iter().collect(); let result = &a | &b; let result_vec: Vec<_> = result.into_iter().collect(); assert_eq!(result_vec, [1, 2, 3, 4, 5]);
type Output = BTreeSet<T>
impl<'_, '_, T, S1, S2> BitOr<&'_ IndexSet<T, S2>> for &'_ IndexSet<T, S1> where
T: Eq + Hash + Clone,
S1: BuildHasher + Default,
S2: BuildHasher,
[src]
impl<'_, '_, T, S1, S2> BitOr<&'_ IndexSet<T, S2>> for &'_ IndexSet<T, S1> where
T: Eq + Hash + Clone,
S1: BuildHasher + Default,
S2: BuildHasher,
[src]pub fn bitor(
self,
other: &IndexSet<T, S2>
) -> <&'_ IndexSet<T, S1> as BitOr<&'_ IndexSet<T, S2>>>::Output
[src]
pub fn bitor(
self,
other: &IndexSet<T, S2>
) -> <&'_ IndexSet<T, S1> as BitOr<&'_ IndexSet<T, S2>>>::Output
[src]Returns the set union, cloned into a new set.
Values from self
are collected in their original order, followed by
values that are unique to other
in their original order.
type Output = IndexSet<T, S1>
impl<'_, '_, T, S> BitOr<&'_ HashSet<T, S>> for &'_ HashSet<T, S> where
T: Eq + Hash + Clone,
S: BuildHasher + Default,
impl<'_, '_, T, S> BitOr<&'_ HashSet<T, S>> for &'_ HashSet<T, S> where
T: Eq + Hash + Clone,
S: BuildHasher + Default,
pub fn bitor(self, rhs: &HashSet<T, S>) -> HashSet<T, S>
pub fn bitor(self, rhs: &HashSet<T, S>) -> HashSet<T, S>
Returns the union of self
and rhs
as a new HashSet<T, S>
.
Examples
use hashbrown::HashSet; let a: HashSet<_> = vec![1, 2, 3].into_iter().collect(); let b: HashSet<_> = vec![3, 4, 5].into_iter().collect(); let set = &a | &b; let mut i = 0; let expected = [1, 2, 3, 4, 5]; for x in &set { assert!(expected.contains(x)); i += 1; } assert_eq!(i, expected.len());