package octez-smart-rollup-node-lib

You can search for identifiers within the package.

in-package search v0.2.0

Package contains no libraries

val decode_durable_state : 
  'a Tezos_tree_encoding.t ->
  Tezos_layer2_store.Context.pvmstate ->
  'a Lwt.t

decode_durable_state enc tree decodes a value using the encoder enc from the provided tree

val proof_mem_tree : 
  Tezos_layer2_store.Context.pvmstate ->
  string list ->
  bool Lwt.t

proof_mem_tree t k is false iff find_tree k = None.

val proof_fold_tree : 
  ?depth:Tezos_context_sigs.Context.depth ->
  Tezos_layer2_store.Context.pvmstate ->
  string list ->
  order:[ `Sorted | `Undefined ] ->
  init:'a ->
  f:(string list -> Tezos_layer2_store.Context.pvmstate -> '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 values of depth exactly d.
Lt d folds over nodes and values of depth strictly less than d.
Le d folds over nodes and values of depth less than or equal to d.
Gt d folds over nodes and values of depth strictly more than d.
Ge d folds over nodes and values of depth more than or equal to d.

If order is `Sorted (the default), the elements are traversed in lexicographic order of their keys.