package saturn

  1. Overview
  2. Docs
Collection of concurent-safe data structures for Multicore OCaml

Install 

dune-project
 Dependency

github.com Readme Changelog ISC License Edit opam file Versions (4)

Authors

  1. K
    KC Sivaramakrishnan

Maintainers

  1. C
    Carine Morel
  2. K
    KC Sivaramakrishnan
  3. S
    Sudha Parimala

Sources

saturn-1.0.0.tbz
sha256=2d9e4f6713f98cead53f147895c4eb5adc301f10cc828c52f272494da6072a08
sha512=925104a4293326d345701e80932ace2b5d2da02ca6406271d33cd54f9e9c6583f35b060bc42c640357c98669f5bc42e8447dbd21614ae02ce5b5efaa8f04a132

doc/saturn/Saturn/Htbl/index.html

Module Saturn.Htbl

Lock-free and resizable hash table.

The operations provided by this hash table are designed to work as building blocks of non-blocking algorithms. Specifically, the operation signatures and semantics are designed to allow building consensus protocols over arbitrary numbers of processes.

🏎ī¸ Single key reads with this hash table are actually wait-free rather than just lock-free. Internal resizing automatically uses all the threads that are trying to write to the hash table.

API

type (!'k, !'v) t

Represents a lock-free hash table mapping keys of type 'k to values of type 'v.

type 'k hashed_type = (module Hashtbl.HashedType with type t = 'k)

First-class module type abbreviation.

val create : ?hashed_type:'k hashed_type -> ?min_buckets:int -> ?max_buckets:int -> unit -> ('k, 'v) t

create ~hashed_type:(module Key) () creates a new empty lock-free hash table.

  • The optional hashed_type argument can and usually should be used to specify the equal and hash operations on keys. Slow polymorphic equality (=) and slow polymorphic seeded_hash (Bits64.to_int (Random.bits64 ())) are used by default.
  • The default min_buckets is unspecified, and a given min_buckets may be adjusted by the implementation.
  • The default max_buckets is unspecified, and a given max_buckets may be adjusted by the implementation.
val hashed_type_of : ('k, 'v) t -> 'k hashed_type

hashed_type_of htbl returns a copy of the hashed type used when the hash table htbl was created.

val min_buckets_of : ('k, 'v) t -> int

min_buckets_of htbl returns the minimum number of buckets in the hash table htbl.

ℹī¸ The returned value may not be the same as the one given to create.

val max_buckets_of : ('k, 'v) t -> int

max_buckets_of htbl returns the maximum number of buckets in the hash table htbl.

ℹī¸ The returned value may not be the same as the one given to create.

val length : ('k, 'v) t -> int

length htbl returns the number of bindings in the hash table htbl.

val find_opt : ('k, 'v) t -> 'k -> 'v option

Looking up bindings

find_opt htbl key returns Some of the current binding of key in the hash table htbl or None if it does not exist.

val find_exn : ('k, 'v) t -> 'k -> 'v

find_exn htbl key returns the current binding of key in the hash table htbl or raises Not_found if no such binding exists.

  • raises Not_found

    if no binding of key exists in the hash table htbl.

val mem : ('k, 'v) t -> 'k -> bool

mem htbl key determines whether the hash table htbl has a binding for the key.

Adding bindings

val try_add : ('k, 'v) t -> 'k -> 'v -> bool

try_add htbl key value tries to add a new binding of key to value to the hash table htbl. Returns true on success and false if the hash table already contains a binding for key.

Updating bindings

val try_set : ('k, 'v) t -> 'k -> 'v -> bool

try_set htbl key value tries to update an existing binding of key to value in the hash table htbl. Returns true on success and false if the hash table does not contain a binding for key.

val try_compare_and_set : ('k, 'v) t -> 'k -> 'v -> 'v -> bool

try_compare_and_set htbl key before after tries to update an existing binding of key from the before value to the after value in the hash table htbl. Returns true on success and false if the hash table does not contain a binding of key to the before value.

ℹī¸ The values are compared using physical equality, i.e. the == operator.

val set_exn : ('k, 'v) t -> 'k -> 'v -> 'v

set_exn htbl key after tries to update an existing binding of key from some before value to the after value in the hash table htbl. Returns the before value on success or raises Not_found if no such binding exists.

  • raises Not_found

    if no binding of key exists in the hash table htbl.

Removing bindings

val try_remove : ('k, 'v) t -> 'k -> bool

try_remove htbl key tries to remove a binding of key from the hash table htbl. Returns true on success and false if the hash table does not contain a binding for key.

val try_compare_and_remove : ('k, 'v) t -> 'k -> 'v -> bool

try_compare_and_remove htbl key before tries to remove a binding of key to the before value from the hash table htbl. Returns true on success and false if the hash table does not contain a binding of key to the before value.

ℹī¸ The values are compared using physical equality, i.e. the == operator.

val remove_exn : ('k, 'v) t -> 'k -> 'v

remove_exn htbl key tries to remove a binding of key to some before value from the hash table htbl. Returns the before value on success or raises Not_found if no such binding exists.

  • raises Not_found

    if no binding of key exists in the hash table htbl.

Examining contents

val to_seq : ('k, 'v) t -> ('k * 'v) Seq.t

to_seq htbl takes a snapshot of the bindings in the hash table htbl and returns them as an association sequence.

🐌 This is a linear-time operation.

val remove_all : ('k, 'v) t -> ('k * 'v) Seq.t

remove_all htbl takes a snapshot of the bindings in the hash table htbl, removes the bindings from the hash table, and returns the snapshot as an association sequence.

🐌 This is a linear-time operation.

val find_random_exn : ('k, 'v) t -> 'k

find_random_exn htbl tries to find a random binding from the hash table htbl and returns the key of the binding or raises Not_found if the hash table is empty.

🐌 This is an expected constant-time operation with worst-case linear-time complexity.

  • raises Not_found

    if the hash table htbl is empty.

Examples

An example top-level session:

  # module Htbl = Saturn.Htbl
  module Htbl = Saturn.Htbl

  # let t : (int, string) Htbl.t =
      Htbl.create
        ~hashed_type:(module Int) ()
  val t : (int, string) Htbl.t = <abstr>

  # Htbl.try_add t 42 "The answer"
  - : bool = true

  # Htbl.try_add t 101 "Basics"
  - : bool = true

  # Htbl.find_exn t 42
  - : string = "The answer"

  # Htbl.try_add t 101 "The basics"
  - : bool = false

  # Htbl.remove_all t |> List.of_seq
  - : (int * string) list = [(101, "Basics"); (42, "The answer")]

The lockfree bag (see Saturn.Bag) is implemented using this hash table.