Inode.Make_persistent
module 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.t
module Inter :
Brassaia_eio_pack_io.Import.Brassaia_pack.Inode.Internal
with type hash = H.t
and type key = H.t Pack_key.t
module Pack :
Pack_store.S
with type hash = H.t
and type key = H.t Pack_key.t
and type value = Inter.Raw.t
include 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.t
include 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.t
include 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.t
Read-only stores are store where it is only possible to read existing values.
type key = H.t Pack_key.t
The type for keys.
type value = Inter.Val.t
The type for raw values.
val mem : [> Brassaia_eio.Import.read ] t -> key -> bool
mem t k
is true iff k
is present in t
.
val find : [> Brassaia_eio.Import.read ] t -> key -> value option
find 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 -> unit
close t
frees up all the resources associated with t
. Any operations run on a closed handle will raise Closed
.
type hash = H.t
The type of hashes of value
.
val add : [> Brassaia_eio.Import.write ] t -> value -> key
Write the contents of a value to the store, and obtain its key.
val unsafe_add : [> Brassaia_eio.Import.write ] t -> hash -> value -> key
Same 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 option
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 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) ->
'a
batch 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 = hash
Signature for digest hashes, inspired by Digestif.
val unsafe_find :
check_integrity:bool ->
[< Brassaia_eio_pack.Import.read ] t ->
key ->
value option
module Val :
Brassaia_eio_pack.Inode_intf.Value
with type t = value
and type key = key
and type hash = Hash.t
and type Portable.hash := hash
type file_manager = Pack.file_manager
type dict = Pack.dict
type dispatcher = Pack.dispatcher
val 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 t
include Brassaia_eio_pack_io.Import.Brassaia_pack.Checkable
with type 'a t := 'a t
and type hash := hash
val integrity_check :
offset:Brassaia_eio_pack.Import.int63 ->
length:int ->
hash ->
_ t ->
(unit, [ `Wrong_hash | `Absent_value ]) Stdlib.result
module 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 t
module 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.t
module Snapshot :
Brassaia_eio_pack_io.Import.Brassaia_pack.Inode.Snapshot
with type hash = hash
val to_snapshot : Raw.t -> Snapshot.inode
val of_snapshot : 'a t -> index:(hash -> key) -> Snapshot.inode -> value
val purge_lru : 'a t -> unit
val key_of_offset : 'a t -> Import.int63 -> key
val get_offset : 'a t -> key -> Import.int63