bunshin-clone 1.0.6 → 1.0.8

package/README.md

@@ -2,14 +2,28 @@
 
 High-performance deep clone utility with descriptor support. Supports circular references and complex built-in types.
 
-* ⚡ Fast (no unnecessary overhead)
-* ♻️ Deep clone (no structural sharing)
-* 🔁 Supports circular ref
-* 🧠 Handles Map, Set, Array, TypedArray, Date, RegExp, etc.
-* 🧩 Optional descriptor preservation
+* Fast (no unnecessary overhead)
+* Deep clone (no structural sharing)
+* Supports circular ref
+* Handles Map, Set, Array, TypedArray, Date, RegExp, etc.
+* Optional descriptor preservation
 
 ---
 
+## Install
+
+```bash
+npm i bunshin-clone
+```
+
+```ts
+// npm
+import bunshinClone from 'bunshin-clone';
+
+// CDN
+import bunshinClone from 'https://cdn.jsdelivr.net/npm/bunshin-clone/+esm';
+```
+
 ## Usage
 
 ```ts
@@ -36,15 +50,15 @@ bunshinClone(target, options)
 ## Options
 
 ```ts
-interface BunshinCloneOptions {
-  preserveDescriptors?: boolean;
-  strictDescriptors?: boolean;
+BunshinCloneOptions {
+  preserveDescriptors: false;
+  strictDescriptors: false;
 }
 ```
 
-### preserveDescriptors
+**preserveDescriptors**
 
-* `false` (default): use standard merge (faster, ignores property descriptors)
+* `false`: use standard merge (faster, ignores property descriptors)
 * `true`: preserve property descriptors (getters/setters, etc.)
 
 <details>
@@ -64,9 +78,9 @@ Object.getOwnPropertyDescriptor(result, 'x')?.get;
 ```
 </details>
 
-### strictDescriptors
+**strictDescriptors**
 
-* `false` (default): skip incompatible descriptors
+* `false`: skip incompatible descriptors
 * `true`: throw if descriptor cannot be merged (e.g. non-configurable or non-writable)
 
 <details>
@@ -80,6 +94,8 @@ bunshinClone(obj, { strictDescriptors: true });
 ```
 </details>
 
+---
+
 ## Supported Types
 
 bunshin-clone correctly handles:

package/dist/index.cjs

@@ -70,25 +70,22 @@ function clone(node, options, ref) {
     return result;
   }
   if (ArrayBuffer.isView(node)) {
+    const { buffer, byteOffset, byteLength } = node;
     if (node instanceof DataView) {
-      const result = new DataView(
-        node.buffer.slice(0),
-        node.byteOffset,
-        node.byteLength
-      );
+      const result = new DataView(buffer.slice(0), byteOffset, byteLength);
       ref.set(node, result);
       return result;
     } else {
       const Ctor = node.constructor;
-      const result = new Ctor(node);
+      const result = new Ctor(
+        buffer.slice(byteOffset, byteOffset + byteLength)
+      );
       ref.set(node, result);
       return result;
     }
   }
   if (node instanceof Error || typeof DOMException !== "undefined" && node instanceof DOMException) {
-    const result = cloneError(node, options, ref);
-    ref.set(node, result);
-    return result;
+    return cloneError(node, options, ref);
   }
   if (typeof Blob !== "undefined" && node instanceof Blob) {
     const result = node.slice(0, node.size, node.type);
@@ -121,10 +118,18 @@ function clone(node, options, ref) {
   return node;
 }
 function cloneError(value, options, ref) {
+  if (value instanceof DOMException) {
+    const result2 = new DOMException(value.message, value.name);
+    ref.set(value, result2);
+    return result2;
+  }
   const name = value.name || "Error";
   const message = value.message || "";
   let result;
   switch (name) {
+    case "EvalError":
+      result = new EvalError(message);
+      break;
     case "RangeError":
       result = new RangeError(message);
       break;
@@ -137,22 +142,20 @@ function cloneError(value, options, ref) {
     case "TypeError":
       result = new TypeError(message);
       break;
+    case "URIError":
+      result = new URIError(message);
+      break;
     default:
       result = new Error(message);
       result.name = name;
   }
-  if (!options.preserveDescriptors && "cause" in value) {
-    result.cause = clone(result.cause, options, ref);
+  ref.set(value, result);
+  if ("cause" in value && value.cause !== void 0) {
+    result.cause = clone(value.cause, options, ref);
   }
   if (value.stack) {
     result.stack = value.stack;
   }
-  for (const key of Object.keys(value)) {
-    if (key === "name" || key === "message" || key === "stack") {
-      continue;
-    }
-    result[key] = value[key];
-  }
   return result;
 }
 function cloneWithDescriptors(node, options, ref) {
@@ -162,6 +165,9 @@ function cloneWithDescriptors(node, options, ref) {
   const keys = Reflect.ownKeys(descs);
   for (let i = 0, l = keys.length; i < l; i++) {
     const key = keys[i];
+    if (!key) {
+      continue;
+    }
     if (isUnsafeKey(key)) {
       continue;
     }
@@ -193,7 +199,7 @@ function isUnsafeKey(key) {
  * High-performance deep clone utility with descriptor support.
  * Supports circular ref and complex built-in types.
  *
- * @version 1.0.6
+ * @version 1.0.8
  * @author Yusuke Kamiyamane
  * @license MIT
  * @copyright Copyright (c) 2026 Yusuke Kamiyamane

package/dist/index.d.cts

@@ -3,7 +3,7 @@
  * High-performance deep clone utility with descriptor support.
  * Supports circular ref and complex built-in types.
  *
- * @version 1.0.6
+ * @version 1.0.8
  * @author Yusuke Kamiyamane
  * @license MIT
  * @copyright Copyright (c) 2026 Yusuke Kamiyamane

package/dist/index.d.ts

@@ -3,7 +3,7 @@
  * High-performance deep clone utility with descriptor support.
  * Supports circular ref and complex built-in types.
  *
- * @version 1.0.6
+ * @version 1.0.8
  * @author Yusuke Kamiyamane
  * @license MIT
  * @copyright Copyright (c) 2026 Yusuke Kamiyamane

package/dist/index.js

@@ -68,25 +68,22 @@ function clone(node, options, ref) {
     return result;
   }
   if (ArrayBuffer.isView(node)) {
+    const { buffer, byteOffset, byteLength } = node;
     if (node instanceof DataView) {
-      const result = new DataView(
-        node.buffer.slice(0),
-        node.byteOffset,
-        node.byteLength
-      );
+      const result = new DataView(buffer.slice(0), byteOffset, byteLength);
       ref.set(node, result);
       return result;
     } else {
       const Ctor = node.constructor;
-      const result = new Ctor(node);
+      const result = new Ctor(
+        buffer.slice(byteOffset, byteOffset + byteLength)
+      );
       ref.set(node, result);
       return result;
     }
   }
   if (node instanceof Error || typeof DOMException !== "undefined" && node instanceof DOMException) {
-    const result = cloneError(node, options, ref);
-    ref.set(node, result);
-    return result;
+    return cloneError(node, options, ref);
   }
   if (typeof Blob !== "undefined" && node instanceof Blob) {
     const result = node.slice(0, node.size, node.type);
@@ -119,10 +116,18 @@ function clone(node, options, ref) {
   return node;
 }
 function cloneError(value, options, ref) {
+  if (value instanceof DOMException) {
+    const result2 = new DOMException(value.message, value.name);
+    ref.set(value, result2);
+    return result2;
+  }
   const name = value.name || "Error";
   const message = value.message || "";
   let result;
   switch (name) {
+    case "EvalError":
+      result = new EvalError(message);
+      break;
     case "RangeError":
       result = new RangeError(message);
       break;
@@ -135,22 +140,20 @@ function cloneError(value, options, ref) {
     case "TypeError":
       result = new TypeError(message);
       break;
+    case "URIError":
+      result = new URIError(message);
+      break;
     default:
       result = new Error(message);
       result.name = name;
   }
-  if (!options.preserveDescriptors && "cause" in value) {
-    result.cause = clone(result.cause, options, ref);
+  ref.set(value, result);
+  if ("cause" in value && value.cause !== void 0) {
+    result.cause = clone(value.cause, options, ref);
   }
   if (value.stack) {
     result.stack = value.stack;
   }
-  for (const key of Object.keys(value)) {
-    if (key === "name" || key === "message" || key === "stack") {
-      continue;
-    }
-    result[key] = value[key];
-  }
   return result;
 }
 function cloneWithDescriptors(node, options, ref) {
@@ -160,6 +163,9 @@ function cloneWithDescriptors(node, options, ref) {
   const keys = Reflect.ownKeys(descs);
   for (let i = 0, l = keys.length; i < l; i++) {
     const key = keys[i];
+    if (!key) {
+      continue;
+    }
     if (isUnsafeKey(key)) {
       continue;
     }
@@ -191,7 +197,7 @@ function isUnsafeKey(key) {
  * High-performance deep clone utility with descriptor support.
  * Supports circular ref and complex built-in types.
  *
- * @version 1.0.6
+ * @version 1.0.8
  * @author Yusuke Kamiyamane
  * @license MIT
  * @copyright Copyright (c) 2026 Yusuke Kamiyamane

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "bunshin-clone",
-  "version": "1.0.6",
+  "version": "1.0.8",
   "description": "High-performance deep clone utility with descriptor support",
   "type": "module",
   "main": "./dist/index.cjs",