Struct rcombinators::combinators::Then

pub struct Then<A: Parser, B: Parser> { /* fields omitted */ }

Applies one parser, discards the result, and returns the second parser's results if the first one succeeded. To skip the input consumed by several parsers, use a Sequence combinators as A.

Methods

impl<A: Parser, B: Parser> Then<A, B>

pub fn new(first: A, second: B) -> Then<A, B>

Trait Implementations

impl<A: Parser, B: Parser> Parser for Then<A, B>

type Result = B::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.