@ls-stack/utils 3.65.0 → 3.67.0

package/dist/keyedSet.cjs

@@ -1,205 +0,0 @@
-"use strict";
-var __defProp = Object.defineProperty;
-var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
-var __getOwnPropNames = Object.getOwnPropertyNames;
-var __hasOwnProp = Object.prototype.hasOwnProperty;
-var __export = (target, all) => {
-  for (var name in all)
-    __defProp(target, name, { get: all[name], enumerable: true });
-};
-var __copyProps = (to, from, except, desc) => {
-  if (from && typeof from === "object" || typeof from === "function") {
-    for (let key of __getOwnPropNames(from))
-      if (!__hasOwnProp.call(to, key) && key !== except)
-        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
-  }
-  return to;
-};
-var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
-
-// src/keyedSet.ts
-var keyedSet_exports = {};
-__export(keyedSet_exports, {
-  CompositeKeySet: () => CompositeKeySet,
-  KeyedSet: () => KeyedSet
-});
-module.exports = __toCommonJS(keyedSet_exports);
-
-// src/typeGuards.ts
-function isObject(value) {
-  return typeof value === "object" && value !== null && !Array.isArray(value);
-}
-
-// src/assertions.ts
-var isObject2 = isObject;
-
-// src/getCompositeKey.ts
-function getCompositeKey(input, maxSortingDepth = 3) {
-  if (typeof input === "string") return `"${input}`;
-  if (!input || typeof input !== "object") return `$${input}`;
-  return stringifyCompact(input, maxSortingDepth, 0, /* @__PURE__ */ new WeakSet());
-}
-function stringifyCompact(input, maxSortingDepth, depth, refs) {
-  const isJsObj = input && typeof input === "object";
-  if (isJsObj) {
-    if (refs.has(input)) {
-      throw new Error("Circular reference detected");
-    }
-    refs.add(input);
-  }
-  let result;
-  if (Array.isArray(input)) {
-    result = "[";
-    for (const v of input) {
-      if (result.length > 1) result += ",";
-      result += stringifyCompact(v, maxSortingDepth, depth + 1, refs);
-    }
-    result += "]";
-  } else if (isObject2(input)) {
-    let entries = Object.entries(input);
-    if (entries.length === 0) {
-      result = "{}";
-    } else {
-      if (depth < maxSortingDepth) {
-        entries = entries.sort(
-          ([a], [b]) => a < b ? -1 : a > b ? 1 : 0
-        );
-      }
-      result = "{";
-      for (const [k, v] of entries) {
-        if (v === void 0) continue;
-        if (result.length > 1) result += ",";
-        result += `${k}:${stringifyCompact(v, maxSortingDepth, depth + 1, refs)}`;
-      }
-      result += "}";
-    }
-  } else {
-    result = JSON.stringify(input);
-  }
-  if (isJsObj) {
-    refs.delete(input);
-  }
-  return result;
-}
-
-// src/keyedSet.ts
-var KeyedSet = class {
-  map;
-  getKey;
-  /**
-   * @param getKey - Function to extract a unique key from each item
-   * @param iterable - Optional initial items to add to the set
-   */
-  constructor(getKey, iterable) {
-    this.getKey = getKey;
-    this.map = /* @__PURE__ */ new Map();
-    if (iterable) {
-      for (const item of iterable) {
-        this.add(item);
-      }
-    }
-  }
-  /** The number of items in the set */
-  get size() {
-    return this.map.size;
-  }
-  /**
-   * Adds an item to the set. If an item with the same key exists, it will be
-   * replaced.
-   */
-  add(item) {
-    const key = this.getKey(item);
-    this.map.set(key, item);
-    return this;
-  }
-  /** Adds multiple items to the set. */
-  addMultiple(items) {
-    for (const item of items) {
-      this.add(item);
-    }
-    return this;
-  }
-  /** Checks if an item with the same key exists in the set. */
-  has(item) {
-    const key = this.getKey(item);
-    return this.map.has(key);
-  }
-  /** Checks if an item with the given key exists in the set. */
-  hasKey(key) {
-    return this.map.has(key);
-  }
-  /** Gets an item by its key, or undefined if not found. */
-  getByKey(key) {
-    return this.map.get(key);
-  }
-  /**
-   * Removes an item from the set by computing its key. Returns true if the item
-   * was removed.
-   */
-  delete(item) {
-    const key = this.getKey(item);
-    return this.map.delete(key);
-  }
-  /** Removes an item by its key. Returns true if the item was removed. */
-  deleteByKey(key) {
-    return this.map.delete(key);
-  }
-  /** Removes multiple items from the set. Returns the number of items removed. */
-  deleteMultiple(items) {
-    let count = 0;
-    for (const item of items) {
-      if (this.delete(item)) {
-        count++;
-      }
-    }
-    return count;
-  }
-  /** Removes multiple items by their keys. Returns the number of items removed. */
-  deleteMultipleByKeys(keys) {
-    let count = 0;
-    for (const key of keys) {
-      if (this.deleteByKey(key)) {
-        count++;
-      }
-    }
-    return count;
-  }
-  /** Removes all items from the set. */
-  clear() {
-    this.map.clear();
-  }
-  /** Executes a callback for each item in the set. */
-  forEach(callback, thisArg) {
-    for (const value of this.map.values()) {
-      callback.call(thisArg, value, value, this);
-    }
-  }
-  *values() {
-    yield* this.map.values();
-  }
-  *keys() {
-    yield* this.map.values();
-  }
-  *entries() {
-    for (const value of this.map.values()) {
-      yield [value, value];
-    }
-  }
-  [Symbol.iterator]() {
-    return this.values();
-  }
-  /** Returns all items as an array. */
-  toArray() {
-    return [...this.map.values()];
-  }
-};
-var CompositeKeySet = class extends KeyedSet {
-  constructor(iterable) {
-    super(getCompositeKey, iterable);
-  }
-};
-// Annotate the CommonJS export names for ESM import in node:
-0 && (module.exports = {
-  CompositeKeySet,
-  KeyedSet
-});

package/dist/keyedSet.d.cts

@@ -1,76 +0,0 @@
-/**
- * A Set implementation that uses a custom key function to determine uniqueness.
- * Items with the same key are considered equal, and adding a duplicate replaces
- * the existing item.
- *
- * @example
- *   const set = new KeyedSet<{ id: number; name: string }, number>(
- *     (item) => item.id,
- *   );
- *   set.add({ id: 1, name: 'one' });
- *   set.add({ id: 1, name: 'replaced' }); // replaces previous item
- *   set.getByKey(1); // { id: 1, name: 'replaced' }
- *
- * @template T - The type of items stored in the set
- * @template K - The type of the key extracted from items
- */
-declare class KeyedSet<T, K = string> {
-    private map;
-    private getKey;
-    /**
-     * @param getKey - Function to extract a unique key from each item
-     * @param iterable - Optional initial items to add to the set
-     */
-    constructor(getKey: (item: T) => K, iterable?: Iterable<T>);
-    /** The number of items in the set */
-    get size(): number;
-    /**
-     * Adds an item to the set. If an item with the same key exists, it will be
-     * replaced.
-     */
-    add(item: T): this;
-    /** Adds multiple items to the set. */
-    addMultiple(items: Iterable<T>): this;
-    /** Checks if an item with the same key exists in the set. */
-    has(item: T): boolean;
-    /** Checks if an item with the given key exists in the set. */
-    hasKey(key: K): boolean;
-    /** Gets an item by its key, or undefined if not found. */
-    getByKey(key: K): T | undefined;
-    /**
-     * Removes an item from the set by computing its key. Returns true if the item
-     * was removed.
-     */
-    delete(item: T): boolean;
-    /** Removes an item by its key. Returns true if the item was removed. */
-    deleteByKey(key: K): boolean;
-    /** Removes multiple items from the set. Returns the number of items removed. */
-    deleteMultiple(items: Iterable<T>): number;
-    /** Removes multiple items by their keys. Returns the number of items removed. */
-    deleteMultipleByKeys(keys: Iterable<K>): number;
-    /** Removes all items from the set. */
-    clear(): void;
-    /** Executes a callback for each item in the set. */
-    forEach(callback: (value: T, value2: T, set: KeyedSet<T, K>) => void, thisArg?: unknown): void;
-    values(): IterableIterator<T>;
-    keys(): IterableIterator<T>;
-    entries(): IterableIterator<[T, T]>;
-    [Symbol.iterator](): IterableIterator<T>;
-    /** Returns all items as an array. */
-    toArray(): T[];
-}
-/**
- * A Set that compares items by value instead of reference. Uses
- * `getCompositeKey` to generate a stable string key for any value.
- *
- * @example
- *   const set = new ValueSet<{ x: number; y: number }>();
- *   set.add({ x: 1, y: 2 });
- *   set.add({ x: 1, y: 2 }); // ignored, same value already exists
- *   set.size; // 1
- */
-declare class CompositeKeySet<T> extends KeyedSet<T, string> {
-    constructor(iterable?: Iterable<T>);
-}
-
-export { CompositeKeySet, KeyedSet };

package/dist/keyedSet.d.ts

@@ -1,76 +0,0 @@
-/**
- * A Set implementation that uses a custom key function to determine uniqueness.
- * Items with the same key are considered equal, and adding a duplicate replaces
- * the existing item.
- *
- * @example
- *   const set = new KeyedSet<{ id: number; name: string }, number>(
- *     (item) => item.id,
- *   );
- *   set.add({ id: 1, name: 'one' });
- *   set.add({ id: 1, name: 'replaced' }); // replaces previous item
- *   set.getByKey(1); // { id: 1, name: 'replaced' }
- *
- * @template T - The type of items stored in the set
- * @template K - The type of the key extracted from items
- */
-declare class KeyedSet<T, K = string> {
-    private map;
-    private getKey;
-    /**
-     * @param getKey - Function to extract a unique key from each item
-     * @param iterable - Optional initial items to add to the set
-     */
-    constructor(getKey: (item: T) => K, iterable?: Iterable<T>);
-    /** The number of items in the set */
-    get size(): number;
-    /**
-     * Adds an item to the set. If an item with the same key exists, it will be
-     * replaced.
-     */
-    add(item: T): this;
-    /** Adds multiple items to the set. */
-    addMultiple(items: Iterable<T>): this;
-    /** Checks if an item with the same key exists in the set. */
-    has(item: T): boolean;
-    /** Checks if an item with the given key exists in the set. */
-    hasKey(key: K): boolean;
-    /** Gets an item by its key, or undefined if not found. */
-    getByKey(key: K): T | undefined;
-    /**
-     * Removes an item from the set by computing its key. Returns true if the item
-     * was removed.
-     */
-    delete(item: T): boolean;
-    /** Removes an item by its key. Returns true if the item was removed. */
-    deleteByKey(key: K): boolean;
-    /** Removes multiple items from the set. Returns the number of items removed. */
-    deleteMultiple(items: Iterable<T>): number;
-    /** Removes multiple items by their keys. Returns the number of items removed. */
-    deleteMultipleByKeys(keys: Iterable<K>): number;
-    /** Removes all items from the set. */
-    clear(): void;
-    /** Executes a callback for each item in the set. */
-    forEach(callback: (value: T, value2: T, set: KeyedSet<T, K>) => void, thisArg?: unknown): void;
-    values(): IterableIterator<T>;
-    keys(): IterableIterator<T>;
-    entries(): IterableIterator<[T, T]>;
-    [Symbol.iterator](): IterableIterator<T>;
-    /** Returns all items as an array. */
-    toArray(): T[];
-}
-/**
- * A Set that compares items by value instead of reference. Uses
- * `getCompositeKey` to generate a stable string key for any value.
- *
- * @example
- *   const set = new ValueSet<{ x: number; y: number }>();
- *   set.add({ x: 1, y: 2 });
- *   set.add({ x: 1, y: 2 }); // ignored, same value already exists
- *   set.size; // 1
- */
-declare class CompositeKeySet<T> extends KeyedSet<T, string> {
-    constructor(iterable?: Iterable<T>);
-}
-
-export { CompositeKeySet, KeyedSet };

package/dist/keyedSet.js

@@ -1,126 +0,0 @@
-import {
-  getCompositeKey
-} from "./chunk-6FIBVC2P.js";
-import "./chunk-C2SVCIWE.js";
-import "./chunk-JF2MDHOJ.js";
-
-// src/keyedSet.ts
-var KeyedSet = class {
-  map;
-  getKey;
-  /**
-   * @param getKey - Function to extract a unique key from each item
-   * @param iterable - Optional initial items to add to the set
-   */
-  constructor(getKey, iterable) {
-    this.getKey = getKey;
-    this.map = /* @__PURE__ */ new Map();
-    if (iterable) {
-      for (const item of iterable) {
-        this.add(item);
-      }
-    }
-  }
-  /** The number of items in the set */
-  get size() {
-    return this.map.size;
-  }
-  /**
-   * Adds an item to the set. If an item with the same key exists, it will be
-   * replaced.
-   */
-  add(item) {
-    const key = this.getKey(item);
-    this.map.set(key, item);
-    return this;
-  }
-  /** Adds multiple items to the set. */
-  addMultiple(items) {
-    for (const item of items) {
-      this.add(item);
-    }
-    return this;
-  }
-  /** Checks if an item with the same key exists in the set. */
-  has(item) {
-    const key = this.getKey(item);
-    return this.map.has(key);
-  }
-  /** Checks if an item with the given key exists in the set. */
-  hasKey(key) {
-    return this.map.has(key);
-  }
-  /** Gets an item by its key, or undefined if not found. */
-  getByKey(key) {
-    return this.map.get(key);
-  }
-  /**
-   * Removes an item from the set by computing its key. Returns true if the item
-   * was removed.
-   */
-  delete(item) {
-    const key = this.getKey(item);
-    return this.map.delete(key);
-  }
-  /** Removes an item by its key. Returns true if the item was removed. */
-  deleteByKey(key) {
-    return this.map.delete(key);
-  }
-  /** Removes multiple items from the set. Returns the number of items removed. */
-  deleteMultiple(items) {
-    let count = 0;
-    for (const item of items) {
-      if (this.delete(item)) {
-        count++;
-      }
-    }
-    return count;
-  }
-  /** Removes multiple items by their keys. Returns the number of items removed. */
-  deleteMultipleByKeys(keys) {
-    let count = 0;
-    for (const key of keys) {
-      if (this.deleteByKey(key)) {
-        count++;
-      }
-    }
-    return count;
-  }
-  /** Removes all items from the set. */
-  clear() {
-    this.map.clear();
-  }
-  /** Executes a callback for each item in the set. */
-  forEach(callback, thisArg) {
-    for (const value of this.map.values()) {
-      callback.call(thisArg, value, value, this);
-    }
-  }
-  *values() {
-    yield* this.map.values();
-  }
-  *keys() {
-    yield* this.map.values();
-  }
-  *entries() {
-    for (const value of this.map.values()) {
-      yield [value, value];
-    }
-  }
-  [Symbol.iterator]() {
-    return this.values();
-  }
-  /** Returns all items as an array. */
-  toArray() {
-    return [...this.map.values()];
-  }
-};
-var CompositeKeySet = class extends KeyedSet {
-  constructor(iterable) {
-    super(getCompositeKey, iterable);
-  }
-};
-export {
-  CompositeKeySet,
-  KeyedSet
-};

package/dist/levenshtein.cjs

@@ -1,180 +0,0 @@
-"use strict";
-var __defProp = Object.defineProperty;
-var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
-var __getOwnPropNames = Object.getOwnPropertyNames;
-var __hasOwnProp = Object.prototype.hasOwnProperty;
-var __export = (target, all) => {
-  for (var name in all)
-    __defProp(target, name, { get: all[name], enumerable: true });
-};
-var __copyProps = (to, from, except, desc) => {
-  if (from && typeof from === "object" || typeof from === "function") {
-    for (let key of __getOwnPropNames(from))
-      if (!__hasOwnProp.call(to, key) && key !== except)
-        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
-  }
-  return to;
-};
-var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
-
-// src/levenshtein.ts
-var levenshtein_exports = {};
-__export(levenshtein_exports, {
-  getClosestString: () => getClosestString,
-  getClosestStringsUpToDist: () => getClosestStringsUpToDist,
-  levenshteinDistance: () => levenshteinDistance
-});
-module.exports = __toCommonJS(levenshtein_exports);
-var peq = new Uint32Array(65536);
-var myers_32 = (a, b) => {
-  const n = a.length;
-  const m = b.length;
-  const lst = 1 << n - 1;
-  let pv = -1;
-  let mv = 0;
-  let sc = n;
-  let i = n;
-  while (i--) {
-    peq[a.charCodeAt(i)] |= 1 << i;
-  }
-  for (i = 0; i < m; i++) {
-    let eq = peq[b.charCodeAt(i)];
-    const xv = eq | mv;
-    eq |= (eq & pv) + pv ^ pv;
-    mv |= ~(eq | pv);
-    pv &= eq;
-    if (mv & lst) {
-      sc++;
-    }
-    if (pv & lst) {
-      sc--;
-    }
-    mv = mv << 1 | 1;
-    pv = pv << 1 | ~(xv | mv);
-    mv &= xv;
-  }
-  i = n;
-  while (i--) {
-    peq[a.charCodeAt(i)] = 0;
-  }
-  return sc;
-};
-var myers_x = (b, a) => {
-  const n = a.length;
-  const m = b.length;
-  const mhc = [];
-  const phc = [];
-  const hsize = Math.ceil(n / 32);
-  const vsize = Math.ceil(m / 32);
-  for (let i = 0; i < hsize; i++) {
-    phc[i] = -1;
-    mhc[i] = 0;
-  }
-  let j = 0;
-  for (; j < vsize - 1; j++) {
-    let mv2 = 0;
-    let pv2 = -1;
-    const start2 = j * 32;
-    const vlen2 = Math.min(32, m) + start2;
-    for (let k = start2; k < vlen2; k++) {
-      peq[b.charCodeAt(k)] |= 1 << k;
-    }
-    for (let i = 0; i < n; i++) {
-      const eq = peq[a.charCodeAt(i)];
-      const pb = phc[i / 32 | 0] >>> i & 1;
-      const mb = mhc[i / 32 | 0] >>> i & 1;
-      const xv = eq | mv2;
-      const xh = ((eq | mb) & pv2) + pv2 ^ pv2 | eq | mb;
-      let ph = mv2 | ~(xh | pv2);
-      let mh = pv2 & xh;
-      if (ph >>> 31 ^ pb) {
-        phc[i / 32 | 0] ^= 1 << i;
-      }
-      if (mh >>> 31 ^ mb) {
-        mhc[i / 32 | 0] ^= 1 << i;
-      }
-      ph = ph << 1 | pb;
-      mh = mh << 1 | mb;
-      pv2 = mh | ~(xv | ph);
-      mv2 = ph & xv;
-    }
-    for (let k = start2; k < vlen2; k++) {
-      peq[b.charCodeAt(k)] = 0;
-    }
-  }
-  let mv = 0;
-  let pv = -1;
-  const start = j * 32;
-  const vlen = Math.min(32, m - start) + start;
-  for (let k = start; k < vlen; k++) {
-    peq[b.charCodeAt(k)] |= 1 << k;
-  }
-  let score = m;
-  for (let i = 0; i < n; i++) {
-    const eq = peq[a.charCodeAt(i)];
-    const pb = phc[i / 32 | 0] >>> i & 1;
-    const mb = mhc[i / 32 | 0] >>> i & 1;
-    const xv = eq | mv;
-    const xh = ((eq | mb) & pv) + pv ^ pv | eq | mb;
-    let ph = mv | ~(xh | pv);
-    let mh = pv & xh;
-    score += ph >>> m - 1 & 1;
-    score -= mh >>> m - 1 & 1;
-    if (ph >>> 31 ^ pb) {
-      phc[i / 32 | 0] ^= 1 << i;
-    }
-    if (mh >>> 31 ^ mb) {
-      mhc[i / 32 | 0] ^= 1 << i;
-    }
-    ph = ph << 1 | pb;
-    mh = mh << 1 | mb;
-    pv = mh | ~(xv | ph);
-    mv = ph & xv;
-  }
-  for (let k = start; k < vlen; k++) {
-    peq[b.charCodeAt(k)] = 0;
-  }
-  return score;
-};
-function levenshteinDistance(a, b) {
-  if (a.length < b.length) {
-    const tmp = b;
-    b = a;
-    a = tmp;
-  }
-  if (b.length === 0) {
-    return a.length;
-  }
-  if (a.length <= 32) {
-    return myers_32(a, b);
-  }
-  return myers_x(a, b);
-}
-function getClosestString(str, arr, maxDistance = 2) {
-  let min_distance = Infinity;
-  let closestString;
-  for (let i = 0; i < arr.length; i++) {
-    const dist = levenshteinDistance(str, arr[i]);
-    if (dist < min_distance && dist <= maxDistance) {
-      min_distance = dist;
-      closestString = arr[i];
-    }
-  }
-  return closestString;
-}
-function getClosestStringsUpToDist(str, arr, maxDistance = 2) {
-  const distanceMap = /* @__PURE__ */ new Map();
-  for (const item of arr) {
-    const distance = levenshteinDistance(str, item);
-    if (distance <= maxDistance) {
-      distanceMap.set(item, distance);
-    }
-  }
-  return Array.from(distanceMap.entries()).sort((a, b) => a[1] - b[1]).map(([item]) => item);
-}
-// Annotate the CommonJS export names for ESM import in node:
-0 && (module.exports = {
-  getClosestString,
-  getClosestStringsUpToDist,
-  levenshteinDistance
-});

package/dist/levenshtein.d.ts

@@ -1,5 +0,0 @@
-declare function levenshteinDistance(a: string, b: string): number;
-declare function getClosestString(str: string, arr: readonly string[], maxDistance?: number): string | undefined;
-declare function getClosestStringsUpToDist(str: string, arr: readonly string[], maxDistance?: number): string[];
-
-export { getClosestString, getClosestStringsUpToDist, levenshteinDistance };