Struct One 

pub struct One<T> { /* private fields */ }

Match an item

example

let code = "asd".span();
let a = one('a');
let r = a.parse(code);
assert_eq!(r, Some(0..1))

Implementations

impl<T> One<T>

pub const fn new(val: T) -> Self

Trait Implementations

impl<T: Clone> Clone for One<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for One<T>

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

Formats the value using the given formatter.

impl<I: TimeTravel, T> Parser<I> for One<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, no_retry: bool, 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, no_retry: bool, 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, but ignore EOF

fn dyns(self) -> Dyn<I, Self::Output>

where Self: Sized + 'static,

Wrap to dynamic

impl<T: PartialEq> PartialEq for One<T>

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

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: Eq> Eq for One<T>

impl<T> StructuralPartialEq for One<T>