package irmin-fs

  1. Overview
  2. Docs
Generic file-system backend for Irmin

Install 

dune-project
 Dependency

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

Authors

  1. T
    Thomas Gazagnaire
  2. T
    Thomas Leonard

Maintainers

  1. T
    thomas@gazagnaire.org

Sources

irmin-3.6.1.tbz
sha256=11fc2570bdbfd48478c89113fc801084a84a9a2c12d9bf8c64e05ce64ae19bd7
sha512=2171699ca24dec5c9c908a2676b272e034c14eb17f7052a794535e52af0be40be68a689e59c0a640ee244b11703320483f4d0c261542e6242ba23a8f1272b9b0

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 = [
  1. | `Contents of contents_key * Schema.Metadata.t
  2. | `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 = [
  1. | `Blinded of Hash.t
  2. | `Inode of int * (int * proof) list
  3. | `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