Struct solang_parser::lexer::Lexer

source · [−]

pub struct Lexer<'input> { /* private fields */ }

Implementations

source

impl<'input> Lexer<'input>

source

pub fn new(
 input: &'input str,
 file_no: usize,
 comments: &'input mut Vec<Comment>
) -> Self

Trait Implementations

source

impl<'input> Iterator for Lexer<'input>

source

fn next(&mut self) -> Option<Self::Item>

Return the next token

type Item = Result<(usize, Token<'input>, usize), LexicalError>

The type of the elements being iterated over.

source

fn next_chunk<const N: usize>(
&mut self
) -> Result<[Self::Item ; N], IntoIter<Self::Item, N>>

🔬This is a nightly-only experimental API. (iter_next_chunk)

Advances the iterator and returns an array containing the next N values. Read more

1.0.0 · source

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator. Read more

1.0.0 · source

fn count(self) -> usize

Consumes the iterator, counting the number of iterations and returning it. Read more

1.0.0 · source

fn last(self) -> Option<Self::Item>

Consumes the iterator, returning the last element. Read more

source

fn advance_by(&mut self, n: usize) -> Result<(), usize>

🔬This is a nightly-only experimental API. (iter_advance_by)

Advances the iterator by n elements. Read more

1.0.0 · source

fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator. Read more

1.28.0 · source

fn step_by(self, step: usize) -> StepBy<Self>

Creates an iterator starting at the same point, but stepping by the given amount at each iteration. Read more

1.0.0 · source

fn chain(self, other: U) -> Chain<Self, ::IntoIter>where
U: IntoIterator<Item = Self::Item>,

Takes two iterators and creates a new iterator over both in sequence. Read more

1.0.0 · source

fn zip(self, other: U) -> Zip<Self, ::IntoIter>where
U: IntoIterator,

‘Zips up’ two iterators into a single iterator of pairs. Read more

source

fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>where
G: FnMut() -> Self::Item,

🔬This is a nightly-only experimental API. (iter_intersperse)

Creates a new iterator which places an item generated by separator between adjacent items of the original iterator. Read more

1.0.0 · source

fn map<B, F>(self, f: F) -> Map<Self, F>where
F: FnMut(Self::Item) -> B,

Takes a closure and creates an iterator which calls that closure on each element. Read more

1.21.0 · source

fn for_each<F>(self, f: F)where
F: FnMut(Self::Item),

Calls a closure on each element of an iterator. Read more

1.0.0 · source

fn filter(self, predicate: P) -> Filter<Self, P>where
P: FnMut(&Self::Item) -> bool,

Creates an iterator which uses a closure to determine if an element should be yielded. Read more

1.0.0 · source

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>where
F: FnMut(Self::Item) -> Option,

Creates an iterator that both filters and maps. Read more

1.0.0 · source

fn enumerate(self) -> Enumerate<Self>

Creates an iterator which gives the current iteration count as well as the next value. Read more

1.0.0 · source

fn peekable(self) -> Peekable<Self>

Creates an iterator which can use the peek and peek_mut methods to look at the next element of the iterator without consuming it. See their documentation for more information. Read more

1.0.0 · source

fn skip_while(self, predicate: P) -> SkipWhile<Self, P>where
P: FnMut(&Self::Item) -> bool,

Creates an iterator that skips elements based on a predicate. Read more

1.0.0 · source

fn take_while(self, predicate: P) -> TakeWhile<Self, P>where
P: FnMut(&Self::Item) -> bool,

Creates an iterator that yields elements based on a predicate. Read more

1.57.0 · source

fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>where
P: FnMut(Self::Item) -> Option,

Creates an iterator that both yields elements based on a predicate and maps. Read more

1.0.0 · source

fn skip(self, n: usize) -> Skip<Self>

Creates an iterator that skips the first n elements. Read more

1.0.0 · source

fn take(self, n: usize) -> Take<Self>

Creates an iterator that yields the first n elements, or fewer if the underlying iterator ends sooner. Read more

1.0.0 · source

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>where
F: FnMut(&mut St, Self::Item) -> Option,

An iterator adapter similar to fold that holds internal state and produces a new iterator. Read more

1.0.0 · source

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>where
U: IntoIterator,
F: FnMut(Self::Item) -> U,

Creates an iterator that works like map, but flattens nested structure. Read more

1.0.0 · source

fn fuse(self) -> Fuse<Self>

Creates an iterator which ends after the first None. Read more

1.0.0 · source

fn inspect<F>(self, f: F) -> Inspect<Self, F>where
F: FnMut(&Self::Item),

Does something with each element of an iterator, passing the value on. Read more

1.0.0 · source

fn by_ref(&mut self) -> &mut Self

Borrows an iterator, rather than consuming it. Read more

1.0.0 · source

fn collect(self) -> Bwhere
B: FromIterator<Self::Item>,

Transforms an iterator into a collection. Read more

source

fn collect_into<E>(self, collection: &mut E) -> &mut Ewhere
E: Extend<Self::Item>,

🔬This is a nightly-only experimental API. (iter_collect_into)

Collects all the items from an iterator into a collection. Read more

1.0.0 · source

fn partition<B, F>(self, f: F) -> (B, B)where
B: Default + Extend<Self::Item>,
F: FnMut(&Self::Item) -> bool,

Consumes an iterator, creating two collections from it. Read more

source

fn is_partitioned(self, predicate: P) -> boolwhere
P: FnMut(Self::Item) -> bool,

🔬This is a nightly-only experimental API. (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

1.27.0 · source

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> Rwhere
F: FnMut(B, Self::Item) -> R,
R: Try<Output = B>,

An iterator method that applies a function as long as it returns successfully, producing a single, final value. Read more

1.27.0 · source

fn try_for_each<F, R>(&mut self, f: F) -> Rwhere
F: FnMut(Self::Item) -> R,
R: Try<Output = ()>,

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

1.0.0 · source

fn fold<B, F>(self, init: B, f: F) -> Bwhere
F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, returning the final result. Read more

1.51.0 · source

fn reduce<F>(self, f: F) -> Option<Self::Item>where
F: FnMut(Self::Item, Self::Item) -> Self::Item,

Reduces the elements to a single one, by repeatedly applying a reducing operation. Read more

source

fn try_reduce<F, R>(
 &mut self,
 f: F
) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryTypewhere
 F: FnMut(Self::Item, Self::Item) -> R,
 R: Try<Output = Self::Item>,
 <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (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

1.0.0 · source

fn all<F>(&mut self, f: F) -> boolwhere
F: FnMut(Self::Item) -> bool,

Tests if every element of the iterator matches a predicate. Read more

1.0.0 · source

fn any<F>(&mut self, f: F) -> boolwhere
F: FnMut(Self::Item) -> bool,

Tests if any element of the iterator matches a predicate. Read more

1.0.0 · source

fn find(&mut self, predicate: P) -> Option<Self::Item>where
P: FnMut(&Self::Item) -> bool,

Searches for an element of an iterator that satisfies a predicate. Read more

1.30.0 · source

fn find_map<B, F>(&mut self, f: F) -> Optionwhere
F: FnMut(Self::Item) -> Option,

Applies function to the elements of iterator and returns the first non-none result. Read more

source

fn try_find<F, R>(
 &mut self,
 f: F
) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryTypewhere
 F: FnMut(&Self::Item) -> R,
 R: Try<Output = bool>,
 <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (try_find)

Applies function to the elements of iterator and returns the first true result or the first error. Read more

1.0.0 · source

fn position(&mut self, predicate: P) -> Option<usize>where
P: FnMut(Self::Item) -> bool,

Searches for an element in an iterator, returning its index. Read more

1.6.0 · source

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>where
B: Ord,
F: FnMut(&Self::Item) -> B,

Returns the element that gives the maximum value from the specified function. Read more

1.15.0 · source

fn max_by<F>(self, compare: F) -> Option<Self::Item>where
F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Returns the element that gives the maximum value with respect to the specified comparison function. Read more

1.6.0 · source

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>where
B: Ord,
F: FnMut(&Self::Item) -> B,

Returns the element that gives the minimum value from the specified function. Read more

1.15.0 · source

fn min_by<F>(self, compare: F) -> Option<Self::Item>where
F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Returns the element that gives the minimum value with respect to the specified comparison function. Read more

1.0.0 · source

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)where
 FromA: Default + Extend<A>,
 FromB: Default + Extend,
 Self: Iterator<Item = (A, B)>,

Converts an iterator of pairs into a pair of containers. Read more

1.36.0 · source

fn copied<'a, T>(self) -> Copied<Self>where
T: 'a + Copy,
Self: Iterator<Item = &'a T>,

Creates an iterator which copies all of its elements. Read more

1.0.0 · source

fn cloned<'a, T>(self) -> Cloned<Self>where
T: 'a + Clone,
Self: Iterator<Item = &'a T>,

Creates an iterator which clones all of its elements. Read more

source

fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>

🔬This is a nightly-only experimental API. (iter_array_chunks)

Returns an iterator over N elements of the iterator at a time. Read more

1.11.0 · source

fn sum<S>(self) -> Swhere
S: Sum<Self::Item>,

Sums the elements of an iterator. Read more

1.11.0 · source

fn product(self) -> Pwhere
P: Product<Self::Item>,

Iterates over the entire iterator, multiplying all the elements Read more

source

fn cmp_by<I, F>(self, other: I, cmp: F) -> Orderingwhere
I: IntoIterator,
F: FnMut(Self::Item, ::Item) -> Ordering,

🔬This is a nightly-only experimental API. (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 · source

fn partial_cmp(self, other: I) -> Option<Ordering>where
I: IntoIterator,
Self::Item: PartialOrd<::Item>,

Lexicographically compares the elements of this Iterator with those of another. Read more

source

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>where
I: IntoIterator,
F: FnMut(Self::Item, ::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (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 · source

fn eq(self, other: I) -> boolwhere
I: IntoIterator,
Self::Item: PartialEq<::Item>,

Determines if the elements of this Iterator are equal to those of another. Read more

source

fn eq_by<I, F>(self, other: I, eq: F) -> boolwhere
I: IntoIterator,
F: FnMut(Self::Item, ::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_order_by)

Determines if the elements of this Iterator are equal to those of another with respect to the specified equality function. Read more

1.5.0 · source

fn ne(self, other: I) -> boolwhere
I: IntoIterator,
Self::Item: PartialEq<::Item>,

Determines if the elements of this Iterator are unequal to those of another. Read more

1.5.0 · source

fn lt(self, other: I) -> boolwhere
I: IntoIterator,
Self::Item: PartialOrd<::Item>,

Determines if the elements of this Iterator are lexicographically less than those of another. Read more

1.5.0 · source

fn le(self, other: I) -> boolwhere
I: IntoIterator,
Self::Item: PartialOrd<::Item>,

Determines if the elements of this Iterator are lexicographically less or equal to those of another. Read more

1.5.0 · source

fn gt(self, other: I) -> boolwhere
I: IntoIterator,
Self::Item: PartialOrd<::Item>,

Determines if the elements of this Iterator are lexicographically greater than those of another. Read more

1.5.0 · source

fn ge(self, other: I) -> boolwhere
I: IntoIterator,
Self::Item: PartialOrd<::Item>,

Determines if the elements of this Iterator are lexicographically greater than or equal to those of another. Read more

source

fn is_sorted_by<F>(self, compare: F) -> boolwhere
F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (is_sorted)

Checks if the elements of this iterator are sorted using the given comparator function. Read more

source

fn is_sorted_by_key<F, K>(self, f: F) -> boolwhere
F: FnMut(Self::Item) -> K,
K: PartialOrd<K>,

🔬This is a nightly-only experimental API. (is_sorted)

Checks if the elements of this iterator are sorted using the given key extraction function. Read more

Auto Trait Implementations

impl<'input> RefUnwindSafe for Lexer<'input>

impl<'input> Send for Lexer<'input>

impl<'input> Sync for Lexer<'input>

impl<'input> Unpin for Lexer<'input>

impl<'input> !UnwindSafe for Lexer<'input>

Blanket Implementations

source

impl<T> Any for Twhere
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for Twhere
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for Twhere
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl IntoIterator for Iwhere
I: Iterator,

type Item = ::Item

The type of the elements being iterated over.

type IntoIter = I

Which kind of iterator are we turning this into?

const: unstable · source

fn into_iter(self) -> I

Creates an iterator from a value. Read more

source

impl<T> Itertools for Twhere
T: Iterator + ?Sized,

source

fn interleave<J>(
 self,
 other: J
) -> Interleave<Self, <J as IntoIterator>::IntoIter>where
 J: IntoIterator<Item = Self::Item>,

Alternate elements from two iterators until both have run out. Read more

source

fn interleave_shortest<J>(
 self,
 other: J
) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter>where
 J: IntoIterator<Item = Self::Item>,

Alternate elements from two iterators until at least one of them has run out. Read more

source

fn intersperse(
 self,
 element: Self::Item
) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where
 Self::Item: Clone,

An iterator adaptor to insert a particular value between each element of the adapted iterator. Read more

source

fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where
F: FnMut() -> Self::Item,

An iterator adaptor to insert a particular value created by a function between each element of the adapted iterator. Read more

source

fn zip_longest<J>(
 self,
 other: J
) -> ZipLongest<Self, <J as IntoIterator>::IntoIter>where
 J: IntoIterator,

Create an iterator which iterates over both this and the specified iterator simultaneously, yielding pairs of two optional elements. Read more

source

fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator,

Create an iterator which iterates over both this and the specified iterator simultaneously, yielding pairs of elements. Read more

source

fn batching<B, F>(self, f: F) -> Batching<Self, F>where
F: FnMut(&mut Self) -> Option,

A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the next iterator element. Read more

source

fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where
F: FnMut(&Self::Item) -> K,
K: PartialEq<K>,

Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned to the same group. Read more

source

fn chunks(self, size: usize) -> IntoChunks<Self>

Return an iterable that can chunk the iterator. Read more

source

fn tuple_windows<T>(self) -> TupleWindows<Self, T>where
 Self: Iterator<Item = <T as TupleCollect>::Item>,
 T: HomogeneousTuple,
 <T as TupleCollect>::Item: Clone,

Return an iterator over all contiguous windows producing tuples of a specific size (up to 12). Read more

source

fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where
 Self: Clone + Iterator<Item = <T as TupleCollect>::Item> + ExactSizeIterator,
 T: TupleCollect + Clone,
 <T as TupleCollect>::Item: Clone,

Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the iterator, producing tuples of a specific size (up to 12). Read more

source

fn tuples<T>(self) -> Tuples<Self, T>where
Self: Iterator<Item = <T as TupleCollect>::Item>,
T: HomogeneousTuple,

Return an iterator that groups the items in tuples of a specific size (up to 12). Read more

source

fn tee(self) -> (Tee<Self>, Tee<Self>)where
Self::Item: Clone,

Split into an iterator pair that both yield all elements from the original iterator. Read more

source

fn step(self, n: usize) -> Step<Self>

👎Deprecated since 0.8.0:

Use std .step_by() instead

Return an iterator adaptor that steps n elements in the base iterator for each iteration. Read more

source

fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where
Self::Item: Into<R>,

Convert each item of the iterator using the Into trait. Read more

source

fn map_results<F, T, U, E>(
 self,
 f: F
) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
 Self: Iterator<Item = Result<T, E>>,
 F: FnMut(T) -> U,

👎Deprecated since 0.10.0:

Use .map_ok() instead

See .map_ok().

source

fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
Self: Iterator<Item = Result<T, E>>,
F: FnMut(T) -> U,

Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are unchanged. Read more

source

fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>where
Self: Iterator<Item = Result<T, E>>,
F: FnMut(&T) -> bool,

Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are unchanged. Read more

source

fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where
Self: Iterator<Item = Result<T, E>>,
F: FnMut(T) -> Option,

Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err values are unchanged. Read more

source

fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where
Self: Iterator<Item = Result<T, E>>,
T: IntoIterator,

Return an iterator adaptor that flattens every Result::Ok value into a series of Result::Ok values. Result::Err values are unchanged. Read more

source

fn merge<J>(
 self,
 other: J
) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte>where
 J: IntoIterator<Item = Self::Item>,
 Self::Item: PartialOrd<Self::Item>,

Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the result is sorted. Read more

source

fn merge_by<J, F>(
 self,
 other: J,
 is_first: F
) -> MergeBy<Self, <J as IntoIterator>::IntoIter, F>where
 J: IntoIterator<Item = Self::Item>,
 F: FnMut(&Self::Item, &Self::Item) -> bool,

Return an iterator adaptor that merges the two base iterators in order. This is much like .merge() but allows for a custom ordering. Read more

source

fn merge_join_by<J, F>(
 self,
 other: J,
 cmp_fn: F
) -> MergeJoinBy<Self, <J as IntoIterator>::IntoIter, F>where
 J: IntoIterator,
 F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> Ordering,

Create an iterator that merges items from both this and the specified iterator in ascending order. Read more

source

fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt>where
Self::Item: IntoIterator,
<Self::Item as IntoIterator>::Item: PartialOrd<<Self::Item as IntoIterator>::Item>,

Return an iterator adaptor that flattens an iterator of iterators by merging them in ascending order. Read more

source

fn kmerge_by<F>(
 self,
 first: F
) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F>where
 F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,
 Self::Item: IntoIterator,

Return an iterator adaptor that flattens an iterator of iterators by merging them according to the given closure. Read more

source

fn cartesian_product<J>(
 self,
 other: J
) -> Product<Self, <J as IntoIterator>::IntoIter>where
 J: IntoIterator,
 Self::Item: Clone,
 <J as IntoIterator>::IntoIter: Clone,

Return an iterator adaptor that iterates over the cartesian product of the element sets of two iterators self and J. Read more

source

fn multi_cartesian_product(
 self
) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter>where
 Self::Item: IntoIterator,
 <Self::Item as IntoIterator>::IntoIter: Clone,
 <Self::Item as IntoIterator>::Item: Clone,

Return an iterator adaptor that iterates over the cartesian product of all subiterators returned by meta-iterator self. Read more

source

fn coalesce<F>(self, f: F) -> CoalesceBy<Self, F, Self::Item>where
F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

Return an iterator adaptor that uses the passed-in closure to optionally merge together consecutive elements. Read more

source

fn dedup(self) -> CoalesceBy<Self, DedupPred2CoalescePred<DedupEq>, Self::Item>where
Self::Item: PartialEq<Self::Item>,

Remove duplicates from sections of consecutive identical elements. If the iterator is sorted, all elements will be unique. Read more

source

fn dedup_by<Cmp>(
 self,
 cmp: Cmp
) -> CoalesceBy<Self, DedupPred2CoalescePred<Cmp>, Self::Item>where
 Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. If the iterator is sorted, all elements will be unique. Read more

source

fn dedup_with_count(
self
) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<DedupEq>, (usize, Self::Item)>

Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. If the iterator is sorted, all elements will be unique. Read more

source

fn dedup_by_with_count<Cmp>(
 self,
 cmp: Cmp
) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where
 Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. If the iterator is sorted, all elements will be unique. Read more

source

fn duplicates(self) -> DuplicatesBy<Self, Self::Item, ById>where
Self::Item: Eq,
Self::Item: Hash,

Return an iterator adaptor that produces elements that appear more than once during the iteration. Duplicates are detected using hash and equality. Read more

source

fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, ByFn<F>>where
V: Eq + Hash,
F: FnMut(&Self::Item) -> V,

Return an iterator adaptor that produces elements that appear more than once during the iteration. Duplicates are detected using hash and equality. Read more

source

fn unique(self) -> Unique<Self>where
 Self::Item: Clone,
 Self::Item: Eq,
 Self::Item: Hash,

Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates are detected using hash and equality. Read more

source

fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F>where
V: Eq + Hash,
F: FnMut(&Self::Item) -> V,

Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Read more

source

fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F>where
Self: PeekingNext,
F: FnMut(&Self::Item) -> bool,

Return an iterator adaptor that borrows from this iterator and takes items while the closure accept returns true. Read more

source

fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F>where
Self: Clone,
F: FnMut(&Self::Item) -> bool,

Return an iterator adaptor that borrows from a Clone-able iterator to only pick off elements while the predicate accept returns true. Read more

source

fn while_some<A>(self) -> WhileSome<Self>where
Self: Iterator<Item = Option<A>>,

Return an iterator adaptor that filters Option<A> iterator elements and produces A. Stops on the first None encountered. Read more

source

fn tuple_combinations<T>(self) -> TupleCombinations<Self, T>where
 Self: Clone,
 T: HasCombination<Self>,
 Self::Item: Clone,

Return an iterator adaptor that iterates over the combinations of the elements from an iterator. Read more

source

fn combinations(self, k: usize) -> Combinations<Self>where
Self::Item: Clone,

Return an iterator adaptor that iterates over the k-length combinations of the elements from an iterator. Read more

source

fn combinations_with_replacement(
 self,
 k: usize
) -> CombinationsWithReplacement<Self>where
 Self::Item: Clone,

Return an iterator that iterates over the k-length combinations of the elements from an iterator, with replacement. Read more

source

fn permutations(self, k: usize) -> Permutations<Self>where
Self::Item: Clone,

Return an iterator adaptor that iterates over all k-permutations of the elements from an iterator. Read more

source

fn powerset(self) -> Powerset<Self>where
Self::Item: Clone,

Return an iterator that iterates through the powerset of the elements from an iterator. Read more

source

fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F>where
F: FnMut(usize) -> Self::Item,

Return an iterator adaptor that pads the sequence to a minimum length of min by filling missing elements using a closure f. Read more

source

fn with_position(self) -> WithPosition<Self>

Return an iterator adaptor that wraps each element in a Position to ease special-case handling of the first or last elements. Read more

source

fn positions(self, predicate: P) -> Positions<Self, P>where
P: FnMut(Self::Item) -> bool,

Return an iterator adaptor that yields the indices of all elements satisfying a predicate, counted from the start of the iterator. Read more

source

fn update<F>(self, updater: F) -> Update<Self, F>where
F: FnMut(&mut Self::Item),

Return an iterator adaptor that applies a mutating function to each element before yielding it. Read more

source

fn next_tuple<T>(&mut self) -> Option<T>where
Self: Iterator<Item = <T as TupleCollect>::Item>,
T: HomogeneousTuple,

Advances the iterator and returns the next items grouped in a tuple of a specific size (up to 12). Read more

source

fn collect_tuple<T>(self) -> Option<T>where
Self: Iterator<Item = <T as TupleCollect>::Item>,
T: HomogeneousTuple,

Collects all items from the iterator into a tuple of a specific size (up to 12). Read more

source

fn find_position(&mut self, pred: P) -> Option<(usize, Self::Item)>where
P: FnMut(&Self::Item) -> bool,

Find the position and value of the first element satisfying a predicate. Read more

source

fn find_or_last(self, predicate: P) -> Option<Self::Item>where
P: FnMut(&Self::Item) -> bool,

Find the value of the first element satisfying a predicate or return the last element, if any. Read more

source

fn find_or_first(self, predicate: P) -> Option<Self::Item>where
P: FnMut(&Self::Item) -> bool,

Find the value of the first element satisfying a predicate or return the first element, if any. Read more

source

fn contains<Q>(&mut self, query: &Q) -> boolwhere
Q: PartialEq<Q>,
Self::Item: Borrow<Q>,

Returns true if the given item is present in this iterator. Read more

source

fn all_equal(&mut self) -> boolwhere
Self::Item: PartialEq<Self::Item>,

Check whether all elements compare equal. Read more

source

fn all_unique(&mut self) -> boolwhere
Self::Item: Eq,
Self::Item: Hash,

Check whether all elements are unique (non equal). Read more

source

fn dropping(self, n: usize) -> Self

Consume the first n elements from the iterator eagerly, and return the same iterator again. Read more

source

fn dropping_back(self, n: usize) -> Selfwhere
Self: DoubleEndedIterator,

Consume the last n elements from the iterator eagerly, and return the same iterator again. Read more

source

fn foreach<F>(self, f: F)where
F: FnMut(Self::Item),

👎Deprecated since 0.8.0:

Use .for_each() instead

Run the closure f eagerly on each element of the iterator. Read more

source

fn concat(self) -> Self::Itemwhere
 Self::Item: Extend<<Self::Item as IntoIterator>::Item>,
 Self::Item: IntoIterator,
 Self::Item: Default,

Combine all an iterator’s elements into one element by using Extend. Read more

source

fn collect_vec(self) -> Vec<Self::Item, Global>

.collect_vec() is simply a type specialization of Iterator::collect, for convenience. Read more

source

fn try_collect<T, U, E>(self) -> Result<U, E>where
Self: Iterator<Item = Result<T, E>>,
Result<U, E>: FromIterator<Result<T, E>>,

.try_collect() is more convenient way of writing .collect::<Result<_, _>>() Read more

source

fn set_from<'a, A, J>(&mut self, from: J) -> usizewhere
 A: 'a,
 Self: Iterator<Item = &'a mut A>,
 J: IntoIterator<Item = A>,

Assign to each reference in self from the from iterator, stopping at the shortest of the two iterators. Read more

source

fn join(&mut self, sep: &str) -> Stringwhere
Self::Item: Display,

Combine all iterator elements into one String, separated by sep. Read more

source

fn format(self, sep: &str) -> Format<'_, Self>

Format all iterator elements, separated by sep. Read more

source

fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>where
F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display)) -> Result<(), Error>,

Format all iterator elements, separated by sep. Read more

source

fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where
Self: Iterator<Item = Result<A, E>>,
F: FnMut(B, A) -> B,

👎Deprecated since 0.10.0:

Use .fold_ok() instead

See .fold_ok().

source

fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where
Self: Iterator<Item = Result<A, E>>,
F: FnMut(B, A) -> B,

Fold Result values from an iterator. Read more

source

fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Optionwhere
Self: Iterator<Item = Option<A>>,
F: FnMut(B, A) -> B,

Fold Option values from an iterator. Read more

source

fn fold1<F>(self, f: F) -> Option<Self::Item>where
F: FnMut(Self::Item, Self::Item) -> Self::Item,

👎Deprecated since 0.10.2:

Use Iterator::reduce instead

Accumulator of the elements in the iterator. Read more

source

fn tree_fold1<F>(self, f: F) -> Option<Self::Item>where
F: FnMut(Self::Item, Self::Item) -> Self::Item,

Accumulate the elements in the iterator in a tree-like manner. Read more

source

fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhilewhere
F: FnMut(B, Self::Item) -> FoldWhile,

An iterator method that applies a function, producing a single, final value. Read more

source

fn sum1<S>(self) -> Option<S>where
S: Sum<Self::Item>,

Iterate over the entire iterator and add all the elements. Read more

source