@cleverbrush/deep 4.4.2 → 4.4.3

package/dist/deepExtend.d.ts

@@ -1,18 +1,24 @@
 type UnsafeMergeKey = '__proto__' | 'constructor' | 'prototype';
 type SafeMergeProps<T> = Omit<T, UnsafeMergeKey>;
 type SafeProp<T, K extends PropertyKey> = K extends keyof SafeMergeProps<T> ? SafeMergeProps<T>[K] : never;
+type DeepSafeMergeValue<T> = T extends readonly unknown[] ? {
+    [K in keyof T]: DeepSafeMergeValue<T[K]>;
+} : T extends Record<string, unknown> ? DeepSafeMergeProps<T> : T;
+type DeepSafeMergeProps<T> = {
+    [K in keyof SafeMergeProps<T>]: DeepSafeMergeValue<SafeProp<T, K>>;
+};
 /** Properties that exist in both `T1` and `T2`, typed as `T2`'s version. */
 export type CommonProps<T1, T2> = {
     [k in keyof SafeMergeProps<T1> & keyof SafeMergeProps<T2>]: SafeProp<T1, k> extends never ? never : SafeProp<T2, k> extends never ? never : SafeProp<T2, k>;
 };
 /** Properties present in `T1` but not in `T2`. */
-export type PropsInFirstOnly<T1, T2> = Omit<SafeMergeProps<T1>, keyof SafeMergeProps<T2>>;
+export type PropsInFirstOnly<T1, T2> = Omit<DeepSafeMergeProps<T1>, keyof SafeMergeProps<T2>>;
 /** Recursively merges two object types. Matching keys are merged; unique keys are kept. */
 export type MergeTwo<T1, T2> = PropsInFirstOnly<T1, T2> & PropsInFirstOnly<T2, T1> & {
-    [k in keyof CommonProps<T1, T2>]: SafeProp<T1, k> extends Record<string, unknown> ? SafeProp<T2, k> extends Record<string, unknown> ? MergeTwo<SafeProp<T1, k>, SafeProp<T2, k>> : SafeProp<T2, k> : SafeProp<T2, k>;
+    [k in keyof CommonProps<T1, T2>]: SafeProp<T1, k> extends Record<string, unknown> ? SafeProp<T2, k> extends Record<string, unknown> ? MergeTwo<SafeProp<T1, k>, SafeProp<T2, k>> : DeepSafeMergeValue<SafeProp<T2, k>> : DeepSafeMergeValue<SafeProp<T2, k>>;
 };
 /** Recursively merges a tuple of object types from left to right. */
-export type Merge<T extends unknown[]> = T['length'] extends 3 ? MergeTwo<T[0], MergeTwo<T[1], T[2]>> : T['length'] extends 2 ? MergeTwo<T[0], T[1]> : T['length'] extends 1 ? SafeMergeProps<T[0]> : T extends [...infer K, infer PL, infer L] ? Merge<[Merge<[...K]>, MergeTwo<PL, L>]> : never;
+export type Merge<T extends unknown[]> = T['length'] extends 3 ? MergeTwo<T[0], MergeTwo<T[1], T[2]>> : T['length'] extends 2 ? MergeTwo<T[0], T[1]> : T['length'] extends 1 ? DeepSafeMergeProps<T[0]> : T extends [...infer K, infer PL, infer L] ? Merge<[Merge<[...K]>, MergeTwo<PL, L>]> : never;
 /**
  * Deep-merges multiple objects into one. Later values override earlier ones;
  * nested objects are merged recursively rather than replaced.

package/dist/index.js

@@ -1,2 +1,2 @@
-var m=(r,c)=>{let s=r;c||(s=`string${r}`);let t=0;for(let o=0;o<s.length;o++){let i=s.charCodeAt(o);t=(t<<5)-t+i,t=t&t}return t};function M(r,c){if(c.indexOf(r)>-1)return;let s="",t=Object.keys(r).sort();for(let o=0;o<t.length;o+=1){let i=t[o],a=P(i),e=P(r[i],c);c.push(r[i]),s+=m(`object${a}${e}`,!0)}return m(s,!0)}function u(r,c){let s=c;return s===void 0&&(s=[]),!isNaN(r)&&typeof r!="string"?r:typeof r==="object"?M(r,s):m(String(r))}var P=u;var w=(r,c)=>Number.isNaN(r)&&Number.isNaN(c),x=(r,c,s)=>{let t=new Map,o=(...i)=>{let a=(y,p)=>{if(y.length!==p.length)return!1;if(y.length===0&&p.length===0)return!0;let l=s?.disregardArrayOrder?y.map(f=>f).sort((f,h)=>{let d=u(f),T=u(h);return d<T?1:-1}):y.map(f=>f),g=s?.disregardArrayOrder?p.map(f=>f).sort((f,h)=>{let d=u(f),T=u(h);return d<T?1:-1}):p.map(f=>f);for(let f=0;f<l.length;f++)if(!o(l[f],g[f]))return!1;return!0};if(i.length!==2)return!1;let[e,n]=i;if(e===n)return!0;if(typeof e!=typeof n)return!1;if(w(e,n))return!0;if(Array.isArray(e)&&!Array.isArray(n)||!Array.isArray(e)&&Array.isArray(n))return!1;if(Array.isArray(e)&&Array.isArray(n))return a(e,n);if(typeof e=="object"&&e!==null){if(t.get(e)===!0)return!1;if(t.set(e,!0),e instanceof Date&&n instanceof Date)return!isNaN(e)&&!isNaN(n)&&e.getTime()===n.getTime();let y=Object.keys(e),p=Object.keys(n);if(y.length!==p.length)return!1;y.sort(),p.sort();for(let l=0;l<y.length;l++){if(y[l]!==p[l])return!1;let g=e[y[l]],f=n[y[l]];if(!o(g,f))return!1}return!0}return!1};return o(r,c)};var O=((...r)=>{if(r.length===0)throw new Error("no arguments");if(typeof r[0]!="object"||r[0]===null)throw new Error("not a non-null object");let c={},s=(t,o)=>{let i=Object.keys(o);for(let a=0;a<i.length;a++){let e=i[a];b(e)||(!Object.hasOwn(t,e)||!(typeof t[e]=="object"&&t[e]!==null&&typeof o[e]=="object")||t[e]==null||o[e]==null?t[e]=o[e]:s(t[e],o[e]))}};for(let t=0;t<r.length;t++)if(typeof r[t]=="object"&&r[t]!==null&&r[t])s(c,r[t]);else throw new Error("not a non-null object");return c});function b(r){return r==="__proto__"||r==="constructor"||r==="prototype"}function k(r,c="."){let s=a=>typeof a=="object"&&a!==null&&!Array.isArray(a)&&Object.getPrototypeOf(a)===Object.prototype;if(!s(r))throw new Error("cannot flatten this object");let t=[],o={},i=(a,e="")=>{if(t.find(n=>n===a))throw new Error("circular reference detected");t.push(a),Object.keys(a).forEach(n=>{if(!s(a[n])){o[e?`${e}${c}${n}`:n]=a[n];return}i(a[n],e?`${e}${c}${n}`:n)}),t.pop()};return i(r),o}export{x as deepEqual,O as deepExtend,k as deepFlatten};
+var M=(e,o)=>{let s=e;o||(s=`string${e}`);let t=0;for(let a=0;a<s.length;a++){let f=s.charCodeAt(a);t=(t<<5)-t+f,t=t&t}return t};function k(e,o){if(o.indexOf(e)>-1)return;let s="",t=Object.keys(e).sort();for(let a=0;a<t.length;a+=1){let f=t[a],i=b(f),n=b(e[f],o);o.push(e[f]),s+=M(`object${i}${n}`,!0)}return M(s,!0)}function l(e,o){let s=o;return s===void 0&&(s=[]),!isNaN(e)&&typeof e!="string"?e:typeof e==="object"?k(e,s):M(String(e))}var b=l;var S=(e,o)=>Number.isNaN(e)&&Number.isNaN(o),m=(e,o,s)=>{let t=new Map,a=(...f)=>{let i=(c,y)=>{if(c.length!==y.length)return!1;if(c.length===0&&y.length===0)return!0;let p=s?.disregardArrayOrder?c.map(u=>u).sort((u,T)=>{let d=l(u),h=l(T);return d<h?1:-1}):c.map(u=>u),g=s?.disregardArrayOrder?y.map(u=>u).sort((u,T)=>{let d=l(u),h=l(T);return d<h?1:-1}):y.map(u=>u);for(let u=0;u<p.length;u++)if(!a(p[u],g[u]))return!1;return!0};if(f.length!==2)return!1;let[n,r]=f;if(n===r)return!0;if(typeof n!=typeof r)return!1;if(S(n,r))return!0;if(Array.isArray(n)&&!Array.isArray(r)||!Array.isArray(n)&&Array.isArray(r))return!1;if(Array.isArray(n)&&Array.isArray(r))return i(n,r);if(typeof n=="object"&&n!==null){if(t.get(n)===!0)return!1;if(t.set(n,!0),n instanceof Date&&r instanceof Date)return!isNaN(n)&&!isNaN(r)&&n.getTime()===r.getTime();let c=Object.keys(n),y=Object.keys(r);if(c.length!==y.length)return!1;c.sort(),y.sort();for(let p=0;p<c.length;p++){if(c[p]!==y[p])return!1;let g=n[c[p]],u=r[c[p]];if(!a(g,u))return!1}return!0}return!1};return a(e,o)};var O=((...e)=>{if(e.length===0)throw new Error("no arguments");if(typeof e[0]!="object"||e[0]===null)throw new Error("not a non-null object");let o={},s=(t,a,f)=>{let i=Object.keys(a);for(let n=0;n<i.length;n++){let r=i[n];if(x(r))continue;let c=a[r];if(!w(c)){P(t,r,c);continue}if(f.has(c)){P(t,r,f.get(c));continue}let y=Object.hasOwn(t,r)?t[r]:void 0,p=w(y)?y:A(c);f.set(c,p),s(p,c,f),P(t,r,p)}};for(let t=0;t<e.length;t++){let a=e[t];if(typeof a=="object"&&a!==null){let f=new WeakMap;f.set(a,o),s(o,a,f)}else throw new Error("not a non-null object")}return o});function x(e){return e==="__proto__"||e==="constructor"||e==="prototype"}function w(e){if(typeof e!="object"||e===null)return!1;if(Array.isArray(e))return!0;let o=Object.getPrototypeOf(e);return o===Object.prototype||o===null}function A(e){return Array.isArray(e)?[]:Object.getPrototypeOf(e)===null?Object.create(null):{}}function P(e,o,s){Object.defineProperty(e,o,{configurable:!0,enumerable:!0,value:s,writable:!0})}function j(e,o="."){let s=i=>typeof i=="object"&&i!==null&&!Array.isArray(i)&&Object.getPrototypeOf(i)===Object.prototype;if(!s(e))throw new Error("cannot flatten this object");let t=[],a={},f=(i,n="")=>{if(t.find(r=>r===i))throw new Error("circular reference detected");t.push(i),Object.keys(i).forEach(r=>{if(!s(i[r])){a[n?`${n}${o}${r}`:r]=i[r];return}f(i[r],n?`${n}${o}${r}`:r)}),t.pop()};return f(e),a}export{m as deepEqual,O as deepExtend,j as deepFlatten};
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/hashObject.ts","../src/deepEqual.ts","../src/deepExtend.ts","../src/deepFlatten.ts"],"sourcesContent":["const stringHash = (string: string, noType?: boolean) => {\n    let hashString = string;\n    if (!noType) {\n        hashString = `string${string}`;\n    }\n    let hash = 0;\n    for (let i = 0; i < hashString.length; i++) {\n        const character = hashString.charCodeAt(i);\n        hash = (hash << 5) - hash + character;\n        hash = hash & hash; // Convert to 32bit integer\n    }\n    return hash;\n};\n\nfunction objectHash(\n    obj: Record<string, any>,\n    exclude: any[]\n): number | undefined {\n    if (exclude.indexOf(obj) > -1) {\n        return undefined;\n    }\n    let hash = '';\n    const keys = Object.keys(obj).sort();\n    for (let index = 0; index < keys.length; index += 1) {\n        const key = keys[index];\n        const keyHash = hashFunc(key);\n        const attrHash = hashFunc(obj[key], exclude);\n        exclude.push(obj[key]);\n        hash += stringHash(`object${keyHash}${attrHash}`, true);\n    }\n    return stringHash(hash, true);\n}\n\n/**\n * Computes a 32-bit numeric hash for any value.\n *\n * Objects are hashed by recursively hashing their sorted keys and values;\n * circular references are detected via an internal exclusion list.\n *\n * @param unkType - The value to hash (object, string, number, etc.).\n * @param exclude - Internal array used for circular-reference detection.\n * @returns A 32-bit integer hash code.\n */\nexport function HashObject(unkType: any, exclude?: any[]): number {\n    let ex = exclude;\n    if (ex === undefined) {\n        ex = [];\n    }\n    // biome-ignore lint/suspicious/noGlobalIsNan: intentional coercion — isNaN returns true for non-numeric types like objects\n    if (!isNaN(unkType) && typeof unkType !== 'string') {\n        return unkType;\n    }\n    switch (typeof unkType) {\n        case 'object':\n            return objectHash(unkType, ex) as number;\n        default:\n            return stringHash(String(unkType)) as number;\n    }\n}\n\nconst hashFunc = HashObject;\n","import { HashObject } from './hashObject.js';\n\nconst isBothNaN = (v1: any, v2: any) => Number.isNaN(v1) && Number.isNaN(v2);\n\n/**\n * Compares two objects and returns true if they\n * have the same structure and values. Can work\n * with arrays and objects, nested objects,\n * recursive objects, dates, etc.\n * @param p1 first object\n * @param p2 second object\n * @param options additional options\n * @returns {boolean} `true` if the objects are equal, `false` otherwise\n */\nexport const deepEqual = (\n    p1: any,\n    p2: any,\n    options?: {\n        /**\n         * if true, the order of the elements in the array will be disregarded\n         * e.g. [1, 2] and [2, 1] will be considered equal\n         */\n        disregardArrayOrder?: boolean;\n    }\n): boolean => {\n    const cache = new Map();\n\n    const compare = (...args: any[]) => {\n        const arraysAreIdentical = (a1: any, a2: any) => {\n            if (a1.length !== a2.length) return false;\n            if (a1.length === 0 && a2.length === 0) return true;\n\n            const c1 = options?.disregardArrayOrder\n                ? a1\n                      .map((t: any) => t)\n                      .sort((l: any, r: any) => {\n                          const hash1 = HashObject(l);\n                          const hash2 = HashObject(r);\n                          return hash1 < hash2 ? 1 : -1;\n                      })\n                : a1.map((t: any) => t);\n            const c2 = options?.disregardArrayOrder\n                ? a2\n                      .map((t: any) => t)\n                      .sort((l: any, r: any) => {\n                          const hash1 = HashObject(l);\n                          const hash2 = HashObject(r);\n                          return hash1 < hash2 ? 1 : -1;\n                      })\n                : a2.map((t: any) => t);\n\n            for (let i = 0; i < c1.length; i++) {\n                if (!compare(c1[i], c2[i])) return false;\n            }\n            return true;\n        };\n\n        if (args.length !== 2) return false;\n        const [o1, o2] = args;\n        if (o1 === o2) return true;\n        if (typeof o1 !== typeof o2) return false;\n        if (isBothNaN(o1, o2)) return true;\n\n        if (\n            (Array.isArray(o1) && !Array.isArray(o2)) ||\n            (!Array.isArray(o1) && Array.isArray(o2))\n        ) {\n            return false;\n        }\n        if (Array.isArray(o1) && Array.isArray(o2)) {\n            return arraysAreIdentical(o1, o2);\n        }\n\n        if (typeof o1 === 'object' && o1 !== null) {\n            if (cache.get(o1) === true) {\n                return false;\n            }\n\n            cache.set(o1, true);\n\n            if (o1 instanceof Date && o2 instanceof Date) {\n                return (\n                    // biome-ignore lint/suspicious/noGlobalIsNan: isNaN coerces Date to number, which is the intended behavior here\n                    !isNaN(o1 as any) &&\n                    // biome-ignore lint/suspicious/noGlobalIsNan: isNaN coerces Date to number, which is the intended behavior here\n                    !isNaN(o2 as any) &&\n                    o1.getTime() === o2.getTime()\n                );\n            }\n\n            const keys1 = Object.keys(o1);\n            const keys2 = Object.keys(o2);\n            if (keys1.length !== keys2.length) return false;\n\n            keys1.sort();\n            keys2.sort();\n            for (let i = 0; i < keys1.length; i++) {\n                if (keys1[i] !== keys2[i]) {\n                    return false;\n                }\n\n                const v1 = o1[keys1[i]];\n                const v2 = o2[keys1[i]];\n                if (!compare(v1, v2)) return false;\n            }\n            return true;\n        }\n\n        return false;\n    };\n\n    return compare(p1, p2);\n};\n","type UnsafeMergeKey = '__proto__' | 'constructor' | 'prototype';\n\ntype SafeMergeProps<T> = Omit<T, UnsafeMergeKey>;\n\ntype SafeProp<T, K extends PropertyKey> = K extends keyof SafeMergeProps<T>\n    ? SafeMergeProps<T>[K]\n    : never;\n\n/** Properties that exist in both `T1` and `T2`, typed as `T2`'s version. */\nexport type CommonProps<T1, T2> = {\n    [k in keyof SafeMergeProps<T1> & keyof SafeMergeProps<T2>]: SafeProp<\n        T1,\n        k\n    > extends never\n        ? never\n        : SafeProp<T2, k> extends never\n          ? never\n          : SafeProp<T2, k>;\n};\n\n/** Properties present in `T1` but not in `T2`. */\nexport type PropsInFirstOnly<T1, T2> = Omit<\n    SafeMergeProps<T1>,\n    keyof SafeMergeProps<T2>\n>;\n\n/** Recursively merges two object types. Matching keys are merged; unique keys are kept. */\nexport type MergeTwo<T1, T2> = PropsInFirstOnly<T1, T2> &\n    PropsInFirstOnly<T2, T1> & {\n        [k in keyof CommonProps<T1, T2>]: SafeProp<T1, k> extends Record<\n            string,\n            unknown\n        >\n            ? SafeProp<T2, k> extends Record<string, unknown>\n                ? MergeTwo<SafeProp<T1, k>, SafeProp<T2, k>>\n                : SafeProp<T2, k>\n            : SafeProp<T2, k>;\n    };\n\n/** Recursively merges a tuple of object types from left to right. */\nexport type Merge<T extends unknown[]> = T['length'] extends 3\n    ? MergeTwo<T[0], MergeTwo<T[1], T[2]>>\n    : T['length'] extends 2\n      ? MergeTwo<T[0], T[1]>\n      : T['length'] extends 1\n        ? SafeMergeProps<T[0]>\n        : T extends [...infer K, infer PL, infer L]\n          ? Merge<[Merge<[...K]>, MergeTwo<PL, L>]>\n          : never;\n\n/**\n * Deep-merges multiple objects into one. Later values override earlier ones;\n * nested objects are merged recursively rather than replaced.\n * Prototype-polluting keys (`__proto__`, `constructor`, and `prototype`) are\n * ignored.\n *\n * @example\n * ```ts\n * const a = { x: 1, nested: { a: true } };\n * const b = { y: 2, nested: { b: false } };\n * const result = deepExtend(a, b);\n * // { x: 1, y: 2, nested: { a: true, b: false } }\n * ```\n *\n * @param args - Two or more non-null objects to merge.\n * @returns A new object containing the deep-merged result.\n * @throws If no arguments are provided or any argument is not a non-null object.\n */\nexport const deepExtend = ((...rest) => {\n    if (rest.length === 0) throw new Error('no arguments');\n    if (typeof rest[0] !== 'object' || rest[0] === null)\n        throw new Error('not a non-null object');\n\n    const result = {};\n\n    const extendObject = (o1: any, o2: any) => {\n        const keys = Object.keys(o2);\n\n        for (let i = 0; i < keys.length; i++) {\n            const key = keys[i];\n            if (isUnsafeMergeKey(key)) continue;\n\n            if (\n                !Object.hasOwn(o1, key) ||\n                !(\n                    typeof o1[key] === 'object' &&\n                    o1[key] !== null &&\n                    typeof o2[key] === 'object'\n                )\n            ) {\n                o1[key] = o2[key];\n            } else {\n                if (o1[key] == null || o2[key] == null) {\n                    o1[key] = o2[key];\n                } else {\n                    extendObject(o1[key], o2[key]);\n                }\n            }\n        }\n    };\n\n    for (let i = 0; i < rest.length; i++) {\n        if (typeof rest[i] === 'object' && rest[i] !== null && rest[i]) {\n            extendObject(result, rest[i]);\n        } else {\n            throw new Error('not a non-null object');\n        }\n    }\n\n    return result;\n}) as <T extends unknown[]>(...args: T) => Merge<T>;\n\nfunction isUnsafeMergeKey(key: string): boolean {\n    return key === '__proto__' || key === 'constructor' || key === 'prototype';\n}\n","/**\n * Flattens an object to a single level, with the nested keys separated by a `delimiter`.\n * @example\n * ```ts\n * deepFlatten({ a: { b: 1, c: 2 } });\n * // => { 'a.b': 1, 'a.c': 2 }\n *\n * deepFlatten({ a: { b: 1, c: 2 } }, '/');\n * // => { 'a/b': 1, 'a/c': 2 }\n *\n * deepFlatten({ a: { b: 1, c: { d: 'some val' } }, d: 3 });\n * // => { 'a.b': 1, 'a.c.d': 'some val', d: 3 }\n *\n * ```\n * @param {string} [delimiter]\n */\nexport function deepFlatten(\n    obj: Record<string, any>,\n    delimiter = '.'\n): Record<string, any> {\n    const shouldFlatten = (obj: any) =>\n        typeof obj === 'object' &&\n        obj !== null &&\n        !Array.isArray(obj) &&\n        Object.getPrototypeOf(obj) === Object.prototype;\n\n    if (!shouldFlatten(obj)) throw new Error('cannot flatten this object');\n\n    const stack: any[] = [];\n\n    const result: Record<string, any> = {};\n\n    const deepFlattenHelper = (obj: any, prefix = '') => {\n        if (stack.find(o => o === obj))\n            throw new Error('circular reference detected');\n\n        stack.push(obj);\n\n        Object.keys(obj).forEach(key => {\n            if (!shouldFlatten(obj[key])) {\n                result[prefix ? `${prefix}${delimiter}${key}` : key] = obj[key];\n                return;\n            }\n            deepFlattenHelper(\n                obj[key],\n                prefix ? `${prefix}${delimiter}${key}` : key\n            );\n        });\n\n        stack.pop();\n    };\n\n    deepFlattenHelper(obj);\n\n    return result;\n}\n"],"mappings":"AAAA,IAAMA,EAAa,CAACC,EAAgBC,IAAqB,CACrD,IAAIC,EAAaF,EACZC,IACDC,EAAa,SAASF,CAAM,IAEhC,IAAIG,EAAO,EACX,QAASC,EAAI,EAAGA,EAAIF,EAAW,OAAQE,IAAK,CACxC,IAAMC,EAAYH,EAAW,WAAWE,CAAC,EACzCD,GAAQA,GAAQ,GAAKA,EAAOE,EAC5BF,EAAOA,EAAOA,CAClB,CACA,OAAOA,CACX,EAEA,SAASG,EACLC,EACAC,EACkB,CAClB,GAAIA,EAAQ,QAAQD,CAAG,EAAI,GACvB,OAEJ,IAAIJ,EAAO,GACLM,EAAO,OAAO,KAAKF,CAAG,EAAE,KAAK,EACnC,QAASG,EAAQ,EAAGA,EAAQD,EAAK,OAAQC,GAAS,EAAG,CACjD,IAAMC,EAAMF,EAAKC,CAAK,EAChBE,EAAUC,EAASF,CAAG,EACtBG,EAAWD,EAASN,EAAII,CAAG,EAAGH,CAAO,EAC3CA,EAAQ,KAAKD,EAAII,CAAG,CAAC,EACrBR,GAAQJ,EAAW,SAASa,CAAO,GAAGE,CAAQ,GAAI,EAAI,CAC1D,CACA,OAAOf,EAAWI,EAAM,EAAI,CAChC,CAYO,SAASY,EAAWC,EAAcR,EAAyB,CAC9D,IAAIS,EAAKT,EAKT,OAJIS,IAAO,SACPA,EAAK,CAAC,GAGN,CAAC,MAAMD,CAAO,GAAK,OAAOA,GAAY,SAC/BA,EAEH,OAAOA,IACN,SACMV,EAAWU,EAASC,CAAE,EAEtBlB,EAAW,OAAOiB,CAAO,CAAC,CAE7C,CAEA,IAAMH,EAAWE,EC1DjB,IAAMG,EAAY,CAACC,EAASC,IAAY,OAAO,MAAMD,CAAE,GAAK,OAAO,MAAMC,CAAE,EAY9DC,EAAY,CACrBC,EACAC,EACAC,IAOU,CACV,IAAMC,EAAQ,IAAI,IAEZC,EAAU,IAAIC,IAAgB,CAChC,IAAMC,EAAqB,CAACC,EAASC,IAAY,CAC7C,GAAID,EAAG,SAAWC,EAAG,OAAQ,MAAO,GACpC,GAAID,EAAG,SAAW,GAAKC,EAAG,SAAW,EAAG,MAAO,GAE/C,IAAMC,EAAKP,GAAS,oBACdK,EACK,IAAKG,GAAWA,CAAC,EACjB,KAAK,CAACC,EAAQC,IAAW,CACtB,IAAMC,EAAQC,EAAWH,CAAC,EACpBI,EAAQD,EAAWF,CAAC,EAC1B,OAAOC,EAAQE,EAAQ,EAAI,EAC/B,CAAC,EACLR,EAAG,IAAKG,GAAWA,CAAC,EACpBM,EAAKd,GAAS,oBACdM,EACK,IAAKE,GAAWA,CAAC,EACjB,KAAK,CAACC,EAAQC,IAAW,CACtB,IAAMC,EAAQC,EAAWH,CAAC,EACpBI,EAAQD,EAAWF,CAAC,EAC1B,OAAOC,EAAQE,EAAQ,EAAI,EAC/B,CAAC,EACLP,EAAG,IAAKE,GAAWA,CAAC,EAE1B,QAASO,EAAI,EAAGA,EAAIR,EAAG,OAAQQ,IAC3B,GAAI,CAACb,EAAQK,EAAGQ,CAAC,EAAGD,EAAGC,CAAC,CAAC,EAAG,MAAO,GAEvC,MAAO,EACX,EAEA,GAAIZ,EAAK,SAAW,EAAG,MAAO,GAC9B,GAAM,CAACa,EAAIC,CAAE,EAAId,EACjB,GAAIa,IAAOC,EAAI,MAAO,GACtB,GAAI,OAAOD,GAAO,OAAOC,EAAI,MAAO,GACpC,GAAIvB,EAAUsB,EAAIC,CAAE,EAAG,MAAO,GAE9B,GACK,MAAM,QAAQD,CAAE,GAAK,CAAC,MAAM,QAAQC,CAAE,GACtC,CAAC,MAAM,QAAQD,CAAE,GAAK,MAAM,QAAQC,CAAE,EAEvC,MAAO,GAEX,GAAI,MAAM,QAAQD,CAAE,GAAK,MAAM,QAAQC,CAAE,EACrC,OAAOb,EAAmBY,EAAIC,CAAE,EAGpC,GAAI,OAAOD,GAAO,UAAYA,IAAO,KAAM,CACvC,GAAIf,EAAM,IAAIe,CAAE,IAAM,GAClB,MAAO,GAKX,GAFAf,EAAM,IAAIe,EAAI,EAAI,EAEdA,aAAc,MAAQC,aAAc,KACpC,MAEI,CAAC,MAAMD,CAAS,GAEhB,CAAC,MAAMC,CAAS,GAChBD,EAAG,QAAQ,IAAMC,EAAG,QAAQ,EAIpC,IAAMC,EAAQ,OAAO,KAAKF,CAAE,EACtBG,EAAQ,OAAO,KAAKF,CAAE,EAC5B,GAAIC,EAAM,SAAWC,EAAM,OAAQ,MAAO,GAE1CD,EAAM,KAAK,EACXC,EAAM,KAAK,EACX,QAASJ,EAAI,EAAGA,EAAIG,EAAM,OAAQH,IAAK,CACnC,GAAIG,EAAMH,CAAC,IAAMI,EAAMJ,CAAC,EACpB,MAAO,GAGX,IAAMpB,EAAKqB,EAAGE,EAAMH,CAAC,CAAC,EAChBnB,EAAKqB,EAAGC,EAAMH,CAAC,CAAC,EACtB,GAAI,CAACb,EAAQP,EAAIC,CAAE,EAAG,MAAO,EACjC,CACA,MAAO,EACX,CAEA,MAAO,EACX,EAEA,OAAOM,EAAQJ,EAAIC,CAAE,CACzB,EC5CO,IAAMqB,GAAc,IAAIC,IAAS,CACpC,GAAIA,EAAK,SAAW,EAAG,MAAM,IAAI,MAAM,cAAc,EACrD,GAAI,OAAOA,EAAK,CAAC,GAAM,UAAYA,EAAK,CAAC,IAAM,KAC3C,MAAM,IAAI,MAAM,uBAAuB,EAE3C,IAAMC,EAAS,CAAC,EAEVC,EAAe,CAACC,EAASC,IAAY,CACvC,IAAMC,EAAO,OAAO,KAAKD,CAAE,EAE3B,QAASE,EAAI,EAAGA,EAAID,EAAK,OAAQC,IAAK,CAClC,IAAMC,EAAMF,EAAKC,CAAC,EACdE,EAAiBD,CAAG,IAGpB,CAAC,OAAO,OAAOJ,EAAII,CAAG,GACtB,EACI,OAAOJ,EAAGI,CAAG,GAAM,UACnBJ,EAAGI,CAAG,IAAM,MACZ,OAAOH,EAAGG,CAAG,GAAM,WAKnBJ,EAAGI,CAAG,GAAK,MAAQH,EAAGG,CAAG,GAAK,KAFlCJ,EAAGI,CAAG,EAAIH,EAAGG,CAAG,EAKZL,EAAaC,EAAGI,CAAG,EAAGH,EAAGG,CAAG,CAAC,EAGzC,CACJ,EAEA,QAASD,EAAI,EAAGA,EAAIN,EAAK,OAAQM,IAC7B,GAAI,OAAON,EAAKM,CAAC,GAAM,UAAYN,EAAKM,CAAC,IAAM,MAAQN,EAAKM,CAAC,EACzDJ,EAAaD,EAAQD,EAAKM,CAAC,CAAC,MAE5B,OAAM,IAAI,MAAM,uBAAuB,EAI/C,OAAOL,CACX,GAEA,SAASO,EAAiBD,EAAsB,CAC5C,OAAOA,IAAQ,aAAeA,IAAQ,eAAiBA,IAAQ,WACnE,CClGO,SAASE,EACZC,EACAC,EAAY,IACO,CACnB,IAAMC,EAAiBF,GACnB,OAAOA,GAAQ,UACfA,IAAQ,MACR,CAAC,MAAM,QAAQA,CAAG,GAClB,OAAO,eAAeA,CAAG,IAAM,OAAO,UAE1C,GAAI,CAACE,EAAcF,CAAG,EAAG,MAAM,IAAI,MAAM,4BAA4B,EAErE,IAAMG,EAAe,CAAC,EAEhBC,EAA8B,CAAC,EAE/BC,EAAoB,CAACL,EAAUM,EAAS,KAAO,CACjD,GAAIH,EAAM,KAAKI,GAAKA,IAAMP,CAAG,EACzB,MAAM,IAAI,MAAM,6BAA6B,EAEjDG,EAAM,KAAKH,CAAG,EAEd,OAAO,KAAKA,CAAG,EAAE,QAAQQ,GAAO,CAC5B,GAAI,CAACN,EAAcF,EAAIQ,CAAG,CAAC,EAAG,CAC1BJ,EAAOE,EAAS,GAAGA,CAAM,GAAGL,CAAS,GAAGO,CAAG,GAAKA,CAAG,EAAIR,EAAIQ,CAAG,EAC9D,MACJ,CACAH,EACIL,EAAIQ,CAAG,EACPF,EAAS,GAAGA,CAAM,GAAGL,CAAS,GAAGO,CAAG,GAAKA,CAC7C,CACJ,CAAC,EAEDL,EAAM,IAAI,CACd,EAEA,OAAAE,EAAkBL,CAAG,EAEdI,CACX","names":["stringHash","string","noType","hashString","hash","i","character","objectHash","obj","exclude","keys","index","key","keyHash","hashFunc","attrHash","HashObject","unkType","ex","isBothNaN","v1","v2","deepEqual","p1","p2","options","cache","compare","args","arraysAreIdentical","a1","a2","c1","t","l","r","hash1","HashObject","hash2","c2","i","o1","o2","keys1","keys2","deepExtend","rest","result","extendObject","o1","o2","keys","i","key","isUnsafeMergeKey","deepFlatten","obj","delimiter","shouldFlatten","stack","result","deepFlattenHelper","prefix","o","key"]}
+{"version":3,"sources":["../src/hashObject.ts","../src/deepEqual.ts","../src/deepExtend.ts","../src/deepFlatten.ts"],"sourcesContent":["const stringHash = (string: string, noType?: boolean) => {\n    let hashString = string;\n    if (!noType) {\n        hashString = `string${string}`;\n    }\n    let hash = 0;\n    for (let i = 0; i < hashString.length; i++) {\n        const character = hashString.charCodeAt(i);\n        hash = (hash << 5) - hash + character;\n        hash = hash & hash; // Convert to 32bit integer\n    }\n    return hash;\n};\n\nfunction objectHash(\n    obj: Record<string, any>,\n    exclude: any[]\n): number | undefined {\n    if (exclude.indexOf(obj) > -1) {\n        return undefined;\n    }\n    let hash = '';\n    const keys = Object.keys(obj).sort();\n    for (let index = 0; index < keys.length; index += 1) {\n        const key = keys[index];\n        const keyHash = hashFunc(key);\n        const attrHash = hashFunc(obj[key], exclude);\n        exclude.push(obj[key]);\n        hash += stringHash(`object${keyHash}${attrHash}`, true);\n    }\n    return stringHash(hash, true);\n}\n\n/**\n * Computes a 32-bit numeric hash for any value.\n *\n * Objects are hashed by recursively hashing their sorted keys and values;\n * circular references are detected via an internal exclusion list.\n *\n * @param unkType - The value to hash (object, string, number, etc.).\n * @param exclude - Internal array used for circular-reference detection.\n * @returns A 32-bit integer hash code.\n */\nexport function HashObject(unkType: any, exclude?: any[]): number {\n    let ex = exclude;\n    if (ex === undefined) {\n        ex = [];\n    }\n    // biome-ignore lint/suspicious/noGlobalIsNan: intentional coercion — isNaN returns true for non-numeric types like objects\n    if (!isNaN(unkType) && typeof unkType !== 'string') {\n        return unkType;\n    }\n    switch (typeof unkType) {\n        case 'object':\n            return objectHash(unkType, ex) as number;\n        default:\n            return stringHash(String(unkType)) as number;\n    }\n}\n\nconst hashFunc = HashObject;\n","import { HashObject } from './hashObject.js';\n\nconst isBothNaN = (v1: any, v2: any) => Number.isNaN(v1) && Number.isNaN(v2);\n\n/**\n * Compares two objects and returns true if they\n * have the same structure and values. Can work\n * with arrays and objects, nested objects,\n * recursive objects, dates, etc.\n * @param p1 first object\n * @param p2 second object\n * @param options additional options\n * @returns {boolean} `true` if the objects are equal, `false` otherwise\n */\nexport const deepEqual = (\n    p1: any,\n    p2: any,\n    options?: {\n        /**\n         * if true, the order of the elements in the array will be disregarded\n         * e.g. [1, 2] and [2, 1] will be considered equal\n         */\n        disregardArrayOrder?: boolean;\n    }\n): boolean => {\n    const cache = new Map();\n\n    const compare = (...args: any[]) => {\n        const arraysAreIdentical = (a1: any, a2: any) => {\n            if (a1.length !== a2.length) return false;\n            if (a1.length === 0 && a2.length === 0) return true;\n\n            const c1 = options?.disregardArrayOrder\n                ? a1\n                      .map((t: any) => t)\n                      .sort((l: any, r: any) => {\n                          const hash1 = HashObject(l);\n                          const hash2 = HashObject(r);\n                          return hash1 < hash2 ? 1 : -1;\n                      })\n                : a1.map((t: any) => t);\n            const c2 = options?.disregardArrayOrder\n                ? a2\n                      .map((t: any) => t)\n                      .sort((l: any, r: any) => {\n                          const hash1 = HashObject(l);\n                          const hash2 = HashObject(r);\n                          return hash1 < hash2 ? 1 : -1;\n                      })\n                : a2.map((t: any) => t);\n\n            for (let i = 0; i < c1.length; i++) {\n                if (!compare(c1[i], c2[i])) return false;\n            }\n            return true;\n        };\n\n        if (args.length !== 2) return false;\n        const [o1, o2] = args;\n        if (o1 === o2) return true;\n        if (typeof o1 !== typeof o2) return false;\n        if (isBothNaN(o1, o2)) return true;\n\n        if (\n            (Array.isArray(o1) && !Array.isArray(o2)) ||\n            (!Array.isArray(o1) && Array.isArray(o2))\n        ) {\n            return false;\n        }\n        if (Array.isArray(o1) && Array.isArray(o2)) {\n            return arraysAreIdentical(o1, o2);\n        }\n\n        if (typeof o1 === 'object' && o1 !== null) {\n            if (cache.get(o1) === true) {\n                return false;\n            }\n\n            cache.set(o1, true);\n\n            if (o1 instanceof Date && o2 instanceof Date) {\n                return (\n                    // biome-ignore lint/suspicious/noGlobalIsNan: isNaN coerces Date to number, which is the intended behavior here\n                    !isNaN(o1 as any) &&\n                    // biome-ignore lint/suspicious/noGlobalIsNan: isNaN coerces Date to number, which is the intended behavior here\n                    !isNaN(o2 as any) &&\n                    o1.getTime() === o2.getTime()\n                );\n            }\n\n            const keys1 = Object.keys(o1);\n            const keys2 = Object.keys(o2);\n            if (keys1.length !== keys2.length) return false;\n\n            keys1.sort();\n            keys2.sort();\n            for (let i = 0; i < keys1.length; i++) {\n                if (keys1[i] !== keys2[i]) {\n                    return false;\n                }\n\n                const v1 = o1[keys1[i]];\n                const v2 = o2[keys1[i]];\n                if (!compare(v1, v2)) return false;\n            }\n            return true;\n        }\n\n        return false;\n    };\n\n    return compare(p1, p2);\n};\n","type UnsafeMergeKey = '__proto__' | 'constructor' | 'prototype';\n\ntype SafeMergeProps<T> = Omit<T, UnsafeMergeKey>;\n\ntype SafeProp<T, K extends PropertyKey> = K extends keyof SafeMergeProps<T>\n    ? SafeMergeProps<T>[K]\n    : never;\n\ntype DeepSafeMergeValue<T> = T extends readonly unknown[]\n    ? { [K in keyof T]: DeepSafeMergeValue<T[K]> }\n    : T extends Record<string, unknown>\n      ? DeepSafeMergeProps<T>\n      : T;\n\ntype DeepSafeMergeProps<T> = {\n    [K in keyof SafeMergeProps<T>]: DeepSafeMergeValue<SafeProp<T, K>>;\n};\n\n/** Properties that exist in both `T1` and `T2`, typed as `T2`'s version. */\nexport type CommonProps<T1, T2> = {\n    [k in keyof SafeMergeProps<T1> & keyof SafeMergeProps<T2>]: SafeProp<\n        T1,\n        k\n    > extends never\n        ? never\n        : SafeProp<T2, k> extends never\n          ? never\n          : SafeProp<T2, k>;\n};\n\n/** Properties present in `T1` but not in `T2`. */\nexport type PropsInFirstOnly<T1, T2> = Omit<\n    DeepSafeMergeProps<T1>,\n    keyof SafeMergeProps<T2>\n>;\n\n/** Recursively merges two object types. Matching keys are merged; unique keys are kept. */\nexport type MergeTwo<T1, T2> = PropsInFirstOnly<T1, T2> &\n    PropsInFirstOnly<T2, T1> & {\n        [k in keyof CommonProps<T1, T2>]: SafeProp<T1, k> extends Record<\n            string,\n            unknown\n        >\n            ? SafeProp<T2, k> extends Record<string, unknown>\n                ? MergeTwo<SafeProp<T1, k>, SafeProp<T2, k>>\n                : DeepSafeMergeValue<SafeProp<T2, k>>\n            : DeepSafeMergeValue<SafeProp<T2, k>>;\n    };\n\n/** Recursively merges a tuple of object types from left to right. */\nexport type Merge<T extends unknown[]> = T['length'] extends 3\n    ? MergeTwo<T[0], MergeTwo<T[1], T[2]>>\n    : T['length'] extends 2\n      ? MergeTwo<T[0], T[1]>\n      : T['length'] extends 1\n        ? DeepSafeMergeProps<T[0]>\n        : T extends [...infer K, infer PL, infer L]\n          ? Merge<[Merge<[...K]>, MergeTwo<PL, L>]>\n          : never;\n\n/**\n * Deep-merges multiple objects into one. Later values override earlier ones;\n * nested objects are merged recursively rather than replaced.\n * Prototype-polluting keys (`__proto__`, `constructor`, and `prototype`) are\n * ignored.\n *\n * @example\n * ```ts\n * const a = { x: 1, nested: { a: true } };\n * const b = { y: 2, nested: { b: false } };\n * const result = deepExtend(a, b);\n * // { x: 1, y: 2, nested: { a: true, b: false } }\n * ```\n *\n * @param args - Two or more non-null objects to merge.\n * @returns A new object containing the deep-merged result.\n * @throws If no arguments are provided or any argument is not a non-null object.\n */\nexport const deepExtend = ((...rest) => {\n    if (rest.length === 0) throw new Error('no arguments');\n    if (typeof rest[0] !== 'object' || rest[0] === null)\n        throw new Error('not a non-null object');\n\n    const result = {};\n\n    const extendObject = (\n        o1: any,\n        o2: any,\n        copiedObjects: WeakMap<object, object>\n    ) => {\n        const keys = Object.keys(o2);\n\n        for (let i = 0; i < keys.length; i++) {\n            const key = keys[i];\n            if (isUnsafeMergeKey(key)) continue;\n\n            const sourceValue = o2[key];\n            if (!isMergeableObject(sourceValue)) {\n                defineMergeProperty(o1, key, sourceValue);\n                continue;\n            }\n\n            if (copiedObjects.has(sourceValue)) {\n                defineMergeProperty(o1, key, copiedObjects.get(sourceValue));\n                continue;\n            }\n\n            const targetValue = Object.hasOwn(o1, key) ? o1[key] : undefined;\n            const targetBranch = isMergeableObject(targetValue)\n                ? targetValue\n                : createMergeTarget(sourceValue);\n\n            copiedObjects.set(sourceValue, targetBranch);\n            extendObject(targetBranch, sourceValue, copiedObjects);\n            defineMergeProperty(o1, key, targetBranch);\n        }\n    };\n\n    for (let i = 0; i < rest.length; i++) {\n        const source = rest[i];\n        if (typeof source === 'object' && source !== null) {\n            const copiedObjects = new WeakMap<object, object>();\n            copiedObjects.set(source, result);\n            extendObject(result, source, copiedObjects);\n        } else {\n            throw new Error('not a non-null object');\n        }\n    }\n\n    return result;\n}) as <T extends unknown[]>(...args: T) => Merge<T>;\n\nfunction isUnsafeMergeKey(key: string): boolean {\n    return key === '__proto__' || key === 'constructor' || key === 'prototype';\n}\n\nfunction isMergeableObject(value: unknown): value is Record<string, unknown> {\n    if (typeof value !== 'object' || value === null) return false;\n    if (Array.isArray(value)) return true;\n\n    const prototype = Object.getPrototypeOf(value);\n    return prototype === Object.prototype || prototype === null;\n}\n\nfunction createMergeTarget(source: Record<string, unknown>): object {\n    if (Array.isArray(source)) return [];\n    return Object.getPrototypeOf(source) === null ? Object.create(null) : {};\n}\n\nfunction defineMergeProperty(\n    target: object,\n    key: string,\n    value: unknown\n): void {\n    Object.defineProperty(target, key, {\n        configurable: true,\n        enumerable: true,\n        value,\n        writable: true\n    });\n}\n","/**\n * Flattens an object to a single level, with the nested keys separated by a `delimiter`.\n * @example\n * ```ts\n * deepFlatten({ a: { b: 1, c: 2 } });\n * // => { 'a.b': 1, 'a.c': 2 }\n *\n * deepFlatten({ a: { b: 1, c: 2 } }, '/');\n * // => { 'a/b': 1, 'a/c': 2 }\n *\n * deepFlatten({ a: { b: 1, c: { d: 'some val' } }, d: 3 });\n * // => { 'a.b': 1, 'a.c.d': 'some val', d: 3 }\n *\n * ```\n * @param {string} [delimiter]\n */\nexport function deepFlatten(\n    obj: Record<string, any>,\n    delimiter = '.'\n): Record<string, any> {\n    const shouldFlatten = (obj: any) =>\n        typeof obj === 'object' &&\n        obj !== null &&\n        !Array.isArray(obj) &&\n        Object.getPrototypeOf(obj) === Object.prototype;\n\n    if (!shouldFlatten(obj)) throw new Error('cannot flatten this object');\n\n    const stack: any[] = [];\n\n    const result: Record<string, any> = {};\n\n    const deepFlattenHelper = (obj: any, prefix = '') => {\n        if (stack.find(o => o === obj))\n            throw new Error('circular reference detected');\n\n        stack.push(obj);\n\n        Object.keys(obj).forEach(key => {\n            if (!shouldFlatten(obj[key])) {\n                result[prefix ? `${prefix}${delimiter}${key}` : key] = obj[key];\n                return;\n            }\n            deepFlattenHelper(\n                obj[key],\n                prefix ? `${prefix}${delimiter}${key}` : key\n            );\n        });\n\n        stack.pop();\n    };\n\n    deepFlattenHelper(obj);\n\n    return result;\n}\n"],"mappings":"AAAA,IAAMA,EAAa,CAACC,EAAgBC,IAAqB,CACrD,IAAIC,EAAaF,EACZC,IACDC,EAAa,SAASF,CAAM,IAEhC,IAAIG,EAAO,EACX,QAASC,EAAI,EAAGA,EAAIF,EAAW,OAAQE,IAAK,CACxC,IAAMC,EAAYH,EAAW,WAAWE,CAAC,EACzCD,GAAQA,GAAQ,GAAKA,EAAOE,EAC5BF,EAAOA,EAAOA,CAClB,CACA,OAAOA,CACX,EAEA,SAASG,EACLC,EACAC,EACkB,CAClB,GAAIA,EAAQ,QAAQD,CAAG,EAAI,GACvB,OAEJ,IAAIJ,EAAO,GACLM,EAAO,OAAO,KAAKF,CAAG,EAAE,KAAK,EACnC,QAASG,EAAQ,EAAGA,EAAQD,EAAK,OAAQC,GAAS,EAAG,CACjD,IAAMC,EAAMF,EAAKC,CAAK,EAChBE,EAAUC,EAASF,CAAG,EACtBG,EAAWD,EAASN,EAAII,CAAG,EAAGH,CAAO,EAC3CA,EAAQ,KAAKD,EAAII,CAAG,CAAC,EACrBR,GAAQJ,EAAW,SAASa,CAAO,GAAGE,CAAQ,GAAI,EAAI,CAC1D,CACA,OAAOf,EAAWI,EAAM,EAAI,CAChC,CAYO,SAASY,EAAWC,EAAcR,EAAyB,CAC9D,IAAIS,EAAKT,EAKT,OAJIS,IAAO,SACPA,EAAK,CAAC,GAGN,CAAC,MAAMD,CAAO,GAAK,OAAOA,GAAY,SAC/BA,EAEH,OAAOA,IACN,SACMV,EAAWU,EAASC,CAAE,EAEtBlB,EAAW,OAAOiB,CAAO,CAAC,CAE7C,CAEA,IAAMH,EAAWE,EC1DjB,IAAMG,EAAY,CAACC,EAASC,IAAY,OAAO,MAAMD,CAAE,GAAK,OAAO,MAAMC,CAAE,EAY9DC,EAAY,CACrBC,EACAC,EACAC,IAOU,CACV,IAAMC,EAAQ,IAAI,IAEZC,EAAU,IAAIC,IAAgB,CAChC,IAAMC,EAAqB,CAACC,EAASC,IAAY,CAC7C,GAAID,EAAG,SAAWC,EAAG,OAAQ,MAAO,GACpC,GAAID,EAAG,SAAW,GAAKC,EAAG,SAAW,EAAG,MAAO,GAE/C,IAAMC,EAAKP,GAAS,oBACdK,EACK,IAAKG,GAAWA,CAAC,EACjB,KAAK,CAACC,EAAQC,IAAW,CACtB,IAAMC,EAAQC,EAAWH,CAAC,EACpBI,EAAQD,EAAWF,CAAC,EAC1B,OAAOC,EAAQE,EAAQ,EAAI,EAC/B,CAAC,EACLR,EAAG,IAAKG,GAAWA,CAAC,EACpBM,EAAKd,GAAS,oBACdM,EACK,IAAKE,GAAWA,CAAC,EACjB,KAAK,CAACC,EAAQC,IAAW,CACtB,IAAMC,EAAQC,EAAWH,CAAC,EACpBI,EAAQD,EAAWF,CAAC,EAC1B,OAAOC,EAAQE,EAAQ,EAAI,EAC/B,CAAC,EACLP,EAAG,IAAKE,GAAWA,CAAC,EAE1B,QAASO,EAAI,EAAGA,EAAIR,EAAG,OAAQQ,IAC3B,GAAI,CAACb,EAAQK,EAAGQ,CAAC,EAAGD,EAAGC,CAAC,CAAC,EAAG,MAAO,GAEvC,MAAO,EACX,EAEA,GAAIZ,EAAK,SAAW,EAAG,MAAO,GAC9B,GAAM,CAACa,EAAIC,CAAE,EAAId,EACjB,GAAIa,IAAOC,EAAI,MAAO,GACtB,GAAI,OAAOD,GAAO,OAAOC,EAAI,MAAO,GACpC,GAAIvB,EAAUsB,EAAIC,CAAE,EAAG,MAAO,GAE9B,GACK,MAAM,QAAQD,CAAE,GAAK,CAAC,MAAM,QAAQC,CAAE,GACtC,CAAC,MAAM,QAAQD,CAAE,GAAK,MAAM,QAAQC,CAAE,EAEvC,MAAO,GAEX,GAAI,MAAM,QAAQD,CAAE,GAAK,MAAM,QAAQC,CAAE,EACrC,OAAOb,EAAmBY,EAAIC,CAAE,EAGpC,GAAI,OAAOD,GAAO,UAAYA,IAAO,KAAM,CACvC,GAAIf,EAAM,IAAIe,CAAE,IAAM,GAClB,MAAO,GAKX,GAFAf,EAAM,IAAIe,EAAI,EAAI,EAEdA,aAAc,MAAQC,aAAc,KACpC,MAEI,CAAC,MAAMD,CAAS,GAEhB,CAAC,MAAMC,CAAS,GAChBD,EAAG,QAAQ,IAAMC,EAAG,QAAQ,EAIpC,IAAMC,EAAQ,OAAO,KAAKF,CAAE,EACtBG,EAAQ,OAAO,KAAKF,CAAE,EAC5B,GAAIC,EAAM,SAAWC,EAAM,OAAQ,MAAO,GAE1CD,EAAM,KAAK,EACXC,EAAM,KAAK,EACX,QAASJ,EAAI,EAAGA,EAAIG,EAAM,OAAQH,IAAK,CACnC,GAAIG,EAAMH,CAAC,IAAMI,EAAMJ,CAAC,EACpB,MAAO,GAGX,IAAMpB,EAAKqB,EAAGE,EAAMH,CAAC,CAAC,EAChBnB,EAAKqB,EAAGC,EAAMH,CAAC,CAAC,EACtB,GAAI,CAACb,EAAQP,EAAIC,CAAE,EAAG,MAAO,EACjC,CACA,MAAO,EACX,CAEA,MAAO,EACX,EAEA,OAAOM,EAAQJ,EAAIC,CAAE,CACzB,EClCO,IAAMqB,GAAc,IAAIC,IAAS,CACpC,GAAIA,EAAK,SAAW,EAAG,MAAM,IAAI,MAAM,cAAc,EACrD,GAAI,OAAOA,EAAK,CAAC,GAAM,UAAYA,EAAK,CAAC,IAAM,KAC3C,MAAM,IAAI,MAAM,uBAAuB,EAE3C,IAAMC,EAAS,CAAC,EAEVC,EAAe,CACjBC,EACAC,EACAC,IACC,CACD,IAAMC,EAAO,OAAO,KAAKF,CAAE,EAE3B,QAASG,EAAI,EAAGA,EAAID,EAAK,OAAQC,IAAK,CAClC,IAAMC,EAAMF,EAAKC,CAAC,EAClB,GAAIE,EAAiBD,CAAG,EAAG,SAE3B,IAAME,EAAcN,EAAGI,CAAG,EAC1B,GAAI,CAACG,EAAkBD,CAAW,EAAG,CACjCE,EAAoBT,EAAIK,EAAKE,CAAW,EACxC,QACJ,CAEA,GAAIL,EAAc,IAAIK,CAAW,EAAG,CAChCE,EAAoBT,EAAIK,EAAKH,EAAc,IAAIK,CAAW,CAAC,EAC3D,QACJ,CAEA,IAAMG,EAAc,OAAO,OAAOV,EAAIK,CAAG,EAAIL,EAAGK,CAAG,EAAI,OACjDM,EAAeH,EAAkBE,CAAW,EAC5CA,EACAE,EAAkBL,CAAW,EAEnCL,EAAc,IAAIK,EAAaI,CAAY,EAC3CZ,EAAaY,EAAcJ,EAAaL,CAAa,EACrDO,EAAoBT,EAAIK,EAAKM,CAAY,CAC7C,CACJ,EAEA,QAASP,EAAI,EAAGA,EAAIP,EAAK,OAAQO,IAAK,CAClC,IAAMS,EAAShB,EAAKO,CAAC,EACrB,GAAI,OAAOS,GAAW,UAAYA,IAAW,KAAM,CAC/C,IAAMX,EAAgB,IAAI,QAC1BA,EAAc,IAAIW,EAAQf,CAAM,EAChCC,EAAaD,EAAQe,EAAQX,CAAa,CAC9C,KACI,OAAM,IAAI,MAAM,uBAAuB,CAE/C,CAEA,OAAOJ,CACX,GAEA,SAASQ,EAAiBD,EAAsB,CAC5C,OAAOA,IAAQ,aAAeA,IAAQ,eAAiBA,IAAQ,WACnE,CAEA,SAASG,EAAkBM,EAAkD,CACzE,GAAI,OAAOA,GAAU,UAAYA,IAAU,KAAM,MAAO,GACxD,GAAI,MAAM,QAAQA,CAAK,EAAG,MAAO,GAEjC,IAAMC,EAAY,OAAO,eAAeD,CAAK,EAC7C,OAAOC,IAAc,OAAO,WAAaA,IAAc,IAC3D,CAEA,SAASH,EAAkBC,EAAyC,CAChE,OAAI,MAAM,QAAQA,CAAM,EAAU,CAAC,EAC5B,OAAO,eAAeA,CAAM,IAAM,KAAO,OAAO,OAAO,IAAI,EAAI,CAAC,CAC3E,CAEA,SAASJ,EACLO,EACAX,EACAS,EACI,CACJ,OAAO,eAAeE,EAAQX,EAAK,CAC/B,aAAc,GACd,WAAY,GACZ,MAAAS,EACA,SAAU,EACd,CAAC,CACL,CChJO,SAASG,EACZC,EACAC,EAAY,IACO,CACnB,IAAMC,EAAiBF,GACnB,OAAOA,GAAQ,UACfA,IAAQ,MACR,CAAC,MAAM,QAAQA,CAAG,GAClB,OAAO,eAAeA,CAAG,IAAM,OAAO,UAE1C,GAAI,CAACE,EAAcF,CAAG,EAAG,MAAM,IAAI,MAAM,4BAA4B,EAErE,IAAMG,EAAe,CAAC,EAEhBC,EAA8B,CAAC,EAE/BC,EAAoB,CAACL,EAAUM,EAAS,KAAO,CACjD,GAAIH,EAAM,KAAKI,GAAKA,IAAMP,CAAG,EACzB,MAAM,IAAI,MAAM,6BAA6B,EAEjDG,EAAM,KAAKH,CAAG,EAEd,OAAO,KAAKA,CAAG,EAAE,QAAQQ,GAAO,CAC5B,GAAI,CAACN,EAAcF,EAAIQ,CAAG,CAAC,EAAG,CAC1BJ,EAAOE,EAAS,GAAGA,CAAM,GAAGL,CAAS,GAAGO,CAAG,GAAKA,CAAG,EAAIR,EAAIQ,CAAG,EAC9D,MACJ,CACAH,EACIL,EAAIQ,CAAG,EACPF,EAAS,GAAGA,CAAM,GAAGL,CAAS,GAAGO,CAAG,GAAKA,CAC7C,CACJ,CAAC,EAEDL,EAAM,IAAI,CACd,EAEA,OAAAE,EAAkBL,CAAG,EAEdI,CACX","names":["stringHash","string","noType","hashString","hash","i","character","objectHash","obj","exclude","keys","index","key","keyHash","hashFunc","attrHash","HashObject","unkType","ex","isBothNaN","v1","v2","deepEqual","p1","p2","options","cache","compare","args","arraysAreIdentical","a1","a2","c1","t","l","r","hash1","HashObject","hash2","c2","i","o1","o2","keys1","keys2","deepExtend","rest","result","extendObject","o1","o2","copiedObjects","keys","i","key","isUnsafeMergeKey","sourceValue","isMergeableObject","defineMergeProperty","targetValue","targetBranch","createMergeTarget","source","value","prototype","target","deepFlatten","obj","delimiter","shouldFlatten","stack","result","deepFlattenHelper","prefix","o","key"]}

package/package.json

@@ -37,5 +37,5 @@
     },
     "type": "module",
     "types": "./dist/index.d.ts",
-    "version": "4.4.2"
+    "version": "4.4.3"
 }