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

use super::*;

node!(
  /// A raw node that does not support version.
  struct RawNode {
    flags = Flags::empty();

    {
      type Link = Link;

      type ValuePointer = UnsyncValuePointer;
      type Pointer = NodePointer<T>;

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

      impl WithoutVersion for RawNode {}

      node_pointer!(RawNode {{
        fn version(&self) -> Version {
          MIN_VERSION
        }
      }});
    }
  }
);

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