Index of operations (for the mempool).
type t = Tezos_base.Operation.tinclude Tezos_requester.Requester.REQUESTER
with type t := chain_db
and type key := Tezos_crypto.Operation_hash.t
and type value := Tezos_base.Operation.t
and type param := unitval known : chain_db -> Tezos_crypto.Operation_hash.t -> bool Lwt.tknow t k returns true iff the key is present in the memory table or the disk.
val read :
chain_db ->
Tezos_crypto.Operation_hash.t ->
(Tezos_base.Operation.t, Tezos_error_monad.TzCore.error list) Stdlib.result
Lwt.tReturn value if it is found in-memory, or else on disk. Otherwise fail with error Missing_data.
val read_opt :
chain_db ->
Tezos_crypto.Operation_hash.t ->
Tezos_base.Operation.t option Lwt.tSame as read but returns None if not found.
val fetch :
chain_db ->
?peer:Tezos_base.P2p_peer.Id.t ->
?timeout:Tezos_base.Time.System.Span.t ->
Tezos_crypto.Operation_hash.t ->
unit ->
(Tezos_base.Operation.t, Tezos_error_monad.TzCore.error list) Stdlib.result
Lwt.tfetch t ?peer ?timeout k param returns the value when it is known. It can fail with Timeout k if timeout is provided and the value isn't know before the timeout expires. It can fail with Cancel if the request is canceled.
The key is first looked up in memory, then on disk. If not present and not already requested, it schedules a request, and blocks until the requester is notified with notify. param is used to validate the notified value once it is received. (see also PRECHECK and notify).
Requests are re-sent via a 1.5 exponential back-off, with initial delay set to Request.initial_delay. If the function is called multiple time with the same key but with distinct peers, the internal scheduler randomly chooses the requested peer (at each retry).
val clear_or_cancel : chain_db -> Tezos_crypto.Operation_hash.t -> unitRemove the data from the memory table if present. Otherwise cancel all pending requests. Any pending fetch promises are resolved with the error Canceled.