fast-boolean-array 1.4.3 → 1.4.4

package/.github/dependabot.yml

@@ -0,0 +1,11 @@
+# To get started with Dependabot version updates, you'll need to specify which
+# package ecosystems to update and where the package manifests are located.
+# Please see the documentation for all configuration options:
+# https://docs.github.com/code-security/dependabot/dependabot-version-updates/configuration-options-for-the-dependabot.yml-file
+
+version: 2
+updates:
+  - package-ecosystem: "npm" # See documentation for possible values
+    directory: "/" # Location of package manifests
+    schedule:
+      interval: "weekly"

package/README.md

@@ -2,16 +2,23 @@
 
 In JavaScript, when working with large arrays of boolean values, a common challenge is efficiently indexing and retrieving these values. Using a regular JavaScript array to store booleans is straightforward, but it is memory-inefficient. While booleans are conceptually 1-bit values, JavaScript engines, like V8 (in Chrome and Node.js), allocate 1 byte (8 bits) per boolean for optimization purposes. This can waste a significant amount of memory when dealing with large arrays.
 
-Fast Boolean Array solves this issue by utilizing bit manipulation to store booleans in a compact format. It uses a Uint8Array and stores each boolean as a single bit within the 8 bits of each byte. This allows you to index and retrieve boolean values by integers (e.g., the 0th boolean, 1st boolean, etc.) while only using a fraction of the memory. Each bit represents a boolean, and you can quickly access or modify a specific boolean using bitwise operations, making it both fast and memory-efficient.
+Fast Boolean Array solves this issue by utilizing bit manipulation to store booleans in a compact format. It uses a Uint8Array and stores each boolean as a single bit within the 8 bits of each byte. This allows you to index and retrieve boolean values by integers (e.g., the 0th boolean, 1st boolean, etc.) while only using a fraction of the memory.
 
 For detailed benchmark results, see below.
 
 ## Features
 
+
 - **Memory Efficiency**: Stores booleans in bits rather than bytes, drastically reducing memory usage.
-- **Simple API**: Intuitive methods for setting and getting values.
-- **Performance**: Optimized for use in scenarios where memory constraints are critical.
+- **Fast Set Performance**: Up to 10x faster sets for fast data re-mapping.
+- **Familiar API**:  `Map` and `Set` like API for minimal learning curve. Intuitive helper functions, and works in `for.. of`.
+- **Array like interface**: call `.accessLikeArray()` to access it like an array`someArray[index]` (beware of the performance penalty caused by the Proxy)! 
+---
+
+## Why Use Fast Boolean Array?
 
+- **Easy to Use**: Familiar `Map` and `Set` like API for minimal learning curve.
+- **Scalable**: Suitable for high-performance, memory-sensitive projects.
 ---
 
 ## Installation
@@ -19,7 +26,8 @@ For detailed benchmark results, see below.
 Install the package via npm:
 
 ```bash
-npm install fast-boolean-array
+npm install fast-boolean-array --save-dev
+pnpm install fast-boolean-array --save-dev
 ```
 
 ---
@@ -30,7 +38,7 @@ Here's how to use the Fast Boolean Array:
 
 ```javascript
 import BooleanArray from 'fast-boolean-array';
-// const BooleanArray = require('fast-boolean-array'); works too
+// const BooleanArray = require('fast-boolean-array'); commonjs works too.
 
 // Create a new BooleanArray with the desired size
 const booleans = new BooleanArray(2);
@@ -81,14 +89,6 @@ Gets the boolean value at the specified index.
 
 ---
 
-## Why Use Fast Boolean Array?
-
-- **Efficient Memory Usage**: Ideal for applications handling large boolean arrays, such as data compression or state tracking.
-- **Easy to Use**: Familiar `Map` and `Set` like API for minimal learning curve.
-- **Scalable**: Suitable for high-performance, memory-sensitive projects.
-
----
-
 # Performance Breakdown
 
 Our benchmark compares the performance of our Fast Boolean Array library against Vanilla JavaScript arrays in terms of get and set operations across varying numbers of Booleans. The results below reflect an updated benchmark algorithm that performs 1,000 runs for each x amount of Booleans to better simulate real-world scenarios.
@@ -104,7 +104,7 @@ Our benchmark compares the performance of our Fast Boolean Array library against
 | Get Vanilla Array      | 0.00053000 | N/A            | 1        |
 | Get Fast Boolean Array | 0.00291000 | N/A            | 1        |
 
-**Observation:** As useless as having just 1 boolean stored in an array might be, For **1 boolean**, the **Fast Boolean Array** is **1.8x slower** for **Set** and **5.5x slower** for **Get** operations. Memory usage is nearly identical, with a small advantage for the **Fast Boolean Array** in terms of bytes.
+As useless as having just 1 boolean stored in an array might be, For **1 boolean**, the **Fast Boolean Array** is **1.8x slower** for **Set** and **5.5x slower** for **Get** operations. Memory usage is nearly identical, with a small advantage for the **Fast Boolean Array** in terms of bytes.
 
 ---
 
@@ -130,7 +130,7 @@ Our benchmark compares the performance of our Fast Boolean Array library against
 | Get Vanilla Array      | 0.01261000 | N/A            | 1000     |
 | Get Fast Boolean Array | 0.05476000 | N/A            | 1000     |
 
-**Observation:** For **1,000 booleans**, **Fast Boolean Array** is **2.1x faster** for **Set** operations and uses **7.7x less memory**. However, **Fast Boolean Array**'s' **Get** operation is **4.3x slower** . compared to the **Vanilla Array**.
+For **1,000 booleans**, **Fast Boolean Array** is **2.1x faster** for **Set** operations and uses **7.7x less memory**. However, **Fast Boolean Array**'s' **Get** operation is **4.3x slower** . compared to the **Vanilla Array**.
 
 ---
 
@@ -156,7 +156,7 @@ Our benchmark compares the performance of our Fast Boolean Array library against
 | Get Vanilla Array      | 0.04920000 | N/A            | 100000   |
 | Get Fast Boolean Array | 0.07523000 | N/A            | 100000   |
 
-**Observation:** For **100,000 booleans**, **Fast Boolean Array** is **10.9x faster** in **Set** operations and uses **8x less memory**. However, **Fast Boolean Array**'s' **Get** operation is **1.5x slower** .
+For **100,000 booleans**, **Fast Boolean Array** is **10.9x faster** in **Set** operations and uses **8x less memory**. However, **Fast Boolean Array**'s' **Get** operation is **1.5x slower** .
 
 ---
 
@@ -169,7 +169,7 @@ Our benchmark compares the performance of our Fast Boolean Array library against
 | Get Vanilla Array      | 0.49531000  | N/A            | 1000000  |
 | Get Fast Boolean Array | 0.74617000  | N/A            | 1000000  |
 
-**Observation:** For **1,000,000 booleans**, the **Fast Boolean Array** is **5.9x faster** for **Set** operations and uses **8x less memory**. However, **Fast Boolean Array**'s' **Get** operation is **1.5x slower** .
+For **1,000,000 booleans**, the **Fast Boolean Array** is **5.9x faster** for **Set** operations and uses **8x less memory**. However, **Fast Boolean Array**'s' **Get** operation is **1.5x slower** .
 
 ---
 
@@ -182,22 +182,19 @@ Our benchmark compares the performance of our Fast Boolean Array library against
 | Get Vanilla Array      | 4.90792000   | N/A            | 10000000 |
 | Get Fast Boolean Array | 7.57038000   | N/A            | 10000000 |
 
-**Observation:** For **10,000,000 booleans**, **Fast Boolean Array** is **7.5x faster** for **Set** operations and uses **8x less memory**. However, **Fast Boolean Array**'s' **Get** operation is **1.5x slower** .
+For **10,000,000 booleans**, **Fast Boolean Array** is **7.5x faster** for **Set** operations and uses **8x less memory**. However, **Fast Boolean Array**'s' **Get** operation is **1.5x slower** .
 
 ---
 
 ### Summary
 
 - The **Fast Boolean Array** is significantly more efficient in terms of memory usage and **Set** operation speeds, particularly as the number of booleans increases.
-  - For example, at **10,000,000 booleans**, it is **7.5x faster** in **Set** operations and uses **8x less memory**.
-- The **Get** operation, however, tends to be slower for the **Fast Boolean Array**, with it being up to **1.5x slower** compared to the **Vanilla Array** in larger datasets.
-- If memory efficiency and **Set** performance are priorities, the **Fast Boolean Array** is clearly advantageous, but if **Get** performance is more important, the **Vanilla Array** may still offer better results for certain use cases.
-
----
+  - For example, as stated previously, at **10,000,000 booleans**, it is **7.5x faster** in **Set** operations and uses **8x less memory**.
+- The **Get** operation, however, tends to be slower on a **Fast Boolean Array**, with it being up to **1.5x slower** compared to the regular vanilla **boolean[]** in larger datasets.
 
-# Why not use BigInt or larger array?
+If memory efficiency and **Set** performance are priorities, the **Fast Boolean Array** is clearly advantageous, but if **Get** performance is more important, the **Vanilla Array** may still offer better results for certain use cases.
 
-Backwards compatibility with older version of NodeJS and browsers.
+We are still working on improving the performance of the toArray function, but you can already use it today to convert back to a vanilla array, though generating one from scratch is currently more effecient.
 
 ---
 

package/SECURITY.md

@@ -0,0 +1,5 @@
+# Security Policy
+
+## Reporting a Vulnerability
+
+If you discover a vulnerability, please contact a maintainer directly. Avoid creating an issue or starting a discussion. If you're able to identify the vulnerability, you may also be able to submit a pull request. We encourage you to do so. We will merge your fix and publish it as soon as possible to all package registries.

package/dist/index.cjs

@@ -1,2 +1,2 @@
-var a=Object.defineProperty;var o=Object.getOwnPropertyDescriptor;var u=Object.getOwnPropertyNames;var f=Object.prototype.hasOwnProperty;var l=(n,e)=>{for(var r in e)a(n,r,{get:e[r],enumerable:!0})},h=(n,e,r,t)=>{if(e&&typeof e=="object"||typeof e=="function")for(let s of u(e))!f.call(n,s)&&s!==r&&a(n,s,{get:()=>e[s],enumerable:!(t=o(e,s))||t.enumerable});return n};var b=n=>h(a({},"__esModule",{value:!0}),n);var y={};l(y,{default:()=>i});module.exports=b(y);var i=class n{size;buffer;constructor(e){if(!e)throw new Error("FastBooleanArray must have a size greater than 0");this.size=e,this.buffer=new Uint8Array(Math.ceil(e/8))}set(e,r){return r?(this.buffer[e>>3]|=1<<(e&7),!0):(this.buffer[e>>3]&=~(1<<(e&7)),!1)}setSafe(e,r){if(e<0||e>=this.size)throw new RangeError("Index out of bounds");return this.set(e,r)}setAll(e){this.buffer.fill(e?255:0)}get(e){let r=e>>>3,t=e&7;return(this.buffer[r]&1<<t)!==0}getSafe(e){if(e<0||e>=this.size)throw new RangeError("Index out of bounds");return this.get(e)}resize(e){let r=new Uint8Array(Math.ceil(e/8));r.set(this.buffer.subarray(0,Math.min(this.buffer.length,r.length))),this.buffer=r,this.size=e}get length(){return this.size}equals(e){return this.size!==e.size?!1:this.buffer.every((r,t)=>r===e.buffer[t])}*[Symbol.iterator](){for(let e=0;e<this.size;e++)yield this.get(e)}toArray(){let e=new Array(this.size);for(let r=0;r<this.size;r++)e[r]=this.get(r);return e}accessLikeArray(){return new Proxy(this,{get:(e,r)=>{if(typeof r=="string"&&!isNaN(Number(r))){let t=Number(r);return e.get(t)}return e[r]},set:(e,r,t)=>{if(typeof r=="string"&&!isNaN(Number(r))){let s=Number(r);return e.set(s,t)}return e[r]=t}})}forEach(e){for(let r=0;r<this.size;r++)e(this.get(r),r,this)}map(e){let r=new Array(this.size);for(let t=0;t<this.size;t++)r[t]=e(this.get(t),t,this);return r}filter(e){let r=[];for(let t=0;t<this.size;t++){let s=this.get(t);e(s,t,this)&&r.push(s)}return r}some(e){for(let r=0;r<this.size;r++)if(e(this.get(r),r,this))return!0;return!1}every(e){for(let r=0;r<this.size;r++)if(!e(this.get(r),r,this))return!1;return!0}reduce(e,r){let t=r;for(let s=0;s<this.size;s++)t=e(t,this.get(s),s,this);return t}toString(){let e="";for(let r=0;r<this.size;r++)e+=this.get(r)?"1":"0";return e}static fromString(e){let r=new n(e.length);for(let t=0;t<e.length;t++)r.set(t,e[t]=="1");return r}static fromArray(e){let r=new n(e.length);for(let t=0;t<e.length;t++)r.set(t,!!e[t]);return r}static from(e){return typeof e=="string"?n.fromString(e):n.fromArray(e)}};
+var a=Object.defineProperty;var u=Object.getOwnPropertyDescriptor;var l=Object.getOwnPropertyNames;var f=Object.prototype.hasOwnProperty;var h=(n,e)=>{for(var r in e)a(n,r,{get:e[r],enumerable:!0})},b=(n,e,r,t)=>{if(e&&typeof e=="object"||typeof e=="function")for(let s of l(e))!f.call(n,s)&&s!==r&&a(n,s,{get:()=>e[s],enumerable:!(t=u(e,s))||t.enumerable});return n};var y=n=>b(a({},"__esModule",{value:!0}),n);var g={};h(g,{default:()=>i});module.exports=y(g);var o="Index out of bounds",i=class n{size;buffer;constructor(e){if(!e)throw new Error("FastBooleanArray must have a size greater than 0");this.size=e,this.buffer=new Uint8Array(Math.ceil(e/8))}set(e,r){return r?(this.buffer[e>>3]|=1<<(e&7),!0):(this.buffer[e>>3]&=~(1<<(e&7)),!1)}setSafe(e,r){if(e<0||e>=this.size)throw new RangeError(o);return this.set(e,r)}setAll(e){this.buffer.fill(e?255:0)}get(e){let r=e>>>3,t=e&7;return(this.buffer[r]&1<<t)!==0}getSafe(e){if(e<0||e>=this.size)throw new RangeError(o);return this.get(e)}resize(e){let r=new Uint8Array(Math.ceil(e/8));r.set(this.buffer.subarray(0,Math.min(this.buffer.length,r.length))),this.size=e,this.buffer=r}get length(){return this.size}equals(e){return this.size!==e.size?!1:this.buffer.every((r,t)=>r===e.buffer[t])}*[Symbol.iterator](){for(let e=0;e<this.size;e++)yield this.get(e)}toArray(){let e=new Array(this.size);for(let r=0;r<this.size;r++)e[r]=this.get(r);return e}accessLikeArray(){return new Proxy(this,{get:(e,r)=>{if(typeof r=="string"&&!isNaN(Number(r))){let t=Number(r);return e.get(t)}return e[r]},set:(e,r,t)=>{if(typeof r=="string"&&!isNaN(Number(r))){let s=Number(r);e.set(s,t)}else e[r]=t;return!0}})}forEach(e){for(let r=0;r<this.size;r++)e(this.get(r),r,this)}map(e){let r=new Array(this.size);for(let t=0;t<this.size;t++)r[t]=e(this.get(t),t,this);return r}filter(e){let r=[];for(let t=0;t<this.size;t++){let s=this.get(t);e(s,t,this)&&r.push(s)}return r}some(e){for(let r=0;r<this.size;r++)if(e(this.get(r),r,this))return!0;return!1}every(e){for(let r=0;r<this.size;r++)if(!e(this.get(r),r,this))return!1;return!0}reduce(e,r){let t=r;for(let s=0;s<this.size;s++)t=e(t,this.get(s),s,this);return t}toString(){let e="";for(let r=0;r<this.size;r++)e+=this.get(r)?"1":"0";return e}static fromString(e){let r=new n(e.length);for(let t=0;t<e.length;t++)r.set(t,e[t]=="1");return r}static fromArray(e){let r=new n(e.length);for(let t=0;t<e.length;t++)r.set(t,!!e[t]);return r}static from(e){return typeof e=="string"?n.fromString(e):n.fromArray(e)}};
 //# sourceMappingURL=index.cjs.map

package/dist/index.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/index.ts"],"sourcesContent":["export default class FastBooleanArray {\r\n\tpublic size: number;\r\n\tprivate buffer: Uint8Array;\r\n\r\n\tconstructor(size: number) {\r\n\t\tif (!size) {\r\n\t\t\tthrow new Error('FastBooleanArray must have a size greater than 0');\r\n\t\t}\r\n\t\tthis.size = size;\r\n\t\tthis.buffer = new Uint8Array(Math.ceil(size / 8)); // Allocate memory\r\n\t}\r\n\r\n\t/**\r\n\t * Sets a boolean value at the specified index.\r\n\t * @param {number} index - The index to set the boolean value at.\r\n\t * @param {number} value - The boolean value to set the `index`.\r\n\t * @returns {boolean} The boolean value that was set.\r\n\t */\r\n\tset(index: number, value: boolean) {\r\n\t\tif (value) {\r\n\t\t\tthis.buffer[index >> 3] |= 1 << (index & 7); // Set bit\r\n\t\t\treturn true;\r\n\t\t} else {\r\n\t\t\tthis.buffer[index >> 3] &= ~(1 << (index & 7)); // Clear bit\r\n\t\t\treturn false;\r\n\t\t}\r\n\t}\r\n\r\n\t/**\r\n\t * like `set` but throws if the index is out of bounds (less than 0 or greater than or equal to the array size).\r\n\t * @param {number} index - The index to set the boolean value at.\r\n\t * @param {number} value - The boolean value to set the `index`.\r\n\t * @returns {boolean} The boolean value that was set.\r\n\t * @throws {RangeError} If the index is out of bounds (less than 0 or greater than or equal to the array size).\r\n\t */\r\n\tsetSafe(index: number, value: boolean) {\r\n\t\tif (index < 0 || index >= this.size) {\r\n\t\t\tthrow new RangeError('Index out of bounds');\r\n\t\t}\r\n\t\treturn this.set(index, value);\r\n\t}\r\n\r\n\t/**\r\n\t * Sets all bits to the specified boolean value.\r\n\t * @param {boolean} value - The boolean value to set all bits to.\r\n\t */\r\n\tsetAll(value: boolean) {\r\n\t\tthis.buffer.fill(value ? 0xff : 0x00);\r\n\t}\r\n\r\n\t/**\r\n\t * Gets a boolean value at the specified index.\r\n\t * @param {number} index - The index to get the boolean value of.\r\n\t * @returns {boolean} The boolean value that was set.\r\n\t * @throws {RangeError} If the index is out of bounds (less than 0 or greater than or equal to the array size).\r\n\t */\r\n\tget(index: number) {\r\n\t\tconst byteIndex = index >>> 3; // index divided by 8 (shifted)\r\n\t\tconst bitIndex = index & 7; // index modulo 8 (masking)\r\n\t\treturn (this.buffer[byteIndex] & (1 << bitIndex)) !== 0; // Direct comparison is faster than double negation !!\r\n\t}\r\n\r\n\t/**\r\n\t * like `get` but throws if the index is out of bounds (less than 0 or greater than or equal to the array size).\r\n\t * @param {number} index - The index to get the boolean value of.\r\n\t * @returns {boolean} The boolean value that was set.\r\n\t * @throws {RangeError} If the index is out of bounds (less than 0 or greater than or equal to the array size).\r\n\t */\r\n\tgetSafe(index: number) {\r\n\t\tif (index < 0 || index >= this.size) {\r\n\t\t\tthrow new RangeError('Index out of bounds');\r\n\t\t}\r\n\t\treturn this.get(index);\r\n\t}\r\n\r\n\t/**\r\n\t * Resizes the array to a new size, preserving existing data.\r\n\t * @param {number} newSize - The new size of the array.\r\n\t */\r\n\tresize(newSize: number) {\r\n\t\tconst newBuffer = new Uint8Array(Math.ceil(newSize / 8));\r\n\t\tnewBuffer.set(this.buffer.subarray(0, Math.min(this.buffer.length, newBuffer.length)));\r\n\t\tthis.buffer = newBuffer;\r\n\t\tthis.size = newSize;\r\n\t}\r\n\r\n\tget length() {\r\n\t\treturn this.size;\r\n\t}\r\n\r\n\t/**\r\n\t * Compares this FastBooleanArray with another for equality.\r\n\t * @param {FastBooleanArray} other - The other FastBooleanArray to compare.\r\n\t * @returns {boolean} True if both arrays are equal, false otherwise.\r\n\t */\r\n\tequals(other: FastBooleanArray) {\r\n\t\tif (this.size !== other.size) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\treturn this.buffer.every((byte, i) => byte === other.buffer[i]);\r\n\t}\r\n\r\n\t/**\r\n\t * Makes the array iterable using `for...of`.\r\n\t */\r\n\t*[Symbol.iterator]() {\r\n\t\tfor (let i = 0; i < this.size; i++) {\r\n\t\t\tyield this.get(i);\r\n\t\t}\r\n\t}\r\n\r\n\t/**\r\n\t * Converts to a standard JavaScript array.\r\n\t */\r\n\ttoArray() {\r\n\t\tconst arr = new Array(this.size);\r\n\t\tfor (let i = 0; i < this.size; i++) {\r\n\t\t\tarr[i] = this.get(i);\r\n\t\t}\r\n\t\treturn arr;\r\n\t}\r\n\r\n\t/**\r\n\t * Returns a proxy to the FastBooleanArray instance\r\n\t * With this you can access indexes like on an actual array.\r\n\t */\r\n\taccessLikeArray() {\r\n\t\treturn new Proxy(this, {\r\n\t\t\tget: (target, prop) => {\r\n\t\t\t\tif (typeof prop === 'string' && !isNaN(Number(prop))) {\r\n\t\t\t\t\tconst index = Number(prop);\r\n\t\t\t\t\treturn target.get(index);\r\n\t\t\t\t}\r\n\t\t\t\treturn target[prop as keyof FastBooleanArray];\r\n\t\t\t},\r\n\t\t\tset: (target, prop, value) => {\r\n\t\t\t\tif (typeof prop === 'string' && !isNaN(Number(prop))) {\r\n\t\t\t\t\tconst index = Number(prop);\r\n\t\t\t\t\treturn target.set(index, value as never);\r\n\t\t\t\t}\r\n\r\n\t\t\t\treturn (target[prop as Exclude<keyof FastBooleanArray, 'length'>] = value);\r\n\t\t\t}\r\n\t\t});\r\n\t}\r\n\r\n\t/**\r\n\t * Applies a callback function to each element in the array.\r\n\t * @param {Function} callback - The function to execute on each element.\r\n\t */\r\n\tforEach(callback: (value: boolean, index: number, array: FastBooleanArray) => void) {\r\n\t\tfor (let i = 0; i < this.size; i++) {\r\n\t\t\tcallback(this.get(i), i, this);\r\n\t\t}\r\n\t}\r\n\r\n\t/**\r\n\t * Creates a new array with the results of calling a provided function on every element.\r\n\t * @param {Function} callback - The function to execute on each element.\r\n\t */\r\n\tmap(callback: (value: boolean, index: number, array: FastBooleanArray) => never) {\r\n\t\tconst result = new Array(this.size);\r\n\t\tfor (let i = 0; i < this.size; i++) {\r\n\t\t\tresult[i] = callback(this.get(i), i, this);\r\n\t\t}\r\n\t\treturn result;\r\n\t}\r\n\r\n\t/**\r\n\t * Creates a new array with all elements that pass the test implemented by the provided function.\r\n\t * @param {Function} callback - The function to test each element.\r\n\t */\r\n\tfilter(callback: (value: boolean, index: number, array: FastBooleanArray) => boolean) {\r\n\t\tconst result: boolean[] = [];\r\n\t\tfor (let i = 0; i < this.size; i++) {\r\n\t\t\tconst value = this.get(i);\r\n\t\t\tif (callback(value, i, this)) {\r\n\t\t\t\tresult.push(value);\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn result;\r\n\t}\r\n\r\n\t/**\r\n\t * Tests whether at least one element in the array passes the test implemented by the provided function.\r\n\t * @param {Function} callback - The function to test each element.\r\n\t */\r\n\tsome(callback: (value: boolean, index: number, array: FastBooleanArray) => boolean) {\r\n\t\tfor (let i = 0; i < this.size; i++) {\r\n\t\t\tif (callback(this.get(i), i, this)) {\r\n\t\t\t\treturn true;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn false;\r\n\t}\r\n\r\n\t/**\r\n\t * Tests whether all elements in the array pass the test implemented by the provided function.\r\n\t * @param {Function} callback - The function to test each element.\r\n\t */\r\n\tevery(callback: (value: boolean, index: number, array: FastBooleanArray) => boolean) {\r\n\t\tfor (let i = 0; i < this.size; i++) {\r\n\t\t\tif (!callback(this.get(i), i, this)) {\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn true;\r\n\t}\r\n\r\n\t/**\r\n\t * Reduces the array to a single value by applying a function to each element.\r\n\t * @param {Function} callback - The function to execute on each element.\r\n\t * @param {any} initialValue - The initial value for the accumulator.\r\n\t */\r\n\treduce<T>(\r\n\t\tcallback: (accumulator: T, value: boolean, index: number, array: FastBooleanArray) => T,\r\n\t\tinitialValue: T\r\n\t): T {\r\n\t\tlet accumulator = initialValue;\r\n\t\tfor (let i = 0; i < this.size; i++) {\r\n\t\t\taccumulator = callback(accumulator, this.get(i), i, this);\r\n\t\t}\r\n\t\treturn accumulator;\r\n\t}\r\n\r\n\t/**\r\n\t * Generates a string where every boolean is either a 0 or 1.\r\n\t */\r\n\ttoString() {\r\n\t\tlet result = ``;\r\n\t\tfor (let i = 0; i < this.size; i++) {\r\n\t\t\tresult += this.get(i) ? '1' : '0';\r\n\t\t}\r\n\t\treturn result;\r\n\t}\r\n\r\n\t/**\r\n\t * Returns a FastBooleanArray from .toString() output\r\n\t */\r\n\tstatic fromString(value: string) {\r\n\t\tconst array = new FastBooleanArray(value.length);\r\n\t\tfor (let i = 0; i < value.length; i++) {\r\n\t\t\tarray.set(i, value[i] == '1');\r\n\t\t}\r\n\t\treturn array;\r\n\t}\r\n\r\n\t/**\r\n\t * Returns a FastBooleanArray from a boolean array or number array\r\n\t */\r\n\tstatic fromArray(value: boolean[] | number[]) {\r\n\t\tconst array = new FastBooleanArray(value.length);\r\n\t\tfor (let i = 0; i < value.length; i++) {\r\n\t\t\tarray.set(i, !!value[i]);\r\n\t\t}\r\n\t\treturn array;\r\n\t}\r\n\r\n\t/**\r\n\t * Returns a FastBooleanArray from a string, boolean array or number array\r\n\t */\r\n\tstatic from(value: string | boolean[] | number[]) {\r\n\t\tif (typeof value === 'string') {\r\n\t\t\treturn FastBooleanArray.fromString(value);\r\n\t\t}\r\n\r\n\t\treturn FastBooleanArray.fromArray(value);\r\n\t}\r\n}\r\n"],"mappings":"4ZAAA,IAAAA,EAAA,GAAAC,EAAAD,EAAA,aAAAE,IAAA,eAAAC,EAAAH,GAAA,IAAqBE,EAArB,MAAqBE,CAAiB,CAC9B,KACC,OAER,YAAYC,EAAc,CACzB,GAAI,CAACA,EACJ,MAAM,IAAI,MAAM,kDAAkD,EAEnE,KAAK,KAAOA,EACZ,KAAK,OAAS,IAAI,WAAW,KAAK,KAAKA,EAAO,CAAC,CAAC,CACjD,CAQA,IAAIC,EAAeC,EAAgB,CAClC,OAAIA,GACH,KAAK,OAAOD,GAAS,CAAC,GAAK,IAAMA,EAAQ,GAClC,KAEP,KAAK,OAAOA,GAAS,CAAC,GAAK,EAAE,IAAMA,EAAQ,IACpC,GAET,CASA,QAAQA,EAAeC,EAAgB,CACtC,GAAID,EAAQ,GAAKA,GAAS,KAAK,KAC9B,MAAM,IAAI,WAAW,qBAAqB,EAE3C,OAAO,KAAK,IAAIA,EAAOC,CAAK,CAC7B,CAMA,OAAOA,EAAgB,CACtB,KAAK,OAAO,KAAKA,EAAQ,IAAO,CAAI,CACrC,CAQA,IAAID,EAAe,CAClB,IAAME,EAAYF,IAAU,EACtBG,EAAWH,EAAQ,EACzB,OAAQ,KAAK,OAAOE,CAAS,EAAK,GAAKC,KAAe,CACvD,CAQA,QAAQH,EAAe,CACtB,GAAIA,EAAQ,GAAKA,GAAS,KAAK,KAC9B,MAAM,IAAI,WAAW,qBAAqB,EAE3C,OAAO,KAAK,IAAIA,CAAK,CACtB,CAMA,OAAOI,EAAiB,CACvB,IAAMC,EAAY,IAAI,WAAW,KAAK,KAAKD,EAAU,CAAC,CAAC,EACvDC,EAAU,IAAI,KAAK,OAAO,SAAS,EAAG,KAAK,IAAI,KAAK,OAAO,OAAQA,EAAU,MAAM,CAAC,CAAC,EACrF,KAAK,OAASA,EACd,KAAK,KAAOD,CACb,CAEA,IAAI,QAAS,CACZ,OAAO,KAAK,IACb,CAOA,OAAOE,EAAyB,CAC/B,OAAI,KAAK,OAASA,EAAM,KAChB,GAED,KAAK,OAAO,MAAM,CAACC,EAAMC,IAAMD,IAASD,EAAM,OAAOE,CAAC,CAAC,CAC/D,CAKA,EAAE,OAAO,QAAQ,GAAI,CACpB,QAASA,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC9B,MAAM,KAAK,IAAIA,CAAC,CAElB,CAKA,SAAU,CACT,IAAMC,EAAM,IAAI,MAAM,KAAK,IAAI,EAC/B,QAASD,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC9BC,EAAID,CAAC,EAAI,KAAK,IAAIA,CAAC,EAEpB,OAAOC,CACR,CAMA,iBAAkB,CACjB,OAAO,IAAI,MAAM,KAAM,CACtB,IAAK,CAACC,EAAQC,IAAS,CACtB,GAAI,OAAOA,GAAS,UAAY,CAAC,MAAM,OAAOA,CAAI,CAAC,EAAG,CACrD,IAAMX,EAAQ,OAAOW,CAAI,EACzB,OAAOD,EAAO,IAAIV,CAAK,CACxB,CACA,OAAOU,EAAOC,CAA8B,CAC7C,EACA,IAAK,CAACD,EAAQC,EAAMV,IAAU,CAC7B,GAAI,OAAOU,GAAS,UAAY,CAAC,MAAM,OAAOA,CAAI,CAAC,EAAG,CACrD,IAAMX,EAAQ,OAAOW,CAAI,EACzB,OAAOD,EAAO,IAAIV,EAAOC,CAAc,CACxC,CAEA,OAAQS,EAAOC,CAAiD,EAAIV,CACrE,CACD,CAAC,CACF,CAMA,QAAQW,EAA4E,CACnF,QAASJ,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC9BI,EAAS,KAAK,IAAIJ,CAAC,EAAGA,EAAG,IAAI,CAE/B,CAMA,IAAII,EAA6E,CAChF,IAAMC,EAAS,IAAI,MAAM,KAAK,IAAI,EAClC,QAASL,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC9BK,EAAOL,CAAC,EAAII,EAAS,KAAK,IAAIJ,CAAC,EAAGA,EAAG,IAAI,EAE1C,OAAOK,CACR,CAMA,OAAOD,EAA+E,CACrF,IAAMC,EAAoB,CAAC,EAC3B,QAASL,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAAK,CACnC,IAAMP,EAAQ,KAAK,IAAIO,CAAC,EACpBI,EAASX,EAAOO,EAAG,IAAI,GAC1BK,EAAO,KAAKZ,CAAK,CAEnB,CACA,OAAOY,CACR,CAMA,KAAKD,EAA+E,CACnF,QAASJ,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC9B,GAAII,EAAS,KAAK,IAAIJ,CAAC,EAAGA,EAAG,IAAI,EAChC,MAAO,GAGT,MAAO,EACR,CAMA,MAAMI,EAA+E,CACpF,QAASJ,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC9B,GAAI,CAACI,EAAS,KAAK,IAAIJ,CAAC,EAAGA,EAAG,IAAI,EACjC,MAAO,GAGT,MAAO,EACR,CAOA,OACCI,EACAE,EACI,CACJ,IAAIC,EAAcD,EAClB,QAASN,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC9BO,EAAcH,EAASG,EAAa,KAAK,IAAIP,CAAC,EAAGA,EAAG,IAAI,EAEzD,OAAOO,CACR,CAKA,UAAW,CACV,IAAIF,EAAS,GACb,QAASL,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC9BK,GAAU,KAAK,IAAIL,CAAC,EAAI,IAAM,IAE/B,OAAOK,CACR,CAKA,OAAO,WAAWZ,EAAe,CAChC,IAAMe,EAAQ,IAAIlB,EAAiBG,EAAM,MAAM,EAC/C,QAASO,EAAI,EAAGA,EAAIP,EAAM,OAAQO,IACjCQ,EAAM,IAAIR,EAAGP,EAAMO,CAAC,GAAK,GAAG,EAE7B,OAAOQ,CACR,CAKA,OAAO,UAAUf,EAA6B,CAC7C,IAAMe,EAAQ,IAAIlB,EAAiBG,EAAM,MAAM,EAC/C,QAASO,EAAI,EAAGA,EAAIP,EAAM,OAAQO,IACjCQ,EAAM,IAAIR,EAAG,CAAC,CAACP,EAAMO,CAAC,CAAC,EAExB,OAAOQ,CACR,CAKA,OAAO,KAAKf,EAAsC,CACjD,OAAI,OAAOA,GAAU,SACbH,EAAiB,WAAWG,CAAK,EAGlCH,EAAiB,UAAUG,CAAK,CACxC,CACD","names":["src_exports","__export","FastBooleanArray","__toCommonJS","_FastBooleanArray","size","index","value","byteIndex","bitIndex","newSize","newBuffer","other","byte","i","arr","target","prop","callback","result","initialValue","accumulator","array"]}
+{"version":3,"sources":["../src/index.ts"],"sourcesContent":["const ERROR_OUT_OF_BOUNDS = \"Index out of bounds\";\r\n\r\nexport default class FastBooleanArray {\r\n  public size: number;\r\n  private buffer: Uint8Array;\r\n\r\n  constructor(size: number) {\r\n    if (!size) {\r\n      throw new Error(\"FastBooleanArray must have a size greater than 0\");\r\n    }\r\n    this.size = size;\r\n    this.buffer = new Uint8Array(Math.ceil(size / 8)); // Allocate memory\r\n  }\r\n\r\n  /**\r\n   * Sets a boolean value at the specified index.\r\n   * @param {number} index - The index to set the boolean value at.\r\n   * @param {number} value - The boolean value to set the `index`.\r\n   * @returns {boolean} The boolean value that was set.\r\n   */\r\n  set(index: number, value: boolean) {\r\n    if (value) {\r\n      this.buffer[index >> 3] |= 1 << (index & 7); // Set bit\r\n      return true;\r\n    } else {\r\n      this.buffer[index >> 3] &= ~(1 << (index & 7)); // Clear bit\r\n      return false;\r\n    }\r\n  }\r\n\r\n  /**\r\n   * like `set` but throws if the index is out of bounds (less than 0 or greater than or equal to the array size).\r\n   * @param {number} index - The index to set the boolean value at.\r\n   * @param {number} value - The boolean value to set the `index`.\r\n   * @returns {boolean} The boolean value that was set.\r\n   * @throws {RangeError} If the index is out of bounds (less than 0 or greater than or equal to the array size).\r\n   */\r\n  setSafe(index: number, value: boolean) {\r\n    if (index < 0 || index >= this.size) {\r\n      throw new RangeError(ERROR_OUT_OF_BOUNDS);\r\n    }\r\n    return this.set(index, value);\r\n  }\r\n\r\n  /**\r\n   * Sets all bits to the specified boolean value.\r\n   * @param {boolean} value - The boolean value to set all bits to.\r\n   */\r\n  setAll(value: boolean) {\r\n    this.buffer.fill(value ? 0xff : 0x00);\r\n  }\r\n\r\n  /**\r\n   * Gets a boolean value at the specified index.\r\n   * @param {number} index - The index to get the boolean value of.\r\n   * @returns {boolean} The boolean value that was set.\r\n   * @throws {RangeError} If the index is out of bounds (less than 0 or greater than or equal to the array size).\r\n   */\r\n  get(index: number) {\r\n    const byteIndex = index >>> 3; // index divided by 8 (shifted)\r\n    const bitIndex = index & 7; // index modulo 8 (masking)\r\n    return (this.buffer[byteIndex] & (1 << bitIndex)) !== 0; // Direct comparison is faster than double negation !!\r\n  }\r\n\r\n  /**\r\n   * like `get` but throws if the index is out of bounds (less than 0 or greater than or equal to the array size).\r\n   * @param {number} index - The index to get the boolean value of.\r\n   * @returns {boolean} The boolean value that was set.\r\n   * @throws {RangeError} If the index is out of bounds (less than 0 or greater than or equal to the array size).\r\n   */\r\n  getSafe(index: number) {\r\n    if (index < 0 || index >= this.size) {\r\n      throw new RangeError(ERROR_OUT_OF_BOUNDS);\r\n    }\r\n    return this.get(index);\r\n  }\r\n\r\n  /**\r\n   * Resizes the array to a new size, preserving existing data.\r\n   * @param {number} newSize - The new size of the array.\r\n   */\r\n  resize(newSize: number) {\r\n    const newBuffer = new Uint8Array(Math.ceil(newSize / 8));\r\n    newBuffer.set(\r\n      this.buffer.subarray(0, Math.min(this.buffer.length, newBuffer.length))\r\n    );\r\n    this.size = newSize;\r\n    this.buffer = newBuffer;\r\n  }\r\n\r\n  get length() {\r\n    return this.size;\r\n  }\r\n\r\n  /**\r\n   * Compares this FastBooleanArray with another for equality.\r\n   * @param {FastBooleanArray} other - The other FastBooleanArray to compare.\r\n   * @returns {boolean} True if both arrays are equal, false otherwise.\r\n   */\r\n  equals(other: FastBooleanArray) {\r\n    if (this.size !== other.size) {\r\n      return false;\r\n    }\r\n    return this.buffer.every((byte, i) => byte === other.buffer[i]);\r\n  }\r\n\r\n  /**\r\n   * Makes the array iterable using `for...of`.\r\n   */\r\n  *[Symbol.iterator]() {\r\n    for (let i = 0; i < this.size; i++) {\r\n      yield this.get(i);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Converts to a standard JavaScript array.\r\n   */\r\n  toArray() {\r\n    const arr = new Array(this.size);\r\n    for (let i = 0; i < this.size; i++) {\r\n      arr[i] = this.get(i);\r\n    }\r\n    return arr;\r\n  }\r\n\r\n  /**\r\n   * Returns a proxy to the FastBooleanArray instance\r\n   * With this you can access indexes like on an actual array.\r\n   */\r\n  accessLikeArray() {\r\n    return new Proxy(this, {\r\n      get: (target, prop) => {\r\n        if (typeof prop === \"string\" && !isNaN(Number(prop))) {\r\n          const index = Number(prop);\r\n          return target.get(index);\r\n        }\r\n        return target[prop as keyof FastBooleanArray];\r\n      },\r\n      set: (target, prop, value) => {\r\n        if (typeof prop === \"string\" && !isNaN(Number(prop))) {\r\n          const index = Number(prop);\r\n          target.set(index, value as never);\r\n        } else {\r\n          target[prop as Exclude<keyof FastBooleanArray, \"length\">] = value;\r\n        }\r\n\r\n        return true;\r\n      },\r\n    });\r\n  }\r\n\r\n  /**\r\n   * Applies a callback function to each element in the array.\r\n   * @param {Function} callback - The function to execute on each element.\r\n   */\r\n  forEach(\r\n    callback: (value: boolean, index: number, array: FastBooleanArray) => void\r\n  ) {\r\n    for (let i = 0; i < this.size; i++) {\r\n      callback(this.get(i), i, this);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Creates a new array with the results of calling a provided function on every element.\r\n   * @param {Function} callback - The function to execute on each element.\r\n   */\r\n  map(\r\n    callback: (value: boolean, index: number, array: FastBooleanArray) => never\r\n  ) {\r\n    const result = new Array(this.size);\r\n    for (let i = 0; i < this.size; i++) {\r\n      result[i] = callback(this.get(i), i, this);\r\n    }\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * Creates a new array with all elements that pass the test implemented by the provided function.\r\n   * @param {Function} callback - The function to test each element.\r\n   */\r\n  filter(\r\n    callback: (\r\n      value: boolean,\r\n      index: number,\r\n      array: FastBooleanArray\r\n    ) => boolean\r\n  ) {\r\n    const result: boolean[] = [];\r\n    for (let i = 0; i < this.size; i++) {\r\n      const value = this.get(i);\r\n      if (callback(value, i, this)) {\r\n        result.push(value);\r\n      }\r\n    }\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * Tests whether at least one element in the array passes the test implemented by the provided function.\r\n   * @param {Function} callback - The function to test each element.\r\n   */\r\n  some(\r\n    callback: (\r\n      value: boolean,\r\n      index: number,\r\n      array: FastBooleanArray\r\n    ) => boolean\r\n  ) {\r\n    for (let i = 0; i < this.size; i++) {\r\n      if (callback(this.get(i), i, this)) {\r\n        return true;\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n\r\n  /**\r\n   * Tests whether all elements in the array pass the test implemented by the provided function.\r\n   * @param {Function} callback - The function to test each element.\r\n   */\r\n  every(\r\n    callback: (\r\n      value: boolean,\r\n      index: number,\r\n      array: FastBooleanArray\r\n    ) => boolean\r\n  ) {\r\n    for (let i = 0; i < this.size; i++) {\r\n      if (!callback(this.get(i), i, this)) {\r\n        return false;\r\n      }\r\n    }\r\n    return true;\r\n  }\r\n\r\n  /**\r\n   * Reduces the array to a single value by applying a function to each element.\r\n   * @param {Function} callback - The function to execute on each element.\r\n   * @param {any} initialValue - The initial value for the accumulator.\r\n   */\r\n  reduce<T>(\r\n    callback: (\r\n      accumulator: T,\r\n      value: boolean,\r\n      index: number,\r\n      array: FastBooleanArray\r\n    ) => T,\r\n    initialValue: T\r\n  ): T {\r\n    let accumulator = initialValue;\r\n    for (let i = 0; i < this.size; i++) {\r\n      accumulator = callback(accumulator, this.get(i), i, this);\r\n    }\r\n    return accumulator;\r\n  }\r\n\r\n  /**\r\n   * Generates a string where every boolean is either a 0 or 1.\r\n   */\r\n  toString() {\r\n    let result = ``;\r\n    for (let i = 0; i < this.size; i++) {\r\n      result += this.get(i) ? \"1\" : \"0\";\r\n    }\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * Returns a FastBooleanArray from .toString() output\r\n   */\r\n  static fromString(value: string) {\r\n    const array = new FastBooleanArray(value.length);\r\n    for (let i = 0; i < value.length; i++) {\r\n      array.set(i, value[i] == \"1\");\r\n    }\r\n    return array;\r\n  }\r\n\r\n  /**\r\n   * Returns a FastBooleanArray from a boolean array or number array\r\n   */\r\n  static fromArray(value: boolean[] | number[]) {\r\n    const array = new FastBooleanArray(value.length);\r\n    for (let i = 0; i < value.length; i++) {\r\n      array.set(i, !!value[i]);\r\n    }\r\n    return array;\r\n  }\r\n\r\n  /**\r\n   * Returns a FastBooleanArray from a string, boolean array or number array\r\n   */\r\n  static from(value: string | boolean[] | number[]) {\r\n    if (typeof value === \"string\") {\r\n      return FastBooleanArray.fromString(value);\r\n    }\r\n\r\n    return FastBooleanArray.fromArray(value);\r\n  }\r\n}\r\n"],"mappings":"4ZAAA,IAAAA,EAAA,GAAAC,EAAAD,EAAA,aAAAE,IAAA,eAAAC,EAAAH,GAAA,IAAMI,EAAsB,sBAEPF,EAArB,MAAqBG,CAAiB,CAC7B,KACC,OAER,YAAYC,EAAc,CACxB,GAAI,CAACA,EACH,MAAM,IAAI,MAAM,kDAAkD,EAEpE,KAAK,KAAOA,EACZ,KAAK,OAAS,IAAI,WAAW,KAAK,KAAKA,EAAO,CAAC,CAAC,CAClD,CAQA,IAAIC,EAAeC,EAAgB,CACjC,OAAIA,GACF,KAAK,OAAOD,GAAS,CAAC,GAAK,IAAMA,EAAQ,GAClC,KAEP,KAAK,OAAOA,GAAS,CAAC,GAAK,EAAE,IAAMA,EAAQ,IACpC,GAEX,CASA,QAAQA,EAAeC,EAAgB,CACrC,GAAID,EAAQ,GAAKA,GAAS,KAAK,KAC7B,MAAM,IAAI,WAAWH,CAAmB,EAE1C,OAAO,KAAK,IAAIG,EAAOC,CAAK,CAC9B,CAMA,OAAOA,EAAgB,CACrB,KAAK,OAAO,KAAKA,EAAQ,IAAO,CAAI,CACtC,CAQA,IAAID,EAAe,CACjB,IAAME,EAAYF,IAAU,EACtBG,EAAWH,EAAQ,EACzB,OAAQ,KAAK,OAAOE,CAAS,EAAK,GAAKC,KAAe,CACxD,CAQA,QAAQH,EAAe,CACrB,GAAIA,EAAQ,GAAKA,GAAS,KAAK,KAC7B,MAAM,IAAI,WAAWH,CAAmB,EAE1C,OAAO,KAAK,IAAIG,CAAK,CACvB,CAMA,OAAOI,EAAiB,CACtB,IAAMC,EAAY,IAAI,WAAW,KAAK,KAAKD,EAAU,CAAC,CAAC,EACvDC,EAAU,IACR,KAAK,OAAO,SAAS,EAAG,KAAK,IAAI,KAAK,OAAO,OAAQA,EAAU,MAAM,CAAC,CACxE,EACA,KAAK,KAAOD,EACZ,KAAK,OAASC,CAChB,CAEA,IAAI,QAAS,CACX,OAAO,KAAK,IACd,CAOA,OAAOC,EAAyB,CAC9B,OAAI,KAAK,OAASA,EAAM,KACf,GAEF,KAAK,OAAO,MAAM,CAACC,EAAMC,IAAMD,IAASD,EAAM,OAAOE,CAAC,CAAC,CAChE,CAKA,EAAE,OAAO,QAAQ,GAAI,CACnB,QAASA,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC7B,MAAM,KAAK,IAAIA,CAAC,CAEpB,CAKA,SAAU,CACR,IAAMC,EAAM,IAAI,MAAM,KAAK,IAAI,EAC/B,QAASD,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC7BC,EAAID,CAAC,EAAI,KAAK,IAAIA,CAAC,EAErB,OAAOC,CACT,CAMA,iBAAkB,CAChB,OAAO,IAAI,MAAM,KAAM,CACrB,IAAK,CAACC,EAAQC,IAAS,CACrB,GAAI,OAAOA,GAAS,UAAY,CAAC,MAAM,OAAOA,CAAI,CAAC,EAAG,CACpD,IAAMX,EAAQ,OAAOW,CAAI,EACzB,OAAOD,EAAO,IAAIV,CAAK,CACzB,CACA,OAAOU,EAAOC,CAA8B,CAC9C,EACA,IAAK,CAACD,EAAQC,EAAMV,IAAU,CAC5B,GAAI,OAAOU,GAAS,UAAY,CAAC,MAAM,OAAOA,CAAI,CAAC,EAAG,CACpD,IAAMX,EAAQ,OAAOW,CAAI,EACzBD,EAAO,IAAIV,EAAOC,CAAc,CAClC,MACES,EAAOC,CAAiD,EAAIV,EAG9D,MAAO,EACT,CACF,CAAC,CACH,CAMA,QACEW,EACA,CACA,QAASJ,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC7BI,EAAS,KAAK,IAAIJ,CAAC,EAAGA,EAAG,IAAI,CAEjC,CAMA,IACEI,EACA,CACA,IAAMC,EAAS,IAAI,MAAM,KAAK,IAAI,EAClC,QAASL,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC7BK,EAAOL,CAAC,EAAII,EAAS,KAAK,IAAIJ,CAAC,EAAGA,EAAG,IAAI,EAE3C,OAAOK,CACT,CAMA,OACED,EAKA,CACA,IAAMC,EAAoB,CAAC,EAC3B,QAASL,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAAK,CAClC,IAAMP,EAAQ,KAAK,IAAIO,CAAC,EACpBI,EAASX,EAAOO,EAAG,IAAI,GACzBK,EAAO,KAAKZ,CAAK,CAErB,CACA,OAAOY,CACT,CAMA,KACED,EAKA,CACA,QAASJ,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC7B,GAAII,EAAS,KAAK,IAAIJ,CAAC,EAAGA,EAAG,IAAI,EAC/B,MAAO,GAGX,MAAO,EACT,CAMA,MACEI,EAKA,CACA,QAASJ,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC7B,GAAI,CAACI,EAAS,KAAK,IAAIJ,CAAC,EAAGA,EAAG,IAAI,EAChC,MAAO,GAGX,MAAO,EACT,CAOA,OACEI,EAMAE,EACG,CACH,IAAIC,EAAcD,EAClB,QAASN,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC7BO,EAAcH,EAASG,EAAa,KAAK,IAAIP,CAAC,EAAGA,EAAG,IAAI,EAE1D,OAAOO,CACT,CAKA,UAAW,CACT,IAAIF,EAAS,GACb,QAASL,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC7BK,GAAU,KAAK,IAAIL,CAAC,EAAI,IAAM,IAEhC,OAAOK,CACT,CAKA,OAAO,WAAWZ,EAAe,CAC/B,IAAMe,EAAQ,IAAIlB,EAAiBG,EAAM,MAAM,EAC/C,QAASO,EAAI,EAAGA,EAAIP,EAAM,OAAQO,IAChCQ,EAAM,IAAIR,EAAGP,EAAMO,CAAC,GAAK,GAAG,EAE9B,OAAOQ,CACT,CAKA,OAAO,UAAUf,EAA6B,CAC5C,IAAMe,EAAQ,IAAIlB,EAAiBG,EAAM,MAAM,EAC/C,QAASO,EAAI,EAAGA,EAAIP,EAAM,OAAQO,IAChCQ,EAAM,IAAIR,EAAG,CAAC,CAACP,EAAMO,CAAC,CAAC,EAEzB,OAAOQ,CACT,CAKA,OAAO,KAAKf,EAAsC,CAChD,OAAI,OAAOA,GAAU,SACZH,EAAiB,WAAWG,CAAK,EAGnCH,EAAiB,UAAUG,CAAK,CACzC,CACF","names":["index_exports","__export","FastBooleanArray","__toCommonJS","ERROR_OUT_OF_BOUNDS","_FastBooleanArray","size","index","value","byteIndex","bitIndex","newSize","newBuffer","other","byte","i","arr","target","prop","callback","result","initialValue","accumulator","array"]}

package/dist/index.js

@@ -1,2 +1,2 @@
-var i=class n{size;buffer;constructor(e){if(!e)throw new Error("FastBooleanArray must have a size greater than 0");this.size=e,this.buffer=new Uint8Array(Math.ceil(e/8))}set(e,r){return r?(this.buffer[e>>3]|=1<<(e&7),!0):(this.buffer[e>>3]&=~(1<<(e&7)),!1)}setSafe(e,r){if(e<0||e>=this.size)throw new RangeError("Index out of bounds");return this.set(e,r)}setAll(e){this.buffer.fill(e?255:0)}get(e){let r=e>>>3,t=e&7;return(this.buffer[r]&1<<t)!==0}getSafe(e){if(e<0||e>=this.size)throw new RangeError("Index out of bounds");return this.get(e)}resize(e){let r=new Uint8Array(Math.ceil(e/8));r.set(this.buffer.subarray(0,Math.min(this.buffer.length,r.length))),this.buffer=r,this.size=e}get length(){return this.size}equals(e){return this.size!==e.size?!1:this.buffer.every((r,t)=>r===e.buffer[t])}*[Symbol.iterator](){for(let e=0;e<this.size;e++)yield this.get(e)}toArray(){let e=new Array(this.size);for(let r=0;r<this.size;r++)e[r]=this.get(r);return e}accessLikeArray(){return new Proxy(this,{get:(e,r)=>{if(typeof r=="string"&&!isNaN(Number(r))){let t=Number(r);return e.get(t)}return e[r]},set:(e,r,t)=>{if(typeof r=="string"&&!isNaN(Number(r))){let s=Number(r);return e.set(s,t)}return e[r]=t}})}forEach(e){for(let r=0;r<this.size;r++)e(this.get(r),r,this)}map(e){let r=new Array(this.size);for(let t=0;t<this.size;t++)r[t]=e(this.get(t),t,this);return r}filter(e){let r=[];for(let t=0;t<this.size;t++){let s=this.get(t);e(s,t,this)&&r.push(s)}return r}some(e){for(let r=0;r<this.size;r++)if(e(this.get(r),r,this))return!0;return!1}every(e){for(let r=0;r<this.size;r++)if(!e(this.get(r),r,this))return!1;return!0}reduce(e,r){let t=r;for(let s=0;s<this.size;s++)t=e(t,this.get(s),s,this);return t}toString(){let e="";for(let r=0;r<this.size;r++)e+=this.get(r)?"1":"0";return e}static fromString(e){let r=new n(e.length);for(let t=0;t<e.length;t++)r.set(t,e[t]=="1");return r}static fromArray(e){let r=new n(e.length);for(let t=0;t<e.length;t++)r.set(t,!!e[t]);return r}static from(e){return typeof e=="string"?n.fromString(e):n.fromArray(e)}};export{i as default};
+var a="Index out of bounds",i=class n{size;buffer;constructor(e){if(!e)throw new Error("FastBooleanArray must have a size greater than 0");this.size=e,this.buffer=new Uint8Array(Math.ceil(e/8))}set(e,r){return r?(this.buffer[e>>3]|=1<<(e&7),!0):(this.buffer[e>>3]&=~(1<<(e&7)),!1)}setSafe(e,r){if(e<0||e>=this.size)throw new RangeError(a);return this.set(e,r)}setAll(e){this.buffer.fill(e?255:0)}get(e){let r=e>>>3,t=e&7;return(this.buffer[r]&1<<t)!==0}getSafe(e){if(e<0||e>=this.size)throw new RangeError(a);return this.get(e)}resize(e){let r=new Uint8Array(Math.ceil(e/8));r.set(this.buffer.subarray(0,Math.min(this.buffer.length,r.length))),this.size=e,this.buffer=r}get length(){return this.size}equals(e){return this.size!==e.size?!1:this.buffer.every((r,t)=>r===e.buffer[t])}*[Symbol.iterator](){for(let e=0;e<this.size;e++)yield this.get(e)}toArray(){let e=new Array(this.size);for(let r=0;r<this.size;r++)e[r]=this.get(r);return e}accessLikeArray(){return new Proxy(this,{get:(e,r)=>{if(typeof r=="string"&&!isNaN(Number(r))){let t=Number(r);return e.get(t)}return e[r]},set:(e,r,t)=>{if(typeof r=="string"&&!isNaN(Number(r))){let s=Number(r);e.set(s,t)}else e[r]=t;return!0}})}forEach(e){for(let r=0;r<this.size;r++)e(this.get(r),r,this)}map(e){let r=new Array(this.size);for(let t=0;t<this.size;t++)r[t]=e(this.get(t),t,this);return r}filter(e){let r=[];for(let t=0;t<this.size;t++){let s=this.get(t);e(s,t,this)&&r.push(s)}return r}some(e){for(let r=0;r<this.size;r++)if(e(this.get(r),r,this))return!0;return!1}every(e){for(let r=0;r<this.size;r++)if(!e(this.get(r),r,this))return!1;return!0}reduce(e,r){let t=r;for(let s=0;s<this.size;s++)t=e(t,this.get(s),s,this);return t}toString(){let e="";for(let r=0;r<this.size;r++)e+=this.get(r)?"1":"0";return e}static fromString(e){let r=new n(e.length);for(let t=0;t<e.length;t++)r.set(t,e[t]=="1");return r}static fromArray(e){let r=new n(e.length);for(let t=0;t<e.length;t++)r.set(t,!!e[t]);return r}static from(e){return typeof e=="string"?n.fromString(e):n.fromArray(e)}};export{i as default};
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/index.ts"],"sourcesContent":["export default class FastBooleanArray {\r\n\tpublic size: number;\r\n\tprivate buffer: Uint8Array;\r\n\r\n\tconstructor(size: number) {\r\n\t\tif (!size) {\r\n\t\t\tthrow new Error('FastBooleanArray must have a size greater than 0');\r\n\t\t}\r\n\t\tthis.size = size;\r\n\t\tthis.buffer = new Uint8Array(Math.ceil(size / 8)); // Allocate memory\r\n\t}\r\n\r\n\t/**\r\n\t * Sets a boolean value at the specified index.\r\n\t * @param {number} index - The index to set the boolean value at.\r\n\t * @param {number} value - The boolean value to set the `index`.\r\n\t * @returns {boolean} The boolean value that was set.\r\n\t */\r\n\tset(index: number, value: boolean) {\r\n\t\tif (value) {\r\n\t\t\tthis.buffer[index >> 3] |= 1 << (index & 7); // Set bit\r\n\t\t\treturn true;\r\n\t\t} else {\r\n\t\t\tthis.buffer[index >> 3] &= ~(1 << (index & 7)); // Clear bit\r\n\t\t\treturn false;\r\n\t\t}\r\n\t}\r\n\r\n\t/**\r\n\t * like `set` but throws if the index is out of bounds (less than 0 or greater than or equal to the array size).\r\n\t * @param {number} index - The index to set the boolean value at.\r\n\t * @param {number} value - The boolean value to set the `index`.\r\n\t * @returns {boolean} The boolean value that was set.\r\n\t * @throws {RangeError} If the index is out of bounds (less than 0 or greater than or equal to the array size).\r\n\t */\r\n\tsetSafe(index: number, value: boolean) {\r\n\t\tif (index < 0 || index >= this.size) {\r\n\t\t\tthrow new RangeError('Index out of bounds');\r\n\t\t}\r\n\t\treturn this.set(index, value);\r\n\t}\r\n\r\n\t/**\r\n\t * Sets all bits to the specified boolean value.\r\n\t * @param {boolean} value - The boolean value to set all bits to.\r\n\t */\r\n\tsetAll(value: boolean) {\r\n\t\tthis.buffer.fill(value ? 0xff : 0x00);\r\n\t}\r\n\r\n\t/**\r\n\t * Gets a boolean value at the specified index.\r\n\t * @param {number} index - The index to get the boolean value of.\r\n\t * @returns {boolean} The boolean value that was set.\r\n\t * @throws {RangeError} If the index is out of bounds (less than 0 or greater than or equal to the array size).\r\n\t */\r\n\tget(index: number) {\r\n\t\tconst byteIndex = index >>> 3; // index divided by 8 (shifted)\r\n\t\tconst bitIndex = index & 7; // index modulo 8 (masking)\r\n\t\treturn (this.buffer[byteIndex] & (1 << bitIndex)) !== 0; // Direct comparison is faster than double negation !!\r\n\t}\r\n\r\n\t/**\r\n\t * like `get` but throws if the index is out of bounds (less than 0 or greater than or equal to the array size).\r\n\t * @param {number} index - The index to get the boolean value of.\r\n\t * @returns {boolean} The boolean value that was set.\r\n\t * @throws {RangeError} If the index is out of bounds (less than 0 or greater than or equal to the array size).\r\n\t */\r\n\tgetSafe(index: number) {\r\n\t\tif (index < 0 || index >= this.size) {\r\n\t\t\tthrow new RangeError('Index out of bounds');\r\n\t\t}\r\n\t\treturn this.get(index);\r\n\t}\r\n\r\n\t/**\r\n\t * Resizes the array to a new size, preserving existing data.\r\n\t * @param {number} newSize - The new size of the array.\r\n\t */\r\n\tresize(newSize: number) {\r\n\t\tconst newBuffer = new Uint8Array(Math.ceil(newSize / 8));\r\n\t\tnewBuffer.set(this.buffer.subarray(0, Math.min(this.buffer.length, newBuffer.length)));\r\n\t\tthis.buffer = newBuffer;\r\n\t\tthis.size = newSize;\r\n\t}\r\n\r\n\tget length() {\r\n\t\treturn this.size;\r\n\t}\r\n\r\n\t/**\r\n\t * Compares this FastBooleanArray with another for equality.\r\n\t * @param {FastBooleanArray} other - The other FastBooleanArray to compare.\r\n\t * @returns {boolean} True if both arrays are equal, false otherwise.\r\n\t */\r\n\tequals(other: FastBooleanArray) {\r\n\t\tif (this.size !== other.size) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\treturn this.buffer.every((byte, i) => byte === other.buffer[i]);\r\n\t}\r\n\r\n\t/**\r\n\t * Makes the array iterable using `for...of`.\r\n\t */\r\n\t*[Symbol.iterator]() {\r\n\t\tfor (let i = 0; i < this.size; i++) {\r\n\t\t\tyield this.get(i);\r\n\t\t}\r\n\t}\r\n\r\n\t/**\r\n\t * Converts to a standard JavaScript array.\r\n\t */\r\n\ttoArray() {\r\n\t\tconst arr = new Array(this.size);\r\n\t\tfor (let i = 0; i < this.size; i++) {\r\n\t\t\tarr[i] = this.get(i);\r\n\t\t}\r\n\t\treturn arr;\r\n\t}\r\n\r\n\t/**\r\n\t * Returns a proxy to the FastBooleanArray instance\r\n\t * With this you can access indexes like on an actual array.\r\n\t */\r\n\taccessLikeArray() {\r\n\t\treturn new Proxy(this, {\r\n\t\t\tget: (target, prop) => {\r\n\t\t\t\tif (typeof prop === 'string' && !isNaN(Number(prop))) {\r\n\t\t\t\t\tconst index = Number(prop);\r\n\t\t\t\t\treturn target.get(index);\r\n\t\t\t\t}\r\n\t\t\t\treturn target[prop as keyof FastBooleanArray];\r\n\t\t\t},\r\n\t\t\tset: (target, prop, value) => {\r\n\t\t\t\tif (typeof prop === 'string' && !isNaN(Number(prop))) {\r\n\t\t\t\t\tconst index = Number(prop);\r\n\t\t\t\t\treturn target.set(index, value as never);\r\n\t\t\t\t}\r\n\r\n\t\t\t\treturn (target[prop as Exclude<keyof FastBooleanArray, 'length'>] = value);\r\n\t\t\t}\r\n\t\t});\r\n\t}\r\n\r\n\t/**\r\n\t * Applies a callback function to each element in the array.\r\n\t * @param {Function} callback - The function to execute on each element.\r\n\t */\r\n\tforEach(callback: (value: boolean, index: number, array: FastBooleanArray) => void) {\r\n\t\tfor (let i = 0; i < this.size; i++) {\r\n\t\t\tcallback(this.get(i), i, this);\r\n\t\t}\r\n\t}\r\n\r\n\t/**\r\n\t * Creates a new array with the results of calling a provided function on every element.\r\n\t * @param {Function} callback - The function to execute on each element.\r\n\t */\r\n\tmap(callback: (value: boolean, index: number, array: FastBooleanArray) => never) {\r\n\t\tconst result = new Array(this.size);\r\n\t\tfor (let i = 0; i < this.size; i++) {\r\n\t\t\tresult[i] = callback(this.get(i), i, this);\r\n\t\t}\r\n\t\treturn result;\r\n\t}\r\n\r\n\t/**\r\n\t * Creates a new array with all elements that pass the test implemented by the provided function.\r\n\t * @param {Function} callback - The function to test each element.\r\n\t */\r\n\tfilter(callback: (value: boolean, index: number, array: FastBooleanArray) => boolean) {\r\n\t\tconst result: boolean[] = [];\r\n\t\tfor (let i = 0; i < this.size; i++) {\r\n\t\t\tconst value = this.get(i);\r\n\t\t\tif (callback(value, i, this)) {\r\n\t\t\t\tresult.push(value);\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn result;\r\n\t}\r\n\r\n\t/**\r\n\t * Tests whether at least one element in the array passes the test implemented by the provided function.\r\n\t * @param {Function} callback - The function to test each element.\r\n\t */\r\n\tsome(callback: (value: boolean, index: number, array: FastBooleanArray) => boolean) {\r\n\t\tfor (let i = 0; i < this.size; i++) {\r\n\t\t\tif (callback(this.get(i), i, this)) {\r\n\t\t\t\treturn true;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn false;\r\n\t}\r\n\r\n\t/**\r\n\t * Tests whether all elements in the array pass the test implemented by the provided function.\r\n\t * @param {Function} callback - The function to test each element.\r\n\t */\r\n\tevery(callback: (value: boolean, index: number, array: FastBooleanArray) => boolean) {\r\n\t\tfor (let i = 0; i < this.size; i++) {\r\n\t\t\tif (!callback(this.get(i), i, this)) {\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn true;\r\n\t}\r\n\r\n\t/**\r\n\t * Reduces the array to a single value by applying a function to each element.\r\n\t * @param {Function} callback - The function to execute on each element.\r\n\t * @param {any} initialValue - The initial value for the accumulator.\r\n\t */\r\n\treduce<T>(\r\n\t\tcallback: (accumulator: T, value: boolean, index: number, array: FastBooleanArray) => T,\r\n\t\tinitialValue: T\r\n\t): T {\r\n\t\tlet accumulator = initialValue;\r\n\t\tfor (let i = 0; i < this.size; i++) {\r\n\t\t\taccumulator = callback(accumulator, this.get(i), i, this);\r\n\t\t}\r\n\t\treturn accumulator;\r\n\t}\r\n\r\n\t/**\r\n\t * Generates a string where every boolean is either a 0 or 1.\r\n\t */\r\n\ttoString() {\r\n\t\tlet result = ``;\r\n\t\tfor (let i = 0; i < this.size; i++) {\r\n\t\t\tresult += this.get(i) ? '1' : '0';\r\n\t\t}\r\n\t\treturn result;\r\n\t}\r\n\r\n\t/**\r\n\t * Returns a FastBooleanArray from .toString() output\r\n\t */\r\n\tstatic fromString(value: string) {\r\n\t\tconst array = new FastBooleanArray(value.length);\r\n\t\tfor (let i = 0; i < value.length; i++) {\r\n\t\t\tarray.set(i, value[i] == '1');\r\n\t\t}\r\n\t\treturn array;\r\n\t}\r\n\r\n\t/**\r\n\t * Returns a FastBooleanArray from a boolean array or number array\r\n\t */\r\n\tstatic fromArray(value: boolean[] | number[]) {\r\n\t\tconst array = new FastBooleanArray(value.length);\r\n\t\tfor (let i = 0; i < value.length; i++) {\r\n\t\t\tarray.set(i, !!value[i]);\r\n\t\t}\r\n\t\treturn array;\r\n\t}\r\n\r\n\t/**\r\n\t * Returns a FastBooleanArray from a string, boolean array or number array\r\n\t */\r\n\tstatic from(value: string | boolean[] | number[]) {\r\n\t\tif (typeof value === 'string') {\r\n\t\t\treturn FastBooleanArray.fromString(value);\r\n\t\t}\r\n\r\n\t\treturn FastBooleanArray.fromArray(value);\r\n\t}\r\n}\r\n"],"mappings":"AAAA,IAAqBA,EAArB,MAAqBC,CAAiB,CAC9B,KACC,OAER,YAAYC,EAAc,CACzB,GAAI,CAACA,EACJ,MAAM,IAAI,MAAM,kDAAkD,EAEnE,KAAK,KAAOA,EACZ,KAAK,OAAS,IAAI,WAAW,KAAK,KAAKA,EAAO,CAAC,CAAC,CACjD,CAQA,IAAIC,EAAeC,EAAgB,CAClC,OAAIA,GACH,KAAK,OAAOD,GAAS,CAAC,GAAK,IAAMA,EAAQ,GAClC,KAEP,KAAK,OAAOA,GAAS,CAAC,GAAK,EAAE,IAAMA,EAAQ,IACpC,GAET,CASA,QAAQA,EAAeC,EAAgB,CACtC,GAAID,EAAQ,GAAKA,GAAS,KAAK,KAC9B,MAAM,IAAI,WAAW,qBAAqB,EAE3C,OAAO,KAAK,IAAIA,EAAOC,CAAK,CAC7B,CAMA,OAAOA,EAAgB,CACtB,KAAK,OAAO,KAAKA,EAAQ,IAAO,CAAI,CACrC,CAQA,IAAID,EAAe,CAClB,IAAME,EAAYF,IAAU,EACtBG,EAAWH,EAAQ,EACzB,OAAQ,KAAK,OAAOE,CAAS,EAAK,GAAKC,KAAe,CACvD,CAQA,QAAQH,EAAe,CACtB,GAAIA,EAAQ,GAAKA,GAAS,KAAK,KAC9B,MAAM,IAAI,WAAW,qBAAqB,EAE3C,OAAO,KAAK,IAAIA,CAAK,CACtB,CAMA,OAAOI,EAAiB,CACvB,IAAMC,EAAY,IAAI,WAAW,KAAK,KAAKD,EAAU,CAAC,CAAC,EACvDC,EAAU,IAAI,KAAK,OAAO,SAAS,EAAG,KAAK,IAAI,KAAK,OAAO,OAAQA,EAAU,MAAM,CAAC,CAAC,EACrF,KAAK,OAASA,EACd,KAAK,KAAOD,CACb,CAEA,IAAI,QAAS,CACZ,OAAO,KAAK,IACb,CAOA,OAAOE,EAAyB,CAC/B,OAAI,KAAK,OAASA,EAAM,KAChB,GAED,KAAK,OAAO,MAAM,CAACC,EAAMC,IAAMD,IAASD,EAAM,OAAOE,CAAC,CAAC,CAC/D,CAKA,EAAE,OAAO,QAAQ,GAAI,CACpB,QAASA,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC9B,MAAM,KAAK,IAAIA,CAAC,CAElB,CAKA,SAAU,CACT,IAAMC,EAAM,IAAI,MAAM,KAAK,IAAI,EAC/B,QAASD,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC9BC,EAAID,CAAC,EAAI,KAAK,IAAIA,CAAC,EAEpB,OAAOC,CACR,CAMA,iBAAkB,CACjB,OAAO,IAAI,MAAM,KAAM,CACtB,IAAK,CAACC,EAAQC,IAAS,CACtB,GAAI,OAAOA,GAAS,UAAY,CAAC,MAAM,OAAOA,CAAI,CAAC,EAAG,CACrD,IAAMX,EAAQ,OAAOW,CAAI,EACzB,OAAOD,EAAO,IAAIV,CAAK,CACxB,CACA,OAAOU,EAAOC,CAA8B,CAC7C,EACA,IAAK,CAACD,EAAQC,EAAMV,IAAU,CAC7B,GAAI,OAAOU,GAAS,UAAY,CAAC,MAAM,OAAOA,CAAI,CAAC,EAAG,CACrD,IAAMX,EAAQ,OAAOW,CAAI,EACzB,OAAOD,EAAO,IAAIV,EAAOC,CAAc,CACxC,CAEA,OAAQS,EAAOC,CAAiD,EAAIV,CACrE,CACD,CAAC,CACF,CAMA,QAAQW,EAA4E,CACnF,QAASJ,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC9BI,EAAS,KAAK,IAAIJ,CAAC,EAAGA,EAAG,IAAI,CAE/B,CAMA,IAAII,EAA6E,CAChF,IAAMC,EAAS,IAAI,MAAM,KAAK,IAAI,EAClC,QAASL,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC9BK,EAAOL,CAAC,EAAII,EAAS,KAAK,IAAIJ,CAAC,EAAGA,EAAG,IAAI,EAE1C,OAAOK,CACR,CAMA,OAAOD,EAA+E,CACrF,IAAMC,EAAoB,CAAC,EAC3B,QAASL,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAAK,CACnC,IAAMP,EAAQ,KAAK,IAAIO,CAAC,EACpBI,EAASX,EAAOO,EAAG,IAAI,GAC1BK,EAAO,KAAKZ,CAAK,CAEnB,CACA,OAAOY,CACR,CAMA,KAAKD,EAA+E,CACnF,QAASJ,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC9B,GAAII,EAAS,KAAK,IAAIJ,CAAC,EAAGA,EAAG,IAAI,EAChC,MAAO,GAGT,MAAO,EACR,CAMA,MAAMI,EAA+E,CACpF,QAASJ,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC9B,GAAI,CAACI,EAAS,KAAK,IAAIJ,CAAC,EAAGA,EAAG,IAAI,EACjC,MAAO,GAGT,MAAO,EACR,CAOA,OACCI,EACAE,EACI,CACJ,IAAIC,EAAcD,EAClB,QAASN,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC9BO,EAAcH,EAASG,EAAa,KAAK,IAAIP,CAAC,EAAGA,EAAG,IAAI,EAEzD,OAAOO,CACR,CAKA,UAAW,CACV,IAAIF,EAAS,GACb,QAASL,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC9BK,GAAU,KAAK,IAAIL,CAAC,EAAI,IAAM,IAE/B,OAAOK,CACR,CAKA,OAAO,WAAWZ,EAAe,CAChC,IAAMe,EAAQ,IAAIlB,EAAiBG,EAAM,MAAM,EAC/C,QAASO,EAAI,EAAGA,EAAIP,EAAM,OAAQO,IACjCQ,EAAM,IAAIR,EAAGP,EAAMO,CAAC,GAAK,GAAG,EAE7B,OAAOQ,CACR,CAKA,OAAO,UAAUf,EAA6B,CAC7C,IAAMe,EAAQ,IAAIlB,EAAiBG,EAAM,MAAM,EAC/C,QAASO,EAAI,EAAGA,EAAIP,EAAM,OAAQO,IACjCQ,EAAM,IAAIR,EAAG,CAAC,CAACP,EAAMO,CAAC,CAAC,EAExB,OAAOQ,CACR,CAKA,OAAO,KAAKf,EAAsC,CACjD,OAAI,OAAOA,GAAU,SACbH,EAAiB,WAAWG,CAAK,EAGlCH,EAAiB,UAAUG,CAAK,CACxC,CACD","names":["FastBooleanArray","_FastBooleanArray","size","index","value","byteIndex","bitIndex","newSize","newBuffer","other","byte","i","arr","target","prop","callback","result","initialValue","accumulator","array"]}
+{"version":3,"sources":["../src/index.ts"],"sourcesContent":["const ERROR_OUT_OF_BOUNDS = \"Index out of bounds\";\r\n\r\nexport default class FastBooleanArray {\r\n  public size: number;\r\n  private buffer: Uint8Array;\r\n\r\n  constructor(size: number) {\r\n    if (!size) {\r\n      throw new Error(\"FastBooleanArray must have a size greater than 0\");\r\n    }\r\n    this.size = size;\r\n    this.buffer = new Uint8Array(Math.ceil(size / 8)); // Allocate memory\r\n  }\r\n\r\n  /**\r\n   * Sets a boolean value at the specified index.\r\n   * @param {number} index - The index to set the boolean value at.\r\n   * @param {number} value - The boolean value to set the `index`.\r\n   * @returns {boolean} The boolean value that was set.\r\n   */\r\n  set(index: number, value: boolean) {\r\n    if (value) {\r\n      this.buffer[index >> 3] |= 1 << (index & 7); // Set bit\r\n      return true;\r\n    } else {\r\n      this.buffer[index >> 3] &= ~(1 << (index & 7)); // Clear bit\r\n      return false;\r\n    }\r\n  }\r\n\r\n  /**\r\n   * like `set` but throws if the index is out of bounds (less than 0 or greater than or equal to the array size).\r\n   * @param {number} index - The index to set the boolean value at.\r\n   * @param {number} value - The boolean value to set the `index`.\r\n   * @returns {boolean} The boolean value that was set.\r\n   * @throws {RangeError} If the index is out of bounds (less than 0 or greater than or equal to the array size).\r\n   */\r\n  setSafe(index: number, value: boolean) {\r\n    if (index < 0 || index >= this.size) {\r\n      throw new RangeError(ERROR_OUT_OF_BOUNDS);\r\n    }\r\n    return this.set(index, value);\r\n  }\r\n\r\n  /**\r\n   * Sets all bits to the specified boolean value.\r\n   * @param {boolean} value - The boolean value to set all bits to.\r\n   */\r\n  setAll(value: boolean) {\r\n    this.buffer.fill(value ? 0xff : 0x00);\r\n  }\r\n\r\n  /**\r\n   * Gets a boolean value at the specified index.\r\n   * @param {number} index - The index to get the boolean value of.\r\n   * @returns {boolean} The boolean value that was set.\r\n   * @throws {RangeError} If the index is out of bounds (less than 0 or greater than or equal to the array size).\r\n   */\r\n  get(index: number) {\r\n    const byteIndex = index >>> 3; // index divided by 8 (shifted)\r\n    const bitIndex = index & 7; // index modulo 8 (masking)\r\n    return (this.buffer[byteIndex] & (1 << bitIndex)) !== 0; // Direct comparison is faster than double negation !!\r\n  }\r\n\r\n  /**\r\n   * like `get` but throws if the index is out of bounds (less than 0 or greater than or equal to the array size).\r\n   * @param {number} index - The index to get the boolean value of.\r\n   * @returns {boolean} The boolean value that was set.\r\n   * @throws {RangeError} If the index is out of bounds (less than 0 or greater than or equal to the array size).\r\n   */\r\n  getSafe(index: number) {\r\n    if (index < 0 || index >= this.size) {\r\n      throw new RangeError(ERROR_OUT_OF_BOUNDS);\r\n    }\r\n    return this.get(index);\r\n  }\r\n\r\n  /**\r\n   * Resizes the array to a new size, preserving existing data.\r\n   * @param {number} newSize - The new size of the array.\r\n   */\r\n  resize(newSize: number) {\r\n    const newBuffer = new Uint8Array(Math.ceil(newSize / 8));\r\n    newBuffer.set(\r\n      this.buffer.subarray(0, Math.min(this.buffer.length, newBuffer.length))\r\n    );\r\n    this.size = newSize;\r\n    this.buffer = newBuffer;\r\n  }\r\n\r\n  get length() {\r\n    return this.size;\r\n  }\r\n\r\n  /**\r\n   * Compares this FastBooleanArray with another for equality.\r\n   * @param {FastBooleanArray} other - The other FastBooleanArray to compare.\r\n   * @returns {boolean} True if both arrays are equal, false otherwise.\r\n   */\r\n  equals(other: FastBooleanArray) {\r\n    if (this.size !== other.size) {\r\n      return false;\r\n    }\r\n    return this.buffer.every((byte, i) => byte === other.buffer[i]);\r\n  }\r\n\r\n  /**\r\n   * Makes the array iterable using `for...of`.\r\n   */\r\n  *[Symbol.iterator]() {\r\n    for (let i = 0; i < this.size; i++) {\r\n      yield this.get(i);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Converts to a standard JavaScript array.\r\n   */\r\n  toArray() {\r\n    const arr = new Array(this.size);\r\n    for (let i = 0; i < this.size; i++) {\r\n      arr[i] = this.get(i);\r\n    }\r\n    return arr;\r\n  }\r\n\r\n  /**\r\n   * Returns a proxy to the FastBooleanArray instance\r\n   * With this you can access indexes like on an actual array.\r\n   */\r\n  accessLikeArray() {\r\n    return new Proxy(this, {\r\n      get: (target, prop) => {\r\n        if (typeof prop === \"string\" && !isNaN(Number(prop))) {\r\n          const index = Number(prop);\r\n          return target.get(index);\r\n        }\r\n        return target[prop as keyof FastBooleanArray];\r\n      },\r\n      set: (target, prop, value) => {\r\n        if (typeof prop === \"string\" && !isNaN(Number(prop))) {\r\n          const index = Number(prop);\r\n          target.set(index, value as never);\r\n        } else {\r\n          target[prop as Exclude<keyof FastBooleanArray, \"length\">] = value;\r\n        }\r\n\r\n        return true;\r\n      },\r\n    });\r\n  }\r\n\r\n  /**\r\n   * Applies a callback function to each element in the array.\r\n   * @param {Function} callback - The function to execute on each element.\r\n   */\r\n  forEach(\r\n    callback: (value: boolean, index: number, array: FastBooleanArray) => void\r\n  ) {\r\n    for (let i = 0; i < this.size; i++) {\r\n      callback(this.get(i), i, this);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Creates a new array with the results of calling a provided function on every element.\r\n   * @param {Function} callback - The function to execute on each element.\r\n   */\r\n  map(\r\n    callback: (value: boolean, index: number, array: FastBooleanArray) => never\r\n  ) {\r\n    const result = new Array(this.size);\r\n    for (let i = 0; i < this.size; i++) {\r\n      result[i] = callback(this.get(i), i, this);\r\n    }\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * Creates a new array with all elements that pass the test implemented by the provided function.\r\n   * @param {Function} callback - The function to test each element.\r\n   */\r\n  filter(\r\n    callback: (\r\n      value: boolean,\r\n      index: number,\r\n      array: FastBooleanArray\r\n    ) => boolean\r\n  ) {\r\n    const result: boolean[] = [];\r\n    for (let i = 0; i < this.size; i++) {\r\n      const value = this.get(i);\r\n      if (callback(value, i, this)) {\r\n        result.push(value);\r\n      }\r\n    }\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * Tests whether at least one element in the array passes the test implemented by the provided function.\r\n   * @param {Function} callback - The function to test each element.\r\n   */\r\n  some(\r\n    callback: (\r\n      value: boolean,\r\n      index: number,\r\n      array: FastBooleanArray\r\n    ) => boolean\r\n  ) {\r\n    for (let i = 0; i < this.size; i++) {\r\n      if (callback(this.get(i), i, this)) {\r\n        return true;\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n\r\n  /**\r\n   * Tests whether all elements in the array pass the test implemented by the provided function.\r\n   * @param {Function} callback - The function to test each element.\r\n   */\r\n  every(\r\n    callback: (\r\n      value: boolean,\r\n      index: number,\r\n      array: FastBooleanArray\r\n    ) => boolean\r\n  ) {\r\n    for (let i = 0; i < this.size; i++) {\r\n      if (!callback(this.get(i), i, this)) {\r\n        return false;\r\n      }\r\n    }\r\n    return true;\r\n  }\r\n\r\n  /**\r\n   * Reduces the array to a single value by applying a function to each element.\r\n   * @param {Function} callback - The function to execute on each element.\r\n   * @param {any} initialValue - The initial value for the accumulator.\r\n   */\r\n  reduce<T>(\r\n    callback: (\r\n      accumulator: T,\r\n      value: boolean,\r\n      index: number,\r\n      array: FastBooleanArray\r\n    ) => T,\r\n    initialValue: T\r\n  ): T {\r\n    let accumulator = initialValue;\r\n    for (let i = 0; i < this.size; i++) {\r\n      accumulator = callback(accumulator, this.get(i), i, this);\r\n    }\r\n    return accumulator;\r\n  }\r\n\r\n  /**\r\n   * Generates a string where every boolean is either a 0 or 1.\r\n   */\r\n  toString() {\r\n    let result = ``;\r\n    for (let i = 0; i < this.size; i++) {\r\n      result += this.get(i) ? \"1\" : \"0\";\r\n    }\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * Returns a FastBooleanArray from .toString() output\r\n   */\r\n  static fromString(value: string) {\r\n    const array = new FastBooleanArray(value.length);\r\n    for (let i = 0; i < value.length; i++) {\r\n      array.set(i, value[i] == \"1\");\r\n    }\r\n    return array;\r\n  }\r\n\r\n  /**\r\n   * Returns a FastBooleanArray from a boolean array or number array\r\n   */\r\n  static fromArray(value: boolean[] | number[]) {\r\n    const array = new FastBooleanArray(value.length);\r\n    for (let i = 0; i < value.length; i++) {\r\n      array.set(i, !!value[i]);\r\n    }\r\n    return array;\r\n  }\r\n\r\n  /**\r\n   * Returns a FastBooleanArray from a string, boolean array or number array\r\n   */\r\n  static from(value: string | boolean[] | number[]) {\r\n    if (typeof value === \"string\") {\r\n      return FastBooleanArray.fromString(value);\r\n    }\r\n\r\n    return FastBooleanArray.fromArray(value);\r\n  }\r\n}\r\n"],"mappings":"AAAA,IAAMA,EAAsB,sBAEPC,EAArB,MAAqBC,CAAiB,CAC7B,KACC,OAER,YAAYC,EAAc,CACxB,GAAI,CAACA,EACH,MAAM,IAAI,MAAM,kDAAkD,EAEpE,KAAK,KAAOA,EACZ,KAAK,OAAS,IAAI,WAAW,KAAK,KAAKA,EAAO,CAAC,CAAC,CAClD,CAQA,IAAIC,EAAeC,EAAgB,CACjC,OAAIA,GACF,KAAK,OAAOD,GAAS,CAAC,GAAK,IAAMA,EAAQ,GAClC,KAEP,KAAK,OAAOA,GAAS,CAAC,GAAK,EAAE,IAAMA,EAAQ,IACpC,GAEX,CASA,QAAQA,EAAeC,EAAgB,CACrC,GAAID,EAAQ,GAAKA,GAAS,KAAK,KAC7B,MAAM,IAAI,WAAWJ,CAAmB,EAE1C,OAAO,KAAK,IAAII,EAAOC,CAAK,CAC9B,CAMA,OAAOA,EAAgB,CACrB,KAAK,OAAO,KAAKA,EAAQ,IAAO,CAAI,CACtC,CAQA,IAAID,EAAe,CACjB,IAAME,EAAYF,IAAU,EACtBG,EAAWH,EAAQ,EACzB,OAAQ,KAAK,OAAOE,CAAS,EAAK,GAAKC,KAAe,CACxD,CAQA,QAAQH,EAAe,CACrB,GAAIA,EAAQ,GAAKA,GAAS,KAAK,KAC7B,MAAM,IAAI,WAAWJ,CAAmB,EAE1C,OAAO,KAAK,IAAII,CAAK,CACvB,CAMA,OAAOI,EAAiB,CACtB,IAAMC,EAAY,IAAI,WAAW,KAAK,KAAKD,EAAU,CAAC,CAAC,EACvDC,EAAU,IACR,KAAK,OAAO,SAAS,EAAG,KAAK,IAAI,KAAK,OAAO,OAAQA,EAAU,MAAM,CAAC,CACxE,EACA,KAAK,KAAOD,EACZ,KAAK,OAASC,CAChB,CAEA,IAAI,QAAS,CACX,OAAO,KAAK,IACd,CAOA,OAAOC,EAAyB,CAC9B,OAAI,KAAK,OAASA,EAAM,KACf,GAEF,KAAK,OAAO,MAAM,CAACC,EAAMC,IAAMD,IAASD,EAAM,OAAOE,CAAC,CAAC,CAChE,CAKA,EAAE,OAAO,QAAQ,GAAI,CACnB,QAASA,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC7B,MAAM,KAAK,IAAIA,CAAC,CAEpB,CAKA,SAAU,CACR,IAAMC,EAAM,IAAI,MAAM,KAAK,IAAI,EAC/B,QAASD,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC7BC,EAAID,CAAC,EAAI,KAAK,IAAIA,CAAC,EAErB,OAAOC,CACT,CAMA,iBAAkB,CAChB,OAAO,IAAI,MAAM,KAAM,CACrB,IAAK,CAACC,EAAQC,IAAS,CACrB,GAAI,OAAOA,GAAS,UAAY,CAAC,MAAM,OAAOA,CAAI,CAAC,EAAG,CACpD,IAAMX,EAAQ,OAAOW,CAAI,EACzB,OAAOD,EAAO,IAAIV,CAAK,CACzB,CACA,OAAOU,EAAOC,CAA8B,CAC9C,EACA,IAAK,CAACD,EAAQC,EAAMV,IAAU,CAC5B,GAAI,OAAOU,GAAS,UAAY,CAAC,MAAM,OAAOA,CAAI,CAAC,EAAG,CACpD,IAAMX,EAAQ,OAAOW,CAAI,EACzBD,EAAO,IAAIV,EAAOC,CAAc,CAClC,MACES,EAAOC,CAAiD,EAAIV,EAG9D,MAAO,EACT,CACF,CAAC,CACH,CAMA,QACEW,EACA,CACA,QAASJ,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC7BI,EAAS,KAAK,IAAIJ,CAAC,EAAGA,EAAG,IAAI,CAEjC,CAMA,IACEI,EACA,CACA,IAAMC,EAAS,IAAI,MAAM,KAAK,IAAI,EAClC,QAASL,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC7BK,EAAOL,CAAC,EAAII,EAAS,KAAK,IAAIJ,CAAC,EAAGA,EAAG,IAAI,EAE3C,OAAOK,CACT,CAMA,OACED,EAKA,CACA,IAAMC,EAAoB,CAAC,EAC3B,QAASL,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAAK,CAClC,IAAMP,EAAQ,KAAK,IAAIO,CAAC,EACpBI,EAASX,EAAOO,EAAG,IAAI,GACzBK,EAAO,KAAKZ,CAAK,CAErB,CACA,OAAOY,CACT,CAMA,KACED,EAKA,CACA,QAASJ,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC7B,GAAII,EAAS,KAAK,IAAIJ,CAAC,EAAGA,EAAG,IAAI,EAC/B,MAAO,GAGX,MAAO,EACT,CAMA,MACEI,EAKA,CACA,QAASJ,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC7B,GAAI,CAACI,EAAS,KAAK,IAAIJ,CAAC,EAAGA,EAAG,IAAI,EAChC,MAAO,GAGX,MAAO,EACT,CAOA,OACEI,EAMAE,EACG,CACH,IAAIC,EAAcD,EAClB,QAASN,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC7BO,EAAcH,EAASG,EAAa,KAAK,IAAIP,CAAC,EAAGA,EAAG,IAAI,EAE1D,OAAOO,CACT,CAKA,UAAW,CACT,IAAIF,EAAS,GACb,QAASL,EAAI,EAAGA,EAAI,KAAK,KAAMA,IAC7BK,GAAU,KAAK,IAAIL,CAAC,EAAI,IAAM,IAEhC,OAAOK,CACT,CAKA,OAAO,WAAWZ,EAAe,CAC/B,IAAMe,EAAQ,IAAIlB,EAAiBG,EAAM,MAAM,EAC/C,QAASO,EAAI,EAAGA,EAAIP,EAAM,OAAQO,IAChCQ,EAAM,IAAIR,EAAGP,EAAMO,CAAC,GAAK,GAAG,EAE9B,OAAOQ,CACT,CAKA,OAAO,UAAUf,EAA6B,CAC5C,IAAMe,EAAQ,IAAIlB,EAAiBG,EAAM,MAAM,EAC/C,QAASO,EAAI,EAAGA,EAAIP,EAAM,OAAQO,IAChCQ,EAAM,IAAIR,EAAG,CAAC,CAACP,EAAMO,CAAC,CAAC,EAEzB,OAAOQ,CACT,CAKA,OAAO,KAAKf,EAAsC,CAChD,OAAI,OAAOA,GAAU,SACZH,EAAiB,WAAWG,CAAK,EAGnCH,EAAiB,UAAUG,CAAK,CACzC,CACF","names":["ERROR_OUT_OF_BOUNDS","FastBooleanArray","_FastBooleanArray","size","index","value","byteIndex","bitIndex","newSize","newBuffer","other","byte","i","arr","target","prop","callback","result","initialValue","accumulator","array"]}

package/package.json

@@ -1,50 +1,53 @@
-{
-  "name": "fast-boolean-array",
-  "version": "1.4.3",
-  "homepage": "https://github.com/UltraCakeBakery/FastBooleanArray",
-  "repository": {
-    "type": "git",
-    "url": "git+https://github.com/UltraCakeBakery/FastBooleanArray.git"
-  },
-  "bugs": {
-    "url": "https://github.com/UltraCakeBakery/FastBooleanArray/issues",
-    "email": "fast-boolean-array@managing.software"
-  },
-  "type": "module",
-  "main": "./dist/index.cjs",
-  "module": "./dist/index.js",
-  "types": "./dist/index.d.ts",
-  "exports": {
-    "import": {
-      "types": "./dist/index.d.ts",
-      "import": "./dist/index.js"
-    },
-    "require": {
-      "types": "./dist/index.d.cts",
-      "require": "./dist/index.cjs"
-    }
-  },
-  "scripts": {
-    "check": "npm run check:types",
-    "check:types": "npx --yes @arethetypeswrong/cli --pack .",
-    "build": "tsup src/index.ts --dts --format cjs,esm --clean --sourcemap --minify"
-  },
-  "keywords": [
-    "boolean",
-    "array",
-    "fast",
-    "efficient",
-    "map"
-  ],
-  "author": "Jack van der Bil  <jack@managing.software> (https://jackvanderbilt.nl)",
-  "license": "MIT",
-  "description": "",
-  "engines": {
-    "node": ">=0.10.3"
-  },
-  "devDependencies": {
-    "@types/node": "^22.10.2",
-    "tsup": "^8.3.5",
-    "typescript": "^5.7.2"
-  }
+{
+  "name": "fast-boolean-array",
+  "version": "1.4.4",
+  "homepage": "https://github.com/UltraCakeBakery/FastBooleanArray",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/UltraCakeBakery/FastBooleanArray.git"
+  },
+  "bugs": {
+    "url": "https://github.com/UltraCakeBakery/FastBooleanArray/issues",
+    "email": "fast-boolean-array@managing.software"
+  },
+  "type": "module",
+  "main": "./dist/index.cjs",
+  "module": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "exports": {
+    "import": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js"
+    },
+    "require": {
+      "types": "./dist/index.d.cts",
+      "require": "./dist/index.cjs"
+    }
+  },
+  "scripts": {
+    "check": "npm run check:types ; npm run check:test",
+    "check:test": "vitest",
+    "check:types": "npx --yes @arethetypeswrong/cli --pack .",
+    "build": "tsup src/index.ts --dts --format cjs,esm --clean --sourcemap --minify",
+    "publish": "npm publish"
+  },
+  "keywords": [
+    "boolean",
+    "array",
+    "fast",
+    "efficient",
+    "map"
+  ],
+  "author": "Jack van der Bil  <jack@managing.software> (https://jackvanderbilt.nl)",
+  "license": "MIT",
+  "description": "",
+  "engines": {
+    "node": ">=0.10.3"
+  },
+  "devDependencies": {
+    "@types/node": "^22.10.2",
+    "tsup": "^8.3.5",
+    "typescript": "^5.7.2",
+    "vitest": "^2.1.8"
+  }
 }