Trait SortedIterator 

pub unsafe trait SortedIterator: Iterator { }

Marker trait for Iterators yielding labels in the order induced by enumerating the successors in ascending order.

The AssumeSortedIterator type can be used to wrap an iterator and unsafely implement this trait.

Safety

The labels returned by the iterator must be in the order in which they would be if successors were returned in ascending order.

Examples

To bind the iterators returned by the lender returned by SequentialLabeling::iter to implement this trait, you must use higher-rank trait bounds:

use webgraph::traits::*;

fn takes_labeling_with_sorted_iterators<G>(g: G) where
    G: SequentialLabeling,
    for<'a, 'b> LenderIntoIter<'b, G::Lender<'a>>: SortedIterator,
{
    // ...
}

Implementations on Foreign Types

impl<I: SortedIterator, J: SortedIterator> SortedIterator for Zip<I, J>

Implementors

impl<D: Decode> SortedIterator for webgraph::graphs::bvgraph::random_access::Succ<D>

impl<E: Endianness, D: BitDeserializer<E, BitReader<E>>, const OUTDEGREE_CODE: usize, const SRC_CODE: usize, const DST_CODE: usize> SortedIterator for GroupedGapsIterator<E, D, OUTDEGREE_CODE, SRC_CODE, DST_CODE>

where BitReader<E>: BitRead<E> + CodesRead<E>, BitWriter<E>: BitWrite<E> + CodesWrite<E>,

impl<E: Endianness, D: BitDeserializer<E, BitReader<E>>, const SRC_CODE: usize, const DST_CODE: usize> SortedIterator for GapsIterator<E, D, SRC_CODE, DST_CODE>

where BitReader<E>: BitRead<E> + CodesRead<E>, BitWriter<E>: BitWrite<E> + CodesWrite<E>,

impl<I: Iterator> SortedIterator for AssumeSortedIterator<I>

impl<I: Iterator<Item = usize> + SortedIterator> SortedIterator for webgraph::graphs::no_selfloops_graph::Succ<I>

impl<I: Iterator<Item = usize> + SortedIterator, J: Iterator<Item = usize> + SortedIterator> SortedIterator for webgraph::graphs::union_graph::Succ<I, J>

impl<I: SortedIterator> SortedIterator for LeftIntoIter<I>

where I::Item: Pair,

impl<I: SortedIterator> SortedIterator for RightIntoIter<I>

where I::Item: Pair,

impl<L, I: IntoIterator<Item = ((usize, usize), L)>> SortedIterator for webgraph::graphs::arc_list_graph::Succ<'_, L, I>

where I::IntoIter: SortedIterator,

impl<T, I: Iterator<Item = ((usize, usize), T)> + SortedIterator> SortedIterator for KMergeIters<I, T>