with type key = Key.t
with type hash = H.t
with type value = Inter.Raw.t
Read-only stores are store where it is only possible to read existing values.
type key = Key.t
The type for keys.
type value = Inter.Raw.t
The type for raw values.
find t k is
Some v if
k is associated to
k is not present in
type hash = H.t
The type of hashes of
Indexing maps the hash of a value to a corresponding key of that value in the store. For stores that are addressed by hashes directly, this is typically
fun _t h -> Lwt.return (Key.of_hash h); for stores with more complex addressing schemes,
index may attempt a lookup operation in the store.
In general, indexing is best-effort and reveals no information about the membership of the value in the store. In particular:
index t hash = Some keydoesn't guarantee
mem t key: the value with hash
hashmay still be absent from the store;
index t hash = Nonedoesn't guarantee that there is no
mem t keyand
Key.to_hash key = hash: the value may still be present in the store under a key that is not indexed.
unsafe_add to work with a read-only database handler.