Struct Sequence

pub struct Sequence<T>(/* private fields */);

Sequence concatenates parsers and only succeeds if all of them do. T is always a tuple in order for Sequence to implement the Parser trait. The result is a tuple of all the parser results.

Individual parsers need to have result types implementing Default.

Implementations

impl<T> Sequence<T>

pub fn new(tuple: T) -> Sequence<T>

Trait Implementations

impl<P0: Parser<Result = impl Default>, P1: Parser<Result = impl Default>> Parser for Sequence<(P0, P1)>

type Result = (<P0 as Parser>::Result, <P1 as Parser>::Result)

fn parse( &mut self, st: &mut ParseState<impl Iterator<Item = char>>, ) -> ParseResult<Self::Result>

parse consumes input from st and returns a result or an error.

fn apply<R2, F: Fn(Self::Result) -> ParseResult<R2>>( self, f: F, ) -> Transform<Self::Result, R2, Self, F>

where Self: Sized,

apply transforms the result of this parser using a Transform combinator.

fn then<R2, P: Parser<Result = R2>>(self, p: P) -> Then<Self, P>

where Self: Sized,

then attempts to parse input, and if it succeeds, executes parser p, only returning p’s result. This is useful for chaining parsers of which the results are not need.

impl<P0: Parser<Result = impl Default>, P1: Parser<Result = impl Default>, P2: Parser<Result = impl Default>> Parser for Sequence<(P0, P1, P2)>

type Result = (<P0 as Parser>::Result, <P1 as Parser>::Result, <P2 as Parser>::Result)

fn parse( &mut self, st: &mut ParseState<impl Iterator<Item = char>>, ) -> ParseResult<Self::Result>

parse consumes input from st and returns a result or an error.

fn apply<R2, F: Fn(Self::Result) -> ParseResult<R2>>( self, f: F, ) -> Transform<Self::Result, R2, Self, F>

where Self: Sized,

apply transforms the result of this parser using a Transform combinator.

fn then<R2, P: Parser<Result = R2>>(self, p: P) -> Then<Self, P>

where Self: Sized,

then attempts to parse input, and if it succeeds, executes parser p, only returning p’s result. This is useful for chaining parsers of which the results are not need.

impl<P0: Parser<Result = impl Default>, P1: Parser<Result = impl Default>, P2: Parser<Result = impl Default>, P3: Parser<Result = impl Default>> Parser for Sequence<(P0, P1, P2, P3)>

type Result = (<P0 as Parser>::Result, <P1 as Parser>::Result, <P2 as Parser>::Result, <P3 as Parser>::Result)

fn parse( &mut self, st: &mut ParseState<impl Iterator<Item = char>>, ) -> ParseResult<Self::Result>

parse consumes input from st and returns a result or an error.

fn apply<R2, F: Fn(Self::Result) -> ParseResult<R2>>( self, f: F, ) -> Transform<Self::Result, R2, Self, F>

where Self: Sized,

apply transforms the result of this parser using a Transform combinator.

fn then<R2, P: Parser<Result = R2>>(self, p: P) -> Then<Self, P>

where Self: Sized,

then attempts to parse input, and if it succeeds, executes parser p, only returning p’s result. This is useful for chaining parsers of which the results are not need.

impl<P0: Parser<Result = impl Default>, P1: Parser<Result = impl Default>, P2: Parser<Result = impl Default>, P3: Parser<Result = impl Default>, P4: Parser<Result = impl Default>> Parser for Sequence<(P0, P1, P2, P3, P4)>

type Result = (<P0 as Parser>::Result, <P1 as Parser>::Result, <P2 as Parser>::Result, <P3 as Parser>::Result, <P4 as Parser>::Result)

fn parse( &mut self, st: &mut ParseState<impl Iterator<Item = char>>, ) -> ParseResult<Self::Result>

parse consumes input from st and returns a result or an error.

fn apply<R2, F: Fn(Self::Result) -> ParseResult<R2>>( self, f: F, ) -> Transform<Self::Result, R2, Self, F>

where Self: Sized,

apply transforms the result of this parser using a Transform combinator.

fn then<R2, P: Parser<Result = R2>>(self, p: P) -> Then<Self, P>

where Self: Sized,

then attempts to parse input, and if it succeeds, executes parser p, only returning p’s result. This is useful for chaining parsers of which the results are not need.

impl<P0: Parser<Result = impl Default>, P1: Parser<Result = impl Default>, P2: Parser<Result = impl Default>, P3: Parser<Result = impl Default>, P4: Parser<Result = impl Default>, P5: Parser<Result = impl Default>> Parser for Sequence<(P0, P1, P2, P3, P4, P5)>

type Result = (<P0 as Parser>::Result, <P1 as Parser>::Result, <P2 as Parser>::Result, <P3 as Parser>::Result, <P4 as Parser>::Result, <P5 as Parser>::Result)

fn parse( &mut self, st: &mut ParseState<impl Iterator<Item = char>>, ) -> ParseResult<Self::Result>

parse consumes input from st and returns a result or an error.

fn apply<R2, F: Fn(Self::Result) -> ParseResult<R2>>( self, f: F, ) -> Transform<Self::Result, R2, Self, F>

where Self: Sized,

apply transforms the result of this parser using a Transform combinator.

fn then<R2, P: Parser<Result = R2>>(self, p: P) -> Then<Self, P>

where Self: Sized,

then attempts to parse input, and if it succeeds, executes parser p, only returning p’s result. This is useful for chaining parsers of which the results are not need.

impl<P0: Parser<Result = impl Default>, P1: Parser<Result = impl Default>, P2: Parser<Result = impl Default>, P3: Parser<Result = impl Default>, P4: Parser<Result = impl Default>, P5: Parser<Result = impl Default>, P6: Parser<Result = impl Default>> Parser for Sequence<(P0, P1, P2, P3, P4, P5, P6)>

type Result = (<P0 as Parser>::Result, <P1 as Parser>::Result, <P2 as Parser>::Result, <P3 as Parser>::Result, <P4 as Parser>::Result, <P5 as Parser>::Result, <P6 as Parser>::Result)

fn parse( &mut self, st: &mut ParseState<impl Iterator<Item = char>>, ) -> ParseResult<Self::Result>

parse consumes input from st and returns a result or an error.

fn apply<R2, F: Fn(Self::Result) -> ParseResult<R2>>( self, f: F, ) -> Transform<Self::Result, R2, Self, F>

where Self: Sized,

apply transforms the result of this parser using a Transform combinator.

fn then<R2, P: Parser<Result = R2>>(self, p: P) -> Then<Self, P>

where Self: Sized,

then attempts to parse input, and if it succeeds, executes parser p, only returning p’s result. This is useful for chaining parsers of which the results are not need.

impl<P0: Parser<Result = impl Default>, P1: Parser<Result = impl Default>, P2: Parser<Result = impl Default>, P3: Parser<Result = impl Default>, P4: Parser<Result = impl Default>, P5: Parser<Result = impl Default>, P6: Parser<Result = impl Default>, P7: Parser<Result = impl Default>> Parser for Sequence<(P0, P1, P2, P3, P4, P5, P6, P7)>

type Result = (<P0 as Parser>::Result, <P1 as Parser>::Result, <P2 as Parser>::Result, <P3 as Parser>::Result, <P4 as Parser>::Result, <P5 as Parser>::Result, <P6 as Parser>::Result, <P7 as Parser>::Result)

fn parse( &mut self, st: &mut ParseState<impl Iterator<Item = char>>, ) -> ParseResult<Self::Result>

parse consumes input from st and returns a result or an error.

fn apply<R2, F: Fn(Self::Result) -> ParseResult<R2>>( self, f: F, ) -> Transform<Self::Result, R2, Self, F>

where Self: Sized,

apply transforms the result of this parser using a Transform combinator.

fn then<R2, P: Parser<Result = R2>>(self, p: P) -> Then<Self, P>

where Self: Sized,

then attempts to parse input, and if it succeeds, executes parser p, only returning p’s result. This is useful for chaining parsers of which the results are not need.

impl<P0: Parser<Result = impl Default>, P1: Parser<Result = impl Default>, P2: Parser<Result = impl Default>, P3: Parser<Result = impl Default>, P4: Parser<Result = impl Default>, P5: Parser<Result = impl Default>, P6: Parser<Result = impl Default>, P7: Parser<Result = impl Default>, P8: Parser<Result = impl Default>> Parser for Sequence<(P0, P1, P2, P3, P4, P5, P6, P7, P8)>

type Result = (<P0 as Parser>::Result, <P1 as Parser>::Result, <P2 as Parser>::Result, <P3 as Parser>::Result, <P4 as Parser>::Result, <P5 as Parser>::Result, <P6 as Parser>::Result, <P7 as Parser>::Result, <P8 as Parser>::Result)

fn parse( &mut self, st: &mut ParseState<impl Iterator<Item = char>>, ) -> ParseResult<Self::Result>

parse consumes input from st and returns a result or an error.

fn apply<R2, F: Fn(Self::Result) -> ParseResult<R2>>( self, f: F, ) -> Transform<Self::Result, R2, Self, F>

where Self: Sized,

apply transforms the result of this parser using a Transform combinator.

fn then<R2, P: Parser<Result = R2>>(self, p: P) -> Then<Self, P>

where Self: Sized,

then attempts to parse input, and if it succeeds, executes parser p, only returning p’s result. This is useful for chaining parsers of which the results are not need.

impl<P0: Parser<Result = impl Default>, P1: Parser<Result = impl Default>, P2: Parser<Result = impl Default>, P3: Parser<Result = impl Default>, P4: Parser<Result = impl Default>, P5: Parser<Result = impl Default>, P6: Parser<Result = impl Default>, P7: Parser<Result = impl Default>, P8: Parser<Result = impl Default>, P9: Parser<Result = impl Default>> Parser for Sequence<(P0, P1, P2, P3, P4, P5, P6, P7, P8, P9)>

type Result = (<P0 as Parser>::Result, <P1 as Parser>::Result, <P2 as Parser>::Result, <P3 as Parser>::Result, <P4 as Parser>::Result, <P5 as Parser>::Result, <P6 as Parser>::Result, <P7 as Parser>::Result, <P8 as Parser>::Result, <P9 as Parser>::Result)

fn parse( &mut self, st: &mut ParseState<impl Iterator<Item = char>>, ) -> ParseResult<Self::Result>

parse consumes input from st and returns a result or an error.

fn apply<R2, F: Fn(Self::Result) -> ParseResult<R2>>( self, f: F, ) -> Transform<Self::Result, R2, Self, F>

where Self: Sized,

apply transforms the result of this parser using a Transform combinator.

fn then<R2, P: Parser<Result = R2>>(self, p: P) -> Then<Self, P>

where Self: Sized,

then attempts to parse input, and if it succeeds, executes parser p, only returning p’s result. This is useful for chaining parsers of which the results are not need.