package tezos-protocol-014-PtKathma
Tezos/Protocol: economic-protocol definition
Install
Dune Dependency
Authors
Maintainers
Sources
tezos-17.3.tar.gz
sha256=7062cd57addd452852598a2214ade393130efa087b99068d53713bdf912b3680
sha512=08e4091144a03ce3c107fb91a66501bd8b65ca3278917c455a2eaac6df3e108ade63f6ab8340a4bb152d60f404326e464d0ec95d26cafe8e82f870465d24a5fc
doc/src/tezos-protocol-014-PtKathma.raw/tx_rollup_l2_storage_sig.ml.html
Source file tx_rollup_l2_storage_sig.ml
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89
(*****************************************************************************) (* *) (* Open Source License *) (* Copyright (c) 2022 Marigold <contact@marigold.dev> *) (* Copyright (c) 2022 Nomadic Labs <contact@nomadic-labs.com> *) (* Copyright (c) 2022 Oxhead Alpha <info@oxheadalpha.com> *) (* *) (* Permission is hereby granted, free of charge, to any person obtaining a *) (* copy of this software and associated documentation files (the "Software"),*) (* to deal in the Software without restriction, including without limitation *) (* the rights to use, copy, modify, merge, publish, distribute, sublicense, *) (* and/or sell copies of the Software, and to permit persons to whom the *) (* Software is furnished to do so, subject to the following conditions: *) (* *) (* The above copyright notice and this permission notice shall be included *) (* in all copies or substantial portions of the Software. *) (* *) (* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR*) (* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, *) (* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL *) (* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER*) (* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING *) (* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER *) (* DEALINGS IN THE SOFTWARE. *) (* *) (*****************************************************************************) (** This module type is the minimal API a storage backend has to implement to be compatible with the [Tx_rollup] layer-2 implementation. In a nutshell, the [Tx_rollup] only needs a simple key-value store, where both keys and values are raw bytes buffers. We build a type-safe abstraction on top of this simple (but potentially unsafe) interface in [Tx_rollup_l2_context]. *) module type STORAGE = sig (** The state of the storage. The API adopts a functional paradigm, where the [set] function returns a new state for the storage, and where it should be possible to reuse a previous state. *) type t (** The monad of the storage backend. *) type 'a m (** The necessary monadic operators the monad of the storage backend is required to provide. *) module Syntax : sig val ( let+ ) : 'a m -> ('a -> 'b) -> 'b m val ( let* ) : 'a m -> ('a -> 'b m) -> 'b m (** [fail err] shortcuts the current computation by raising an error. Said error can be handled with the [catch] combinator. *) val fail : error -> 'a m (** [catch p k h] tries to executes the monadic computation [p]. If [p] terminates without an error, then its result is passed to the continuation [k]. On the contrary, if an error [err] is raised, it is passed to the error handler [h]. *) val catch : 'a m -> ('a -> 'b m) -> (error -> 'b m) -> 'b m (** [return x] is the simplest computation inside the monad [m] which simply computes [x] and nothing else. *) val return : 'a -> 'a m (** [list_fold_left_m f] is a monadic version of [List.fold_left f], wherein [f] is not a pure computation, but a computation in the monad [m]. *) val list_fold_left_m : ('a -> 'b -> 'a m) -> 'a -> 'b list -> 'a m end (** [get storage key] returns the value stored in [storage] for [key], if it exists. Returns [None] if it does not. *) val get : t -> bytes -> bytes option m (** [set storage key] computes a new state for the storage wherein the value associated to [key] is [value]. [storage] is expected to remain usable and consistent even after the execution of [set]. *) val set : t -> bytes -> bytes -> t m (** [remove storage key] removes [key] from the [storage]. *) val remove : t -> bytes -> t m end
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>