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
use std::fmt;
use std::rc::Rc;
use super::pair::{self, Pair};
use super::queueable_token::QueueableToken;
use super::tokens::{self, Tokens};
use RuleType;
pub struct FlatPairs<'i, R> {
queue: Rc<Vec<QueueableToken<R>>>,
input: &'i str,
start: usize,
end: usize
}
pub fn new<R: RuleType>(
queue: Rc<Vec<QueueableToken<R>>>,
input: &str,
start: usize,
end: usize
) -> FlatPairs<R> {
FlatPairs {
queue,
input,
start,
end
}
}
impl<'i, R: RuleType> FlatPairs<'i, R> {
#[inline]
pub fn tokens(self) -> Tokens<'i, R> {
tokens::new(self.queue, self.input, self.start, self.end)
}
fn next_start(&mut self) {
self.start += 1;
while self.start < self.end && !self.is_start() {
self.start += 1;
}
}
fn is_start(&self) -> bool {
match self.queue[self.start] {
QueueableToken::Start { .. } => true,
QueueableToken::End { .. } => false
}
}
}
impl<'i, R: RuleType> Iterator for FlatPairs<'i, R> {
type Item = Pair<'i, R>;
fn next(&mut self) -> Option<Self::Item> {
if self.start >= self.end {
return None;
}
let pair = pair::new(Rc::clone(&self.queue), self.input, self.start);
self.next_start();
Some(pair)
}
}
impl<'i, R: RuleType> fmt::Debug for FlatPairs<'i, R> {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
write!(
f,
"FlatPairs {{ pairs: {:?} }}",
self.clone().collect::<Vec<_>>()
)
}
}
impl<'i, R: Clone> Clone for FlatPairs<'i, R> {
fn clone(&self) -> FlatPairs<'i, R> {
FlatPairs {
queue: Rc::clone(&self.queue),
input: self.input,
start: self.start,
end: self.end
}
}
}