package octez-libs

  1. Overview
  2. Docs
A package that contains multiple base libraries used by the Octez suite

Install 

dune-project
 Dependency

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

Authors

  1. T
    Tezos devteam

Maintainers

  1. C
    contact@tezos.com

Sources

octez-19.1.tar.gz
sha256=55ea1fb8bb3273a7fc270ca8f650d45c56449665619482aad9bc12f3ea736b7e
sha512=fec850fc2d17d7490bbabd5147d62aad13b3aaed8774270f8a38ab419670ed03e0fd30cf8642a97984eca5c2446726fe590ad99c015f7ec50919dc7652f25053

doc/octez-libs.requester/Tezos_requester/Requester/Make/index.html

Module Requester.MakeSource

Parameters

module Hash : HASH
module Disk_table : DISK_TABLE with type key := Hash.t
module Memory_table : MEMORY_TABLE with type key := Hash.t
module Request : REQUEST with type key := Hash.t
module Probe : PROBE with type key := Hash.t and type value := Disk_table.value

Signature

include REQUESTER with type key = Hash.t with type value = Disk_table.value with type param = Probe.param
Sourcetype t
Sourcetype key = Hash.t

The index key

The indexed data

Sourcetype param = Probe.param

validation clue

Sourceval known : t -> key -> bool Lwt.t

know t k returns true iff the key is present in the memory table or the disk.

Sourcetype Tezos_base.TzPervasives.error +=
  1. | Missing_data of key

Return value if it is found in-memory, or else on disk. Otherwise fail with error Missing_data.

Sourceval read_opt : t -> key -> value option Lwt.t

Same as read but returns None if not found.

Sourceval inject : t -> key -> value -> bool Lwt.t

inject t k v returns false if k is already present in the memory table or in the disk, or has already been requested. Otherwise it updates the memory table and return true

fetch 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 PROBE 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).

Sourceval clear_or_cancel : t -> key -> unit

Remove the data from the memory table if present. Otherwise decrements the number of watcher to this data. If their is only one watcher any pending fetch promises are resolved with the error Canceled.

The "disk" storage

Sourcetype request_param = Request.param

Configuration parameter to the Request service

Sourcetype notified_value = Probe.notified_value

type of values notified to the requester

Sourceval pending : t -> key -> bool

pending t k returns true iff the key status is pending

Sourceval watch : t -> (key * value) Lwt_stream.t * Lwt_watcher.stopper

Monitor all the fetched data. A given data will appear only once.

notify t peer k nv notifies the requester that a value has been received for key k, from peer peer. nv is a *notified value*. The notified value is validated using Probe.probe, and the param provided at fetching time (see PROBE). If valid, the memory table is updated and all promises waiting on this key are resolved.

If the key is not pending the notification is ignored.

Sourceval memory_table_length : t -> int

memory_table_length t returns the number of keys either known or pending in the memory table of t

Sourceval pending_requests : t -> int

Returns the number of requests currently pending

Sourceval create : ?random_table:bool -> ?global_input:(key * value) Lwt_watcher.input -> request_param -> store -> t

create ?random_table ?global_input r s creates a requester. r is the configuration parameter passed to Request functions.

The value for random_table determines whether the underlying hashtable randomises its hash (see Stdlib.Hashtbl.create and specifically the documentation of the random parameter). The default depends on environment variables and Stdlib.Hashtbl.randomize has been called.

Sourceval shutdown : t -> unit Lwt.t