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
|
// Copyright 2018-2019 Mozilla
//
// Licensed under the Apache License, Version 2.0 (the "License"); you may not use
// this file except in compliance with the License. You may obtain a copy of the
// License at http://www.apache.org/licenses/LICENSE-2.0
// Unless required by applicable law or agreed to in writing, software distributed
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
// specific language governing permissions and limitations under the License.
use std::{
collections::{BTreeMap, BTreeSet},
sync::Arc,
};
use serde_derive::{Deserialize, Serialize};
use super::DatabaseFlagsImpl;
type Key = Box<[u8]>;
type Value = Box<[u8]>;
#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct Snapshot {
flags: DatabaseFlagsImpl,
#[cfg(not(feature = "db-dup-sort"))]
map: Arc<BTreeMap<Key, Value>>,
#[cfg(feature = "db-dup-sort")]
map: Arc<BTreeMap<Key, BTreeSet<Value>>>,
}
impl Snapshot {
pub(crate) fn new(flags: Option<DatabaseFlagsImpl>) -> Snapshot {
Snapshot {
flags: flags.unwrap_or_default(),
map: Default::default(),
}
}
pub(crate) fn flags(&self) -> &DatabaseFlagsImpl {
&self.flags
}
pub(crate) fn clear(&mut self) {
self.map = Default::default();
}
}
#[cfg(not(feature = "db-dup-sort"))]
impl Snapshot {
pub(crate) fn get(&self, key: &[u8]) -> Option<&[u8]> {
self.map.get(key).map(|value| value.as_ref())
}
pub(crate) fn put(&mut self, key: &[u8], value: &[u8]) {
let map = Arc::make_mut(&mut self.map);
map.insert(Box::from(key), Box::from(value));
}
pub(crate) fn del(&mut self, key: &[u8]) -> Option<()> {
let map = Arc::make_mut(&mut self.map);
map.remove(key).map(|_| ())
}
pub(crate) fn iter(&self) -> impl Iterator<Item = (&[u8], &[u8])> {
self.map
.iter()
.map(|(key, value)| (key.as_ref(), value.as_ref()))
}
}
#[cfg(feature = "db-dup-sort")]
impl Snapshot {
pub(crate) fn get(&self, key: &[u8]) -> Option<&[u8]> {
self.map
.get(key)
.and_then(|v| v.iter().next())
.map(|v| v.as_ref())
}
pub(crate) fn put(&mut self, key: &[u8], value: &[u8]) {
let map = Arc::make_mut(&mut self.map);
match map.get_mut(key) {
None => {
let mut values = BTreeSet::new();
values.insert(Box::from(value));
map.insert(Box::from(key), values);
}
Some(values) => {
values.clear();
values.insert(Box::from(value));
}
}
}
pub(crate) fn del(&mut self, key: &[u8]) -> Option<()> {
let map = Arc::make_mut(&mut self.map);
match map.get_mut(key) {
None => None,
Some(values) => {
let was_empty = values.is_empty();
values.clear();
Some(()).filter(|_| !was_empty)
}
}
}
pub(crate) fn iter(&self) -> impl Iterator<Item = (&[u8], impl Iterator<Item = &[u8]>)> {
self.map
.iter()
.map(|(key, values)| (key.as_ref(), values.iter().map(|value| value.as_ref())))
}
}
#[cfg(feature = "db-dup-sort")]
impl Snapshot {
pub(crate) fn put_dup(&mut self, key: &[u8], value: &[u8]) {
let map = Arc::make_mut(&mut self.map);
match map.get_mut(key) {
None => {
let mut values = BTreeSet::new();
values.insert(Box::from(value));
map.insert(Box::from(key), values);
}
Some(values) => {
values.insert(Box::from(value));
}
}
}
pub(crate) fn del_exact(&mut self, key: &[u8], value: &[u8]) -> Option<()> {
let map = Arc::make_mut(&mut self.map);
match map.get_mut(key) {
None => None,
Some(values) => {
let was_removed = values.remove(value);
Some(()).filter(|_| was_removed)
}
}
}
}
|
