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
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 = NonZeroUsize
type Output = NonZeroIsize
type Output = NonZeroU128
type Output = NonZeroIsize
type Output = NonZeroI16
type Output = NonZeroU64
type Output = NonZeroI32
type Output = NonZeroU32
type Output = NonZeroI32
type Output = NonZeroU64
type Output = NonZeroI32
type Output = NonZeroUsize
type Output = NonZeroI64
type Output = NonZeroI128
type Output = NonZeroUsize
type Output = NonZeroU16
type Output = NonZeroI128
type Output = NonZeroI128
type Output = NonZeroU64
type Output = NonZeroI64
type Output = NonZeroU128
type Output = NonZeroI64
type Output = NonZeroU16
type Output = NonZeroI16
type Output = NonZeroIsize
type Output = NonZeroU128
type Output = NonZeroI16
type Output = NonZeroU32
type Output = NonZeroU32
type Output = NonZeroU16
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]);
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]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.
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());
type Output = HashSet<T, S>