@rocicorp/zero 1.6.0-canary.11 → 1.6.0-canary.13

package/out/shared/src/ring-buffer.js

@@ -1,109 +0,0 @@
-//#region ../shared/src/ring-buffer.ts
-var DEFAULT_INITIAL_CAPACITY = 16;
-var MIN_CAPACITY = 16;
-/**
-* A FIFO ring buffer backed by a circular array. Provides:
-*
-* - `push()` — O(1) amortized (O(n) on resize)
-* - `shift()` — O(1)
-* - `size`    — O(1)
-* - `drain()` — O(n)
-*
-* The buffer grows (doubles) when full and shrinks (halves) when
-* utilization drops below 25%, bounded by {@link MIN_CAPACITY}.
-*/
-var RingBuffer = class {
-	#buffer;
-	#head = 0;
-	#size = 0;
-	#capacity;
-	constructor(initialCapacity = DEFAULT_INITIAL_CAPACITY) {
-		this.#capacity = Math.max(MIN_CAPACITY, initialCapacity);
-		this.#buffer = Array.from({ length: initialCapacity });
-	}
-	get size() {
-		return this.#size;
-	}
-	push(value) {
-		if (this.#size === this.#capacity) this.#grow();
-		this.#buffer[(this.#head + this.#size) % this.#capacity] = value;
-		this.#size++;
-	}
-	/** Removes and returns the front element, or `undefined` if empty. */
-	shift() {
-		if (this.#size === 0) return;
-		const value = this.#buffer[this.#head];
-		this.#buffer[this.#head] = void 0;
-		this.#head = (this.#head + 1) % this.#capacity;
-		this.#size--;
-		if (this.#size > 0 && this.#size < this.#capacity >> 2 && this.#capacity > MIN_CAPACITY) this.#shrink();
-		return value;
-	}
-	/**
-	* Removes all elements matching `value` (by identity `===`).
-	*
-	* This is O(n) — suitable for rare operations like cancellation.
-	*
-	* @returns The number of elements removed.
-	*/
-	delete(value) {
-		if (this.#size === 0) return 0;
-		const newBuffer = Array.from({ length: this.#capacity });
-		let newSize = 0;
-		let count = 0;
-		for (let i = 0; i < this.#size; i++) {
-			const item = this.#buffer[(this.#head + i) % this.#capacity];
-			if (item === value) count++;
-			else newBuffer[newSize++] = item;
-		}
-		this.#buffer = newBuffer;
-		this.#head = 0;
-		this.#size = newSize;
-		return count;
-	}
-	/**
-	* Removes and returns all elements in FIFO order, resetting the buffer.
-	*/
-	drain() {
-		const result = Array.from({ length: this.#size });
-		for (let i = 0; i < this.#size; i++) result[i] = this.#buffer[(this.#head + i) % this.#capacity];
-		this.#head = 0;
-		this.#size = 0;
-		this.#buffer = Array.from({ length: this.#capacity });
-		return result;
-	}
-	/**
-	* Grows the buffer in place by doubling its length and relocating
-	* only the wrapped-around elements (those before #head) into the
-	* newly available space. No new array is allocated.
-	*/
-	#grow() {
-		const oldLen = this.#buffer.length;
-		const newLen = oldLen * 2;
-		this.#buffer.length = newLen;
-		this.#capacity = newLen;
-		for (let i = 0; i < this.#head; i++) {
-			this.#buffer[oldLen + i] = this.#buffer[i];
-			this.#buffer[i] = void 0;
-		}
-	}
-	/**
-	* Shrinks the buffer in place by halving its length. Elements whose
-	* indices fall in the removed half are relocated into the lower half,
-	* then the array is truncated.
-	*/
-	#shrink() {
-		const oldLen = this.#buffer.length;
-		const newLen = Math.max(MIN_CAPACITY, oldLen >> 1);
-		const left = Math.max(newLen, this.#head);
-		const right = Math.min(this.#head + this.#size, oldLen);
-		for (let i = left; i < right; i++) this.#buffer[i - newLen] = this.#buffer[i];
-		if (this.#head >= newLen) this.#head -= newLen;
-		this.#buffer.length = newLen;
-		this.#capacity = newLen;
-	}
-};
-//#endregion
-export { RingBuffer };
-
-//# sourceMappingURL=ring-buffer.js.map

package/out/shared/src/ring-buffer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ring-buffer.js","names":["#capacity","#buffer","#size","#grow","#head","#shrink"],"sources":["../../../../shared/src/ring-buffer.ts"],"sourcesContent":["const DEFAULT_INITIAL_CAPACITY = 16;\nconst MIN_CAPACITY = 16;\n\n/**\n * A FIFO ring buffer backed by a circular array. Provides:\n *\n * - `push()` — O(1) amortized (O(n) on resize)\n * - `shift()` — O(1)\n * - `size`    — O(1)\n * - `drain()` — O(n)\n *\n * The buffer grows (doubles) when full and shrinks (halves) when\n * utilization drops below 25%, bounded by {@link MIN_CAPACITY}.\n */\nexport class RingBuffer<T> {\n  #buffer: (T | undefined)[];\n  #head = 0;\n  #size = 0;\n  #capacity: number;\n\n  constructor(initialCapacity = DEFAULT_INITIAL_CAPACITY) {\n    this.#capacity = Math.max(MIN_CAPACITY, initialCapacity);\n    this.#buffer = Array.from({length: initialCapacity});\n  }\n\n  get size(): number {\n    return this.#size;\n  }\n\n  push(value: T): void {\n    if (this.#size === this.#capacity) {\n      this.#grow();\n    }\n    this.#buffer[(this.#head + this.#size) % this.#capacity] = value;\n    this.#size++;\n  }\n\n  /** Removes and returns the front element, or `undefined` if empty. */\n  shift(): T | undefined {\n    if (this.#size === 0) {\n      return undefined;\n    }\n    const value = this.#buffer[this.#head];\n    this.#buffer[this.#head] = undefined; // allow GC of removed element\n    this.#head = (this.#head + 1) % this.#capacity;\n    this.#size--;\n\n    // Shrink when utilization drops below 25%, keeping a minimum capacity.\n    if (\n      this.#size > 0 &&\n      this.#size < this.#capacity >> 2 &&\n      this.#capacity > MIN_CAPACITY\n    ) {\n      this.#shrink();\n    }\n\n    return value;\n  }\n\n  /**\n   * Removes all elements matching `value` (by identity `===`).\n   *\n   * This is O(n) — suitable for rare operations like cancellation.\n   *\n   * @returns The number of elements removed.\n   */\n  delete(value: T): number {\n    if (this.#size === 0) {\n      return 0;\n    }\n    // Rebuild the buffer without matching elements.\n    const newBuffer: (T | undefined)[] = Array.from({length: this.#capacity});\n    let newSize = 0;\n    let count = 0;\n    for (let i = 0; i < this.#size; i++) {\n      const item = this.#buffer[(this.#head + i) % this.#capacity];\n      if (item === value) {\n        count++;\n      } else {\n        newBuffer[newSize++] = item;\n      }\n    }\n    this.#buffer = newBuffer;\n    this.#head = 0;\n    this.#size = newSize;\n    return count;\n  }\n\n  /**\n   * Removes and returns all elements in FIFO order, resetting the buffer.\n   */\n  drain(): T[] {\n    const result = Array.from<T>({length: this.#size});\n    for (let i = 0; i < this.#size; i++) {\n      result[i] = this.#buffer[(this.#head + i) % this.#capacity] as T;\n    }\n    this.#head = 0;\n    this.#size = 0;\n    this.#buffer = Array.from({length: this.#capacity});\n    return result;\n  }\n\n  /**\n   * Grows the buffer in place by doubling its length and relocating\n   * only the wrapped-around elements (those before #head) into the\n   * newly available space. No new array is allocated.\n   */\n  #grow(): void {\n    const oldLen = this.#buffer.length;\n    const newLen = oldLen * 2;\n    this.#buffer.length = newLen;\n    this.#capacity = newLen;\n\n    // Copy wrapped-around elements (indices 0..head-1) into the new space.\n    for (let i = 0; i < this.#head; i++) {\n      this.#buffer[oldLen + i] = this.#buffer[i];\n      this.#buffer[i] = undefined; // ensure gc when the element is removed\n    }\n  }\n\n  /**\n   * Shrinks the buffer in place by halving its length. Elements whose\n   * indices fall in the removed half are relocated into the lower half,\n   * then the array is truncated.\n   */\n  #shrink(): void {\n    const oldLen = this.#buffer.length;\n    const newLen = Math.max(MIN_CAPACITY, oldLen >> 1);\n\n    // Move elements that sit in the upper half down by newLen.\n    const left = Math.max(newLen, this.#head);\n    const right = Math.min(this.#head + this.#size, oldLen);\n    for (let i = left; i < right; i++) {\n      this.#buffer[i - newLen] = this.#buffer[i];\n    }\n\n    if (this.#head >= newLen) {\n      this.#head -= newLen;\n    }\n    this.#buffer.length = newLen;\n    this.#capacity = newLen;\n  }\n}\n"],"mappings":";AAAA,IAAM,2BAA2B;AACjC,IAAM,eAAe;;;;;;;;;;;;AAarB,IAAa,aAAb,MAA2B;CACzB;CACA,QAAQ;CACR,QAAQ;CACR;CAEA,YAAY,kBAAkB,0BAA0B;EACtD,KAAKA,YAAY,KAAK,IAAI,cAAc,eAAe;EACvD,KAAKC,UAAU,MAAM,KAAK,EAAC,QAAQ,gBAAe,CAAC;CACrD;CAEA,IAAI,OAAe;EACjB,OAAO,KAAKC;CACd;CAEA,KAAK,OAAgB;EACnB,IAAI,KAAKA,UAAU,KAAKF,WACtB,KAAKG,MAAM;EAEb,KAAKF,SAAS,KAAKG,QAAQ,KAAKF,SAAS,KAAKF,aAAa;EAC3D,KAAKE;CACP;;CAGA,QAAuB;EACrB,IAAI,KAAKA,UAAU,GACjB;EAEF,MAAM,QAAQ,KAAKD,QAAQ,KAAKG;EAChC,KAAKH,QAAQ,KAAKG,SAAS,KAAA;EAC3B,KAAKA,SAAS,KAAKA,QAAQ,KAAK,KAAKJ;EACrC,KAAKE;EAGL,IACE,KAAKA,QAAQ,KACb,KAAKA,QAAQ,KAAKF,aAAa,KAC/B,KAAKA,YAAY,cAEjB,KAAKK,QAAQ;EAGf,OAAO;CACT;;;;;;;;CASA,OAAO,OAAkB;EACvB,IAAI,KAAKH,UAAU,GACjB,OAAO;EAGT,MAAM,YAA+B,MAAM,KAAK,EAAC,QAAQ,KAAKF,UAAS,CAAC;EACxE,IAAI,UAAU;EACd,IAAI,QAAQ;EACZ,KAAK,IAAI,IAAI,GAAG,IAAI,KAAKE,OAAO,KAAK;GACnC,MAAM,OAAO,KAAKD,SAAS,KAAKG,QAAQ,KAAK,KAAKJ;GAClD,IAAI,SAAS,OACX;QAEA,UAAU,aAAa;EAE3B;EACA,KAAKC,UAAU;EACf,KAAKG,QAAQ;EACb,KAAKF,QAAQ;EACb,OAAO;CACT;;;;CAKA,QAAa;EACX,MAAM,SAAS,MAAM,KAAQ,EAAC,QAAQ,KAAKA,MAAK,CAAC;EACjD,KAAK,IAAI,IAAI,GAAG,IAAI,KAAKA,OAAO,KAC9B,OAAO,KAAK,KAAKD,SAAS,KAAKG,QAAQ,KAAK,KAAKJ;EAEnD,KAAKI,QAAQ;EACb,KAAKF,QAAQ;EACb,KAAKD,UAAU,MAAM,KAAK,EAAC,QAAQ,KAAKD,UAAS,CAAC;EAClD,OAAO;CACT;;;;;;CAOA,QAAc;EACZ,MAAM,SAAS,KAAKC,QAAQ;EAC5B,MAAM,SAAS,SAAS;EACxB,KAAKA,QAAQ,SAAS;EACtB,KAAKD,YAAY;EAGjB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAKI,OAAO,KAAK;GACnC,KAAKH,QAAQ,SAAS,KAAK,KAAKA,QAAQ;GACxC,KAAKA,QAAQ,KAAK,KAAA;EACpB;CACF;;;;;;CAOA,UAAgB;EACd,MAAM,SAAS,KAAKA,QAAQ;EAC5B,MAAM,SAAS,KAAK,IAAI,cAAc,UAAU,CAAC;EAGjD,MAAM,OAAO,KAAK,IAAI,QAAQ,KAAKG,KAAK;EACxC,MAAM,QAAQ,KAAK,IAAI,KAAKA,QAAQ,KAAKF,OAAO,MAAM;EACtD,KAAK,IAAI,IAAI,MAAM,IAAI,OAAO,KAC5B,KAAKD,QAAQ,IAAI,UAAU,KAAKA,QAAQ;EAG1C,IAAI,KAAKG,SAAS,QAChB,KAAKA,SAAS;EAEhB,KAAKH,QAAQ,SAAS;EACtB,KAAKD,YAAY;CACnB;AACF"}