indexeddbshim 15.0.3 → 15.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/dist/CFG.d.ts +3 -36
- package/dist/CFG.d.ts.map +1 -1
- package/dist/DOMException.d.ts +1 -1
- package/dist/DOMException.d.ts.map +1 -1
- package/dist/DOMStringList.d.ts +1 -1
- package/dist/DOMStringList.d.ts.map +1 -1
- package/dist/Event.d.ts.map +1 -1
- package/dist/IDBCursor.d.ts +21 -21
- package/dist/IDBCursor.d.ts.map +1 -1
- package/dist/IDBDatabase.d.ts +13 -11
- package/dist/IDBDatabase.d.ts.map +1 -1
- package/dist/IDBFactory.d.ts +4 -4
- package/dist/IDBFactory.d.ts.map +1 -1
- package/dist/IDBIndex.d.ts +17 -17
- package/dist/IDBIndex.d.ts.map +1 -1
- package/dist/IDBKeyRange.d.ts +7 -7
- package/dist/IDBKeyRange.d.ts.map +1 -1
- package/dist/IDBObjectStore.d.ts +33 -33
- package/dist/IDBObjectStore.d.ts.map +1 -1
- package/dist/IDBRequest.d.ts +6 -19
- package/dist/IDBRequest.d.ts.map +1 -1
- package/dist/IDBTransaction.d.ts +13 -13
- package/dist/IDBTransaction.d.ts.map +1 -1
- package/dist/Key.d.ts +10 -10
- package/dist/Key.d.ts.map +1 -1
- package/dist/Sca.d.ts +1 -1
- package/dist/Sca.d.ts.map +1 -1
- package/dist/UnicodeIdentifiers.d.ts +2 -2
- package/dist/UnicodeIdentifiers.d.ts.map +1 -1
- package/dist/cmp.d.ts +1 -1
- package/dist/indexeddbshim-Key.js +3 -2
- package/dist/indexeddbshim-Key.js.map +1 -1
- package/dist/indexeddbshim-Key.min.js +1 -1
- package/dist/indexeddbshim-Key.min.js.map +1 -1
- package/dist/indexeddbshim-UnicodeIdentifiers-node.cjs +61 -59
- package/dist/indexeddbshim-UnicodeIdentifiers-node.cjs.map +1 -1
- package/dist/indexeddbshim-UnicodeIdentifiers.js +71 -70
- package/dist/indexeddbshim-UnicodeIdentifiers.js.map +1 -1
- package/dist/indexeddbshim-UnicodeIdentifiers.min.js +2 -2
- package/dist/indexeddbshim-UnicodeIdentifiers.min.js.map +1 -1
- package/dist/indexeddbshim-node.cjs +61 -59
- package/dist/indexeddbshim-node.cjs.map +1 -1
- package/dist/indexeddbshim-noninvasive.js +71 -70
- package/dist/indexeddbshim-noninvasive.js.map +1 -1
- package/dist/indexeddbshim-noninvasive.min.js +2 -2
- package/dist/indexeddbshim-noninvasive.min.js.map +1 -1
- package/dist/indexeddbshim.js +71 -70
- package/dist/indexeddbshim.js.map +1 -1
- package/dist/indexeddbshim.min.js +2 -2
- package/dist/indexeddbshim.min.js.map +1 -1
- package/dist/node-UnicodeIdentifiers.d.ts +1 -1
- package/dist/node-UnicodeIdentifiers.d.ts.map +1 -1
- package/dist/node.d.ts +1 -1
- package/dist/node.d.ts.map +1 -1
- package/dist/setGlobalVars.d.ts +4 -5
- package/dist/setGlobalVars.d.ts.map +1 -1
- package/dist/util.d.ts +2 -2
- package/dist/util.d.ts.map +1 -1
- package/package.json +7 -7
- package/src/IDBFactory.js +2 -1
- package/src/IDBIndex.js +1 -0
- package/src/IDBObjectStore.js +1 -3
- package/src/Key.js +2 -1
- package/src/setGlobalVars.js +1 -1
- package/src/Key.d.ts +0 -1
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
/*! indexeddbshim - v15.0.
|
|
1
|
+
/*! indexeddbshim - v15.0.4 - 9/11/2024 */
|
|
2
2
|
|
|
3
3
|
'use strict';
|
|
4
4
|
|
|
@@ -3464,6 +3464,7 @@ function findMultiEntryMatches(keyEntry, range) {
|
|
|
3464
3464
|
continue;
|
|
3465
3465
|
}
|
|
3466
3466
|
if (key.length === 1) {
|
|
3467
|
+
// eslint-disable-next-line sonarjs/updated-loop-counter -- Convenient
|
|
3467
3468
|
key = key[0];
|
|
3468
3469
|
} else {
|
|
3469
3470
|
const nested = findMultiEntryMatches(key, range);
|
|
@@ -3687,7 +3688,7 @@ function generateKeyForStore(tx, store, cb, sqlFailCb) {
|
|
|
3687
3688
|
*
|
|
3688
3689
|
* @param {SQLTransaction} tx
|
|
3689
3690
|
* @param {import('./IDBObjectStore.js').IDBObjectStoreFull} store
|
|
3690
|
-
* @param {
|
|
3691
|
+
* @param {Key} key
|
|
3691
3692
|
* @param {(num?: Integer) => void} successCb
|
|
3692
3693
|
* @param {SQLFailureCallback} sqlFailCb
|
|
3693
3694
|
* @returns {void}
|
|
@@ -5297,8 +5298,8 @@ var c = function () {
|
|
|
5297
5298
|
p = [],
|
|
5298
5299
|
d = [],
|
|
5299
5300
|
v = !("cyclic" in u) || u.cyclic,
|
|
5300
|
-
|
|
5301
|
-
|
|
5301
|
+
m = u.encapsulateObserver,
|
|
5302
|
+
b = function finish(e) {
|
|
5302
5303
|
var t = Object.values(f);
|
|
5303
5304
|
if (u.iterateNone) return t.length ? t[0] : getJSONType(e);
|
|
5304
5305
|
if (t.length) {
|
|
@@ -5323,7 +5324,7 @@ var c = function () {
|
|
|
5323
5324
|
});
|
|
5324
5325
|
return !u.returnTypeNames && e;
|
|
5325
5326
|
},
|
|
5326
|
-
|
|
5327
|
+
h = _async(function (t, r) {
|
|
5327
5328
|
return _await(Promise.all(r.map(function (e) {
|
|
5328
5329
|
return e[1].p;
|
|
5329
5330
|
})), function (n) {
|
|
@@ -5346,11 +5347,11 @@ var c = function () {
|
|
|
5346
5347
|
}(function () {
|
|
5347
5348
|
if (s && v) return _await(d.p, function (e) {
|
|
5348
5349
|
f[y] = e;
|
|
5349
|
-
var r =
|
|
5350
|
+
var r = h(t, o);
|
|
5350
5351
|
return a = !0, r;
|
|
5351
5352
|
});
|
|
5352
5353
|
}, function (e) {
|
|
5353
|
-
return a ? e : (s ? f[y] = d : t = v ? d.p : d,
|
|
5354
|
+
return a ? e : (s ? f[y] = d : t = v ? d.p : d, h(t, o));
|
|
5354
5355
|
});
|
|
5355
5356
|
}))), function () {
|
|
5356
5357
|
return t;
|
|
@@ -5368,13 +5369,13 @@ var c = function () {
|
|
|
5368
5369
|
});
|
|
5369
5370
|
},
|
|
5370
5371
|
O = function _encapsulate(t, r, i, c, l, d, v) {
|
|
5371
|
-
var
|
|
5372
|
-
|
|
5372
|
+
var b,
|
|
5373
|
+
h = {},
|
|
5373
5374
|
O = _typeof(r),
|
|
5374
|
-
_ =
|
|
5375
|
+
_ = m ? function (n) {
|
|
5375
5376
|
var a,
|
|
5376
5377
|
o = null !== (a = null != v ? v : c.type) && void 0 !== a ? a : getJSONType(r);
|
|
5377
|
-
|
|
5378
|
+
m(Object.assign(null != n ? n : h, {
|
|
5378
5379
|
keypath: t,
|
|
5379
5380
|
value: r,
|
|
5380
5381
|
cyclic: i,
|
|
@@ -5386,9 +5387,9 @@ var c = function () {
|
|
|
5386
5387
|
type: o
|
|
5387
5388
|
}));
|
|
5388
5389
|
} : null;
|
|
5389
|
-
if (["string", "boolean", "number", "undefined"].includes(O)) return void 0 === r || Number.isNaN(r) || r === Number.NEGATIVE_INFINITY || r === Number.POSITIVE_INFINITY || 0 === r ? (
|
|
5390
|
-
replaced:
|
|
5391
|
-
}) :
|
|
5390
|
+
if (["string", "boolean", "number", "undefined"].includes(O)) return void 0 === r || Number.isNaN(r) || r === Number.NEGATIVE_INFINITY || r === Number.POSITIVE_INFINITY || 0 === r ? (b = c.replaced ? r : w(t, r, c, l, !1, d, _)) !== r && (h = {
|
|
5391
|
+
replaced: b
|
|
5392
|
+
}) : b = r, _ && _(), b;
|
|
5392
5393
|
if (null === r) return _ && _(), r;
|
|
5393
5394
|
if (i && !c.iterateIn && !c.iterateUnsetNumeric && r && "object" === _typeof(r)) {
|
|
5394
5395
|
var A = y.indexOf(r);
|
|
@@ -5402,14 +5403,14 @@ var c = function () {
|
|
|
5402
5403
|
T = isPlainObject(r),
|
|
5403
5404
|
I = o(r),
|
|
5404
5405
|
N = (T || I) && (!s.plainObjectReplacers.length || c.replaced) || c.iterateIn ? r : w(t, r, c, l, T || I, null, _);
|
|
5405
|
-
if (N !== r ? (
|
|
5406
|
+
if (N !== r ? (b = N, h = {
|
|
5406
5407
|
replaced: N
|
|
5407
|
-
}) : "" === t && hasConstructorOf(r, e) ? (l.push([t, r, i, c, void 0, void 0, c.type]),
|
|
5408
|
+
}) : "" === t && hasConstructorOf(r, e) ? (l.push([t, r, i, c, void 0, void 0, c.type]), b = r) : I && "object" !== c.iterateIn || "array" === c.iterateIn ? (S = new Array(r.length), h = {
|
|
5408
5409
|
clone: S
|
|
5409
|
-
}) : (["function", "symbol"].includes(_typeof(r)) || "toJSON" in r || hasConstructorOf(r, e) || hasConstructorOf(r, Promise) || hasConstructorOf(r, ArrayBuffer)) && !T && "object" !== c.iterateIn ?
|
|
5410
|
+
}) : (["function", "symbol"].includes(_typeof(r)) || "toJSON" in r || hasConstructorOf(r, e) || hasConstructorOf(r, Promise) || hasConstructorOf(r, ArrayBuffer)) && !T && "object" !== c.iterateIn ? b = r : (S = {}, c.addLength && (S.length = r.length), h = {
|
|
5410
5411
|
clone: S
|
|
5411
|
-
}), _ && _(), u.iterateNone) return null !== (j = S) && void 0 !== j ? j :
|
|
5412
|
-
if (!S) return
|
|
5412
|
+
}), _ && _(), u.iterateNone) return null !== (j = S) && void 0 !== j ? j : b;
|
|
5413
|
+
if (!S) return b;
|
|
5413
5414
|
if (c.iterateIn) {
|
|
5414
5415
|
var P = function _loop(n) {
|
|
5415
5416
|
var o = {
|
|
@@ -5475,12 +5476,12 @@ var c = function () {
|
|
|
5475
5476
|
i && i({
|
|
5476
5477
|
replacing: !0
|
|
5477
5478
|
});
|
|
5478
|
-
var
|
|
5479
|
+
var m = void 0;
|
|
5479
5480
|
if (l || !y.replaceAsync) {
|
|
5480
5481
|
if (void 0 === y.replace) throw new TypeError("Missing replacer");
|
|
5481
|
-
|
|
5482
|
-
} else
|
|
5483
|
-
return O(e,
|
|
5482
|
+
m = y.replace(t, r);
|
|
5483
|
+
} else m = y.replaceAsync(t, r);
|
|
5484
|
+
return O(e, m, v && "readonly", r, n, o, p);
|
|
5484
5485
|
}
|
|
5485
5486
|
}
|
|
5486
5487
|
return t;
|
|
@@ -5488,9 +5489,9 @@ var c = function () {
|
|
|
5488
5489
|
_ = O("", t, v, null != r ? r : {}, d);
|
|
5489
5490
|
if (d.length) return l && u.throwOnBadSyncType ? function () {
|
|
5490
5491
|
throw new TypeError("Sync method requested but async result obtained");
|
|
5491
|
-
}() : Promise.resolve(
|
|
5492
|
+
}() : Promise.resolve(h(_, d)).then(b);
|
|
5492
5493
|
if (!l && u.throwOnBadSyncType) throw new TypeError("Async method requested but sync result obtained");
|
|
5493
|
-
return u.stringification && l ? [
|
|
5494
|
+
return u.stringification && l ? [b(_)] : l ? b(_) : Promise.resolve(b(_));
|
|
5494
5495
|
}
|
|
5495
5496
|
}, {
|
|
5496
5497
|
key: "encapsulateSync",
|
|
@@ -5545,7 +5546,7 @@ var c = function () {
|
|
|
5545
5546
|
return hasConstructorOf(e, s) ? void 0 : e;
|
|
5546
5547
|
}
|
|
5547
5548
|
var v,
|
|
5548
|
-
|
|
5549
|
+
m = function revivePlainObjects() {
|
|
5549
5550
|
var r = [];
|
|
5550
5551
|
if (!u) throw new Error("Found bad `types`");
|
|
5551
5552
|
if (Object.entries(u).forEach(function (e) {
|
|
@@ -5577,29 +5578,29 @@ var c = function () {
|
|
|
5577
5578
|
c === i && (t = c);
|
|
5578
5579
|
}, void 0);
|
|
5579
5580
|
}();
|
|
5580
|
-
return hasConstructorOf(
|
|
5581
|
+
return hasConstructorOf(m, e) ? v = m.then(function () {
|
|
5581
5582
|
return t;
|
|
5582
5583
|
}) : (v = function _revive(t, r, a, i, c) {
|
|
5583
5584
|
if (!y || "$types" !== t) {
|
|
5584
5585
|
var f = u[t],
|
|
5585
5586
|
v = o(r);
|
|
5586
5587
|
if (v || isPlainObject(r)) {
|
|
5587
|
-
var
|
|
5588
|
+
var m = v ? new Array(r.length) : {};
|
|
5588
5589
|
for (n(r).forEach(function (n) {
|
|
5589
|
-
var o = _revive(t + (t ? "." : "") + escapeKeyPathComponent(n), r[n], null != a ? a :
|
|
5590
|
+
var o = _revive(t + (t ? "." : "") + escapeKeyPathComponent(n), r[n], null != a ? a : m, m, n),
|
|
5590
5591
|
i = function set(e) {
|
|
5591
|
-
return hasConstructorOf(e, s) ?
|
|
5592
|
+
return hasConstructorOf(e, s) ? m[n] = void 0 : void 0 !== e && (m[n] = e), e;
|
|
5592
5593
|
};
|
|
5593
5594
|
hasConstructorOf(o, e) ? d.push(o.then(function (e) {
|
|
5594
5595
|
return i(e);
|
|
5595
5596
|
})) : i(o);
|
|
5596
|
-
}), r =
|
|
5597
|
-
var
|
|
5598
|
-
|
|
5599
|
-
g =
|
|
5600
|
-
O =
|
|
5601
|
-
w =
|
|
5602
|
-
_ = getByKeyPath(
|
|
5597
|
+
}), r = m; l.length;) {
|
|
5598
|
+
var b = _slicedToArray(l[0], 4),
|
|
5599
|
+
h = b[0],
|
|
5600
|
+
g = b[1],
|
|
5601
|
+
O = b[2],
|
|
5602
|
+
w = b[3],
|
|
5603
|
+
_ = getByKeyPath(h, g);
|
|
5603
5604
|
if (void 0 === _) break;
|
|
5604
5605
|
O[w] = _, l.splice(0, 1);
|
|
5605
5606
|
}
|
|
@@ -5751,14 +5752,14 @@ const v = {
|
|
|
5751
5752
|
}
|
|
5752
5753
|
}
|
|
5753
5754
|
},
|
|
5754
|
-
|
|
5755
|
+
m = {
|
|
5755
5756
|
bigintObject: {
|
|
5756
5757
|
test: e => "object" == typeof e && hasConstructorOf(e, BigInt),
|
|
5757
5758
|
replace: String,
|
|
5758
5759
|
revive: e => new Object(BigInt(e))
|
|
5759
5760
|
}
|
|
5760
5761
|
},
|
|
5761
|
-
|
|
5762
|
+
b = {
|
|
5762
5763
|
bigint: {
|
|
5763
5764
|
test: e => "bigint" == typeof e,
|
|
5764
5765
|
replace: String,
|
|
@@ -5773,7 +5774,7 @@ function string2arraybuffer(e) {
|
|
|
5773
5774
|
for (let r = 0; r < e.length; r++) t[r] = e.charCodeAt(r);
|
|
5774
5775
|
return t.buffer;
|
|
5775
5776
|
}
|
|
5776
|
-
const
|
|
5777
|
+
const h = {
|
|
5777
5778
|
blob: {
|
|
5778
5779
|
test: e => "Blob" === toStringTag(e),
|
|
5779
5780
|
replace(e) {
|
|
@@ -6196,7 +6197,7 @@ const E = {
|
|
|
6196
6197
|
revive: e => new Number(e)
|
|
6197
6198
|
}
|
|
6198
6199
|
},
|
|
6199
|
-
|
|
6200
|
+
Y = {
|
|
6200
6201
|
regexp: {
|
|
6201
6202
|
test: e => "RegExp" === toStringTag(e),
|
|
6202
6203
|
replace: e => ({
|
|
@@ -6209,26 +6210,26 @@ const E = {
|
|
|
6209
6210
|
}) => new RegExp(e, t)
|
|
6210
6211
|
}
|
|
6211
6212
|
},
|
|
6212
|
-
|
|
6213
|
+
H = {
|
|
6213
6214
|
set: {
|
|
6214
6215
|
test: e => "Set" === toStringTag(e),
|
|
6215
6216
|
replace: e => [...e.values()],
|
|
6216
6217
|
revive: e => new Set(e)
|
|
6217
6218
|
}
|
|
6218
6219
|
},
|
|
6219
|
-
|
|
6220
|
+
Q = {};
|
|
6220
6221
|
"function" == typeof Int8Array && [Int8Array, Uint8Array, Uint8ClampedArray, Int16Array, Uint16Array, Int32Array, Uint32Array, Float32Array, Float64Array, ...("function" == typeof BigInt64Array ? [BigInt64Array, BigUint64Array] : [])].forEach(e => function create$1(e) {
|
|
6221
6222
|
const t = e.name;
|
|
6222
|
-
|
|
6223
|
+
Q[t.toLowerCase()] = {
|
|
6223
6224
|
test: e => toStringTag(e) === t,
|
|
6224
6225
|
replace: e => (0 === e.byteOffset && e.byteLength === e.buffer.byteLength ? e : e.slice(0)).buffer,
|
|
6225
6226
|
revive: t => "ArrayBuffer" === toStringTag(t) ? new e(t) : t
|
|
6226
6227
|
};
|
|
6227
6228
|
}(e));
|
|
6228
|
-
const
|
|
6229
|
+
const X = {};
|
|
6229
6230
|
"function" == typeof Int8Array && [Int8Array, Uint8Array, Uint8ClampedArray, Int16Array, Uint16Array, Int32Array, Uint32Array, Float32Array, Float64Array, ...("function" == typeof BigInt64Array ? [BigInt64Array, BigUint64Array] : [])].forEach(e => function create(e) {
|
|
6230
6231
|
const t = e.name;
|
|
6231
|
-
|
|
6232
|
+
X[t.toLowerCase()] = {
|
|
6232
6233
|
test: e => toStringTag(e) === t,
|
|
6233
6234
|
replace({
|
|
6234
6235
|
buffer: e,
|
|
@@ -6264,14 +6265,14 @@ const z = {};
|
|
|
6264
6265
|
}
|
|
6265
6266
|
};
|
|
6266
6267
|
}(e));
|
|
6267
|
-
const
|
|
6268
|
+
const Z = {
|
|
6268
6269
|
undef: {
|
|
6269
6270
|
test: (e, t) => void 0 === e && (t.ownKeys || !("ownKeys" in t)),
|
|
6270
6271
|
replace: () => 0,
|
|
6271
6272
|
revive: () => new s()
|
|
6272
6273
|
}
|
|
6273
6274
|
},
|
|
6274
|
-
|
|
6275
|
+
ee = {
|
|
6275
6276
|
userObject: {
|
|
6276
6277
|
test: e => isUserObject(e),
|
|
6277
6278
|
replace: e => ({
|
|
@@ -6280,7 +6281,7 @@ const Q = {
|
|
|
6280
6281
|
revive: e => e
|
|
6281
6282
|
}
|
|
6282
6283
|
},
|
|
6283
|
-
|
|
6284
|
+
te = [{
|
|
6284
6285
|
arrayNonindexKeys: {
|
|
6285
6286
|
testPlainObjects: !0,
|
|
6286
6287
|
test: (e, t) => !!Array.isArray(e) && (Object.keys(e).some(e => String(Number.parseInt(e)) !== e) && (t.iterateIn = "object", t.addLength = !0), !0),
|
|
@@ -6300,9 +6301,9 @@ const Q = {
|
|
|
6300
6301
|
revive() {}
|
|
6301
6302
|
}
|
|
6302
6303
|
}],
|
|
6303
|
-
|
|
6304
|
-
|
|
6305
|
-
|
|
6304
|
+
re = [K, U, F, $],
|
|
6305
|
+
ce = [ee, Z, te, V, re, A, Y, k, B, E, C, h, P, x].concat("function" == typeof Map ? D : [], "function" == typeof Set ? H : [], "function" == typeof ArrayBuffer ? v : [], "function" == typeof Uint8Array ? X : [], "function" == typeof DataView ? _ : [], "undefined" != typeof crypto ? w : [], "undefined" != typeof BigInt ? [b, m] : [], "undefined" != typeof DOMException ? S : [], "undefined" != typeof DOMRect ? N : [], "undefined" != typeof DOMPoint ? T : [], "undefined" != typeof DOMQuad ? I : [], "undefined" != typeof DOMMatrix ? j : []),
|
|
6306
|
+
se = ce.concat({
|
|
6306
6307
|
checkDataCloneException: {
|
|
6307
6308
|
test(e) {
|
|
6308
6309
|
const t = {}.toString.call(e).slice(8, -1);
|
|
@@ -6314,7 +6315,7 @@ const Q = {
|
|
|
6314
6315
|
|
|
6315
6316
|
// See: http://stackoverflow.com/questions/42170826/categories-for-rejection-by-the-structured-cloning-algorithm
|
|
6316
6317
|
|
|
6317
|
-
let typeson = new c().register(
|
|
6318
|
+
let typeson = new c().register(se);
|
|
6318
6319
|
|
|
6319
6320
|
/**
|
|
6320
6321
|
* @param {(preset: import('typeson-registry').Preset) =>
|
|
@@ -6322,7 +6323,7 @@ let typeson = new c().register(ie);
|
|
|
6322
6323
|
* @returns {void}
|
|
6323
6324
|
*/
|
|
6324
6325
|
function register(func) {
|
|
6325
|
-
typeson = new c().register(func(
|
|
6326
|
+
typeson = new c().register(func(se));
|
|
6326
6327
|
}
|
|
6327
6328
|
|
|
6328
6329
|
/**
|
|
@@ -6778,6 +6779,7 @@ IDBIndex.__deleteIndex = function (store, index) {
|
|
|
6778
6779
|
IDBIndex.__updateIndexList = function (store, tx, success, failure) {
|
|
6779
6780
|
/** @type {IndexList} **/
|
|
6780
6781
|
const indexList = {};
|
|
6782
|
+
// eslint-disable-next-line sonarjs/prefer-for-of -- Implement iterability?
|
|
6781
6783
|
for (let i = 0; i < store.indexNames.length; i++) {
|
|
6782
6784
|
const idx = store.__indexes[store.indexNames[i]];
|
|
6783
6785
|
indexList[idx.name] = {
|
|
@@ -7649,7 +7651,6 @@ IDBObjectStore.prototype.__deriveKey = function (tx, value, key, success, failCb
|
|
|
7649
7651
|
if (me.autoIncrement) {
|
|
7650
7652
|
// If auto-increment and no valid primaryKey found on the keyPath, get and set the new value, and use
|
|
7651
7653
|
if (key === undefined) {
|
|
7652
|
-
// @ts-expect-error Due to re-exporting `Key.d.ts` file (needed for `node_modules` imports)
|
|
7653
7654
|
generateKeyForStore(tx, me, function (failure, key, oldCn) {
|
|
7654
7655
|
if (failure) {
|
|
7655
7656
|
failCb(createDOMException('ConstraintError', 'The key generator\'s current number has reached the maximum safe integer limit'));
|
|
@@ -7663,7 +7664,6 @@ IDBObjectStore.prototype.__deriveKey = function (tx, value, key, success, failCb
|
|
|
7663
7664
|
success(key, oldCn);
|
|
7664
7665
|
}, failCb);
|
|
7665
7666
|
} else {
|
|
7666
|
-
// @ts-expect-error Due to re-exporting `Key.d.ts` file (needed for `node_modules` imports)
|
|
7667
7667
|
possiblyUpdateKeyGenerator(tx, me, key, keyCloneThenSuccess, failCb);
|
|
7668
7668
|
}
|
|
7669
7669
|
// Not auto-increment
|
|
@@ -7795,6 +7795,7 @@ IDBObjectStore.prototype.__insertData = function (tx, encoded, value, clonedKeyO
|
|
|
7795
7795
|
return false;
|
|
7796
7796
|
});
|
|
7797
7797
|
return undefined;
|
|
7798
|
+
// eslint-disable-next-line sonarjs/no-invariant-returns -- Convenient
|
|
7798
7799
|
}).catch(function (err) {
|
|
7799
7800
|
/**
|
|
7800
7801
|
* @returns {void}
|
|
@@ -7805,7 +7806,6 @@ IDBObjectStore.prototype.__insertData = function (tx, encoded, value, clonedKeyO
|
|
|
7805
7806
|
error(err);
|
|
7806
7807
|
}
|
|
7807
7808
|
if (typeof oldCn === 'number') {
|
|
7808
|
-
// @ts-expect-error Due to re-exporting `Key.d.ts` file (needed for `node_modules` imports)
|
|
7809
7809
|
assignCurrentNumber(tx, me, oldCn, fail, fail);
|
|
7810
7810
|
return null;
|
|
7811
7811
|
}
|
|
@@ -8627,6 +8627,7 @@ Object.defineProperty(IDBDatabase, 'prototype', {
|
|
|
8627
8627
|
writable: false
|
|
8628
8628
|
});
|
|
8629
8629
|
|
|
8630
|
+
/* eslint-disable sonarjs/no-invariant-returns -- Convenient here */
|
|
8630
8631
|
// eslint-disable-next-line no-restricted-imports -- Can be polyfilled
|
|
8631
8632
|
|
|
8632
8633
|
/**
|
|
@@ -8699,6 +8700,7 @@ function processNextInConnectionQueue(name, origin = getOrigin()) {
|
|
|
8699
8700
|
}
|
|
8700
8701
|
req.addEventListener('success', removeFromQueue);
|
|
8701
8702
|
req.addEventListener('error', removeFromQueue);
|
|
8703
|
+
req.addEventListener('blocked', removeFromQueue);
|
|
8702
8704
|
cb(req);
|
|
8703
8705
|
}
|
|
8704
8706
|
|
|
@@ -9510,7 +9512,7 @@ IDBFactory.prototype.deleteDatabase = function (name) {
|
|
|
9510
9512
|
* @param {import('./Key.js').Key} key1
|
|
9511
9513
|
* @param {import('./Key.js').Key} key2
|
|
9512
9514
|
* @throws {TypeError}
|
|
9513
|
-
* @returns {
|
|
9515
|
+
* @returns {number}
|
|
9514
9516
|
*/
|
|
9515
9517
|
IDBFactory.prototype.cmp = function (key1, key2) {
|
|
9516
9518
|
if (!(this instanceof IDBFactory)) {
|
|
@@ -10514,7 +10516,7 @@ function setConfig(prop, val) {
|
|
|
10514
10516
|
/**
|
|
10515
10517
|
* @typedef {(
|
|
10516
10518
|
* prop: import('./CFG.js').KeyofConfigValues
|
|
10517
|
-
* ) => import('
|
|
10519
|
+
* ) => import('./CFG.js').ConfigValue} GetConfig
|
|
10518
10520
|
*/
|
|
10519
10521
|
|
|
10520
10522
|
/**
|