Struct rio_api::parser::QuadsParserIterator
source ·
[−]pub struct QuadsParserIterator<T, E: From<P::Error>, F: FnMut(Quad<'_>) -> Result<T, E>, P: QuadsParser> { /* fields omitted */ }
Expand description
Created with the method into_iter
.
Trait Implementations
impl<T, E: From<P::Error>, F: FnMut(Quad<'_>) -> Result<T, E>, P: QuadsParser> Iterator for QuadsParserIterator<T, E, F, P>
impl<T, E: From<P::Error>, F: FnMut(Quad<'_>) -> Result<T, E>, P: QuadsParser> Iterator for QuadsParserIterator<T, E, F, P>
Advances the iterator and returns the next value. Read more
Returns the bounds on the remaining length of the iterator. Read more
Consumes the iterator, counting the number of iterations and returning it. Read more
Consumes the iterator, returning the last element. Read more
iter_advance_by
)Advances the iterator by n
elements. Read more
Returns the n
th element of the iterator. Read more
Creates an iterator starting at the same point, but stepping by the given amount at each iteration. Read more
1.0.0 · sourcefn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator<Item = Self::Item>,
fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator<Item = Self::Item>,
Takes two iterators and creates a new iterator over both in sequence. Read more
1.0.0 · sourcefn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator,
fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator,
‘Zips up’ two iterators into a single iterator of pairs. Read more
iter_intersperse
)Creates a new iterator which places a copy of separator
between adjacent
items of the original iterator. Read more
fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G> where
G: FnMut() -> Self::Item,
fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G> where
G: FnMut() -> Self::Item,
iter_intersperse
)Creates a new iterator which places an item generated by separator
between adjacent items of the original iterator. Read more
Takes a closure and creates an iterator which calls that closure on each element. Read more
Calls a closure on each element of an iterator. Read more
Creates an iterator which uses a closure to determine if an element should be yielded. Read more
Creates an iterator that both filters and maps. Read more
Creates an iterator which gives the current iteration count as well as the next value. Read more
Creates an iterator that yields elements based on a predicate. Read more
Creates an iterator that both yields elements based on a predicate and maps. Read more
Creates an iterator that skips the first n
elements. Read more
Creates an iterator that yields the first n
elements, or fewer
if the underlying iterator ends sooner. Read more
Creates an iterator that works like map, but flattens nested structure. Read more
Creates an iterator that flattens nested structure. Read more
Does something with each element of an iterator, passing the value on. Read more
Borrows an iterator, rather than consuming it. Read more
Transforms an iterator into a collection. Read more
Consumes an iterator, creating two collections from it. Read more
fn partition_in_place<'a, T, P>(self, predicate: P) -> usize where
T: 'a,
Self: DoubleEndedIterator<Item = &'a mut T>,
P: FnMut(&T) -> bool,
fn partition_in_place<'a, T, P>(self, predicate: P) -> usize where
T: 'a,
Self: DoubleEndedIterator<Item = &'a mut T>,
P: FnMut(&T) -> bool,
iter_partition_in_place
)Reorders the elements of this iterator in-place according to the given predicate,
such that all those that return true
precede all those that return false
.
Returns the number of true
elements found. Read more
iter_is_partitioned
)Checks if the elements of this iterator are partitioned according to the given predicate,
such that all those that return true
precede all those that return false
. Read more
An iterator method that applies a function as long as it returns successfully, producing a single, final value. Read more
An iterator method that applies a fallible function to each item in the iterator, stopping at the first error and returning that error. Read more
Folds every element into an accumulator by applying an operation, returning the final result. Read more
Reduces the elements to a single one, by repeatedly applying a reducing operation. Read more
iterator_try_reduce
)Reduces the elements to a single one by repeatedly applying a reducing operation. If the closure returns a failure, the failure is propagated back to the caller immediately. Read more
Tests if every element of the iterator matches a predicate. Read more
Tests if any element of the iterator matches a predicate. Read more
Searches for an element of an iterator that satisfies a predicate. Read more
Applies function to the elements of iterator and returns the first non-none result. Read more
try_find
)Applies function to the elements of iterator and returns the first true result or the first error. Read more
Searches for an element in an iterator, returning its index. Read more
1.0.0 · sourcefn rposition<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
Self: ExactSizeIterator + DoubleEndedIterator,
fn rposition<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
Self: ExactSizeIterator + DoubleEndedIterator,
Searches for an element in an iterator from the right, returning its index. Read more
Returns the maximum element of an iterator. Read more
Returns the minimum element of an iterator. Read more
Returns the element that gives the maximum value from the specified function. Read more
Returns the element that gives the maximum value with respect to the specified comparison function. Read more
Returns the element that gives the minimum value from the specified function. Read more
Returns the element that gives the minimum value with respect to the specified comparison function. Read more
Reverses an iterator’s direction. Read more
Converts an iterator of pairs into a pair of containers. Read more
Creates an iterator which copies all of its elements. Read more
Repeats an iterator endlessly. Read more
Sums the elements of an iterator. Read more
Iterates over the entire iterator, multiplying all the elements Read more
Lexicographically compares the elements of this Iterator
with those
of another. Read more
fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering where
I: IntoIterator,
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,
fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering where
I: IntoIterator,
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,
iter_order_by
)Lexicographically compares the elements of this Iterator
with those
of another with respect to the specified comparison function. Read more
1.5.0 · sourcefn partial_cmp<I>(self, other: I) -> Option<Ordering> where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
fn partial_cmp<I>(self, other: I) -> Option<Ordering> where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Lexicographically compares the elements of this Iterator
with those
of another. Read more
fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering> where
I: IntoIterator,
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,
fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering> where
I: IntoIterator,
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,
iter_order_by
)Lexicographically compares the elements of this Iterator
with those
of another with respect to the specified comparison function. Read more
1.5.0 · sourcefn eq<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
fn eq<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
fn eq_by<I, F>(self, other: I, eq: F) -> bool where
I: IntoIterator,
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,
fn eq_by<I, F>(self, other: I, eq: F) -> bool where
I: IntoIterator,
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,
iter_order_by
)1.5.0 · sourcefn ne<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
fn ne<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
1.5.0 · sourcefn lt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
fn lt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are lexicographically
less than those of another. Read more
1.5.0 · sourcefn le<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
fn le<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are lexicographically
less or equal to those of another. Read more
1.5.0 · sourcefn gt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
fn gt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are lexicographically
greater than those of another. Read more
1.5.0 · sourcefn ge<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
fn ge<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are lexicographically
greater than or equal to those of another. Read more
is_sorted
)Checks if the elements of this iterator are sorted. Read more
is_sorted
)Checks if the elements of this iterator are sorted using the given comparator function. Read more
fn is_sorted_by_key<F, K>(self, f: F) -> bool where
F: FnMut(Self::Item) -> K,
K: PartialOrd<K>,
fn is_sorted_by_key<F, K>(self, f: F) -> bool where
F: FnMut(Self::Item) -> K,
K: PartialOrd<K>,
is_sorted
)Checks if the elements of this iterator are sorted using the given key extraction function. Read more
Auto Trait Implementations
impl<T, E, F, P> RefUnwindSafe for QuadsParserIterator<T, E, F, P> where
F: RefUnwindSafe,
P: RefUnwindSafe,
T: RefUnwindSafe,
impl<T, E, F, P> Send for QuadsParserIterator<T, E, F, P> where
F: Send,
P: Send,
T: Send,
impl<T, E, F, P> Sync for QuadsParserIterator<T, E, F, P> where
F: Sync,
P: Sync,
T: Sync,
impl<T, E, F, P> Unpin for QuadsParserIterator<T, E, F, P> where
F: Unpin,
P: Unpin,
T: Unpin,
impl<T, E, F, P> UnwindSafe for QuadsParserIterator<T, E, F, P> where
F: UnwindSafe,
P: UnwindSafe,
T: UnwindSafe,
Blanket Implementations
pub fn and_then_ok<F, O2>(self, f: F) -> AndThenOk<I, F> where
F: FnMut(O) -> Result<O2, E>,
pub fn and_then_err<F, E2>(self, f: F) -> AndThenErr<I, F> where
F: FnMut(E) -> Result<O, E2>,
Mutably borrows from an owned value. Read more
pub fn filter_map_ok<F, O2>(self, f: F) -> FilterMapOk<I, F> where
F: FnMut(O) -> Option<O2>,
pub fn filter_map_err<F, E2>(self, f: F) -> FilterMapErr<I, F> where
F: FnMut(E) -> Option<E2>,
pub fn flat_map_ok<U, F, O2>(self, f: F) -> FlatMapOk<I, U, F> where
F: FnMut(O) -> U,
U: IntoIterator<Item = O2>,
pub fn flat_map_err<U, F, E2>(self, f: F) -> FlatMapErr<I, U, F> where
F: FnMut(E) -> U,
U: IntoIterator<Item = E2>,
pub fn flatten_ok<U, O2>(self) -> FlattenOk<I, U> where
U: IntoIterator<Item = O2>,
pub fn flatten_err<U, E2>(self) -> FlattenErr<I, U> where
U: IntoIterator<Item = E2>,
pub fn map_inner_ok_or_else(self, f: F) -> IterInnerOkOrElseImpl<I, T, E, F>
pub fn on_err(self, f: F) -> OnErr<I, O, E, F>
pub fn on_ok(self, f: F) -> OnOk<I, O, E, F>
type Error = E
type Error = E
The type of errors produced by this source.
Determine the type of Quad
s
that this quad source yields.
(see streaming_mode
Read more
pub fn try_for_some_quad<F, EF>(
&mut self,
f: &mut F
) -> Result<bool, StreamError<E, EF>> where
F: FnMut(StreamedQuad<'_, <I as QuadSource>::Quad>) -> Result<(), EF>,
EF: Error,
pub fn try_for_some_quad<F, EF>(
&mut self,
f: &mut F
) -> Result<bool, StreamError<E, EF>> where
F: FnMut(StreamedQuad<'_, <I as QuadSource>::Quad>) -> Result<(), EF>,
EF: Error,
Call f for at least one quad from this quad source, if any. Read more
fn try_for_each_quad<F, E>(
&mut self,
f: F
) -> Result<(), StreamError<Self::Error, E>> where
F: FnMut(StreamedQuad<'_, Self::Quad>) -> Result<(), E>,
E: Error,
fn try_for_each_quad<F, E>(
&mut self,
f: F
) -> Result<(), StreamError<Self::Error, E>> where
F: FnMut(StreamedQuad<'_, Self::Quad>) -> Result<(), E>,
E: Error,
Call f for all quads from this quad source.
fn for_some_quad<F>(&mut self, f: &mut F) -> Result<bool, Self::Error> where
F: FnMut(StreamedQuad<'_, Self::Quad>),
fn for_some_quad<F>(&mut self, f: &mut F) -> Result<bool, Self::Error> where
F: FnMut(StreamedQuad<'_, Self::Quad>),
Call f for at least one quad from this quad source, if any. Read more
fn for_each_quad<F>(&mut self, f: F) -> Result<(), Self::Error> where
F: FnMut(StreamedQuad<'_, Self::Quad>),
fn for_each_quad<F>(&mut self, f: F) -> Result<(), Self::Error> where
F: FnMut(StreamedQuad<'_, Self::Quad>),
Call f for all quads from this quad source.
fn filter_quads<F>(self, filter: F) -> FilterSource<Self, F> where
F: FnMut(&StreamedQuad<'_, Self::Quad>) -> bool,
fn filter_quads<F>(self, filter: F) -> FilterSource<Self, F> where
F: FnMut(&StreamedQuad<'_, Self::Quad>) -> bool,
Creates a quad source which uses a closure to determine if a quad should be yielded.
fn filter_map_quads<F, T>(self, filter_map: F) -> FilterMapSource<Self, F> where
F: FnMut(StreamedQuad<'_, Self::Quad>) -> Option<T>,
fn filter_map_quads<F, T>(self, filter_map: F) -> FilterMapSource<Self, F> where
F: FnMut(StreamedQuad<'_, Self::Quad>) -> Option<T>,
Creates a quad source that both filters and maps.
Takes a closure and creates quad source which yield the result of that closure for each quad.
Returns the bounds on the remaining length of the quad source. Read more
fn collect_quads<D>(
self
) -> Result<D, StreamError<Self::Error, <D as Dataset>::Error>> where
D: CollectibleDataset,
fn collect_quads<D>(
self
) -> Result<D, StreamError<Self::Error, <D as Dataset>::Error>> where
D: CollectibleDataset,
Collect these quads into a new dataset.
fn add_to_dataset<D>(
self,
dataset: &mut D
) -> Result<usize, StreamError<Self::Error, <D as MutableDataset>::MutationError>> where
D: MutableDataset,
fn add_to_dataset<D>(
self,
dataset: &mut D
) -> Result<usize, StreamError<Self::Error, <D as MutableDataset>::MutationError>> where
D: MutableDataset,
Insert all quads from this source into the given MutableDataset. Read more
type Error = E
type Error = E
The type of errors produced by this source.
Determine the type of Triple
s
that this triple source yields.
(see streaming_mode
) Read more
pub fn try_for_some_triple<F, EF>(
&mut self,
f: &mut F
) -> Result<bool, StreamError<E, EF>> where
F: FnMut(StreamedTriple<'_, <I as TripleSource>::Triple>) -> Result<(), EF>,
EF: Error,
pub fn try_for_some_triple<F, EF>(
&mut self,
f: &mut F
) -> Result<bool, StreamError<E, EF>> where
F: FnMut(StreamedTriple<'_, <I as TripleSource>::Triple>) -> Result<(), EF>,
EF: Error,
Call f for at least one triple from this triple source, if any. Read more
Returns the bounds on the remaining length of the triple source. Read more
fn try_for_each_triple<F, E>(
&mut self,
f: F
) -> Result<(), StreamError<Self::Error, E>> where
F: FnMut(StreamedTriple<'_, Self::Triple>) -> Result<(), E>,
E: Error,
fn try_for_each_triple<F, E>(
&mut self,
f: F
) -> Result<(), StreamError<Self::Error, E>> where
F: FnMut(StreamedTriple<'_, Self::Triple>) -> Result<(), E>,
E: Error,
Call f for all triples from this triple source.
fn for_some_triple<F>(&mut self, f: &mut F) -> Result<bool, Self::Error> where
F: FnMut(StreamedTriple<'_, Self::Triple>),
fn for_some_triple<F>(&mut self, f: &mut F) -> Result<bool, Self::Error> where
F: FnMut(StreamedTriple<'_, Self::Triple>),
Call f for at least one triple from this triple source, if any. Read more
fn for_each_triple<F>(&mut self, f: F) -> Result<(), Self::Error> where
F: FnMut(StreamedTriple<'_, Self::Triple>),
fn for_each_triple<F>(&mut self, f: F) -> Result<(), Self::Error> where
F: FnMut(StreamedTriple<'_, Self::Triple>),
Call f for all triples from this triple source.
fn filter_triples<F>(self, filter: F) -> FilterSource<Self, F> where
F: FnMut(&StreamedTriple<'_, Self::Triple>) -> bool,
fn filter_triples<F>(self, filter: F) -> FilterSource<Self, F> where
F: FnMut(&StreamedTriple<'_, Self::Triple>) -> bool,
Creates a triple source which uses a closure to determine if a triple should be yielded.
fn filter_map_triples<F, T>(self, filter_map: F) -> FilterMapSource<Self, F> where
F: FnMut(StreamedTriple<'_, Self::Triple>) -> Option<T>,
fn filter_map_triples<F, T>(self, filter_map: F) -> FilterMapSource<Self, F> where
F: FnMut(StreamedTriple<'_, Self::Triple>) -> Option<T>,
Creates a triple source that both filters and maps.
fn map_triples<F, T>(self, map: F) -> MapSource<Self, F> where
F: FnMut(StreamedTriple<'_, Self::Triple>) -> T,
fn map_triples<F, T>(self, map: F) -> MapSource<Self, F> where
F: FnMut(StreamedTriple<'_, Self::Triple>) -> T,
Takes a closure and creates triple source which yield the result of that closure for each triple.
fn collect_triples<G>(
self
) -> Result<G, StreamError<Self::Error, <G as Graph>::Error>> where
G: CollectibleGraph,
fn collect_triples<G>(
self
) -> Result<G, StreamError<Self::Error, <G as Graph>::Error>> where
G: CollectibleGraph,
Collect these triples into a new graph.
fn add_to_graph<G>(
self,
graph: &mut G
) -> Result<usize, StreamError<Self::Error, <G as MutableGraph>::MutationError>> where
G: MutableGraph,
fn add_to_graph<G>(
self,
graph: &mut G
) -> Result<usize, StreamError<Self::Error, <G as MutableGraph>::MutationError>> where
G: MutableGraph,
Insert all triples from this source into the given MutableGraph. Read more