bitcoinleveldb-table 0.1.16-alpha.0

abstractions for working with Tables -- a Table is a sorted map from strings to strings. Tables are immutable and persistent. A Table may be safely accessed from multiple threads without external synchronization.
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
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

crate::ix!();

//-------------------------------------------[.cpp/bitcoin/src/leveldb/table/iterator.cc]

impl Drop for LevelDBIteratorInner {
    fn drop(&mut self) {
        todo!();
        /*
            if (!cleanup_head_.IsEmpty()) {
        cleanup_head_.Run();
        for (CleanupNode* node = cleanup_head_.next; node != nullptr;) {
          node->Run();
          CleanupNode* next_node = node->next;
          delete node;
          node = next_node;
        }
      }
        */
    }
}

impl LevelDBIteratorInner {
    
    pub fn new() -> Self {
    
        todo!();
        /*

            cleanup_head_.function = nullptr;
      cleanup_head_.next = nullptr;
        */
    }
    
    /**
      | Clients are allowed to register
      | function/arg1/arg2 triples that will be
      | invoked when this iterator is destroyed.
      |
      | Note that unlike all of the preceding
      | methods, this method is not abstract and
      | therefore clients should not override it.
      */
    pub fn register_cleanup(&mut self, 
        func: LevelDBIteratorCleanupFunction,
        arg1: *mut c_void,
        arg2: *mut c_void)  {
        
        todo!();
        /*
            assert(func != nullptr);
      CleanupNode* node;
      if (cleanup_head_.IsEmpty()) {
        node = &cleanup_head_;
      } else {
        node = new CleanupNode();
        node->next = cleanup_head_.next;
        cleanup_head_.next = node;
      }
      node->function = func;
      node->arg1 = arg1;
      node->arg2 = arg2;
        */
    }
}

///------------------------
pub struct EmptyIterator {
    base:   LevelDBIterator,
    status: Status,
}

impl EmptyIterator {
    
    pub fn new(s: &Status) -> Self {
    
        todo!();
        /*
        : status(s),

        
        */
    }
    
    pub fn valid(&self) -> bool {
        
        todo!();
        /*
            return false;
        */
    }
    
    pub fn seek(&mut self, target: &Slice)  {
        
        todo!();
        /*
        
        */
    }
    
    pub fn seek_to_first(&mut self)  {
        
        todo!();
        /*
        
        */
    }
    
    pub fn seek_to_last(&mut self)  {
        
        todo!();
        /*
        
        */
    }
    
    pub fn next(&mut self)  {
        
        todo!();
        /*
            assert(false);
        */
    }
    
    pub fn prev(&mut self)  {
        
        todo!();
        /*
            assert(false);
        */
    }
    
    pub fn key(&self) -> Slice {
        
        todo!();
        /*
            assert(false);
        return Slice();
        */
    }
    
    pub fn value(&self) -> Slice {
        
        todo!();
        /*
            assert(false);
        return Slice();
        */
    }
    
    pub fn status(&self) -> crate::Status {
        
        todo!();
        /*
            return status_;
        */
    }
}

pub fn new_empty_iterator() -> *mut LevelDBIterator {
    
    todo!();
        /*
            return new EmptyIterator(Status::OK());
        */
}

pub fn new_error_iterator(status: &Status) -> *mut LevelDBIterator {
    
    todo!();
        /*
            return new EmptyIterator(status);
        */
}