1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889(*****************************************************************************)(* *)(* 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]. *)moduletypeSTORAGE=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. *)typet(** The monad of the storage backend. *)type'am(** The necessary monadic operators the monad of the storage backend
is required to provide. *)moduleSyntax:sigval(let+):'am->('a->'b)->'bmval(let*):'am->('a->'bm)->'bm(** [fail err] shortcuts the current computation by raising an
error.
Said error can be handled with the [catch] combinator. *)valfail:error->'am(** [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]. *)valcatch:'am->('a->'bm)->(error->'bm)->'bm(** [return x] is the simplest computation inside the monad [m] which simply
computes [x] and nothing else. *)valreturn:'a->'am(** [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]. *)vallist_fold_left_m:('a->'b->'am)->'a->'blist->'amend(** [get storage key] returns the value stored in [storage] for
[key], if it exists. Returns [None] if it does not. *)valget:t->bytes->bytesoptionm(** [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]. *)valset:t->bytes->bytes->tm(** [remove storage key] removes [key] from the [storage]. *)valremove:t->bytes->tmend