Struct Range 

pub struct Range<T> {
    pub start: usize,
    pub end: usize,
    /* private fields */
}

Wrapper that records the [start, end) input span its ranged value was parsed from.

Fields

start: usize

Byte offset where the ranged value started matching.

end: usize

Byte offset just past where the ranged value finished matching.

Implementations

impl<T> Range<T>

pub fn new(start: usize, ranged: T, end: usize) -> Self

Construct a Range from an already-known span.

pub fn map<U>(self, f: impl FnOnce(T) -> U) -> Range<U>

Apply f to the ranged value, keeping the same span.

pub fn as_ref(&self) -> Range<&T>

Borrow the ranged value, keeping the same span.

impl<T> Range<Option<T>>

pub fn transpose(self) -> Option<Range<T>>

Swap Range<Option<T>> for Option<Range<T>>.

impl<T, E> Range<Result<T, E>>

pub fn transpose(self) -> Result<Range<T>, E>

Swap Range<Result<T, E>> for Result<Range<T>, E>.

Trait Implementations

impl<T: Clone> Clone for Range<T>

fn clone(&self) -> Range<T>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug> Debug for Range<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T> Deref for Range<T>

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<T: Eq> Eq for Range<T>

impl<T: Grammar> Grammar for Range<T>

type First = <T as Grammar>::First

The set of bytes (and whether empty input is valid) this grammar could start with — used to fast-path-reject an alternative before actually trying to parse it. A manual impl Grammar picks its First one of three ways, in order of preference:

fn parse_at(input: &str, pos: usize, state: State<'_>) -> Option<(Self, usize)>

Attempt to parse Self starting at pos, returning the value and the position just past it, or None on failure.

fn scan_at(input: &str, pos: usize, state: State<'_>) -> Option<usize>

Like parse_at, but only checks well-formedness and returns the end position.

fn print_to(&self, buf: &mut String)

Serialize self back to text, appending to buf.

fn to_bnf() -> Expr

Describe this grammar as a BNF/EBNF expression, for use in a referencing rule’s own definition.

fn fail_at(pos: usize, state: State<'_>) -> bool

Record what this grammar would have expected at pos, without attempting to actually parse — used when a caller already knows (e.g. via First) that this alternative cannot match here, but still wants it traced.

fn parse(input: &str) -> Result<Self, Error>

Parse the entire input as Self, failing if any input is left unconsumed.

fn parse_prefix(input: &str) -> Result<(Self, usize), Error>

Like parse, but doesn’t require consuming all of input — returns the byte position just past the match, leaving any remaining input unexamined.

fn scan(input: &str) -> Result<(), Error>

Like parse, but only checks that input is well-formed and discards the parsed value.

fn scan_prefix(input: &str) -> Result<usize, Error>

Like scan, but doesn’t require consuming all of input — returns the byte position just past the match, leaving any remaining input unexamined.

fn print(&self) -> String

Serialize self to a new String; see print_to.

impl<T> IntoInner<T> for Range<T>

fn into_inner(self) -> T

Consume self, discarding whatever structure wrapped T.

impl<T: PartialEq> PartialEq for Range<T>

fn eq(&self, other: &Range<T>) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl<T: PartialEq> StructuralPartialEq for Range<T>