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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180

//! Database Iterator management implementation for versiondb.
use std::{
    io,
    sync::{
        atomic::{AtomicBool, Ordering},
        Arc,
    },
};

use crate::subnet::rpc::{
    database::{self, iterator::BoxedIterator},
    errors::Error,
};

/// Iterator iterates over a versionbd database's key/value pairs.
///
/// ref. <https://pkg.go.dev/github.com/ava-labs/avalanchego/database#Iterator>
pub struct Iterator {
    iterator: BoxedIterator,
    keys: Vec<Vec<u8>>,
    values: Vec<ValueDelete>,
    error: Option<io::Error>,
    closed: Arc<AtomicBool>,
    key: Vec<u8>,
    value: Vec<u8>,
    initialized: Arc<AtomicBool>,
    exhausted: Arc<AtomicBool>,
}

#[derive(Clone, Debug)]
pub struct ValueDelete {
    pub value: Vec<u8>,
    pub delete: bool,
}

impl Iterator {
    pub fn new(
        keys: Vec<Vec<u8>>,
        values: Vec<ValueDelete>,
        closed: Arc<AtomicBool>,
        iterator: BoxedIterator,
    ) -> BoxedIterator {
        Box::new(Self {
            keys,
            values,
            error: None,
            closed,
            initialized: Arc::new(AtomicBool::new(false)),
            exhausted: Arc::new(AtomicBool::new(false)),
            iterator,
            key: vec![],
            value: vec![],
        })
    }
}

#[tonic::async_trait]
impl database::iterator::Iterator for Iterator {
    /// Implements the [`crate::subnet::rpc::database::Iterator`] trait.
    async fn next(&mut self) -> io::Result<bool> {
        // set an error if the underlying database has been closed
        if self.closed.load(Ordering::Relaxed) {
            self.keys.clear();
            self.values.clear();
            self.error = Some(Error::DatabaseClosed.to_err());
            return Ok(false);
        }

        // initialize iterator
        if !self.initialized.load(Ordering::Relaxed) {
            let exhausted = !self.iterator.next().await?;
            self.exhausted.store(exhausted, Ordering::Relaxed);
            self.initialized.store(true, Ordering::Relaxed);
        }

        loop {
            if self.exhausted.load(Ordering::Relaxed) && self.keys.is_empty() {
                self.key.clear();
                self.value.clear();

                return Ok(false);
            }

            if self.exhausted.load(Ordering::Relaxed) {
                let next_key = self.keys.first().unwrap().clone();
                let next_value = self.values.first().unwrap().clone();

                self.keys[0].clear();
                self.keys = self.keys[1..].to_vec();
                self.values[0].value.clear();
                self.values = self.values[1..].to_vec();

                if !next_value.delete {
                    self.key = next_key;
                    self.value = next_value.value;

                    return Ok(true);
                }
            }

            if self.keys.is_empty() {
                self.key = self.iterator.key().await?.to_vec();
                self.value = self.iterator.value().await?.to_vec();
                let exhausted = !self.iterator.next().await?;
                self.exhausted.store(exhausted, Ordering::Relaxed);

                return Ok(true);
            }

            let mem_key = self.keys.first().unwrap().clone();
            let mem_value = self.values.first().unwrap().clone();
            let db_key = self.iterator.key().await?.to_vec();

            if mem_key.lt(&db_key) {
                self.keys[0].clear();
                self.keys = self.keys[1..].to_vec();
                self.values[0].value.clear();
                self.values = self.values[1..].to_vec();

                if !mem_value.delete {
                    self.key = mem_key;
                    self.value = mem_value.value.clone();

                    return Ok(true);
                }
            }

            if db_key.lt(&mem_key) {
                self.key = db_key.to_vec();
                self.value = self.iterator.value().await?.to_vec();
                let exhausted = !self.iterator.next().await?;
                self.exhausted.store(exhausted, Ordering::Relaxed);

                return Ok(true);
            }

            self.keys[0].clear();
            self.keys = self.keys[1..].to_vec();
            self.values[0].value.clear();
            self.values = self.values[1..].to_vec();

            let exhausted = !self.iterator.next().await?;
            self.exhausted.store(exhausted, Ordering::Relaxed);

            if !mem_value.delete {
                self.key = mem_key.to_owned();
                self.value = mem_value.value.clone();
                return Ok(true);
            }
        }
    }

    /// Implements the [`crate::subnet::rpc::database::Iterator`] trait.
    async fn error(&mut self) -> io::Result<()> {
        if let Some(err) = &self.error {
            return Err(io::Error::new(err.kind(), err.to_string()));
        }

        self.iterator.error().await
    }

    /// Implements the [`crate::subnet::rpc::database::Iterator`] trait.
    async fn key(&self) -> io::Result<&[u8]> {
        Ok(&self.key)
    }

    /// Implements the [`crate::subnet::rpc::database::Iterator`] trait.
    async fn value(&self) -> io::Result<&[u8]> {
        Ok(&self.value)
    }

    /// Implements the [`crate::subnet::rpc::database::Iterator`] trait.
    async fn release(&mut self) {
        self.key.clear();
        self.value.clear();
        self.keys.clear();
        self.values.clear();
        self.iterator.release().await
    }
}