distillate 0.2.0 → 0.3.0

package/dist/blocked/index.cjs

@@ -77,6 +77,26 @@ var BlockedBloomFilter = class BlockedBloomFilter {
 	get bitsPerKey() {
 		return this.#numBlocks * 256 / this.#n;
 	}
+	/** Number of bits currently set across all lanes. */
+	get length() {
+		let bits = 0;
+		for (let w of this.#lanes) while (w) {
+			w &= w - 1;
+			bits++;
+		}
+		return bits;
+	}
+	/**
+	* Estimates the current false-positive rate from the actual fill,
+	* `(length / totalBits) ** 8`. A split-block query checks exactly 8 lane-bits,
+	* so the exponent is 8 rather than a classic probe count `k`. This reflects
+	* how full the filter is right now, not the design target.
+	*
+	* @returns The estimated false-positive rate, `0` for an empty filter.
+	*/
+	rate() {
+		return (this.length / (this.#numBlocks * 256)) ** 8;
+	}
 	/**
 	* Restores a filter from its {@link BlockedBloomFilter.toBytes} serialization.
 	*

package/dist/blocked/index.d.cts

@@ -43,6 +43,17 @@ declare class BlockedBloomFilter {
   constructor({ bitsPerKey, capacity, seed }: BlockedBloomParams);
   /** Actual bits allocated per key (`total bits / capacity`). */
   get bitsPerKey(): number;
+  /** Number of bits currently set across all lanes. */
+  get length(): number;
+  /**
+   * Estimates the current false-positive rate from the actual fill,
+   * `(length / totalBits) ** 8`. A split-block query checks exactly 8 lane-bits,
+   * so the exponent is 8 rather than a classic probe count `k`. This reflects
+   * how full the filter is right now, not the design target.
+   *
+   * @returns The estimated false-positive rate, `0` for an empty filter.
+   */
+  rate(): number;
   /**
    * Restores a filter from its {@link BlockedBloomFilter.toBytes} serialization.
    *

package/dist/blocked/index.d.ts

@@ -43,6 +43,17 @@ declare class BlockedBloomFilter {
   constructor({ bitsPerKey, capacity, seed }: BlockedBloomParams);
   /** Actual bits allocated per key (`total bits / capacity`). */
   get bitsPerKey(): number;
+  /** Number of bits currently set across all lanes. */
+  get length(): number;
+  /**
+   * Estimates the current false-positive rate from the actual fill,
+   * `(length / totalBits) ** 8`. A split-block query checks exactly 8 lane-bits,
+   * so the exponent is 8 rather than a classic probe count `k`. This reflects
+   * how full the filter is right now, not the design target.
+   *
+   * @returns The estimated false-positive rate, `0` for an empty filter.
+   */
+  rate(): number;
   /**
    * Restores a filter from its {@link BlockedBloomFilter.toBytes} serialization.
    *

package/dist/blocked/index.js

@@ -76,6 +76,26 @@ var BlockedBloomFilter = class BlockedBloomFilter {
 	get bitsPerKey() {
 		return this.#numBlocks * 256 / this.#n;
 	}
+	/** Number of bits currently set across all lanes. */
+	get length() {
+		let bits = 0;
+		for (let w of this.#lanes) while (w) {
+			w &= w - 1;
+			bits++;
+		}
+		return bits;
+	}
+	/**
+	* Estimates the current false-positive rate from the actual fill,
+	* `(length / totalBits) ** 8`. A split-block query checks exactly 8 lane-bits,
+	* so the exponent is 8 rather than a classic probe count `k`. This reflects
+	* how full the filter is right now, not the design target.
+	*
+	* @returns The estimated false-positive rate, `0` for an empty filter.
+	*/
+	rate() {
+		return (this.length / (this.#numBlocks * 256)) ** 8;
+	}
 	/**
 	* Restores a filter from its {@link BlockedBloomFilter.toBytes} serialization.
 	*

package/dist/bloom/index.cjs

@@ -122,11 +122,37 @@ var BloomFilter = class BloomFilter {
 		this.#scratch = new Uint32Array(k);
 		this.#n = Math.round(m * Math.LN2 / k);
 	}
+	/** Number of bits in the filter. */
+	get m() {
+		return this.#m;
+	}
+	/** Number of hash probes per key. */
+	get k() {
+		return this.#k;
+	}
+	/** Hash seed. */
+	get seed() {
+		return this.#seed;
+	}
+	/** Number of bits currently set. */
+	get length() {
+		return this.#bits.count();
+	}
 	/** Analytic design bits-per-key `m / n`. */
 	get bitsPerKey() {
 		return this.#m / this.#n;
 	}
 	/**
+	* Estimates the current false-positive rate from the actual fill,
+	* `(length / m) ** k`. This reflects how full the filter is right now, not
+	* the design target; it rises as keys are added.
+	*
+	* @returns The estimated false-positive rate, `0` for an empty filter.
+	*/
+	rate() {
+		return (this.length / this.#m) ** this.#k;
+	}
+	/**
 	* Serializes the filter to a portable little-endian byte layout.
 	*
 	* @returns The serialized filter, readable by {@link BloomFilter.fromBytes}.

package/dist/bloom/index.d.cts

@@ -49,8 +49,24 @@ declare class BloomFilter {
    * {@link BloomFilter.create} unless restoring a specific configuration.
    */
   constructor({ m, k, seed }: BloomParams);
+  /** Number of bits in the filter. */
+  get m(): number;
+  /** Number of hash probes per key. */
+  get k(): number;
+  /** Hash seed. */
+  get seed(): number;
+  /** Number of bits currently set. */
+  get length(): number;
   /** Analytic design bits-per-key `m / n`. */
   get bitsPerKey(): number;
+  /**
+   * Estimates the current false-positive rate from the actual fill,
+   * `(length / m) ** k`. This reflects how full the filter is right now, not
+   * the design target; it rises as keys are added.
+   *
+   * @returns The estimated false-positive rate, `0` for an empty filter.
+   */
+  rate(): number;
   /**
    * Serializes the filter to a portable little-endian byte layout.
    *

package/dist/bloom/index.d.ts

@@ -49,8 +49,24 @@ declare class BloomFilter {
    * {@link BloomFilter.create} unless restoring a specific configuration.
    */
   constructor({ m, k, seed }: BloomParams);
+  /** Number of bits in the filter. */
+  get m(): number;
+  /** Number of hash probes per key. */
+  get k(): number;
+  /** Hash seed. */
+  get seed(): number;
+  /** Number of bits currently set. */
+  get length(): number;
   /** Analytic design bits-per-key `m / n`. */
   get bitsPerKey(): number;
+  /**
+   * Estimates the current false-positive rate from the actual fill,
+   * `(length / m) ** k`. This reflects how full the filter is right now, not
+   * the design target; it rises as keys are added.
+   *
+   * @returns The estimated false-positive rate, `0` for an empty filter.
+   */
+  rate(): number;
   /**
    * Serializes the filter to a portable little-endian byte layout.
    *

package/dist/bloom/index.js

@@ -121,11 +121,37 @@ var BloomFilter = class BloomFilter {
 		this.#scratch = new Uint32Array(k);
 		this.#n = Math.round(m * Math.LN2 / k);
 	}
+	/** Number of bits in the filter. */
+	get m() {
+		return this.#m;
+	}
+	/** Number of hash probes per key. */
+	get k() {
+		return this.#k;
+	}
+	/** Hash seed. */
+	get seed() {
+		return this.#seed;
+	}
+	/** Number of bits currently set. */
+	get length() {
+		return this.#bits.count();
+	}
 	/** Analytic design bits-per-key `m / n`. */
 	get bitsPerKey() {
 		return this.#m / this.#n;
 	}
 	/**
+	* Estimates the current false-positive rate from the actual fill,
+	* `(length / m) ** k`. This reflects how full the filter is right now, not
+	* the design target; it rises as keys are added.
+	*
+	* @returns The estimated false-positive rate, `0` for an empty filter.
+	*/
+	rate() {
+		return (this.length / this.#m) ** this.#k;
+	}
+	/**
 	* Serializes the filter to a portable little-endian byte layout.
 	*
 	* @returns The serialized filter, readable by {@link BloomFilter.fromBytes}.

package/dist/index.cjs

@@ -2,6 +2,6 @@ Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 //#endregion
 //#region src/index.ts
 /** The installed `distillate` package version. */
-const VERSION = "0.2.0";
+const VERSION = "0.3.0";
 //#endregion
 exports.VERSION = VERSION;

package/dist/index.js

@@ -1,6 +1,6 @@
 //#endregion
 //#region src/index.ts
 /** The installed `distillate` package version. */
-const VERSION = "0.2.0";
+const VERSION = "0.3.0";
 //#endregion
 export { VERSION };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "distillate",
-  "version": "0.2.0",
+  "version": "0.3.0",
   "description": "Probabilistic data structures for JavaScript. Space-efficient, approximate-membership filters (Bloom, Blocked Bloom, Binary Fuse) with tunable error and a portable binary format; zero dependencies, universal.",
   "keywords": [
     "bloom-filter",