@lodestar/beacon-node 1.23.0-dev.404f13abfd → 1.23.0-dev.4b7d871ab3

package/lib/network/processor/gossipQueues/indexedAvgTime.d.ts

@@ -1,31 +0,0 @@
-import { GossipQueue, IndexedGossipQueueOpts } from "./types.js";
-/**
- * An implementation of GossipQueue that tries to run the batch with highest score first.
- * TODO: add unit tests
- * - index items by indexFn using a map
- * - compute avgRecvTimestampMs for each key every time we add new item
- * - on next, pick the key with the highest score (check the score function above)
- */
-export declare class IndexedGossipQueueAvgTime<T extends {
-    indexed?: string;
-}> implements GossipQueue<T> {
-    private readonly opts;
-    private _length;
-    private indexedItems;
-    constructor(opts: IndexedGossipQueueOpts<T>);
-    get length(): number;
-    get keySize(): number;
-    clear(): void;
-    getDataAgeMs(): number[];
-    /**
-     * Add item to gossip queue. If queue is full, drop first item of first key.
-     * Return number of items dropped
-     */
-    add(item: T): number;
-    /**
-     * Try to get list of items of the same key with highest score
-     */
-    next(): T[] | null;
-    getAll(): T[];
-}
-//# sourceMappingURL=indexedAvgTime.d.ts.map

package/lib/network/processor/gossipQueues/indexedAvgTime.js

@@ -1,115 +0,0 @@
-function listScore(list) {
-    return list.items.length / Math.max(1000, Date.now() - list.avgRecvTimestampMs);
-}
-/**
- * An implementation of GossipQueue that tries to run the batch with highest score first.
- * TODO: add unit tests
- * - index items by indexFn using a map
- * - compute avgRecvTimestampMs for each key every time we add new item
- * - on next, pick the key with the highest score (check the score function above)
- */
-export class IndexedGossipQueueAvgTime {
-    constructor(opts) {
-        this.opts = opts;
-        this._length = 0;
-        this.indexedItems = new Map();
-    }
-    get length() {
-        return this._length;
-    }
-    get keySize() {
-        return this.indexedItems.size;
-    }
-    clear() {
-        this.indexedItems = new Map();
-        this._length = 0;
-    }
-    // not implemented for this gossip queue
-    getDataAgeMs() {
-        return [];
-    }
-    /**
-     * Add item to gossip queue. If queue is full, drop first item of first key.
-     * Return number of items dropped
-     */
-    add(item) {
-        const key = this.opts.indexFn(item);
-        if (key == null) {
-            // this comes from getAttDataBase64FromAttestationSerialized() return type
-            // should not happen
-            return 0;
-        }
-        item.indexed = key;
-        let list = this.indexedItems.get(key);
-        if (list == null) {
-            list = {
-                items: [],
-                avgRecvTimestampMs: Date.now(),
-            };
-            this.indexedItems.set(key, list);
-        }
-        else {
-            list.avgRecvTimestampMs = (list.avgRecvTimestampMs * list.items.length + Date.now()) / (list.items.length + 1);
-            list.items.push(item);
-        }
-        this._length++;
-        if (this._length <= this.opts.maxLength) {
-            return 0;
-        }
-        // overload, need to drop more items
-        const firstKey = this.indexedItems.keys().next().value;
-        // there should be at least 1 key
-        if (firstKey == null) {
-            return 0;
-        }
-        const firstList = this.indexedItems.get(firstKey);
-        // should not happen
-        if (firstList == null) {
-            return 0;
-        }
-        const deletedItem = firstList.items.shift();
-        if (deletedItem != null) {
-            this._length--;
-            if (firstList.items.length === 0) {
-                this.indexedItems.delete(firstKey);
-            }
-            return 1;
-        }
-        else {
-            return 0;
-        }
-    }
-    /**
-     * Try to get list of items of the same key with highest score
-     */
-    next() {
-        let maxScore = 0;
-        let maxScoreKey;
-        for (const [key, list] of this.indexedItems) {
-            const score = listScore(list);
-            if (score > maxScore) {
-                maxScore = score;
-                maxScoreKey = key;
-            }
-        }
-        if (maxScoreKey == null) {
-            return null;
-        }
-        const items = this.indexedItems.get(maxScoreKey)?.items;
-        if (items == null) {
-            // should not happen
-            return null;
-        }
-        this.indexedItems.delete(maxScoreKey);
-        this._length = Math.max(0, this._length - items.length);
-        return items;
-    }
-    getAll() {
-        const items = [];
-        for (const list of this.indexedItems.values()) {
-            items.push(...list.items);
-        }
-        return items;
-    }
-}
-//# sourceMappingURL=indexedAvgTime.js.map

package/lib/network/processor/gossipQueues/indexedAvgTime.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"indexedAvgTime.js","sourceRoot":"","sources":["../../../../src/network/processor/gossipQueues/indexedAvgTime.ts"],"names":[],"mappings":"AAOA,SAAS,SAAS,CAAI,IAAiB;IACrC,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,kBAAkB,CAAC,CAAC;AAClF,CAAC;AAED;;;;;;GAMG;AACH,MAAM,OAAO,yBAAyB;IAIpC,YAA6B,IAA+B;QAA/B,SAAI,GAAJ,IAAI,CAA2B;QAHpD,YAAO,GAAG,CAAC,CAAC;QACZ,iBAAY,GAA6B,IAAI,GAAG,EAAE,CAAC;IAEI,CAAC;IAEhE,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC;IAChC,CAAC;IAED,KAAK;QACH,IAAI,CAAC,YAAY,GAAG,IAAI,GAAG,EAAE,CAAC;QAC9B,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;IACnB,CAAC;IAED,wCAAwC;IACxC,YAAY;QACV,OAAO,EAAE,CAAC;IACZ,CAAC;IAED;;;OAGG;IACH,GAAG,CAAC,IAAO;QACT,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,GAAG,IAAI,IAAI,EAAE,CAAC;YAChB,0EAA0E;YAC1E,oBAAoB;YACpB,OAAO,CAAC,CAAC;QACX,CAAC;QACD,IAAI,CAAC,OAAO,GAAG,GAAG,CAAC;QACnB,IAAI,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACtC,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACjB,IAAI,GAAG;gBACL,KAAK,EAAE,EAAE;gBACT,kBAAkB,EAAE,IAAI,CAAC,GAAG,EAAE;aAC/B,CAAC;YACF,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACnC,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,kBAAkB,GAAG,CAAC,IAAI,CAAC,kBAAkB,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC/G,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;QACD,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;YACxC,OAAO,CAAC,CAAC;QACX,CAAC;QAED,oCAAoC;QACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAe,CAAC;QACjE,iCAAiC;QACjC,IAAI,QAAQ,IAAI,IAAI,EAAE,CAAC;YACrB,OAAO,CAAC,CAAC;QACX,CAAC;QACD,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAClD,oBAAoB;QACpB,IAAI,SAAS,IAAI,IAAI,EAAE,CAAC;YACtB,OAAO,CAAC,CAAC;QACX,CAAC;QAED,MAAM,WAAW,GAAG,SAAS,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAC5C,IAAI,WAAW,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,CAAC,OAAO,EAAE,CAAC;YACf,IAAI,SAAS,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACjC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YACrC,CAAC;YACD,OAAO,CAAC,CAAC;QACX,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IAED;;OAEG;IACH,IAAI;QACF,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,WAA+B,CAAC;QACpC,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YAC5C,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;YAC9B,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;gBACrB,QAAQ,GAAG,KAAK,CAAC;gBACjB,WAAW,GAAG,GAAG,CAAC;YACpB,CAAC;QACH,CAAC;QAED,IAAI,WAAW,IAAI,IAAI,EAAE,CAAC;YACxB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,KAAK,CAAC;QACxD,IAAI,KAAK,IAAI,IAAI,EAAE,CAAC;YAClB,oBAAoB;YACpB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACtC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;QACxD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM;QACJ,MAAM,KAAK,GAAQ,EAAE,CAAC;QACtB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;YAC9C,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5B,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF"}