@potmot/diff 0.0.0 → 0.0.1

package/README.md

@@ -23,3 +23,266 @@ yarn add @potmot/diff
 ```bash
 pnpm add @potmot/diff
 ```
+
+## 使用方法
+
+### 1. deepEquals - 深度相等比较
+
+用于深度比较两个值是否相等，支持对象、数组和嵌套结构。
+
+```typescript
+import { deepEquals } from '@potmot/diff';
+
+// 基本类型比较
+deepEquals(1, 1);                    // true
+deepEquals('hello', 'world');        // false
+
+// 对象比较
+deepEquals({ a: 1, b: 2 }, { a: 1, b: 2 });  // true
+deepEquals({ a: 1 }, { a: 1, b: 2 });        // false
+
+// 嵌套对象比较
+deepEquals({ a: { b: { c: 1 } } }, { a: { b: { c: 1 } } });  // true
+
+// 数组比较
+deepEquals([1, 2, 3], [1, 2, 3]);    // true
+deepEquals([1, 2], [1, 2, 3]);       // false
+```
+
+### 2. objectDiff - 对象差异分析
+
+比较两个对象的差异，返回新增、删除和更新的属性。
+
+```typescript
+import { objectDiff } from '@potmot/diff';
+
+// 基本使用
+const oldObj = { a: 1, b: 2, c: 3 };
+const newObj = { a: 1, b: 4, d: 5 };
+
+const result = objectDiff(oldObj, newObj);
+/*
+result = {
+  type: 'object',
+  deleted: {
+    c: { propertyName: 'c', value: 3 }
+  },
+  added: {
+    d: { propertyName: 'd', value: 5 }
+  },
+  updated: {
+    b: {
+      propertyName: 'b',
+      prevValue: 2,
+      nextValue: 4,
+      diff: undefined
+    }
+  }
+}
+*/
+
+// 嵌套对象比较
+const oldUser = {
+  name: 'John',
+  address: {
+    city: 'Beijing',
+    zip: '100000'
+  }
+};
+
+const newUser = {
+  name: 'John',
+  address: {
+    city: 'Shanghai',
+    zip: '100000'
+  }
+};
+
+const diff = objectDiff(oldUser, newUser);
+/*
+diff = {
+  type: 'object',
+  updated: {
+    address: {
+      propertyName: 'address',
+      prevValue: { city: 'Beijing', zip: '100000' },
+      nextValue: { city: 'Shanghai', zip: '100000' },
+      diff: {
+        type: 'object',
+        updated: {
+          city: {
+            propertyName: 'city',
+            prevValue: 'Beijing',
+            nextValue: 'Shanghai',
+            diff: undefined
+          }
+        }
+      }
+    }
+  }
+}
+*/
+
+// 处理 null/undefined
+objectDiff(null, { a: 1 });  // 所有属性都是新增
+objectDiff({ a: 1 }, null);  // 所有属性都是删除
+```
+
+### 3. arrayDiff - 数组差异分析
+
+比较两个数组的差异，支持元素新增、删除、更新和移动检测。
+
+```typescript
+import { arrayDiff } from '@potmot/diff';
+
+// 定义匹配函数（用于识别同一元素）
+const matchById = (a, b) => a.id === b.id;
+
+const oldList = [
+  { id: 1, name: 'Item 1', value: 'A' },
+  { id: 2, name: 'Item 2', value: 'B' },
+  { id: 3, name: 'Item 3', value: 'C' }
+];
+
+const newList = [
+  { id: 2, name: 'Item 2', value: 'B' },           // 相等
+  { id: 1, name: 'Item 1', value: 'A Updated' },   // 更新
+  { id: 4, name: 'Item 4', value: 'D' }            // 新增
+  // id: 3 被删除
+];
+
+const result = arrayDiff(oldList, newList, [matchById]);
+/*
+result = {
+  type: 'array',
+  added: [
+    { data: { id: 4, name: 'Item 4', value: 'D' }, nextIndex: 2 }
+  ],
+  updated: [
+    {
+      prevData: { id: 1, name: 'Item 1', value: 'A' },
+      prevIndex: 0,
+      nextData: { id: 1, name: 'Item 1', value: 'A Updated' },
+      nextIndex: 1,
+      diff: {
+        type: 'object',
+        updated: {
+          value: {
+            propertyName: 'value',
+            prevValue: 'A',
+            nextValue: 'A Updated',
+            diff: undefined
+          }
+        }
+      }
+    }
+  ],
+  deleted: [
+    { data: { id: 3, name: 'Item 3', value: 'C' }, prevIndex: 2 }
+  ],
+  moved: [
+    { data: { id: 2, name: 'Item 2', value: 'B' }, prevIndex: 1, nextIndex: 0 }
+  ],
+  equals: []
+}
+*/
+```
+
+### 4. 高级用法
+
+#### 多条件匹配
+
+```typescript
+// 使用多个匹配函数进行更精确的对比
+const matchByNameAndValue = [
+  (a, b) => a.name === b.name,
+  (a, b) => a.value === b.value
+];
+
+const result = arrayDiff(oldList, newList, matchByNameAndValue);
+```
+
+#### 自定义深度比较函数
+
+```typescript
+// 为 objectDiff 提供自定义的深度比较函数
+const customDeepMatch = [
+  (a, b) => {
+    // 如果都有 name 属性，则通过 name 判断是否相等
+    if ('name' in a && 'name' in b) {
+      return a.name === b.name;
+    }
+    return false;
+  }
+];
+
+const result = objectDiff(oldObj, newObj, customDeepMatch);
+```
+
+#### 循环引用处理
+
+```typescript
+// 自动检测和处理循环引用
+const obj1 = { a: 1 };
+obj1.self = obj1;  // 循环引用
+
+const obj2 = { a: 2 };
+obj2.self = obj2;  // 循环引用
+
+const result = objectDiff(obj1, obj2);
+// {
+//   type: 'object',
+//   updated: {
+//     a: { propertyName: 'a', prevValue: 1, nextValue: 2, diff: undefined },
+//     self: {
+//       propertyName: 'self',
+//       prevValue: obj1,
+//       nextValue: obj2,
+//       diff: { type: 'circular reference' }
+//     }
+//   }
+// }
+```
+
+## API 参考
+
+### deepEquals(a: any, b: any): boolean
+
+深度比较两个值是否相等。
+
+**参数：**
+- `a` - 第一个值
+- `b` - 第二个值
+
+**返回：** `boolean` - 如果两个值深度相等则返回 `true`
+
+---
+
+### objectDiff<T, U>(oldVal: T | undefined | null, newVal: U | undefined | null, deepMatchFnList?: Function[]): ObjectDiff | CircularReferenceDiff
+
+比较两个对象的差异。
+
+**参数：**
+- `oldVal` - 原始对象
+- `newVal` - 新对象
+- `deepMatchFnList` - 可选，自定义深度比较函数列表，默认匹配函数为`deepEquals`
+
+**返回：** `ObjectDiff | CircularReferenceDiff` - 差异结果对象
+
+---
+
+### arrayDiff<T>(prevList: T[], nextList: T[], matchFnList: Function[], deepMatchFnList?: Function[]): ArrayDiff
+
+比较两个数组的差异。
+
+**参数：**
+- `prevList` - 原始数组
+- `nextList` - 新数组
+- `matchFnList` - 匹配函数列表，用于识别同一元素
+- `deepMatchFnList` - 可选，自定义深度比较函数列表，默认匹配函数为`deepEquals`
+
+**返回：** `ArrayDiff` - 差异结果对象，包含 `added`、`updated`、`deleted`、`moved`、`equals` 数组
+
+## 许可证
+
+MIT

package/dist/index.d.ts

@@ -1,3 +1,4 @@
+export type { CircularReferenceDiff, ObjectDiff, PropertyAddedDiffItem, PropertyDeletedDiffItem, PropertyUpdatedDiffItem, ArrayDiff, ArrayAddedDiffItem, ArrayUpdatedDiffItem, ArrayDeletedDiffItem, ArrayMovedDiffItem, ArrayEqualsDiffItem, } from './type/DiffItem';
 export { deepEquals } from './deepEquals';
 export { arrayDiff } from './arrayDiff';
 export { objectDiff } from './objectDiff';

package/dist/index.js

@@ -10,21 +10,21 @@ const j = (t, e) => {
   if (Array.isArray(t) && Array.isArray(e)) {
     if (t.length !== e.length)
       return !1;
-    for (let o = 0; o < t.length; o++)
-      if (!j(t[o], e[o]))
+    for (let c = 0; c < t.length; c++)
+      if (!j(t[c], e[c]))
         return !1;
     return !0;
   }
   if (Array.isArray(t) || Array.isArray(e))
     return !1;
-  const i = Object.keys(t), s = Object.keys(e);
-  if (i.length !== s.length)
+  const y = Object.keys(t), u = Object.keys(e);
+  if (y.length !== u.length)
     return !1;
-  for (const o of i)
-    if (!s.includes(o) || !j(t[o], e[o]))
+  for (const c of y)
+    if (!u.includes(c) || !j(t[c], e[c]))
       return !1;
   return !0;
-}, v = (t, e, i = [j], s = /* @__PURE__ */ new WeakSet(), o = /* @__PURE__ */ new WeakSet()) => {
+}, l = (t, e, y = [j], u = /* @__PURE__ */ new WeakSet(), c = /* @__PURE__ */ new WeakSet()) => {
   if ((t == null || Object.keys(t).length === 0) && (e == null || Object.keys(e).length === 0))
     return { type: "object" };
   if (t == null || typeof t != "object") {
@@ -48,47 +48,53 @@ const j = (t, e) => {
     }), { type: "object", deleted: r };
   }
   if (typeof t == "object") {
-    if (s.has(t))
+    if (u.has(t))
       return { type: "circular reference" };
-    s.add(t);
+    u.add(t);
   }
   if (typeof e == "object") {
-    if (o.has(e))
+    if (c.has(e))
       return { type: "circular reference" };
-    o.add(e);
+    c.add(e);
   }
-  const p = { type: "object" }, c = {};
+  const h = { type: "object" }, i = {};
   for (const r in t)
-    r in e || (c[r] = {
+    r in e || (i[r] = {
       propertyName: r,
       value: t[r]
     });
-  Object.keys(c).length > 0 && (p.deleted = c);
-  const a = {};
+  Object.keys(i).length > 0 && (h.deleted = i);
+  const p = {};
   for (const r in e)
-    r in t || (a[r] = {
+    r in t || (p[r] = {
       propertyName: r,
       value: e[r]
     });
-  Object.keys(a).length > 0 && (p.added = a);
-  const h = {};
+  Object.keys(p).length > 0 && (h.added = p);
+  const a = {};
   for (const r in t)
     if (r in e) {
       const f = r, n = r;
       if (!j(t[f], e[n])) {
-        const y = t[f], d = e[n];
-        let u;
-        Array.isArray(y) && Array.isArray(d) ? u = x(y, d, i, i) : typeof y == "object" && typeof d == "object" && y !== null && d !== null && y !== void 0 && d !== void 0 && (u = v(y, d, i, s, o)), h[r] = {
+        const s = t[f], d = e[n];
+        let o;
+        Array.isArray(s) && Array.isArray(d) ? o = x(s, d, y, y) : s !== null && d !== null && s !== void 0 && d !== void 0 && typeof s == "object" && typeof d == "object" && (o = l(
+          s,
+          d,
+          y,
+          u,
+          c
+        )), a[r] = {
           propertyName: r,
           prevValue: t[f],
           nextValue: e[n],
-          diff: u
+          diff: o
         };
       }
     }
-  return Object.keys(h).length > 0 && (p.updated = h), p;
-}, x = (t, e, i, s = [j], o = /* @__PURE__ */ new WeakSet(), p = /* @__PURE__ */ new WeakSet()) => {
-  const c = {
+  return Object.keys(a).length > 0 && (h.updated = a), h;
+}, x = (t, e, y, u = [j], c = /* @__PURE__ */ new WeakSet(), h = /* @__PURE__ */ new WeakSet()) => {
+  const i = {
     type: "array",
     added: [],
     updated: [],
@@ -97,54 +103,60 @@ const j = (t, e) => {
     equals: []
   };
   if (!t && !e)
-    return c;
+    return i;
   if (!t)
     return e?.forEach((r, f) => {
-      c.added.push({ data: r, nextIndex: f });
-    }), c;
+      i.added.push({ data: r, nextIndex: f });
+    }), i;
   if (!e)
     return t?.forEach((r, f) => {
-      c.deleted.push({ data: r, prevIndex: f });
-    }), c;
-  const a = new Set(t.map((r, f) => ({ item: r, index: f }))), h = new Set(e.map((r, f) => ({ item: r, index: f })));
-  for (const r of i)
-    for (const f of a) {
-      const { item: n, index: y } = f;
+      i.deleted.push({ data: r, prevIndex: f });
+    }), i;
+  const p = new Set(t.map((r, f) => ({ item: r, index: f }))), a = new Set(e.map((r, f) => ({ item: r, index: f })));
+  for (const r of y)
+    for (const f of p) {
+      const { item: n, index: s } = f;
       let d;
-      for (const u of h)
-        r(n, u.item) && (d = u);
+      for (const o of a)
+        r(n, o.item) && (d = o);
       if (d !== void 0) {
-        const { item: u, index: k } = d;
-        if (j(n, u))
-          y === k ? c.equals.push({
-            data: u,
-            index: k
-          }) : c.moved.push({
-            data: u,
-            prevIndex: y,
-            nextIndex: k
+        const { item: o, index: v } = d;
+        if (j(n, o))
+          s === v ? i.equals.push({
+            data: o,
+            index: v
+          }) : i.moved.push({
+            data: o,
+            prevIndex: s,
+            nextIndex: v
           });
         else {
-          const A = Array.isArray(n) && Array.isArray(u) ? x(n, u, s, s, o, p) : typeof n == "object" && typeof u == "object" ? v(n, u, s, o, p) : void 0;
-          c.updated.push({
+          let k;
+          Array.isArray(n) && Array.isArray(o) ? k = x(n, o, u, u) : n !== null && o !== null && n !== void 0 && o !== void 0 && typeof n == "object" && typeof o == "object" && (k = l(
+            n,
+            o,
+            u,
+            c,
+            h
+          )), i.updated.push({
             prevData: n,
-            prevIndex: y,
-            nextData: u,
-            nextIndex: k,
-            diff: A
+            prevIndex: s,
+            nextData: o,
+            nextIndex: v,
+            diff: k
           });
         }
-        a.delete(f), h.delete(d);
+        p.delete(f), a.delete(d);
       }
     }
-  return a.forEach(({ item: r, index: f }) => {
-    c.deleted.push({ data: r, prevIndex: f });
-  }), h.forEach(({ item: r, index: f }) => {
-    c.added.push({ data: r, nextIndex: f });
-  }), c;
+  return p.forEach(({ item: r, index: f }) => {
+    i.deleted.push({ data: r, prevIndex: f });
+  }), a.forEach(({ item: r, index: f }) => {
+    i.added.push({ data: r, nextIndex: f });
+  }), i;
 };
 export {
   x as arrayDiff,
   j as deepEquals,
-  v as objectDiff
+  l as objectDiff
 };

package/dist/index.umd.cjs

@@ -1 +1 @@
-(function(p,u){typeof exports=="object"&&typeof module<"u"?u(exports):typeof define=="function"&&define.amd?define(["exports"],u):(p=typeof globalThis<"u"?globalThis:p||self,u(p["@potmot/diff"]={}))})(this,(function(p){"use strict";const u=(t,e)=>{if(t===e)return!0;if(t===null||e===null||t===void 0||e===void 0)return t===e;if(typeof t!=typeof e)return!1;if(typeof t!="object")return t===e;if(Array.isArray(t)&&Array.isArray(e)){if(t.length!==e.length)return!1;for(let o=0;o<t.length;o++)if(!u(t[o],e[o]))return!1;return!0}if(Array.isArray(t)||Array.isArray(e))return!1;const a=Object.keys(t),s=Object.keys(e);if(a.length!==s.length)return!1;for(const o of a)if(!s.includes(o)||!u(t[o],e[o]))return!1;return!0},v=(t,e,a=[u],s=new WeakSet,o=new WeakSet)=>{if((t==null||Object.keys(t).length===0)&&(e==null||Object.keys(e).length===0))return{type:"object"};if(t==null||typeof t!="object"){const r={};return e!=null&&typeof e=="object"&&Object.keys(e).forEach(f=>{const n=f;r[n]={propertyName:n,value:e[n]}}),{type:"object",added:r}}if(e==null||typeof e!="object"){const r={};return Object.keys(t).forEach(f=>{const n=f;r[n]={propertyName:n,value:t[n]}}),{type:"object",deleted:r}}if(typeof t=="object"){if(s.has(t))return{type:"circular reference"};s.add(t)}if(typeof e=="object"){if(o.has(e))return{type:"circular reference"};o.add(e)}const h={type:"object"},i={};for(const r in t)r in e||(i[r]={propertyName:r,value:t[r]});Object.keys(i).length>0&&(h.deleted=i);const j={};for(const r in e)r in t||(j[r]={propertyName:r,value:e[r]});Object.keys(j).length>0&&(h.added=j);const k={};for(const r in t)if(r in e){const f=r,n=r;if(!u(t[f],e[n])){const y=t[f],c=e[n];let d;Array.isArray(y)&&Array.isArray(c)?d=l(y,c,a,a):typeof y=="object"&&typeof c=="object"&&y!==null&&c!==null&&y!==void 0&&c!==void 0&&(d=v(y,c,a,s,o)),k[r]={propertyName:r,prevValue:t[f],nextValue:e[n],diff:d}}}return Object.keys(k).length>0&&(h.updated=k),h},l=(t,e,a,s=[u],o=new WeakSet,h=new WeakSet)=>{const i={type:"array",added:[],updated:[],deleted:[],moved:[],equals:[]};if(!t&&!e)return i;if(!t)return e?.forEach((r,f)=>{i.added.push({data:r,nextIndex:f})}),i;if(!e)return t?.forEach((r,f)=>{i.deleted.push({data:r,prevIndex:f})}),i;const j=new Set(t.map((r,f)=>({item:r,index:f}))),k=new Set(e.map((r,f)=>({item:r,index:f})));for(const r of a)for(const f of j){const{item:n,index:y}=f;let c;for(const d of k)r(n,d.item)&&(c=d);if(c!==void 0){const{item:d,index:m}=c;if(u(n,d))y===m?i.equals.push({data:d,index:m}):i.moved.push({data:d,prevIndex:y,nextIndex:m});else{const b=Array.isArray(n)&&Array.isArray(d)?l(n,d,s,s,o,h):typeof n=="object"&&typeof d=="object"?v(n,d,s,o,h):void 0;i.updated.push({prevData:n,prevIndex:y,nextData:d,nextIndex:m,diff:b})}j.delete(f),k.delete(c)}}return j.forEach(({item:r,index:f})=>{i.deleted.push({data:r,prevIndex:f})}),k.forEach(({item:r,index:f})=>{i.added.push({data:r,nextIndex:f})}),i};p.arrayDiff=l,p.deepEquals=u,p.objectDiff=v,Object.defineProperty(p,Symbol.toStringTag,{value:"Module"})}));
+(function(p,u){typeof exports=="object"&&typeof module<"u"?u(exports):typeof define=="function"&&define.amd?define(["exports"],u):(p=typeof globalThis<"u"?globalThis:p||self,u(p["@potmot/diff"]={}))})(this,(function(p){"use strict";const u=(t,e)=>{if(t===e)return!0;if(t===null||e===null||t===void 0||e===void 0)return t===e;if(typeof t!=typeof e)return!1;if(typeof t!="object")return t===e;if(Array.isArray(t)&&Array.isArray(e)){if(t.length!==e.length)return!1;for(let d=0;d<t.length;d++)if(!u(t[d],e[d]))return!1;return!0}if(Array.isArray(t)||Array.isArray(e))return!1;const a=Object.keys(t),s=Object.keys(e);if(a.length!==s.length)return!1;for(const d of a)if(!s.includes(d)||!u(t[d],e[d]))return!1;return!0},k=(t,e,a=[u],s=new WeakSet,d=new WeakSet)=>{if((t==null||Object.keys(t).length===0)&&(e==null||Object.keys(e).length===0))return{type:"object"};if(t==null||typeof t!="object"){const r={};return e!=null&&typeof e=="object"&&Object.keys(e).forEach(f=>{const n=f;r[n]={propertyName:n,value:e[n]}}),{type:"object",added:r}}if(e==null||typeof e!="object"){const r={};return Object.keys(t).forEach(f=>{const n=f;r[n]={propertyName:n,value:t[n]}}),{type:"object",deleted:r}}if(typeof t=="object"){if(s.has(t))return{type:"circular reference"};s.add(t)}if(typeof e=="object"){if(d.has(e))return{type:"circular reference"};d.add(e)}const l={type:"object"},i={};for(const r in t)r in e||(i[r]={propertyName:r,value:t[r]});Object.keys(i).length>0&&(l.deleted=i);const h={};for(const r in e)r in t||(h[r]={propertyName:r,value:e[r]});Object.keys(h).length>0&&(l.added=h);const j={};for(const r in t)if(r in e){const f=r,n=r;if(!u(t[f],e[n])){const y=t[f],c=e[n];let o;Array.isArray(y)&&Array.isArray(c)?o=m(y,c,a,a):y!==null&&c!==null&&y!==void 0&&c!==void 0&&typeof y=="object"&&typeof c=="object"&&(o=k(y,c,a,s,d)),j[r]={propertyName:r,prevValue:t[f],nextValue:e[n],diff:o}}}return Object.keys(j).length>0&&(l.updated=j),l},m=(t,e,a,s=[u],d=new WeakSet,l=new WeakSet)=>{const i={type:"array",added:[],updated:[],deleted:[],moved:[],equals:[]};if(!t&&!e)return i;if(!t)return e?.forEach((r,f)=>{i.added.push({data:r,nextIndex:f})}),i;if(!e)return t?.forEach((r,f)=>{i.deleted.push({data:r,prevIndex:f})}),i;const h=new Set(t.map((r,f)=>({item:r,index:f}))),j=new Set(e.map((r,f)=>({item:r,index:f})));for(const r of a)for(const f of h){const{item:n,index:y}=f;let c;for(const o of j)r(n,o.item)&&(c=o);if(c!==void 0){const{item:o,index:v}=c;if(u(n,o))y===v?i.equals.push({data:o,index:v}):i.moved.push({data:o,prevIndex:y,nextIndex:v});else{let b;Array.isArray(n)&&Array.isArray(o)?b=m(n,o,s,s):n!==null&&o!==null&&n!==void 0&&o!==void 0&&typeof n=="object"&&typeof o=="object"&&(b=k(n,o,s,d,l)),i.updated.push({prevData:n,prevIndex:y,nextData:o,nextIndex:v,diff:b})}h.delete(f),j.delete(c)}}return h.forEach(({item:r,index:f})=>{i.deleted.push({data:r,prevIndex:f})}),j.forEach(({item:r,index:f})=>{i.added.push({data:r,nextIndex:f})}),i};p.arrayDiff=m,p.deepEquals=u,p.objectDiff=k,Object.defineProperty(p,Symbol.toStringTag,{value:"Module"})}));

package/dist/type/DiffItem.d.ts

@@ -1,8 +1,8 @@
 export type CircularReferenceDiff = {
-    type: "circular reference";
+    type: 'circular reference';
 };
 export type ObjectDiff<T extends Record<string, unknown>, U extends Record<string, unknown> = T> = {
-    type: "object";
+    type: 'object';
     updated?: {
         [K in keyof T & keyof U]?: PropertyUpdatedDiffItem<T, U, K>;
     };
@@ -21,11 +21,11 @@ export type PropertyDeletedDiffItem<T extends Record<string, unknown>, K extends
     propertyName: K;
     value: T[K];
 };
-export type PropertyUpdatedDiffItem<T extends Record<string, unknown>, U extends Record<string, unknown> = T, K extends (keyof T & keyof U) = (keyof T & keyof U)> = {
+export type PropertyUpdatedDiffItem<T extends Record<string, unknown>, U extends Record<string, unknown> = T, K extends keyof T & keyof U = keyof T & keyof U> = {
     propertyName: K;
     prevValue: T[K];
     nextValue: U[K];
-    diff?: (T[K] & U[K]) extends Array<infer Item> | ReadonlyArray<infer Item> ? ArrayDiff<Item> : (T[K] & U[K]) extends Record<string, unknown> ? ObjectDiff<T[K] & U[K], T[K] & U[K]> | CircularReferenceDiff : never;
+    diff?: T[K] & U[K] extends Array<infer Item> | ReadonlyArray<infer Item> ? ArrayDiff<Item> : T[K] & U[K] extends Record<string, unknown> ? ObjectDiff<T[K] & U[K], T[K] & U[K]> | CircularReferenceDiff : never;
 };
 export type ArrayAddedDiffItem<T> = {
     data: T;
@@ -52,7 +52,7 @@ export type ArrayEqualsDiffItem<T> = {
     index: number;
 };
 export type ArrayDiff<T> = {
-    type: "array";
+    type: 'array';
     added: ArrayAddedDiffItem<T>[];
     updated: ArrayUpdatedDiffItem<T>[];
     deleted: ArrayDeletedDiffItem<T>[];

package/package.json

@@ -1,9 +1,11 @@
 {
   "name": "@potmot/diff",
   "private": false,
-  "version": "0.0.0",
+  "version": "0.0.1",
   "description": "Lightweight deep diff tool for JavaScript objects and arrays.",
-  "keywords": ["diff"],
+  "keywords": [
+    "diff"
+  ],
   "homepage": "https://github.com/pot-mot/diff/blob/main/README.md",
   "repository": {
     "type": "git",
@@ -37,14 +39,24 @@
   },
   "scripts": {
     "build": "tsc & vite build",
-    "test": "vitest run"
+    "test": "vitest run",
+    "lint:pritter": "prettier --write src/"
+  },
+  "lint-staged": {
+    "*.{js,ts,vue,json,css}": [
+      "prettier --write"
+    ]
   },
   "devDependencies": {
     "@tsconfig/node22": "^22.0.5",
     "@types/node": "^25.2.3",
+    "@vitest/coverage-v8": "3.2.4",
+    "husky": "^9.1.7",
+    "lint-staged": "^16.2.7",
+    "prettier": "^3.8.1",
     "typescript": "~5.9.3",
     "vite": "^7.3.1",
     "vite-plugin-dts": "^4.5.4",
-    "vitest": "^4.0.18"
+    "vitest": "^3.2.4"
   }
 }