@thi.ng/bidir-index 1.1.0

package/CHANGELOG.md

@@ -0,0 +1,17 @@
+# Change Log
+
+- **Last updated**: 2024-07-22T13:15:57Z
+- **Generator**: [thi.ng/monopub](https://thi.ng/monopub)
+
+All notable changes to this project will be documented in this file.
+See [Conventional Commits](https://conventionalcommits.org/) for commit guidelines.
+
+**Note:** Unlisted _patch_ versions only involve non-code or otherwise excluded changes
+and/or version bumps of transitive dependencies.
+
+## [1.1.0](https://github.com/thi-ng/umbrella/tree/@thi.ng/bidir-index@1.1.0) (2024-07-22)
+
+#### 🚀 Features
+
+- import as new package ([#486](https://github.com/thi-ng/umbrella/issues/486)) ([a047796](https://github.com/thi-ng/umbrella/commit/a047796))
+  - extract `BidirIndex` from [@thi.ng/associative](https://github.com/thi-ng/umbrella/tree/main/packages/associative)

package/LICENSE

@@ -0,0 +1,201 @@
+                                 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/README.md

@@ -0,0 +1,98 @@
+<!-- This file is generated - DO NOT EDIT! -->
+<!-- Please see: https://github.com/thi-ng/umbrella/blob/develop/CONTRIBUTING.md#changes-to-readme-files -->
+# ![@thi.ng/bidir-index](https://media.thi.ng/umbrella/banners-20230807/thing-bidir-index.svg?8640f413)
+
+[![npm version](https://img.shields.io/npm/v/@thi.ng/bidir-index.svg)](https://www.npmjs.com/package/@thi.ng/bidir-index)
+![npm downloads](https://img.shields.io/npm/dm/@thi.ng/bidir-index.svg)
+[![Mastodon Follow](https://img.shields.io/mastodon/follow/109331703950160316?domain=https%3A%2F%2Fmastodon.thi.ng&style=social)](https://mastodon.thi.ng/@toxi)
+
+> [!NOTE]
+> This is one of 198 standalone projects, maintained as part
+> of the [@thi.ng/umbrella](https://github.com/thi-ng/umbrella/) monorepo
+> and anti-framework.
+>
+> 🚀 Please help me to work full-time on these projects by [sponsoring me on
+> GitHub](https://github.com/sponsors/postspectacular). Thank you! ❤️
+
+- [About](#about)
+- [Status](#status)
+- [Related packages](#related-packages)
+- [Installation](#installation)
+- [Dependencies](#dependencies)
+- [API](#api)
+- [Authors](#authors)
+- [License](#license)
+
+## About
+
+Bi-directional index mapping arbitrary keys to numeric IDs & vice versa.
+
+This package contains functionality which was previously part of and has been
+extracted from the [@thi.ng/associative](https://thi.ng/associative) package.
+
+## Status
+
+**STABLE** - used in production
+
+[Search or submit any issues for this package](https://github.com/thi-ng/umbrella/issues?q=%5Bbidir-index%5D+in%3Atitle)
+
+## Related packages
+
+- [@thi.ng/associative](https://github.com/thi-ng/umbrella/tree/develop/packages/associative) - ES Map/Set-compatible implementations with customizable equality semantics & supporting operations
+
+## Installation
+
+```bash
+yarn add @thi.ng/bidir-index
+```
+
+ESM import:
+
+```ts
+import * as bi from "@thi.ng/bidir-index";
+```
+
+Browser ESM import:
+
+```html
+<script type="module" src="https://esm.run/@thi.ng/bidir-index"></script>
+```
+
+[JSDelivr documentation](https://www.jsdelivr.com/)
+
+For Node.js REPL:
+
+```js
+const bi = await import("@thi.ng/bidir-index");
+```
+
+Package sizes (brotli'd, pre-treeshake): ESM: 657 bytes
+
+## Dependencies
+
+None
+
+## API
+
+[Generated API docs](https://docs.thi.ng/umbrella/bidir-index/)
+
+TODO
+
+## Authors
+
+- [Karsten Schmidt](https://thi.ng)
+
+If this project contributes to an academic publication, please cite it as:
+
+```bibtex
+@misc{thing-bidir-index,
+  title = "@thi.ng/bidir-index",
+  author = "Karsten Schmidt",
+  note = "https://thi.ng/bidir-index",
+  year = 2022
+}
+```
+
+## License
+
+&copy; 2022 - 2024 Karsten Schmidt // Apache License 2.0

package/index.d.ts

@@ -0,0 +1,151 @@
+export interface SerializedBidirIndex<T> {
+    pairs: [T, number][];
+    nextID: number;
+}
+export interface BidirIndexOpts<T> {
+    /**
+     * Custom `key -> id` map implementation (e.g. {@link EquivMap} or
+     * {@link HashMap}). If omitted, a native JS `Map` will be used.
+     */
+    map: Map<T, number>;
+    /**
+     * Start ID for indexing new keys.
+     *
+     * @defaultValue 0
+     */
+    start: number;
+}
+/**
+ * Bi-directional index to map arbitrary keys to numeric IDs and vice versa.
+ */
+export declare class BidirIndex<T> {
+    fwd: Map<T, number>;
+    rev: Map<number, T>;
+    nextID: number;
+    constructor(keys?: Iterable<T> | null, opts?: Partial<BidirIndexOpts<T>>);
+    get size(): number;
+    /**
+     * Yields same result as {@link BidirIndex.entries}.
+     */
+    [Symbol.iterator](): IterableIterator<[T, number]>;
+    /**
+     * Returns iterator of `[key,id]` pairs.
+     */
+    entries(): IterableIterator<[T, number]>;
+    /**
+     * Returns iterator of all indexed keys.
+     */
+    keys(): IterableIterator<T>;
+    /**
+     * Returns iterator of all indexed IDs.
+     */
+    values(): IterableIterator<number>;
+    /**
+     * Returns true if given `key` is known/indexed.
+     *
+     * @param key
+     */
+    has(key: T): boolean;
+    /**
+     * Returns true if given `id` has a corresponding known/indexed key.
+     *
+     * @param id
+     */
+    hasID(id: number): boolean;
+    /**
+     * Reverse lookup of {@link BidirIndex.getID}. Returns the matching ID for
+     * given `key` or undefined if the key is not known.
+     *
+     * @param key
+     */
+    get(key: T): number | undefined;
+    /**
+     * Reverse lookup of {@link BidirIndex.get}. Returns the matching key for
+     * given `id` or undefined if the ID is not known.
+     *
+     * @param id
+     */
+    getID(id: number): T | undefined;
+    /**
+     * Indexes given `key` and assigns & returns a new ID. If `key` is already
+     * known/indexed, returns its existing ID.
+     *
+     * @param key
+     */
+    add(key: T): number;
+    /**
+     * Batch version of {@link BidirIndex.add}. Indexes all given keys and
+     * returns array of their corresponding IDs.
+     *
+     * @param keys
+     */
+    addAll(keys: Iterable<T>): number[];
+    /**
+     * Removes bi-directional mapping for given `key` from the index. Returns
+     * true if successful.
+     *
+     * @param key
+     */
+    delete(key: T): boolean;
+    /**
+     * Removes bi-directional mapping for given `id` from the index. Returns
+     * true if successful.
+     *
+     * @param id
+     */
+    deleteID(id: number): boolean;
+    /**
+     * Batch version of {@link BidirIndex.delete}.
+     *
+     * @param keys
+     */
+    deleteAll(keys: Iterable<T>): void;
+    /**
+     * Batch version of {@link BidirIndex.deleteID}.
+     *
+     * @param ids
+     */
+    deleteAllIDs(ids: Iterable<number>): void;
+    /**
+     * Returns array of IDs for all given keys. If `fail` is true (default:
+     * false), throws error if any of the given keys is unknown/unindexed (use
+     * {@link BidirIndex.add} or {@link BidirIndex.addAll} first).
+     *
+     * @param keys
+     * @param fail
+     */
+    getAll(keys: Iterable<T>, fail?: boolean): number[];
+    /**
+     * Returns array of matching keys for all given IDs. If `fail` is true
+     * (default: false), throws error if any of the given IDs is
+     * unknown/unindexed (use {@link BidirIndex.add} or
+     * {@link BidirIndex.addAll} first).
+     *
+     * @param ids
+     * @param fail
+     */
+    getAllIDs(ids: Iterable<number>, fail?: boolean): T[];
+    /**
+     * Returns a compact JSON serializable version of the index. Use
+     * {@link bidirIndexFromJSON} to instantiate an index from such a JSON
+     * serialization.
+     */
+    toJSON(): SerializedBidirIndex<T>;
+}
+/**
+ * Factory function wrapper for {@link BidirIndex}.
+ *
+ * @param keys
+ * @param opts
+ */
+export declare const defBidirIndex: <T>(keys?: Iterable<T>, opts?: Partial<BidirIndexOpts<T>>) => BidirIndex<T>;
+/**
+ * Instantiates a {@link BidirIndex} from given JSON serialization. The optional
+ * `map` arg can be used to provide a customized `key -> id` map implementation
+ * (same use as {@link BidirIndexOpts.map}).
+ *
+ * @param src
+ * @param map
+ */
+export declare const bidirIndexFromJSON: <T>(src: string | SerializedBidirIndex<T>, map?: Map<T, number>) => BidirIndex<T>;
+//# sourceMappingURL=index.d.ts.map

package/index.js

@@ -0,0 +1,204 @@
+class BidirIndex {
+  fwd;
+  rev;
+  nextID;
+  constructor(keys, opts = {}) {
+    this.nextID = opts.start || 0;
+    this.fwd = opts.map || /* @__PURE__ */ new Map();
+    this.rev = /* @__PURE__ */ new Map();
+    keys && this.addAll(keys);
+  }
+  get size() {
+    return this.fwd.size;
+  }
+  /**
+   * Yields same result as {@link BidirIndex.entries}.
+   */
+  [Symbol.iterator]() {
+    return this.entries();
+  }
+  /**
+   * Returns iterator of `[key,id]` pairs.
+   */
+  entries() {
+    return this.fwd.entries();
+  }
+  /**
+   * Returns iterator of all indexed keys.
+   */
+  keys() {
+    return this.fwd.keys();
+  }
+  /**
+   * Returns iterator of all indexed IDs.
+   */
+  values() {
+    return this.fwd.values();
+  }
+  /**
+   * Returns true if given `key` is known/indexed.
+   *
+   * @param key
+   */
+  has(key) {
+    return this.fwd.has(key);
+  }
+  /**
+   * Returns true if given `id` has a corresponding known/indexed key.
+   *
+   * @param id
+   */
+  hasID(id) {
+    return this.rev.has(id);
+  }
+  /**
+   * Reverse lookup of {@link BidirIndex.getID}. Returns the matching ID for
+   * given `key` or undefined if the key is not known.
+   *
+   * @param key
+   */
+  get(key) {
+    return this.fwd.get(key);
+  }
+  /**
+   * Reverse lookup of {@link BidirIndex.get}. Returns the matching key for
+   * given `id` or undefined if the ID is not known.
+   *
+   * @param id
+   */
+  getID(id) {
+    return this.rev.get(id);
+  }
+  /**
+   * Indexes given `key` and assigns & returns a new ID. If `key` is already
+   * known/indexed, returns its existing ID.
+   *
+   * @param key
+   */
+  add(key) {
+    let id = this.fwd.get(key);
+    if (id === void 0) {
+      this.fwd.set(key, this.nextID);
+      this.rev.set(this.nextID, key);
+      id = this.nextID++;
+    }
+    return id;
+  }
+  /**
+   * Batch version of {@link BidirIndex.add}. Indexes all given keys and
+   * returns array of their corresponding IDs.
+   *
+   * @param keys
+   */
+  addAll(keys) {
+    const res = [];
+    for (let k of keys) {
+      res.push(this.add(k));
+    }
+    return res;
+  }
+  /**
+   * Removes bi-directional mapping for given `key` from the index. Returns
+   * true if successful.
+   *
+   * @param key
+   */
+  delete(key) {
+    return __delete(this.fwd, this.rev, key);
+  }
+  /**
+   * Removes bi-directional mapping for given `id` from the index. Returns
+   * true if successful.
+   *
+   * @param id
+   */
+  deleteID(id) {
+    return __delete(this.rev, this.fwd, id);
+  }
+  /**
+   * Batch version of {@link BidirIndex.delete}.
+   *
+   * @param keys
+   */
+  deleteAll(keys) {
+    for (let k of keys) this.delete(k);
+  }
+  /**
+   * Batch version of {@link BidirIndex.deleteID}.
+   *
+   * @param ids
+   */
+  deleteAllIDs(ids) {
+    for (let id of ids) this.deleteID(id);
+  }
+  /**
+   * Returns array of IDs for all given keys. If `fail` is true (default:
+   * false), throws error if any of the given keys is unknown/unindexed (use
+   * {@link BidirIndex.add} or {@link BidirIndex.addAll} first).
+   *
+   * @param keys
+   * @param fail
+   */
+  getAll(keys, fail = false) {
+    return __iterate(this.fwd, keys, fail);
+  }
+  /**
+   * Returns array of matching keys for all given IDs. If `fail` is true
+   * (default: false), throws error if any of the given IDs is
+   * unknown/unindexed (use {@link BidirIndex.add} or
+   * {@link BidirIndex.addAll} first).
+   *
+   * @param ids
+   * @param fail
+   */
+  getAllIDs(ids, fail = false) {
+    return __iterate(this.rev, ids, fail);
+  }
+  /**
+   * Returns a compact JSON serializable version of the index. Use
+   * {@link bidirIndexFromJSON} to instantiate an index from such a JSON
+   * serialization.
+   */
+  toJSON() {
+    return {
+      pairs: [...this.entries()],
+      nextID: this.nextID
+    };
+  }
+}
+const __delete = (fwd, rev, key) => {
+  const val = fwd.get(key);
+  if (val !== void 0) {
+    fwd.delete(key);
+    rev.delete(val);
+    return true;
+  }
+  return false;
+};
+const __iterate = (index, keys, fail) => {
+  const res = [];
+  for (let k of keys) {
+    const val = index.get(k);
+    if (val === void 0) {
+      if (fail) throw new Error(`unknwon key/ID: ${k}`);
+    } else {
+      res.push(val);
+    }
+  }
+  return res;
+};
+const defBidirIndex = (keys, opts) => new BidirIndex(keys, opts);
+const bidirIndexFromJSON = (src, map) => {
+  const $src = typeof src === "string" ? JSON.parse(src) : src;
+  const res = new BidirIndex(null, { map, start: $src.nextID });
+  $src.pairs.forEach(([k, id]) => {
+    res.fwd.set(k, id);
+    res.rev.set(id, k);
+  });
+  return res;
+};
+export {
+  BidirIndex,
+  bidirIndexFromJSON,
+  defBidirIndex
+};

package/package.json

@@ -0,0 +1,80 @@
+{
+  "name": "@thi.ng/bidir-index",
+  "version": "1.1.0",
+  "description": "Bi-directional index mapping arbitrary keys to numeric IDs & vice versa",
+  "type": "module",
+  "module": "./index.js",
+  "typings": "./index.d.ts",
+  "sideEffects": false,
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/thi-ng/umbrella.git"
+  },
+  "homepage": "https://thi.ng/bidir-index",
+  "funding": [
+    {
+      "type": "github",
+      "url": "https://github.com/sponsors/postspectacular"
+    },
+    {
+      "type": "patreon",
+      "url": "https://patreon.com/thing_umbrella"
+    }
+  ],
+  "author": "Karsten Schmidt (https://thi.ng)",
+  "license": "Apache-2.0",
+  "scripts": {
+    "build": "yarn build:esbuild && yarn build:decl",
+    "build:decl": "tsc --declaration --emitDeclarationOnly",
+    "build:esbuild": "esbuild --format=esm --platform=neutral --target=es2022 --tsconfig=tsconfig.json --outdir=. src/**/*.ts",
+    "clean": "bun ../../tools/src/clean-package.ts",
+    "doc": "typedoc --excludePrivate --excludeInternal --out doc src/index.ts",
+    "doc:ae": "mkdir -p .ae/doc .ae/temp && api-extractor run --local --verbose",
+    "doc:readme": "bun ../../tools/src/module-stats.ts && bun ../../tools/src/readme.ts",
+    "pub": "yarn npm publish --access public",
+    "test": "bun test",
+    "tool:tangle": "../../node_modules/.bin/tangle src/**/*.ts"
+  },
+  "devDependencies": {
+    "@microsoft/api-extractor": "^7.47.0",
+    "esbuild": "^0.23.0",
+    "typedoc": "^0.26.3",
+    "typescript": "^5.5.3"
+  },
+  "keywords": [
+    "datastructure",
+    "bidirectional",
+    "identifier",
+    "invert",
+    "iterator",
+    "keys",
+    "map",
+    "typescript"
+  ],
+  "publishConfig": {
+    "access": "public"
+  },
+  "browser": {
+    "process": false,
+    "setTimeout": false
+  },
+  "engines": {
+    "node": ">=18"
+  },
+  "files": [
+    "./*.js",
+    "./*.d.ts"
+  ],
+  "exports": {
+    ".": {
+      "default": "./index.js"
+    }
+  },
+  "thi.ng": {
+    "related": [
+      "associative"
+    ],
+    "year": 2022
+  },
+  "gitHead": "324d6b7dbf31558329e9fb6452e29b2f7db9c61a\n"
+}