buzzcasting-storage 1.0.12 → 1.0.13
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/buzzcasting-storage.esm.js +72 -70
- package/package.json +1 -1
|
@@ -78,9 +78,9 @@ function Ce(t, e) {
|
|
|
78
78
|
te(t, n, e[n]);
|
|
79
79
|
});
|
|
80
80
|
}
|
|
81
|
-
const
|
|
81
|
+
const jn = Object.defineProperty;
|
|
82
82
|
function te(t, e, n, r) {
|
|
83
|
-
|
|
83
|
+
jn(t, e, z(n && H(n, "get") && typeof n.get == "function" ? { get: n.get, set: n.set, configurable: !0 } : { value: n, configurable: !0, writable: !0 }, r));
|
|
84
84
|
}
|
|
85
85
|
function Ee(t) {
|
|
86
86
|
return { from: function(e) {
|
|
@@ -566,7 +566,7 @@ From previous: `);
|
|
|
566
566
|
return new E((e, n) => {
|
|
567
567
|
t.map((r) => E.resolve(r).then(e, n));
|
|
568
568
|
});
|
|
569
|
-
}, PSD: { get: () => P, set: (t) => P = t }, totalEchoes: { get: () => mt }, newPSD: ae, usePSD:
|
|
569
|
+
}, PSD: { get: () => P, set: (t) => P = t }, totalEchoes: { get: () => mt }, newPSD: ae, usePSD: je, scheduler: { get: () => Me, set: (t) => {
|
|
570
570
|
Me = t;
|
|
571
571
|
} }, rejectionMapper: { get: () => Lt, set: (t) => {
|
|
572
572
|
Lt = t;
|
|
@@ -604,25 +604,25 @@ From previous: `);
|
|
|
604
604
|
});
|
|
605
605
|
}));
|
|
606
606
|
const $ = { awaits: 0, echoes: 0, id: 0 };
|
|
607
|
-
var
|
|
607
|
+
var Kr = 0, ct = [], kt = 0, mt = 0, jr = 0;
|
|
608
608
|
function ae(t, e, n, r) {
|
|
609
609
|
var s = P, i = Object.create(s);
|
|
610
|
-
i.parent = s, i.ref = 0, i.global = !1, i.id = ++
|
|
610
|
+
i.parent = s, i.ref = 0, i.global = !1, i.id = ++jr;
|
|
611
611
|
var o = Pe.env;
|
|
612
612
|
i.env = un ? { Promise: E, PromiseProp: { value: E, configurable: !0, writable: !0 }, all: E.all, race: E.race, allSettled: E.allSettled, any: E.any, resolve: E.resolve, reject: E.reject, nthen: vn(o.nthen, i), gthen: vn(o.gthen, i) } : {}, e && z(i, e), ++s.ref, i.finalize = function() {
|
|
613
613
|
--this.parent.ref || this.parent.finalize();
|
|
614
614
|
};
|
|
615
|
-
var a =
|
|
615
|
+
var a = je(i, t, n, r);
|
|
616
616
|
return i.ref === 0 && i.finalize(), a;
|
|
617
617
|
}
|
|
618
|
-
function
|
|
619
|
-
return $.id || ($.id = ++
|
|
618
|
+
function Ke() {
|
|
619
|
+
return $.id || ($.id = ++Kr), ++$.awaits, $.echoes += Ln, $.id;
|
|
620
620
|
}
|
|
621
621
|
function re() {
|
|
622
622
|
return !!$.awaits && (--$.awaits == 0 && ($.id = 0), $.echoes = $.awaits * Ln, !0);
|
|
623
623
|
}
|
|
624
624
|
function qe(t) {
|
|
625
|
-
return $.echoes && t && t.constructor === it ? (
|
|
625
|
+
return $.echoes && t && t.constructor === it ? (Ke(), t.then((e) => (re(), e), (e) => (re(), F(e)))) : t;
|
|
626
626
|
}
|
|
627
627
|
function Ar(t) {
|
|
628
628
|
++mt, $.echoes && --$.echoes != 0 || ($.echoes = $.id = 0), ct.push(P), ce(t, !0);
|
|
@@ -642,7 +642,7 @@ function Yn() {
|
|
|
642
642
|
var t = D.Promise;
|
|
643
643
|
return un ? { Promise: t, PromiseProp: Object.getOwnPropertyDescriptor(D, "Promise"), all: t.all, race: t.race, allSettled: t.allSettled, any: t.any, resolve: t.resolve, reject: t.reject, nthen: ft.then, gthen: t.prototype.then } : {};
|
|
644
644
|
}
|
|
645
|
-
function
|
|
645
|
+
function je(t, e, n, r, s) {
|
|
646
646
|
var i = P;
|
|
647
647
|
try {
|
|
648
648
|
return ce(t, !0), e(n, r, s);
|
|
@@ -656,7 +656,7 @@ function Qn(t) {
|
|
|
656
656
|
function yt(t, e, n, r) {
|
|
657
657
|
return typeof t != "function" ? t : function() {
|
|
658
658
|
var s = P;
|
|
659
|
-
n &&
|
|
659
|
+
n && Ke(), ce(e, !0);
|
|
660
660
|
try {
|
|
661
661
|
return t.apply(this, arguments);
|
|
662
662
|
} finally {
|
|
@@ -669,7 +669,7 @@ function vn(t, e) {
|
|
|
669
669
|
return t.call(this, yt(n, e), yt(r, e));
|
|
670
670
|
};
|
|
671
671
|
}
|
|
672
|
-
("" + Un).indexOf("[native code]") === -1 && (
|
|
672
|
+
("" + Un).indexOf("[native code]") === -1 && (Ke = re = A);
|
|
673
673
|
const wn = "unhandledrejection";
|
|
674
674
|
function _n(t, e) {
|
|
675
675
|
var n;
|
|
@@ -1265,15 +1265,15 @@ class Mr {
|
|
|
1265
1265
|
return a.getMany({ trans: r, keys: y.slice(m, m + f), cache: "immutable" }).then((w) => {
|
|
1266
1266
|
const S = [], O = [], x = c ? [] : null, v = [];
|
|
1267
1267
|
for (let _ = 0; _ < f; ++_) {
|
|
1268
|
-
const T = w[_],
|
|
1269
|
-
s.call(
|
|
1268
|
+
const T = w[_], j = { value: He(T), primKey: y[m + _] };
|
|
1269
|
+
s.call(j, j.value, j) !== !1 && (j.value == null ? v.push(y[m + _]) : c || W(l(T), l(j.value)) === 0 ? (O.push(j.value), c && x.push(y[m + _])) : (v.push(y[m + _]), S.push(j.value)));
|
|
1270
1270
|
}
|
|
1271
|
-
const
|
|
1271
|
+
const K = ke(n) && n.limit === 1 / 0 && (typeof e != "function" || e === Pt) && { index: n.index, range: n.range };
|
|
1272
1272
|
return Promise.resolve(S.length > 0 && a.mutate({ trans: r, type: "add", values: S }).then((_) => {
|
|
1273
1273
|
for (let T in _.failures)
|
|
1274
1274
|
v.splice(parseInt(T), 1);
|
|
1275
1275
|
g(S.length, _);
|
|
1276
|
-
})).then(() => (O.length > 0 ||
|
|
1276
|
+
})).then(() => (O.length > 0 || K && typeof e == "object") && a.mutate({ trans: r, type: "put", keys: x, values: O, criteria: K, changeSpec: typeof e != "function" && e }).then((_) => g(O.length, _))).then(() => (v.length > 0 || K && e === Pt) && a.mutate({ trans: r, type: "delete", keys: v, criteria: K }).then((_) => g(v.length, _))).then(() => y.length > m + f && b(m + u));
|
|
1277
1277
|
});
|
|
1278
1278
|
};
|
|
1279
1279
|
return b(0).then(() => {
|
|
@@ -1518,7 +1518,7 @@ class $r {
|
|
|
1518
1518
|
for (P.global || (P.lockOwnerFor = null); this._blockedFuncs.length > 0 && !this._locked(); ) {
|
|
1519
1519
|
var e = this._blockedFuncs.shift();
|
|
1520
1520
|
try {
|
|
1521
|
-
|
|
1521
|
+
je(e[1], e[0]);
|
|
1522
1522
|
} catch {
|
|
1523
1523
|
}
|
|
1524
1524
|
}
|
|
@@ -1675,14 +1675,14 @@ function Ur(t, e, n) {
|
|
|
1675
1675
|
if (O === 0)
|
|
1676
1676
|
return b({ numFailures: 0, failures: {}, results: [], lastResult: void 0 });
|
|
1677
1677
|
let x;
|
|
1678
|
-
const v = [],
|
|
1678
|
+
const v = [], K = [];
|
|
1679
1679
|
let _ = 0;
|
|
1680
1680
|
const T = (U) => {
|
|
1681
1681
|
++_, We(U);
|
|
1682
1682
|
};
|
|
1683
1683
|
if (h === "deleteRange") {
|
|
1684
1684
|
if (y.type === 4)
|
|
1685
|
-
return b({ numFailures: _, failures:
|
|
1685
|
+
return b({ numFailures: _, failures: K, results: [], lastResult: void 0 });
|
|
1686
1686
|
y.type === 3 ? v.push(x = f.clear()) : v.push(x = f.delete(r(y)));
|
|
1687
1687
|
} else {
|
|
1688
1688
|
const [U, N] = S ? w ? [g, p] : [g, null] : [p, null];
|
|
@@ -1693,21 +1693,21 @@ function Ur(t, e, n) {
|
|
|
1693
1693
|
for (let M = 0; M < O; ++M)
|
|
1694
1694
|
v.push(x = f[h](U[M])), x.onerror = T;
|
|
1695
1695
|
}
|
|
1696
|
-
const
|
|
1696
|
+
const j = (U) => {
|
|
1697
1697
|
const N = U.target.result;
|
|
1698
|
-
v.forEach((M, we) => M.error != null && (
|
|
1698
|
+
v.forEach((M, we) => M.error != null && (K[we] = M.error)), b({ numFailures: _, failures: K, results: h === "delete" ? p : v.map((M) => M.result), lastResult: N });
|
|
1699
1699
|
};
|
|
1700
1700
|
x.onerror = (U) => {
|
|
1701
|
-
T(U),
|
|
1702
|
-
}, x.onsuccess =
|
|
1701
|
+
T(U), j(U);
|
|
1702
|
+
}, x.onsuccess = j;
|
|
1703
1703
|
});
|
|
1704
1704
|
}, getMany: ({ trans: d, keys: h }) => new Promise((p, g) => {
|
|
1705
1705
|
p = I(p);
|
|
1706
1706
|
const y = d.objectStore(u), b = h.length, m = new Array(b);
|
|
1707
1707
|
let f, w = 0, S = 0;
|
|
1708
1708
|
const O = (v) => {
|
|
1709
|
-
const
|
|
1710
|
-
m[
|
|
1709
|
+
const K = v.target;
|
|
1710
|
+
m[K._pos] = K.result, ++S === w && p(m);
|
|
1711
1711
|
}, x = Q(g);
|
|
1712
1712
|
for (let v = 0; v < b; ++v)
|
|
1713
1713
|
h[v] != null && (f = y.get(h[v]), f._pos = v, f.onsuccess = O, f.onerror = x, ++w);
|
|
@@ -1719,18 +1719,18 @@ function Ur(t, e, n) {
|
|
|
1719
1719
|
}), query: /* @__PURE__ */ function(d) {
|
|
1720
1720
|
return (h) => new Promise((p, g) => {
|
|
1721
1721
|
p = I(p);
|
|
1722
|
-
const { trans: y, values: b, limit: m, query: f } = h, w = m === 1 / 0 ? void 0 : m, { index: S, range: O } = f, x = y.objectStore(u), v = S.isPrimaryKey ? x : x.index(S.name),
|
|
1722
|
+
const { trans: y, values: b, limit: m, query: f } = h, w = m === 1 / 0 ? void 0 : m, { index: S, range: O } = f, x = y.objectStore(u), v = S.isPrimaryKey ? x : x.index(S.name), K = r(O);
|
|
1723
1723
|
if (m === 0)
|
|
1724
1724
|
return p({ result: [] });
|
|
1725
1725
|
if (d) {
|
|
1726
|
-
const _ = b ? v.getAll(
|
|
1726
|
+
const _ = b ? v.getAll(K, w) : v.getAllKeys(K, w);
|
|
1727
1727
|
_.onsuccess = (T) => p({ result: T.target.result }), _.onerror = Q(g);
|
|
1728
1728
|
} else {
|
|
1729
1729
|
let _ = 0;
|
|
1730
|
-
const T = b || !("openKeyCursor" in v) ? v.openCursor(
|
|
1730
|
+
const T = b || !("openKeyCursor" in v) ? v.openCursor(K) : v.openKeyCursor(K), j = [];
|
|
1731
1731
|
T.onsuccess = (U) => {
|
|
1732
1732
|
const N = T.result;
|
|
1733
|
-
return N ? (
|
|
1733
|
+
return N ? (j.push(b ? N.value : N.primaryKey), ++_ === m ? p({ result: j }) : void N.continue()) : p({ result: j });
|
|
1734
1734
|
}, T.onerror = Q(g);
|
|
1735
1735
|
}
|
|
1736
1736
|
});
|
|
@@ -1738,14 +1738,14 @@ function Ur(t, e, n) {
|
|
|
1738
1738
|
return new Promise((b, m) => {
|
|
1739
1739
|
b = I(b);
|
|
1740
1740
|
const { index: f, range: w } = p, S = d.objectStore(u), O = f.isPrimaryKey ? S : S.index(f.name), x = g ? y ? "prevunique" : "prev" : y ? "nextunique" : "next", v = h || !("openKeyCursor" in O) ? O.openCursor(r(w), x) : O.openKeyCursor(r(w), x);
|
|
1741
|
-
v.onerror = Q(m), v.onsuccess = I((
|
|
1741
|
+
v.onerror = Q(m), v.onsuccess = I((K) => {
|
|
1742
1742
|
const _ = v.result;
|
|
1743
1743
|
if (!_)
|
|
1744
1744
|
return void b(null);
|
|
1745
1745
|
_.___id = ++Lr, _.done = !1;
|
|
1746
1746
|
const T = _.continue.bind(_);
|
|
1747
|
-
let
|
|
1748
|
-
|
|
1747
|
+
let j = _.continuePrimaryKey;
|
|
1748
|
+
j && (j = j.bind(_));
|
|
1749
1749
|
const U = _.advance.bind(_), N = () => {
|
|
1750
1750
|
throw new Error("Cursor not stopped");
|
|
1751
1751
|
};
|
|
@@ -1773,7 +1773,7 @@ function Ur(t, e, n) {
|
|
|
1773
1773
|
};
|
|
1774
1774
|
return v.onsuccess = I((V) => {
|
|
1775
1775
|
v.onsuccess = _e, _e();
|
|
1776
|
-
}), _.continue = T, _.continuePrimaryKey =
|
|
1776
|
+
}), _.continue = T, _.continuePrimaryKey = j, _.advance = U, _e(), we;
|
|
1777
1777
|
}, b(_);
|
|
1778
1778
|
}, m);
|
|
1779
1779
|
});
|
|
@@ -1810,7 +1810,7 @@ function gt({ _novip: t }, e, n, r) {
|
|
|
1810
1810
|
(!a || "value" in a && a.value === void 0) && (o === t.Transaction.prototype || o instanceof t.Transaction ? te(o, s, { get() {
|
|
1811
1811
|
return this.table(s);
|
|
1812
1812
|
}, set(c) {
|
|
1813
|
-
|
|
1813
|
+
jn(this, s, { value: c, writable: !0, configurable: !0, enumerable: !0 });
|
|
1814
1814
|
} }) : o[s] = new t.Table(s, i));
|
|
1815
1815
|
});
|
|
1816
1816
|
});
|
|
@@ -1849,26 +1849,26 @@ function zr(t, e, n, r) {
|
|
|
1849
1849
|
if (v.recreate)
|
|
1850
1850
|
throw new C.Upgrade("Not yet support for changing primary key");
|
|
1851
1851
|
{
|
|
1852
|
-
const
|
|
1853
|
-
v.add.forEach((_) => Jt(
|
|
1854
|
-
|
|
1855
|
-
}), v.del.forEach((_) =>
|
|
1852
|
+
const K = d.objectStore(v.name);
|
|
1853
|
+
v.add.forEach((_) => Jt(K, _)), v.change.forEach((_) => {
|
|
1854
|
+
K.deleteIndex(_.name), Jt(K, _);
|
|
1855
|
+
}), v.del.forEach((_) => K.deleteIndex(_));
|
|
1856
1856
|
}
|
|
1857
1857
|
});
|
|
1858
1858
|
const x = f._cfg.contentUpgrade;
|
|
1859
1859
|
if (x && f._cfg.version > l) {
|
|
1860
1860
|
Yt(c, d), u._memoizedTables = {}, y = !0;
|
|
1861
1861
|
let v = Bn(S);
|
|
1862
|
-
O.del.forEach((
|
|
1863
|
-
v[
|
|
1862
|
+
O.del.forEach((j) => {
|
|
1863
|
+
v[j] = w[j];
|
|
1864
1864
|
}), Qt(c, [c.Transaction.prototype]), gt(c, [c.Transaction.prototype], R(v), v), u.schema = v;
|
|
1865
|
-
const
|
|
1865
|
+
const K = on(x);
|
|
1866
1866
|
let _;
|
|
1867
|
-
|
|
1867
|
+
K && Ke();
|
|
1868
1868
|
const T = E.follow(() => {
|
|
1869
|
-
if (_ = x(u), _ &&
|
|
1870
|
-
var
|
|
1871
|
-
_.then(
|
|
1869
|
+
if (_ = x(u), _ && K) {
|
|
1870
|
+
var j = re.bind(null, null);
|
|
1871
|
+
_.then(j, j);
|
|
1872
1872
|
}
|
|
1873
1873
|
});
|
|
1874
1874
|
return _ && typeof _.then == "function" ? E.resolve(_) : T.then(() => _);
|
|
@@ -2110,7 +2110,7 @@ function sr(t, e, n, r, s) {
|
|
|
2110
2110
|
}
|
|
2111
2111
|
const c = on(s);
|
|
2112
2112
|
let l;
|
|
2113
|
-
c &&
|
|
2113
|
+
c && Ke();
|
|
2114
2114
|
const u = E.follow(() => {
|
|
2115
2115
|
if (l = s.call(o, o), l)
|
|
2116
2116
|
if (c) {
|
|
@@ -2222,8 +2222,8 @@ const Jr = { stack: "dbcore", name: "HooksMiddleware", level: 2, create: (t) =>
|
|
|
2222
2222
|
const O = mn(w, h.values[f]), x = l.fire.call(S, O, m, w, p);
|
|
2223
2223
|
if (x) {
|
|
2224
2224
|
const v = h.values[f];
|
|
2225
|
-
Object.keys(x).forEach((
|
|
2226
|
-
H(v,
|
|
2225
|
+
Object.keys(x).forEach((K) => {
|
|
2226
|
+
H(v, K) ? v[K] = x[K] : Y(v, K, x[K]);
|
|
2227
2227
|
});
|
|
2228
2228
|
}
|
|
2229
2229
|
}
|
|
@@ -2343,11 +2343,11 @@ function Cn(t) {
|
|
|
2343
2343
|
const r = (((e = t.r) === null || e === void 0 ? void 0 : e.d) || 0) - (((n = t.l) === null || n === void 0 ? void 0 : n.d) || 0), s = r > 1 ? "r" : r < -1 ? "l" : "";
|
|
2344
2344
|
if (s) {
|
|
2345
2345
|
const i = s === "r" ? "l" : "r", o = { ...t }, a = t[s];
|
|
2346
|
-
t.from = a.from, t.to = a.to, t[s] = a[s], o[s] = a[i], t[i] = o, o.d =
|
|
2346
|
+
t.from = a.from, t.to = a.to, t[s] = a[s], o[s] = a[i], t[i] = o, o.d = Kn(o);
|
|
2347
2347
|
}
|
|
2348
|
-
t.d =
|
|
2348
|
+
t.d = Kn(t);
|
|
2349
2349
|
}
|
|
2350
|
-
function
|
|
2350
|
+
function Kn({ r: t, l: e }) {
|
|
2351
2351
|
return (t ? e ? Math.max(t.d, e.d) : t.d : e ? e.d : 0) + 1;
|
|
2352
2352
|
}
|
|
2353
2353
|
Ce(Z.prototype, { add(t) {
|
|
@@ -2373,15 +2373,15 @@ const qr = { stack: "dbcore", level: 0, create: (t) => {
|
|
|
2373
2373
|
if (L(w)) {
|
|
2374
2374
|
f !== "delete" && (w = x.results), b.addKeys(w);
|
|
2375
2375
|
const v = ir(w, O);
|
|
2376
|
-
v || f === "add" || m.addKeys(w), (v || S) && function(
|
|
2376
|
+
v || f === "add" || m.addKeys(w), (v || S) && function(K, _, T, j) {
|
|
2377
2377
|
function U(N) {
|
|
2378
|
-
const M =
|
|
2378
|
+
const M = K(N.name || "");
|
|
2379
2379
|
function we(V) {
|
|
2380
2380
|
return V != null ? N.extractKey(V) : null;
|
|
2381
2381
|
}
|
|
2382
2382
|
const _e = (V) => N.multiEntry && L(V) ? V.forEach((ue) => M.addKey(ue)) : M.addKey(V);
|
|
2383
|
-
(T ||
|
|
2384
|
-
const Ae = T && we(T[ue]), _t =
|
|
2383
|
+
(T || j).forEach((V, ue) => {
|
|
2384
|
+
const Ae = T && we(T[ue]), _t = j && we(j[ue]);
|
|
2385
2385
|
W(Ae, _t) !== 0 && (Ae != null && _e(Ae), _t != null && _e(_t));
|
|
2386
2386
|
});
|
|
2387
2387
|
}
|
|
@@ -2418,8 +2418,8 @@ const qr = { stack: "dbcore", level: 0, create: (t) => {
|
|
|
2418
2418
|
} else if (h === "openCursor") {
|
|
2419
2419
|
const x = O, v = p.values;
|
|
2420
2420
|
return x && Object.create(x, { key: { get: () => (m.addKey(x.primaryKey), x.key) }, primaryKey: { get() {
|
|
2421
|
-
const
|
|
2422
|
-
return m.addKey(
|
|
2421
|
+
const K = x.primaryKey;
|
|
2422
|
+
return m.addKey(K), K;
|
|
2423
2423
|
} }, value: { get: () => (v && b.addKey(x.primaryKey), x.value) } });
|
|
2424
2424
|
}
|
|
2425
2425
|
return O;
|
|
@@ -2639,7 +2639,7 @@ class me {
|
|
|
2639
2639
|
}) : F(l);
|
|
2640
2640
|
}
|
|
2641
2641
|
const c = sr.bind(null, this, o, a, s, r);
|
|
2642
|
-
return s ? s._promise(o, c, "lock") : P.trans ?
|
|
2642
|
+
return s ? s._promise(o, c, "lock") : P.trans ? je(P.transless, () => this._whenReady(c)) : this._whenReady(c);
|
|
2643
2643
|
}
|
|
2644
2644
|
table(e) {
|
|
2645
2645
|
if (!H(this._allTables, e))
|
|
@@ -2686,8 +2686,8 @@ function ns(t) {
|
|
|
2686
2686
|
return;
|
|
2687
2687
|
a = {};
|
|
2688
2688
|
const y = {}, b = function(m) {
|
|
2689
|
-
i &&
|
|
2690
|
-
const f = () => ae(t, { subscr: m, trans: null }), w = P.trans ?
|
|
2689
|
+
i && Ke();
|
|
2690
|
+
const f = () => ae(t, { subscr: m, trans: null }), w = P.trans ? je(P.transless, f) : f();
|
|
2691
2691
|
return i && w.then(re, re), w;
|
|
2692
2692
|
}(y);
|
|
2693
2693
|
d || (le(ze, p), d = !0), u = !0, Promise.resolve(b).then((m) => {
|
|
@@ -2725,7 +2725,7 @@ Ce(he, { ...st, delete: (t) => new he(t, { addons: [] }).delete(), exists: (t) =
|
|
|
2725
2725
|
}
|
|
2726
2726
|
}, defineClass: () => function(t) {
|
|
2727
2727
|
z(this, t);
|
|
2728
|
-
}, ignoreTransaction: (t) => P.trans ?
|
|
2728
|
+
}, ignoreTransaction: (t) => P.trans ? je(P.transless, t) : t(), vip: qt, async: function(t) {
|
|
2729
2729
|
return function() {
|
|
2730
2730
|
try {
|
|
2731
2731
|
var e = en(t.apply(this, arguments));
|
|
@@ -2918,11 +2918,11 @@ function ss(t, e) {
|
|
|
2918
2918
|
const r = gn(n);
|
|
2919
2919
|
return (s, i) => r.then((o) => i(o.transaction(e, s).objectStore(e)));
|
|
2920
2920
|
}
|
|
2921
|
-
let
|
|
2921
|
+
let Kt;
|
|
2922
2922
|
function ar() {
|
|
2923
|
-
return
|
|
2923
|
+
return Kt || (Kt = ss("keyval-store", "keyval")), Kt;
|
|
2924
2924
|
}
|
|
2925
|
-
function
|
|
2925
|
+
function jt(t, e = ar()) {
|
|
2926
2926
|
return e("readonly", (n) => gn(n.get(t)));
|
|
2927
2927
|
}
|
|
2928
2928
|
function At(t, e, n = ar()) {
|
|
@@ -2938,7 +2938,7 @@ class is {
|
|
|
2938
2938
|
});
|
|
2939
2939
|
k(this, "getCloud", async (e) => {
|
|
2940
2940
|
const n = B(e);
|
|
2941
|
-
return await
|
|
2941
|
+
return await jt(n);
|
|
2942
2942
|
});
|
|
2943
2943
|
k(this, "setSeries", async (e, n) => {
|
|
2944
2944
|
const r = B(e);
|
|
@@ -2946,7 +2946,7 @@ class is {
|
|
|
2946
2946
|
});
|
|
2947
2947
|
k(this, "getSeries", async (e) => {
|
|
2948
2948
|
const n = B(e);
|
|
2949
|
-
return await
|
|
2949
|
+
return await jt(n);
|
|
2950
2950
|
});
|
|
2951
2951
|
k(this, "setMessages", async (e, n) => {
|
|
2952
2952
|
const r = B(e);
|
|
@@ -2954,7 +2954,7 @@ class is {
|
|
|
2954
2954
|
});
|
|
2955
2955
|
k(this, "getMessages", async (e) => {
|
|
2956
2956
|
const n = B(e);
|
|
2957
|
-
return await
|
|
2957
|
+
return await jt(n);
|
|
2958
2958
|
});
|
|
2959
2959
|
k(this, "cleanMessages", async (e) => (console.log("cleanMessages not implemented for ", this.options.storage), await new Promise((n) => n())));
|
|
2960
2960
|
k(this, "subscribe", (e) => {
|
|
@@ -3116,12 +3116,14 @@ class cs {
|
|
|
3116
3116
|
k(this, "subscribers", []);
|
|
3117
3117
|
k(this, "options");
|
|
3118
3118
|
k(this, "setCloud", async (e, n) => {
|
|
3119
|
+
await null;
|
|
3119
3120
|
const r = B(e);
|
|
3120
|
-
window.BuzzCasting.WidgetData[r] = n
|
|
3121
|
+
window.BuzzCasting.WidgetData[r] = n;
|
|
3121
3122
|
});
|
|
3122
3123
|
k(this, "getCloud", async (e) => {
|
|
3123
|
-
|
|
3124
|
-
|
|
3124
|
+
await null;
|
|
3125
|
+
const n = B(e);
|
|
3126
|
+
return window.BuzzCasting.WidgetData[n];
|
|
3125
3127
|
});
|
|
3126
3128
|
k(this, "setSeries", async (e, n) => {
|
|
3127
3129
|
const r = B(e);
|