Struct ReverseSet 

pub struct ReverseSet { /* private fields */ }

Set with a reversed iteration order.

Implementations

impl ReverseSet

pub fn new(set: Set) -> Self

Trait Implementations

impl AsyncSetQuery for ReverseSet

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.

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.

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.

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.

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.

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.

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.

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.

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.

fn as_any(&self) -> &dyn Any

For downcasting.

fn hints(&self) -> &Hints

Get or set optimization hints.

fn id_convert(&self) -> Option<&dyn IdConvert>

Get an optional IdConvert interface to check hints.

fn specialized_reverse(&self) -> Option<Set>

Specialized “reverse” implementation. Returns None to use the general purpose reverse implementation.

fn specialized_flatten_id(&self) -> Option<Cow<'_, IdStaticSet>>

Specialized “flatten_id” implementation.

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.

fn specialized_take(&self, n: u64) -> Option<Set>

Specialized “take” implementation. Returns None to use the general purpose implementation.

fn specialized_skip(&self, n: u64) -> Option<Set>

Specialized “take” implementation. Returns None to use the general purpose implementation.

impl Clone for ReverseSet

fn clone(&self) -> ReverseSet

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for ReverseSet

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.