oom-parsing 0.0.1

Lightweight Incremental Parser Generator inspired by Regular Expressions and Parsing Expression Grammars
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
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129

use std::collections::vec_deque::{IntoIter, Iter};
use std::collections::VecDeque;
use std::convert::{AsMut, AsRef};
use std::iter::{FromIterator, IntoIterator};
use std::ops::Range;

use crate::Match;

#[derive(Debug, Default)]
pub struct Stack {
    items: VecDeque<Match>,
}

impl Stack {
    pub fn new() -> Stack {
        Stack::default()
    }

    pub fn clear(&mut self) {
        self.items.clear()
    }

    pub fn peek(&self) -> Option<Match> {
        if let Some(matcher) = self.items.front() {
            Some(matcher.clone())
        } else {
            None
        }
    }

    pub fn peek_range(&self, range: &Range<isize>) -> Option<Stack> {
        let substack = if range.start >= 0 && range.end >= 0 {
            self.items
                .range(range.start as usize..range.end as usize)
                .map(Clone::clone)
                .collect::<VecDeque<Match>>()
        } else if range.start < 0 && range.end < 0 {
            let mut items = Vec::<Match>::new();
            for item in self.items.clone() {
                items.push(item);
            }
            items[(range.start * -1) as usize..(range.end * -1) as usize]
                .iter()
                .map(Clone::clone)
                .collect::<VecDeque<Match>>()
        } else {
            panic!("invalid range {:#?}", range);
        };
        if substack.is_empty() {
            None
        } else {
            Some(Stack::from_iter(substack))
        }
    }

    pub fn drop(&self) -> Option<Match> {
        if let Some(matcher) = self.items.back() {
            Some(matcher.clone())
        } else {
            None
        }
    }

    pub fn push<T: Into<Match>>(&mut self, matcher: T) -> Option<Match> {
        self.items.push_front(matcher.into());
        if let Some(matcher) = self.items.front() {
            Some(matcher.clone())
        } else {
            None
        }
    }

    pub fn pop(&mut self) -> Option<Match> {
        if let Some(matcher) = self.items.pop_front() {
            Some(matcher)
        } else {
            None
        }
    }
}

impl AsRef<Stack> for Stack {
    fn as_ref(&self) -> &Stack {
        self
    }
}

impl AsMut<Stack> for Stack {
    fn as_mut(&mut self) -> &mut Stack {
        self
    }
}

impl<'c> FromIterator<&'c Match> for Stack {
    fn from_iter<I: IntoIterator<Item = &'c Match>>(iter: I) -> Self {
        let mut stack = Stack::new();
        for r#match in iter {
            stack.push(r#match.clone());
        }
        stack
    }
}

impl FromIterator<Match> for Stack {
    fn from_iter<I: IntoIterator<Item = Match>>(iter: I) -> Self {
        let mut stack = Stack::new();
        for r#match in iter {
            stack.push(r#match);
        }
        stack
    }
}

impl IntoIterator for Stack {
    type IntoIter = IntoIter<Match>;
    type Item = Match;

    fn into_iter(self) -> IntoIter<Match> {
        self.items.into_iter()
    }
}
impl IntoIterator for &mut Stack {
    type IntoIter = IntoIter<Match>;
    type Item = Match;

    fn into_iter(self) -> IntoIter<Match> {
        self.items.clone().into_iter()
    }
}