dexie 4.0.5 → 4.0.8

package/dist/dexie.d.ts

@@ -4,7 +4,7 @@
  *
  * By David Fahlander, david.fahlander@gmail.com
  *
- * Version 4.0.5, Sat May 25 2024
+ * Version 4.0.8, Wed Jul 10 2024
  *
  * https://dexie.org
  *
@@ -360,19 +360,20 @@ export interface PromiseExtended<T = any> extends Promise<T> {
 	timeout(ms: number, msg?: string): PromiseExtended<T>;
 }
 export type KeyPaths<T> = {
-	[P in keyof T]: P extends string ? T[P] extends Array<infer K> ? K extends object // only drill into the array element if it's an object
+	[P in keyof T]: P extends string ? T[P] extends Array<infer K> ? K extends any[] // Array of arrays (issue #2026)
+	 ? P | `${P}.${number}` | `${P}.${number}.${number}` : K extends object // only drill into the array element if it's an object
 	 ? P | `${P}.${number}` | `${P}.${number}.${KeyPaths<K>}` : P | `${P}.${number}` : T[P] extends (...args: any[]) => any // Method
 	 ? never : T[P] extends object ? P | `${P}.${KeyPaths<T[P]>}` : P : never;
 }[keyof T];
-export type KeyPathValue<T, PATH> = PATH extends `${infer R}.${infer S}` ? R extends keyof T ? KeyPathValue<T[R], S> : T extends any[] ? PATH extends `${number}.${infer S}` ? KeyPathValue<T[number], S> : void : void : PATH extends `${number}` ? T extends any[] ? T[number] : void : PATH extends keyof T ? T[PATH] : void;
+export type KeyPathValue<T, PATH> = PATH extends `${infer R}.${infer S}` ? R extends keyof T ? KeyPathValue<T[R], S> : T extends any[] ? PATH extends `${number}.${infer S}` ? KeyPathValue<T[number], S> : void : void : PATH extends `${number}` ? T extends any[] ? T[number] : void : PATH extends keyof T ? T[PATH] : any;
 export declare const PropModSymbol: unique symbol;
 export type PropModSpec = {
 	replacePrefix?: [
 		string,
 		string
 	];
-	add?: number | BigInt | Array<string | number>;
-	remove?: number | BigInt | Array<string | number>;
+	add?: number | bigint | Array<string | number>;
+	remove?: number | bigint | Array<string | number>;
 };
 export class PropModification implements PropModSpec {
 	[PropModSymbol]?: true;
@@ -380,8 +381,8 @@ export class PropModification implements PropModSpec {
 		string,
 		string
 	];
-	add?: number | BigInt | Array<string | number>;
-	remove?: number | BigInt | Array<string | number>;
+	add?: number | bigint | Array<string | number>;
+	remove?: number | bigint | Array<string | number>;
 	execute<T>(value: T): T;
 	constructor(spec: PropModSpec);
 }
@@ -444,8 +445,8 @@ export type IntervalTree = IntervalTreeNode | EmptyRange;
 export interface IntervalTreeNode {
 	from: IndexableType; // lower bound
 	to: IndexableType; // upper bound
-	l: IntervalTreeNode | null; // left
-	r: IntervalTreeNode | null; // right
+	l?: IntervalTreeNode | null; // left
+	r?: IntervalTreeNode | null; // right
 	d: number; // depth
 }
 export interface EmptyRange {
@@ -572,6 +573,7 @@ export interface DBCorePutRequest {
 	changeSpec?: {
 		[keyPath: string]: any;
 	}; // Common changeSpec for each key
+	isAdditionalChunk?: boolean;
 	updates?: {
 		keys: any[];
 		changeSpecs: {
@@ -590,6 +592,7 @@ export interface DBCoreDeleteRequest {
 		index: string | null;
 		range: DBCoreKeyRange;
 	};
+	isAdditionalChunk?: boolean;
 }
 export interface DBCoreDeleteRangeRequest {
 	type: "deleteRange";
@@ -735,10 +738,11 @@ export interface Table<T = any, TKey = any, TInsertType = T> {
 	reverse(): Collection<T, TKey, TInsertType>;
 	mapToClass(constructor: Function): Function;
 	add(item: TInsertType, key?: TKey): PromiseExtended<TKey>;
-	update(key: TKey | T, changes: UpdateSpec<TInsertType> | ((obj: T, ctx: {
+	update(key: TKey | T, changes: ((obj: T, ctx: {
 		value: any;
 		primKey: IndexableType;
 	}) => void | boolean)): PromiseExtended<number>;
+	update(key: TKey | T, changes: UpdateSpec<TInsertType>): PromiseExtended<number>;
 	put(item: TInsertType, key?: TKey): PromiseExtended<TKey>;
 	delete(key: TKey): PromiseExtended<void>;
 	clear(): PromiseExtended<void>;

package/dist/dexie.js

@@ -4,7 +4,7 @@
  *
  * By David Fahlander, david.fahlander@gmail.com
  *
- * Version 4.0.5, Sat May 25 2024
+ * Version 4.0.8, Wed Jul 10 2024
  *
  * https://dexie.org
  *
@@ -1150,7 +1150,7 @@
         }
     }
 
-    var DEXIE_VERSION = '4.0.5';
+    var DEXIE_VERSION = '4.0.8';
     var maxString = String.fromCharCode(65535);
     var minKey = -Infinity;
     var INVALID_KEY_ARGUMENT = "Invalid key provided. Keys must be of type string, number, Date or Array<string | number | Date>.";
@@ -2154,6 +2154,12 @@
                     }
                 };
                 return _this.clone().primaryKeys().then(function (keys) {
+                    var criteria = isPlainKeyRange(ctx) &&
+                        ctx.limit === Infinity &&
+                        (typeof changes !== 'function' || changes === deleteCallback) && {
+                        index: ctx.index,
+                        range: ctx.range
+                    };
                     var nextChunk = function (offset) {
                         var count = Math.min(limit, keys.length - offset);
                         return coreTable.getMany({
@@ -2186,12 +2192,6 @@
                                     }
                                 }
                             }
-                            var criteria = isPlainKeyRange(ctx) &&
-                                ctx.limit === Infinity &&
-                                (typeof changes !== 'function' || changes === deleteCallback) && {
-                                index: ctx.index,
-                                range: ctx.range
-                            };
                             return Promise.resolve(addValues.length > 0 &&
                                 coreTable.mutate({ trans: trans, type: 'add', values: addValues })
                                     .then(function (res) {
@@ -2207,13 +2207,15 @@
                                     values: putValues,
                                     criteria: criteria,
                                     changeSpec: typeof changes !== 'function'
-                                        && changes
+                                        && changes,
+                                    isAdditionalChunk: offset > 0
                                 }).then(function (res) { return applyMutateResult(putValues.length, res); }); }).then(function () { return (deleteKeys.length > 0 || (criteria && changes === deleteCallback)) &&
                                 coreTable.mutate({
                                     trans: trans,
                                     type: 'delete',
                                     keys: deleteKeys,
-                                    criteria: criteria
+                                    criteria: criteria,
+                                    isAdditionalChunk: offset > 0
                                 }).then(function (res) { return applyMutateResult(deleteKeys.length, res); }); }).then(function () {
                                 return keys.length > offset + count && nextChunk(offset + limit);
                             });
@@ -3797,6 +3799,10 @@
                 var _this = this;
                 keys.forEach(function (key) { return addRange(_this, key, key); });
                 return this;
+            },
+            hasKey: function (key) {
+                var node = getRangeSetIterator(this).next(key).value;
+                return node && cmp(node.from, key) <= 0 && cmp(node.to, key) >= 0;
             }
         },
         _a[iteratorSymbol] = function () {
@@ -4858,19 +4864,23 @@
         var extractLowLevelIndex = (index.lowLevelIndex || index).extractKey;
         var finalResult = ops.reduce(function (result, op) {
             var modifedResult = result;
-            var includedValues = op.type === 'add' || op.type === 'put'
-                ? op.values.filter(function (v) {
-                    var key = extractIndex(v);
-                    return multiEntry && isArray(key)
+            var includedValues = [];
+            if (op.type === 'add' || op.type === 'put') {
+                var includedPKs = new RangeSet();
+                for (var i = op.values.length - 1; i >= 0; --i) {
+                    var value = op.values[i];
+                    var pk = extractPrimKey(value);
+                    if (includedPKs.hasKey(pk))
+                        continue;
+                    var key = extractIndex(value);
+                    if (multiEntry && isArray(key)
                         ? key.some(function (k) { return isWithinRange(k, queryRange); })
-                        : isWithinRange(key, queryRange);
-                }).map(function (v) {
-                    v = deepClone(v);
-                    if (immutable)
-                        Object.freeze(v);
-                    return v;
-                })
-                : [];
+                        : isWithinRange(key, queryRange)) {
+                        includedPKs.addKey(pk);
+                        includedValues.push(value);
+                    }
+                }
+            }
             switch (op.type) {
                 case 'add':
                     modifedResult = result.concat(req.values
@@ -4880,20 +4890,16 @@
                 case 'put':
                     var keySet_1 = new RangeSet().addKeys(op.values.map(function (v) { return extractPrimKey(v); }));
                     modifedResult = result
-                        .filter(function (item) {
-                        var key = req.values ? extractPrimKey(item) : item;
-                        return !rangesOverlap(new RangeSet(key), keySet_1);
-                    })
-                        .concat(req.values
+                        .filter(
+                    function (item) { return !keySet_1.hasKey(req.values ? extractPrimKey(item) : item); })
+                        .concat(
+                    req.values
                         ? includedValues
                         : includedValues.map(function (v) { return extractPrimKey(v); }));
                     break;
                 case 'delete':
                     var keysToDelete_1 = new RangeSet().addKeys(op.keys);
-                    modifedResult = result.filter(function (item) {
-                        var key = req.values ? extractPrimKey(item) : item;
-                        return !rangesOverlap(new RangeSet(key), keysToDelete_1);
-                    });
+                    modifedResult = result.filter(function (item) { return !keysToDelete_1.hasKey(req.values ? extractPrimKey(item) : item); });
                     break;
                 case 'deleteRange':
                     var range_1 = op.range;