package tezos-context

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

Parameters
Signature

Tezos: on-disk context abstraction for `tezos-node`

Install

dune-project

Dependency

www.tezos.com Edit opam file Versions (5)

Authors

T

Tezos devteam

Maintainers

C

contact@tezos.com

Sources

tezos-v12.3.tar.bz2

sha256=296bb5674bc6050afe6330326fbdd0dfc2255d414bfd6b79cc7666ac6b39316d

sha512=c061cd300a9410300851158d77bf8e56ca3c568b0b1161b38305e5b2efdcd9c746d391f832fdb2826f9a1d6babce10a9b764a4b04f5df42699f7314b9863123a

doc/tezos-context.helpers/Tezos_context_helpers/Context/Make_tree/index.html

Module `Context.Make_tree`Source

Parameters

module DB : DB

Signature

include Tezos_context_sigs.Context.TREE
  with type t := DB.t
   and type key := DB.key
   and type value := DB.contents
   and type tree := DB.tree

include Tezos_context_sigs.Context.VIEW
  with type t := DB.tree
   and type tree := DB.tree
  with type key := DB.key
  with type value := DB.contents

Getters

val mem : DB.tree -> DB.key -> bool Lwt.t

mem t k is an Lwt promise that resolves to true iff k is bound to a value in t.

val mem_tree : DB.tree -> DB.key -> bool Lwt.t

mem_tree t k is like mem but for trees.

val find : DB.tree -> DB.key -> DB.contents option Lwt.t

find t k is an Lwt promise that resolves to Some v if k is bound to the value v in t and None otherwise.

Sourceval find_tree : DB.tree -> DB.key -> DB.tree option Lwt.t

find_tree t k is like find but for trees.

Source

val list : 
  DB.tree ->
  ?offset:int ->
  ?length:int ->
  DB.key ->
  (string * DB.tree) list Lwt.t

list t key is the list of files and sub-nodes stored under k in t. The result order is not specified but is stable.

offset and length are used for pagination.

Setters

Sourceval add : DB.tree -> DB.key -> DB.contents -> DB.tree Lwt.t

add t k v is an Lwt promise that resolves to c such that:

k is bound to v in c;
and c is similar to t otherwise.

If k was already bound in t to a value that is physically equal to v, the result of the function is a promise that resolves to t. Otherwise, the previous binding of k in t disappears.

Sourceval add_tree : DB.tree -> DB.key -> DB.tree -> DB.tree Lwt.t

add_tree is like add but for trees.

val remove : DB.tree -> DB.key -> DB.tree Lwt.t

remove t k v is an Lwt promise that resolves to c such that:

k is unbound in c;
and c is similar to t otherwise.

Folding

Source

val fold : 
  ?depth:Tezos_context_sigs.Context.depth ->
  DB.tree ->
  DB.key ->
  order:[ `Sorted | `Undefined ] ->
  init:'a ->
  f:(DB.key -> DB.tree -> 'a -> 'a Lwt.t) ->
  'a Lwt.t

fold ?depth t root ~order ~init ~f recursively folds over the trees and values of t. The f callbacks are called with a key relative to root. f is never called with an empty key for values; i.e., folding over a value is a no-op.

The depth is 0-indexed. If depth is set (by default it is not), then f is only called when the conditions described by the parameter is true:

Eq d folds over nodes and contents of depth exactly d.
Lt d folds over nodes and contents of depth strictly less than d.
Le d folds over nodes and contents of depth less than or equal to d.
Gt d folds over nodes and contents of depth strictly more than d.
Ge d folds over nodes and contents of depth more than or equal to d.

If order is `Sorted (the default), the elements are traversed in lexicographic order of their keys. For large nodes, it is memory-consuming, use `Undefined for a more memory efficient fold.

Sourceval is_empty : DB.tree -> bool

is_empty t is true iff t is empty _.

Sourceval kind : DB.tree -> Tezos_context_sigs.Context.Kind.t

kind t is t's kind. It's either a tree node or a leaf value.

Sourceval to_value : DB.tree -> DB.contents option Lwt.t

to_value t is an Lwt promise that resolves to Some v if t is a leaf tree and None otherwise. It is equivalent to find t [].

Sourceval hash : DB.tree -> Tezos_base__TzPervasives.Context_hash.t

hash t is t's Merkle hash.

Sourceval equal : DB.tree -> DB.tree -> bool

equal x y is true iff x and y have the same Merkle hash.

Caches

val clear : ?depth:int -> DB.tree -> unit

clear ?depth t clears all caches in the tree t for subtrees with a depth higher than depth. If depth is not set, all of the subtrees are cleared.

Sourceval pp : Format.formatter -> DB.tree -> unit

Sourceval empty : _ -> DB.tree

Sourceval of_value : _ -> DB.contents -> DB.tree Lwt.t

Sourcetype raw = [

| `Value of DB.contents
| `Tree of raw Tezos_stdlib.TzString.Map.t

]

Sourceval raw_encoding : raw Tezos_base__TzPervasives.Data_encoding.t

Sourceval to_raw : DB.tree -> raw Lwt.t

Sourceval of_raw : raw -> DB.tree

type kinded_hash := [

| `Contents of Tezos_base__TzPervasives.Context_hash.t
| `Node of Tezos_base__TzPervasives.Context_hash.t

]

Sourcetype repo = DB.repo

Sourceval make_repo : unit -> DB.repo Lwt.t

Sourceval shallow : DB.repo -> kinded_hash -> DB.tree

Sourceexception Context_dangling_hash of string

Exception raised by find_tree and add_tree when applied to shallow trees. It is exposed for so that the memory context can in turn raise it.