@komed3/deepmerge 1.0.0 → 1.1.0

package/LICENSE

@@ -1,21 +1,21 @@
-MIT License
-
-Copyright (c) 2026 Paul Köhler
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
+MIT License
+
+Copyright (c) 2026 Paul Köhler
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -36,7 +36,7 @@ Include the script in your HTML:
 ```html
 <script src="node_modules/@komed3/deepmerge/dist/index.umd.min.js"></script>
 <script>
-    const { factory } = deepmerge;
+  const { factory } = deepmerge;
 </script>
 ```
 
@@ -183,6 +183,7 @@ Control how arrays are handled during a merge using the built-in `ArrayMode` enu
 - `Keep`: Retains the target array and ignores the source.
 - `Concat`: Appends source elements to the target array.
 - `Unique`: Combines both arrays and removes duplicates.
+- `Reference`: Reference-based array merging (process objects by reference).
 
 ```ts
 import { factory, ArrayMode } from '@komed3/deepmerge';
@@ -196,5 +197,5 @@ console.log( target.ids ); // [ 1, 2, 3 ]
 
 ----
 
-Copyright (c) 2026 Paul Köhler (komed3). All rights reserved.  
-Released under the MIT license. See LICENSE file in the project root for details.
+Copyright (c) 2026 [Paul Köhler](https://komed3.de) (komed3). All rights reserved.  
+Released under the MIT license. See [LICENSE](./LICENSE) file in the project root for details.

package/dist/bundle.umd.js

@@ -158,12 +158,29 @@
           return (t, _) => t;
         case 'concat':
           return (t, s) => t.concat(s);
-        case 'unique':
+        case 'reference':
           return (t, s) => {
             const set = new Set(t);
             for (let i = 0; i < s.length; i++) set.add(s[i]);
             return Array.from(set);
           };
+        case 'unique':
+          return (t, s) => {
+            const map = new Map(),
+              add = (array) => {
+                for (let i = 0; i < array.length; i++) {
+                  const item = array[i];
+                  map.set(
+                    item && typeof item === 'object'
+                      ? JSON.stringify(item)
+                      : item,
+                    item
+                  );
+                }
+              };
+            (add(t), add(s));
+            return [...map.values()];
+          };
       }
       if (typeof mode === 'function') return mode;
       else throw new Error(`Invalid array merge mode: ${mode}`);

package/dist/bundle.umd.min.js

@@ -1 +1 @@
-!function(e,t){"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):t((e="undefined"!=typeof globalThis?globalThis:e||self).deepmerge={})}(this,function(e){"use strict";class t{cache;maxCacheSize;constructor(e={}){!1!==e.cache&&(this.cache=new Map),this.maxCacheSize=e.maxCacheSize??1e3}compile(e){if(!e)return Object.freeze({tokens:[]});if(this.cache){const t=this.cache.get(e);if(t)return t}const t=[];let r=0,n="";for(;r<e.length;){const s=e.charCodeAt(r);if(46!==s){if(91===s){n&&(t.push(n),n=""),r++;const s=r;for(;r<e.length&&93!==e.charCodeAt(r);)r++;const i=e.slice(s,r),c=i>>>0;String(c)===i?t.push(c):t.push(i),r++;continue}n+=e[r],r++}else n&&(t.push(n),n=""),r++}n&&t.push(n);const s=Object.freeze({tokens:t});return this.cache&&(this.cache.size>=this.maxCacheSize&&this.cache.clear(),this.cache.set(e,s)),s}isCompiled(e){return e&&Array.isArray(e.tokens)}normalize(e){return"string"==typeof e?this.compile(e):e}clearCache(){this.cache?.clear()}get size(){return this.cache?.size??0}}class r{path;constructor(e={}){this.path=new t(e)}isUnsafeKey(e){return"__proto__"===e||"constructor"===e||"prototype"===e}walk(e,t,r){const n=this.path.normalize(t).tokens;let s=e;for(let e=0;e<n.length-1;e++){const t=n[e];if(this.isUnsafeKey(t))return;let i=s?.[t];if(null==i){if(!r)return;i="number"==typeof n[e+1]?[]:{},s[t]=i}s=i}const i=n[n.length-1];return{parent:s,key:i,value:s?.[i]}}has(e,t){const r=this.path.normalize(t).tokens;let n=e;for(let e=0;e<r.length;e++){if(null==n)return!1;n=n[r[e]]}return!0}get(e,t){const r=this.path.normalize(t).tokens;let n=e;for(let e=0;e<r.length;e++){if(null==n)return;n=n[r[e]]}return n}set(e,t,r){const n=this.walk(e,t,!0);n&&(n.parent[n.key]=r)}delete(e,t){const r=this.walk(e,t,!1);r&&null!=r.parent&&delete r.parent[r.key]}update(e,t,r){const n=this.walk(e,t,!0);n&&(n.parent[n.key]=r(n.value))}}class n{protect;deep;mergeUndefined;strict;createObject;valueFn;arrayFn;path;constructor(e={}){this.protect=!!e.protect,this.deep=!1!==e.deep,this.mergeUndefined=!!e.mergeUndefined,this.strict=!!e.strict,this.createObject=e.createObject??(()=>Object.create(null)),this.valueFn=e.valueFn,this.arrayFn=this.compileArrayFn(e.arrayMode),this.path=new t(e.pathOptions)}compileArrayFn(e){switch(e??"replace"){case"replace":return(e,t)=>t;case"keep":return(e,t)=>e;case"concat":return(e,t)=>e.concat(t);case"unique":return(e,t)=>{const r=new Set(e);for(let e=0;e<t.length;e++)r.add(t[e]);return Array.from(r)}}if("function"==typeof e)return e;throw new Error(`Invalid array merge mode: ${e}`)}isUnsafeKey(e){return"__proto__"===e||"constructor"===e||"prototype"===e}mergeInto(e,t){if(null==t)return;const r=[[e,t]];for(;r.length;){const[e,t]=r.pop();for(const n in t){if(this.isUnsafeKey(n))continue;const s=t[n],i=e[n];if((void 0!==s||this.mergeUndefined)&&(!this.protect||!(n in e))){if(this.valueFn){const t=this.valueFn(n,i,s);if(void 0!==t){e[n]=t;continue}}if(Array.isArray(s))Array.isArray(i)?e[n]=this.arrayFn(i,s):e[n]=this.arrayFn([],s);else if(this.deep&&s&&"object"==typeof s)if(i&&"object"==typeof i)r.push([i,s]);else{if(this.strict)continue;const t=this.createObject();e[n]=t,r.push([t,s])}else e[n]=s}}}}merge(e,...t){for(let r=0;r<t.length;r++)this.mergeInto(e,t[r]);return e}mergeAt(e,t,...r){const n=this.path.normalize(t).tokens;let s=e;for(let t=0;t<n.length;t++){const r=n[t];if(this.isUnsafeKey(r))return e;let i=s[r];if(null==i){if(this.strict)return e;i="number"==typeof n[t+1]?[]:this.createObject(),s[r]=i}s=i}for(let e=0;e<r.length;e++)this.mergeInto(s,r[e]);return e}}e.Accessor=r,e.Merger=n,e.Path=t,e.factory=e=>Object.freeze({accessor:new r(e?.pathOptions),merger:new n(e),path:new t(e?.pathOptions)})});
+!function(e,t){"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):t((e="undefined"!=typeof globalThis?globalThis:e||self).deepmerge={})}(this,function(e){"use strict";class t{cache;maxCacheSize;constructor(e={}){!1!==e.cache&&(this.cache=new Map),this.maxCacheSize=e.maxCacheSize??1e3}compile(e){if(!e)return Object.freeze({tokens:[]});if(this.cache){const t=this.cache.get(e);if(t)return t}const t=[];let r=0,n="";for(;r<e.length;){const s=e.charCodeAt(r);if(46!==s){if(91===s){n&&(t.push(n),n=""),r++;const s=r;for(;r<e.length&&93!==e.charCodeAt(r);)r++;const i=e.slice(s,r),c=i>>>0;String(c)===i?t.push(c):t.push(i),r++;continue}n+=e[r],r++}else n&&(t.push(n),n=""),r++}n&&t.push(n);const s=Object.freeze({tokens:t});return this.cache&&(this.cache.size>=this.maxCacheSize&&this.cache.clear(),this.cache.set(e,s)),s}isCompiled(e){return e&&Array.isArray(e.tokens)}normalize(e){return"string"==typeof e?this.compile(e):e}clearCache(){this.cache?.clear()}get size(){return this.cache?.size??0}}class r{path;constructor(e={}){this.path=new t(e)}isUnsafeKey(e){return"__proto__"===e||"constructor"===e||"prototype"===e}walk(e,t,r){const n=this.path.normalize(t).tokens;let s=e;for(let e=0;e<n.length-1;e++){const t=n[e];if(this.isUnsafeKey(t))return;let i=s?.[t];if(null==i){if(!r)return;i="number"==typeof n[e+1]?[]:{},s[t]=i}s=i}const i=n[n.length-1];return{parent:s,key:i,value:s?.[i]}}has(e,t){const r=this.path.normalize(t).tokens;let n=e;for(let e=0;e<r.length;e++){if(null==n)return!1;n=n[r[e]]}return!0}get(e,t){const r=this.path.normalize(t).tokens;let n=e;for(let e=0;e<r.length;e++){if(null==n)return;n=n[r[e]]}return n}set(e,t,r){const n=this.walk(e,t,!0);n&&(n.parent[n.key]=r)}delete(e,t){const r=this.walk(e,t,!1);r&&null!=r.parent&&delete r.parent[r.key]}update(e,t,r){const n=this.walk(e,t,!0);n&&(n.parent[n.key]=r(n.value))}}class n{protect;deep;mergeUndefined;strict;createObject;valueFn;arrayFn;path;constructor(e={}){this.protect=!!e.protect,this.deep=!1!==e.deep,this.mergeUndefined=!!e.mergeUndefined,this.strict=!!e.strict,this.createObject=e.createObject??(()=>Object.create(null)),this.valueFn=e.valueFn,this.arrayFn=this.compileArrayFn(e.arrayMode),this.path=new t(e.pathOptions)}compileArrayFn(e){switch(e??"replace"){case"replace":return(e,t)=>t;case"keep":return(e,t)=>e;case"concat":return(e,t)=>e.concat(t);case"reference":return(e,t)=>{const r=new Set(e);for(let e=0;e<t.length;e++)r.add(t[e]);return Array.from(r)};case"unique":return(e,t)=>{const r=new Map,n=e=>{for(let t=0;t<e.length;t++){const n=e[t];r.set(n&&"object"==typeof n?JSON.stringify(n):n,n)}};return n(e),n(t),[...r.values()]}}if("function"==typeof e)return e;throw new Error(`Invalid array merge mode: ${e}`)}isUnsafeKey(e){return"__proto__"===e||"constructor"===e||"prototype"===e}mergeInto(e,t){if(null==t)return;const r=[[e,t]];for(;r.length;){const[e,t]=r.pop();for(const n in t){if(this.isUnsafeKey(n))continue;const s=t[n],i=e[n];if((void 0!==s||this.mergeUndefined)&&(!this.protect||!(n in e))){if(this.valueFn){const t=this.valueFn(n,i,s);if(void 0!==t){e[n]=t;continue}}if(Array.isArray(s))Array.isArray(i)?e[n]=this.arrayFn(i,s):e[n]=this.arrayFn([],s);else if(this.deep&&s&&"object"==typeof s)if(i&&"object"==typeof i)r.push([i,s]);else{if(this.strict)continue;const t=this.createObject();e[n]=t,r.push([t,s])}else e[n]=s}}}}merge(e,...t){for(let r=0;r<t.length;r++)this.mergeInto(e,t[r]);return e}mergeAt(e,t,...r){const n=this.path.normalize(t).tokens;let s=e;for(let t=0;t<n.length;t++){const r=n[t];if(this.isUnsafeKey(r))return e;let i=s[r];if(null==i){if(this.strict)return e;i="number"==typeof n[t+1]?[]:this.createObject(),s[r]=i}s=i}for(let e=0;e<r.length;e++)this.mergeInto(s,r[e]);return e}}e.Accessor=r,e.Merger=n,e.Path=t,e.factory=e=>Object.freeze({accessor:new r(e?.pathOptions),merger:new n(e),path:new t(e?.pathOptions)})});

package/dist/merger.cjs

@@ -29,12 +29,29 @@ class Merger {
         return (t, _) => t;
       case 'concat':
         return (t, s) => t.concat(s);
-      case 'unique':
+      case 'reference':
         return (t, s) => {
           const set = new Set(t);
           for (let i = 0; i < s.length; i++) set.add(s[i]);
           return Array.from(set);
         };
+      case 'unique':
+        return (t, s) => {
+          const map = new Map(),
+            add = (array) => {
+              for (let i = 0; i < array.length; i++) {
+                const item = array[i];
+                map.set(
+                  item && typeof item === 'object'
+                    ? JSON.stringify(item)
+                    : item,
+                  item
+                );
+              }
+            };
+          (add(t), add(s));
+          return [...map.values()];
+        };
     }
     if (typeof mode === 'function') return mode;
     else throw new Error(`Invalid array merge mode: ${mode}`);

package/dist/merger.d.ts

@@ -19,6 +19,8 @@ export declare const enum ArrayMode {
     Keep = "keep",
     /** Concatenate the source array to the target array. */
     Concat = "concat",
+    /** Reference-based array merging. */
+    Reference = "reference",
     /** Merge unique elements from both arrays. */
     Unique = "unique"
 }

package/dist/merger.mjs

@@ -27,12 +27,29 @@ class Merger {
         return (t, _) => t;
       case 'concat':
         return (t, s) => t.concat(s);
-      case 'unique':
+      case 'reference':
         return (t, s) => {
           const set = new Set(t);
           for (let i = 0; i < s.length; i++) set.add(s[i]);
           return Array.from(set);
         };
+      case 'unique':
+        return (t, s) => {
+          const map = new Map(),
+            add = (array) => {
+              for (let i = 0; i < array.length; i++) {
+                const item = array[i];
+                map.set(
+                  item && typeof item === 'object'
+                    ? JSON.stringify(item)
+                    : item,
+                  item
+                );
+              }
+            };
+          (add(t), add(s));
+          return [...map.values()];
+        };
     }
     if (typeof mode === 'function') return mode;
     else throw new Error(`Invalid array merge mode: ${mode}`);

package/package.json

@@ -1,61 +1,61 @@
-{
-  "name": "@komed3/deepmerge",
-  "description": "Fast and efficient deep object merging and manipulation library",
-  "license": "MIT",
-  "version": "1.0.0",
-  "author": {
-    "name": "komed3 (Paul Köhler)",
-    "email": "webmaster@komed3.de",
-    "url": "https://komed3.de"
-  },
-  "homepage": "https://github.com/komed3/deepmerge",
-  "keywords": [
-    "merge",
-    "object",
-    "manipulation",
-    "path",
-    "accessor",
-    "merger",
-    "deep-merge",
-    "deep-manipulation"
-  ],
-  "repository": {
-    "type": "git",
-    "url": "git+https://github.com/komed3/deepmerge.git"
-  },
-  "bugs": {
-    "url": "https://github.com/komed3/deepmerge/issues"
-  },
-  "funding": {
-    "type": "ko-fi",
-    "url": "https://ko-fi.com/komed3"
-  },
-  "files": [
-    "dist",
-    "README",
-    "LICENSE"
-  ],
-  "engines": {
-    "node": ">=18.0.0"
-  },
-  "types": "dist/index.d.ts",
-  "main": "dist/index.cjs",
-  "module": "dist/index.mjs",
-  "browser": "dist/index.umd.min.js",
-  "jsdelivr": "dist/index.umd.min.js",
-  "unpkg": "dist/index.umd.min.js",
-  "scripts": {
-    "build": "rollup -c && tsc --emitDeclarationOnly",
-    "test": "node tests/access.js && node tests/merge.js && node tests/path.js"
-  },
-  "devDependencies": {
-    "@rollup/plugin-commonjs": "^29.0.2",
-    "@rollup/plugin-node-resolve": "^16.0.3",
-    "@rollup/plugin-terser": "^1.0.0",
-    "@rollup/plugin-typescript": "^12.3.0",
-    "rollup-plugin-cleanup": "^3.2.1",
-    "rollup-plugin-prettier": "^4.1.2",
-    "tslib": "^2.8.1",
-    "typescript": "^6.0.2"
-  }
-}
+{
+  "name": "@komed3/deepmerge",
+  "description": "Fast and efficient deep object merging and manipulation library",
+  "license": "MIT",
+  "version": "1.1.0",
+  "author": {
+    "name": "komed3 (Paul Köhler)",
+    "email": "webmaster@komed3.de",
+    "url": "https://komed3.de"
+  },
+  "homepage": "https://github.com/komed3/deepmerge",
+  "keywords": [
+    "merge",
+    "object",
+    "manipulation",
+    "path",
+    "accessor",
+    "merger",
+    "deep-merge",
+    "deep-manipulation"
+  ],
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/komed3/deepmerge.git"
+  },
+  "bugs": {
+    "url": "https://github.com/komed3/deepmerge/issues"
+  },
+  "funding": {
+    "type": "ko-fi",
+    "url": "https://ko-fi.com/komed3"
+  },
+  "files": [
+    "dist",
+    "README",
+    "LICENSE"
+  ],
+  "engines": {
+    "node": ">=18.0.0"
+  },
+  "types": "dist/index.d.ts",
+  "main": "dist/index.cjs",
+  "module": "dist/index.mjs",
+  "browser": "dist/index.umd.min.js",
+  "jsdelivr": "dist/index.umd.min.js",
+  "unpkg": "dist/index.umd.min.js",
+  "scripts": {
+    "build": "rollup -c && tsc --emitDeclarationOnly",
+    "test": "node tests/access.js && node tests/merge.js && node tests/path.js"
+  },
+  "devDependencies": {
+    "@rollup/plugin-commonjs": "^29.0.3",
+    "@rollup/plugin-node-resolve": "^16.0.3",
+    "@rollup/plugin-terser": "^1.0.0",
+    "@rollup/plugin-typescript": "^12.3.0",
+    "rollup-plugin-cleanup": "^3.2.1",
+    "rollup-plugin-prettier": "^4.2.0",
+    "tslib": "^2.8.1",
+    "typescript": "^6.0.3"
+  }
+}