package picos_aux
Install
Dune Dependency
Authors
Maintainers
Sources
sha256=3f5a08199cf65c2dae2f7d68f3877178f1da8eabf5376e15114e5a8958087dfa
sha512=ad24910c47ce614268c4268874bb918da7f8b5f03b3ad706bbf30323635262e94ddab6be24eaebbca706bfa82c0a517d4272b396459e020c185942125c9bdb7b
doc/picos_aux.htbl/Picos_aux_htbl/index.html
Module Picos_aux_htbl
Source
Lock-free 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
Represents a lock-free hash table mapping keys of type 'k
to values of type 'v
.
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 theequal
andhash
operations on keys. Slow polymorphic equality(=)
and slow polymorphicseeded_hash (Bits64.to_int (Random.bits64 ()))
is used by default. - The default
min_buckets
is unspecified and a givenmin_buckets
may be adjusted by the implementation. - The default
max_buckets
is unspecified and a givenmax_buckets
may be adjusted by the implementation.
hashed_type_of htbl
returns a copy of the hashed type used when the hash table htbl
was created.
min_buckets_of htbl
returns the minimum number of buckets of the hash table htbl
.
âšī¸ The returned value may not be the same as given to create
.
max_buckets_of htbl
returns the maximum number of buckets of the hash table htbl
.
âšī¸ The returned value may not be the same as given to create
.
Looking up bindings
find_exn htbl key
returns the current binding of key
in the hash table htbl
or raises Not_found
if no such binding exists.
mem htbl key
determines whether the hash table htbl
has a binding for the key
.
Adding bindings
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
in case the hash table already contained a binding for key
.
Updating bindings
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
in case the hash table did not contain a binding for key
.
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
in case the hash table did not contain a binding of key
to the before
value.
âšī¸ The values are compared using physical equality, i.e. the ==
operator.
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.
Removing bindings
try_remove htbl key
tries to remove a binding of key
from the hash table htbl
. Returns true
on success and false
in case the hash table did not contain a binding for key
.
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
in case the hash table did not contain a binding of key
to the before
value.
âšī¸ The values are compared using physical equality, i.e. the ==
operator.
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.
Examining contents
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.
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.
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
in case the hash table is empty.
đ This is an expected constant time operation with worst case linear time complexity.
Examples
An example top-level session:
# module Htbl = Picos_aux_htbl
module Htbl = Picos_aux_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")]