Index (irmin-pack.Irmin_pack_unix.Maker.Make.Internal.Index)

type t

type key = hash

type value = Optint.Int63.t * int * Irmin_pack.Pack_value.Kind.t

include Index.S with type value := value and type t := t and type key := key

type cache

val empty_cache : unit -> cache

val clear : t -> unit

val replace : ?overcommit:bool -> t -> key -> value -> unit

val sync : t -> unit

val is_merging : t -> bool

module Checks : sig ... end

module Io : Io.S

Low level IO abstraction. A typical implementation is unix. This abstraction is meant to be dead simple. Not a lot of documentation is required.

val v_exn : 
  ?flush_callback:(unit -> unit) ->
  ?fresh:bool ->
  ?readonly:bool ->
  ?throttle:[ `Block_writes | `Overcommit_memory ] ->
  ?lru_size:int ->
  log_size:int ->
  string ->
  t

type create_error := [

| `Index_failure of string
| `Io_misc of Io.misc_error

]

type write_error := [

| `Index_failure of string
| `Io_misc of Io.misc_error
| `Ro_not_allowed

]

val v : 
  ?flush_callback:(unit -> unit) ->
  ?fresh:bool ->
  ?readonly:bool ->
  ?throttle:[ `Block_writes | `Overcommit_memory ] ->
  ?lru_size:int ->
  log_size:int ->
  string ->
  (t, [> create_error ]) Stdlib.result

val reload : t -> (unit, [> write_error ]) Stdlib.result

val close : t -> (unit, [> write_error ]) Stdlib.result

val close_exn : t -> unit

val flush : t -> with_fsync:bool -> (unit, [> write_error ]) Stdlib.result

val find : t -> key -> value option

val add : ?overcommit:bool -> t -> key -> value -> unit

val merge : t -> unit

val mem : t -> key -> bool

val iter : (key -> value -> unit) -> t -> unit

val filter : t -> ((key * value) -> bool) -> unit

val try_merge : t -> unit

module Stats = Index.Stats

module Key : Index.Key.S with type t = key