Struct srclang::lexer::Lexer

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

Trait Implementations

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

`type Item = Spanned<Token<'input>>`

The type of the elements being iterated over.

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

Advances the iterator and returns the next value. Read more

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

🔬This is a nightly-only experimental API. (iter_next_chunk)Advances the iterator and returns an array containing the next N values. Read more1.0.0 ·

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

Returns the bounds on the remaining length of the iterator. Read more1.0.0 ·

`fn count(self) -> usizewhere Self: Sized,`

Consumes the iterator, counting the number of iterations and returning it. Read more1.0.0 ·

`fn last(self) -> Option<Self::Item>where Self: Sized,`

Consumes the iterator, returning the last element. Read more

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

🔬This is a nightly-only experimental API. (iter_advance_by)Advances the iterator by n elements. Read more1.0.0 ·

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

Returns the nth element of the iterator. Read more1.28.0 ·

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

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

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

Takes two iterators and creates a new iterator over both in sequence. Read more1.0.0 ·

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

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

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

🔬This is a nightly-only experimental API. (iter_intersperse)Creates a new iterator which places an item generated by separatorbetween adjacent items of the original iterator. Read more1.0.0 ·

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

Takes a closure and creates an iterator which calls that closure on each element. Read more1.21.0 ·

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

Calls a closure on each element of an iterator. Read more1.0.0 ·

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

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

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

Creates an iterator that both filters and maps. Read more1.0.0 ·

`fn enumerate(self) -> Enumerate<Self>where Self: Sized,`

Creates an iterator which gives the current iteration count as well as the next value. Read more1.0.0 ·

`fn peekable(self) -> Peekable<Self>where Self: Sized,`

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 more1.0.0 ·

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

Creates an iterator that skips elements based on a predicate. Read more1.0.0 ·

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

Creates an iterator that yields elements based on a predicate. Read more1.57.0 ·

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

Creates an iterator that both yields elements based on a predicate and maps. Read more1.0.0 ·

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

Creates an iterator that skips the first n elements. Read more1.0.0 ·

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

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

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

An iterator adapter which, like fold, holds internal state, but unlike fold, produces a new iterator. Read more1.0.0 ·

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

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

`fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>where Self: Sized, F: FnMut(&[Self::Item; N]) -> R,`

🔬This is a nightly-only experimental API. (iter_map_windows)Calls the given function f for each contiguous window of size N overself and returns an iterator over the outputs of f. Like slice::windows(), the windows during mapping overlap as well. Read more1.0.0 ·

`fn fuse(self) -> Fuse<Self>where Self: Sized,`

Creates an iterator which ends after the first None. Read more1.0.0 ·

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

Does something with each element of an iterator, passing the value on. Read more1.0.0 ·

`fn by_ref(&mut self) -> &mut Selfwhere Self: Sized,`

Borrows an iterator, rather than consuming it. Read more1.0.0 ·

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

Transforms an iterator into a collection. Read more

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

🔬This is a nightly-only experimental API. (iter_collect_into)Collects all the items from an iterator into a collection. Read more1.0.0 ·

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

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

`fn is_partitioned(self, predicate: P) -> boolwhere Self: Sized, 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 more1.27.0 ·

`fn try_fold<B, F, R>(&mut self, init: B, f: F) -> Rwhere Self: Sized, 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 more1.27.0 ·

`fn try_for_each<F, R>(&mut self, f: F) -> Rwhere Self: Sized, 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 more1.0.0 ·

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

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

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

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

`fn try_reduce<F, R>( &mut self, f: F ) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryTypewhere Self: Sized, 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 more1.0.0 ·

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

Tests if every element of the iterator matches a predicate. Read more1.0.0 ·

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

Tests if any element of the iterator matches a predicate. Read more1.0.0 ·

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

Searches for an element of an iterator that satisfies a predicate. Read more1.30.0 ·

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

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

`fn try_find<F, R>( &mut self, f: F ) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryTypewhere Self: Sized, 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 more1.0.0 ·

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

Searches for an element in an iterator, returning its index. Read more1.6.0 ·

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

Returns the element that gives the maximum value from the specified function. Read more1.15.0 ·

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

Returns the element that gives the maximum value with respect to the specified comparison function. Read more1.6.0 ·

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

Returns the element that gives the minimum value from the specified function. Read more1.15.0 ·

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

Returns the element that gives the minimum value with respect to the specified comparison function. Read more1.0.0 ·

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

Converts an iterator of pairs into a pair of containers. Read more1.36.0 ·

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

Creates an iterator which copies all of its elements. Read more1.0.0 ·

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

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

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

🔬This is a nightly-only experimental API. (iter_array_chunks)Returns an iterator over N elements of the iterator at a time. Read more1.11.0 ·

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

Sums the elements of an iterator. Read more1.11.0 ·

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

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

`fn cmp_by<I, F>(self, other: I, cmp: F) -> Orderingwhere Self: Sized, 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 more1.5.0 ·

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

Lexicographically compares the PartialOrd elements of this Iterator with those of another. The comparison works like short-circuit evaluation, returning a result without comparing the remaining elements. As soon as an order can be determined, the evaluation stops and a result is returned. Read more

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

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

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

`fn eq_by<I, F>(self, other: I, eq: F) -> boolwhere Self: Sized, 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 more1.5.0 ·

src lang