Inode.Make_persistentmodule Node :
Brassaia_eio_pack_io.Import.Brassaia.Node.Generic_key.S
with type hash = H.t
and type contents_key = H.t Pack_key.t
and type node_key = H.t Pack_key.tmodule Inter :
Brassaia_eio_pack_io.Import.Brassaia_pack.Inode.Internal
with type hash = H.t
and type key = H.t Pack_key.tmodule Pack :
Pack_store.S
with type hash = H.t
and type key = H.t Pack_key.t
and type value = Inter.Raw.tinclude Brassaia_eio_pack_io.Import.Brassaia_pack.Inode.S
with type key = H.t Pack_key.t
with type hash = H.t
with type value = Inter.Val.tinclude Brassaia_eio_pack.Import.Brassaia.Indexable.S
with type key = H.t Pack_key.t
with type hash = H.t
with type value = Inter.Val.tinclude Brassaia_eio.Indexable_intf.S_without_key_impl
with type key = H.t Pack_key.t
with type hash = H.t
with type value = Inter.Val.tRead-only stores are store where it is only possible to read existing values.
type key = H.t Pack_key.tThe type for keys.
type value = Inter.Val.tThe type for raw values.
val mem : [> Brassaia_eio.Import.read ] t -> key -> boolmem t k is true iff k is present in t.
val find : [> Brassaia_eio.Import.read ] t -> key -> value optionfind t k is Some v if k is associated to v in t and None is k is not present in t.
val close : 'a t -> unitclose t frees up all the resources associated with t. Any operations run on a closed handle will raise Closed.
type hash = H.tThe type of hashes of value.
val add : [> Brassaia_eio.Import.write ] t -> value -> keyWrite the contents of a value to the store, and obtain its key.
val unsafe_add : [> Brassaia_eio.Import.write ] t -> hash -> value -> keySame as add but allows specifying the value's hash directly. The backend might choose to discard that hash and/or can be corrupt if the hash is not consistent.
val index : [> Brassaia_eio.Import.read ] t -> hash -> key optionIndexing 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 key doesn't guarantee mem t key: the value with hash hash may still be absent from the store;index t hash = None doesn't guarantee that there is no key such that mem t key and Key.to_hash key = hash: the value may still be present in the store under a key that is not indexed.val batch :
Brassaia_eio.Import.read t ->
([ Brassaia_eio.Import.read | Brassaia_eio.Import.write ] t -> 'a) ->
'abatch t f applies the writes in f in a separate batch. The exact guarantees depend on the implementation.
module Hash : Brassaia_eio_pack.Import.Brassaia.Hash.S with type t = hashSignature for digest hashes, inspired by Digestif.
val unsafe_find :
check_integrity:bool ->
[< Brassaia_eio_pack.Import.read ] t ->
key ->
value optionmodule Val :
Brassaia_eio_pack.Inode_intf.Value
with type t = value
and type key = key
and type hash = Hash.t
and type Portable.hash := hashtype file_manager = Pack.file_managertype dict = Pack.dicttype dispatcher = Pack.dispatcherval init :
config:Brassaia_eio_pack_io.Import.Brassaia.Backend.Conf.t ->
file_manager:file_manager ->
dict:dict ->
dispatcher:dispatcher ->
lru:Lru.t option ->
Import.read tinclude Brassaia_eio_pack_io.Import.Brassaia_pack.Checkable
with type 'a t := 'a t
and type hash := hashval integrity_check :
offset:Brassaia_eio_pack.Import.int63 ->
length:int ->
hash ->
_ t ->
(unit, [ `Wrong_hash | `Absent_value ]) Stdlib.resultmodule Pack :
Pack_store.S
with type file_manager = file_manager
and type dict = dict
and type dispatcher = dispatcher
and type key := hash Pack_key.t
and type hash := hash
and type 'a t = 'a tmodule Raw :
Brassaia_eio_pack_io.Import.Brassaia_pack.Inode.Raw
with type t = Pack.value
and type hash := hash
and type key := hash Pack_key.tmodule Snapshot :
Brassaia_eio_pack_io.Import.Brassaia_pack.Inode.Snapshot
with type hash = hashval to_snapshot : Raw.t -> Snapshot.inodeval of_snapshot : 'a t -> index:(hash -> key) -> Snapshot.inode -> valueval purge_lru : 'a t -> unitval key_of_offset : 'a t -> Import.int63 -> keyval get_offset : 'a t -> key -> Import.int63