Skip to content
This repository was archived by the owner on Dec 27, 2022. It is now read-only.

Commit c749724

Browse files
authored
Merge pull request #57 from dtolnay/none
Traverse into None-delimited groups
2 parents 091e136 + 51a988b commit c749724

File tree

1 file changed

+20
-6
lines changed

1 file changed

+20
-6
lines changed

src/iter.rs

+20-6
Original file line numberDiff line numberDiff line change
@@ -1,28 +1,42 @@
1-
use proc_macro::{token_stream, TokenStream, TokenTree};
2-
use std::iter::Peekable;
1+
use proc_macro::{token_stream, Delimiter, TokenStream, TokenTree};
32

43
pub type Iter<'a> = &'a mut IterImpl;
54

65
pub struct IterImpl {
7-
tokens: Peekable<token_stream::IntoIter>,
6+
stack: Vec<token_stream::IntoIter>,
7+
peeked: Option<TokenTree>,
88
}
99

1010
pub fn new(tokens: TokenStream) -> IterImpl {
1111
IterImpl {
12-
tokens: tokens.into_iter().peekable(),
12+
stack: vec![tokens.into_iter()],
13+
peeked: None,
1314
}
1415
}
1516

1617
impl IterImpl {
1718
pub fn peek(&mut self) -> Option<&TokenTree> {
18-
self.tokens.peek()
19+
self.peeked = self.next();
20+
self.peeked.as_ref()
1921
}
2022
}
2123

2224
impl Iterator for IterImpl {
2325
type Item = TokenTree;
2426

2527
fn next(&mut self) -> Option<Self::Item> {
26-
self.tokens.next()
28+
if let Some(tt) = self.peeked.take() {
29+
return Some(tt);
30+
}
31+
loop {
32+
let top = self.stack.last_mut()?;
33+
match top.next() {
34+
None => drop(self.stack.pop()),
35+
Some(TokenTree::Group(ref group)) if group.delimiter() == Delimiter::None => {
36+
self.stack.push(group.stream().into_iter());
37+
}
38+
Some(tt) => return Some(tt),
39+
}
40+
}
2741
}
2842
}

0 commit comments

Comments
 (0)