squiid/rust
1
0
Fork 0
Code Issues Pull requests Projects Activity

Implement check_stack nonrecursively

Browse source
This commit is contained in:
David Tolnay 2022-01-18 19:20:33 -08:00
parent 0490e43422
commit a37d272892
No known key found for this signature in database
GPG key ID: F9BA143B95FF6D82
1 changed files with 10 additions and 9 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

19
compiler/rustc_ast_pretty/src/pp.rs
View file

@ -378,27 +378,28 @@ impl Printer {
}
}
fn check_stack(&mut self, k: usize) {
if let Some(&x) = self.scan_stack.front() {
fn check_stack(&mut self, mut k: usize) {
while let Some(&x) = self.scan_stack.front() {
match self.buf[x].token {
Token::Begin(_) => {
if k > 0 {
self.scan_stack.pop_front().unwrap();
self.buf[x].size += self.right_total;
self.check_stack(k - 1);
if k == 0 {
break;
}
self.scan_stack.pop_front().unwrap();
self.buf[x].size += self.right_total;
k -= 1;
}
Token::End => {
// paper says + not =, but that makes no sense.
self.scan_stack.pop_front().unwrap();
self.buf[x].size = 1;
self.check_stack(k + 1);
k += 1;
}
_ => {
self.scan_stack.pop_front().unwrap();
self.buf[x].size += self.right_total;
if k > 0 {
self.check_stack(k);
if k == 0 {
break;
}
}
}