pub struct IdStaticSet { /* private fields */ }Expand description
A set backed by IdSet + [IdMap].
Efficient for DAG calculation.
Implementations§
Source§impl IdStaticSet
impl IdStaticSet
Trait Implementations§
Source§impl AsyncSetQuery for IdStaticSet
impl AsyncSetQuery for IdStaticSet
Source§fn specialized_flatten_id(&self) -> Option<Cow<'_, IdStaticSet>>
fn specialized_flatten_id(&self) -> Option<Cow<'_, IdStaticSet>>
Specialized “flatten_id” implementation.
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 count<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = Result<u64>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn count<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = Result<u64>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Number of names in this set. Do not override. Read more
Source§fn count_slow<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = Result<u64>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn count_slow<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = Result<u64>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
“Slow” count implementation. Intended to be overridden. Read more
Source§fn size_hint<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = (u64, Option<u64>)> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn size_hint<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = (u64, Option<u64>)> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Returns the bounds on the length of the set as a hint.
The first item is the lower bound.
The second item is the upper bound.
This method should not block on long operations like waiting for network.
Source§fn first<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = Result<Option<Vertex>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn first<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = Result<Option<Vertex>>> + 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<Vertex>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn last<'life0, 'async_trait>(
&'life0 self,
) -> Pin<Box<dyn Future<Output = Result<Option<Vertex>>> + 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 contains<'life0, 'life1, 'async_trait>(
&'life0 self,
name: &'life1 Vertex,
) -> 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 Vertex,
) -> 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 Vertex,
) -> 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 Vertex,
) -> 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 id_convert(&self) -> Option<&dyn IdConvert>
fn id_convert(&self) -> Option<&dyn IdConvert>
Get an optional IdConvert interface to check hints.
Source§fn specialized_reverse(&self) -> Option<Set>
fn specialized_reverse(&self) -> Option<Set>
Specialized “reverse” implementation.
Returns
None to use the general purpose reverse implementation.Source§impl Clone for IdStaticSet
impl Clone for IdStaticSet
Source§fn clone(&self) -> IdStaticSet
fn clone(&self) -> IdStaticSet
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl !Freeze for IdStaticSet
impl !RefUnwindSafe for IdStaticSet
impl Send for IdStaticSet
impl Sync for IdStaticSet
impl Unpin for IdStaticSet
impl UnsafeUnpin for IdStaticSet
impl !UnwindSafe for IdStaticSet
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,
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> Pointable for T
impl<T> Pointable for T
Source§impl<T> SyncSetQuery for Twhere
T: AsyncSetQuery,
impl<T> SyncSetQuery for Twhere
T: AsyncSetQuery,
Source§fn iter(
&self,
) -> Result<Box<dyn NameIter<Item = Result<Vertex, DagError>>>, DagError>
fn iter( &self, ) -> Result<Box<dyn NameIter<Item = Result<Vertex, DagError>>>, DagError>
Iterate through the set in defined order.
Source§fn iter_rev(
&self,
) -> Result<Box<dyn NameIter<Item = Result<Vertex, DagError>>>, DagError>
fn iter_rev( &self, ) -> Result<Box<dyn NameIter<Item = Result<Vertex, DagError>>>, DagError>
Iterate through the set in the reversed order.
Source§fn contains(&self, name: &Vertex) -> Result<bool, DagError>
fn contains(&self, name: &Vertex) -> 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.