patch-recorder 0.0.1 → 0.1.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +103 -16
- package/dist/arrays.d.ts.map +1 -1
- package/dist/arrays.js +72 -72
- package/dist/arrays.js.map +1 -1
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js.map +1 -1
- package/dist/maps.d.ts.map +1 -1
- package/dist/maps.js +5 -7
- package/dist/maps.js.map +1 -1
- package/dist/optimizer.d.ts.map +1 -1
- package/dist/optimizer.js +109 -55
- package/dist/optimizer.js.map +1 -1
- package/dist/patches.d.ts +1 -1
- package/dist/patches.d.ts.map +1 -1
- package/dist/patches.js +26 -2
- package/dist/patches.js.map +1 -1
- package/dist/proxy.d.ts.map +1 -1
- package/dist/proxy.js +19 -3
- package/dist/proxy.js.map +1 -1
- package/dist/types.d.ts +35 -2
- package/dist/types.d.ts.map +1 -1
- package/dist/utils.d.ts +11 -1
- package/dist/utils.d.ts.map +1 -1
- package/dist/utils.js +48 -9
- package/dist/utils.js.map +1 -1
- package/package.json +1 -1
- package/src/arrays.ts +78 -90
- package/src/index.ts +1 -0
- package/src/maps.ts +4 -6
- package/src/optimizer.ts +139 -57
- package/src/patches.ts +32 -4
- package/src/proxy.ts +17 -3
- package/src/types.ts +37 -2
- package/src/utils.ts +62 -10
package/README.md
CHANGED
|
@@ -11,6 +11,7 @@
|
|
|
11
11
|
- ✅ **Immediate patch generation** - Patches generated as mutations occur
|
|
12
12
|
- ✅ **Optimization enabled by default** - Automatically compresses/merges redundant patches
|
|
13
13
|
- ✅ **Full collection support** - Works with objects, arrays, Maps, and Sets
|
|
14
|
+
- ✅ **Item ID tracking** - Optionally include item IDs in remove/replace patches
|
|
14
15
|
|
|
15
16
|
## Installation
|
|
16
17
|
|
|
@@ -55,7 +56,7 @@ Unlike mutative or immer, **patch-recorder mutates the original object in place*
|
|
|
55
56
|
- Perfect for scenarios where you need both mutation tracking AND direct object manipulation
|
|
56
57
|
|
|
57
58
|
**Performance:**
|
|
58
|
-
- Substantially faster than mutative (
|
|
59
|
+
- Substantially faster than mutative (1.1x to 650x depending on operation)
|
|
59
60
|
- Especially dramatic speedups for array index and Map operations
|
|
60
61
|
- Consistent performance improvements across all data types
|
|
61
62
|
|
|
@@ -95,8 +96,9 @@ Mutative-compatible API for easy switching between mutative and patch-recorder.
|
|
|
95
96
|
For `recordPatches`:
|
|
96
97
|
|
|
97
98
|
- **`pathAsArray`** (boolean, default: `true`) - Return paths as arrays or strings
|
|
98
|
-
- **`arrayLengthAssignment`** (boolean, default: `true`) -
|
|
99
|
+
- **`arrayLengthAssignment`** (boolean, default: `true`) - When `true`, includes length patches when array shrinks (pop, shift, splice delete). When `false`, omits length patches entirely. Aligned with mutative's behavior.
|
|
99
100
|
- **`compressPatches`** (boolean, default: `true`) - Compress patches by merging redundant operations
|
|
101
|
+
- **`getItemId`** (object, optional) - Configuration for extracting item IDs (see [Item ID Tracking](#item-id-tracking))
|
|
100
102
|
|
|
101
103
|
For `create` (additional options for mutative compatibility):
|
|
102
104
|
- **`enablePatches`** (boolean, default: `true`) - Always true, patches are always returned
|
|
@@ -168,11 +170,12 @@ console.log(patches);
|
|
|
168
170
|
// { op: 'replace', path: ['items', 1], value: 10 },
|
|
169
171
|
// { op: 'remove', path: ['items', 0] },
|
|
170
172
|
// { op: 'replace', path: ['items', 0], value: 2 },
|
|
171
|
-
// { op: 'replace', path: ['items', 1], value: 3 }
|
|
172
|
-
// { op: 'replace', path: ['items', 'length'], value: 3 }
|
|
173
|
+
// { op: 'replace', path: ['items', 1], value: 3 }
|
|
173
174
|
// ]
|
|
174
175
|
```
|
|
175
176
|
|
|
177
|
+
**Note:** Array length patches are included only when the array shrinks (pop, shift, splice delete operations) to optimize performance. This aligns with mutative's behavior. When the array grows (push, unshift, splice add operations), length patches are omitted as the length change is implied by the add operations themselves.
|
|
178
|
+
|
|
176
179
|
### Map Operations
|
|
177
180
|
|
|
178
181
|
```typescript
|
|
@@ -275,6 +278,90 @@ const [nextState, patches] = create(state, (draft) => {
|
|
|
275
278
|
}, { enablePatches: true, pathAsArray: false, compressPatches: true });
|
|
276
279
|
```
|
|
277
280
|
|
|
281
|
+
### Item ID Tracking
|
|
282
|
+
|
|
283
|
+
When working with arrays, the patch path only tells you the index, not which item was affected. The `getItemId` option allows you to include item IDs in `remove` and `replace` patches, making it easier to track which items changed.
|
|
284
|
+
|
|
285
|
+
```typescript
|
|
286
|
+
const state = {
|
|
287
|
+
users: [
|
|
288
|
+
{ id: 'user-1', name: 'Alice' },
|
|
289
|
+
{ id: 'user-2', name: 'Bob' },
|
|
290
|
+
{ id: 'user-3', name: 'Charlie' },
|
|
291
|
+
]
|
|
292
|
+
};
|
|
293
|
+
|
|
294
|
+
const patches = recordPatches(state, (draft) => {
|
|
295
|
+
draft.users.splice(1, 1); // Remove Bob
|
|
296
|
+
}, {
|
|
297
|
+
getItemId: {
|
|
298
|
+
users: (user) => user.id // Extract ID from each user
|
|
299
|
+
}
|
|
300
|
+
});
|
|
301
|
+
|
|
302
|
+
console.log(patches);
|
|
303
|
+
// [{ op: 'remove', path: ['users', 1], id: 'user-2' }]
|
|
304
|
+
// Without getItemId, you'd only know index 1 was removed, not that it was Bob
|
|
305
|
+
```
|
|
306
|
+
|
|
307
|
+
#### Configuration Structure
|
|
308
|
+
|
|
309
|
+
The `getItemId` option is an object that mirrors your data structure:
|
|
310
|
+
|
|
311
|
+
```typescript
|
|
312
|
+
recordPatches(state, mutate, {
|
|
313
|
+
getItemId: {
|
|
314
|
+
// Top-level arrays
|
|
315
|
+
items: (item) => item.id,
|
|
316
|
+
users: (user) => user.userId,
|
|
317
|
+
|
|
318
|
+
// Nested paths - use nested objects
|
|
319
|
+
app: {
|
|
320
|
+
data: {
|
|
321
|
+
todos: (todo) => todo._id
|
|
322
|
+
}
|
|
323
|
+
},
|
|
324
|
+
|
|
325
|
+
// Maps - same as arrays
|
|
326
|
+
entityMap: (entity) => entity.internalId
|
|
327
|
+
}
|
|
328
|
+
});
|
|
329
|
+
```
|
|
330
|
+
|
|
331
|
+
#### Works with Maps and Sets too
|
|
332
|
+
|
|
333
|
+
```typescript
|
|
334
|
+
const state = {
|
|
335
|
+
entityMap: new Map([
|
|
336
|
+
['key1', { internalId: 'entity-1', data: 'value1' }],
|
|
337
|
+
]),
|
|
338
|
+
itemSet: new Set([
|
|
339
|
+
{ id: 'set-item-1', value: 1 }
|
|
340
|
+
])
|
|
341
|
+
};
|
|
342
|
+
|
|
343
|
+
const patches = recordPatches(state, (draft) => {
|
|
344
|
+
draft.entityMap.delete('key1');
|
|
345
|
+
}, {
|
|
346
|
+
getItemId: {
|
|
347
|
+
entityMap: (entity) => entity.internalId
|
|
348
|
+
}
|
|
349
|
+
});
|
|
350
|
+
|
|
351
|
+
console.log(patches);
|
|
352
|
+
// [{ op: 'remove', path: ['entityMap', 'key1'], id: 'entity-1' }]
|
|
353
|
+
```
|
|
354
|
+
|
|
355
|
+
#### When IDs are included
|
|
356
|
+
|
|
357
|
+
- **`remove`** patches always include `id` when configured
|
|
358
|
+
- **`replace`** patches include `id` (of the OLD value being replaced)
|
|
359
|
+
- **`add`** patches do NOT include `id` (the value already contains it)
|
|
360
|
+
|
|
361
|
+
#### ID can be undefined/null
|
|
362
|
+
|
|
363
|
+
If the `getItemId` function returns `undefined` or `null`, the `id` field is omitted from the patch. This is useful when some items might not have IDs.
|
|
364
|
+
|
|
278
365
|
## Comparison with Mutative
|
|
279
366
|
|
|
280
367
|
| Feature | Mutative | patch-recorder |
|
|
@@ -285,7 +372,7 @@ const [nextState, patches] = create(state, (draft) => {
|
|
|
285
372
|
| Type safety | ✅ Excellent | ✅ Excellent |
|
|
286
373
|
| API compatibility | - | ✅ `create()` function provides same API |
|
|
287
374
|
| Use case | Immutable state | Mutable with tracking |
|
|
288
|
-
| Performance | Fast |
|
|
375
|
+
| Performance | Fast | 1.1-650x faster |
|
|
289
376
|
|
|
290
377
|
### Easy Migration
|
|
291
378
|
|
|
@@ -326,12 +413,12 @@ patch-recorder provides substantial performance improvements over mutative while
|
|
|
326
413
|
|
|
327
414
|
| Operation | Mutative | patch-recorder | Speedup |
|
|
328
415
|
|-----------|----------|----------------|---------|
|
|
329
|
-
| Simple object mutation | 0.
|
|
330
|
-
| Medium nested object | 0.
|
|
331
|
-
| Large nested object | 0.
|
|
332
|
-
| Array push (100k elements) | 3.
|
|
333
|
-
| Array index (100k elements) | 2.
|
|
334
|
-
| Map operations (100k entries) |
|
|
416
|
+
| Simple object mutation | 0.0215ms | 0.0148ms | **1.45x** |
|
|
417
|
+
| Medium nested object | 0.0254ms | 0.0221ms | **1.15x** |
|
|
418
|
+
| Large nested object | 0.0088ms | 0.0078ms | **1.13x** |
|
|
419
|
+
| Array push (100k elements) | 3.0311ms | 0.6809ms | **4.45x** |
|
|
420
|
+
| Array index (100k elements) | 2.6097ms | 0.0069ms | **380x** |
|
|
421
|
+
| Map operations (100k entries) | 10.4033ms | 0.0160ms | **650x** |
|
|
335
422
|
|
|
336
423
|
**Memory Usage:**
|
|
337
424
|
- **Mutative**: Creates copies (memory overhead proportional to state size)
|
|
@@ -341,17 +428,17 @@ patch-recorder provides substantial performance improvements over mutative while
|
|
|
341
428
|
|
|
342
429
|
The benchmark results reveal patch-recorder's massive advantage for operations that would require copying large data structures:
|
|
343
430
|
|
|
344
|
-
- **Object mutations** (
|
|
345
|
-
- **Array push** (
|
|
346
|
-
- **Array index assignment** (
|
|
347
|
-
- **Map operations** (
|
|
431
|
+
- **Object mutations** (1.13-1.45x faster) - Consistent speedups due to simpler proxy overhead
|
|
432
|
+
- **Array push** (4.45x faster) - Avoids copying entire arrays on mutation
|
|
433
|
+
- **Array index assignment** (380x faster) - **Massive speedup** by not copying 100k-element arrays
|
|
434
|
+
- **Map operations** (650x faster) - **Incredible speedup** by not copying 100k-entry Maps
|
|
348
435
|
|
|
349
436
|
**Why the dramatic differences?**
|
|
350
437
|
- patch-recorder mutates in place, so array index assignment and Map operations don't require copying
|
|
351
438
|
- mutative's copy-on-write approach is elegant but incurs significant overhead for large collections
|
|
352
439
|
- The advantage scales with data size - the larger the collection, the bigger the speedup
|
|
353
440
|
|
|
354
|
-
**Note on mutative's performance:** Mutative is impressively fast for object mutations and offers excellent immutability guarantees. Its speedups of
|
|
441
|
+
**Note on mutative's performance:** Mutative is impressively fast for object mutations and offers excellent immutability guarantees. Its speedups of ~1.1-1.5x for objects are reasonable trade-offs for immutable state management.
|
|
355
442
|
|
|
356
443
|
### Run Benchmarks
|
|
357
444
|
|
package/dist/arrays.d.ts.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"arrays.d.ts","sourceRoot":"","sources":["../src/arrays.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,aAAa,EAAC,MAAM,YAAY,CAAC;
|
|
1
|
+
{"version":3,"file":"arrays.d.ts","sourceRoot":"","sources":["../src/arrays.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,aAAa,EAAC,MAAM,YAAY,CAAC;AAoC9C;;GAEG;AACH,wBAAgB,cAAc,CAC7B,GAAG,EAAE,GAAG,EAAE,EACV,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,CAAC,MAAM,GAAG,MAAM,CAAC,EAAE,EACzB,KAAK,EAAE,aAAa,CAAC,GAAG,CAAC,GACvB,GAAG,CA4CL"}
|
package/dist/arrays.js
CHANGED
|
@@ -1,42 +1,57 @@
|
|
|
1
1
|
import { generateAddPatch, generateDeletePatch, generateReplacePatch } from './patches.js';
|
|
2
2
|
import { createProxy } from './proxy.js';
|
|
3
|
+
// Module-level Sets for O(1) lookup instead of O(n) array includes
|
|
4
|
+
const MUTATING_METHODS = new Set([
|
|
5
|
+
'push',
|
|
6
|
+
'pop',
|
|
7
|
+
'shift',
|
|
8
|
+
'unshift',
|
|
9
|
+
'splice',
|
|
10
|
+
'sort',
|
|
11
|
+
'reverse',
|
|
12
|
+
]);
|
|
13
|
+
const NON_MUTATING_METHODS = new Set([
|
|
14
|
+
'map',
|
|
15
|
+
'filter',
|
|
16
|
+
'reduce',
|
|
17
|
+
'reduceRight',
|
|
18
|
+
'forEach',
|
|
19
|
+
'find',
|
|
20
|
+
'findIndex',
|
|
21
|
+
'some',
|
|
22
|
+
'every',
|
|
23
|
+
'includes',
|
|
24
|
+
'indexOf',
|
|
25
|
+
'lastIndexOf',
|
|
26
|
+
'slice',
|
|
27
|
+
'concat',
|
|
28
|
+
'join',
|
|
29
|
+
'flat',
|
|
30
|
+
'flatMap',
|
|
31
|
+
'at',
|
|
32
|
+
]);
|
|
3
33
|
/**
|
|
4
34
|
* Handle array method calls and property access
|
|
5
35
|
*/
|
|
6
36
|
export function handleArrayGet(obj, prop, path, state) {
|
|
7
37
|
// Mutating methods
|
|
8
|
-
|
|
9
|
-
if (mutatingMethods.includes(prop)) {
|
|
38
|
+
if (MUTATING_METHODS.has(prop)) {
|
|
10
39
|
return (...args) => {
|
|
11
|
-
|
|
40
|
+
// Optimized: only copy what's needed for each method
|
|
41
|
+
const oldLength = obj.length;
|
|
42
|
+
let oldValue = null;
|
|
43
|
+
// Only create full copy for sort/reverse which need the entire old array
|
|
44
|
+
if (prop === 'sort' || prop === 'reverse') {
|
|
45
|
+
oldValue = [...obj];
|
|
46
|
+
}
|
|
12
47
|
const result = Array.prototype[prop].apply(obj, args);
|
|
13
48
|
// Generate patches based on the method
|
|
14
|
-
generateArrayPatches(state, obj, prop, args, result, path, oldValue);
|
|
49
|
+
generateArrayPatches(state, obj, prop, args, result, path, oldValue, oldLength);
|
|
15
50
|
return result;
|
|
16
51
|
};
|
|
17
52
|
}
|
|
18
53
|
// Non-mutating methods - just return them bound to the array
|
|
19
|
-
|
|
20
|
-
'map',
|
|
21
|
-
'filter',
|
|
22
|
-
'reduce',
|
|
23
|
-
'reduceRight',
|
|
24
|
-
'forEach',
|
|
25
|
-
'find',
|
|
26
|
-
'findIndex',
|
|
27
|
-
'some',
|
|
28
|
-
'every',
|
|
29
|
-
'includes',
|
|
30
|
-
'indexOf',
|
|
31
|
-
'lastIndexOf',
|
|
32
|
-
'slice',
|
|
33
|
-
'concat',
|
|
34
|
-
'join',
|
|
35
|
-
'flat',
|
|
36
|
-
'flatMap',
|
|
37
|
-
'at',
|
|
38
|
-
];
|
|
39
|
-
if (nonMutatingMethods.includes(prop)) {
|
|
54
|
+
if (NON_MUTATING_METHODS.has(prop)) {
|
|
40
55
|
return Array.prototype[prop].bind(obj);
|
|
41
56
|
}
|
|
42
57
|
// Property access
|
|
@@ -57,85 +72,70 @@ export function handleArrayGet(obj, prop, path, state) {
|
|
|
57
72
|
/**
|
|
58
73
|
* Generate patches for array mutations
|
|
59
74
|
*/
|
|
60
|
-
function generateArrayPatches(state, obj, method, args, result, path, oldValue) {
|
|
75
|
+
function generateArrayPatches(state, obj, method, args, result, path, oldValue, oldLength) {
|
|
61
76
|
switch (method) {
|
|
62
77
|
case 'push': {
|
|
63
78
|
// Generate add patches for each new element
|
|
64
|
-
|
|
79
|
+
// oldLength is the starting index before push
|
|
65
80
|
args.forEach((value, i) => {
|
|
66
|
-
const index =
|
|
81
|
+
const index = oldLength + i;
|
|
67
82
|
generateAddPatch(state, [...path, index], value);
|
|
68
83
|
});
|
|
69
|
-
//
|
|
70
|
-
if (state.options.arrayLengthAssignment !== false) {
|
|
71
|
-
generateReplacePatch(state, [...path, 'length'], obj.length);
|
|
72
|
-
}
|
|
84
|
+
// No length patch when array grows (aligned with mutative)
|
|
73
85
|
break;
|
|
74
86
|
}
|
|
75
87
|
case 'pop': {
|
|
76
|
-
// Generate remove patch for the removed element
|
|
77
|
-
const removedIndex = oldValue.length - 1;
|
|
78
|
-
generateDeletePatch(state, [...path, removedIndex], result);
|
|
79
|
-
// Generate length patch if option is enabled
|
|
80
88
|
if (state.options.arrayLengthAssignment !== false) {
|
|
81
|
-
|
|
89
|
+
// Generate length replace patch (mutative uses this instead of remove)
|
|
90
|
+
generateReplacePatch(state, [...path, 'length'], obj.length, oldLength);
|
|
91
|
+
}
|
|
92
|
+
else {
|
|
93
|
+
// When arrayLengthAssignment is false, generate remove patch for last element
|
|
94
|
+
generateDeletePatch(state, [...path, oldLength - 1], result);
|
|
82
95
|
}
|
|
83
96
|
break;
|
|
84
97
|
}
|
|
85
98
|
case 'shift': {
|
|
86
|
-
//
|
|
99
|
+
// Remove first element (shifted elements are handled automatically by JSON Patch spec)
|
|
100
|
+
// We don't have oldValue here, but the result of shift() is the removed element
|
|
87
101
|
generateDeletePatch(state, [...path, 0], result);
|
|
88
|
-
// Shift is complex - we need to update all remaining elements
|
|
89
|
-
// Update all shifted elements (after the shift, each element moves to index - 1)
|
|
90
|
-
for (let i = 0; i < obj.length; i++) {
|
|
91
|
-
generateReplacePatch(state, [...path, i], oldValue[i + 1]);
|
|
92
|
-
}
|
|
93
|
-
// Generate length patch if option is enabled
|
|
94
|
-
if (state.options.arrayLengthAssignment !== false) {
|
|
95
|
-
generateReplacePatch(state, [...path, 'length'], obj.length);
|
|
96
|
-
}
|
|
97
102
|
break;
|
|
98
103
|
}
|
|
99
104
|
case 'unshift': {
|
|
100
|
-
// Add new elements at the beginning
|
|
105
|
+
// Add new elements at the beginning (shifted elements are handled automatically by JSON Patch spec)
|
|
101
106
|
args.forEach((value, i) => {
|
|
102
107
|
generateAddPatch(state, [...path, i], value);
|
|
103
108
|
});
|
|
104
|
-
// Update all existing elements
|
|
105
|
-
for (let i = 0; i < oldValue.length; i++) {
|
|
106
|
-
generateReplacePatch(state, [...path, i + args.length], oldValue[i]);
|
|
107
|
-
}
|
|
108
|
-
// Generate length patch if option is enabled
|
|
109
|
-
if (state.options.arrayLengthAssignment !== false) {
|
|
110
|
-
generateReplacePatch(state, [...path, 'length'], obj.length);
|
|
111
|
-
}
|
|
112
109
|
break;
|
|
113
110
|
}
|
|
114
111
|
case 'splice': {
|
|
115
|
-
const [start, deleteCount, ...addItems] = args;
|
|
116
|
-
|
|
117
|
-
|
|
118
|
-
|
|
112
|
+
const [start, deleteCount = 0, ...addItems] = args;
|
|
113
|
+
const actualStart = start < 0 ? Math.max(oldLength + start, 0) : Math.min(start, oldLength);
|
|
114
|
+
const actualDeleteCount = Math.min(deleteCount, oldLength - actualStart);
|
|
115
|
+
const minCount = Math.min(actualDeleteCount, addItems.length);
|
|
116
|
+
// For splice, we need the old values for delete operations
|
|
117
|
+
// Since we don't have oldValue, we need to track what was deleted
|
|
118
|
+
// The result of splice() is the array of deleted elements
|
|
119
|
+
const deletedElements = result;
|
|
120
|
+
// First minCount elements: replace (overlap between add and delete)
|
|
121
|
+
for (let i = 0; i < minCount; i++) {
|
|
122
|
+
generateReplacePatch(state, [...path, actualStart + i], addItems[i], deletedElements[i]);
|
|
119
123
|
}
|
|
120
|
-
//
|
|
121
|
-
addItems.
|
|
122
|
-
generateAddPatch(state, [...path,
|
|
123
|
-
});
|
|
124
|
-
// If there are both deletions and additions, update the shifted elements
|
|
125
|
-
const itemsToShift = oldValue.length - start - deleteCount;
|
|
126
|
-
for (let i = 0; i < itemsToShift; i++) {
|
|
127
|
-
generateReplacePatch(state, [...path, start + addItems.length + i], oldValue[start + deleteCount + i]);
|
|
124
|
+
// Remaining add items: add
|
|
125
|
+
for (let i = minCount; i < addItems.length; i++) {
|
|
126
|
+
generateAddPatch(state, [...path, actualStart + i], addItems[i]);
|
|
128
127
|
}
|
|
129
|
-
//
|
|
130
|
-
|
|
131
|
-
|
|
128
|
+
// Remaining delete items: remove (generate in reverse order)
|
|
129
|
+
for (let i = actualDeleteCount - 1; i >= minCount; i--) {
|
|
130
|
+
generateDeletePatch(state, [...path, actualStart + i], deletedElements[i]);
|
|
132
131
|
}
|
|
133
132
|
break;
|
|
134
133
|
}
|
|
135
134
|
case 'sort':
|
|
136
135
|
case 'reverse': {
|
|
137
136
|
// These reorder the entire array - generate full replace
|
|
138
|
-
|
|
137
|
+
// oldValue contains the array before the mutation
|
|
138
|
+
generateReplacePatch(state, path, [...obj], oldValue);
|
|
139
139
|
break;
|
|
140
140
|
}
|
|
141
141
|
}
|
package/dist/arrays.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"arrays.js","sourceRoot":"","sources":["../src/arrays.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"arrays.js","sourceRoot":"","sources":["../src/arrays.ts"],"names":[],"mappings":"AACA,OAAO,EAAC,gBAAgB,EAAE,mBAAmB,EAAE,oBAAoB,EAAC,MAAM,cAAc,CAAC;AACzF,OAAO,EAAC,WAAW,EAAC,MAAM,YAAY,CAAC;AAEvC,mEAAmE;AACnE,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC;IAChC,MAAM;IACN,KAAK;IACL,OAAO;IACP,SAAS;IACT,QAAQ;IACR,MAAM;IACN,SAAS;CACT,CAAC,CAAC;AAEH,MAAM,oBAAoB,GAAG,IAAI,GAAG,CAAC;IACpC,KAAK;IACL,QAAQ;IACR,QAAQ;IACR,aAAa;IACb,SAAS;IACT,MAAM;IACN,WAAW;IACX,MAAM;IACN,OAAO;IACP,UAAU;IACV,SAAS;IACT,aAAa;IACb,OAAO;IACP,QAAQ;IACR,MAAM;IACN,MAAM;IACN,SAAS;IACT,IAAI;CACJ,CAAC,CAAC;AAEH;;GAEG;AACH,MAAM,UAAU,cAAc,CAC7B,GAAU,EACV,IAAY,EACZ,IAAyB,EACzB,KAAyB;IAEzB,mBAAmB;IACnB,IAAI,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QAChC,OAAO,CAAC,GAAG,IAAW,EAAE,EAAE;YACzB,qDAAqD;YACrD,MAAM,SAAS,GAAG,GAAG,CAAC,MAAM,CAAC;YAC7B,IAAI,QAAQ,GAAiB,IAAI,CAAC;YAElC,yEAAyE;YACzE,IAAI,IAAI,KAAK,MAAM,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBAC3C,QAAQ,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;YACrB,CAAC;YAED,MAAM,MAAM,GAAI,KAAK,CAAC,SAAiB,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAE/D,uCAAuC;YACvC,oBAAoB,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;YAEhF,OAAO,MAAM,CAAC;QACf,CAAC,CAAC;IACH,CAAC;IAED,6DAA6D;IAC7D,IAAI,oBAAoB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QACpC,OAAQ,KAAK,CAAC,SAAiB,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjD,CAAC;IAED,kBAAkB;IAClB,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;QACvB,OAAO,GAAG,CAAC,MAAM,CAAC;IACnB,CAAC;IAED,MAAM,KAAK,GAAG,GAAG,CAAC,IAAW,CAAC,CAAC;IAE/B,gFAAgF;IAChF,2DAA2D;IAC3D,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QACzE,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;QAC3B,OAAO,WAAW,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC;IACpD,CAAC;IAED,2DAA2D;IAC3D,+EAA+E;IAC/E,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAC5B,KAAyB,EACzB,GAAU,EACV,MAAc,EACd,IAAW,EACX,MAAW,EACX,IAAyB,EACzB,QAAsB,EACtB,SAAiB;IAEjB,QAAQ,MAAM,EAAE,CAAC;QAChB,KAAK,MAAM,CAAC,CAAC,CAAC;YACb,4CAA4C;YAC5C,8CAA8C;YAC9C,IAAI,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE;gBACzB,MAAM,KAAK,GAAG,SAAS,GAAG,CAAC,CAAC;gBAC5B,gBAAgB,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC;YAClD,CAAC,CAAC,CAAC;YACH,2DAA2D;YAC3D,MAAM;QACP,CAAC;QAED,KAAK,KAAK,CAAC,CAAC,CAAC;YACZ,IAAI,KAAK,CAAC,OAAO,CAAC,qBAAqB,KAAK,KAAK,EAAE,CAAC;gBACnD,uEAAuE;gBACvE,oBAAoB,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,QAAQ,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;YACzE,CAAC;iBAAM,CAAC;gBACP,8EAA8E;gBAC9E,mBAAmB,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,SAAS,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YAC9D,CAAC;YACD,MAAM;QACP,CAAC;QAED,KAAK,OAAO,CAAC,CAAC,CAAC;YACd,uFAAuF;YACvF,gFAAgF;YAChF,mBAAmB,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YACjD,MAAM;QACP,CAAC;QAED,KAAK,SAAS,CAAC,CAAC,CAAC;YAChB,oGAAoG;YACpG,IAAI,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE;gBACzB,gBAAgB,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAC9C,CAAC,CAAC,CAAC;YACH,MAAM;QACP,CAAC;QAED,KAAK,QAAQ,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,KAAK,EAAE,WAAW,GAAG,CAAC,EAAE,GAAG,QAAQ,CAAC,GAAG,IAAI,CAAC;YACnD,MAAM,WAAW,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;YAC5F,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,SAAS,GAAG,WAAW,CAAC,CAAC;YACzE,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,iBAAiB,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;YAE9D,2DAA2D;YAC3D,kEAAkE;YAClE,0DAA0D;YAC1D,MAAM,eAAe,GAAG,MAAe,CAAC;YAExC,oEAAoE;YACpE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,oBAAoB,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,WAAW,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1F,CAAC;YAED,2BAA2B;YAC3B,KAAK,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjD,gBAAgB,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,WAAW,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YAClE,CAAC;YAED,6DAA6D;YAC7D,KAAK,IAAI,CAAC,GAAG,iBAAiB,GAAG,CAAC,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxD,mBAAmB,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,WAAW,GAAG,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5E,CAAC;YAED,MAAM;QACP,CAAC;QAED,KAAK,MAAM,CAAC;QACZ,KAAK,SAAS,CAAC,CAAC,CAAC;YAChB,yDAAyD;YACzD,kDAAkD;YAClD,oBAAoB,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC;YACtD,MAAM;QACP,CAAC;IACF,CAAC;AACF,CAAC"}
|
package/dist/index.d.ts.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EACX,YAAY,EACZ,KAAK,EACL,oBAAoB,EACpB,OAAO,EAGP,MAAM,YAAY,CAAC;AAEpB;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,aAAa,CAAC,CAAC,SAAS,YAAY,EACnD,KAAK,EAAE,CAAC,EACR,MAAM,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,EACjC,OAAO,GAAE,oBAAyB,GAChC,OAAO,CAAC,IAAI,CAAC,CA4Bf;
|
|
1
|
+
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EACX,YAAY,EACZ,KAAK,EACL,oBAAoB,EACpB,OAAO,EAGP,MAAM,YAAY,CAAC;AAEpB;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,aAAa,CAAC,CAAC,SAAS,YAAY,EACnD,KAAK,EAAE,CAAC,EACR,MAAM,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,EACjC,OAAO,GAAE,oBAAyB,GAChC,OAAO,CAAC,IAAI,CAAC,CA4Bf;AAGD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,MAAM,CAAC,CAAC,SAAS,YAAY,EAC5C,KAAK,EAAE,CAAC,EACR,MAAM,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,EACjC,OAAO,GAAE,oBAAoB,GAAG;IAAC,aAAa,EAAE,IAAI,CAAA;CAAyB,GAC3E,CAAC,CAAC,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAKpB;AAGD,YAAY,EACX,YAAY,EACZ,KAAK,EACL,oBAAoB,EACpB,OAAO,EACP,KAAK,EACL,SAAS,GACT,MAAM,YAAY,CAAC"}
|
package/dist/index.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,WAAW,EAAC,MAAM,YAAY,CAAC;AACvC,OAAO,EAAC,eAAe,EAAC,MAAM,gBAAgB,CAAC;AAU/C;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,aAAa,CAC5B,KAAQ,EACR,MAAiC,EACjC,UAAgC,EAAE;IAElC,MAAM,sBAAsB,GAAG;QAC9B,WAAW,EAAE,OAAO,CAAC,WAAW,IAAI,IAAI;QACxC,qBAAqB,EAAE,OAAO,CAAC,qBAAqB,IAAI,IAAI;KAC5D,CAAC;IAEF,MAAM,aAAa,GAAG;QACrB,QAAQ,EAAE,KAAK;QACf,OAAO,EAAE,EAAE;QACX,QAAQ,EAAE,EAAE;QACZ,OAAO,EAAE;YACR,GAAG,OAAO;YACV,sBAAsB;SACtB;KACD,CAAC;IAEF,eAAe;IACf,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,EAAE,EAAE,EAAE,aAAa,CAAa,CAAC;IAEhE,kBAAkB;IAClB,MAAM,CAAC,KAAK,CAAC,CAAC;IAEd,yCAAyC;IACzC,IAAI,OAAO,CAAC,eAAe,KAAK,KAAK,EAAE,CAAC;QACvC,OAAO,eAAe,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;IAC/C,CAAC;IAED,OAAO,aAAa,CAAC,OAAwB,CAAC;AAC/C,CAAC;
|
|
1
|
+
{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,WAAW,EAAC,MAAM,YAAY,CAAC;AACvC,OAAO,EAAC,eAAe,EAAC,MAAM,gBAAgB,CAAC;AAU/C;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,aAAa,CAC5B,KAAQ,EACR,MAAiC,EACjC,UAAgC,EAAE;IAElC,MAAM,sBAAsB,GAAG;QAC9B,WAAW,EAAE,OAAO,CAAC,WAAW,IAAI,IAAI;QACxC,qBAAqB,EAAE,OAAO,CAAC,qBAAqB,IAAI,IAAI;KAC5D,CAAC;IAEF,MAAM,aAAa,GAAG;QACrB,QAAQ,EAAE,KAAK;QACf,OAAO,EAAE,EAAE;QACX,QAAQ,EAAE,EAAE;QACZ,OAAO,EAAE;YACR,GAAG,OAAO;YACV,sBAAsB;SACtB;KACD,CAAC;IAEF,eAAe;IACf,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,EAAE,EAAE,EAAE,aAAa,CAAa,CAAC;IAEhE,kBAAkB;IAClB,MAAM,CAAC,KAAK,CAAC,CAAC;IAEd,yCAAyC;IACzC,IAAI,OAAO,CAAC,eAAe,KAAK,KAAK,EAAE,CAAC;QACvC,OAAO,eAAe,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;IAC/C,CAAC;IAED,OAAO,aAAa,CAAC,OAAwB,CAAC;AAC/C,CAAC;AAGD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,UAAU,MAAM,CACrB,KAAQ,EACR,MAAiC,EACjC,UAAwD,EAAC,aAAa,EAAE,IAAI,EAAC;IAE7E,oEAAoE;IACpE,MAAM,EAAC,aAAa,EAAE,GAAG,oBAAoB,EAAC,GAAG,OAAO,CAAC;IACzD,MAAM,OAAO,GAAG,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,oBAAoB,CAAC,CAAC;IACnE,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;AACzB,CAAC"}
|
package/dist/maps.d.ts.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"maps.d.ts","sourceRoot":"","sources":["../src/maps.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,aAAa,EAAC,MAAM,YAAY,CAAC;AAM9C;;;GAGG;AACH,wBAAgB,YAAY,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,EAC5C,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EACd,IAAI,EAAE,MAAM,GAAG,MAAM,EACrB,IAAI,EAAE,CAAC,MAAM,GAAG,MAAM,CAAC,EAAE,EACzB,KAAK,EAAE,aAAa,CAAC,GAAG,CAAC,GACvB,GAAG,
|
|
1
|
+
{"version":3,"file":"maps.d.ts","sourceRoot":"","sources":["../src/maps.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,aAAa,EAAC,MAAM,YAAY,CAAC;AAM9C;;;GAGG;AACH,wBAAgB,YAAY,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,EAC5C,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EACd,IAAI,EAAE,MAAM,GAAG,MAAM,EACrB,IAAI,EAAE,CAAC,MAAM,GAAG,MAAM,CAAC,EAAE,EACzB,KAAK,EAAE,aAAa,CAAC,GAAG,CAAC,GACvB,GAAG,CAmFL"}
|
package/dist/maps.js
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
import { createProxy } from './proxy.js';
|
|
2
2
|
import { generateAddPatch, generateDeletePatch, generateReplacePatch } from './patches.js';
|
|
3
|
-
import { cloneIfNeeded
|
|
3
|
+
import { cloneIfNeeded } from './utils.js';
|
|
4
4
|
/**
|
|
5
5
|
* Handle property access on Map objects
|
|
6
6
|
* Wraps mutating methods (set, delete, clear) to generate patches
|
|
@@ -20,8 +20,8 @@ export function handleMapGet(obj, prop, path, state) {
|
|
|
20
20
|
// Generate patch
|
|
21
21
|
const itemPath = [...path, key];
|
|
22
22
|
if (existed) {
|
|
23
|
-
// Key exists - replace
|
|
24
|
-
generateReplacePatch(state, itemPath, cloneIfNeeded(value));
|
|
23
|
+
// Key exists - replace (pass oldValue for getItemId)
|
|
24
|
+
generateReplacePatch(state, itemPath, cloneIfNeeded(value), oldValue);
|
|
25
25
|
}
|
|
26
26
|
else {
|
|
27
27
|
// Key doesn't exist - add
|
|
@@ -56,11 +56,9 @@ export function handleMapGet(obj, prop, path, state) {
|
|
|
56
56
|
if (prop === 'get') {
|
|
57
57
|
return (key) => {
|
|
58
58
|
const value = obj.get(key);
|
|
59
|
-
// If the value is
|
|
59
|
+
// If the value is an object, return a proxy for nested mutation tracking
|
|
60
60
|
if (value != null && typeof value === 'object') {
|
|
61
|
-
|
|
62
|
-
return createProxy(value, [...path, key], state);
|
|
63
|
-
}
|
|
61
|
+
return createProxy(value, [...path, key], state);
|
|
64
62
|
}
|
|
65
63
|
return value;
|
|
66
64
|
};
|
package/dist/maps.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"maps.js","sourceRoot":"","sources":["../src/maps.ts"],"names":[],"mappings":"AACA,OAAO,EAAC,WAAW,EAAC,MAAM,YAAY,CAAC;AAEvC,OAAO,EAAC,gBAAgB,EAAE,mBAAmB,EAAE,oBAAoB,EAAC,MAAM,cAAc,CAAC;AACzF,OAAO,EAAC,aAAa,
|
|
1
|
+
{"version":3,"file":"maps.js","sourceRoot":"","sources":["../src/maps.ts"],"names":[],"mappings":"AACA,OAAO,EAAC,WAAW,EAAC,MAAM,YAAY,CAAC;AAEvC,OAAO,EAAC,gBAAgB,EAAE,mBAAmB,EAAE,oBAAoB,EAAC,MAAM,cAAc,CAAC;AACzF,OAAO,EAAC,aAAa,EAAiB,MAAM,YAAY,CAAC;AAEzD;;;GAGG;AACH,MAAM,UAAU,YAAY,CAC3B,GAAc,EACd,IAAqB,EACrB,IAAyB,EACzB,KAAyB;IAEzB,yBAAyB;IACzB,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC9B,OAAQ,GAAW,CAAC,IAAI,CAAC,CAAC;IAC3B,CAAC;IAED,mBAAmB;IACnB,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC;QACpB,OAAO,CAAC,GAAM,EAAE,KAAQ,EAAE,EAAE;YAC3B,uCAAuC;YACvC,MAAM,OAAO,GAAG,mBAAmB,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;YAC/D,MAAM,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC9B,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAEnC,iBAAiB;YACjB,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,EAAE,GAAU,CAAC,CAAC;YAEvC,IAAI,OAAO,EAAE,CAAC;gBACb,qDAAqD;gBACrD,oBAAoB,CAAC,KAAK,EAAE,QAAQ,EAAE,aAAa,CAAC,KAAK,CAAC,EAAE,QAAQ,CAAC,CAAC;YACvE,CAAC;iBAAM,CAAC;gBACP,0BAA0B;gBAC1B,gBAAgB,CAAC,KAAK,EAAE,QAAQ,EAAE,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC;YACzD,CAAC;YAED,OAAO,MAAM,CAAC;QACf,CAAC,CAAC;IACH,CAAC;IAED,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;QACvB,OAAO,CAAC,GAAM,EAAE,EAAE;YACjB,MAAM,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC9B,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAE/B,IAAI,MAAM,EAAE,CAAC;gBACZ,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,EAAE,GAAU,CAAC,CAAC;gBACvC,mBAAmB,CAAC,KAAK,EAAE,QAAQ,EAAE,aAAa,CAAC,QAAQ,CAAC,CAAC,CAAC;YAC/D,CAAC;YAED,OAAO,MAAM,CAAC;QACf,CAAC,CAAC;IACH,CAAC;IAED,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;QACtB,OAAO,GAAG,EAAE;YACX,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;YAC1C,GAAG,CAAC,KAAK,EAAE,CAAC;YAEZ,wCAAwC;YACxC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE;gBAChC,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,EAAE,GAAU,CAAC,CAAC;gBACvC,mBAAmB,CAAC,KAAK,EAAE,QAAQ,EAAE,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC;YAC5D,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC;IACH,CAAC;IAED,uBAAuB;IACvB,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC;QACpB,OAAO,CAAC,GAAM,EAAE,EAAE;YACjB,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAE3B,yEAAyE;YACzE,IAAI,KAAK,IAAI,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;gBAChD,OAAO,WAAW,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,GAAU,CAAC,EAAE,KAAK,CAAC,CAAC;YACzD,CAAC;YAED,OAAO,KAAK,CAAC;QACd,CAAC,CAAC;IACH,CAAC;IAED,MAAM,kBAAkB,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;IAE3E,IAAI,kBAAkB,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QACvC,OAAQ,GAAW,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACrC,CAAC;IAED,gBAAgB;IAChB,IAAI,IAAI,KAAK,MAAM,EAAE,CAAC;QACrB,OAAO,GAAG,CAAC,IAAI,CAAC;IACjB,CAAC;IAED,4BAA4B;IAC5B,OAAQ,GAAW,CAAC,IAAI,CAAC,CAAC;AAC3B,CAAC;AAED;;;GAGG;AACH,SAAS,mBAAmB,CAAC,QAAa,EAAE,IAAyB,EAAE,GAAQ;IAC9E,IAAI,OAAO,GAAG,QAAQ,CAAC;IACvB,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;QACzB,IAAI,OAAO,IAAI,IAAI;YAAE,OAAO,KAAK,CAAC;QAClC,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,+CAA+C;IAC/C,IAAI,OAAO,YAAY,GAAG,EAAE,CAAC;QAC5B,OAAO,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACzB,CAAC;IAED,OAAO,KAAK,CAAC;AACd,CAAC"}
|
package/dist/optimizer.d.ts.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"optimizer.d.ts","sourceRoot":"","sources":["../src/optimizer.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,OAAO,EAAC,MAAM,YAAY,CAAC;AAExC;;;GAGG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,
|
|
1
|
+
{"version":3,"file":"optimizer.d.ts","sourceRoot":"","sources":["../src/optimizer.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,OAAO,EAAC,MAAM,YAAY,CAAC;AAExC;;;GAGG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CA8CrE"}
|