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
sourceimpl<'_, '_, 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,
sourcefn bitor(self, rhs: &HashSet<T, S>) -> HashSet<T, S>
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 std::collections::HashSet;
let a = HashSet::from([1, 2, 3]);
let b = HashSet::from([3, 4, 5]);
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>
1.45.0 (const: unstable) · sourceimpl BitOr<NonZeroUsize> for usize
impl BitOr<NonZeroUsize> for usize
type Output = NonZeroUsize
fn bitor(self, rhs: NonZeroUsize) -> <usize as BitOr<NonZeroUsize>>::Output
1.45.0 (const: unstable) · sourceimpl BitOr<NonZeroI16> for i16
impl BitOr<NonZeroI16> for i16
type Output = NonZeroI16
fn bitor(self, rhs: NonZeroI16) -> <i16 as BitOr<NonZeroI16>>::Output
1.45.0 (const: unstable) · sourceimpl BitOr<NonZeroI64> for i64
impl BitOr<NonZeroI64> for i64
type Output = NonZeroI64
fn bitor(self, rhs: NonZeroI64) -> <i64 as BitOr<NonZeroI64>>::Output
1.45.0 (const: unstable) · sourceimpl BitOr<NonZeroIsize> for isize
impl BitOr<NonZeroIsize> for isize
type Output = NonZeroIsize
fn bitor(self, rhs: NonZeroIsize) -> <isize as BitOr<NonZeroIsize>>::Output
1.45.0 (const: unstable) · sourceimpl BitOr<NonZeroU128> for u128
impl BitOr<NonZeroU128> for u128
type Output = NonZeroU128
fn bitor(self, rhs: NonZeroU128) -> <u128 as BitOr<NonZeroU128>>::Output
sourceimpl<T, const LANES: usize> BitOr<Mask<T, LANES>> for bool where
T: MaskElement,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> BitOr<Mask<T, LANES>> for bool where
T: MaskElement,
LaneCount<LANES>: SupportedLaneCount,
1.45.0 (const: unstable) · sourceimpl BitOr<NonZeroU64> for u64
impl BitOr<NonZeroU64> for u64
type Output = NonZeroU64
fn bitor(self, rhs: NonZeroU64) -> <u64 as BitOr<NonZeroU64>>::Output
1.45.0 (const: unstable) · sourceimpl BitOr<NonZeroU32> for u32
impl BitOr<NonZeroU32> for u32
type Output = NonZeroU32
fn bitor(self, rhs: NonZeroU32) -> <u32 as BitOr<NonZeroU32>>::Output
1.45.0 (const: unstable) · sourceimpl BitOr<NonZeroI32> for i32
impl BitOr<NonZeroI32> for i32
type Output = NonZeroI32
fn bitor(self, rhs: NonZeroI32) -> <i32 as BitOr<NonZeroI32>>::Output
1.45.0 (const: unstable) · sourceimpl BitOr<NonZeroI128> for i128
impl BitOr<NonZeroI128> for i128
type Output = NonZeroI128
fn bitor(self, rhs: NonZeroI128) -> <i128 as BitOr<NonZeroI128>>::Output
1.45.0 (const: unstable) · sourceimpl BitOr<NonZeroU16> for u16
impl BitOr<NonZeroU16> for u16
type Output = NonZeroU16
fn bitor(self, rhs: NonZeroU16) -> <u16 as BitOr<NonZeroU16>>::Output
sourceimpl<'_, '_, T> BitOr<&'_ BTreeSet<T>> for &'_ BTreeSet<T> where
T: Ord + Clone,
impl<'_, '_, T> BitOr<&'_ BTreeSet<T>> for &'_ BTreeSet<T> where
T: Ord + Clone,
sourcefn bitor(self, rhs: &BTreeSet<T>) -> BTreeSet<T>
fn bitor(self, rhs: &BTreeSet<T>) -> BTreeSet<T>
Returns the union of self
and rhs
as a new BTreeSet<T>
.
Examples
use std::collections::BTreeSet;
let a = BTreeSet::from([1, 2, 3]);
let b = BTreeSet::from([3, 4, 5]);
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>
sourceimpl<'_, '_, T, S1, S2> BitOr<&'_ IndexSet<T, S2>> for &'_ IndexSet<T, S1> where
T: Eq + Hash + Clone,
S1: BuildHasher + Default,
S2: BuildHasher,
impl<'_, '_, T, S1, S2> BitOr<&'_ IndexSet<T, S2>> for &'_ IndexSet<T, S1> where
T: Eq + Hash + Clone,
S1: BuildHasher + Default,
S2: BuildHasher,
sourcefn bitor(
self,
other: &IndexSet<T, S2>
) -> <&'_ IndexSet<T, S1> as BitOr<&'_ IndexSet<T, S2>>>::Output
fn bitor(
self,
other: &IndexSet<T, S2>
) -> <&'_ IndexSet<T, S1> as BitOr<&'_ IndexSet<T, S2>>>::Output
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>
sourceimpl<'_, '_, T, S, A> BitOr<&'_ HashSet<T, S, A>> for &'_ HashSet<T, S, A> where
T: Eq + Hash + Clone,
S: BuildHasher + Default,
A: Allocator + Clone,
impl<'_, '_, T, S, A> BitOr<&'_ HashSet<T, S, A>> for &'_ HashSet<T, S, A> where
T: Eq + Hash + Clone,
S: BuildHasher + Default,
A: Allocator + Clone,
sourcefn bitor(self, rhs: &HashSet<T, S, A>) -> HashSet<T, S, Global>
fn bitor(self, rhs: &HashSet<T, S, A>) -> HashSet<T, S, Global>
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());