parsy 0.5.6

An easy-to-use, efficient parser combinators library
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37

use std::marker::PhantomData;

use perfect_derive::perfect_derive;

use crate::{PResult, Parser, ParserInput};

#[perfect_derive(Debug, Clone, Copy)]
pub struct Padded<T, TP: Parser<T>, P, PP: Parser<P>> {
    middle: TP,
    padding: PP,
    _m: PhantomData<T>,
    _p: PhantomData<P>,
}

impl<T, TP: Parser<T>, P, PP: Parser<P>> Padded<T, TP, P, PP> {
    pub fn new(middle: TP, padding: PP) -> Self {
        Self {
            middle,
            padding,
            _m: PhantomData,
            _p: PhantomData,
        }
    }
}

impl<T, TP: Parser<T>, P, PP: Parser<P>> Parser<T> for Padded<T, TP, P, PP> {
    fn parse_inner(&self, input: &mut ParserInput) -> PResult<T> {
        let start = self.padding.parse(input)?;
        let middle = self.middle.parse(input)?;
        let end = self.padding.parse(input)?;

        Ok(start
            .combine(middle)
            .combine(end)
            .map(|((_, data), _)| data))
    }
}