@ls-stack/utils 3.63.0 → 3.66.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/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 };

package/dist/levenshtein.js

@@ -1,153 +0,0 @@
-// src/levenshtein.ts
-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);
-}
-export {
-  getClosestString,
-  getClosestStringsUpToDist,
-  levenshteinDistance
-};

package/dist/main.cjs

@@ -1,32 +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/main.ts
-var main_exports = {};
-__export(main_exports, {
-  _doNotUseThis: () => _doNotUseThis
-});
-module.exports = __toCommonJS(main_exports);
-var _doNotUseThis = () => {
-  throw new Error("do not use this file");
-};
-// Annotate the CommonJS export names for ESM import in node:
-0 && (module.exports = {
-  _doNotUseThis
-});

package/dist/main.d.cts

@@ -1,3 +0,0 @@
-declare const _doNotUseThis: () => never;
-
-export { _doNotUseThis };

package/dist/main.d.ts

@@ -1,3 +0,0 @@
-declare const _doNotUseThis: () => never;
-
-export { _doNotUseThis };

package/dist/main.js

@@ -1,7 +0,0 @@
-// src/main.ts
-var _doNotUseThis = () => {
-  throw new Error("do not use this file");
-};
-export {
-  _doNotUseThis
-};