A collection of high performance containers and utilities for concurrent and asynchronous programming.
features = ["serde"].HashMap is a concurrent hash map that is targeted at highly concurrent write-heavy workloads. HashMap is basically an array of entry buckets where each bucket is protected by a special read-write lock providing both blocking and asynchronous methods. The bucket array is fully managed by EBR enabling lock-free access to it and non-blocking array resizing.
Read/write access to an entry is serialized by the read-write lock in the bucket containing the entry. There are no container-level locks, therefore, the larger the container gets, the lower the chance of the bucket-level lock being contended.
Resizing of the container is totally non-blocking and lock-free; resizing does not block any other read/write access to the container or resizing attempts. Resizing is analogous to pushing a new bucket array into a lock-free stack. Each individual entry in the old bucket array will be incrementally relocated to the new bucket array on future access to the container, and the old bucket array gets dropped eventually when it becomes empty.
An entry can be inserted if the key is unique. The inserted entry can be updated, read, and removed synchronously or asynchronously.
```rust use scc::HashMap;
let hashmap: HashMap
assert!(hashmap.insert(1, 0).isok()); asserteq!(hashmap.update(&1, |v| { *v = 2; *v }).unwrap(), 2); asserteq!(hashmap.read(&1, |, v| *v).unwrap(), 2); assert_eq!(hashmap.remove(&1).unwrap(), (1, 2));
hashmap.entry(7).orinsert(17); asserteq!(hashmap.read(&7, |_, v| *v).unwrap(), 17);
let futureinsert = hashmap.insertasync(2, 1); let futureremove = hashmap.removeasync(&1); ```
upsert will insert a new entry if the key does not exist, otherwise update the value field.
```rust use scc::HashMap;
let hashmap: HashMap
hashmap.upsert(1, || 2, |, v| *v = 2); asserteq!(hashmap.read(&1, |, v| *v).unwrap(), 2); hashmap.upsert(1, || 2, |, v| *v = 3); asserteq!(hashmap.read(&1, |, v| *v).unwrap(), 3);
let futureupsert = hashmap.upsertasync(2, || 1, |_, v| *v = 3); ```
HashMap does not provide an Iterator since it is impossible to confine the lifetime of Iterator::Item to the Iterator. The limitation can be circumvented by relying on interior mutability, e.g., let the returned reference hold a lock, however it will easily lead to a deadlock if not correctly used, and frequent acquisition of locks may impact performance. Therefore, Iterator is not implemented, instead, HashMap provides a number of methods to iterate over entries synchronously or asynchronously: any, any_async, for_each, for_each_async, OccupiedEntry::next, OccupiedEntry::next_async, retain, retain_async, scan, and scan_async.
```rust use scc::HashMap;
let hashmap: HashMap
assert!(hashmap.insert(1, 0).isok()); assert!(hashmap.insert(2, 1).isok());
// for_each allows entry modification.
let mut acc = 0;
hashmap.foreach(|k, vmut| { acc += *k; *vmut = 2; });
asserteq!(acc, 3);
asserteq!(hashmap.read(&1, |, v| *v).unwrap(), 2);
asserteq!(hashmap.read(&2, |, v| *v).unwrap(), 2);
// any returns true as soon as an entry satisfying the predicate is found.
assert!(hashmap.insert(3, 2).is_ok());
assert!(hashmap.any(|k, _| *k == 3));
// retain enables entry removal.
assert_eq!(hashmap.retain(|k, v| *k == 1 && *v == 0), (1, 2));
// hash_map::OccupiedEntry also can return the next closest occupied entry.
let firstentry = hashmap.firstoccupiedentry();
let secondentry = firstentry.andthen(|e| e.next());
assert!(firstentry.issome() && secondentry.issome());
assert!(secondentry.andthen(|e| e.next()).is_none());
// Asynchronous iteration over entries using scan_async and for_each_async.
let futurescan = hashmap.scanasync(|k, v| println!("{k} {v}"));
let futureforeach = hashmap.foreachasync(|k, vmut| { *vmut = *k; });
```
HashSet is a special version of HashMap where the value type is ().
Most HashSet methods are identical to that of HashMap except that they do not receive a value argument, and some HashMap methods for value modification are not implemented for HashSet.
```rust use scc::HashSet;
let hashset: HashSet
assert!(hashset.read(&1, || true).isnone()); assert!(hashset.insert(1).isok()); assert!(hashset.read(&1, || true).unwrap());
let futureinsert = hashset.insertasync(2); let futureremove = hashset.removeasync(&1); ```
HashIndex is a read-optimized version of HashMap. In a HashIndex, not only is the memory of the bucket array managed by EBR, but also that of entry buckets is protected by EBR, enabling lock-free read access to individual entries.
The read method is completely lock-free.
```rust use scc::hash_index::ModifyAction; use scc::HashIndex;
let hashindex: HashIndex
assert!(hashindex.insert(1, 0).isok()); asserteq!(hashindex.read(&1, |_, v| *v).unwrap(), 0);
let futureinsert = hashindex.insertasync(2, 1); let futureremove = hashindex.removeifasync(&1, || true); ```
An Iterator is implemented for HashIndex, because any derived references can survive as long as the associated ebr::Barrier lives.
```rust use scc::ebr::Barrier; use scc::HashIndex;
let hashindex: HashIndex
assert!(hashindex.insert(1, 0).is_ok());
// Existing values can be replaced with new ones. assert!(hashindex.modify( 1, |_, v| if *v == 0 { ModifyAction::Update(1) } else { ModifyAction::Remove }));
let barrier = Barrier::new();
// An ebr::Barrier has to be supplied to iter.
let mut iter = hashindex.iter(&barrier);
// The derived reference can live as long as barrier.
let entryref = iter.next().unwrap();
asserteq!(iter.next(), None);
drop(hashindex);
// The entry can be read after hashindex is dropped.
asserteq!(entryref, (&1, &0));
```
WORK-IN-PROGRESS.
Serde support.HashCache is a concurrent sampling-based LRU cache that is based on the HashMap implementation. HashCache does not keep track of the least recently used entry in the entire cache, instead each bucket maintains a doubly linked list of occupied entries which is updated on access to entries in order to keep track of the least recently used entry within the bucket.
The LRU entry in a bucket is evicted when a new entry is being inserted and the bucket is full.
```rust use scc::HashCache;
let hashcache: HashCache
/// The capacity cannot exceed the maximum capacity. asserteq!(hashcache.capacityrange(), 128..=2048);
/// If the bucket corresponding to 1 or 2 is full, the LRU entry will be evicted.
assert!(hashcache.put(1, 0).isok());
assert!(hashcache.put(2, 0).isok());
/// 1 becomes the most recently accessed entry in the bucket.
assert!(hashcache.get(&1).is_some());
/// An entry can be normally removed. assert_eq!(hashcache.remove(&2).unwrap(), (2, 0)); ```
TreeIndex is a B+ tree variant optimized for read operations. EBR protects the memory used by individual entries, thus enabling lock-free read access to them.
Read access is always lock-free and non-blocking. Write access to an entry is also lock-free and non-blocking as long as no structural changes are required. However, when nodes are being split or merged by a write operation, other write operations on keys in the affected range are blocked.
An entry can be inserted if the key is unique, and it can be read, and removed afterwards. Locks are acquired or awaited only when internal nodes are split or merged.
```rust use scc::TreeIndex;
let treeindex: TreeIndex
assert!(treeindex.insert(1, 2).is_ok());
// read is lock-free.
asserteq!(treeindex.read(&1, |, v| *v).unwrap(), 2);
assert!(treeindex.remove(&1));
let futureinsert = treeindex.insertasync(2, 3); let futureremove = treeindex.removeif_async(&1, |v| *v == 2); ```
Entries can be scanned without acquiring any locks.
```rust use scc::ebr::Barrier; use scc::TreeIndex;
let treeindex: TreeIndex
assert!(treeindex.insert(1, 10).isok()); assert!(treeindex.insert(2, 11).isok()); assert!(treeindex.insert(3, 13).is_ok());
let barrier = Barrier::new();
// visitor iterates over entries without acquiring a lock.
let mut visitor = treeindex.iter(&barrier);
asserteq!(visitor.next().unwrap(), (&1, &10));
asserteq!(visitor.next().unwrap(), (&2, &11));
asserteq!(visitor.next().unwrap(), (&3, &13));
assert!(visitor.next().isnone());
```
A specific range of keys can be scanned.
```rust use scc::ebr::Barrier; use scc::TreeIndex;
let treeindex: TreeIndex
for i in 0..10 { assert!(treeindex.insert(i, 10).is_ok()); }
let barrier = Barrier::new();
asserteq!(treeindex.range(1..1, &barrier).count(), 0); asserteq!(treeindex.range(4..8, &barrier).count(), 4); assert_eq!(treeindex.range(4..=8, &barrier).count(), 5); ```
Bag is a concurrent lock-free unordered container. Bag is completely opaque, disallowing access to contained instances until they are popped. Bag is especially efficient if the number of contained instances can be maintained under ARRAY_LEN (default: usize::BITS / 2)
```rust use scc::Bag;
let bag: Bag
bag.push(1); assert!(!bag.isempty()); asserteq!(bag.pop(), Some(1)); assert!(bag.is_empty()); ```
Queue is an EBR backed concurrent lock-free first-in-first-out container.
```rust use scc::Queue;
let queue: Queue
queue.push(1); assert!(queue.pushif(2, |e| e.mapor(false, |x| x == 1)).is_ok()); assert!(queue.push_if(3, |e| e.map_or(false, |x| *x == 1)).is_err()); assert_eq!(queue.pop().map(|e| *e), Some(1)); asserteq!(queue.pop().map(|e| **e), Some(2)); assert!(queue.pop().isnone()); ```
Stack is an EBR backed concurrent lock-free last-in-first-out container.
```rust use scc::Stack;
let stack: Stack
stack.push(1); stack.push(2); asserteq!(stack.pop().map(|e| **e), Some(2)); asserteq!(stack.pop().map(|e| **e), Some(1)); assert!(stack.pop().is_none()); ```
The ebr module implements epoch-based reclamation and various types of auxiliary data structures to make use of it safely. Its epoch-based reclamation algorithm is similar to that implemented in crossbeam_epoch, however users may find it easier to use as the lifetime of an instance is safely managed. For instance, ebr::AtomicArc and ebr::Arc hold a strong reference to the underlying instance, and the instance is automatically passed to the garbage collector when the reference count drops to zero.
The ebr module can be used without an unsafe block.
```rust use scc::ebr::{suspend, Arc, AtomicArc, Barrier, Ptr, Tag};
use std::sync::atomic::Ordering::Relaxed;
// atomic_arc holds a strong reference to 17.
let atomic_arc: AtomicArc
// barrier prevents the garbage collector from dropping reachable instances.
let barrier: Barrier = Barrier::new();
// ptr cannot outlive barrier.
let mut ptr: Ptr
// atomic_arc can be tagged.
atomicarc.updatetag_if(Tag::First, |p| p.tag() == Tag::None, Relaxed, Relaxed);
// ptr is not tagged, so CAS fails.
assert!(atomicarc.compareexchange(
ptr,
(Some(Arc::new(18)), Tag::First),
Relaxed,
Relaxed,
&barrier).is_err());
// ptr can be tagged.
ptr.set_tag(Tag::First);
// The return value of CAS is a handle to the instance that atomic_arc previously owned.
let prev: Arc
// 17 will be garbage-collected later.
drop(prev);
// ebr::AtomicArc can be converted into ebr::Arc.
let arc: Arc
// 18 will be garbage-collected later.
drop(arc);
// 17 is still valid as barrier keeps the garbage collector from dropping it.
asserteq!(*ptr.asref().unwrap(), 17);
// Execution of a closure can be deferred until all the current readers are gone. barrier.defer_execute(|| println!("deferred")); drop(barrier);
// If the thread is expected to lie dormant for a while, call suspend() to allow other threads
// to reclaim its own retired instances.
suspend();
```
LinkedList is a type trait that implements lock-free concurrent singly linked list operations, backed by EBR. It additionally provides a method for marking an entry of a linked list to denote a user-defined state.
```rust use scc::ebr::{Arc, AtomicArc, Barrier}; use scc::LinkedList;
use std::sync::atomic::Ordering::Relaxed;
struct L(AtomicArc
let barrier = Barrier::new();
let head: L = L::default();
let tail: Arc
// A new entry is pushed. assert!(head.pushback(tail.clone(), false, Relaxed, &barrier).isok()); assert!(!head.is_marked(Relaxed));
// Users can mark a flag on an entry. head.mark(Relaxed); assert!(head.is_marked(Relaxed));
// next_ptr traverses the linked list.
let nextptr = head.nextptr(Relaxed, &barrier);
asserteq!(nextptr.as_ref().unwrap().1, 1);
// Once tail is deleted, it becomes invisible.
tail.deleteself(Relaxed);
assert!(head.nextptr(Relaxed, &barrier).is_null());
```
Comparison with DashMap.