pub struct OneOrMany<T> { /* private fields */ }Expand description
Struct containing either a single item or a list of items of type T.
If a single item is present, first will contain it and rest will be empty.
If multiple items are present, first will contain the first item and rest will contain the rest.
IMPORTANT: this struct cannot be created with an empty vector.
OneOrMany objects can only be created using OneOrMany::from() or OneOrMany::try_from().
Implementations§
Source§impl<T> OneOrMany<T>where
T: Clone,
impl<T> OneOrMany<T>where
T: Clone,
Sourcepub fn push(&mut self, item: T)
pub fn push(&mut self, item: T)
After OneOrMany<T> is created, add an item of type T to the rest.
Sourcepub fn insert(&mut self, index: usize, item: T)
pub fn insert(&mut self, index: usize, item: T)
After OneOrMany<T> is created, insert an item of type T at an index.
Sourcepub fn is_empty(&self) -> bool
pub fn is_empty(&self) -> bool
If OneOrMany<T> is empty. This will always be false because you cannot create an empty OneOrMany<T>.
This method is required when the method len exists.
Sourcepub fn many<I>(items: I) -> Result<OneOrMany<T>, EmptyListError>where
I: IntoIterator<Item = T>,
pub fn many<I>(items: I) -> Result<OneOrMany<T>, EmptyListError>where
I: IntoIterator<Item = T>,
Create a OneOrMany object with a vector of items of any type.
Sourcepub fn merge<I>(one_or_many_items: I) -> Result<OneOrMany<T>, EmptyListError>where
I: IntoIterator<Item = OneOrMany<T>>,
pub fn merge<I>(one_or_many_items: I) -> Result<OneOrMany<T>, EmptyListError>where
I: IntoIterator<Item = OneOrMany<T>>,
Merge a list of OneOrMany items into a single OneOrMany item.
pub fn iter(&self) -> Iter<'_, T> ⓘ
pub fn iter_mut(&mut self) -> IterMut<'_, T> ⓘ
Trait Implementations§
Source§impl<'de, T> Deserialize<'de> for OneOrMany<T>where
T: Deserialize<'de> + Clone,
impl<'de, T> Deserialize<'de> for OneOrMany<T>where
T: Deserialize<'de> + Clone,
Source§fn deserialize<D>(
deserializer: D,
) -> Result<OneOrMany<T>, <D as Deserializer<'de>>::Error>where
D: Deserializer<'de>,
fn deserialize<D>(
deserializer: D,
) -> Result<OneOrMany<T>, <D as Deserializer<'de>>::Error>where
D: Deserializer<'de>,
Source§impl<T> IntoIterator for OneOrMany<T>where
T: Clone,
Implement Iterator for IntoIter<T>.
impl<T> IntoIterator for OneOrMany<T>where
T: Clone,
Implement Iterator for IntoIter<T>.
Source§impl<T> Serialize for OneOrMany<T>
impl<T> Serialize for OneOrMany<T>
Source§fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>where
S: Serializer,
fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>where
S: Serializer,
impl<T> Eq for OneOrMany<T>where
T: Eq,
impl<T> StructuralPartialEq for OneOrMany<T>
Auto Trait Implementations§
impl<T> Freeze for OneOrMany<T>where
T: Freeze,
impl<T> RefUnwindSafe for OneOrMany<T>where
T: RefUnwindSafe,
impl<T> Send for OneOrMany<T>where
T: Send,
impl<T> Sync for OneOrMany<T>where
T: Sync,
impl<T> Unpin for OneOrMany<T>where
T: Unpin,
impl<T> UnsafeUnpin for OneOrMany<T>where
T: UnsafeUnpin,
impl<T> UnwindSafe for OneOrMany<T>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
Source§impl<T> CloneDebuggableStorage for Twhere
T: DebuggableStorage + Clone,
impl<T> CloneDebuggableStorage for Twhere
T: DebuggableStorage + Clone,
fn clone_storage(&self) -> Box<dyn CloneDebuggableStorage>
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> CloneableStorage for T
impl<T> CloneableStorage for T
fn clone_storage(&self) -> Box<dyn CloneableStorage>
Source§impl<I, C> CompactStringExt for C
impl<I, C> CompactStringExt for C
Source§fn concat_compact(self) -> CompactString
fn concat_compact(self) -> CompactString
CompactString Read moreSource§fn join_compact<S>(self, separator: S) -> CompactString
fn join_compact<S>(self, separator: S) -> CompactString
CompactString Read moreSource§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be
downcast into Box<dyn ConcreteType> where ConcreteType implements Trait.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait> (where Trait: Downcast) to Rc<Any>, which can then be further
downcast into Rc<ConcreteType> where ConcreteType implements Trait.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.Source§impl<T> DowncastSend for T
impl<T> DowncastSend for T
Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.Source§impl<T> FmtForward for T
impl<T> FmtForward for T
Source§fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
self to use its Binary implementation when Debug-formatted.Source§fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
self to use its Display implementation when
Debug-formatted.Source§fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
self to use its LowerExp implementation when
Debug-formatted.Source§fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
self to use its LowerHex implementation when
Debug-formatted.Source§fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
self to use its Octal implementation when Debug-formatted.Source§fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
self to use its Pointer implementation when
Debug-formatted.Source§fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
self to use its UpperExp implementation when
Debug-formatted.Source§fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
self to use its UpperHex implementation when
Debug-formatted.Source§impl<T> FutureExt for T
impl<T> FutureExt for T
Source§fn with_context(self, otel_cx: Context) -> WithContext<Self>
fn with_context(self, otel_cx: Context) -> WithContext<Self>
Source§fn with_current_context(self) -> WithContext<Self>
fn with_current_context(self) -> WithContext<Self>
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
Source§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
T in a tonic::RequestSource§impl<T> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
Source§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
T in a tonic::RequestSource§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>,
Source§type Output = RoaringBitmap
type Output = RoaringBitmap
Source§fn intersection(self) -> <I as MultiOps<&'a RoaringBitmap>>::Output
fn intersection(self) -> <I as MultiOps<&'a RoaringBitmap>>::Output
intersection between all elements.Source§fn difference(self) -> <I as MultiOps<&'a RoaringBitmap>>::Output
fn difference(self) -> <I as MultiOps<&'a RoaringBitmap>>::Output
difference between all elements.Source§fn symmetric_difference(self) -> <I as MultiOps<&'a RoaringBitmap>>::Output
fn symmetric_difference(self) -> <I as MultiOps<&'a RoaringBitmap>>::Output
symmetric difference between all elements.Source§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>,
Source§type Output = RoaringBitmap
type Output = RoaringBitmap
Source§fn intersection(self) -> <I as MultiOps<&'a RoaringBitmap>>::Output
fn intersection(self) -> <I as MultiOps<&'a RoaringBitmap>>::Output
intersection between all elements.Source§fn difference(self) -> <I as MultiOps<&'a RoaringBitmap>>::Output
fn difference(self) -> <I as MultiOps<&'a RoaringBitmap>>::Output
difference between all elements.Source§fn symmetric_difference(self) -> <I as MultiOps<&'a RoaringBitmap>>::Output
fn symmetric_difference(self) -> <I as MultiOps<&'a RoaringBitmap>>::Output
symmetric difference between all elements.Source§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>,
Source§type Output = RoaringTreemap
type Output = RoaringTreemap
Source§fn intersection(self) -> <I as MultiOps<&'a RoaringTreemap>>::Output
fn intersection(self) -> <I as MultiOps<&'a RoaringTreemap>>::Output
intersection between all elements.Source§fn difference(self) -> <I as MultiOps<&'a RoaringTreemap>>::Output
fn difference(self) -> <I as MultiOps<&'a RoaringTreemap>>::Output
difference between all elements.Source§fn symmetric_difference(self) -> <I as MultiOps<&'a RoaringTreemap>>::Output
fn symmetric_difference(self) -> <I as MultiOps<&'a RoaringTreemap>>::Output
symmetric difference between all elements.Source§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>,
Source§type Output = RoaringTreemap
type Output = RoaringTreemap
Source§fn intersection(self) -> <I as MultiOps<&'a RoaringTreemap>>::Output
fn intersection(self) -> <I as MultiOps<&'a RoaringTreemap>>::Output
intersection between all elements.Source§fn difference(self) -> <I as MultiOps<&'a RoaringTreemap>>::Output
fn difference(self) -> <I as MultiOps<&'a RoaringTreemap>>::Output
difference between all elements.Source§fn symmetric_difference(self) -> <I as MultiOps<&'a RoaringTreemap>>::Output
fn symmetric_difference(self) -> <I as MultiOps<&'a RoaringTreemap>>::Output
symmetric difference between all elements.Source§impl<'a, I, E> MultiOps<Result<&'a RoaringBitmap, E>> for I
impl<'a, I, E> MultiOps<Result<&'a RoaringBitmap, E>> for I
Source§type Output = Result<RoaringBitmap, E>
type Output = Result<RoaringBitmap, E>
Source§fn union(self) -> <I as MultiOps<Result<&'a RoaringBitmap, E>>>::Output
fn union(self) -> <I as MultiOps<Result<&'a RoaringBitmap, E>>>::Output
union between all elements.Source§fn intersection(self) -> <I as MultiOps<Result<&'a RoaringBitmap, E>>>::Output
fn intersection(self) -> <I as MultiOps<Result<&'a RoaringBitmap, E>>>::Output
intersection between all elements.Source§fn difference(self) -> <I as MultiOps<Result<&'a RoaringBitmap, E>>>::Output
fn difference(self) -> <I as MultiOps<Result<&'a RoaringBitmap, E>>>::Output
difference between all elements.Source§fn symmetric_difference(
self,
) -> <I as MultiOps<Result<&'a RoaringBitmap, E>>>::Output
fn symmetric_difference( self, ) -> <I as MultiOps<Result<&'a RoaringBitmap, E>>>::Output
symmetric difference between all elements.Source§impl<'a, I, E> MultiOps<Result<&'a RoaringBitmap, E>> for I
impl<'a, I, E> MultiOps<Result<&'a RoaringBitmap, E>> for I
Source§type Output = Result<RoaringBitmap, E>
type Output = Result<RoaringBitmap, E>
Source§fn union(self) -> <I as MultiOps<Result<&'a RoaringBitmap, E>>>::Output
fn union(self) -> <I as MultiOps<Result<&'a RoaringBitmap, E>>>::Output
union between all elements.Source§fn intersection(self) -> <I as MultiOps<Result<&'a RoaringBitmap, E>>>::Output
fn intersection(self) -> <I as MultiOps<Result<&'a RoaringBitmap, E>>>::Output
intersection between all elements.Source§fn difference(self) -> <I as MultiOps<Result<&'a RoaringBitmap, E>>>::Output
fn difference(self) -> <I as MultiOps<Result<&'a RoaringBitmap, E>>>::Output
difference between all elements.Source§fn symmetric_difference(
self,
) -> <I as MultiOps<Result<&'a RoaringBitmap, E>>>::Output
fn symmetric_difference( self, ) -> <I as MultiOps<Result<&'a RoaringBitmap, E>>>::Output
symmetric difference between all elements.Source§impl<'a, I, E> MultiOps<Result<&'a RoaringTreemap, E>> for I
impl<'a, I, E> MultiOps<Result<&'a RoaringTreemap, E>> for I
Source§type Output = Result<RoaringTreemap, E>
type Output = Result<RoaringTreemap, E>
Source§fn union(self) -> <I as MultiOps<Result<&'a RoaringTreemap, E>>>::Output
fn union(self) -> <I as MultiOps<Result<&'a RoaringTreemap, E>>>::Output
union between all elements.Source§fn intersection(self) -> <I as MultiOps<Result<&'a RoaringTreemap, E>>>::Output
fn intersection(self) -> <I as MultiOps<Result<&'a RoaringTreemap, E>>>::Output
intersection between all elements.Source§fn difference(self) -> <I as MultiOps<Result<&'a RoaringTreemap, E>>>::Output
fn difference(self) -> <I as MultiOps<Result<&'a RoaringTreemap, E>>>::Output
difference between all elements.Source§fn symmetric_difference(
self,
) -> <I as MultiOps<Result<&'a RoaringTreemap, E>>>::Output
fn symmetric_difference( self, ) -> <I as MultiOps<Result<&'a RoaringTreemap, E>>>::Output
symmetric difference between all elements.Source§impl<'a, I, E> MultiOps<Result<&'a RoaringTreemap, E>> for I
impl<'a, I, E> MultiOps<Result<&'a RoaringTreemap, E>> for I
Source§type Output = Result<RoaringTreemap, E>
type Output = Result<RoaringTreemap, E>
Source§fn union(self) -> <I as MultiOps<Result<&'a RoaringTreemap, E>>>::Output
fn union(self) -> <I as MultiOps<Result<&'a RoaringTreemap, E>>>::Output
union between all elements.Source§fn intersection(self) -> <I as MultiOps<Result<&'a RoaringTreemap, E>>>::Output
fn intersection(self) -> <I as MultiOps<Result<&'a RoaringTreemap, E>>>::Output
intersection between all elements.Source§fn difference(self) -> <I as MultiOps<Result<&'a RoaringTreemap, E>>>::Output
fn difference(self) -> <I as MultiOps<Result<&'a RoaringTreemap, E>>>::Output
difference between all elements.Source§fn symmetric_difference(
self,
) -> <I as MultiOps<Result<&'a RoaringTreemap, E>>>::Output
fn symmetric_difference( self, ) -> <I as MultiOps<Result<&'a RoaringTreemap, E>>>::Output
symmetric difference between all elements.Source§impl<I, E> MultiOps<Result<RoaringBitmap, E>> for I
impl<I, E> MultiOps<Result<RoaringBitmap, E>> for I
Source§type Output = Result<RoaringBitmap, E>
type Output = Result<RoaringBitmap, E>
Source§fn union(self) -> <I as MultiOps<Result<RoaringBitmap, E>>>::Output
fn union(self) -> <I as MultiOps<Result<RoaringBitmap, E>>>::Output
union between all elements.Source§fn intersection(self) -> <I as MultiOps<Result<RoaringBitmap, E>>>::Output
fn intersection(self) -> <I as MultiOps<Result<RoaringBitmap, E>>>::Output
intersection between all elements.Source§fn difference(self) -> <I as MultiOps<Result<RoaringBitmap, E>>>::Output
fn difference(self) -> <I as MultiOps<Result<RoaringBitmap, E>>>::Output
difference between all elements.Source§fn symmetric_difference(
self,
) -> <I as MultiOps<Result<RoaringBitmap, E>>>::Output
fn symmetric_difference( self, ) -> <I as MultiOps<Result<RoaringBitmap, E>>>::Output
symmetric difference between all elements.Source§impl<I, E> MultiOps<Result<RoaringBitmap, E>> for I
impl<I, E> MultiOps<Result<RoaringBitmap, E>> for I
Source§type Output = Result<RoaringBitmap, E>
type Output = Result<RoaringBitmap, E>
Source§fn union(self) -> <I as MultiOps<Result<RoaringBitmap, E>>>::Output
fn union(self) -> <I as MultiOps<Result<RoaringBitmap, E>>>::Output
union between all elements.Source§fn intersection(self) -> <I as MultiOps<Result<RoaringBitmap, E>>>::Output
fn intersection(self) -> <I as MultiOps<Result<RoaringBitmap, E>>>::Output
intersection between all elements.Source§fn difference(self) -> <I as MultiOps<Result<RoaringBitmap, E>>>::Output
fn difference(self) -> <I as MultiOps<Result<RoaringBitmap, E>>>::Output
difference between all elements.Source§fn symmetric_difference(
self,
) -> <I as MultiOps<Result<RoaringBitmap, E>>>::Output
fn symmetric_difference( self, ) -> <I as MultiOps<Result<RoaringBitmap, E>>>::Output
symmetric difference between all elements.Source§impl<I, E> MultiOps<Result<RoaringTreemap, E>> for I
impl<I, E> MultiOps<Result<RoaringTreemap, E>> for I
Source§type Output = Result<RoaringTreemap, E>
type Output = Result<RoaringTreemap, E>
Source§fn union(self) -> <I as MultiOps<Result<RoaringTreemap, E>>>::Output
fn union(self) -> <I as MultiOps<Result<RoaringTreemap, E>>>::Output
union between all elements.Source§fn intersection(self) -> <I as MultiOps<Result<RoaringTreemap, E>>>::Output
fn intersection(self) -> <I as MultiOps<Result<RoaringTreemap, E>>>::Output
intersection between all elements.Source§fn difference(self) -> <I as MultiOps<Result<RoaringTreemap, E>>>::Output
fn difference(self) -> <I as MultiOps<Result<RoaringTreemap, E>>>::Output
difference between all elements.Source§fn symmetric_difference(
self,
) -> <I as MultiOps<Result<RoaringTreemap, E>>>::Output
fn symmetric_difference( self, ) -> <I as MultiOps<Result<RoaringTreemap, E>>>::Output
symmetric difference between all elements.Source§impl<I, E> MultiOps<Result<RoaringTreemap, E>> for I
impl<I, E> MultiOps<Result<RoaringTreemap, E>> for I
Source§type Output = Result<RoaringTreemap, E>
type Output = Result<RoaringTreemap, E>
Source§fn union(self) -> <I as MultiOps<Result<RoaringTreemap, E>>>::Output
fn union(self) -> <I as MultiOps<Result<RoaringTreemap, E>>>::Output
union between all elements.Source§fn intersection(self) -> <I as MultiOps<Result<RoaringTreemap, E>>>::Output
fn intersection(self) -> <I as MultiOps<Result<RoaringTreemap, E>>>::Output
intersection between all elements.Source§fn difference(self) -> <I as MultiOps<Result<RoaringTreemap, E>>>::Output
fn difference(self) -> <I as MultiOps<Result<RoaringTreemap, E>>>::Output
difference between all elements.Source§fn symmetric_difference(
self,
) -> <I as MultiOps<Result<RoaringTreemap, E>>>::Output
fn symmetric_difference( self, ) -> <I as MultiOps<Result<RoaringTreemap, E>>>::Output
symmetric difference between all elements.Source§impl<I> MultiOps<RoaringBitmap> for Iwhere
I: IntoIterator<Item = RoaringBitmap>,
impl<I> MultiOps<RoaringBitmap> for Iwhere
I: IntoIterator<Item = RoaringBitmap>,
Source§type Output = RoaringBitmap
type Output = RoaringBitmap
Source§fn intersection(self) -> <I as MultiOps<RoaringBitmap>>::Output
fn intersection(self) -> <I as MultiOps<RoaringBitmap>>::Output
intersection between all elements.Source§fn difference(self) -> <I as MultiOps<RoaringBitmap>>::Output
fn difference(self) -> <I as MultiOps<RoaringBitmap>>::Output
difference between all elements.Source§fn symmetric_difference(self) -> <I as MultiOps<RoaringBitmap>>::Output
fn symmetric_difference(self) -> <I as MultiOps<RoaringBitmap>>::Output
symmetric difference between all elements.Source§impl<I> MultiOps<RoaringBitmap> for Iwhere
I: IntoIterator<Item = RoaringBitmap>,
impl<I> MultiOps<RoaringBitmap> for Iwhere
I: IntoIterator<Item = RoaringBitmap>,
Source§type Output = RoaringBitmap
type Output = RoaringBitmap
Source§fn intersection(self) -> <I as MultiOps<RoaringBitmap>>::Output
fn intersection(self) -> <I as MultiOps<RoaringBitmap>>::Output
intersection between all elements.Source§fn difference(self) -> <I as MultiOps<RoaringBitmap>>::Output
fn difference(self) -> <I as MultiOps<RoaringBitmap>>::Output
difference between all elements.Source§fn symmetric_difference(self) -> <I as MultiOps<RoaringBitmap>>::Output
fn symmetric_difference(self) -> <I as MultiOps<RoaringBitmap>>::Output
symmetric difference between all elements.Source§impl<I> MultiOps<RoaringTreemap> for Iwhere
I: IntoIterator<Item = RoaringTreemap>,
impl<I> MultiOps<RoaringTreemap> for Iwhere
I: IntoIterator<Item = RoaringTreemap>,
Source§type Output = RoaringTreemap
type Output = RoaringTreemap
Source§fn intersection(self) -> <I as MultiOps<RoaringTreemap>>::Output
fn intersection(self) -> <I as MultiOps<RoaringTreemap>>::Output
intersection between all elements.Source§fn difference(self) -> <I as MultiOps<RoaringTreemap>>::Output
fn difference(self) -> <I as MultiOps<RoaringTreemap>>::Output
difference between all elements.Source§fn symmetric_difference(self) -> <I as MultiOps<RoaringTreemap>>::Output
fn symmetric_difference(self) -> <I as MultiOps<RoaringTreemap>>::Output
symmetric difference between all elements.Source§impl<I> MultiOps<RoaringTreemap> for Iwhere
I: IntoIterator<Item = RoaringTreemap>,
impl<I> MultiOps<RoaringTreemap> for Iwhere
I: IntoIterator<Item = RoaringTreemap>,
Source§type Output = RoaringTreemap
type Output = RoaringTreemap
Source§fn intersection(self) -> <I as MultiOps<RoaringTreemap>>::Output
fn intersection(self) -> <I as MultiOps<RoaringTreemap>>::Output
intersection between all elements.Source§fn difference(self) -> <I as MultiOps<RoaringTreemap>>::Output
fn difference(self) -> <I as MultiOps<RoaringTreemap>>::Output
difference between all elements.Source§fn symmetric_difference(self) -> <I as MultiOps<RoaringTreemap>>::Output
fn symmetric_difference(self) -> <I as MultiOps<RoaringTreemap>>::Output
symmetric difference between all elements.Source§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
Source§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
Source§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
self and passes that borrow into the pipe function. Read moreSource§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
self and passes that borrow into the pipe function. Read moreSource§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
Source§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R,
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
Source§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
self, then passes self.as_ref() into the pipe function.Source§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
self, then passes self.as_mut() into the pipe
function.Source§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
self, then passes self.deref() into the pipe function.Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
Source§impl<T> Tap for T
impl<T> Tap for T
Source§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Borrow<B> of a value. Read moreSource§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
BorrowMut<B> of a value. Read moreSource§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
AsRef<R> view of a value. Read moreSource§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
AsMut<R> view of a value. Read moreSource§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Deref::Target of a value. Read moreSource§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Deref::Target of a value. Read moreSource§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
.tap() only in debug builds, and is erased in release builds.Source§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
.tap_mut() only in debug builds, and is erased in release
builds.Source§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
.tap_borrow() only in debug builds, and is erased in release
builds.Source§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
.tap_borrow_mut() only in debug builds, and is erased in release
builds.Source§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
.tap_ref() only in debug builds, and is erased in release
builds.Source§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
.tap_ref_mut() only in debug builds, and is erased in release
builds.Source§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
.tap_deref() only in debug builds, and is erased in release
builds.