@aztec/foundation 0.0.1-commit.9ef841308 → 0.0.1-commit.a89ec08

package/dest/collection/lru_set.d.ts

@@ -1,35 +0,0 @@
-/**
- * A bounded set with Least Recently Used (LRU) eviction.
- * Both {@link has} and {@link add} count as an access and refresh the entry's
- * recency, so items that are actively checked stay in the set longest.
- *
- * Uses a doubly-linked list for O(1) ordering and a Map for O(1) lookup.
- * Head = least recent, tail = most recent.
- */
-export declare class LruSet<T> {
-    private readonly maxSize;
-    /** Map from value to its linked-list node for O(1) lookup. */
-    private readonly map;
-    private head;
-    private tail;
-    constructor(maxSize: number);
-    /** Number of entries in the set. */
-    get size(): number;
-    /**
-     * Returns true if the item is in the set.
-     * Refreshes the item's recency so it becomes the most recently used.
-     */
-    has(item: T): boolean;
-    /**
-     * Adds an item to the set. If the item already exists, refreshes its recency.
-     * If the set is at capacity, evicts the least recently used item.
-     */
-    add(item: T): void;
-    /** Removes all entries from the set. */
-    clear(): void;
-    /** Unlinks a node from its current position and relinks it at the tail. */
-    private moveToTail;
-    /** Evicts the head (least recently used) node. */
-    private evictHead;
-}
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoibHJ1X3NldC5kLnRzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vc3JjL2NvbGxlY3Rpb24vbHJ1X3NldC50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFPQTs7Ozs7OztHQU9HO0FBQ0gscUJBQWEsTUFBTSxDQUFDLENBQUM7SUFNUCxPQUFPLENBQUMsUUFBUSxDQUFDLE9BQU87SUFMcEMsOERBQThEO0lBQzlELE9BQU8sQ0FBQyxRQUFRLENBQUMsR0FBRyxDQUE0QjtJQUNoRCxPQUFPLENBQUMsSUFBSSxDQUF5QjtJQUNyQyxPQUFPLENBQUMsSUFBSSxDQUF5QjtJQUVyQyxZQUE2QixPQUFPLEVBQUUsTUFBTSxFQUkzQztJQUVELG9DQUFvQztJQUNwQyxJQUFJLElBQUksSUFBSSxNQUFNLENBRWpCO0lBRUQ7OztPQUdHO0lBQ0gsR0FBRyxDQUFDLElBQUksRUFBRSxDQUFDLEdBQUcsT0FBTyxDQU9wQjtJQUVEOzs7T0FHRztJQUNILEdBQUcsQ0FBQyxJQUFJLEVBQUUsQ0FBQyxHQUFHLElBQUksQ0FtQmpCO0lBRUQsd0NBQXdDO0lBQ3hDLEtBQUssSUFBSSxJQUFJLENBSVo7SUFFRCwyRUFBMkU7SUFDM0UsT0FBTyxDQUFDLFVBQVU7SUF3QmxCLGtEQUFrRDtJQUNsRCxPQUFPLENBQUMsU0FBUztDQVdsQiJ9

package/dest/collection/lru_set.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"lru_set.d.ts","sourceRoot":"","sources":["../../src/collection/lru_set.ts"],"names":[],"mappings":"AAOA;;;;;;;GAOG;AACH,qBAAa,MAAM,CAAC,CAAC;IAMP,OAAO,CAAC,QAAQ,CAAC,OAAO;IALpC,8DAA8D;IAC9D,OAAO,CAAC,QAAQ,CAAC,GAAG,CAA4B;IAChD,OAAO,CAAC,IAAI,CAAyB;IACrC,OAAO,CAAC,IAAI,CAAyB;IAErC,YAA6B,OAAO,EAAE,MAAM,EAI3C;IAED,oCAAoC;IACpC,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED;;;OAGG;IACH,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,OAAO,CAOpB;IAED;;;OAGG;IACH,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAmBjB;IAED,wCAAwC;IACxC,KAAK,IAAI,IAAI,CAIZ;IAED,2EAA2E;IAC3E,OAAO,CAAC,UAAU;IAwBlB,kDAAkD;IAClD,OAAO,CAAC,SAAS;CAWlB"}

package/dest/collection/lru_set.js

@@ -1,95 +0,0 @@
-/** Node in a doubly-linked list used by {@link LruSet}. */ /**
- * A bounded set with Least Recently Used (LRU) eviction.
- * Both {@link has} and {@link add} count as an access and refresh the entry's
- * recency, so items that are actively checked stay in the set longest.
- *
- * Uses a doubly-linked list for O(1) ordering and a Map for O(1) lookup.
- * Head = least recent, tail = most recent.
- */ export class LruSet {
-    maxSize;
-    /** Map from value to its linked-list node for O(1) lookup. */ map;
-    head;
-    tail;
-    constructor(maxSize){
-        this.maxSize = maxSize;
-        this.map = new Map();
-        if (maxSize < 1) {
-            throw new Error('LruSet maxSize must be at least 1');
-        }
-    }
-    /** Number of entries in the set. */ get size() {
-        return this.map.size;
-    }
-    /**
-   * Returns true if the item is in the set.
-   * Refreshes the item's recency so it becomes the most recently used.
-   */ has(item) {
-        const node = this.map.get(item);
-        if (!node) {
-            return false;
-        }
-        this.moveToTail(node);
-        return true;
-    }
-    /**
-   * Adds an item to the set. If the item already exists, refreshes its recency.
-   * If the set is at capacity, evicts the least recently used item.
-   */ add(item) {
-        const existing = this.map.get(item);
-        if (existing) {
-            this.moveToTail(existing);
-            return;
-        }
-        if (this.map.size >= this.maxSize) {
-            this.evictHead();
-        }
-        const node = {
-            value: item,
-            prev: this.tail,
-            next: undefined
-        };
-        if (this.tail) {
-            this.tail.next = node;
-        } else {
-            this.head = node;
-        }
-        this.tail = node;
-        this.map.set(item, node);
-    }
-    /** Removes all entries from the set. */ clear() {
-        this.map.clear();
-        this.head = undefined;
-        this.tail = undefined;
-    }
-    /** Unlinks a node from its current position and relinks it at the tail. */ moveToTail(node) {
-        if (node === this.tail) {
-            return;
-        }
-        // Unlink
-        if (node.prev) {
-            node.prev.next = node.next;
-        } else {
-            this.head = node.next;
-        }
-        if (node.next) {
-            node.next.prev = node.prev;
-        }
-        // Relink at tail
-        node.prev = this.tail;
-        node.next = undefined;
-        if (this.tail) {
-            this.tail.next = node;
-        }
-        this.tail = node;
-    }
-    /** Evicts the head (least recently used) node. */ evictHead() {
-        const oldHead = this.head;
-        this.map.delete(oldHead.value);
-        this.head = oldHead.next;
-        if (this.head) {
-            this.head.prev = undefined;
-        } else {
-            this.tail = undefined;
-        }
-    }
-}

package/dest/fifo/fifo_frame_reader.d.ts

@@ -1,41 +0,0 @@
-import EventEmitter from 'node:events';
-import type { Readable } from 'node:stream';
-/**
- * Events emitted by FifoFrameReader.
- *
- * - `frame`: A complete frame payload (without the 4-byte length header).
- * - `error`: An unrecoverable error (invalid frame length, stream error).
- * - `end`: The underlying stream has ended.
- */
-export interface FifoFrameReaderEvents {
-    frame: [payload: Buffer];
-    error: [error: Error];
-    end: [];
-}
-/**
- * Reads length-delimited frames from a readable stream (typically a named FIFO pipe).
- *
- * Wire format: `[4-byte big-endian payload length][payload bytes]`
- *
- * Emits a `frame` event for each complete frame with the raw payload buffer.
- * Callers are responsible for deserializing the payload (e.g., via msgpack).
- *
- * On encountering an invalid payload length (0 or >maxPayloadSize), emits `error`
- * and destroys the stream.
- */
-export declare class FifoFrameReader extends EventEmitter<FifoFrameReaderEvents> {
-    private readonly maxPayloadSize;
-    private stream;
-    private pendingBuf;
-    private running;
-    constructor(maxPayloadSize?: number);
-    /** Open a FIFO at the given path and start reading frames. */
-    start(fifoPath: string, highWaterMark?: number): void;
-    /** Start reading frames from an existing readable stream. */
-    startFromStream(stream: Readable): void;
-    /** Stop reading and destroy the underlying stream. */
-    stop(): void;
-    /** Parse complete frames out of the pending buffer. */
-    private drainFrames;
-}
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiZmlmb19mcmFtZV9yZWFkZXIuZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9maWZvL2ZpZm9fZnJhbWVfcmVhZGVyLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiJBQUFBLE9BQU8sWUFBWSxNQUFNLGFBQWEsQ0FBQztBQUV2QyxPQUFPLEtBQUssRUFBRSxRQUFRLEVBQUUsTUFBTSxhQUFhLENBQUM7QUFFNUM7Ozs7OztHQU1HO0FBQ0gsTUFBTSxXQUFXLHFCQUFxQjtJQUNwQyxLQUFLLEVBQUUsQ0FBQyxPQUFPLEVBQUUsTUFBTSxDQUFDLENBQUM7SUFDekIsS0FBSyxFQUFFLENBQUMsS0FBSyxFQUFFLEtBQUssQ0FBQyxDQUFDO0lBQ3RCLEdBQUcsRUFBRSxFQUFFLENBQUM7Q0FDVDtBQUVEOzs7Ozs7Ozs7O0dBVUc7QUFDSCxxQkFBYSxlQUFnQixTQUFRLFlBQVksQ0FBQyxxQkFBcUIsQ0FBQztJQUsxRCxPQUFPLENBQUMsUUFBUSxDQUFDLGNBQWM7SUFKM0MsT0FBTyxDQUFDLE1BQU0sQ0FBeUI7SUFDdkMsT0FBTyxDQUFDLFVBQVUsQ0FBMkI7SUFDN0MsT0FBTyxDQUFDLE9BQU8sQ0FBUztJQUV4QixZQUE2QixjQUFjLFNBQW1CLEVBRTdEO0lBRUQsOERBQThEO0lBQzlELEtBQUssQ0FBQyxRQUFRLEVBQUUsTUFBTSxFQUFFLGFBQWEsU0FBWSxHQUFHLElBQUksQ0FFdkQ7SUFFRCw2REFBNkQ7SUFDN0QsZUFBZSxDQUFDLE1BQU0sRUFBRSxRQUFRLEdBQUcsSUFBSSxDQXVCdEM7SUFFRCxzREFBc0Q7SUFDdEQsSUFBSSxJQUFJLElBQUksQ0FNWDtJQUVELHVEQUF1RDtJQUN2RCxPQUFPLENBQUMsV0FBVztDQW1CcEIifQ==

package/dest/fifo/fifo_frame_reader.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"fifo_frame_reader.d.ts","sourceRoot":"","sources":["../../src/fifo/fifo_frame_reader.ts"],"names":[],"mappings":"AAAA,OAAO,YAAY,MAAM,aAAa,CAAC;AAEvC,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAE5C;;;;;;GAMG;AACH,MAAM,WAAW,qBAAqB;IACpC,KAAK,EAAE,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IACzB,KAAK,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACtB,GAAG,EAAE,EAAE,CAAC;CACT;AAED;;;;;;;;;;GAUG;AACH,qBAAa,eAAgB,SAAQ,YAAY,CAAC,qBAAqB,CAAC;IAK1D,OAAO,CAAC,QAAQ,CAAC,cAAc;IAJ3C,OAAO,CAAC,MAAM,CAAyB;IACvC,OAAO,CAAC,UAAU,CAA2B;IAC7C,OAAO,CAAC,OAAO,CAAS;IAExB,YAA6B,cAAc,SAAmB,EAE7D;IAED,8DAA8D;IAC9D,KAAK,CAAC,QAAQ,EAAE,MAAM,EAAE,aAAa,SAAY,GAAG,IAAI,CAEvD;IAED,6DAA6D;IAC7D,eAAe,CAAC,MAAM,EAAE,QAAQ,GAAG,IAAI,CAuBtC;IAED,sDAAsD;IACtD,IAAI,IAAI,IAAI,CAMX;IAED,uDAAuD;IACvD,OAAO,CAAC,WAAW;CAmBpB"}

package/dest/fifo/fifo_frame_reader.js

@@ -1,74 +0,0 @@
-import EventEmitter from 'node:events';
-import * as fs from 'node:fs';
-/**
- * Reads length-delimited frames from a readable stream (typically a named FIFO pipe).
- *
- * Wire format: `[4-byte big-endian payload length][payload bytes]`
- *
- * Emits a `frame` event for each complete frame with the raw payload buffer.
- * Callers are responsible for deserializing the payload (e.g., via msgpack).
- *
- * On encountering an invalid payload length (0 or >maxPayloadSize), emits `error`
- * and destroys the stream.
- */ export class FifoFrameReader extends EventEmitter {
-    maxPayloadSize;
-    stream;
-    pendingBuf;
-    running;
-    constructor(maxPayloadSize = 10 * 1024 * 1024){
-        super(), this.maxPayloadSize = maxPayloadSize, this.stream = null, this.pendingBuf = Buffer.alloc(0), this.running = false;
-    }
-    /** Open a FIFO at the given path and start reading frames. */ start(fifoPath, highWaterMark = 64 * 1024) {
-        this.startFromStream(fs.createReadStream(fifoPath, {
-            highWaterMark
-        }));
-    }
-    /** Start reading frames from an existing readable stream. */ startFromStream(stream) {
-        if (this.running) {
-            throw new Error('FifoFrameReader is already running');
-        }
-        this.running = true;
-        this.pendingBuf = Buffer.alloc(0);
-        this.stream = stream;
-        stream.on('data', (chunk)=>{
-            const buf = Buffer.isBuffer(chunk) ? chunk : Buffer.from(chunk);
-            this.pendingBuf = this.pendingBuf.length > 0 ? Buffer.concat([
-                this.pendingBuf,
-                buf
-            ]) : buf;
-            this.drainFrames();
-        });
-        stream.on('error', (err)=>{
-            if (this.running) {
-                this.emit('error', err);
-            }
-        });
-        stream.on('end', ()=>{
-            this.emit('end');
-        });
-    }
-    /** Stop reading and destroy the underlying stream. */ stop() {
-        this.running = false;
-        if (this.stream) {
-            this.stream.destroy();
-            this.stream = null;
-        }
-    }
-    /** Parse complete frames out of the pending buffer. */ drainFrames() {
-        while(this.pendingBuf.length >= 4){
-            const payloadLen = this.pendingBuf.readUInt32BE(0);
-            if (payloadLen === 0 || payloadLen > this.maxPayloadSize) {
-                this.emit('error', new Error(`Invalid payload length: ${payloadLen}`));
-                this.stop();
-                return;
-            }
-            const frameLen = 4 + payloadLen;
-            if (this.pendingBuf.length < frameLen) {
-                break; // Wait for more data
-            }
-            const payload = this.pendingBuf.subarray(4, frameLen);
-            this.pendingBuf = this.pendingBuf.subarray(frameLen);
-            this.emit('frame', Buffer.from(payload));
-        }
-    }
-}

package/dest/fifo/index.d.ts

@@ -1,2 +0,0 @@
-export { FifoFrameReader } from './fifo_frame_reader.js';
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9maWZvL2luZGV4LnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiJBQUFBLE9BQU8sRUFBRSxlQUFlLEVBQUUsTUFBTSx3QkFBd0IsQ0FBQyJ9

package/dest/fifo/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/fifo/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC"}

package/dest/fifo/index.js

@@ -1 +0,0 @@
-export { FifoFrameReader } from './fifo_frame_reader.js';

package/src/collection/lru_set.ts

@@ -1,115 +0,0 @@
-/** Node in a doubly-linked list used by {@link LruSet}. */
-type LruNode<T> = {
-  value: T;
-  prev: LruNode<T> | undefined;
-  next: LruNode<T> | undefined;
-};
-
-/**
- * A bounded set with Least Recently Used (LRU) eviction.
- * Both {@link has} and {@link add} count as an access and refresh the entry's
- * recency, so items that are actively checked stay in the set longest.
- *
- * Uses a doubly-linked list for O(1) ordering and a Map for O(1) lookup.
- * Head = least recent, tail = most recent.
- */
-export class LruSet<T> {
-  /** Map from value to its linked-list node for O(1) lookup. */
-  private readonly map = new Map<T, LruNode<T>>();
-  private head: LruNode<T> | undefined;
-  private tail: LruNode<T> | undefined;
-
-  constructor(private readonly maxSize: number) {
-    if (maxSize < 1) {
-      throw new Error('LruSet maxSize must be at least 1');
-    }
-  }
-
-  /** Number of entries in the set. */
-  get size(): number {
-    return this.map.size;
-  }
-
-  /**
-   * Returns true if the item is in the set.
-   * Refreshes the item's recency so it becomes the most recently used.
-   */
-  has(item: T): boolean {
-    const node = this.map.get(item);
-    if (!node) {
-      return false;
-    }
-    this.moveToTail(node);
-    return true;
-  }
-
-  /**
-   * Adds an item to the set. If the item already exists, refreshes its recency.
-   * If the set is at capacity, evicts the least recently used item.
-   */
-  add(item: T): void {
-    const existing = this.map.get(item);
-    if (existing) {
-      this.moveToTail(existing);
-      return;
-    }
-
-    if (this.map.size >= this.maxSize) {
-      this.evictHead();
-    }
-
-    const node: LruNode<T> = { value: item, prev: this.tail, next: undefined };
-    if (this.tail) {
-      this.tail.next = node;
-    } else {
-      this.head = node;
-    }
-    this.tail = node;
-    this.map.set(item, node);
-  }
-
-  /** Removes all entries from the set. */
-  clear(): void {
-    this.map.clear();
-    this.head = undefined;
-    this.tail = undefined;
-  }
-
-  /** Unlinks a node from its current position and relinks it at the tail. */
-  private moveToTail(node: LruNode<T>): void {
-    if (node === this.tail) {
-      return;
-    }
-
-    // Unlink
-    if (node.prev) {
-      node.prev.next = node.next;
-    } else {
-      this.head = node.next;
-    }
-    if (node.next) {
-      node.next.prev = node.prev;
-    }
-
-    // Relink at tail
-    node.prev = this.tail;
-    node.next = undefined;
-    if (this.tail) {
-      this.tail.next = node;
-    }
-    this.tail = node;
-  }
-
-  /** Evicts the head (least recently used) node. */
-  private evictHead(): void {
-    const oldHead = this.head!;
-    this.map.delete(oldHead.value);
-
-    this.head = oldHead.next;
-    if (this.head) {
-      this.head.prev = undefined;
-    } else {
-      this.tail = undefined;
-    }
-  }
-}

package/src/fifo/fifo_frame_reader.ts

@@ -1,98 +0,0 @@
-import EventEmitter from 'node:events';
-import * as fs from 'node:fs';
-import type { Readable } from 'node:stream';
-
-/**
- * Events emitted by FifoFrameReader.
- *
- * - `frame`: A complete frame payload (without the 4-byte length header).
- * - `error`: An unrecoverable error (invalid frame length, stream error).
- * - `end`: The underlying stream has ended.
- */
-export interface FifoFrameReaderEvents {
-  frame: [payload: Buffer];
-  error: [error: Error];
-  end: [];
-}
-
-/**
- * Reads length-delimited frames from a readable stream (typically a named FIFO pipe).
- *
- * Wire format: `[4-byte big-endian payload length][payload bytes]`
- *
- * Emits a `frame` event for each complete frame with the raw payload buffer.
- * Callers are responsible for deserializing the payload (e.g., via msgpack).
- *
- * On encountering an invalid payload length (0 or >maxPayloadSize), emits `error`
- * and destroys the stream.
- */
-export class FifoFrameReader extends EventEmitter<FifoFrameReaderEvents> {
-  private stream: Readable | null = null;
-  private pendingBuf: Buffer = Buffer.alloc(0);
-  private running = false;
-
-  constructor(private readonly maxPayloadSize = 10 * 1024 * 1024) {
-    super();
-  }
-
-  /** Open a FIFO at the given path and start reading frames. */
-  start(fifoPath: string, highWaterMark = 64 * 1024): void {
-    this.startFromStream(fs.createReadStream(fifoPath, { highWaterMark }));
-  }
-
-  /** Start reading frames from an existing readable stream. */
-  startFromStream(stream: Readable): void {
-    if (this.running) {
-      throw new Error('FifoFrameReader is already running');
-    }
-    this.running = true;
-    this.pendingBuf = Buffer.alloc(0);
-    this.stream = stream;
-
-    stream.on('data', (chunk: Buffer | string) => {
-      const buf = Buffer.isBuffer(chunk) ? chunk : Buffer.from(chunk);
-      this.pendingBuf = this.pendingBuf.length > 0 ? Buffer.concat([this.pendingBuf, buf]) : buf;
-      this.drainFrames();
-    });
-
-    stream.on('error', (err: Error) => {
-      if (this.running) {
-        this.emit('error', err);
-      }
-    });
-
-    stream.on('end', () => {
-      this.emit('end');
-    });
-  }
-
-  /** Stop reading and destroy the underlying stream. */
-  stop(): void {
-    this.running = false;
-    if (this.stream) {
-      this.stream.destroy();
-      this.stream = null;
-    }
-  }
-
-  /** Parse complete frames out of the pending buffer. */
-  private drainFrames(): void {
-    while (this.pendingBuf.length >= 4) {
-      const payloadLen = this.pendingBuf.readUInt32BE(0);
-      if (payloadLen === 0 || payloadLen > this.maxPayloadSize) {
-        this.emit('error', new Error(`Invalid payload length: ${payloadLen}`));
-        this.stop();
-        return;
-      }
-
-      const frameLen = 4 + payloadLen;
-      if (this.pendingBuf.length < frameLen) {
-        break; // Wait for more data
-      }
-
-      const payload = this.pendingBuf.subarray(4, frameLen);
-      this.pendingBuf = this.pendingBuf.subarray(frameLen);
-      this.emit('frame', Buffer.from(payload));
-    }
-  }
-}

package/src/fifo/index.ts

@@ -1 +0,0 @@
-export { FifoFrameReader } from './fifo_frame_reader.js';