Struct leo_parser::parser::ParserContext

pub struct ParserContext { /* fields omitted */ }

Stores a program in tokenized format plus additional context. May be converted into a Program AST by parsing all tokens.

Implementations

impl ParserContext

pub fn new(tokens: Vec<SpannedToken>) -> Self

Returns a new ParserContext type given a vector of tokens.

pub fn eof(&self) -> SyntaxError

Returns an unexpected end of function SyntaxError.

pub fn peek(&self) -> SyntaxResult<&SpannedToken>

Returns a reference to the next token or error if it does not exist.

pub fn peek_token(&self) -> Cow<'_, Token>

pub fn has_next(&self) -> bool

Returns true if the next token exists.

pub fn eat(&mut self, token: Token) -> Option<SpannedToken>

Removes the next token if it exists and returns it, or None if the next token does not exist.

pub fn backtrack(&mut self, token: SpannedToken)

Appends a token to the back of the vector.

pub fn eat_identifier(&mut self) -> Option<Identifier>

Removes the next token if it is a [Token::Ident(_)] and returns it, or None if the next token is not a [Token::Ident(_)] or if the next token does not exist.

pub fn eat_group_partial(
    &mut self
) -> Option<SyntaxResult<(GroupCoordinate, GroupCoordinate, Span)>>

Removes the next two tokens if they are a pair of GroupCoordinate and returns them, or None if the next token is not a GroupCoordinate.

pub fn eat_int(&mut self) -> Option<(PositiveNumber, Span)>

Removes the next token if it is a [Token::Int(_)] and returns it, or None if the next token is not a [Token::Int(_)] or if the next token does not exist.

pub fn eat_any(&mut self, token: &[Token]) -> Option<SpannedToken>

Removes the next token if it exists and returns it, or None if the next token does not exist.

pub fn expect(&mut self, token: Token) -> SyntaxResult<Span>

Returns the span of the next token if it is equal to the given [Token], or error.

pub fn expect_oneof(&mut self, token: &[Token]) -> SyntaxResult<SpannedToken>

Returns the span of the next token if it is equal to one of the given [Token]s, or error.

pub fn expect_loose_identifier(&mut self) -> SyntaxResult<Identifier>

Returns the Identifier of the next token if it is a keyword, [Token::Int(_)], or an Identifier, or error.

pub fn expect_ident(&mut self) -> SyntaxResult<Identifier>

Returns the Identifier of the next token if it is an Identifier, or error.

pub fn expect_any(&mut self) -> SyntaxResult<SpannedToken>

Returns the next token if it exists or return end of function.

impl ParserContext

pub fn parse_expression(&mut self) -> SyntaxResult<Expression>

Returns an Expression AST node if the next token is an expression. Includes circuit init expressions.

pub fn parse_conditional_expression(&mut self) -> SyntaxResult<Expression>

Returns an Expression AST node if the next tokens represent a ternary expression. May or may not include circuit init expressions.

Otherwise, tries to parse the next token using [parse_disjunctive_expression].

pub fn parse_disjunctive_expression(&mut self) -> SyntaxResult<Expression>

Returns an Expression AST node if the next tokens represent a binary or expression.

Otherwise, tries to parse the next token using [parse_conjunctive_expression].

pub fn parse_conjunctive_expression(&mut self) -> SyntaxResult<Expression>

Returns an Expression AST node if the next tokens represent a binary and expression.

Otherwise, tries to parse the next token using [parse_bit_or_expression].

pub fn parse_equality_expression(&mut self) -> SyntaxResult<Expression>

Returns an Expression AST node if the next tokens represent a binary bitwise or expression.

Otherwise, tries to parse the next token using [parse_bit_xor_expression].

Returns an Expression AST node if the next tokens represent a binary bitwise xor expression.

Otherwise, tries to parse the next token using [parse_bit_and_expression].

Returns an Expression AST node if the next tokens represent a binary bitwise and expression.

Otherwise, tries to parse the next token using [parse_equality_expression].

Returns an Expression AST node if the next tokens represent a binary equals or not equals expression.

Otherwise, tries to parse the next token using [parse_ordering_expression].

pub fn parse_ordering_expression(&mut self) -> SyntaxResult<Expression>

Returns an Expression AST node if the next tokens represent a binary relational expression: less than, less than or equals, greater than, greater than or equals.

Otherwise, tries to parse the next token using [parse_shift_expression].

pub fn parse_additive_expression(&mut self) -> SyntaxResult<Expression>

Returns an Expression AST node if the next tokens represent a binary shift expression.

Otherwise, tries to parse the next token using [parse_additive_expression].

Returns an Expression AST node if the next tokens represent a binary addition or subtraction expression.

Otherwise, tries to parse the next token using [parse_mul_div_pow_expression].

pub fn parse_multiplicative_expression(&mut self) -> SyntaxResult<Expression>

Returns an Expression AST node if the next tokens represent a binary multiplication, division, or modulus expression.

Otherwise, tries to parse the next token using [parse_exponential_expression].

pub fn parse_exponential_expression(&mut self) -> SyntaxResult<Expression>

Returns an Expression AST node if the next tokens represent a binary exponentiation expression.

Otherwise, tries to parse the next token using [parse_cast_expression].

pub fn parse_cast_expression(&mut self) -> SyntaxResult<Expression>

Returns an Expression AST node if the next tokens represent a type cast expression.

Otherwise, tries to parse the next token using [parse_unary_expression].

pub fn parse_unary_expression(&mut self) -> SyntaxResult<Expression>

Returns an Expression AST node if the next tokens represent a unary not, negate, or bitwise not expression.

Otherwise, tries to parse the next token using [parse_postfix_expression].

pub fn parse_postfix_expression(&mut self) -> SyntaxResult<Expression>

Returns an Expression AST node if the next tokens represent an array access, circuit member access, function call, or static function call expression.

Otherwise, tries to parse the next token using [parse_primary_expression].

pub fn parse_spread_or_expression(&mut self) -> SyntaxResult<SpreadOrExpression>

Returns a SpreadOrExpression AST node if the next tokens represent an spread or expression.

This method should only be called in the context of an array access expression.

pub fn parse_circuit_expression(
    &mut self,
    identifier: Identifier
) -> SyntaxResult<Expression>

Returns an Expression AST node if the next tokens represent an circuit initialization expression.

pub fn parse_tuple_expression(
    &mut self,
    span: &Span
) -> SyntaxResult<Expression>

Returns an Expression AST node if the next tokens represent an tuple initialization expression.

pub fn parse_array_expression(
    &mut self,
    span: &Span
) -> SyntaxResult<Expression>

Returns an Expression AST node if the next tokens represent an array initialization expression.

pub fn parse_primary_expression(&mut self) -> SyntaxResult<Expression>

Returns an Expression AST node if the next token is a primary expression:

• Literals: field, group, unsigned integer, signed integer, boolean, address
• Aggregate types: array, tuple
• Identifiers: variables, keywords
• self

Returns an expression error if the token cannot be matched.

impl ParserContext

pub fn parse_program(&mut self) -> SyntaxResult<Program>

Returns a Program AST if all tokens can be consumed and represent a valid Leo program.

pub fn parse_annotation(&mut self) -> SyntaxResult<Annotation>

Returns an Annotation AST node if the next tokens represent a supported annotation.

pub fn parse_package_accesses(&mut self) -> SyntaxResult<Vec<PackageAccess>>

Returns a vector of PackageAccess AST nodes if the next tokens represent package access expressions within an import statement.

pub fn parse_package_access(&mut self) -> SyntaxResult<PackageAccess>

Returns a PackageAccess AST node if the next tokens represent a package access expression within an import statement.

pub fn parse_package_name(&mut self) -> SyntaxResult<Identifier>

Returns an Identifier AST node if the next tokens represent a valid package name.

pub fn parse_package_path(&mut self) -> SyntaxResult<PackageOrPackages>

Returns a PackageOrPackages AST node if the next tokens represent a valid package import with accesses.

pub fn parse_import(&mut self) -> SyntaxResult<ImportStatement>

Returns a ImportStatement AST node if the next tokens represent an import statement.

pub fn parse_circuit_member(&mut self) -> SyntaxResult<CircuitMember>

Returns a CircuitMember AST node if the next tokens represent a circuit member variable or circuit member function.

pub fn parse_circuit(&mut self) -> SyntaxResult<(Identifier, Circuit)>

Returns an [(Identifier, Circuit)] tuple of AST nodes if the next tokens represent a circuit name and definition statement.

pub fn parse_function_parameters(&mut self) -> SyntaxResult<FunctionInput>

Returns a FunctionInput AST node if the next tokens represent a function parameter.

pub fn parse_function_declaration(
    &mut self
) -> SyntaxResult<(Identifier, Function)>

Returns an [(Identifier, Function)] AST node if the next tokens represent a function name and function definition.

impl ParserContext

pub fn construct_assignee_access(
    expr: Expression,
    accesses: &mut Vec<AssigneeAccess>
) -> SyntaxResult<Identifier>

Returns an Identifier AST node if the given Expression AST node evaluates to an identifier access. The access is stored in the given accesses.

pub fn construct_assignee(expr: Expression) -> SyntaxResult<Assignee>

Returns an Assignee AST node from the given Expression AST node with accesses.

pub fn parse_statement(&mut self) -> SyntaxResult<Statement>

Returns a Statement AST node if the next tokens represent a statement.

pub fn parse_assign_statement(&mut self) -> SyntaxResult<Statement>

Returns a Block AST node if the next tokens represent a assign, or expression statement.

pub fn parse_block(&mut self) -> SyntaxResult<Block>

Returns a Block AST node if the next tokens represent a block of statements.

pub fn parse_return_statement(&mut self) -> SyntaxResult<ReturnStatement>

Returns a ReturnStatement AST node if the next tokens represent a return statement.

pub fn parse_conditional_statement(
    &mut self
) -> SyntaxResult<ConditionalStatement>

Returns a ConditionalStatement AST node if the next tokens represent a conditional statement.

pub fn parse_loop_statement(&mut self) -> SyntaxResult<IterationStatement>

Returns an IterationStatement AST node if the next tokens represent an iteration statement.

pub fn parse_formatted_string(&mut self) -> SyntaxResult<FormatString>

Returns a FormatString AST node if the next tokens represent a formatted string.

pub fn parse_console_statement(&mut self) -> SyntaxResult<ConsoleStatement>

Returns a ConsoleStatement AST node if the next tokens represent a console statement.

pub fn parse_variable_name(
    &mut self,
    span: &SpannedToken
) -> SyntaxResult<VariableName>

Returns a VariableName AST node if the next tokens represent a variable name with valid keywords.

pub fn parse_definition_statement(
    &mut self
) -> SyntaxResult<DefinitionStatement>

Returns a DefinitionStatement AST node if the next tokens represent a definition statement.

impl ParserContext

pub fn token_to_int_type(token: Token) -> Option<IntegerType>

Returns a IntegerType AST node if the given token is a supported integer type, or None.

pub fn parse_array_dimensions(&mut self) -> SyntaxResult<ArrayDimensions>

Returns an ArrayDimensions AST node if the next tokens represent dimensions for an array type.

pub fn parse_type(&mut self) -> SyntaxResult<(Type, Span)>

Returns a [(Type, Span)] tuple of AST nodes if the next token represents a type. Also returns the span of the parsed token.

Trait Implementations

impl Iterator for ParserContext

type Item = SpannedToken

The type of the elements being iterated over.

fn next(&mut self) -> Option<SpannedToken>

Advances the iterator and returns the next value.

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

Returns the bounds on the remaining length of the iterator.

pub fn count(self) -> usize

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

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

Consumes the iterator, returning the last element.

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

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

recently added

Advances the iterator by n elements.

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

Returns the nth element of the iterator.

pub 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.

pub 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.

pub 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.

pub fn intersperse(self, separator: Self::Item) -> Intersperse<Self> where
    Self::Item: Clone, 

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

recently added

Creates a new iterator which places a copy of separator between adjacent items of the original iterator.

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

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

recently added

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

pub 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.

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

Calls a closure on each element of an iterator.

pub fn filter<P>(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.

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

Creates an iterator that both filters and maps.

pub fn enumerate(self) -> Enumerate<Self>

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

pub 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.

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

Creates an iterator that skips elements based on a predicate.

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

Creates an iterator that yields elements based on a predicate.

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

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

recently added

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

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

Creates an iterator that skips the first n elements.

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

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

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

An iterator adaptor similar to fold that holds internal state and produces a new iterator.

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

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

pub fn flatten(self) -> Flatten<Self> where
    Self::Item: IntoIterator, 

Creates an iterator that flattens nested structure.

pub fn fuse(self) -> Fuse<Self>

Creates an iterator which ends after the first None.

pub 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.

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

Borrows an iterator, rather than consuming it.

#[must_use = "if you really need to exhaust the iterator, consider `.for_each(drop)` instead"]pub fn collect<B>(self) -> B where
    B: FromIterator<Self::Item>, 

Transforms an iterator into a collection.

pub 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.

pub fn partition_in_place<'a, T, P>(self, predicate: P) -> usize where
    Self: DoubleEndedIterator<Item = &'a mut T>,
    T: 'a,
    P: FnMut(&T) -> bool, 

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

new API

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.

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

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

new API

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.

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

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

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

An iterator method that applies a fallible function to each item in the iterator, stopping at the first error and returning that error.

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

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

pub 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.

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

Tests if every element of the iterator matches a predicate.

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

Tests if any element of the iterator matches a predicate.

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

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

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

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

pub fn try_find<F, R>(
    &mut self,
    f: F
) -> Result<Option<Self::Item>, <R as Try>::Error> where
    F: FnMut(&Self::Item) -> R,
    R: Try<Ok = bool>, 

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

new API

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

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

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

pub fn rposition<P>(&mut self, predicate: P) -> Option<usize> where
    Self: ExactSizeIterator + DoubleEndedIterator,
    P: FnMut(Self::Item) -> bool, 

Searches for an element in an iterator from the right, returning its index.

pub fn max(self) -> Option<Self::Item> where
    Self::Item: Ord, 

Returns the maximum element of an iterator.

pub fn min(self) -> Option<Self::Item> where
    Self::Item: Ord, 

Returns the minimum element of an iterator.

pub 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.

pub 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.

pub 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.

pub 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.

pub fn rev(self) -> Rev<Self> where
    Self: DoubleEndedIterator, 

Reverses an iterator’s direction.

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

Converts an iterator of pairs into a pair of containers.

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

Creates an iterator which copies all of its elements.

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

Creates an iterator which clones all of its elements.

pub fn cycle(self) -> Cycle<Self> where
    Self: Clone, 

Repeats an iterator endlessly.

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

Sums the elements of an iterator.

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

Iterates over the entire iterator, multiplying all the elements

pub fn cmp<I>(self, other: I) -> Ordering where
    I: IntoIterator<Item = Self::Item>,
    Self::Item: Ord, 

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

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

🔬 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.

pub 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.

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

🔬 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.

pub fn eq<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialEq<<I as IntoIterator>::Item>, 

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

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

🔬 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.

pub fn ne<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialEq<<I as IntoIterator>::Item>, 

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

pub 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.

pub 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.

pub 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.

pub 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.

pub fn is_sorted(self) -> bool where
    Self::Item: PartialOrd<Self::Item>, 

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

new API

Checks if the elements of this iterator are sorted.

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

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

new API

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

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

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

new API

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