[go: up one dir, main page]

scc 0.4.9

Scalable concurrent data structures for database management systems
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

//! Scalable concurrent containers.
//!
//! # [`scc::HashMap`]
//! [`scc::HashMap`] is a concurrent hash map that dynamically grows and shrinks in a non-blocking manner without sharding.
//!
//! # [`scc::HashIndex`]
//! [`scc::HashIndex`] is a concurrent hash index that is similar to scc::HashMap, but optimized for read operations.
//!
//! # [`scc::TreeIndex`]
//! [`scc::TreeIndex`] is a concurrent B+ tree index optimized for scan and read.
//!
//! [`scc::HashMap`]: hashmap::HashMap
//! [`scc::HashIndex`]: hashindex::HashIndex
//! [`scc::TreeIndex`]: treeindex::TreeIndex

// scc::HashMap
mod hashmap;
pub use hashmap::Accessor;
pub use hashmap::Cursor;
pub use hashmap::HashMap;
pub use hashmap::Ticket;

// scc::HashIndex
mod hashindex;
pub use hashindex::HashIndex;
pub use hashindex::Visitor;

// scc::TreeIndex
mod treeindex;
pub use treeindex::Range;
pub use treeindex::Scanner;
pub use treeindex::TreeIndex;