Struct peruse::parsers::RecursiveParser

pub struct RecursiveParser<I: ?Sized, O, F> where
    F: Fn() -> Box<Parser<I = I, O = O>>,  { /* fields omitted */ }

Trait Implementations

impl<I: ?Sized, O, F> Parser for RecursiveParser<I, O, F> where
    F: Fn() -> Box<Parser<I = I, O = O>>, 

type I = I

type O = O

fn parse<'a>(&self, data: &'a Self::I) -> ParseResult<&'a Self::I, Self::O>

impl<I: ?Sized, O, F> ParserCombinator for RecursiveParser<I, O, F> where
    F: Fn() -> Box<Parser<I = I, O = O>>, 

fn then<P: Parser<I = Self::I>>(&self, p: P) -> ChainedParser<Self, P>

Chain this parser with another parser, creating new parser that returns a tuple of their results

fn then_r<P: ParserCombinator<I = Self::I>>(
    &self,
    p: P
) -> MapParser<Self::I, ChainedParser<Self, P>, P::O>

Chain this parser with another parser, but toss the value from this parser

fn then_l<P: ParserCombinator<I = Self::I>>(
    &self,
    p: P
) -> MapParser<Self::I, ChainedParser<Self, P>, Self::O>

Chain this parser with another parser, but toss the value from the other parser

fn repeat(&self) -> RepeatParser<Self>

Create a new parser that will repeat this parser until it returns an error

fn map<T, F: 'static + Fn(Self::O) -> T>(
    &self,
    f: F
) -> MapParser<Self::I, Self, T>

Map the value of this parser

fn or<P: Parser<I = Self::I, O = Self::O>>(&self, p: P) -> OrParser<Self, P>

Create a disjunction with another parser. If this parser produces an error, the other parser will be used

impl<I: ?Sized, O, F> Clone for RecursiveParser<I, O, F> where
    F: Fn() -> Box<Parser<I = I, O = O>>, 

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.