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

use crate::op_tree::OpTreeInternal;
use crate::types::Key;
use std::fmt::Debug;

#[derive(Debug)]
pub(crate) struct Keys<'a> {
    index: usize,
    last_key: Option<Key>,
    index_back: usize,
    last_key_back: Option<Key>,
    op_tree: &'a OpTreeInternal,
}

impl<'a> Keys<'a> {
    pub(crate) fn new(op_tree: &'a OpTreeInternal) -> Self {
        Self {
            index: 0,
            last_key: None,
            index_back: op_tree.len(),
            last_key_back: None,
            op_tree,
        }
    }
}

impl<'a> Iterator for Keys<'a> {
    type Item = Key;

    fn next(&mut self) -> Option<Self::Item> {
        for i in self.index..self.index_back {
            let op = self.op_tree.get(i)?;
            self.index += 1;
            if Some(op.elemid_or_key()) != self.last_key && op.visible() {
                self.last_key = Some(op.elemid_or_key());
                return Some(op.elemid_or_key());
            }
        }
        None
    }
}

impl<'a> DoubleEndedIterator for Keys<'a> {
    fn next_back(&mut self) -> Option<Self::Item> {
        for i in (self.index..self.index_back).rev() {
            let op = self.op_tree.get(i)?;
            self.index_back -= 1;
            if Some(op.elemid_or_key()) != self.last_key_back && op.visible() {
                self.last_key_back = Some(op.elemid_or_key());
                return Some(op.elemid_or_key());
            }
        }
        None
    }
}