merkle-patricia-tree/dist/prioritizedTaskExecutor.d.ts

This is an implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.

export declare class PrioritizedTaskExecutor {
    /** The maximum size of the pool */
    private maxPoolSize;
    /** The current size of the pool */
    private currentPoolSize;
    /** The task queue */
    private queue;
    /**
     * Executes tasks up to maxPoolSize at a time, other items are put in a priority queue.
     * @class PrioritizedTaskExecutor
     * @private
     * @param maxPoolSize The maximum size of the pool
     */
    constructor(maxPoolSize: number);
    /**
     * Executes the task or queues it if no spots are available.
     * When a task is added, check if there are spots left in the pool.
     * If a spot is available, claim that spot and give back the spot once the asynchronous task has been resolved.
     * When no spots are available, add the task to the task queue. The task will be executed at some point when another task has been resolved.
     * @private
     * @param priority The priority of the task
     * @param fn The function that accepts the callback, which must be called upon the task completion.
     */
    executeOrQueue(priority: number, fn: Function): void;
    /**
     * Checks if the taskExecutor is finished.
     * @private
     * @returns Returns `true` if the taskExecutor is finished, otherwise returns `false`.
     */
    finished(): boolean;
}