Inode.Make_persistentmodule H : Irmin.Hash.Smodule Node :
Irmin.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 :
Irmin_pack.Inode.Internal
with type hash = H.t
and type key = H.t Pack_key.t
and type Snapshot.metadata = Node.metadata
and type Val.step = Node.stepmodule Pack :
Pack_store.S
with type hash = H.t
and type key = H.t Pack_key.t
and type value = Inter.Raw.tinclude Irmin_pack.Inode.S
with type key = H.t Pack_key.t
with type hash = H.t
with type Val.metadata = Node.metadata
with type Val.step = Node.step
with type value = Inter.Val.tinclude Irmin.Indexable.S
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 : [> Irmin.Perms.read ] t -> key -> bool Lwt.tmem t k is true iff k is present in t.
val find : [> Irmin.Perms.read ] t -> key -> value option Lwt.tfind 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 Lwt.tclose 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 : [> Irmin.Perms.write ] t -> value -> key Lwt.tWrite the contents of a value to the store, and obtain its key.
val unsafe_add : [> Irmin.Perms.write ] t -> hash -> value -> key Lwt.tSame 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 : [> Irmin.Perms.read ] t -> hash -> key option Lwt.tIndexing 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 :
Irmin.Perms.read t ->
([ Irmin.Perms.read | Irmin.Perms.write ] t -> 'a Lwt.t) ->
'a Lwt.tbatch t f applies the writes in f in a separate batch. The exact guarantees depend on the implementation.
module Hash : Irmin.Hash.S with type t = hashSignature for digest hashes, inspired by Digestif.
val unsafe_find :
check_integrity:bool ->
[< Irmin.Perms.read ] t ->
key ->
value optionmodule Val : sig ... endtype file_manager = Pack.file_managertype dict = Pack.dicttype dispatcher = Pack.dispatcherval v :
config:Irmin.Backend.Conf.t ->
fm:file_manager ->
dict:dict ->
dispatcher:dispatcher ->
lru:Lru.t ->
Irmin.Perms.read tmodule 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 :
Irmin_pack.Inode.Raw
with type t = Pack.value
and type hash := hash
and type key := hash Pack_key.tmodule Snapshot :
Irmin_pack.Inode.Snapshot
with type hash = hash
and type metadata = Val.metadataval to_snapshot : Raw.t -> Snapshot.inodeval of_snapshot : 'a t -> index:(hash -> key) -> Snapshot.inode -> valueval purge_lru : 'a t -> unit