@orieg/expanse 0.3.0

package/LICENSE-APACHE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/LICENSE-MIT

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Nicolas Brousse
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,135 @@
+# @orieg/expanse (expanse-node)
+
+> Native Node.js, Bun, and Deno bindings for **Expanse**: clean-room, pure-Rust Judy arrays and 256-ary digital tries with optimistic concurrency control (OCC).
+
+[![npm version](https://img.shields.io/npm/v/@orieg/expanse.svg)](https://www.npmjs.com/package/@orieg/expanse)
+[![License](https://img.shields.io/badge/license-MIT%2FApache--2.0-blue.svg)](../../LICENSE-MIT)
+
+## Overview
+
+`@orieg/expanse` provides drop-in, zero-dependency, ultra-fast sparse data structures for JavaScript and TypeScript runtimes:
+
+- **`ExpanseSet`**: 64-bit unsigned integer set (compat: Judy1) with rank/select and range queries.
+- **`ExpanseMap`**: 64-bit integer key/value map (compat: JudyL).
+- **`ExpanseStrMap`**: Byte-lexicographically sorted string map (compat: JudySL) with prefix compression.
+- **`ExpanseBytesMap`**: Unordered map over arbitrary binary keys (including `\0` bytes) (compat: JudyHS).
+- **`ExpanseBlobMap`**: Polymorphic blob storage with inline value packing (≤ 7 bytes stored inline with 0 heap allocations), chunked slab arenas, in-place compaction, and mmap image persistence.
+- **`SyncExpanseMap` / `SyncExpanseSet`**: Thread-safe concurrent structures with optimistic concurrency control (OCC) and epoch-based memory reclamation.
+
+## Installation
+
+```bash
+npm install @orieg/expanse
+# or
+bun add @orieg/expanse
+# or
+pnpm add @orieg/expanse
+```
+
+## Quick Start
+
+### 64-bit Integer Set (`ExpanseSet`)
+
+```typescript
+import { ExpanseSet } from '@orieg/expanse';
+
+const set = new ExpanseSet();
+set.add(42n);
+set.add(100n);
+set.add(500n);
+
+console.log(set.has(42n)); // true
+console.log(set.size());   // 3n
+
+// Rank / Select
+console.log(set.rank(100n)); // 1n (1 element strictly < 100)
+console.log(set.select(0n));  // 42n (0-th element)
+
+// Navigation
+console.log(set.next(42n));  // 100n
+console.log(set.prev(500n)); // 100n
+
+// Range queries
+console.log(set.countRange(40n, 200n)); // 2n
+console.log(set.range(40n, 200n));      // [42n, 100n]
+```
+
+### 64-bit Integer Map (`ExpanseMap`)
+
+```typescript
+import { ExpanseMap } from '@orieg/expanse';
+
+const map = new ExpanseMap();
+map.set(100n, 9999n);
+map.set(200n, 8888n);
+
+console.log(map.get(100n)); // 9999n
+console.log(map.first());   // { key: 100n, value: 9999n }
+```
+
+### Prefix-Compressed String Map (`ExpanseStrMap`)
+
+```typescript
+import { ExpanseStrMap } from '@orieg/expanse';
+
+const strmap = new ExpanseStrMap();
+strmap.set('apple', 1n);
+strmap.set('banana', 2n);
+strmap.set('cherry', 3n);
+
+console.log(strmap.get('banana')); // 2n
+console.log(strmap.first());        // { key: 'apple', value: 1n }
+console.log(strmap.next('apple'));  // { key: 'banana', value: 2n }
+```
+
+### Arbitrary Binary Map (`ExpanseBytesMap`)
+
+```typescript
+import { ExpanseBytesMap } from '@orieg/expanse';
+
+const bytesmap = new ExpanseBytesMap();
+const binaryKey = Buffer.from([0x00, 0x01, 0x02, 0xff]);
+bytesmap.set(binaryKey, 42n);
+
+console.log(bytesmap.get(binaryKey)); // 42n
+```
+
+### High-Performance Blob Map (`ExpanseBlobMap`)
+
+```typescript
+import { ExpanseBlobMap } from '@orieg/expanse';
+
+const blobmap = new ExpanseBlobMap();
+
+// Short payloads (<= 7 bytes) are stored inline in the value slot (0 heap allocations)
+blobmap.set(1n, Buffer.from('inline'), 10 /* 32-bit hot metadata */);
+
+// Larger payloads are allocated in contiguous slab arenas
+blobmap.set(2n, Buffer.from('large payload allocated in slab arena'), 20);
+
+// Lookup with metadata
+const res = blobmap.getWithMeta(1n);
+console.log(res);
+// { payload: <Buffer 69 6e 6c 69 6e 65>, hotMeta: 10, isInline: true }
+
+// Prune based on hot metadata
+blobmap.prune((key, hotMeta) => hotMeta > 15);
+
+// Relocatable binary image persistence
+blobmap.saveImage('./data.expanse');
+const reloaded = ExpanseBlobMap.openImage('./data.expanse');
+```
+
+### Concurrent Structures (`SyncExpanseMap` / `SyncExpanseSet`)
+
+```typescript
+import { SyncExpanseMap, SyncExpanseSet } from '@orieg/expanse';
+
+const syncMap = new SyncExpanseMap();
+syncMap.set(1000n, 42n);
+console.log(syncMap.get(1000n)); // 42n
+```
+
+## License
+
+Dual-licensed under MIT and Apache-2.0.

package/index.d.ts

@@ -0,0 +1,520 @@
+/**
+ * @orieg/expanse — Clean-room, pure-Rust modern Judy arrays and digital tries for Node.js, Bun, and Deno.
+ */
+
+export type KeyInput = bigint | number;
+export type BytesInput = Buffer | Uint8Array | string;
+
+/**
+ * Key-value pair with 64-bit unsigned integer key and value.
+ */
+export interface MapEntry {
+  key: bigint;
+  value: bigint;
+}
+
+/**
+ * Key-value pair with string key and 64-bit unsigned integer value.
+ */
+export interface StrMapEntry {
+  key: string;
+  value: bigint;
+}
+
+/**
+ * Key-value pair with byte Buffer key and 64-bit unsigned integer value.
+ */
+export interface BytesMapEntry {
+  key: Buffer;
+  value: bigint;
+}
+
+/**
+ * Metadata and payload returned by BlobMap lookup.
+ */
+export interface BlobMetaResult {
+  /** The blob payload bytes as a Node Buffer. */
+  payload: Buffer;
+  /** 32-bit hot metadata word stored directly in the trie index. */
+  hotMeta: number;
+  /** True if the payload was stored inline in the 64-bit value slot (≤ 7 bytes). */
+  isInline: boolean;
+}
+
+/**
+ * Compaction statistics returned by BlobMap in-place garbage collection.
+ */
+export interface CompactionStatsResult {
+  /** Live payload bytes before compaction. */
+  liveBytesBefore: bigint;
+  /** Live payload bytes after compaction. */
+  liveBytesAfter: bigint;
+  /** Total arena bytes allocated before compaction. */
+  totalAllocatedBefore: bigint;
+  /** Total arena bytes allocated after compaction. */
+  totalAllocatedAfter: bigint;
+}
+
+/**
+ * A sparse, dynamic 64-bit unsigned integer set (compat: Judy1).
+ */
+export class ExpanseSet {
+  /**
+   * Creates an empty set, optionally initialized from an array of keys.
+   */
+  constructor(keys?: KeyInput[]);
+
+  /**
+   * Number of elements in the set.
+   */
+  size(): bigint;
+
+  /**
+   * Returns true if the set contains no elements.
+   */
+  isEmpty(): boolean;
+
+  /**
+   * Checks whether `key` is present in the set.
+   */
+  has(key: KeyInput): boolean;
+
+  /**
+   * Inserts `key` into the set. Returns true if newly inserted, false if already present.
+   */
+  add(key: KeyInput): boolean;
+
+  /**
+   * Removes `key` from the set. Returns true if present, false otherwise.
+   */
+  remove(key: KeyInput): boolean;
+
+  /**
+   * Removes all elements from the set.
+   */
+  clear(): void;
+
+  /**
+   * Returns heap bytes used by trie node allocations.
+   */
+  memUsed(): bigint;
+
+  /**
+   * Returns the smallest element in the set, or null if empty.
+   */
+  first(): bigint | null;
+
+  /**
+   * Returns the largest element in the set, or null if empty.
+   */
+  last(): bigint | null;
+
+  /**
+   * Returns the smallest element strictly > key (or >= key if inclusive is true), or null.
+   */
+  next(key: KeyInput, inclusive?: boolean): bigint | null;
+
+  /**
+   * Returns the largest element strictly < key (or <= key if inclusive is true), or null.
+   */
+  prev(key: KeyInput, inclusive?: boolean): bigint | null;
+
+  /**
+   * Returns the number of keys strictly below `key` (0-based rank).
+   */
+  rank(key: KeyInput): bigint;
+
+  /**
+   * Selects the element with `k` keys below it (0-based select), or null if out of bounds.
+   */
+  select(k: KeyInput): bigint | null;
+
+  /**
+   * Counts the number of keys in the closed range `[start, end]`.
+   */
+  countRange(start: KeyInput, end: KeyInput): bigint;
+
+  /**
+   * Scans keys in the range `[start, end]`.
+   */
+  range(start?: KeyInput, end?: KeyInput, inclusive?: boolean): bigint[];
+
+  /**
+   * Returns all keys in ascending order as an array of BigInts.
+   */
+  toArray(): bigint[];
+
+  /**
+   * Ingests an array of integer keys. Returns the count of newly inserted keys.
+   */
+  insertMany(keys: KeyInput[]): number;
+}
+
+/**
+ * A sparse, dynamic 64-bit unsigned integer key/value map (compat: JudyL).
+ */
+export class ExpanseMap {
+  constructor();
+
+  /**
+   * Number of entries in the map.
+   */
+  size(): bigint;
+
+  /**
+   * Returns true if the map contains no entries.
+   */
+  isEmpty(): boolean;
+
+  /**
+   * Checks whether `key` is present in the map.
+   */
+  has(key: KeyInput): boolean;
+
+  /**
+   * Sets `map[key] = value`. Returns the previous value as BigInt if present, or null.
+   */
+  set(key: KeyInput, value: KeyInput): bigint | null;
+
+  /**
+   * Retrieves the value for `key`, or null if absent.
+   */
+  get(key: KeyInput): bigint | null;
+
+  /**
+   * Deletes `key` from the map. Returns true if present, false otherwise.
+   */
+  delete(key: KeyInput): boolean;
+
+  /**
+   * Removes all entries from the map.
+   */
+  clear(): void;
+
+  /**
+   * Returns heap bytes used by trie node allocations.
+   */
+  memUsed(): bigint;
+
+  /**
+   * Smallest entry (key, value) in the map, or null if empty.
+   */
+  first(): MapEntry | null;
+
+  /**
+   * Largest entry (key, value) in the map, or null if empty.
+   */
+  last(): MapEntry | null;
+
+  /**
+   * Smallest entry with key > key (or >= key if inclusive is true), or null.
+   */
+  next(key: KeyInput, inclusive?: boolean): MapEntry | null;
+
+  /**
+   * Largest entry with key < key (or <= key if inclusive is true), or null.
+   */
+  prev(key: KeyInput, inclusive?: boolean): MapEntry | null;
+
+  /**
+   * Number of keys strictly below `key` (0-based rank).
+   */
+  rank(key: KeyInput): bigint;
+
+  /**
+   * Entry with `k` keys below it (0-based select), or null if out of bounds.
+   */
+  select(k: KeyInput): MapEntry | null;
+
+  /**
+   * Counts the number of keys in the closed range `[start, end]`.
+   */
+  countRange(start: KeyInput, end: KeyInput): bigint;
+
+  /**
+   * Returns all keys in ascending order.
+   */
+  keys(): bigint[];
+
+  /**
+   * Returns all values in key-ascending order.
+   */
+  values(): bigint[];
+
+  /**
+   * Returns all key-value entries in ascending order.
+   */
+  entries(): MapEntry[];
+
+  /**
+   * Scans entries in the range `[start, end]`.
+   */
+  range(start?: KeyInput, end?: KeyInput, inclusive?: boolean): MapEntry[];
+}
+
+/**
+ * A sorted map from NUL-free UTF-8 strings to 64-bit unsigned integers (compat: JudySL).
+ */
+export class ExpanseStrMap {
+  constructor();
+
+  /**
+   * Number of strings in the map.
+   */
+  size(): bigint;
+
+  /**
+   * Returns true if the map contains no strings.
+   */
+  isEmpty(): boolean;
+
+  /**
+   * Checks whether `key` is present in the map.
+   */
+  has(key: string): boolean;
+
+  /**
+   * Sets `map[key] = value`. Returns previous value if present, or null.
+   */
+  set(key: string, value: KeyInput): bigint | null;
+
+  /**
+   * Retrieves value for `key`, or null if absent.
+   */
+  get(key: string): bigint | null;
+
+  /**
+   * Deletes `key` from the map. Returns true if present, false otherwise.
+   */
+  delete(key: string): boolean;
+
+  /**
+   * Removes all strings and frees trie nodes.
+   */
+  clear(): void;
+
+  /**
+   * Heap bytes used by the prefix trie.
+   */
+  memUsed(): bigint;
+
+  /**
+   * Smallest entry in byte-lexicographical order, or null if empty.
+   */
+  first(): StrMapEntry | null;
+
+  /**
+   * Largest entry in byte-lexicographical order, or null if empty.
+   */
+  last(): StrMapEntry | null;
+
+  /**
+   * Smallest entry with key > key (or >= key if inclusive is true), or null.
+   */
+  next(key: string, inclusive?: boolean): StrMapEntry | null;
+
+  /**
+   * Largest entry with key < key (or <= key if inclusive is true), or null.
+   */
+  prev(key: string, inclusive?: boolean): StrMapEntry | null;
+
+  /**
+   * Returns all keys in byte-lexicographical order.
+   */
+  keys(): string[];
+
+  /**
+   * Returns all values in key order.
+   */
+  values(): bigint[];
+
+  /**
+   * Returns all key-value entries in byte-lexicographical order.
+   */
+  entries(): StrMapEntry[];
+}
+
+/**
+ * A sparse, dynamic map from arbitrary byte keys (including NUL bytes) to 64-bit unsigned integers (compat: JudyHS).
+ */
+export class ExpanseBytesMap {
+  constructor();
+
+  /**
+   * Number of entries stored in the map.
+   */
+  size(): bigint;
+
+  /**
+   * Returns true if the map is empty.
+   */
+  isEmpty(): boolean;
+
+  /**
+   * Checks whether `key` exists in the map.
+   */
+  has(key: BytesInput): boolean;
+
+  /**
+   * Sets `map[key] = value`. Returns previous value if present, or null.
+   */
+  set(key: BytesInput, value: KeyInput): bigint | null;
+
+  /**
+   * Retrieves value for `key`, or null if absent.
+   */
+  get(key: BytesInput): bigint | null;
+
+  /**
+   * Deletes `key` from the map. Returns true if present, false otherwise.
+   */
+  delete(key: BytesInput): boolean;
+
+  /**
+   * Removes all entries and releases memory.
+   */
+  clear(): void;
+
+  /**
+   * Heap bytes used by hash trie and buckets.
+   */
+  memUsed(): bigint;
+
+  /**
+   * Returns all byte keys as Node Buffers.
+   */
+  keys(): Buffer[];
+
+  /**
+   * Returns all values.
+   */
+  values(): bigint[];
+
+  /**
+   * Returns all key-value entries.
+   */
+  entries(): BytesMapEntry[];
+}
+
+/**
+ * A high-performance map from 64-bit integer keys to arbitrary-length byte payloads
+ * backed by inline polymorphic 64-bit value slots and chunked slab arenas.
+ */
+export class ExpanseBlobMap {
+  /**
+   * Creates an empty blob map, optionally with custom arena chunk size in bytes.
+   */
+  constructor(chunkSize?: number);
+
+  /**
+   * Number of entries in the blob map.
+   */
+  size(): bigint;
+
+  /**
+   * Returns true if the map contains no entries.
+   */
+  isEmpty(): boolean;
+
+  /**
+   * Checks whether `key` exists in the map.
+   */
+  has(key: KeyInput): boolean;
+
+  /**
+   * Inserts a key-blob pair with optional 32-bit hot metadata.
+   */
+  set(key: KeyInput, payload: BytesInput, hotMeta?: number): void;
+
+  /**
+   * Retrieves only the byte payload for `key`, or null if absent.
+   */
+  get(key: KeyInput): Buffer | null;
+
+  /**
+   * Retrieves `{ payload: Buffer, hotMeta: number, isInline: boolean }` for `key`, or null if absent.
+   */
+  getWithMeta(key: KeyInput): BlobMetaResult | null;
+
+  /**
+   * Deletes `key` from the map. Returns true if present, false otherwise.
+   */
+  delete(key: KeyInput): boolean;
+
+  /**
+   * Removes all entries and resets the slab arena.
+   */
+  clear(): void;
+
+  /**
+   * Returns total heap memory used by index and slab arena.
+   */
+  memUsed(): bigint;
+
+  /**
+   * Evaluates `predicate(key, hotMeta)` and deletes matching keys. Returns count of pruned entries.
+   */
+  prune(predicate: (key: bigint, hotMeta: number) => boolean): number;
+
+  /**
+   * Runs in-place garbage collection and compaction, returning memory statistics.
+   */
+  compact(): CompactionStatsResult;
+
+  /**
+   * Saves the map to a relocatable binary image file. Returns bytes written.
+   */
+  saveImage(path: string): number;
+
+  /**
+   * Loads a map from a relocatable binary image file.
+   */
+  static openImage(path: string, mmap?: boolean): ExpanseBlobMap;
+}
+
+/**
+ * A thread-safe concurrent 64-bit integer map with optimistic concurrency control (OCC).
+ */
+export class SyncExpanseMap {
+  constructor();
+
+  size(): bigint;
+  isEmpty(): boolean;
+  has(key: KeyInput): boolean;
+  set(key: KeyInput, value: KeyInput): bigint | null;
+  get(key: KeyInput): bigint | null;
+  delete(key: KeyInput): boolean;
+  clear(): void;
+  first(): MapEntry | null;
+  last(): MapEntry | null;
+  next(key: KeyInput, inclusive?: boolean): MapEntry | null;
+  prev(key: KeyInput, inclusive?: boolean): MapEntry | null;
+  rank(key: KeyInput): bigint;
+  select(k: KeyInput): MapEntry | null;
+  countRange(start: KeyInput, end: KeyInput): bigint;
+  keys(): bigint[];
+  values(): bigint[];
+  entries(): MapEntry[];
+}
+
+/**
+ * A thread-safe concurrent 64-bit integer set with optimistic concurrency control (OCC).
+ */
+export class SyncExpanseSet {
+  constructor();
+
+  size(): bigint;
+  isEmpty(): boolean;
+  has(key: KeyInput): boolean;
+  add(key: KeyInput): boolean;
+  remove(key: KeyInput): boolean;
+  clear(): void;
+  first(): bigint | null;
+  last(): bigint | null;
+  next(key: KeyInput, inclusive?: boolean): bigint | null;
+  prev(key: KeyInput, inclusive?: boolean): bigint | null;
+  rank(key: KeyInput): bigint;
+  select(k: KeyInput): bigint | null;
+  countRange(start: KeyInput, end: KeyInput): bigint;
+  toArray(): bigint[];
+}

package/index.js

@@ -0,0 +1,36 @@
+const path = require('path');
+const fs = require('fs');
+
+function loadBinding() {
+  const candidates = [
+    path.join(__dirname, 'index.node'),
+    path.join(__dirname, 'expanse-node.node'),
+    path.join(__dirname, '../../target/release/libexpanse_node.dylib'),
+    path.join(__dirname, '../../target/release/libexpanse_node.so'),
+    path.join(__dirname, '../../target/release/expanse_node.dll'),
+    path.join(__dirname, '../../target/debug/libexpanse_node.dylib'),
+    path.join(__dirname, '../../target/debug/libexpanse_node.so'),
+    path.join(__dirname, '../../target/debug/expanse_node.dll'),
+  ];
+
+  for (const candidate of candidates) {
+    if (fs.existsSync(candidate)) {
+      try {
+        if (candidate.endsWith('.node')) {
+          return require(candidate);
+        }
+        const mod = { exports: {} };
+        process.dlopen(mod, candidate);
+        return mod.exports;
+      } catch (err) {
+        // try next candidate
+      }
+    }
+  }
+
+  throw new Error(
+    'Failed to load @orieg/expanse native addon. Please build with `cargo build -p expanse-node`.'
+  );
+}
+
+module.exports = loadBinding();

package/package.json

@@ -0,0 +1,44 @@
+{
+  "name": "@orieg/expanse",
+  "version": "0.3.0",
+  "description": "Clean-room, pure-Rust modern Judy arrays and digital tries with cache-line-tuned node geometries, inline value packing, slab arenas, and OCC concurrency for Node.js, Bun, and Deno.",
+  "main": "index.js",
+  "types": "index.d.ts",
+  "files": [
+    "index.js",
+    "index.d.ts",
+    "index.node",
+    "README.md",
+    "LICENSE-MIT",
+    "LICENSE-APACHE"
+  ],
+  "scripts": {
+    "test": "node test.js",
+    "build": "cargo build --release -p expanse-node",
+    "build:debug": "cargo build -p expanse-node"
+  },
+  "keywords": [
+    "judy",
+    "judy-array",
+    "trie",
+    "radix-tree",
+    "sparse-set",
+    "sparse-map",
+    "napi",
+    "occ",
+    "concurrency",
+    "high-performance",
+    "data-structures"
+  ],
+  "author": "Nicolas Brousse <nicolas@brousse.info>",
+  "license": "MIT OR Apache-2.0",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/orieg/expanse.git",
+    "directory": "crates/expanse-node"
+  },
+  "homepage": "https://github.com/orieg/expanse",
+  "engines": {
+    "node": ">= 20.0.0"
+  }
+}