@ls-stack/utils 3.65.0 → 3.67.0

package/dist/iteratorUtils.d.ts

@@ -1,10 +0,0 @@
-declare function enumerate<T>(iter: Iterable<T>, start?: number): Generator<[number, T]>;
-declare function withIsLast<T>(array: T[]): Generator<[isLast: boolean, item: T, index: number]>;
-declare function withPrevious<T>(iter: Iterable<T>): Generator<{
-    prev: T | undefined;
-    current: T;
-}>;
-declare function range(start: number, end: number, step?: number): Generator<number>;
-declare function rangeArray(start: number, end: number, step?: number): number[];
-
-export { enumerate, range, rangeArray, withIsLast, withPrevious };

package/dist/iteratorUtils.js

@@ -1,44 +0,0 @@
-// src/iteratorUtils.ts
-function* enumerate(iter, start = 0) {
-  let index = start;
-  for (const item of iter) {
-    yield [index, item];
-    index++;
-  }
-}
-function* withIsLast(array) {
-  let index = 0;
-  for (const item of array) {
-    const isLast = index === array.length - 1;
-    yield [isLast, item, index];
-    index++;
-  }
-}
-function* withPrevious(iter) {
-  let prev = void 0;
-  for (const current of iter) {
-    yield { prev, current };
-    prev = current;
-  }
-}
-function* range(start, end, step = 1) {
-  if (start > end) {
-    for (let i = start; i >= end; i -= step) {
-      yield i;
-    }
-  } else {
-    for (let i = start; i <= end; i += step) {
-      yield i;
-    }
-  }
-}
-function rangeArray(start, end, step = 1) {
-  return [...range(start, end, step)];
-}
-export {
-  enumerate,
-  range,
-  rangeArray,
-  withIsLast,
-  withPrevious
-};

package/dist/keepPrevIfUnchanged.cjs

@@ -1,102 +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/keepPrevIfUnchanged.ts
-var keepPrevIfUnchanged_exports = {};
-__export(keepPrevIfUnchanged_exports, {
-  keepPrevIfUnchanged: () => keepPrevIfUnchanged
-});
-module.exports = __toCommonJS(keepPrevIfUnchanged_exports);
-
-// src/deepEqual.ts
-var has = Object.prototype.hasOwnProperty;
-function find(iter, tar, maxDepth) {
-  for (const key of iter.keys()) {
-    if (deepEqual(key, tar, maxDepth)) return key;
-  }
-}
-function deepEqual(foo, bar, maxDepth = 20) {
-  let ctor, len, tmp;
-  if (foo === bar) return true;
-  if (maxDepth && maxDepth <= 0) return false;
-  if (foo && bar && (ctor = foo.constructor) === bar.constructor) {
-    if (ctor === Date)
-      return deepEqual(foo.getTime(), bar.getTime(), maxDepth - 1);
-    if (ctor === RegExp) return foo.toString() === bar.toString();
-    if (ctor === Array) {
-      if ((len = foo.length) === bar.length) {
-        while (len-- && deepEqual(foo[len], bar[len], maxDepth - 1)) ;
-      }
-      return len === -1;
-    }
-    if (ctor === Set) {
-      if (foo.size !== bar.size) {
-        return false;
-      }
-      for (len of foo) {
-        tmp = len;
-        if (tmp && typeof tmp === "object") {
-          tmp = find(bar, tmp, maxDepth - 1);
-          if (!tmp) return false;
-        }
-        if (!bar.has(tmp)) return false;
-      }
-      return true;
-    }
-    if (ctor === Map) {
-      if (foo.size !== bar.size) {
-        return false;
-      }
-      for (len of foo) {
-        tmp = len[0];
-        if (tmp && typeof tmp === "object") {
-          tmp = find(bar, tmp, maxDepth - 1);
-          if (!tmp) return false;
-        }
-        if (!deepEqual(len[1], bar.get(tmp), maxDepth - 1)) {
-          return false;
-        }
-      }
-      return true;
-    }
-    if (!ctor || typeof foo === "object") {
-      len = 0;
-      for (ctor in foo) {
-        if (has.call(foo, ctor) && ++len && !has.call(bar, ctor)) return false;
-        if (!(ctor in bar) || !deepEqual(foo[ctor], bar[ctor], maxDepth - 1))
-          return false;
-      }
-      return Object.keys(bar).length === len;
-    }
-  }
-  return foo !== foo && bar !== bar;
-}
-
-// src/keepPrevIfUnchanged.ts
-function keepPrevIfUnchanged({
-  prev,
-  newValue,
-  equalityFn = deepEqual
-}) {
-  return equalityFn(prev, newValue) ? prev : newValue;
-}
-// Annotate the CommonJS export names for ESM import in node:
-0 && (module.exports = {
-  keepPrevIfUnchanged
-});

package/dist/keepPrevIfUnchanged.d.cts

@@ -1,7 +0,0 @@
-declare function keepPrevIfUnchanged<T>({ prev, newValue, equalityFn, }: {
-    prev: T;
-    newValue: T;
-    equalityFn?: (foo: any, bar: any) => boolean;
-}): T;
-
-export { keepPrevIfUnchanged };

package/dist/keepPrevIfUnchanged.d.ts

@@ -1,7 +0,0 @@
-declare function keepPrevIfUnchanged<T>({ prev, newValue, equalityFn, }: {
-    prev: T;
-    newValue: T;
-    equalityFn?: (foo: any, bar: any) => boolean;
-}): T;
-
-export { keepPrevIfUnchanged };

package/dist/keepPrevIfUnchanged.js

@@ -1,7 +0,0 @@
-import {
-  keepPrevIfUnchanged
-} from "./chunk-QQS7I7ZL.js";
-import "./chunk-JQFUKJU5.js";
-export {
-  keepPrevIfUnchanged
-};

package/dist/keyedMap.cjs

@@ -1,224 +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/keyedMap.ts
-var keyedMap_exports = {};
-__export(keyedMap_exports, {
-  CompositeKeyMap: () => CompositeKeyMap,
-  KeyedMap: () => KeyedMap
-});
-module.exports = __toCommonJS(keyedMap_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/keyedMap.ts
-var KeyedMap = class {
-  map;
-  getKey;
-  /**
-   * @param getKey - Function to compute an internal key from the external key
-   * @param entries - Optional initial entries to add to the map
-   */
-  constructor(getKey, entries) {
-    this.getKey = getKey;
-    this.map = /* @__PURE__ */ new Map();
-    if (entries) {
-      for (const [key, value] of entries) {
-        this.set(key, value);
-      }
-    }
-  }
-  /** The number of entries in the map */
-  get size() {
-    return this.map.size;
-  }
-  /** Sets a value for the given key. If the key exists, replaces both key and value. */
-  set(key, value) {
-    const internalKey = this.getKey(key);
-    this.map.set(internalKey, { key, value });
-    return this;
-  }
-  /** Sets multiple entries at once. */
-  setMultiple(entries) {
-    for (const [key, value] of entries) {
-      this.set(key, value);
-    }
-    return this;
-  }
-  /** Gets the value for the given key, or undefined if not found. */
-  get(key) {
-    const internalKey = this.getKey(key);
-    return this.map.get(internalKey)?.value;
-  }
-  /** Checks if the map contains the given key. */
-  has(key) {
-    const internalKey = this.getKey(key);
-    return this.map.has(internalKey);
-  }
-  /** Removes the entry for the given key. Returns true if the entry was removed. */
-  delete(key) {
-    const internalKey = this.getKey(key);
-    return this.map.delete(internalKey);
-  }
-  /** Removes multiple entries. Returns the number of entries removed. */
-  deleteMultiple(keys) {
-    let count = 0;
-    for (const key of keys) {
-      if (this.delete(key)) {
-        count++;
-      }
-    }
-    return count;
-  }
-  /** Removes all entries from the map. */
-  clear() {
-    this.map.clear();
-  }
-  /** Executes a callback for each entry in the map. */
-  forEach(callback, thisArg) {
-    for (const { key, value } of this.map.values()) {
-      callback.call(thisArg, value, key, this);
-    }
-  }
-  /** Finds the first entry matching the predicate. */
-  find(predicate) {
-    for (const { key, value } of this.map.values()) {
-      if (predicate(value, key)) {
-        return { key, value };
-      }
-    }
-    return void 0;
-  }
-  /** Gets the value for the given key, or throws if not found. */
-  getOrThrow(key) {
-    const value = this.get(key);
-    if (value === void 0 && !this.has(key)) {
-      throw new Error(`Key not found in KeyedMap`);
-    }
-    return value;
-  }
-  /** Gets the value for the given key, or inserts and returns the fallback value. */
-  getOrInsert(key, fallback) {
-    if (!this.has(key)) {
-      this.set(key, fallback());
-    }
-    return this.getOrThrow(key);
-  }
-  /** Returns values that match the predicate. */
-  toFilteredValues(predicate) {
-    const values = [];
-    for (const { key, value } of this.map.values()) {
-      if (predicate(value, key)) {
-        values.push(value);
-      }
-    }
-    return values;
-  }
-  /** Returns all values as an array. */
-  toValues() {
-    return [...this.values()];
-  }
-  /** Returns all keys as an array. */
-  toKeys() {
-    return [...this.keys()];
-  }
-  *keys() {
-    for (const { key } of this.map.values()) {
-      yield key;
-    }
-  }
-  *values() {
-    for (const { value } of this.map.values()) {
-      yield value;
-    }
-  }
-  *entries() {
-    for (const { key, value } of this.map.values()) {
-      yield [key, value];
-    }
-  }
-  [Symbol.iterator]() {
-    return this.entries();
-  }
-};
-var CompositeKeyMap = class extends KeyedMap {
-  constructor(entries) {
-    super(getCompositeKey, entries);
-  }
-};
-// Annotate the CommonJS export names for ESM import in node:
-0 && (module.exports = {
-  CompositeKeyMap,
-  KeyedMap
-});

package/dist/keyedMap.d.cts

@@ -1,75 +0,0 @@
-/**
- * A Map implementation that uses a custom key function to determine key equality.
- * Keys with the same computed internal key are considered equal.
- *
- * @example
- *   const map = new KeyedMap<{ x: number; y: number }, string, string>(
- *     (key) => `${key.x},${key.y}`,
- *   );
- *   map.set({ x: 1, y: 2 }, 'point A');
- *   map.get({ x: 1, y: 2 }); // 'point A' (different object, same computed key)
- *
- * @template K - The type of the external key
- * @template V - The type of the value
- * @template InternalKey - The type of the internal key used for comparison
- */
-declare class KeyedMap<K, V, InternalKey = string> {
-    private map;
-    private getKey;
-    /**
-     * @param getKey - Function to compute an internal key from the external key
-     * @param entries - Optional initial entries to add to the map
-     */
-    constructor(getKey: (key: K) => InternalKey, entries?: Iterable<[K, V]>);
-    /** The number of entries in the map */
-    get size(): number;
-    /** Sets a value for the given key. If the key exists, replaces both key and value. */
-    set(key: K, value: V): this;
-    /** Sets multiple entries at once. */
-    setMultiple(entries: Iterable<[K, V]>): this;
-    /** Gets the value for the given key, or undefined if not found. */
-    get(key: K): V | undefined;
-    /** Checks if the map contains the given key. */
-    has(key: K): boolean;
-    /** Removes the entry for the given key. Returns true if the entry was removed. */
-    delete(key: K): boolean;
-    /** Removes multiple entries. Returns the number of entries removed. */
-    deleteMultiple(keys: Iterable<K>): number;
-    /** Removes all entries from the map. */
-    clear(): void;
-    /** Executes a callback for each entry in the map. */
-    forEach(callback: (value: V, key: K, map: KeyedMap<K, V, InternalKey>) => void, thisArg?: unknown): void;
-    /** Finds the first entry matching the predicate. */
-    find(predicate: (value: V, key: K) => boolean): {
-        key: K;
-        value: V;
-    } | undefined;
-    /** Gets the value for the given key, or throws if not found. */
-    getOrThrow(key: K): V;
-    /** Gets the value for the given key, or inserts and returns the fallback value. */
-    getOrInsert(key: K, fallback: () => V): V;
-    /** Returns values that match the predicate. */
-    toFilteredValues(predicate: (value: V, key: K) => boolean): V[];
-    /** Returns all values as an array. */
-    toValues(): V[];
-    /** Returns all keys as an array. */
-    toKeys(): K[];
-    keys(): IterableIterator<K>;
-    values(): IterableIterator<V>;
-    entries(): IterableIterator<[K, V]>;
-    [Symbol.iterator](): IterableIterator<[K, V]>;
-}
-/**
- * A Map that compares keys by value instead of reference.
- * Uses `getCompositeKey` to generate a stable string key for any value.
- *
- * @example
- *   const map = new CompositeKeyMap<{ x: number; y: number }, string>();
- *   map.set({ x: 1, y: 2 }, 'point A');
- *   map.get({ x: 1, y: 2 }); // 'point A' (different object, same value)
- */
-declare class CompositeKeyMap<K, V> extends KeyedMap<K, V, string> {
-    constructor(entries?: Iterable<[K, V]>);
-}
-
-export { CompositeKeyMap, KeyedMap };

package/dist/keyedMap.d.ts

@@ -1,75 +0,0 @@
-/**
- * A Map implementation that uses a custom key function to determine key equality.
- * Keys with the same computed internal key are considered equal.
- *
- * @example
- *   const map = new KeyedMap<{ x: number; y: number }, string, string>(
- *     (key) => `${key.x},${key.y}`,
- *   );
- *   map.set({ x: 1, y: 2 }, 'point A');
- *   map.get({ x: 1, y: 2 }); // 'point A' (different object, same computed key)
- *
- * @template K - The type of the external key
- * @template V - The type of the value
- * @template InternalKey - The type of the internal key used for comparison
- */
-declare class KeyedMap<K, V, InternalKey = string> {
-    private map;
-    private getKey;
-    /**
-     * @param getKey - Function to compute an internal key from the external key
-     * @param entries - Optional initial entries to add to the map
-     */
-    constructor(getKey: (key: K) => InternalKey, entries?: Iterable<[K, V]>);
-    /** The number of entries in the map */
-    get size(): number;
-    /** Sets a value for the given key. If the key exists, replaces both key and value. */
-    set(key: K, value: V): this;
-    /** Sets multiple entries at once. */
-    setMultiple(entries: Iterable<[K, V]>): this;
-    /** Gets the value for the given key, or undefined if not found. */
-    get(key: K): V | undefined;
-    /** Checks if the map contains the given key. */
-    has(key: K): boolean;
-    /** Removes the entry for the given key. Returns true if the entry was removed. */
-    delete(key: K): boolean;
-    /** Removes multiple entries. Returns the number of entries removed. */
-    deleteMultiple(keys: Iterable<K>): number;
-    /** Removes all entries from the map. */
-    clear(): void;
-    /** Executes a callback for each entry in the map. */
-    forEach(callback: (value: V, key: K, map: KeyedMap<K, V, InternalKey>) => void, thisArg?: unknown): void;
-    /** Finds the first entry matching the predicate. */
-    find(predicate: (value: V, key: K) => boolean): {
-        key: K;
-        value: V;
-    } | undefined;
-    /** Gets the value for the given key, or throws if not found. */
-    getOrThrow(key: K): V;
-    /** Gets the value for the given key, or inserts and returns the fallback value. */
-    getOrInsert(key: K, fallback: () => V): V;
-    /** Returns values that match the predicate. */
-    toFilteredValues(predicate: (value: V, key: K) => boolean): V[];
-    /** Returns all values as an array. */
-    toValues(): V[];
-    /** Returns all keys as an array. */
-    toKeys(): K[];
-    keys(): IterableIterator<K>;
-    values(): IterableIterator<V>;
-    entries(): IterableIterator<[K, V]>;
-    [Symbol.iterator](): IterableIterator<[K, V]>;
-}
-/**
- * A Map that compares keys by value instead of reference.
- * Uses `getCompositeKey` to generate a stable string key for any value.
- *
- * @example
- *   const map = new CompositeKeyMap<{ x: number; y: number }, string>();
- *   map.set({ x: 1, y: 2 }, 'point A');
- *   map.get({ x: 1, y: 2 }); // 'point A' (different object, same value)
- */
-declare class CompositeKeyMap<K, V> extends KeyedMap<K, V, string> {
-    constructor(entries?: Iterable<[K, V]>);
-}
-
-export { CompositeKeyMap, KeyedMap };

package/dist/keyedMap.js

@@ -1,145 +0,0 @@
-import {
-  getCompositeKey
-} from "./chunk-6FIBVC2P.js";
-import "./chunk-C2SVCIWE.js";
-import "./chunk-JF2MDHOJ.js";
-
-// src/keyedMap.ts
-var KeyedMap = class {
-  map;
-  getKey;
-  /**
-   * @param getKey - Function to compute an internal key from the external key
-   * @param entries - Optional initial entries to add to the map
-   */
-  constructor(getKey, entries) {
-    this.getKey = getKey;
-    this.map = /* @__PURE__ */ new Map();
-    if (entries) {
-      for (const [key, value] of entries) {
-        this.set(key, value);
-      }
-    }
-  }
-  /** The number of entries in the map */
-  get size() {
-    return this.map.size;
-  }
-  /** Sets a value for the given key. If the key exists, replaces both key and value. */
-  set(key, value) {
-    const internalKey = this.getKey(key);
-    this.map.set(internalKey, { key, value });
-    return this;
-  }
-  /** Sets multiple entries at once. */
-  setMultiple(entries) {
-    for (const [key, value] of entries) {
-      this.set(key, value);
-    }
-    return this;
-  }
-  /** Gets the value for the given key, or undefined if not found. */
-  get(key) {
-    const internalKey = this.getKey(key);
-    return this.map.get(internalKey)?.value;
-  }
-  /** Checks if the map contains the given key. */
-  has(key) {
-    const internalKey = this.getKey(key);
-    return this.map.has(internalKey);
-  }
-  /** Removes the entry for the given key. Returns true if the entry was removed. */
-  delete(key) {
-    const internalKey = this.getKey(key);
-    return this.map.delete(internalKey);
-  }
-  /** Removes multiple entries. Returns the number of entries removed. */
-  deleteMultiple(keys) {
-    let count = 0;
-    for (const key of keys) {
-      if (this.delete(key)) {
-        count++;
-      }
-    }
-    return count;
-  }
-  /** Removes all entries from the map. */
-  clear() {
-    this.map.clear();
-  }
-  /** Executes a callback for each entry in the map. */
-  forEach(callback, thisArg) {
-    for (const { key, value } of this.map.values()) {
-      callback.call(thisArg, value, key, this);
-    }
-  }
-  /** Finds the first entry matching the predicate. */
-  find(predicate) {
-    for (const { key, value } of this.map.values()) {
-      if (predicate(value, key)) {
-        return { key, value };
-      }
-    }
-    return void 0;
-  }
-  /** Gets the value for the given key, or throws if not found. */
-  getOrThrow(key) {
-    const value = this.get(key);
-    if (value === void 0 && !this.has(key)) {
-      throw new Error(`Key not found in KeyedMap`);
-    }
-    return value;
-  }
-  /** Gets the value for the given key, or inserts and returns the fallback value. */
-  getOrInsert(key, fallback) {
-    if (!this.has(key)) {
-      this.set(key, fallback());
-    }
-    return this.getOrThrow(key);
-  }
-  /** Returns values that match the predicate. */
-  toFilteredValues(predicate) {
-    const values = [];
-    for (const { key, value } of this.map.values()) {
-      if (predicate(value, key)) {
-        values.push(value);
-      }
-    }
-    return values;
-  }
-  /** Returns all values as an array. */
-  toValues() {
-    return [...this.values()];
-  }
-  /** Returns all keys as an array. */
-  toKeys() {
-    return [...this.keys()];
-  }
-  *keys() {
-    for (const { key } of this.map.values()) {
-      yield key;
-    }
-  }
-  *values() {
-    for (const { value } of this.map.values()) {
-      yield value;
-    }
-  }
-  *entries() {
-    for (const { key, value } of this.map.values()) {
-      yield [key, value];
-    }
-  }
-  [Symbol.iterator]() {
-    return this.entries();
-  }
-};
-var CompositeKeyMap = class extends KeyedMap {
-  constructor(entries) {
-    super(getCompositeKey, entries);
-  }
-};
-export {
-  CompositeKeyMap,
-  KeyedMap
-};