prolog_parser 0.7.14

An operator precedence parser for rusty-wam, an up and coming ISO Prolog implementation.
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

use std::iter::Peekable;

// derived from the itertools source.

#[derive(Debug, Clone)]
pub struct PutBackN<I: Iterator> {
    top: Vec<I::Item>,
    iter: Peekable<I>,
}

pub fn put_back_n<I>(iterable: I) -> PutBackN<I::IntoIter>
    where I: IntoIterator
{
    PutBackN {
        top: Vec::new(),
        iter: iterable.into_iter().peekable()
    }
}

impl<I: Iterator> PutBackN<I> {
    #[inline]
    pub fn extend<Iter: Iterator<Item=I::Item>>(&mut self, iter: Iter) {
        let mut buf: Vec<_> = iter.collect();
        buf.reverse();
        
        for i in buf {
            self.top.push(i);
        }
    }
    
    #[inline]
    pub fn put_back(&mut self, x: I::Item) {
        self.top.push(x);
    }

    #[inline]
    pub fn peek(&mut self) -> Option<&I::Item> {
        if self.top.is_empty() {
            self.iter.peek()
        } else {
            self.top.last()
        }
    }
}

impl<I: Iterator> Iterator for PutBackN<I> {
    type Item = I::Item;
    
    #[inline]
    fn next(&mut self) -> Option<I::Item> {
        if self.top.is_empty() {
            self.iter.next()
        } else {
            self.top.pop()
        }
    }
}