package irmin-test

You can search for identifiers within the package.

in-package search v0.2.0

Legend:
Library
Module
Module type
Parameter
Class
Class type

type t =
  Irmin__Node.Generic_key.Make(Hash)(Path)(Metadata)(Contents_key)(Node_key).Portable.t

val t : t Irmin__.Type.t

val metadata_t : metadata Irmin__.Type.t

type contents_key = hash

val contents_key_t : contents_key Irmin__.Type.t

type node_key = hash

val node_key_t : node_key Irmin__.Type.t

val step_t : step Irmin__.Type.t

type value = [

]

val value_t : value Irmin__.Type.t

val hash_t : hash Irmin__.Type.t

val of_list : (step * value) list -> t

val list : 
  ?offset:int ->
  ?length:int ->
  ?cache:bool ->
  t ->
  (step * value) list

val of_seq : (step * value) Irmin__.Import.Seq.t -> t

val seq : 
  ?offset:int ->
  ?length:int ->
  ?cache:bool ->
  t ->
  (step * value) Irmin__.Import.Seq.t

val empty : unit -> t

val is_empty : t -> bool

val length : t -> int

val hash_exn : ?force:bool -> t -> hash

val clear : t -> unit

val find : ?cache:bool -> t -> step -> value option

val add : t -> step -> value -> t

val remove : t -> step -> t

module Metadata : sig ... end

val with_handler : 
  ((expected_depth:int -> node_key -> t option) ->
    expected_depth:int ->
    node_key ->
    t option) ->
  t ->
  t

val head : 
  t ->
  [ `Inode of int * (int * hash) list | `Node of (step * value) list ]

val of_node : t -> t

val merge : 
  contents:contents_key option Irmin__.Merge.t ->
  node:node_key option Irmin__.Merge.t ->
  t Irmin__.Merge.t

type proof = [

]

val proof_t : proof Irmin__.Type.t

val to_proof : t -> proof

val of_proof : depth:int -> proof -> t option