skl/generic/list/api/update.rs
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 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511
use core::sync::atomic::Ordering;
use among::Among;
use dbutils::{
buffer::VacantBuffer,
equivalentor::TypeRefComparator,
types::{MaybeStructured, Type},
};
use either::Either;
use crate::KeyBuilder;
use super::{
super::{Inserter, Key, RefCounter},
Active, Allocator, EntryRef, Error, Height, RemoveValueBuilder, SkipList, ValueBuilder, Version,
};
impl<K, V, C, A, R> SkipList<K, V, C, A, R>
where
K: ?Sized + Type + 'static,
V: ?Sized + Type + 'static,
A: Allocator,
R: RefCounter,
{
/// Upserts a new key-value pair if it does not yet exist, if the key with the given version already exists, it will update the value.
/// Unlike [`get_or_insert`](SkipList::get_or_insert), this method will update the value if the key with the given version already exists.
///
/// - Returns `Ok(None)` if the key was successfully inserted.
/// - Returns `Ok(Some(old))` if the key with the given version already exists and the value is successfully updated.
#[inline]
pub fn insert<'a, 'b: 'a>(
&'a self,
version: Version,
key: impl Into<MaybeStructured<'b, K>>,
value: impl Into<MaybeStructured<'b, V>>,
) -> Result<Option<EntryRef<'a, K, V, Active, C, A, R>>, Among<K::Error, V::Error, Error>>
where
C: TypeRefComparator<'a, K>,
{
self.insert_at_height(version, self.random_height(), key, value)
}
/// Upserts a new key-value pair at the given height if it does not yet exist, if the key with the given version already exists, it will update the value.
/// Unlike [`get_or_insert_at_height`](SkipList::get_or_insert_at_height), this method will update the value if the key with the given version already exists.
///
/// - Returns `Ok(None)` if the key was successfully inserted.
/// - Returns `Ok(Some(old))` if the key with the given version already exists and the value is successfully updated.
pub fn insert_at_height<'a, 'b: 'a>(
&'a self,
version: Version,
height: Height,
key: impl Into<MaybeStructured<'b, K>>,
value: impl Into<MaybeStructured<'b, V>>,
) -> Result<Option<EntryRef<'a, K, V, Active, C, A, R>>, Among<K::Error, V::Error, Error>>
where
C: TypeRefComparator<'a, K>,
{
let key: MaybeStructured<'_, K> = key.into();
let value: MaybeStructured<'_, V> = value.into();
self
.validate(height, key.encoded_len(), value.encoded_len())
.map_err(Among::Right)?;
let copy = |buf: &mut VacantBuffer<'_>| value.encode_to_buffer(buf);
let val_len = value.encoded_len();
self
.update(
version,
height.into(),
Key::from((false, key)),
Some(ValueBuilder::new(val_len, copy)),
Ordering::Relaxed,
Ordering::Relaxed,
Inserter::default(),
true,
)
.map(|old| {
old.expect_left("insert must get InsertOk").and_then(|old| {
if old.tombstone() {
None
} else {
Some(old.into_active())
}
})
})
}
/// Upserts a new key if it does not yet exist, if the key with the given version already exists, it will update the value.
/// Unlike [`get_or_insert_at_height_with_value_builder`](SkipList::get_or_insert_at_height_with_value_builder), this method will update the value if the key with the given version already exists.
///
/// This method is useful when you want to insert a key and you know the value size but you do not have the value
/// at this moment.
///
/// A placeholder will be inserted first, then you will get an [`VacantBuffer`],
/// and you must fill the buffer with bytes later in the closure.
///
/// - Returns `Ok(None)` if the key was successfully inserted.
/// - Returns `Ok(Some(old))` if the key with the given version already exists and the value is successfully updated.
#[allow(single_use_lifetimes)]
pub fn insert_at_height_with_value_builder<'a, 'b: 'a, E>(
&'a self,
version: Version,
height: Height,
key: impl Into<MaybeStructured<'b, K>>,
value_builder: ValueBuilder<impl FnOnce(&mut VacantBuffer<'a>) -> Result<usize, E>>,
) -> Result<Option<EntryRef<'a, K, V, Active, C, A, R>>, Among<K::Error, E, Error>>
where
C: TypeRefComparator<'a, K>,
{
let key: MaybeStructured<'_, K> = key.into();
self
.validate(height, key.encoded_len(), value_builder.size())
.map_err(Either::Right)?;
self
.update(
version,
height.into(),
Key::from((false, key)),
Some(value_builder),
Ordering::Relaxed,
Ordering::Relaxed,
Inserter::default(),
true,
)
.map(|old| {
old.expect_left("insert must get InsertOk").and_then(|old| {
if old.tombstone() {
None
} else {
Some(old.into_active())
}
})
})
}
/// Inserts a new key-value pair at height if it does not yet exist.
///
/// Unlike [`insert_at_height`](SkipList::insert_at_height), this method will not update the value if the key with the given version already exists.
///
/// - Returns `Ok(None)` if the key was successfully get_or_inserted.
/// - Returns `Ok(Some(_))` if the key with the given version already exists.
pub fn get_or_insert_at_height<'a, 'b: 'a>(
&'a self,
version: Version,
height: Height,
key: impl Into<MaybeStructured<'b, K>>,
value: impl Into<MaybeStructured<'b, V>>,
) -> Result<Option<EntryRef<'a, K, V, Active, C, A, R>>, Among<K::Error, V::Error, Error>>
where
C: TypeRefComparator<'a, K>,
{
let key: MaybeStructured<'_, K> = key.into();
let value: MaybeStructured<'_, V> = value.into();
self
.validate(height, key.encoded_len(), value.encoded_len())
.map_err(Among::Right)?;
let copy = |buf: &mut VacantBuffer<'_>| value.encode_to_buffer(buf);
let val_len = value.encoded_len();
self
.update(
version,
height.into(),
Key::from((false, key)),
Some(ValueBuilder::new(val_len, copy)),
Ordering::Relaxed,
Ordering::Relaxed,
Inserter::default(),
false,
)
.map(|old| {
old.expect_left("insert must get InsertOk").and_then(|old| {
if old.tombstone() {
None
} else {
Some(old.into_active())
}
})
})
}
/// Inserts a new key if it does not yet exist.
///
/// Unlike [`insert_at_height_with_value_builder`](SkipList::insert_at_height_with_value_builder), this method will not update the value if the key with the given version already exists.
///
/// This method is useful when you want to get_or_insert a key and you know the value size but you do not have the value
/// at this moment.
///
/// A placeholder will be inserted first, then you will get an [`VacantBuffer`],
/// and you must fill the buffer with bytes later in the closure.
///
/// - Returns `Ok(None)` if the key was successfully get_or_inserted.
/// - Returns `Ok(Some(_))` if the key with the given version already exists.
#[allow(single_use_lifetimes)]
pub fn get_or_insert_at_height_with_value_builder<'a, 'b: 'a, E>(
&'a self,
version: Version,
height: Height,
key: impl Into<MaybeStructured<'b, K>>,
value_builder: ValueBuilder<impl FnOnce(&mut VacantBuffer<'a>) -> Result<usize, E>>,
) -> Result<Option<EntryRef<'a, K, V, Active, C, A, R>>, Among<K::Error, E, Error>>
where
C: TypeRefComparator<'a, K>,
{
let key: MaybeStructured<'_, K> = key.into();
self
.validate(height, key.encoded_len(), value_builder.size())
.map_err(Either::Right)?;
self
.update(
version,
height.into(),
Key::from((false, key)),
Some(value_builder),
Ordering::Relaxed,
Ordering::Relaxed,
Inserter::default(),
false,
)
.map(|old| {
old.expect_left("insert must get InsertOk").and_then(|old| {
if old.tombstone() {
None
} else {
Some(old.into_active())
}
})
})
}
/// Upserts a new key if it does not yet exist, if the key with the given version already exists, it will update the value.
/// Unlike [`get_or_insert_with_builders`](SkipList::get_or_insert_with_builders), this method will update the value if the key with the given version already exists.
///
/// This method is useful when you want to insert a key and you know the key size and value size but you do not have the key and value
/// at this moment.
///
/// A placeholder will be inserted first, then you will get an [`VacantBuffer`],
/// and you must fill the buffer with bytes later in the closure.
///
/// - Returns `Ok(None)` if the key was successfully inserted.
/// - Returns `Ok(Some(old))` if the key with the given version already exists and the value is successfully updated.
pub fn insert_at_height_with_builders<'a, 'b: 'a, KE, VE>(
&'a self,
version: Version,
height: Height,
key_builder: KeyBuilder<impl FnOnce(&mut VacantBuffer<'a>) -> Result<usize, KE>>,
value_builder: ValueBuilder<impl FnOnce(&mut VacantBuffer<'a>) -> Result<usize, VE>>,
) -> Result<Option<EntryRef<'a, K, V, Active, C, A, R>>, Among<KE, VE, Error>>
where
C: TypeRefComparator<'a, K>,
{
self
.validate(height, key_builder.size(), value_builder.size())
.map_err(Among::Right)?;
let (key_size, key) = key_builder.into_components();
let (offset, vk) = self
.arena
.fetch_vacant_key(key_size as u32, key)
.map_err(Among::from_either_to_left_right)?;
self
.update(
version,
height.into(),
Key::Vacant { offset, buf: vk },
Some(value_builder),
Ordering::Relaxed,
Ordering::Relaxed,
Inserter::default(),
true,
)
.map(|old| {
old.expect_left("insert must get InsertOk").and_then(|old| {
if old.tombstone() {
None
} else {
Some(old.into_active())
}
})
})
.map_err(|e| match e {
Among::Left(_) => unreachable!(),
Among::Right(e) => Among::Right(e),
Among::Middle(e) => Among::Middle(e),
})
}
/// Inserts a new key if it does not yet exist.
///
/// Unlike [`insert_at_height_with_builders`](SkipList::insert_at_height_with_builders), this method will not update the value if the key with the given version already exists.
///
/// This method is useful when you want to get_or_insert a key and you know the value size but you do not have the value
/// at this moment.
///
/// A placeholder will be inserted first, then you will get an [`VacantBuffer`],
/// and you must fill the buffer with bytes later in the closure.
pub fn get_or_insert_at_height_with_builders<'a, KE, VE>(
&'a self,
version: Version,
height: Height,
key_builder: KeyBuilder<impl FnOnce(&mut VacantBuffer<'a>) -> Result<usize, KE>>,
value_builder: ValueBuilder<impl FnOnce(&mut VacantBuffer<'a>) -> Result<usize, VE>>,
) -> Result<Option<EntryRef<'a, K, V, Active, C, A, R>>, Among<KE, VE, Error>>
where
C: TypeRefComparator<'a, K>,
{
self
.validate(height, key_builder.size(), value_builder.size())
.map_err(Among::Right)?;
let (key_size, key) = key_builder.into_components();
let (offset, vk) = self
.arena
.fetch_vacant_key(key_size as u32, key)
.map_err(Among::from_either_to_left_right)?;
self
.update(
version,
height.into(),
Key::Vacant { offset, buf: vk },
Some(value_builder),
Ordering::Relaxed,
Ordering::Relaxed,
Inserter::default(),
false,
)
.map(|old| {
old.expect_left("insert must get InsertOk").and_then(|old| {
if old.tombstone() {
None
} else {
Some(old.into_active())
}
})
})
.map_err(|e| match e {
Among::Left(_) => unreachable!(),
Among::Right(e) => Among::Right(e),
Among::Middle(e) => Among::Middle(e),
})
}
/// Removes the key-value pair if it exists. A CAS operation will be used to ensure the operation is atomic.
///
/// Unlike [`get_or_remove_at_height`](SkipList::get_or_remove_at_height), this method will remove the value if the key with the given version already exists.
///
/// - Returns `Ok(None)`:
/// - if the remove operation is successful or the key is marked in remove status by other threads.
/// - Returns `Ok(Either::Right(current))` if the key with the given version already exists
/// and the entry is not successfully removed because of an update on this entry happens in another thread.
#[allow(single_use_lifetimes)]
pub fn compare_remove_at_height<'a, 'b: 'a>(
&'a self,
version: Version,
height: Height,
key: impl Into<MaybeStructured<'b, K>>,
success: Ordering,
failure: Ordering,
) -> Result<Option<EntryRef<'a, K, V, Active, C, A, R>>, Either<K::Error, Error>>
where
C: TypeRefComparator<'a, K>,
{
let key: MaybeStructured<'_, K> = key.into();
self
.validate(height, key.encoded_len(), 0)
.map_err(Either::Right)?;
self
.update(
version,
height.into(),
Key::from((true, key)),
Option::<RemoveValueBuilder<V::Error>>::None,
success,
failure,
Inserter::default(),
true,
)
.map(|res| match res {
Either::Left(_) => None,
Either::Right(res) => match res {
Ok(old) => {
if old.tombstone() {
None
} else {
Some(old.into_active())
}
}
Err(current) => {
if current.tombstone() {
None
} else {
Some(current.into_active())
}
}
},
})
.map_err(Among::into_left_right)
}
/// Gets or removes the key-value pair if it exists.
/// Unlike [`compare_remove_at_height`](SkipList::compare_remove_at_height), this method will not remove the value if the key with the given version already exists.
///
/// - Returns `Ok(None)` if the key does not exist.
/// - Returns `Ok(Some(old))` if the key with the given version already exists.
#[allow(single_use_lifetimes)]
pub fn get_or_remove_at_height<'a, 'b: 'a>(
&'a self,
version: Version,
height: Height,
key: impl Into<MaybeStructured<'b, K>>,
) -> Result<Option<EntryRef<'a, K, V, Active, C, A, R>>, Either<K::Error, Error>>
where
C: TypeRefComparator<'a, K>,
{
let key: MaybeStructured<'_, K> = key.into();
self
.validate(height, key.encoded_len(), 0)
.map_err(Either::Right)?;
self
.update(
version,
height.into(),
Key::from((true, key)),
Option::<RemoveValueBuilder<V::Error>>::None,
Ordering::Relaxed,
Ordering::Relaxed,
Inserter::default(),
false,
)
.map(|res| match res {
Either::Left(old) => match old {
Some(old) => {
if old.tombstone() {
None
} else {
Some(old.into_active())
}
}
None => None,
},
_ => unreachable!("get_or_remove does not use CAS, so it must return `Either::Left`"),
})
.map_err(Among::into_left_right)
}
/// Gets or removes the key-value pair if it exists.
/// Unlike [`compare_remove_at_height`](SkipList::compare_remove_at_height), this method will not remove the value if the key with the given version already exists.
///
/// - Returns `Ok(None)` if the key does not exist.
/// - Returns `Ok(Some(old))` if the key with the given version already exists.
///
/// This method is useful when you want to get_or_remove a key and you know the key size but you do not have the key
/// at this moment.
///
/// A placeholder will be inserted first, then you will get an [`VacantBuffer`],
/// and you must fill the buffer with bytes later in the closure.
pub fn get_or_remove_at_height_with_builder<'a, 'b: 'a, E>(
&'a self,
version: Version,
height: Height,
key_builder: KeyBuilder<impl FnOnce(&mut VacantBuffer<'a>) -> Result<usize, E>>,
) -> Result<Option<EntryRef<'a, K, V, Active, C, A, R>>, Either<E, Error>>
where
C: TypeRefComparator<'a, K>,
{
self
.validate(height, key_builder.size(), 0)
.map_err(Either::Right)?;
let (key_size, key) = key_builder.into_components();
let (offset, vk) = self.arena.fetch_vacant_key(key_size as u32, key)?;
let key = Key::RemoveVacant { offset, buf: vk };
self
.update(
version,
height.into(),
key,
Option::<RemoveValueBuilder<V::Error>>::None,
Ordering::Relaxed,
Ordering::Relaxed,
Inserter::default(),
false,
)
.map(|res| match res {
Either::Left(old) => match old {
Some(old) => {
if old.tombstone() {
None
} else {
Some(old.into_active())
}
}
None => None,
},
_ => unreachable!("get_or_remove does not use CAS, so it must return `Either::Left`"),
})
.map_err(|e| match e {
Among::Right(e) => Either::Right(e),
_ => unreachable!(),
})
}
}