@stryke/helpers 0.9.26 → 0.9.28

package/dist/index.d.cts

@@ -1,32 +1,32 @@
-import { t as argIdentity } from "./arg-identity-C-pVjd0u.cjs";
-import { n as debounce, t as DebounceOptions } from "./debounce-CLb-VvJv.cjs";
-import { n as deepClone, t as Resolved } from "./deep-clone-jRNy1xoj.cjs";
-import { n as deepMerge, t as DeepMergeOptions } from "./deep-merge-C9qDSleg.cjs";
-import { n as sleep, t as delay } from "./delay-VkcrQf1l.cjs";
-import { t as filterEmpty } from "./filter-empty-C2fq9M7o.cjs";
-import { t as flattenObject } from "./flatten-object-DjaJJaY0.cjs";
-import { n as getField, t as GetField } from "./get-field-oltWWNRO.cjs";
-import { t as getOrderedBy } from "./get-ordered-by-DuD7QRma.cjs";
-import { n as getUniqueBy, t as getUnique } from "./get-unique-C0SBPUBv.cjs";
-import { t as identity } from "./identity-DRhIvbPG.cjs";
-import { t as isEqual } from "./is-equal-BMlMHlVi.cjs";
-import { t as LRUCache } from "./lru-cache-D4VEIgtR.cjs";
-import { a as RankingInfo, c as matchSorter, i as MatchSorterOptions, l as rankings, n as KeyAttributesOptions, o as ValueGetterKey, r as KeyOption, s as defaultBaseSortFn, t as KeyAttributes } from "./match-sorter-CMYN3GuY.cjs";
-import { t as memoizeOnId } from "./memoize-tSTYY522.cjs";
-import { t as Mutex } from "./mutex-DCyX7B66.cjs";
-import { n as noop, t as asyncNoop } from "./noop-CnJXOCpF.cjs";
-import { t as omit } from "./omit-D1FKiOYz.cjs";
-import { n as safeFunctionCast, t as once } from "./once-DqmxXwEB.cjs";
-import { t as pick } from "./pick-DXREvZBr.cjs";
-import { n as removeAccents, t as characterMap } from "./remove-accents-Yo3-2jWO.cjs";
-import { t as removeEmptyItems } from "./remove-empty-items-BglsRCyG.cjs";
-import { t as Semaphore } from "./semaphore-CsGTxqsW.cjs";
-import { t as setField } from "./set-field-CcCiXZNl.cjs";
-import { t as throttle } from "./throttle-BWPQuZty.cjs";
-import { t as timeout } from "./timeout-DC38jHR8.cjs";
-import { n as toDeepKey, t as addPathToDeepKey } from "./to-deep-key-DlsE4ziE.cjs";
-import { t as toPath } from "./to-path-D2zWXeYc.cjs";
-import { t as unflattenObject } from "./unflatten-object-Cvbj7Q__.cjs";
-import { t as union } from "./union-BMOMEzO-.cjs";
-import { t as withTimeout } from "./with-timeout-BPaAIZtS.cjs";
+import { argIdentity } from "./arg-identity.cjs";
+import { DebounceOptions, debounce } from "./debounce.cjs";
+import { Resolved, deepClone } from "./deep-clone.cjs";
+import { DeepMergeOptions, deepMerge } from "./deep-merge.cjs";
+import { delay, sleep } from "./delay.cjs";
+import { filterEmpty } from "./filter-empty.cjs";
+import { flattenObject } from "./flatten-object.cjs";
+import { GetField, getField } from "./get-field.cjs";
+import { getOrderedBy } from "./get-ordered-by.cjs";
+import { getUnique, getUniqueBy } from "./get-unique.cjs";
+import { identity } from "./identity.cjs";
+import { isEqual } from "./is-equal.cjs";
+import { LRUCache } from "./lru-cache.cjs";
+import { KeyAttributes, KeyAttributesOptions, KeyOption, MatchSorterOptions, RankingInfo, ValueGetterKey, defaultBaseSortFn, matchSorter, rankings } from "./match-sorter.cjs";
+import { memoizeOnId } from "./memoize.cjs";
+import { Mutex } from "./mutex.cjs";
+import { asyncNoop, noop } from "./noop.cjs";
+import { omit } from "./omit.cjs";
+import { once, safeFunctionCast } from "./once.cjs";
+import { pick } from "./pick.cjs";
+import { characterMap, removeAccents } from "./remove-accents.cjs";
+import { removeEmptyItems } from "./remove-empty-items.cjs";
+import { Semaphore } from "./semaphore.cjs";
+import { setField } from "./set-field.cjs";
+import { throttle } from "./throttle.cjs";
+import { timeout } from "./timeout.cjs";
+import { addPathToDeepKey, toDeepKey } from "./to-deep-key.cjs";
+import { toPath } from "./to-path.cjs";
+import { unflattenObject } from "./unflatten-object.cjs";
+import { union } from "./union.cjs";
+import { withTimeout } from "./with-timeout.cjs";
 export { DebounceOptions, DeepMergeOptions, GetField, KeyAttributes, KeyAttributesOptions, KeyOption, LRUCache, MatchSorterOptions, Mutex, RankingInfo, Resolved, Semaphore, ValueGetterKey, addPathToDeepKey, argIdentity, asyncNoop, characterMap, debounce, deepClone, deepMerge, defaultBaseSortFn, delay, filterEmpty, flattenObject, getField, getOrderedBy, getUnique, getUniqueBy, identity, isEqual, matchSorter, memoizeOnId, noop, omit, once, pick, rankings, removeAccents, removeEmptyItems, safeFunctionCast, setField, sleep, throttle, timeout, toDeepKey, toPath, unflattenObject, union, withTimeout };

package/dist/index.d.mts

@@ -1,32 +1,32 @@
-import { t as argIdentity } from "./arg-identity-BIir8uzO.mjs";
-import { n as debounce, t as DebounceOptions } from "./debounce-CIMf8-Yr.mjs";
-import { n as deepClone, t as Resolved } from "./deep-clone-CpLJcTgz.mjs";
-import { n as deepMerge, t as DeepMergeOptions } from "./deep-merge-eCT712Cv.mjs";
-import { n as sleep, t as delay } from "./delay-Bd_sGzMj.mjs";
-import { t as filterEmpty } from "./filter-empty-BMtd0K07.mjs";
-import { t as flattenObject } from "./flatten-object-Bk2VT-b2.mjs";
-import { n as getField, t as GetField } from "./get-field-5XqtknPs.mjs";
-import { t as getOrderedBy } from "./get-ordered-by-C45FfW2T.mjs";
-import { n as getUniqueBy, t as getUnique } from "./get-unique-DZ6E1Kvc.mjs";
-import { t as identity } from "./identity-B_cGeF8o.mjs";
-import { t as isEqual } from "./is-equal-Baqurdpn.mjs";
-import { t as LRUCache } from "./lru-cache-CzQ_kKXk.mjs";
-import { a as RankingInfo, c as matchSorter, i as MatchSorterOptions, l as rankings, n as KeyAttributesOptions, o as ValueGetterKey, r as KeyOption, s as defaultBaseSortFn, t as KeyAttributes } from "./match-sorter-DCRerxVe.mjs";
-import { t as memoizeOnId } from "./memoize-TyrmWrfR.mjs";
-import { t as Mutex } from "./mutex-DAZduiSP.mjs";
-import { n as noop, t as asyncNoop } from "./noop-BnXKMH6Z.mjs";
-import { t as omit } from "./omit-DpqOAtKt.mjs";
-import { n as safeFunctionCast, t as once } from "./once-DNPPQd3P.mjs";
-import { t as pick } from "./pick-ZrWD4de2.mjs";
-import { n as removeAccents, t as characterMap } from "./remove-accents-C4C0A2ex.mjs";
-import { t as removeEmptyItems } from "./remove-empty-items-COwdCPHC.mjs";
-import { t as Semaphore } from "./semaphore-WaZBtCk5.mjs";
-import { t as setField } from "./set-field-DyvXgpNP.mjs";
-import { t as throttle } from "./throttle-BgU4k6qs.mjs";
-import { t as timeout } from "./timeout-CLhwG-oo.mjs";
-import { n as toDeepKey, t as addPathToDeepKey } from "./to-deep-key-DO-Z0Zjs.mjs";
-import { t as toPath } from "./to-path-BajxeMmo.mjs";
-import { t as unflattenObject } from "./unflatten-object-CPJIUozj.mjs";
-import { t as union } from "./union-D4bbjM2i.mjs";
-import { t as withTimeout } from "./with-timeout-BoZYdcOg.mjs";
+import { argIdentity } from "./arg-identity.mjs";
+import { DebounceOptions, debounce } from "./debounce.mjs";
+import { Resolved, deepClone } from "./deep-clone.mjs";
+import { DeepMergeOptions, deepMerge } from "./deep-merge.mjs";
+import { delay, sleep } from "./delay.mjs";
+import { filterEmpty } from "./filter-empty.mjs";
+import { flattenObject } from "./flatten-object.mjs";
+import { GetField, getField } from "./get-field.mjs";
+import { getOrderedBy } from "./get-ordered-by.mjs";
+import { getUnique, getUniqueBy } from "./get-unique.mjs";
+import { identity } from "./identity.mjs";
+import { isEqual } from "./is-equal.mjs";
+import { LRUCache } from "./lru-cache.mjs";
+import { KeyAttributes, KeyAttributesOptions, KeyOption, MatchSorterOptions, RankingInfo, ValueGetterKey, defaultBaseSortFn, matchSorter, rankings } from "./match-sorter.mjs";
+import { memoizeOnId } from "./memoize.mjs";
+import { Mutex } from "./mutex.mjs";
+import { asyncNoop, noop } from "./noop.mjs";
+import { omit } from "./omit.mjs";
+import { once, safeFunctionCast } from "./once.mjs";
+import { pick } from "./pick.mjs";
+import { characterMap, removeAccents } from "./remove-accents.mjs";
+import { removeEmptyItems } from "./remove-empty-items.mjs";
+import { Semaphore } from "./semaphore.mjs";
+import { setField } from "./set-field.mjs";
+import { throttle } from "./throttle.mjs";
+import { timeout } from "./timeout.mjs";
+import { addPathToDeepKey, toDeepKey } from "./to-deep-key.mjs";
+import { toPath } from "./to-path.mjs";
+import { unflattenObject } from "./unflatten-object.mjs";
+import { union } from "./union.mjs";
+import { withTimeout } from "./with-timeout.mjs";
 export { DebounceOptions, DeepMergeOptions, GetField, KeyAttributes, KeyAttributesOptions, KeyOption, LRUCache, MatchSorterOptions, Mutex, RankingInfo, Resolved, Semaphore, ValueGetterKey, addPathToDeepKey, argIdentity, asyncNoop, characterMap, debounce, deepClone, deepMerge, defaultBaseSortFn, delay, filterEmpty, flattenObject, getField, getOrderedBy, getUnique, getUniqueBy, identity, isEqual, matchSorter, memoizeOnId, noop, omit, once, pick, rankings, removeAccents, removeEmptyItems, safeFunctionCast, setField, sleep, throttle, timeout, toDeepKey, toPath, unflattenObject, union, withTimeout };

package/dist/index.mjs

@@ -1 +1 @@
-import{t as e}from"./arg-identity-BfviduMt.mjs";import{t}from"./debounce-C5O3IDKy.mjs";import{t as n}from"./deep-clone-BlN5QTtW.mjs";import{t as r}from"./deep-merge-BDZ6c79O.mjs";import{n as i,t as a}from"./delay-wdNbY6sk.mjs";import{t as o}from"./filter-empty-Dsc1ymCj.mjs";import{t as s}from"./flatten-object-DFCZmly9.mjs";import{t as c}from"./get-field-ngQ9O38X.mjs";import{t as l}from"./to-path-Dm1fe-Ix.mjs";import{t as u}from"./get-ordered-by-CBKKJr4R.mjs";import{n as d,t as f}from"./get-unique-DzZ7Z34U.mjs";import{t as p}from"./identity-DBwwvmGU.mjs";import{t as m}from"./is-equal-0Z-K2uIG.mjs";import{t as h}from"./lru-cache-DLY_yZRN.mjs";import{n as g,t as _}from"./remove-accents-BFmyvTRZ.mjs";import{n as v,r as y,t as b}from"./match-sorter-B9_7YvTo.mjs";import{t as x}from"./memoize-Cr5jFKxi.mjs";import{t as S}from"./semaphore-4zJqtox8.mjs";import{t as C}from"./mutex-TqoKHosg.mjs";import{n as w,t as T}from"./noop-B7OetrhD.mjs";import{t as E}from"./omit-BROsDK0D.mjs";import{n as D,t as O}from"./once-txoW63yJ.mjs";import{t as k}from"./pick-CuXTvXaw.mjs";import{t as A}from"./remove-empty-items-BzI9Vid9.mjs";import{t as j}from"./set-field-CUgbKEjW.mjs";import{t as M}from"./throttle-CYK3F0mZ.mjs";import{t as N}from"./timeout-43rG9ETK.mjs";import{n as P,t as F}from"./to-deep-key-D8uDBd6T.mjs";import{t as I}from"./unflatten-object-C7TE8J80.mjs";import{t as L}from"./union-C-2CRoFc.mjs";import{t as R}from"./with-timeout-CAuUr1ck.mjs";export{h as LRUCache,C as Mutex,S as Semaphore,F as addPathToDeepKey,e as argIdentity,T as asyncNoop,_ as characterMap,t as debounce,n as deepClone,r as deepMerge,b as defaultBaseSortFn,a as delay,o as filterEmpty,s as flattenObject,c as getField,u as getOrderedBy,f as getUnique,d as getUniqueBy,p as identity,m as isEqual,v as matchSorter,x as memoizeOnId,w as noop,E as omit,O as once,k as pick,y as rankings,g as removeAccents,A as removeEmptyItems,D as safeFunctionCast,j as setField,i as sleep,M as throttle,N as timeout,P as toDeepKey,l as toPath,I as unflattenObject,L as union,R as withTimeout};
+import{argIdentity as e}from"./arg-identity.mjs";import{debounce as t}from"./debounce.mjs";import{deepClone as n}from"./deep-clone.mjs";import{deepMerge as r}from"./deep-merge.mjs";import{delay as i,sleep as a}from"./delay.mjs";import{filterEmpty as o}from"./filter-empty.mjs";import{flattenObject as s}from"./flatten-object.mjs";import{toPath as c}from"./to-path.mjs";import{getField as l}from"./get-field.mjs";import{getOrderedBy as u}from"./get-ordered-by.mjs";import{getUnique as d,getUniqueBy as f}from"./get-unique.mjs";import{identity as p}from"./identity.mjs";import{isEqual as m}from"./is-equal.mjs";import{LRUCache as h}from"./lru-cache.mjs";import{characterMap as g,removeAccents as _}from"./remove-accents.mjs";import{defaultBaseSortFn as v,matchSorter as y,rankings as b}from"./match-sorter.mjs";import{memoizeOnId as x}from"./memoize.mjs";import{Semaphore as S}from"./semaphore.mjs";import{Mutex as C}from"./mutex.mjs";import{asyncNoop as w,noop as T}from"./noop.mjs";import{omit as E}from"./omit.mjs";import{once as D,safeFunctionCast as O}from"./once.mjs";import{pick as k}from"./pick.mjs";import{removeEmptyItems as A}from"./remove-empty-items.mjs";import{setField as j}from"./set-field.mjs";import{throttle as M}from"./throttle.mjs";import{timeout as N}from"./timeout.mjs";import{addPathToDeepKey as P,toDeepKey as F}from"./to-deep-key.mjs";import{unflattenObject as I}from"./unflatten-object.mjs";import{union as L}from"./union.mjs";import{withTimeout as R}from"./with-timeout.mjs";export{h as LRUCache,C as Mutex,S as Semaphore,P as addPathToDeepKey,e as argIdentity,w as asyncNoop,g as characterMap,t as debounce,n as deepClone,r as deepMerge,v as defaultBaseSortFn,i as delay,o as filterEmpty,s as flattenObject,l as getField,u as getOrderedBy,d as getUnique,f as getUniqueBy,p as identity,m as isEqual,y as matchSorter,x as memoizeOnId,T as noop,E as omit,D as once,k as pick,b as rankings,_ as removeAccents,A as removeEmptyItems,O as safeFunctionCast,j as setField,a as sleep,M as throttle,N as timeout,F as toDeepKey,c as toPath,I as unflattenObject,L as union,R as withTimeout};

package/dist/is-equal.cjs

@@ -1 +1 @@
-const e=require(`./is-equal-BJgVhUVS.cjs`);exports.isEqual=e.t;
+const e=require(`./type-checks/src/is-set.cjs`),t=require(`./type-checks/src/is-set-string.cjs`),n=typeof Map==`function`,r=typeof Set==`function`,i=typeof ArrayBuffer==`function`&&ArrayBuffer.isView!==void 0;function a(o,s){if(o===s)return!0;if(o&&s&&typeof o==`object`&&typeof s==`object`){if(o.constructor!==s.constructor)return!1;let c;if(Array.isArray(o)){if(c=o.length,c!=s.length)return!1;for(let e=c;e--!==0;)if(!a(o[e],s[e]))return!1;return!0}let l;if(n&&o instanceof Map&&s instanceof Map){if(o.size!==s.size)return!1;l=o.entries();let e;for(;!(e=l.next()).done;)if(!s.has(e.value[0]))return!1;for(l=o.entries();!(e=l.next()).done;)if(!a(e.value[1],s.get(e.value[0])))return!1;return!0}if(r&&o instanceof Set&&s instanceof Set){if(o.size!==s.size)return!1;l=o.entries();let e;for(;!(e=l.next()).done;)if(!s.has(e.value[0]))return!1;return!0}if(Array.isArray(o)&&Array.isArray(s)&&i&&ArrayBuffer.isView(o)&&ArrayBuffer.isView(s)){if(c=o.length,c!=s.length)return!1;for(let e=c;e--!==0;)if(o[e]!==s[e])return!1;return!0}if(o.constructor===RegExp)return o.source===s.source&&o.flags===s.flags;if(o.valueOf!==Object.prototype.valueOf&&typeof o.valueOf==`function`&&typeof s.valueOf==`function`)return o.valueOf()===s.valueOf();if(o.toString!==Object.prototype.toString&&typeof o.toString==`function`&&typeof s.toString==`function`)return o.toString()===s.toString();let u=Object.keys(o);if(c=u.length,c!==Object.keys(s).length)return!1;for(let n=c;n--!==0;)if(!e.isSet(n)||!t.isSetString(u[n])||!Object.prototype.hasOwnProperty.call(s,u[n]))return!1;for(let n=c;n--!==0;)if(!(Array.isArray(u)&&(u[n]===`_owner`||u[n]===`__v`||u[n]===`__o`)&&o.$$typeof)&&(!e.isSet(n)||!t.isSetString(u[n])||!a(o[u[n]],s[u[n]])))return!1;return!0}return o!==o&&s!==s}function o(e,t){try{return a(e,t)}catch(e){if(/stack|recursion/i.test(e?.message||``))return console.warn(`isEqual cannot handle circular refs`),!1;throw e}}exports.isEqual=o;

package/dist/is-equal.d.cts

@@ -1,2 +1,22 @@
-import { t as isEqual } from "./is-equal-BMlMHlVi.cjs";
-export { isEqual };
+//#region src/is-equal.d.ts
+/**
+ * Checks if two values are equal, including support for `Date`, `RegExp`, and deep object comparison.
+ *
+ * @example
+ * ```ts
+ * isEqual(1, 1); // true
+ * isEqual({ a: 1 }, { a: 1 }); // true
+ * isEqual(/abc/g, /abc/g); // true
+ * isEqual(new Date('2020-01-01'), new Date('2020-01-01')); // true
+ * isEqual([1, 2, 3], [1, 2, 3]); // true
+ * isEqual({ a: 1, b: { c: 2 } }, { a: 1, b: { c: 2 } }); // true
+ * ```
+ *
+ * @param a - The first value to compare.
+ * @param b - The second value to compare.
+ * @returns `true` if the values are equal, otherwise `false`.
+ */
+declare function isEqual(a: any, b: any): boolean;
+//#endregion
+export { isEqual };
+//# sourceMappingURL=is-equal.d.cts.map

package/dist/is-equal.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"is-equal.d.cts","names":[],"sources":["../src/is-equal.ts"],"sourcesContent":[],"mappings":";;AA8JA;;;;;;;;;;;;;;;;iBAAgB,OAAA"}

package/dist/is-equal.d.mts

@@ -1,2 +1,22 @@
-import { t as isEqual } from "./is-equal-Baqurdpn.mjs";
-export { isEqual };
+//#region src/is-equal.d.ts
+/**
+ * Checks if two values are equal, including support for `Date`, `RegExp`, and deep object comparison.
+ *
+ * @example
+ * ```ts
+ * isEqual(1, 1); // true
+ * isEqual({ a: 1 }, { a: 1 }); // true
+ * isEqual(/abc/g, /abc/g); // true
+ * isEqual(new Date('2020-01-01'), new Date('2020-01-01')); // true
+ * isEqual([1, 2, 3], [1, 2, 3]); // true
+ * isEqual({ a: 1, b: { c: 2 } }, { a: 1, b: { c: 2 } }); // true
+ * ```
+ *
+ * @param a - The first value to compare.
+ * @param b - The second value to compare.
+ * @returns `true` if the values are equal, otherwise `false`.
+ */
+declare function isEqual(a: any, b: any): boolean;
+//#endregion
+export { isEqual };
+//# sourceMappingURL=is-equal.d.mts.map

package/dist/is-equal.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"is-equal.d.mts","names":[],"sources":["../src/is-equal.ts"],"sourcesContent":[],"mappings":";;AA8JA;;;;;;;;;;;;;;;;iBAAgB,OAAA"}

package/dist/is-equal.mjs

@@ -1 +1,2 @@
-import{t as e}from"./is-equal-0Z-K2uIG.mjs";export{e as isEqual};
+import{isSet as e}from"./type-checks/src/is-set.mjs";import{isSetString as t}from"./type-checks/src/is-set-string.mjs";const n=typeof Map==`function`,r=typeof Set==`function`,i=typeof ArrayBuffer==`function`&&ArrayBuffer.isView!==void 0;function a(o,s){if(o===s)return!0;if(o&&s&&typeof o==`object`&&typeof s==`object`){if(o.constructor!==s.constructor)return!1;let c;if(Array.isArray(o)){if(c=o.length,c!=s.length)return!1;for(let e=c;e--!==0;)if(!a(o[e],s[e]))return!1;return!0}let l;if(n&&o instanceof Map&&s instanceof Map){if(o.size!==s.size)return!1;l=o.entries();let e;for(;!(e=l.next()).done;)if(!s.has(e.value[0]))return!1;for(l=o.entries();!(e=l.next()).done;)if(!a(e.value[1],s.get(e.value[0])))return!1;return!0}if(r&&o instanceof Set&&s instanceof Set){if(o.size!==s.size)return!1;l=o.entries();let e;for(;!(e=l.next()).done;)if(!s.has(e.value[0]))return!1;return!0}if(Array.isArray(o)&&Array.isArray(s)&&i&&ArrayBuffer.isView(o)&&ArrayBuffer.isView(s)){if(c=o.length,c!=s.length)return!1;for(let e=c;e--!==0;)if(o[e]!==s[e])return!1;return!0}if(o.constructor===RegExp)return o.source===s.source&&o.flags===s.flags;if(o.valueOf!==Object.prototype.valueOf&&typeof o.valueOf==`function`&&typeof s.valueOf==`function`)return o.valueOf()===s.valueOf();if(o.toString!==Object.prototype.toString&&typeof o.toString==`function`&&typeof s.toString==`function`)return o.toString()===s.toString();let u=Object.keys(o);if(c=u.length,c!==Object.keys(s).length)return!1;for(let n=c;n--!==0;)if(!e(n)||!t(u[n])||!Object.prototype.hasOwnProperty.call(s,u[n]))return!1;for(let n=c;n--!==0;)if(!(Array.isArray(u)&&(u[n]===`_owner`||u[n]===`__v`||u[n]===`__o`)&&o.$$typeof)&&(!e(n)||!t(u[n])||!a(o[u[n]],s[u[n]])))return!1;return!0}return o!==o&&s!==s}function o(e,t){try{return a(e,t)}catch(e){if(/stack|recursion/i.test(e?.message||``))return console.warn(`isEqual cannot handle circular refs`),!1;throw e}}export{o as isEqual};
+//# sourceMappingURL=is-equal.mjs.map

package/dist/is-equal.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"is-equal.mjs","names":[],"sources":["../src/is-equal.ts"],"sourcesContent":["/* -------------------------------------------------------------------\n\n                       ⚡ Storm Software - Stryke\n\n This code was released as part of the Stryke project. Stryke\n is maintained by Storm Software under the Apache-2.0 License, and is\n free for commercial and private use. For more information, please visit\n our licensing page.\n\n Website:         https://stormsoftware.com\n Repository:      https://github.com/storm-software/stryke\n Documentation:   https://stormsoftware.com/projects/stryke/docs\n Contact:         https://stormsoftware.com/contact\n License:         https://stormsoftware.com/projects/stryke/license\n\n ------------------------------------------------------------------- */\n\nimport { isSet } from \"@stryke/type-checks/is-set\";\nimport { isSetString } from \"@stryke/type-checks/is-set-string\";\n\nconst hasMap = typeof Map === \"function\";\nconst hasSet = typeof Set === \"function\";\nconst hasArrayBuffer =\n  typeof ArrayBuffer === \"function\" && ArrayBuffer.isView !== undefined;\n\nfunction equal(a: any, b: any) {\n  if (a === b) {\n    return true;\n  }\n\n  if (a && b && typeof a === \"object\" && typeof b === \"object\") {\n    if (a.constructor !== b.constructor) {\n      return false;\n    }\n\n    let length;\n    if (Array.isArray(a)) {\n      length = a.length;\n\n      if (length != b.length) return false;\n      for (let i = length; i-- !== 0; ) if (!equal(a[i], b[i])) return false;\n      return true;\n    }\n\n    let it;\n    if (hasMap && a instanceof Map && b instanceof Map) {\n      if (a.size !== b.size) return false;\n      it = a.entries();\n      let i;\n      while (!(i = it.next()).done) if (!b.has(i.value[0])) return false;\n      it = a.entries();\n      while (!(i = it.next()).done) {\n        if (!equal(i.value[1], b.get(i.value[0]))) return false;\n      }\n      return true;\n    }\n\n    if (hasSet && a instanceof Set && b instanceof Set) {\n      if (a.size !== b.size) return false;\n      it = a.entries();\n      let i;\n      while (!(i = it.next()).done) if (!b.has(i.value[0])) return false;\n      return true;\n    }\n\n    if (\n      Array.isArray(a) &&\n      Array.isArray(b) &&\n      hasArrayBuffer &&\n      ArrayBuffer.isView(a) &&\n      ArrayBuffer.isView(b)\n    ) {\n      length = a.length;\n\n      if (length != b.length) return false;\n      for (let i = length; i-- !== 0; ) if (a[i] !== b[i]) return false;\n      return true;\n    }\n\n    if (a.constructor === RegExp) {\n      return a.source === b.source && a.flags === b.flags;\n    }\n\n    if (\n      a.valueOf !== Object.prototype.valueOf &&\n      typeof a.valueOf === \"function\" &&\n      typeof b.valueOf === \"function\"\n    ) {\n      // eslint-disable-next-line ts/no-unsafe-call\n      return a.valueOf() === b.valueOf();\n    }\n    if (\n      a.toString !== Object.prototype.toString &&\n      typeof a.toString === \"function\" &&\n      typeof b.toString === \"function\"\n    ) {\n      // eslint-disable-next-line ts/no-unsafe-call\n      return a.toString() === b.toString();\n    }\n\n    const keys = Object.keys(a);\n    length = keys.length;\n    if (length !== Object.keys(b).length) {\n      return false;\n    }\n\n    for (let i = length; i-- !== 0; ) {\n      if (\n        !isSet(i) ||\n        !isSetString(keys[i]) ||\n        !Object.prototype.hasOwnProperty.call(b, keys[i] as any)\n      ) {\n        return false;\n      }\n    }\n\n    for (let i = length; i-- !== 0; ) {\n      if (\n        Array.isArray(keys) &&\n        (keys[i] === \"_owner\" || keys[i] === \"__v\" || keys[i] === \"__o\") &&\n        a.$$typeof\n      ) {\n        continue;\n      }\n\n      if (\n        !isSet(i) ||\n        !isSetString(keys[i]) ||\n        !equal(a[keys[i] as any], b[keys[i] as any])\n      ) {\n        return false;\n      }\n    }\n\n    return true;\n  }\n\n  // eslint-disable-next-line no-self-compare\n  return a !== a && b !== b;\n}\n\n/**\n * Checks if two values are equal, including support for `Date`, `RegExp`, and deep object comparison.\n *\n * @example\n * ```ts\n * isEqual(1, 1); // true\n * isEqual({ a: 1 }, { a: 1 }); // true\n * isEqual(/abc/g, /abc/g); // true\n * isEqual(new Date('2020-01-01'), new Date('2020-01-01')); // true\n * isEqual([1, 2, 3], [1, 2, 3]); // true\n * isEqual({ a: 1, b: { c: 2 } }, { a: 1, b: { c: 2 } }); // true\n * ```\n *\n * @param a - The first value to compare.\n * @param b - The second value to compare.\n * @returns `true` if the values are equal, otherwise `false`.\n */\nexport function isEqual(a: any, b: any): boolean {\n  try {\n    return equal(a, b);\n  } catch (error) {\n    if (/stack|recursion/i.test((error as any)?.message || \"\")) {\n      // eslint-disable-next-line no-console\n      console.warn(\"isEqual cannot handle circular refs\");\n\n      return false;\n    }\n\n    throw error;\n  }\n}\n"],"mappings":"uHAoBA,MAAM,EAAS,OAAO,KAAQ,WACxB,EAAS,OAAO,KAAQ,WACxB,EACJ,OAAO,aAAgB,YAAc,YAAY,SAAW,IAAA,GAE9D,SAAS,EAAM,EAAQ,EAAQ,CAC7B,GAAI,IAAM,EACR,MAAO,GAGT,GAAI,GAAK,GAAK,OAAO,GAAM,UAAY,OAAO,GAAM,SAAU,CAC5D,GAAI,EAAE,cAAgB,EAAE,YACtB,MAAO,GAGT,IAAI,EACJ,GAAI,MAAM,QAAQ,EAAE,CAAE,CAGpB,GAFA,EAAS,EAAE,OAEP,GAAU,EAAE,OAAQ,MAAO,GAC/B,IAAK,IAAI,EAAI,EAAQ,MAAQ,GAAK,GAAI,CAAC,EAAM,EAAE,GAAI,EAAE,GAAG,CAAE,MAAO,GACjE,MAAO,GAGT,IAAI,EACJ,GAAI,GAAU,aAAa,KAAO,aAAa,IAAK,CAClD,GAAI,EAAE,OAAS,EAAE,KAAM,MAAO,GAC9B,EAAK,EAAE,SAAS,CAChB,IAAI,EACJ,KAAO,EAAE,EAAI,EAAG,MAAM,EAAE,MAAM,GAAI,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,CAAE,MAAO,GAE7D,IADA,EAAK,EAAE,SAAS,CACT,EAAE,EAAI,EAAG,MAAM,EAAE,MACtB,GAAI,CAAC,EAAM,EAAE,MAAM,GAAI,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,CAAE,MAAO,GAEpD,MAAO,GAGT,GAAI,GAAU,aAAa,KAAO,aAAa,IAAK,CAClD,GAAI,EAAE,OAAS,EAAE,KAAM,MAAO,GAC9B,EAAK,EAAE,SAAS,CAChB,IAAI,EACJ,KAAO,EAAE,EAAI,EAAG,MAAM,EAAE,MAAM,GAAI,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,CAAE,MAAO,GAC7D,MAAO,GAGT,GACE,MAAM,QAAQ,EAAE,EAChB,MAAM,QAAQ,EAAE,EAChB,GACA,YAAY,OAAO,EAAE,EACrB,YAAY,OAAO,EAAE,CACrB,CAGA,GAFA,EAAS,EAAE,OAEP,GAAU,EAAE,OAAQ,MAAO,GAC/B,IAAK,IAAI,EAAI,EAAQ,MAAQ,GAAK,GAAI,EAAE,KAAO,EAAE,GAAI,MAAO,GAC5D,MAAO,GAGT,GAAI,EAAE,cAAgB,OACpB,OAAO,EAAE,SAAW,EAAE,QAAU,EAAE,QAAU,EAAE,MAGhD,GACE,EAAE,UAAY,OAAO,UAAU,SAC/B,OAAO,EAAE,SAAY,YACrB,OAAO,EAAE,SAAY,WAGrB,OAAO,EAAE,SAAS,GAAK,EAAE,SAAS,CAEpC,GACE,EAAE,WAAa,OAAO,UAAU,UAChC,OAAO,EAAE,UAAa,YACtB,OAAO,EAAE,UAAa,WAGtB,OAAO,EAAE,UAAU,GAAK,EAAE,UAAU,CAGtC,IAAM,EAAO,OAAO,KAAK,EAAE,CAE3B,GADA,EAAS,EAAK,OACV,IAAW,OAAO,KAAK,EAAE,CAAC,OAC5B,MAAO,GAGT,IAAK,IAAI,EAAI,EAAQ,MAAQ,GAC3B,GACE,CAAC,EAAM,EAAE,EACT,CAAC,EAAY,EAAK,GAAG,EACrB,CAAC,OAAO,UAAU,eAAe,KAAK,EAAG,EAAK,GAAU,CAExD,MAAO,GAIX,IAAK,IAAI,EAAI,EAAQ,MAAQ,GAEzB,WAAM,QAAQ,EAAK,GAClB,EAAK,KAAO,UAAY,EAAK,KAAO,OAAS,EAAK,KAAO,QAC1D,EAAE,YAMF,CAAC,EAAM,EAAE,EACT,CAAC,EAAY,EAAK,GAAG,EACrB,CAAC,EAAM,EAAE,EAAK,IAAY,EAAE,EAAK,IAAW,EAE5C,MAAO,GAIX,MAAO,GAIT,OAAO,IAAM,GAAK,IAAM,EAoB1B,SAAgB,EAAQ,EAAQ,EAAiB,CAC/C,GAAI,CACF,OAAO,EAAM,EAAG,EAAE,OACX,EAAO,CACd,GAAI,mBAAmB,KAAM,GAAe,SAAW,GAAG,CAIxD,OAFA,QAAQ,KAAK,sCAAsC,CAE5C,GAGT,MAAM"}

package/dist/lru-cache.cjs

@@ -1 +1 @@
-const e=require(`./lru-cache-DgTSGx5W.cjs`);exports.LRUCache=e.t;
+var e=class{key;data;size;prev=null;next=null;constructor(e,t,n){this.key=e,this.data=t,this.size=n}},t=class{prev=null;next=null},n=class{cache=new Map;head;tail;totalSize=0;maxSize;calculateSize;constructor(e,n){this.maxSize=e,this.calculateSize=n,this.head=new t,this.tail=new t,this.head.next=this.tail,this.tail.prev=this.head}addToHead(e){e.prev=this.head,e.next=this.head.next,this.head.next.prev=e,this.head.next=e}removeNode(e){e.prev.next=e.next,e.next.prev=e.prev}moveToHead(e){this.removeNode(e),this.addToHead(e)}removeTail(){let e=this.tail.prev;return this.removeNode(e),e}set(t,n){let r=this.calculateSize?.(n)??1;if(r>this.maxSize)return;let i=this.cache.get(t);if(i)i.data=n,this.totalSize=this.totalSize-i.size+r,i.size=r,this.moveToHead(i);else{let i=new e(t,n,r);this.cache.set(t,i),this.addToHead(i),this.totalSize+=r}for(;this.totalSize>this.maxSize&&this.cache.size>0;){let e=this.removeTail();this.cache.delete(e.key),this.totalSize-=e.size}}has(e){return this.cache.has(e)}get(e){let t=this.cache.get(e);if(t)return this.moveToHead(t),t.data}*[Symbol.iterator](){let e=this.head.next;for(;e&&e!==this.tail;){let t=e;yield[t.key,t.data],e=e.next}}remove(e){let t=this.cache.get(e);t&&(this.removeNode(t),this.cache.delete(e),this.totalSize-=t.size)}get size(){return this.cache.size}get currentSize(){return this.totalSize}};exports.LRUCache=n;

package/dist/lru-cache.d.cts

@@ -1,2 +1,103 @@
-import { t as LRUCache } from "./lru-cache-D4VEIgtR.cjs";
-export { LRUCache };
+//#region src/lru-cache.d.ts
+/**
+ * LRU (Least Recently Used) Cache implementation using a doubly-linked list
+ * and hash map for O(1) operations.
+ *
+ * Algorithm:
+ * - Uses a doubly-linked list to maintain access order (most recent at head)
+ * - Hash map provides O(1) key-to-node lookup
+ * - Sentinel head/tail nodes simplify edge case handling
+ * - Size-based eviction supports custom size calculation functions
+ *
+ * Data Structure Layout:
+ * HEAD \<-\> [most recent] \<-\> ... \<-\> [least recent] \<-\> TAIL
+ *
+ * Operations:
+ * - get(): Move accessed node to head (mark as most recent)
+ * - set(): Add new node at head, evict from tail if over capacity
+ * - Eviction: Remove least recent node (tail.prev) when size exceeds limit
+ */
+declare class LRUCache<T> {
+  private readonly cache;
+  private readonly head;
+  private readonly tail;
+  private totalSize;
+  private readonly maxSize;
+  private readonly calculateSize;
+  constructor(maxSize: number, calculateSize?: (value: T) => number);
+  /**
+   * Adds a node immediately after the head (marks as most recently used). Used when inserting new items or when an item is accessed. **PRECONDITION:** node must be disconnected (prev/next should be null)
+   *
+   * @param node - The node to add after the head.
+   */
+  private addToHead;
+  /**
+   * Removes a node from its current position in the doubly-linked list. Updates the prev/next pointers of adjacent nodes to maintain list integrity. **PRECONDITION:** node must be connected (prev/next are non-null)
+   *
+   * @param node - The node to remove from the list.
+   */
+  private removeNode;
+  /**
+   * Moves an existing node to the head position (marks as most recently used). This is the core LRU operation - accessed items become most recent.
+   *
+   * @param node - The node to move to the head.
+   */
+  private moveToHead;
+  /**
+   * Removes and returns the least recently used node (the one before tail). This is called during eviction when the cache exceeds capacity. **PRECONDITION:** cache is not empty (ensured by caller)
+   *
+   * @returns The removed least recently used node.
+   */
+  private removeTail;
+  /**
+   * Sets a key-value pair in the cache.
+   * If the key exists, updates the value and moves to head.
+   * If new, adds at head and evicts from tail if necessary.
+   *
+   * Time Complexity:
+   * - O(1) for uniform item sizes
+   * - O(k) where k is the number of items evicted (can be O(N) for variable sizes)
+   *
+   * @param key - The key to set.
+   * @param value - The value to set.
+   */
+  set(key: string, value: T): void;
+  /**
+   * Checks if a key exists in the cache.
+   * This is a pure query operation - does NOT update LRU order.
+   *
+   * Time Complexity: O(1)
+   */
+  has(key: string): boolean;
+  /**
+   * Retrieves a value by key and marks it as most recently used.
+   * Moving to head maintains the LRU property for future evictions.
+   *
+   * Time Complexity: O(1)
+   */
+  get(key: string): T | undefined;
+  /**
+   * Returns an iterator over the cache entries. The order is outputted in the
+   * order of most recently used to least recently used.
+   */
+  [Symbol.iterator](): IterableIterator<[string, T]>;
+  /**
+   * Removes a specific key from the cache.
+   * Updates both the hash map and doubly-linked list.
+   *
+   * Time Complexity: O(1)
+   */
+  remove(key: string): void;
+  /**
+   * Returns the number of items in the cache.
+   */
+  get size(): number;
+  /**
+   * Returns the current total size of all cached items.
+   * This uses the custom size calculation if provided.
+   */
+  get currentSize(): number;
+}
+//#endregion
+export { LRUCache };
+//# sourceMappingURL=lru-cache.d.cts.map

package/dist/lru-cache.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lru-cache.d.cts","names":[],"sources":["../src/lru-cache.ts"],"sourcesContent":[],"mappings":";;AAgEA;;;;;;;;;;;;;;;;;cAAa;;;;;;;uDAa0C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;0BAsEtB;;;;;;;;;;;;;;oBA8CN;;;;;GAchB,MAAA,CAAO,QAAA,KAAa,0BAA0B"}

package/dist/lru-cache.d.mts

@@ -1,2 +1,103 @@
-import { t as LRUCache } from "./lru-cache-CzQ_kKXk.mjs";
-export { LRUCache };
+//#region src/lru-cache.d.ts
+/**
+ * LRU (Least Recently Used) Cache implementation using a doubly-linked list
+ * and hash map for O(1) operations.
+ *
+ * Algorithm:
+ * - Uses a doubly-linked list to maintain access order (most recent at head)
+ * - Hash map provides O(1) key-to-node lookup
+ * - Sentinel head/tail nodes simplify edge case handling
+ * - Size-based eviction supports custom size calculation functions
+ *
+ * Data Structure Layout:
+ * HEAD \<-\> [most recent] \<-\> ... \<-\> [least recent] \<-\> TAIL
+ *
+ * Operations:
+ * - get(): Move accessed node to head (mark as most recent)
+ * - set(): Add new node at head, evict from tail if over capacity
+ * - Eviction: Remove least recent node (tail.prev) when size exceeds limit
+ */
+declare class LRUCache<T> {
+  private readonly cache;
+  private readonly head;
+  private readonly tail;
+  private totalSize;
+  private readonly maxSize;
+  private readonly calculateSize;
+  constructor(maxSize: number, calculateSize?: (value: T) => number);
+  /**
+   * Adds a node immediately after the head (marks as most recently used). Used when inserting new items or when an item is accessed. **PRECONDITION:** node must be disconnected (prev/next should be null)
+   *
+   * @param node - The node to add after the head.
+   */
+  private addToHead;
+  /**
+   * Removes a node from its current position in the doubly-linked list. Updates the prev/next pointers of adjacent nodes to maintain list integrity. **PRECONDITION:** node must be connected (prev/next are non-null)
+   *
+   * @param node - The node to remove from the list.
+   */
+  private removeNode;
+  /**
+   * Moves an existing node to the head position (marks as most recently used). This is the core LRU operation - accessed items become most recent.
+   *
+   * @param node - The node to move to the head.
+   */
+  private moveToHead;
+  /**
+   * Removes and returns the least recently used node (the one before tail). This is called during eviction when the cache exceeds capacity. **PRECONDITION:** cache is not empty (ensured by caller)
+   *
+   * @returns The removed least recently used node.
+   */
+  private removeTail;
+  /**
+   * Sets a key-value pair in the cache.
+   * If the key exists, updates the value and moves to head.
+   * If new, adds at head and evicts from tail if necessary.
+   *
+   * Time Complexity:
+   * - O(1) for uniform item sizes
+   * - O(k) where k is the number of items evicted (can be O(N) for variable sizes)
+   *
+   * @param key - The key to set.
+   * @param value - The value to set.
+   */
+  set(key: string, value: T): void;
+  /**
+   * Checks if a key exists in the cache.
+   * This is a pure query operation - does NOT update LRU order.
+   *
+   * Time Complexity: O(1)
+   */
+  has(key: string): boolean;
+  /**
+   * Retrieves a value by key and marks it as most recently used.
+   * Moving to head maintains the LRU property for future evictions.
+   *
+   * Time Complexity: O(1)
+   */
+  get(key: string): T | undefined;
+  /**
+   * Returns an iterator over the cache entries. The order is outputted in the
+   * order of most recently used to least recently used.
+   */
+  [Symbol.iterator](): IterableIterator<[string, T]>;
+  /**
+   * Removes a specific key from the cache.
+   * Updates both the hash map and doubly-linked list.
+   *
+   * Time Complexity: O(1)
+   */
+  remove(key: string): void;
+  /**
+   * Returns the number of items in the cache.
+   */
+  get size(): number;
+  /**
+   * Returns the current total size of all cached items.
+   * This uses the custom size calculation if provided.
+   */
+  get currentSize(): number;
+}
+//#endregion
+export { LRUCache };
+//# sourceMappingURL=lru-cache.d.mts.map

package/dist/lru-cache.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lru-cache.d.mts","names":[],"sources":["../src/lru-cache.ts"],"sourcesContent":[],"mappings":";;AAgEA;;;;;;;;;;;;;;;;;cAAa;;;;;;;uDAa0C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;0BAsEtB;;;;;;;;;;;;;;oBA8CN;;;;;GAchB,MAAA,CAAO,QAAA,KAAa,0BAA0B"}

package/dist/lru-cache.mjs

@@ -1 +1,2 @@
-import{t as e}from"./lru-cache-DLY_yZRN.mjs";export{e as LRUCache};
+var e=class{key;data;size;prev=null;next=null;constructor(e,t,n){this.key=e,this.data=t,this.size=n}},t=class{prev=null;next=null},n=class{cache=new Map;head;tail;totalSize=0;maxSize;calculateSize;constructor(e,n){this.maxSize=e,this.calculateSize=n,this.head=new t,this.tail=new t,this.head.next=this.tail,this.tail.prev=this.head}addToHead(e){e.prev=this.head,e.next=this.head.next,this.head.next.prev=e,this.head.next=e}removeNode(e){e.prev.next=e.next,e.next.prev=e.prev}moveToHead(e){this.removeNode(e),this.addToHead(e)}removeTail(){let e=this.tail.prev;return this.removeNode(e),e}set(t,n){let r=this.calculateSize?.(n)??1;if(r>this.maxSize)return;let i=this.cache.get(t);if(i)i.data=n,this.totalSize=this.totalSize-i.size+r,i.size=r,this.moveToHead(i);else{let i=new e(t,n,r);this.cache.set(t,i),this.addToHead(i),this.totalSize+=r}for(;this.totalSize>this.maxSize&&this.cache.size>0;){let e=this.removeTail();this.cache.delete(e.key),this.totalSize-=e.size}}has(e){return this.cache.has(e)}get(e){let t=this.cache.get(e);if(t)return this.moveToHead(t),t.data}*[Symbol.iterator](){let e=this.head.next;for(;e&&e!==this.tail;){let t=e;yield[t.key,t.data],e=e.next}}remove(e){let t=this.cache.get(e);t&&(this.removeNode(t),this.cache.delete(e),this.totalSize-=t.size)}get size(){return this.cache.size}get currentSize(){return this.totalSize}};export{n as LRUCache};
+//# sourceMappingURL=lru-cache.mjs.map

package/dist/lru-cache.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"lru-cache.mjs","names":[],"sources":["../src/lru-cache.ts"],"sourcesContent":["/* -------------------------------------------------------------------\n\n                       ⚡ Storm Software - Stryke\n\n This code was released as part of the Stryke project. Stryke\n is maintained by Storm Software under the Apache-2.0 license, and is\n free for commercial and private use. For more information, please visit\n our licensing page at https://stormsoftware.com/licenses/projects/stryke.\n\n Website:                  https://stormsoftware.com\n Repository:               https://github.com/storm-software/stryke\n Documentation:            https://docs.stormsoftware.com/projects/stryke\n Contact:                  https://stormsoftware.com/contact\n\n SPDX-License-Identifier:  Apache-2.0\n\n ------------------------------------------------------------------- */\n\nclass LRUNode<T> {\n  public readonly key: string;\n\n  public data: T;\n\n  public size: number;\n\n  public prev: LRUNode<T> | SentinelNode<T> | null = null;\n\n  public next: LRUNode<T> | SentinelNode<T> | null = null;\n\n  constructor(key: string, data: T, size: number) {\n    this.key = key;\n    this.data = data;\n    this.size = size;\n  }\n}\n\n/**\n * Sentinel node used for head/tail boundaries.\n * These nodes don't contain actual cache data but simplify list operations.\n */\nclass SentinelNode<T> {\n  public prev: LRUNode<T> | SentinelNode<T> | null = null;\n\n  public next: LRUNode<T> | SentinelNode<T> | null = null;\n}\n\n/**\n * LRU (Least Recently Used) Cache implementation using a doubly-linked list\n * and hash map for O(1) operations.\n *\n * Algorithm:\n * - Uses a doubly-linked list to maintain access order (most recent at head)\n * - Hash map provides O(1) key-to-node lookup\n * - Sentinel head/tail nodes simplify edge case handling\n * - Size-based eviction supports custom size calculation functions\n *\n * Data Structure Layout:\n * HEAD \\<-\\> [most recent] \\<-\\> ... \\<-\\> [least recent] \\<-\\> TAIL\n *\n * Operations:\n * - get(): Move accessed node to head (mark as most recent)\n * - set(): Add new node at head, evict from tail if over capacity\n * - Eviction: Remove least recent node (tail.prev) when size exceeds limit\n */\nexport class LRUCache<T> {\n  private readonly cache: Map<string, LRUNode<T>> = new Map();\n\n  private readonly head: SentinelNode<T>;\n\n  private readonly tail: SentinelNode<T>;\n\n  private totalSize: number = 0;\n\n  private readonly maxSize: number;\n\n  private readonly calculateSize: ((value: T) => number) | undefined;\n\n  constructor(maxSize: number, calculateSize?: (value: T) => number) {\n    this.maxSize = maxSize;\n    this.calculateSize = calculateSize;\n\n    // Create sentinel nodes to simplify doubly-linked list operations\n    // HEAD <-> TAIL (empty list)\n    this.head = new SentinelNode<T>();\n    this.tail = new SentinelNode<T>();\n    this.head.next = this.tail;\n    this.tail.prev = this.head;\n  }\n\n  /**\n   * Adds a node immediately after the head (marks as most recently used). Used when inserting new items or when an item is accessed. **PRECONDITION:** node must be disconnected (prev/next should be null)\n   *\n   * @param node - The node to add after the head.\n   */\n  private addToHead(node: LRUNode<T>): void {\n    node.prev = this.head;\n    node.next = this.head.next;\n    // head.next is always non-null (points to tail or another node)\n    this.head.next!.prev = node;\n    this.head.next = node;\n  }\n\n  /**\n   * Removes a node from its current position in the doubly-linked list. Updates the prev/next pointers of adjacent nodes to maintain list integrity. **PRECONDITION:** node must be connected (prev/next are non-null)\n   *\n   * @param node - The node to remove from the list.\n   */\n  private removeNode(node: LRUNode<T>): void {\n    // Connected nodes always have non-null prev/next\n    node.prev!.next = node.next;\n    node.next!.prev = node.prev;\n  }\n\n  /**\n   * Moves an existing node to the head position (marks as most recently used). This is the core LRU operation - accessed items become most recent.\n   *\n   * @param node - The node to move to the head.\n   */\n  private moveToHead(node: LRUNode<T>): void {\n    this.removeNode(node);\n    this.addToHead(node);\n  }\n\n  /**\n   * Removes and returns the least recently used node (the one before tail). This is called during eviction when the cache exceeds capacity. **PRECONDITION:** cache is not empty (ensured by caller)\n   *\n   * @returns The removed least recently used node.\n   */\n  private removeTail(): LRUNode<T> {\n    const lastNode = this.tail.prev as LRUNode<T>;\n    // tail.prev is always non-null and always LRUNode when cache is not empty\n    this.removeNode(lastNode);\n    return lastNode;\n  }\n\n  /**\n   * Sets a key-value pair in the cache.\n   * If the key exists, updates the value and moves to head.\n   * If new, adds at head and evicts from tail if necessary.\n   *\n   * Time Complexity:\n   * - O(1) for uniform item sizes\n   * - O(k) where k is the number of items evicted (can be O(N) for variable sizes)\n   *\n   * @param key - The key to set.\n   * @param value - The value to set.\n   */\n  public set(key: string, value: T): void {\n    const size = this.calculateSize?.(value) ?? 1;\n    if (size > this.maxSize) {\n      // console.warn(\"Single item size exceeds maxSize\");\n      return;\n    }\n\n    const existing = this.cache.get(key);\n    if (existing) {\n      // Update existing node: adjust size and move to head (most recent)\n      existing.data = value;\n      this.totalSize = this.totalSize - existing.size + size;\n      existing.size = size;\n      this.moveToHead(existing);\n    } else {\n      // Add new node at head (most recent position)\n      const newNode = new LRUNode(key, value, size);\n      this.cache.set(key, newNode);\n      this.addToHead(newNode);\n      this.totalSize += size;\n    }\n\n    // Evict least recently used items until under capacity\n    while (this.totalSize > this.maxSize && this.cache.size > 0) {\n      const tail = this.removeTail();\n      this.cache.delete(tail.key);\n      this.totalSize -= tail.size;\n    }\n  }\n\n  /**\n   * Checks if a key exists in the cache.\n   * This is a pure query operation - does NOT update LRU order.\n   *\n   * Time Complexity: O(1)\n   */\n  public has(key: string): boolean {\n    return this.cache.has(key);\n  }\n\n  /**\n   * Retrieves a value by key and marks it as most recently used.\n   * Moving to head maintains the LRU property for future evictions.\n   *\n   * Time Complexity: O(1)\n   */\n  public get(key: string): T | undefined {\n    const node = this.cache.get(key);\n    if (!node) return undefined;\n\n    // Mark as most recently used by moving to head\n    this.moveToHead(node);\n\n    return node.data;\n  }\n\n  /**\n   * Returns an iterator over the cache entries. The order is outputted in the\n   * order of most recently used to least recently used.\n   */\n  public *[Symbol.iterator](): IterableIterator<[string, T]> {\n    let current = this.head.next;\n    while (current && current !== this.tail) {\n      // Between head and tail, current is always LRUNode\n      const node = current as LRUNode<T>;\n      yield [node.key, node.data];\n      current = current.next;\n    }\n  }\n\n  /**\n   * Removes a specific key from the cache.\n   * Updates both the hash map and doubly-linked list.\n   *\n   * Time Complexity: O(1)\n   */\n  public remove(key: string): void {\n    const node = this.cache.get(key);\n    if (!node) return;\n\n    this.removeNode(node);\n    this.cache.delete(key);\n    this.totalSize -= node.size;\n  }\n\n  /**\n   * Returns the number of items in the cache.\n   */\n  public get size(): number {\n    return this.cache.size;\n  }\n\n  /**\n   * Returns the current total size of all cached items.\n   * This uses the custom size calculation if provided.\n   */\n  public get currentSize(): number {\n    return this.totalSize;\n  }\n}\n"],"mappings":"AAkBA,IAAM,EAAN,KAAiB,CACf,IAEA,KAEA,KAEA,KAAmD,KAEnD,KAAmD,KAEnD,YAAY,EAAa,EAAS,EAAc,CAC9C,KAAK,IAAM,EACX,KAAK,KAAO,EACZ,KAAK,KAAO,IAQV,EAAN,KAAsB,CACpB,KAAmD,KAEnD,KAAmD,MAqBxC,EAAb,KAAyB,CACvB,MAAkD,IAAI,IAEtD,KAEA,KAEA,UAA4B,EAE5B,QAEA,cAEA,YAAY,EAAiB,EAAsC,CACjE,KAAK,QAAU,EACf,KAAK,cAAgB,EAIrB,KAAK,KAAO,IAAI,EAChB,KAAK,KAAO,IAAI,EAChB,KAAK,KAAK,KAAO,KAAK,KACtB,KAAK,KAAK,KAAO,KAAK,KAQxB,UAAkB,EAAwB,CACxC,EAAK,KAAO,KAAK,KACjB,EAAK,KAAO,KAAK,KAAK,KAEtB,KAAK,KAAK,KAAM,KAAO,EACvB,KAAK,KAAK,KAAO,EAQnB,WAAmB,EAAwB,CAEzC,EAAK,KAAM,KAAO,EAAK,KACvB,EAAK,KAAM,KAAO,EAAK,KAQzB,WAAmB,EAAwB,CACzC,KAAK,WAAW,EAAK,CACrB,KAAK,UAAU,EAAK,CAQtB,YAAiC,CAC/B,IAAM,EAAW,KAAK,KAAK,KAG3B,OADA,KAAK,WAAW,EAAS,CAClB,EAeT,IAAW,EAAa,EAAgB,CACtC,IAAM,EAAO,KAAK,gBAAgB,EAAM,EAAI,EAC5C,GAAI,EAAO,KAAK,QAEd,OAGF,IAAM,EAAW,KAAK,MAAM,IAAI,EAAI,CACpC,GAAI,EAEF,EAAS,KAAO,EAChB,KAAK,UAAY,KAAK,UAAY,EAAS,KAAO,EAClD,EAAS,KAAO,EAChB,KAAK,WAAW,EAAS,KACpB,CAEL,IAAM,EAAU,IAAI,EAAQ,EAAK,EAAO,EAAK,CAC7C,KAAK,MAAM,IAAI,EAAK,EAAQ,CAC5B,KAAK,UAAU,EAAQ,CACvB,KAAK,WAAa,EAIpB,KAAO,KAAK,UAAY,KAAK,SAAW,KAAK,MAAM,KAAO,GAAG,CAC3D,IAAM,EAAO,KAAK,YAAY,CAC9B,KAAK,MAAM,OAAO,EAAK,IAAI,CAC3B,KAAK,WAAa,EAAK,MAU3B,IAAW,EAAsB,CAC/B,OAAO,KAAK,MAAM,IAAI,EAAI,CAS5B,IAAW,EAA4B,CACrC,IAAM,EAAO,KAAK,MAAM,IAAI,EAAI,CAC3B,KAKL,OAFA,KAAK,WAAW,EAAK,CAEd,EAAK,KAOd,EAAS,OAAO,WAA2C,CACzD,IAAI,EAAU,KAAK,KAAK,KACxB,KAAO,GAAW,IAAY,KAAK,MAAM,CAEvC,IAAM,EAAO,EACb,KAAM,CAAC,EAAK,IAAK,EAAK,KAAK,CAC3B,EAAU,EAAQ,MAUtB,OAAc,EAAmB,CAC/B,IAAM,EAAO,KAAK,MAAM,IAAI,EAAI,CAC3B,IAEL,KAAK,WAAW,EAAK,CACrB,KAAK,MAAM,OAAO,EAAI,CACtB,KAAK,WAAa,EAAK,MAMzB,IAAW,MAAe,CACxB,OAAO,KAAK,MAAM,KAOpB,IAAW,aAAsB,CAC/B,OAAO,KAAK"}

package/dist/match-sorter.cjs

@@ -1 +1 @@
-require(`./remove-accents-CXBUC-Id.cjs`);const e=require(`./match-sorter-BjnWjkKu.cjs`);exports.defaultBaseSortFn=e.t,exports.matchSorter=e.n,exports.rankings=e.r;
+const e=require(`./remove-accents.cjs`),t={CASE_SENSITIVE_EQUAL:7,EQUAL:6,STARTS_WITH:5,WORD_STARTS_WITH:4,CONTAINS:3,ACRONYM:2,MATCHES:1,NO_MATCH:0},n=(e,t)=>String(e.rankedValue).localeCompare(String(t.rankedValue));function r(e,r,a={}){let{keys:o,threshold:s=t.MATCHES,baseSort:l=n,sorter:u=e=>e.sort((e,t)=>c(e,t,l))}=a;return u(e.reduce((e,t,n)=>d(e,t,n),[])).map(({item:e})=>e);function d(e,t,n){let c=i(t,o,r,a),{rank:l,keyThreshold:u=s}=c;return l>=u&&e.push({...c,item:t,index:n}),e}}r.rankings=t;function i(e,n,r,i){if(!n){let t=e;return{rankedValue:t,rank:a(t,r,i),keyIndex:-1,keyThreshold:i.threshold}}return f(e,n).reduce(({rank:e,rankedValue:n,keyIndex:o,keyThreshold:s},{itemValue:c,attributes:l},u)=>{let d=a(c,r,i),f=n,{minRanking:p,maxRanking:m,threshold:h}=l;return d<p&&d>=t.MATCHES?d=p:d>m&&(d=m),d>e&&(e=d,o=u,s=h,f=c),{rankedValue:f,rank:e,keyIndex:o,keyThreshold:s}},{rankedValue:e,rank:t.NO_MATCH,keyIndex:-1,keyThreshold:i.threshold})}function a(e,n,r){return e=l(e,r),n=l(n,r),n.length>e.length?t.NO_MATCH:e===n?t.CASE_SENSITIVE_EQUAL:(e=e.toLowerCase(),n=n.toLowerCase(),e===n?t.EQUAL:e.startsWith(n)?t.STARTS_WITH:e.includes(` ${n}`)?t.WORD_STARTS_WITH:e.includes(n)?t.CONTAINS:n.length===1?t.NO_MATCH:o(e).includes(n)?t.ACRONYM:s(e,n))}function o(e){let t=``,n=e.split(` `);for(let e of n){let n=e.split(`-`);for(let e of n)t+=e.slice(0,1)}return t}function s(e,n){let r=0,i=0;function a(e,t,n){for(let i=n,a=t.length;i<a;i++)if(t[i]===e)return r+=1,i+1;return-1}function o(e){let i=1/e,a=r/n.length;return t.MATCHES+a*i}let s=a(n[0],e,0);if(s<0)return t.NO_MATCH;i=s;for(let r=1,o=n.length;r<o;r++){let o=n[r];if(i=a(o,e,i),!(i>-1))return t.NO_MATCH}return o(i-s)}function c(e,t,n){let{rank:r,keyIndex:i}=e,{rank:a,keyIndex:o}=t;return r===a?i===o?n(e,t):i<o?-1:1:r>a?-1:1}function l(t,{keepDiacritics:n}){return t=`${t}`,n||(t=e.removeAccents(t)),t}function u(e,t){typeof t==`object`&&(t=t.key);let n;if(typeof t==`function`)n=t(e);else if(e===null)n=null;else if(Object.hasOwnProperty.call(e,t))n=e[t];else if(t.includes(`.`))return d(t,e);else n=null;return n===null?[]:Array.isArray(n)?n:[String(n)]}function d(e,t){let n=e.split(`.`),r=[t];for(let e=0,t=n.length;e<t;e++){let t=n[e],i=[];for(let e=0,n=r.length;e<n;e++){let n=r[e];if(n!==null)if(t&&Object.hasOwnProperty.call(n,t)){let e=n[t];e!==null&&i.push(e)}else n&&t===`*`&&(i=[...i,n])}r=i}return Array.isArray(r[0])?[].concat(...r):r}function f(e,t){let n=[];for(let r=0,i=t.length;r<i;r++){let i=t[r],a=m(i),o=u(e,i);for(let e=0,t=o.length;e<t;e++)n.push({itemValue:o[e],attributes:a})}return n}const p={maxRanking:1/0,minRanking:-1/0};function m(e){return typeof e==`string`?p:{...p,...e}}exports.defaultBaseSortFn=n,exports.matchSorter=r,exports.rankings=t;

package/dist/match-sorter.d.cts

@@ -1,2 +1,78 @@
-import { a as RankingInfo, c as matchSorter, i as MatchSorterOptions, l as rankings, n as KeyAttributesOptions, o as ValueGetterKey, r as KeyOption, s as defaultBaseSortFn, t as KeyAttributes } from "./match-sorter-CMYN3GuY.cjs";
-export { KeyAttributes, KeyAttributesOptions, KeyOption, MatchSorterOptions, RankingInfo, ValueGetterKey, defaultBaseSortFn, matchSorter, rankings };
+//#region src/match-sorter.d.ts
+/**
+ * Forked from match-sorter by Kent C. Dodds
+ */
+interface KeyAttributes {
+  threshold?: Ranking;
+  maxRanking: Ranking;
+  minRanking: Ranking;
+}
+interface RankingInfo {
+  rankedValue: string;
+  rank: Ranking;
+  keyIndex: number;
+  keyThreshold: Ranking | undefined;
+}
+interface ValueGetterKey<ItemType> {
+  (item: ItemType): string | Array<string>;
+}
+interface IndexedItem<ItemType> {
+  item: ItemType;
+  index: number;
+}
+interface RankedItem<ItemType> extends RankingInfo, IndexedItem<ItemType> {}
+interface BaseSorter<ItemType> {
+  (a: RankedItem<ItemType>, b: RankedItem<ItemType>): number;
+}
+interface Sorter<ItemType> {
+  (matchItems: Array<RankedItem<ItemType>>): Array<RankedItem<ItemType>>;
+}
+interface KeyAttributesOptions<ItemType> {
+  key?: string | ValueGetterKey<ItemType>;
+  threshold?: Ranking;
+  maxRanking?: Ranking;
+  minRanking?: Ranking;
+}
+type KeyOption<ItemType> = KeyAttributesOptions<ItemType> | ValueGetterKey<ItemType> | string;
+interface MatchSorterOptions<ItemType = unknown> {
+  keys?: ReadonlyArray<KeyOption<ItemType>>;
+  threshold?: Ranking;
+  baseSort?: BaseSorter<ItemType>;
+  keepDiacritics?: boolean;
+  sorter?: Sorter<ItemType>;
+}
+declare const rankings: {
+  readonly CASE_SENSITIVE_EQUAL: 7;
+  readonly EQUAL: 6;
+  readonly STARTS_WITH: 5;
+  readonly WORD_STARTS_WITH: 4;
+  readonly CONTAINS: 3;
+  readonly ACRONYM: 2;
+  readonly MATCHES: 1;
+  readonly NO_MATCH: 0;
+};
+type Ranking = (typeof rankings)[keyof typeof rankings];
+declare const defaultBaseSortFn: BaseSorter<unknown>;
+/**
+ * Takes an array of items and a value and returns a new array with the items that match the given value
+ * @param items - the items to sort
+ * @param value - the value to use for ranking
+ * @param options - Some options to configure the sorter
+ * @returns - the new sorted array
+ */
+declare function matchSorter<ItemType = string>(items: ReadonlyArray<ItemType>, value: string, options?: MatchSorterOptions<ItemType>): Array<ItemType>;
+declare namespace matchSorter {
+  var rankings: {
+    readonly CASE_SENSITIVE_EQUAL: 7;
+    readonly EQUAL: 6;
+    readonly STARTS_WITH: 5;
+    readonly WORD_STARTS_WITH: 4;
+    readonly CONTAINS: 3;
+    readonly ACRONYM: 2;
+    readonly MATCHES: 1;
+    readonly NO_MATCH: 0;
+  };
+}
+//#endregion
+export { type KeyAttributes, type KeyAttributesOptions, type KeyOption, type MatchSorterOptions, type RankingInfo, type ValueGetterKey, defaultBaseSortFn, matchSorter, rankings };
+//# sourceMappingURL=match-sorter.d.cts.map

package/dist/match-sorter.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"match-sorter.d.cts","names":[],"sources":["../src/match-sorter.ts"],"sourcesContent":[],"mappings":";;;;UAyBU,aAAA,CAEI;EACA,SAAA,CAAA,EAFA,OAEA;EAAO,UAAA,EADP,OACO;EAEX,UAAA,EAFI,OAEO;AAIE;AAIW,UARxB,WAAA,CAUW;EAIX,WAAA,EAAU,MAAA;EAA4C,IAAA,EAZxD,OAYwD;EAAzB,QAAA,EAAA,MAAA;EAAa,YAAA,EAVpC,OAUoC,GAAA,SAAA;;AAAW,UAPrD,cASU,CAAA,QAAA,CAAA,CAAA;EACH,CAAA,IAAA,EATR,QASQ,CAAA,EAAA,MAAA,GATY,KASZ,CAAA,MAAA,CAAA;;UAPP,WAOgC,CAAA,QAAA,CAAA,CAAA;EAAX,IAAA,EANvB,QAMuB;EAAU,KAAA,EAAA,MAAA;AAAA;UAH/B,UAOsB,CAAA,QAAA,CAAA,SAPO,WAOP,EAPoB,WAOpB,CAPgC,QAOhC,CAAA,CAAA;UALtB,UAKK,CAAA,QAAA,CAAA,CAAA;EAA+C,CAAA,CAAA,EAJxD,UAIwD,CAJ7C,QAI6C,CAAA,EAAA,CAAA,EAJ/B,UAI+B,CAJpB,QAIoB,CAAA,CAAA,EAAA,MAAA;;UADpD,MACmC,CAAA,QAAA,CAAA,CAAA;EAAK,CAAA,UAAA,EAAnC,KAAmC,CAA7B,UAA6B,CAAlB,QAAkB,CAAA,CAAA,CAAA,EAAL,KAAK,CAAC,UAAD,CAAY,QAAZ,CAAA,CAAA;AAAA;UAGxC,oBACsB,CAAA,QAAA,CAAA,CAAA;EAAf,GAAA,CAAA,EAAA,MAAA,GAAA,cAAA,CAAe,QAAf,CAAA;EACH,SAAA,CAAA,EAAA,OAAA;EACC,UAAA,CAAA,EAAA,OAAA;EACA,UAAA,CAAA,EAAA,OAAA;;AAAO,KAGjB,SAAA,CAAA,QAAS,CAAA,GACV,oBADU,CACW,QADX,CAAA,GAEV,cAFU,CAEK,QAFL,CAAA,GAAA,MAAA;UAKJ,kBAJe,CAAA,WAAA,OAAA,CAAA,CAAA;EAArB,IAAA,CAAA,EAKK,aALL,CAKmB,SALnB,CAK6B,QAL7B,CAAA,CAAA;EACe,SAAA,CAAA,EAKL,OALK;EAAf,QAAA,CAAA,EAMS,UANT,CAMoB,QANpB,CAAA;EAAc,cAAA,CAAA,EAAA,OAAA;EAGR,MAAA,CAAA,EAKC,MALD,CAKQ,QALU,CAAA;;cAStB,QARiB,EAAA;EAAd,SAAA,oBAAA,EAAA,CAAA;EACK,SAAA,KAAA,EAAA,CAAA;EACU,SAAA,WAAA,EAAA,CAAA;EAAX,SAAA,gBAAA,EAAA,CAAA;EAEK,SAAA,QAAA,EAAA,CAAA;EAAP,SAAA,OAAA,EAAA,CAAA;EAAM,SAAA,OAAA,EAAA,CAAA;EAIX,SAAA,QASI,EAAA,CAAA;AAAA,CAAA;AAE4C,KAAjD,OAAA,GAEC,CAAA,OAFiB,QAGqC,CAAA,CAAA,MADnC,OAFqB,QAEX,CAAA;AAAA,cAA7B,iBAUc,EAVK,UAUL,CAAA,OAAA,CAAA;;;;;;;;AAIZ,iBAJC,WAAW,CAAA,WAAA,MAAA,CAAA,CAAA,KAAA,EACX,aADW,CACG,QADH,CAAA,EAAA,KAAA,EAAA,MAAA,EAAA,OAAA,CAAA,EAGT,kBAHS,CAGU,QAHV,CAAA,CAAA,EAIjB,KAJiB,CAIX,QAJW,CAAA;kBAAX,WAAA"}