package irmin-fs

You can search for identifiers within the package.

in-package search v0.2.0

Generic file-system backend for Irmin

Install

Dune Dependency

github.com Readme Changelog ISC License Edit opam file Versions (43)

Authors

Maintainers

T

thomas@gazagnaire.org

Sources

irmin-3.5.2.tbz

sha256=2a1e6a7577e498fbfeb678d666da210dc48d1344637e8ecb653e1dd88c640b5f

sha512=3fb6f49a1af2f8bab1df5b6f5affaaa09f09fe892a08eb2d9de58138e56646d4a6797f3c087b22875e36e3411218ab2435fe5437ac78f323dd661932af021fad

doc/irmin-fs.unix/Irmin_fs_unix/Make/Backend/Node_portable/index.html

Module `Backend.Node_portable`

type t

val t : t Irmin__.Type.t

val metadata_t : Schema.Metadata.t Irmin__.Type.t

type contents_key = Hash.t

val contents_key_t : contents_key Irmin__.Type.t

type node_key = Hash.t

val node_key_t : node_key Irmin__.Type.t

val step_t : Schema.Path.step Irmin__.Type.t

type value = [

| `Contents of contents_key * Schema.Metadata.t
| `Node of node_key

]

val value_t : value Irmin__.Type.t

val hash_t : Hash.t Irmin__.Type.t

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

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

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

val seq : 
  ?offset:int ->
  ?length:int ->
  ?cache:bool ->
  t ->
  (Schema.Path.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.t

val clear : t -> unit

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

val add : t -> Schema.Path.step -> value -> t

val remove : t -> Schema.Path.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.t) list
  | `Node of (Schema.Path.step * value) list ]

val of_node : Node.value -> t

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

type proof = [

| `Blinded of Hash.t
| `Inode of int * (int * proof) list
| `Values of (Schema.Path.step * value) list

]

val proof_t : proof Irmin__.Type.t

val to_proof : t -> proof

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