pub struct DifferenceSet { /* private fields */ }Expand description
Subset of lhs that does not overlap with rhs.
The iteration order is defined by lhs.
Implementations§
Trait Implementations§
Source§impl AsyncNameSetQuery for DifferenceSet
impl AsyncNameSetQuery for DifferenceSet
Source§fn iter<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = Result<BoxVertexStream>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn iter<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = Result<BoxVertexStream>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Iterate through the set in defined order.
Source§fn iter_rev<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = Result<BoxVertexStream>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn iter_rev<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = Result<BoxVertexStream>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Iterate through the set in the reversed order.
Source§fn contains<'life0, 'life1, 'async_trait>(
&'life0 self,
name: &'life1 VertexName,
) -> Pin<Box<dyn Future<Output = Result<bool>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
'life1: 'async_trait,
fn contains<'life0, 'life1, 'async_trait>(
&'life0 self,
name: &'life1 VertexName,
) -> Pin<Box<dyn Future<Output = Result<bool>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
'life1: 'async_trait,
Test if this set contains a given name.
Source§fn contains_fast<'life0, 'life1, 'async_trait>(
&'life0 self,
name: &'life1 VertexName,
) -> Pin<Box<dyn Future<Output = Result<Option<bool>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
'life1: 'async_trait,
fn contains_fast<'life0, 'life1, 'async_trait>(
&'life0 self,
name: &'life1 VertexName,
) -> Pin<Box<dyn Future<Output = Result<Option<bool>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
'life1: 'async_trait,
Test contains in less than O(N) time.
Returns None if cannot achieve in less than O(N) time.
Source§fn count<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = Result<usize>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn count<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = Result<usize>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Number of names in this set.
Source§fn first<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = Result<Option<VertexName>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn first<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = Result<Option<VertexName>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
The first name in the set.
Source§fn last<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = Result<Option<VertexName>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn last<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = Result<Option<VertexName>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
The last name in the set.
Source§fn is_empty<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = Result<bool>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn is_empty<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = Result<bool>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Test if this set is empty.
Source§fn id_convert(&self) -> Option<&dyn IdConvert>
fn id_convert(&self) -> Option<&dyn IdConvert>
Get an optional IdConvert interface to check hints.
Auto Trait Implementations§
impl !Freeze for DifferenceSet
impl !RefUnwindSafe for DifferenceSet
impl Send for DifferenceSet
impl Sync for DifferenceSet
impl Unpin for DifferenceSet
impl !UnwindSafe for DifferenceSet
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> 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>
Converts
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>
Converts
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> SyncNameSetQuery for Twhere
T: AsyncNameSetQuery,
impl<T> SyncNameSetQuery for Twhere
T: AsyncNameSetQuery,
Source§fn iter(
&self,
) -> Result<Box<dyn NameIter<Item = Result<VertexName, DagError>>>, DagError>
fn iter( &self, ) -> Result<Box<dyn NameIter<Item = Result<VertexName, DagError>>>, DagError>
Iterate through the set in defined order.
Source§fn iter_rev(
&self,
) -> Result<Box<dyn NameIter<Item = Result<VertexName, DagError>>>, DagError>
fn iter_rev( &self, ) -> Result<Box<dyn NameIter<Item = Result<VertexName, DagError>>>, DagError>
Iterate through the set in the reversed order.
Source§fn contains(&self, name: &VertexName) -> Result<bool, DagError>
fn contains(&self, name: &VertexName) -> Result<bool, DagError>
Test if this set contains a given name.
Source§fn id_convert(&self) -> Option<&dyn IdConvert>
fn id_convert(&self) -> Option<&dyn IdConvert>
Get an optional IdConvert interface to check hints.