#[repr(transparent)]pub struct ArraySet<T, const N: usize>(pub [T; N]);Expand description
An array wrapper representing a fixed-size set (modulo duplicate items).
Tuple Fields§
§0: [T; N]Trait Implementations§
Source§impl<T, const N: usize> CollectionMut for ArraySet<T, N>
impl<T, const N: usize> CollectionMut for ArraySet<T, N>
Source§type ItemMut<'a> = &'a mut T
where
Self: 'a
type ItemMut<'a> = &'a mut T where Self: 'a
Type of mutable references to items of the collection.
Source§fn upcast_item_mut<'short, 'long: 'short>(
r: Self::ItemMut<'long>,
) -> Self::ItemMut<'short>where
Self: 'long,
fn upcast_item_mut<'short, 'long: 'short>(
r: Self::ItemMut<'long>,
) -> Self::ItemMut<'short>where
Self: 'long,
Changes an item mutable reference into a shorter lived mutable reference. Read more
Source§impl<T, const N: usize> IntoIterator for ArraySet<T, N>
impl<T, const N: usize> IntoIterator for ArraySet<T, N>
Source§impl<T: Ord, const N: usize> Ord for ArraySet<T, N>
impl<T: Ord, const N: usize> Ord for ArraySet<T, N>
1.21.0 · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
Source§impl<T: PartialOrd, const N: usize> PartialOrd for ArraySet<T, N>
impl<T: PartialOrd, const N: usize> PartialOrd for ArraySet<T, N>
impl<T: Copy, const N: usize> Copy for ArraySet<T, N>
impl<T: Eq, const N: usize> Eq for ArraySet<T, N>
impl<T, const N: usize> StructuralPartialEq for ArraySet<T, N>
Auto Trait Implementations§
impl<T, const N: usize> Freeze for ArraySet<T, N>where
T: Freeze,
impl<T, const N: usize> RefUnwindSafe for ArraySet<T, N>where
T: RefUnwindSafe,
impl<T, const N: usize> Send for ArraySet<T, N>where
T: Send,
impl<T, const N: usize> Sync for ArraySet<T, N>where
T: Sync,
impl<T, const N: usize> Unpin for ArraySet<T, N>where
T: Unpin,
impl<T, const N: usize> UnwindSafe for ArraySet<T, N>where
T: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<'a, I> MultiOps<&'a RoaringBitmap> for Iwhere
I: IntoIterator<Item = &'a RoaringBitmap>,
impl<'a, I> MultiOps<&'a RoaringBitmap> for Iwhere
I: IntoIterator<Item = &'a RoaringBitmap>,
§fn intersection(self) -> <I as MultiOps<&'a RoaringBitmap>>::Output
fn intersection(self) -> <I as MultiOps<&'a RoaringBitmap>>::Output
The
intersection between all elements.§fn difference(self) -> <I as MultiOps<&'a RoaringBitmap>>::Output
fn difference(self) -> <I as MultiOps<&'a RoaringBitmap>>::Output
The
difference between all elements.§fn symmetric_difference(self) -> <I as MultiOps<&'a RoaringBitmap>>::Output
fn symmetric_difference(self) -> <I as MultiOps<&'a RoaringBitmap>>::Output
The
symmetric difference between all elements.§impl<'a, I> MultiOps<&'a RoaringTreemap> for Iwhere
I: IntoIterator<Item = &'a RoaringTreemap>,
impl<'a, I> MultiOps<&'a RoaringTreemap> for Iwhere
I: IntoIterator<Item = &'a RoaringTreemap>,
§fn intersection(self) -> <I as MultiOps<&'a RoaringTreemap>>::Output
fn intersection(self) -> <I as MultiOps<&'a RoaringTreemap>>::Output
The
intersection between all elements.§fn difference(self) -> <I as MultiOps<&'a RoaringTreemap>>::Output
fn difference(self) -> <I as MultiOps<&'a RoaringTreemap>>::Output
The
difference between all elements.§fn symmetric_difference(self) -> <I as MultiOps<&'a RoaringTreemap>>::Output
fn symmetric_difference(self) -> <I as MultiOps<&'a RoaringTreemap>>::Output
The
symmetric difference between all elements.§impl<'a, I, E> MultiOps<Result<&'a RoaringBitmap, E>> for Iwhere
E: 'a,
I: IntoIterator<Item = Result<&'a RoaringBitmap, E>>,
impl<'a, I, E> MultiOps<Result<&'a RoaringBitmap, E>> for Iwhere
E: 'a,
I: IntoIterator<Item = Result<&'a RoaringBitmap, E>>,
§fn union(self) -> <I as MultiOps<Result<&'a RoaringBitmap, E>>>::Output
fn union(self) -> <I as MultiOps<Result<&'a RoaringBitmap, E>>>::Output
The
union between all elements.§fn intersection(self) -> <I as MultiOps<Result<&'a RoaringBitmap, E>>>::Output
fn intersection(self) -> <I as MultiOps<Result<&'a RoaringBitmap, E>>>::Output
The
intersection between all elements.§fn difference(self) -> <I as MultiOps<Result<&'a RoaringBitmap, E>>>::Output
fn difference(self) -> <I as MultiOps<Result<&'a RoaringBitmap, E>>>::Output
The
difference between all elements.§fn symmetric_difference(
self,
) -> <I as MultiOps<Result<&'a RoaringBitmap, E>>>::Output
fn symmetric_difference( self, ) -> <I as MultiOps<Result<&'a RoaringBitmap, E>>>::Output
The
symmetric difference between all elements.§impl<'a, I, E> MultiOps<Result<&'a RoaringTreemap, E>> for Iwhere
E: 'a,
I: IntoIterator<Item = Result<&'a RoaringTreemap, E>>,
impl<'a, I, E> MultiOps<Result<&'a RoaringTreemap, E>> for Iwhere
E: 'a,
I: IntoIterator<Item = Result<&'a RoaringTreemap, E>>,
§fn union(self) -> <I as MultiOps<Result<&'a RoaringTreemap, E>>>::Output
fn union(self) -> <I as MultiOps<Result<&'a RoaringTreemap, E>>>::Output
The
union between all elements.§fn intersection(self) -> <I as MultiOps<Result<&'a RoaringTreemap, E>>>::Output
fn intersection(self) -> <I as MultiOps<Result<&'a RoaringTreemap, E>>>::Output
The
intersection between all elements.§fn difference(self) -> <I as MultiOps<Result<&'a RoaringTreemap, E>>>::Output
fn difference(self) -> <I as MultiOps<Result<&'a RoaringTreemap, E>>>::Output
The
difference between all elements.§fn symmetric_difference(
self,
) -> <I as MultiOps<Result<&'a RoaringTreemap, E>>>::Output
fn symmetric_difference( self, ) -> <I as MultiOps<Result<&'a RoaringTreemap, E>>>::Output
The
symmetric difference between all elements.§impl<I, E> MultiOps<Result<RoaringBitmap, E>> for Iwhere
I: IntoIterator<Item = Result<RoaringBitmap, E>>,
impl<I, E> MultiOps<Result<RoaringBitmap, E>> for Iwhere
I: IntoIterator<Item = Result<RoaringBitmap, E>>,
§fn intersection(self) -> <I as MultiOps<Result<RoaringBitmap, E>>>::Output
fn intersection(self) -> <I as MultiOps<Result<RoaringBitmap, E>>>::Output
The
intersection between all elements.§fn difference(self) -> <I as MultiOps<Result<RoaringBitmap, E>>>::Output
fn difference(self) -> <I as MultiOps<Result<RoaringBitmap, E>>>::Output
The
difference between all elements.§fn symmetric_difference(
self,
) -> <I as MultiOps<Result<RoaringBitmap, E>>>::Output
fn symmetric_difference( self, ) -> <I as MultiOps<Result<RoaringBitmap, E>>>::Output
The
symmetric difference between all elements.§impl<I, E> MultiOps<Result<RoaringTreemap, E>> for Iwhere
I: IntoIterator<Item = Result<RoaringTreemap, E>>,
impl<I, E> MultiOps<Result<RoaringTreemap, E>> for Iwhere
I: IntoIterator<Item = Result<RoaringTreemap, E>>,
§fn union(self) -> <I as MultiOps<Result<RoaringTreemap, E>>>::Output
fn union(self) -> <I as MultiOps<Result<RoaringTreemap, E>>>::Output
The
union between all elements.§fn intersection(self) -> <I as MultiOps<Result<RoaringTreemap, E>>>::Output
fn intersection(self) -> <I as MultiOps<Result<RoaringTreemap, E>>>::Output
The
intersection between all elements.§fn difference(self) -> <I as MultiOps<Result<RoaringTreemap, E>>>::Output
fn difference(self) -> <I as MultiOps<Result<RoaringTreemap, E>>>::Output
The
difference between all elements.§fn symmetric_difference(
self,
) -> <I as MultiOps<Result<RoaringTreemap, E>>>::Output
fn symmetric_difference( self, ) -> <I as MultiOps<Result<RoaringTreemap, E>>>::Output
The
symmetric difference between all elements.§impl<I> MultiOps<RoaringBitmap> for Iwhere
I: IntoIterator<Item = RoaringBitmap>,
impl<I> MultiOps<RoaringBitmap> for Iwhere
I: IntoIterator<Item = RoaringBitmap>,
§fn intersection(self) -> <I as MultiOps<RoaringBitmap>>::Output
fn intersection(self) -> <I as MultiOps<RoaringBitmap>>::Output
The
intersection between all elements.§fn difference(self) -> <I as MultiOps<RoaringBitmap>>::Output
fn difference(self) -> <I as MultiOps<RoaringBitmap>>::Output
The
difference between all elements.§fn symmetric_difference(self) -> <I as MultiOps<RoaringBitmap>>::Output
fn symmetric_difference(self) -> <I as MultiOps<RoaringBitmap>>::Output
The
symmetric difference between all elements.§impl<I> MultiOps<RoaringTreemap> for Iwhere
I: IntoIterator<Item = RoaringTreemap>,
impl<I> MultiOps<RoaringTreemap> for Iwhere
I: IntoIterator<Item = RoaringTreemap>,
§fn intersection(self) -> <I as MultiOps<RoaringTreemap>>::Output
fn intersection(self) -> <I as MultiOps<RoaringTreemap>>::Output
The
intersection between all elements.§fn difference(self) -> <I as MultiOps<RoaringTreemap>>::Output
fn difference(self) -> <I as MultiOps<RoaringTreemap>>::Output
The
difference between all elements.§fn symmetric_difference(self) -> <I as MultiOps<RoaringTreemap>>::Output
fn symmetric_difference(self) -> <I as MultiOps<RoaringTreemap>>::Output
The
symmetric difference between all elements.