Struct rcombinators::combinators::Alternative

pub struct Alternative<T>(_);

Methods

impl<T> Alternative<T>

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

Trait Implementations

impl<R, P0: Parser<Result = R>, P1: Parser<Result = R>> Parser for Alternative<(P0, P1)>

type Result = R

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<R, P0: Parser<Result = R>, P1: Parser<Result = R>, P2: Parser<Result = R>> Parser for Alternative<(P0, P1, P2)>

type Result = R

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<R, P0: Parser<Result = R>, P1: Parser<Result = R>, P2: Parser<Result = R>, P3: Parser<Result = R>> Parser for Alternative<(P0, P1, P2, P3)>

type Result = R

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<R, P0: Parser<Result = R>, P1: Parser<Result = R>, P2: Parser<Result = R>, P3: Parser<Result = R>, P4: Parser<Result = R>> Parser for Alternative<(P0, P1, P2, P3, P4)>

type Result = R

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<R, P0: Parser<Result = R>, P1: Parser<Result = R>, P2: Parser<Result = R>, P3: Parser<Result = R>, P4: Parser<Result = R>, P5: Parser<Result = R>> Parser for Alternative<(P0, P1, P2, P3, P4, P5)>

type Result = R

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<R, P0: Parser<Result = R>, P1: Parser<Result = R>, P2: Parser<Result = R>, P3: Parser<Result = R>, P4: Parser<Result = R>, P5: Parser<Result = R>, P6: Parser<Result = R>> Parser for Alternative<(P0, P1, P2, P3, P4, P5, P6)>

type Result = R

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<R, P0: Parser<Result = R>, P1: Parser<Result = R>, P2: Parser<Result = R>, P3: Parser<Result = R>, P4: Parser<Result = R>, P5: Parser<Result = R>, P6: Parser<Result = R>, P7: Parser<Result = R>> Parser for Alternative<(P0, P1, P2, P3, P4, P5, P6, P7)>

type Result = R

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<R, P0: Parser<Result = R>, P1: Parser<Result = R>, P2: Parser<Result = R>, P3: Parser<Result = R>, P4: Parser<Result = R>, P5: Parser<Result = R>, P6: Parser<Result = R>, P7: Parser<Result = R>, P8: Parser<Result = R>> Parser for Alternative<(P0, P1, P2, P3, P4, P5, P6, P7, P8)>

type Result = R

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<R, P0: Parser<Result = R>, P1: Parser<Result = R>, P2: Parser<Result = R>, P3: Parser<Result = R>, P4: Parser<Result = R>, P5: Parser<Result = R>, P6: Parser<Result = R>, P7: Parser<Result = R>, P8: Parser<Result = R>, P9: Parser<Result = R>> Parser for Alternative<(P0, P1, P2, P3, P4, P5, P6, P7, P8, P9)>

type Result = R

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.