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 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315
// Copyright 2019 The Exonum Team // // 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. //! An implementation of index that may only contain one element. use std::marker::PhantomData; use exonum_crypto::Hash; use crate::views::IndexAddress; use crate::{ views::{AnyObject, IndexAccess, IndexBuilder, IndexState, IndexType, View}, BinaryKey, BinaryValue, ObjectHash, }; /// An index that may only contain one element. /// /// You can add an element to this index and check whether it exists. A value /// should implement [`BinaryValue`] trait. /// /// [`BinaryValue`]: trait.BinaryValue.html #[derive(Debug)] pub struct Entry<T: IndexAccess, V> { base: View<T>, state: IndexState<T, ()>, _v: PhantomData<V>, } impl<T, V> AnyObject<T> for Entry<T, V> where T: IndexAccess, V: BinaryValue, { fn view(self) -> View<T> { self.base } fn object_type(&self) -> IndexType { IndexType::Entry } fn metadata(&self) -> Vec<u8> { self.state.metadata().to_bytes() } } impl<T, V> Entry<T, V> where T: IndexAccess, V: BinaryValue + ObjectHash, { /// Creates a new index representation based on the name and storage view. /// /// Storage view can be specified as [`&Snapshot`] or [`&mut Fork`]. In the first case, only /// immutable methods are available. In the second case, both immutable and mutable methods are /// available. /// /// [`&Snapshot`]: trait.Snapshot.html /// [`&mut Fork`]: struct.Fork.html /// /// # Examples /// /// ``` /// use exonum_merkledb::{TemporaryDB, Database, Entry}; /// /// let db = TemporaryDB::new(); /// let name = "name"; /// let snapshot = db.snapshot(); /// let index: Entry<_, u8> = Entry::new(name, &snapshot); /// ``` pub fn new<S: Into<String>>(index_name: S, view: T) -> Self { let (base, state) = IndexBuilder::new(view) .index_type(IndexType::Entry) .index_name(index_name) .build::<()>(); Self { base, state, _v: PhantomData, } } /// Creates a new index representation based on the name, index ID in family /// and storage view. /// /// Storage view can be specified as [`&Snapshot`] or [`&mut Fork`]. In the first case, only /// immutable methods are available. In the second case, both immutable and mutable methods are /// available. /// /// [`&Snapshot`]: trait.Snapshot.html /// [`&mut Fork`]: struct.Fork.html /// /// # Examples /// /// ``` /// use exonum_merkledb::{TemporaryDB, Database, Entry}; /// /// let db = TemporaryDB::new(); /// let name = "name"; /// let index_id = vec![01]; /// let snapshot = db.snapshot(); /// let index: Entry<_, u8> = Entry::new_in_family(name, &index_id, &snapshot); /// ``` pub fn new_in_family<S, I>(family_name: S, index_id: &I, view: T) -> Self where I: BinaryKey, I: ?Sized, S: Into<String>, { let (base, state) = IndexBuilder::new(view) .index_type(IndexType::Entry) .index_name(family_name) .family_id(index_id) .build::<()>(); Self { base, state, _v: PhantomData, } } pub(crate) fn get_from<I: Into<IndexAddress>>(address: I, access: T) -> Option<Self> { IndexBuilder::from_address(address, access) .index_type(IndexType::Entry) .build_existed::<()>() .map(|(base, state)| Self { base, state, _v: PhantomData, }) } pub(crate) fn create_from<I: Into<IndexAddress>>(address: I, access: T) -> Self { let (base, state) = IndexBuilder::from_address(address, access) .index_type(IndexType::Entry) .build::<()>(); Self { base, state, _v: PhantomData, } } /// Returns a value of the entry or `None` if does not exist. /// /// # Examples /// /// ``` /// use exonum_merkledb::{TemporaryDB, Database, Entry}; /// /// let db = TemporaryDB::new(); /// let name = "name"; /// let fork = db.fork(); /// let mut index = Entry::new(name, &fork); /// assert_eq!(None, index.get()); /// /// index.set(10); /// assert_eq!(Some(10), index.get()); /// ``` pub fn get(&self) -> Option<V> { self.base.get(&()) } /// Returns `true` if a value of the entry exists. /// /// # Examples /// /// ``` /// use exonum_merkledb::{TemporaryDB, Database, Entry}; /// /// let db = TemporaryDB::new(); /// let name = "name"; /// let fork = db.fork(); /// let mut index = Entry::new(name, &fork); /// assert!(!index.exists()); /// /// index.set(10); /// assert!(index.exists()); /// ``` pub fn exists(&self) -> bool { self.base.contains(&()) } /// Returns hash of the entry or default hash value if does not exist. /// /// # Examples /// /// ``` /// use exonum_merkledb::{TemporaryDB, Database, Entry}; /// use exonum_crypto::{self, Hash}; /// /// let db = TemporaryDB::new(); /// let name = "name"; /// let fork = db.fork(); /// let mut index = Entry::new(name, &fork); /// assert_eq!(Hash::default(), index.hash()); /// /// let value = 10; /// index.set(value); /// assert_eq!(exonum_crypto::hash(&[value]), index.hash()); /// ``` pub fn hash(&self) -> Hash { self.base .get::<(), V>(&()) .map(|v| v.object_hash()) .unwrap_or_default() } /// Changes a value of the entry. /// /// # Examples /// /// ``` /// use exonum_merkledb::{TemporaryDB, Database, Entry}; /// /// let db = TemporaryDB::new(); /// let name = "name"; /// let fork = db.fork(); /// let mut index = Entry::new(name, &fork); /// /// index.set(10); /// assert_eq!(Some(10), index.get()); /// ``` pub fn set(&mut self, value: V) { self.base.put(&(), value) } /// Removes a value of the entry. /// /// # Examples /// /// ``` /// use exonum_merkledb::{TemporaryDB, Database, Entry}; /// /// let db = TemporaryDB::new(); /// let name = "name"; /// let fork = db.fork(); /// let mut index = Entry::new(name, &fork); /// /// index.set(10); /// assert_eq!(Some(10), index.get()); /// /// index.remove(); /// assert_eq!(None, index.get()); /// ``` pub fn remove(&mut self) { self.base.remove(&()) } /// Takes the value out of the entry, leaving a None in its place. /// /// # Examples /// /// ``` /// use exonum_merkledb::{TemporaryDB, Database, Entry}; /// /// let db = TemporaryDB::new(); /// let name = "name"; /// let fork = db.fork(); /// let mut index = Entry::new(name, &fork); /// /// index.set(10); /// assert_eq!(Some(10), index.get()); /// /// let value = index.take(); /// assert_eq!(Some(10), value); /// assert_eq!(None, index.get()); /// ``` pub fn take(&mut self) -> Option<V> { let value = self.get(); if value.is_some() { self.remove(); } value } /// Replaces the value in the entry with the given one, returning the previously stored value. /// /// # Examples /// /// ``` /// use exonum_merkledb::{TemporaryDB, Database, Entry}; /// /// let db = TemporaryDB::new(); /// let name = "name"; /// let fork = db.fork(); /// let mut index = Entry::new(name, &fork); /// /// index.set(10); /// assert_eq!(Some(10), index.get()); /// /// let value = index.swap(20); /// assert_eq!(Some(10), value); /// assert_eq!(Some(20), index.get()); /// ``` pub fn swap(&mut self, value: V) -> Option<V> { let previous = self.get(); self.set(value); previous } }