Documentation ¶
Overview ¶
Yet another Concurrent Skiplist implementation. Changes are performed using atomic CAS operations. Inserts acquire a shared lock and Writes acquire an exclusive lock. All locking is done internally.
Index ¶
- type Node
- type Sortlist
- func (s *Sortlist) Ceil(sk interface{}) *Node
- func (s *Sortlist) Delete(k interface{}) *Node
- func (s *Sortlist) Floor(sk interface{}) *Node
- func (s *Sortlist) Insert(k, v interface{})
- func (s *Sortlist) Lookup(sk interface{}) *Node
- func (s *Sortlist) Next(sk interface{}) *Node
- func (s *Sortlist) Previous(sk interface{}) *Node
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Node ¶
type Node struct { Key interface{} Value interface{} // contains filtered or unexported fields }
Click to show internal directories.
Click to hide internal directories.