Struct rcombinators::combinators::PartialSequence

pub struct PartialSequence<T>(_);

PartialSequence concatenates parsers and tries to parse as far as possible.

Individual parsers need to have result types implementing Default.

Methods

impl<T> PartialSequence<T>

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

Trait Implementations

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

type Result = (Option<P0::Result>, Option<P1::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 PartialSequence<(P0, P1, P2)>

type Result = (Option<P0::Result>, Option<P1::Result>, Option<P2::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 PartialSequence<(P0, P1, P2, P3)>

type Result = (Option<P0::Result>, Option<P1::Result>, Option<P2::Result>, Option<P3::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 PartialSequence<(P0, P1, P2, P3, P4)>

type Result = (Option<P0::Result>, Option<P1::Result>, Option<P2::Result>, Option<P3::Result>, Option<P4::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 PartialSequence<(P0, P1, P2, P3, P4, P5)>

type Result = (Option<P0::Result>, Option<P1::Result>, Option<P2::Result>, Option<P3::Result>, Option<P4::Result>, Option<P5::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 PartialSequence<(P0, P1, P2, P3, P4, P5, P6)>

type Result = (Option<P0::Result>, Option<P1::Result>, Option<P2::Result>, Option<P3::Result>, Option<P4::Result>, Option<P5::Result>, Option<P6::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 PartialSequence<(P0, P1, P2, P3, P4, P5, P6, P7)>

type Result = (Option<P0::Result>, Option<P1::Result>, Option<P2::Result>, Option<P3::Result>, Option<P4::Result>, Option<P5::Result>, Option<P6::Result>, Option<P7::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 PartialSequence<(P0, P1, P2, P3, P4, P5, P6, P7, P8)>

type Result = (Option<P0::Result>, Option<P1::Result>, Option<P2::Result>, Option<P3::Result>, Option<P4::Result>, Option<P5::Result>, Option<P6::Result>, Option<P7::Result>, Option<P8::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 PartialSequence<(P0, P1, P2, P3, P4, P5, P6, P7, P8, P9)>

type Result = (Option<P0::Result>, Option<P1::Result>, Option<P2::Result>, Option<P3::Result>, Option<P4::Result>, Option<P5::Result>, Option<P6::Result>, Option<P7::Result>, Option<P8::Result>, Option<P9::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.