The priority of a pending operation.

A priority is attached to each pending operation.

This type is used for data representing pending operations of the prevalidator. Any iterator on this structure will process operations with `High priority first, followed by `Medium and finally `Low priority.

This module implements a sized-set data-structure.

The empty structure of pending operations.

hashes p returns the set of hashes contained in p

operations p returns the Map of bindings oph -> op contained in p

is_empty p returns true if p has operations, false otherwise.

mem oph p returns true if oph is found in p, false otherwise.

Complexity is O(log(n)), where n is the number of operations (hashes) in the structure.

add oph op p prio records the operation op whose hash is oph and whose priority is prio in p.

Complexity is O(log(n)), where n is the number of operations (hashes) in the structure.

It is unspecified behaviour to call this function with a hash (oph) which is already recorded in the data-structure (p). It is your responsibility as the caller of the function to ensure this.

remove oph op p removes the binding oph from p.

Complexity is O(log(n)), where n is the number of operations (hashes) in the structure.

cardinal p returns the number of operations (hashes) in p.

Complexity is O(n), where n is the number of operations (hashes) in the structure.

fold f p acc applies the function f on every binding oph |-> op of priority prio in p. The acc is passed to and (possibly) updated by every call to f.

We iterate on operations with `High priority first, then on those with `Low priority. For operations with the same priority, the iteration order is defined Operation_hash.compare function (operations with small hashes are processed first).

iter f p is similar to fold where acc is unit

fold_es f p acc is the Lwt version of fold, except that fold_es returns wihtout iterating over all the elements of the list as soon as a value Error e is returned by f