Struct parser_fuck::combinators::Sub

pub struct Sub<T> { /* fields omitted */ }

Match subpart

example

let code = "asd123".span();
let x = sub("asd".chars());
let r = x.parse(code);
assert_eq!(r, Some(0..3))

Methods

impl<T> Sub<T>

pub const fn new(sub: Vec<T>) -> Self

Trait Implementations

impl<T: Clone> Clone for Sub<T>

fn clone(&self) -> Sub<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for Sub<T>

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<T: Eq> Eq for Sub<T>

impl<T, I: IntoIterator<Item = T>> From<I> for Sub<T>

fn from(c: I) -> Self

Performs the conversion.

impl<I: TimeTravel, T> Parser<I> for Sub<T> where
    I::Item: PartialEq<T>, 

type Output = Range<usize>

fn parse(&self, input: I) -> Option<Self::Output>

do parse

fn map<U, F>(self, f: F) -> Map<Self, I, F> where
    Self: Sized,
    F: FnMut(Self::Output) -> U, 

Map a Parser<Output = T> to Parser<Output = U> by applying a function to a contained value

fn and<B>(self, b: B) -> And<Self, B, I> where
    Self: Sized,
    B: Parser<I>, 

Only pass if both subparsers pass

fn or<B>(self, b: B) -> Or<Self, B, I> where
    Self: Sized,
    B: Parser<I, Output = Self::Output>, 

Pass when any subparser passes

fn not(self) -> Not<Self, I> where
    Self: Sized, 

Pass if the subparser fail

fn many(self) -> Many<Self, I> where
    Self: Sized, 

*, >= 0

fn many1(self) -> Many<Self, I> where
    Self: Sized, 

+, >= 1

fn many_min(self, min: usize) -> Many<Self, I> where
    Self: Sized, 

{n,}, >= n

fn many_max(self, max: usize) -> Many<Self, I> where
    Self: Sized, 

{,m}, <= m

fn many1_max(self, max: usize) -> Many<Self, I> where
    Self: Sized, 

{1,m}, >= 1 && <= m

fn many_min_max(self, min: usize, max: usize) -> Many<Self, I> where
    Self: Sized, 

{n,m}, >= n && <= m

fn some(self, count: usize) -> Many<Self, I> where
    Self: Sized, 

{n}, == n

fn may(self) -> May<Self, I> where
    Self: Sized, 

?, 0 or 1

fn iter(self) -> Iter<Self, I> where
    Self: Sized, 

Continuously parse into iterators

fn and_then<U, F>(self, f: F) -> AndThen<Self, I, F> where
    Self: Sized,
    U: Parser<I>,
    F: FnMut(Self::Output) -> U, 

Fail if the subparser fail, otherwise calls f with the new Parser and parse the Parser

fn or_else<U, F>(self, f: F) -> OrElse<Self, I, F> where
    Self: Sized,
    U: Parser<I, Output = Self::Output>,
    F: FnMut() -> U, 

Pass if subparser pass, otherwise calls f and parse the result Parser

fn or_trans<F>(self, f: F) -> OrTrans<Self, I, F> where
    Self: Sized,
    F: FnMut(I, Range<usize>) -> Self::Output, 

Pass if subparser pass, otherwise calls f with error point

fn or_trans_noend<F>(self, f: F) -> OrTrans<Self, I, F> where
    Self: Sized,
    F: FnMut(I, Range<usize>) -> Self::Output, 

fn dyns(self) -> Dyn<I, Self::Output> where
    Self: Sized + 'static, 

Wrap to dynamic

impl<T: PartialEq> PartialEq<Sub<T>> for Sub<T>

fn eq(&self, other: &Sub<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Sub<T>) -> bool

This method tests for !=.

impl<T> StructuralEq for Sub<T>

impl<T> StructuralPartialEq for Sub<T>