skl 0.22.17

A lock-free thread-safe concurrent ARENA based (heap backend or memory map backend) skiplist implementation which helps develop MVCC memtable for LSM-Tree.
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

use core::ptr::NonNull;

use super::{
  Arena, GenericAllocator, Link, Node, Ordering, UnsyncValuePointer, ValuePointer, Version,
  VersionedMeta, WithVersion,
};
use crate::{internal::Flags, MIN_VERSION};

/// The allocator used to allocate nodes in the `SkipMap`.
pub type Allocator = GenericAllocator<VersionedMeta, VersionedNode, Arena>;

node!(
  /// A node that only supports version.
  struct VersionedNode {
    flags = Flags::MULTIPLE_VERSION;
    version: u64 = MIN_VERSION;

    {
      type Link = Link;

      type ValuePointer = UnsyncValuePointer;
      type Pointer = NodePointer;

      fn set_version(&mut self, version: Version) {
        self.version = version;
      }

      impl WithVersion for VersionedNode {}

      node_pointer!(VersionedNode {
        version = MIN_VERSION;

        {
          fn version(&self) -> Version {
            { self.version }
          }
        }
      });
    }
  }
);