precision-dashwidgets 0.1.2 → 0.1.3
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/{duckdb-browser-Ca3YTI3y-4in0bpNm.mjs → duckdb-browser-Ca3YTI3y-BzRrOJCt.mjs} +57 -62
- package/dist/precision-dashwidgets.es.js +1569 -1551
- package/dist/precision-dashwidgets.umd.js +20 -20
- package/dist/useGetToken-BB_WoWij-DUKO7RtR.mjs +18 -0
- package/package.json +6 -7
- package/dist/useGetToken-BRN19kkn-Dzc3_tWy.mjs +0 -13
|
@@ -151,12 +151,12 @@ function* Bo(s, t) {
|
|
|
151
151
|
const e = function* (r) {
|
|
152
152
|
yield r;
|
|
153
153
|
}, n = typeof t == "string" || ArrayBuffer.isView(t) || t instanceof ArrayBuffer || t instanceof bn ? e(t) : Ve(t) ? t : e(t);
|
|
154
|
-
return yield* en(
|
|
154
|
+
return yield* en(function* (r) {
|
|
155
155
|
let i = null;
|
|
156
156
|
do
|
|
157
157
|
i = r.next(yield x(s, i));
|
|
158
158
|
while (!i.done);
|
|
159
|
-
}
|
|
159
|
+
}(n[Symbol.iterator]())), new s();
|
|
160
160
|
}
|
|
161
161
|
const No = (s) => Bo(Uint8Array, s);
|
|
162
162
|
function Ir(s, t) {
|
|
@@ -169,24 +169,24 @@ function Ir(s, t) {
|
|
|
169
169
|
});
|
|
170
170
|
}, n = function(i) {
|
|
171
171
|
return Tt(this, arguments, function* () {
|
|
172
|
-
yield E(yield* He(Qt(en(
|
|
172
|
+
yield E(yield* He(Qt(en(function* (o) {
|
|
173
173
|
let a = null;
|
|
174
174
|
do
|
|
175
|
-
a = o.next(yield a
|
|
175
|
+
a = o.next(yield a == null ? void 0 : a.value);
|
|
176
176
|
while (!a.done);
|
|
177
|
-
}
|
|
177
|
+
}(i[Symbol.iterator]())))));
|
|
178
178
|
});
|
|
179
179
|
}, r = typeof t == "string" || ArrayBuffer.isView(t) || t instanceof ArrayBuffer || t instanceof bn ? e(t) : Ve(t) ? n(t) : we(t) ? t : e(t);
|
|
180
180
|
return yield E(
|
|
181
181
|
// otherwise if AsyncIterable, use it
|
|
182
|
-
yield* He(Qt(en(
|
|
182
|
+
yield* He(Qt(en(function(i) {
|
|
183
183
|
return Tt(this, arguments, function* () {
|
|
184
184
|
let o = null;
|
|
185
185
|
do
|
|
186
186
|
o = yield E(i.next(yield yield E(x(s, o))));
|
|
187
187
|
while (!o.done);
|
|
188
188
|
});
|
|
189
|
-
}
|
|
189
|
+
}(r[Symbol.asyncIterator]()))))
|
|
190
190
|
), yield E(new s());
|
|
191
191
|
});
|
|
192
192
|
}
|
|
@@ -2311,87 +2311,87 @@ var Br, Nr, Fr, Lr, Ur, Mr, Cr, xr, Pr, kr, Vr, zr, jr, Yr, Wr, Gr, $r, Kr, Hr,
|
|
|
2311
2311
|
class p {
|
|
2312
2312
|
/** @nocollapse */
|
|
2313
2313
|
static isNull(t) {
|
|
2314
|
-
return t
|
|
2314
|
+
return (t == null ? void 0 : t.typeId) === c.Null;
|
|
2315
2315
|
}
|
|
2316
2316
|
/** @nocollapse */
|
|
2317
2317
|
static isInt(t) {
|
|
2318
|
-
return t
|
|
2318
|
+
return (t == null ? void 0 : t.typeId) === c.Int;
|
|
2319
2319
|
}
|
|
2320
2320
|
/** @nocollapse */
|
|
2321
2321
|
static isFloat(t) {
|
|
2322
|
-
return t
|
|
2322
|
+
return (t == null ? void 0 : t.typeId) === c.Float;
|
|
2323
2323
|
}
|
|
2324
2324
|
/** @nocollapse */
|
|
2325
2325
|
static isBinary(t) {
|
|
2326
|
-
return t
|
|
2326
|
+
return (t == null ? void 0 : t.typeId) === c.Binary;
|
|
2327
2327
|
}
|
|
2328
2328
|
/** @nocollapse */
|
|
2329
2329
|
static isLargeBinary(t) {
|
|
2330
|
-
return t
|
|
2330
|
+
return (t == null ? void 0 : t.typeId) === c.LargeBinary;
|
|
2331
2331
|
}
|
|
2332
2332
|
/** @nocollapse */
|
|
2333
2333
|
static isUtf8(t) {
|
|
2334
|
-
return t
|
|
2334
|
+
return (t == null ? void 0 : t.typeId) === c.Utf8;
|
|
2335
2335
|
}
|
|
2336
2336
|
/** @nocollapse */
|
|
2337
2337
|
static isLargeUtf8(t) {
|
|
2338
|
-
return t
|
|
2338
|
+
return (t == null ? void 0 : t.typeId) === c.LargeUtf8;
|
|
2339
2339
|
}
|
|
2340
2340
|
/** @nocollapse */
|
|
2341
2341
|
static isBool(t) {
|
|
2342
|
-
return t
|
|
2342
|
+
return (t == null ? void 0 : t.typeId) === c.Bool;
|
|
2343
2343
|
}
|
|
2344
2344
|
/** @nocollapse */
|
|
2345
2345
|
static isDecimal(t) {
|
|
2346
|
-
return t
|
|
2346
|
+
return (t == null ? void 0 : t.typeId) === c.Decimal;
|
|
2347
2347
|
}
|
|
2348
2348
|
/** @nocollapse */
|
|
2349
2349
|
static isDate(t) {
|
|
2350
|
-
return t
|
|
2350
|
+
return (t == null ? void 0 : t.typeId) === c.Date;
|
|
2351
2351
|
}
|
|
2352
2352
|
/** @nocollapse */
|
|
2353
2353
|
static isTime(t) {
|
|
2354
|
-
return t
|
|
2354
|
+
return (t == null ? void 0 : t.typeId) === c.Time;
|
|
2355
2355
|
}
|
|
2356
2356
|
/** @nocollapse */
|
|
2357
2357
|
static isTimestamp(t) {
|
|
2358
|
-
return t
|
|
2358
|
+
return (t == null ? void 0 : t.typeId) === c.Timestamp;
|
|
2359
2359
|
}
|
|
2360
2360
|
/** @nocollapse */
|
|
2361
2361
|
static isInterval(t) {
|
|
2362
|
-
return t
|
|
2362
|
+
return (t == null ? void 0 : t.typeId) === c.Interval;
|
|
2363
2363
|
}
|
|
2364
2364
|
/** @nocollapse */
|
|
2365
2365
|
static isDuration(t) {
|
|
2366
|
-
return t
|
|
2366
|
+
return (t == null ? void 0 : t.typeId) === c.Duration;
|
|
2367
2367
|
}
|
|
2368
2368
|
/** @nocollapse */
|
|
2369
2369
|
static isList(t) {
|
|
2370
|
-
return t
|
|
2370
|
+
return (t == null ? void 0 : t.typeId) === c.List;
|
|
2371
2371
|
}
|
|
2372
2372
|
/** @nocollapse */
|
|
2373
2373
|
static isStruct(t) {
|
|
2374
|
-
return t
|
|
2374
|
+
return (t == null ? void 0 : t.typeId) === c.Struct;
|
|
2375
2375
|
}
|
|
2376
2376
|
/** @nocollapse */
|
|
2377
2377
|
static isUnion(t) {
|
|
2378
|
-
return t
|
|
2378
|
+
return (t == null ? void 0 : t.typeId) === c.Union;
|
|
2379
2379
|
}
|
|
2380
2380
|
/** @nocollapse */
|
|
2381
2381
|
static isFixedSizeBinary(t) {
|
|
2382
|
-
return t
|
|
2382
|
+
return (t == null ? void 0 : t.typeId) === c.FixedSizeBinary;
|
|
2383
2383
|
}
|
|
2384
2384
|
/** @nocollapse */
|
|
2385
2385
|
static isFixedSizeList(t) {
|
|
2386
|
-
return t
|
|
2386
|
+
return (t == null ? void 0 : t.typeId) === c.FixedSizeList;
|
|
2387
2387
|
}
|
|
2388
2388
|
/** @nocollapse */
|
|
2389
2389
|
static isMap(t) {
|
|
2390
|
-
return t
|
|
2390
|
+
return (t == null ? void 0 : t.typeId) === c.Map;
|
|
2391
2391
|
}
|
|
2392
2392
|
/** @nocollapse */
|
|
2393
2393
|
static isDictionary(t) {
|
|
2394
|
-
return t
|
|
2394
|
+
return (t == null ? void 0 : t.typeId) === c.Dictionary;
|
|
2395
2395
|
}
|
|
2396
2396
|
/** @nocollapse */
|
|
2397
2397
|
static isDenseUnion(t) {
|
|
@@ -2663,10 +2663,10 @@ Ss[qr] = ((s) => (s.children = null, s.listSize = null, s[Symbol.toStringTag] =
|
|
|
2663
2663
|
class Ts extends p {
|
|
2664
2664
|
constructor(t, e = !1) {
|
|
2665
2665
|
var n, r, i;
|
|
2666
|
-
if (super(c.Map), this.children = [t], this.keysSorted = e, t && (t.name = "entries", !((n = t
|
|
2667
|
-
const o = (r = t
|
|
2666
|
+
if (super(c.Map), this.children = [t], this.keysSorted = e, t && (t.name = "entries", !((n = t == null ? void 0 : t.type) === null || n === void 0) && n.children)) {
|
|
2667
|
+
const o = (r = t == null ? void 0 : t.type) === null || r === void 0 ? void 0 : r.children[0];
|
|
2668
2668
|
o && (o.name = "key");
|
|
2669
|
-
const a = (i = t
|
|
2669
|
+
const a = (i = t == null ? void 0 : t.type) === null || i === void 0 ? void 0 : i.children[1];
|
|
2670
2670
|
a && (a.name = "value");
|
|
2671
2671
|
}
|
|
2672
2672
|
}
|
|
@@ -2712,8 +2712,6 @@ function Ft(s) {
|
|
|
2712
2712
|
return s.bitWidth / 32;
|
|
2713
2713
|
case c.Interval:
|
|
2714
2714
|
return 1 + t.unit;
|
|
2715
|
-
// case Type.Int: return 1 + +((t as Int_).bitWidth > 32);
|
|
2716
|
-
// case Type.Time: return 1 + +((t as Time_).bitWidth > 32);
|
|
2717
2715
|
case c.FixedSizeList:
|
|
2718
2716
|
return t.listSize;
|
|
2719
2717
|
case c.FixedSizeBinary:
|
|
@@ -2800,7 +2798,7 @@ class O {
|
|
|
2800
2798
|
}
|
|
2801
2799
|
}
|
|
2802
2800
|
function Go(s, t, e = !0) {
|
|
2803
|
-
return typeof t == "number" ? le(s, t, e) : typeof t == "string" && t in c ? le(s, c[t], e) : t && t instanceof p ? le(s, tr(t), e) : t
|
|
2801
|
+
return typeof t == "number" ? le(s, t, e) : typeof t == "string" && t in c ? le(s, c[t], e) : t && t instanceof p ? le(s, tr(t), e) : t != null && t.type && t.type instanceof p ? le(s, tr(t.type), e) : le(s, c.NONE, e);
|
|
2804
2802
|
}
|
|
2805
2803
|
function le(s, t, e = !0) {
|
|
2806
2804
|
let n = null;
|
|
@@ -4078,13 +4076,10 @@ function S(s, t, e) {
|
|
|
4078
4076
|
return -1;
|
|
4079
4077
|
if (t === null)
|
|
4080
4078
|
switch (s.typeId) {
|
|
4081
|
-
// Unions don't have a nullBitmap of its own, so compare the `searchElement` to `get()`.
|
|
4082
4079
|
case c.Union:
|
|
4083
4080
|
break;
|
|
4084
|
-
// Dictionaries do have a nullBitmap, but their dictionary could also have null elements.
|
|
4085
4081
|
case c.Dictionary:
|
|
4086
4082
|
break;
|
|
4087
|
-
// All other types can iterate the null bitmap
|
|
4088
4083
|
default:
|
|
4089
4084
|
return Ha(s, e);
|
|
4090
4085
|
}
|
|
@@ -5599,12 +5594,12 @@ function hc(s, t, e, n, r) {
|
|
|
5599
5594
|
var i;
|
|
5600
5595
|
const o = (t + 63 & -64) >> 3;
|
|
5601
5596
|
for (let a = -1, l = n.length; ++a < l; ) {
|
|
5602
|
-
const u = e[a], h = u
|
|
5597
|
+
const u = e[a], h = u == null ? void 0 : u.length;
|
|
5603
5598
|
if (h >= t)
|
|
5604
5599
|
h === t ? e[a] = u : (e[a] = u.slice(0, t), r.numBatches = Math.max(r.numBatches, n[a].unshift(u.slice(t, h - t))));
|
|
5605
5600
|
else {
|
|
5606
5601
|
const d = s[a];
|
|
5607
|
-
s[a] = d.clone({ nullable: !0 }), e[a] = (i = u
|
|
5602
|
+
s[a] = d.clone({ nullable: !0 }), e[a] = (i = u == null ? void 0 : u._changeLengthAndBackfillNullBitmap(t)) !== null && i !== void 0 ? i : A({
|
|
5608
5603
|
type: d.type,
|
|
5609
5604
|
length: t,
|
|
5610
5605
|
nullCount: t,
|
|
@@ -6029,7 +6024,7 @@ function ar(s, t, e = t.reduce((n, r) => Math.max(n, r.length), 0)) {
|
|
|
6029
6024
|
const r = [...s.fields], i = [...t], o = (e + 63 & -64) >> 3;
|
|
6030
6025
|
for (const [a, l] of s.fields.entries()) {
|
|
6031
6026
|
const u = t[a];
|
|
6032
|
-
(!u || u.length !== e) && (r[a] = l.clone({ nullable: !0 }), i[a] = (n = u
|
|
6027
|
+
(!u || u.length !== e) && (r[a] = l.clone({ nullable: !0 }), i[a] = (n = u == null ? void 0 : u._changeLengthAndBackfillNullBitmap(e)) !== null && n !== void 0 ? n : A({
|
|
6033
6028
|
type: l.type,
|
|
6034
6029
|
length: e,
|
|
6035
6030
|
nullCount: e,
|
|
@@ -6043,15 +6038,15 @@ function ar(s, t, e = t.reduce((n, r) => Math.max(n, r.length), 0)) {
|
|
|
6043
6038
|
}
|
|
6044
6039
|
function io(s, t, e = /* @__PURE__ */ new Map()) {
|
|
6045
6040
|
var n, r;
|
|
6046
|
-
if (((n = s
|
|
6041
|
+
if (((n = s == null ? void 0 : s.length) !== null && n !== void 0 ? n : 0) > 0 && (s == null ? void 0 : s.length) === (t == null ? void 0 : t.length))
|
|
6047
6042
|
for (let i = -1, o = s.length; ++i < o; ) {
|
|
6048
6043
|
const { type: a } = s[i], l = t[i];
|
|
6049
|
-
for (const u of [l, ...((r = l
|
|
6050
|
-
io(a.children, u
|
|
6044
|
+
for (const u of [l, ...((r = l == null ? void 0 : l.dictionary) === null || r === void 0 ? void 0 : r.data) || []])
|
|
6045
|
+
io(a.children, u == null ? void 0 : u.children, e);
|
|
6051
6046
|
if (p.isDictionary(a)) {
|
|
6052
6047
|
const { id: u } = a;
|
|
6053
6048
|
if (!e.has(u))
|
|
6054
|
-
l
|
|
6049
|
+
l != null && l.dictionary && e.set(u, l.dictionary);
|
|
6055
6050
|
else if (e.get(u) !== l.dictionary)
|
|
6056
6051
|
throw new Error("Cannot create Schema containing two different dictionaries with the same Id");
|
|
6057
6052
|
}
|
|
@@ -6437,7 +6432,7 @@ class $t {
|
|
|
6437
6432
|
}
|
|
6438
6433
|
}
|
|
6439
6434
|
function vc(s, t) {
|
|
6440
|
-
return (
|
|
6435
|
+
return () => {
|
|
6441
6436
|
switch (t) {
|
|
6442
6437
|
case N.Schema:
|
|
6443
6438
|
return L.fromJSON(s);
|
|
@@ -6447,10 +6442,10 @@ function vc(s, t) {
|
|
|
6447
6442
|
return Rt.fromJSON(s);
|
|
6448
6443
|
}
|
|
6449
6444
|
throw new Error(`Unrecognized Message type: { name: ${N[t]}, type: ${t} }`);
|
|
6450
|
-
}
|
|
6445
|
+
};
|
|
6451
6446
|
}
|
|
6452
6447
|
function Ic(s, t) {
|
|
6453
|
-
return (
|
|
6448
|
+
return () => {
|
|
6454
6449
|
switch (t) {
|
|
6455
6450
|
case N.Schema:
|
|
6456
6451
|
return L.decode(s.header(new _t()), /* @__PURE__ */ new Map(), s.version());
|
|
@@ -6460,7 +6455,7 @@ function Ic(s, t) {
|
|
|
6460
6455
|
return Rt.decode(s.header(new se()), s.version());
|
|
6461
6456
|
}
|
|
6462
6457
|
throw new Error(`Unrecognized Message type: { name: ${N[t]}, type: ${t} }`);
|
|
6463
|
-
}
|
|
6458
|
+
};
|
|
6464
6459
|
}
|
|
6465
6460
|
V.encode = Fc;
|
|
6466
6461
|
V.decode = Bc;
|
|
@@ -6697,13 +6692,13 @@ class ho {
|
|
|
6697
6692
|
);
|
|
6698
6693
|
}
|
|
6699
6694
|
readSchema(t = !1) {
|
|
6700
|
-
const e = N.Schema, n = this.readMessage(e), r = n
|
|
6695
|
+
const e = N.Schema, n = this.readMessage(e), r = n == null ? void 0 : n.header();
|
|
6701
6696
|
if (t && !r)
|
|
6702
6697
|
throw new Error(Ln(e));
|
|
6703
6698
|
return r;
|
|
6704
6699
|
}
|
|
6705
6700
|
readMetadataLength() {
|
|
6706
|
-
const t = this.source.read(ks), e = t && new ge(t), n = e
|
|
6701
|
+
const t = this.source.read(ks), e = t && new ge(t), n = (e == null ? void 0 : e.readInt32(0)) || 0;
|
|
6707
6702
|
return { done: n === 0, value: n };
|
|
6708
6703
|
}
|
|
6709
6704
|
readMetadata(t) {
|
|
@@ -6764,7 +6759,7 @@ class Pc {
|
|
|
6764
6759
|
}
|
|
6765
6760
|
readSchema() {
|
|
6766
6761
|
return T(this, arguments, void 0, function* (t = !1) {
|
|
6767
|
-
const e = N.Schema, n = yield this.readMessage(e), r = n
|
|
6762
|
+
const e = N.Schema, n = yield this.readMessage(e), r = n == null ? void 0 : n.header();
|
|
6768
6763
|
if (t && !r)
|
|
6769
6764
|
throw new Error(Ln(e));
|
|
6770
6765
|
return r;
|
|
@@ -6772,7 +6767,7 @@ class Pc {
|
|
|
6772
6767
|
}
|
|
6773
6768
|
readMetadataLength() {
|
|
6774
6769
|
return T(this, void 0, void 0, function* () {
|
|
6775
|
-
const t = yield this.source.read(ks), e = t && new ge(t), n = e
|
|
6770
|
+
const t = yield this.source.read(ks), e = t && new ge(t), n = (e == null ? void 0 : e.readInt32(0)) || 0;
|
|
6776
6771
|
return { done: n === 0, value: n };
|
|
6777
6772
|
});
|
|
6778
6773
|
}
|
|
@@ -6827,7 +6822,7 @@ class kc extends ho {
|
|
|
6827
6822
|
return e.value;
|
|
6828
6823
|
}
|
|
6829
6824
|
readSchema() {
|
|
6830
|
-
const t = N.Schema, e = this.readMessage(t), n = e
|
|
6825
|
+
const t = N.Schema, e = this.readMessage(t), n = e == null ? void 0 : e.header();
|
|
6831
6826
|
if (!e || !n)
|
|
6832
6827
|
throw new Error(Ln(t));
|
|
6833
6828
|
return n;
|
|
@@ -7173,7 +7168,7 @@ class bo extends Us {
|
|
|
7173
7168
|
const n = (e = this._footer) === null || e === void 0 ? void 0 : e.getRecordBatch(t);
|
|
7174
7169
|
if (n && this._handle.seek(n.offset)) {
|
|
7175
7170
|
const r = this._reader.readMessage(N.RecordBatch);
|
|
7176
|
-
if (r
|
|
7171
|
+
if (r != null && r.isRecordBatch()) {
|
|
7177
7172
|
const i = r.header(), o = this._reader.readMessageBody(r.bodyLength);
|
|
7178
7173
|
return this._loadRecordBatch(i, o);
|
|
7179
7174
|
}
|
|
@@ -7185,7 +7180,7 @@ class bo extends Us {
|
|
|
7185
7180
|
const n = (e = this._footer) === null || e === void 0 ? void 0 : e.getDictionaryBatch(t);
|
|
7186
7181
|
if (n && this._handle.seek(n.offset)) {
|
|
7187
7182
|
const r = this._reader.readMessage(N.DictionaryBatch);
|
|
7188
|
-
if (r
|
|
7183
|
+
if (r != null && r.isDictionaryBatch()) {
|
|
7189
7184
|
const i = r.header(), o = this._reader.readMessageBody(r.bodyLength), a = this._loadDictionaryBatch(i, o);
|
|
7190
7185
|
this.dictionaries.set(i.id, a);
|
|
7191
7186
|
}
|
|
@@ -7247,7 +7242,7 @@ class jc extends Ms {
|
|
|
7247
7242
|
const n = (e = this._footer) === null || e === void 0 ? void 0 : e.getRecordBatch(t);
|
|
7248
7243
|
if (n && (yield this._handle.seek(n.offset))) {
|
|
7249
7244
|
const r = yield this._reader.readMessage(N.RecordBatch);
|
|
7250
|
-
if (r
|
|
7245
|
+
if (r != null && r.isRecordBatch()) {
|
|
7251
7246
|
const i = r.header(), o = yield this._reader.readMessageBody(r.bodyLength);
|
|
7252
7247
|
return this._loadRecordBatch(i, o);
|
|
7253
7248
|
}
|
|
@@ -7261,7 +7256,7 @@ class jc extends Ms {
|
|
|
7261
7256
|
const n = (e = this._footer) === null || e === void 0 ? void 0 : e.getDictionaryBatch(t);
|
|
7262
7257
|
if (n && (yield this._handle.seek(n.offset))) {
|
|
7263
7258
|
const r = yield this._reader.readMessage(N.DictionaryBatch);
|
|
7264
|
-
if (r
|
|
7259
|
+
if (r != null && r.isDictionaryBatch()) {
|
|
7265
7260
|
const i = r.header(), o = yield this._reader.readMessageBody(r.bodyLength), a = this._loadDictionaryBatch(i, o);
|
|
7266
7261
|
this.dictionaries.set(i.id, a);
|
|
7267
7262
|
}
|
|
@@ -7327,16 +7322,16 @@ function Wc(s) {
|
|
|
7327
7322
|
}
|
|
7328
7323
|
function Gc(s) {
|
|
7329
7324
|
const t = s.peek(We + 7 & -8);
|
|
7330
|
-
return t && t.byteLength >= 4 ? Un(t) ? new fo(new bo(s.read())) : new Fs(new Us(s)) : new Fs(new Us(
|
|
7331
|
-
}
|
|
7325
|
+
return t && t.byteLength >= 4 ? Un(t) ? new fo(new bo(s.read())) : new Fs(new Us(s)) : new Fs(new Us(function* () {
|
|
7326
|
+
}()));
|
|
7332
7327
|
}
|
|
7333
7328
|
function $c(s) {
|
|
7334
7329
|
return T(this, void 0, void 0, function* () {
|
|
7335
7330
|
const t = yield s.peek(We + 7 & -8);
|
|
7336
|
-
return t && t.byteLength >= 4 ? Un(t) ? new fo(new bo(yield s.read())) : new Ls(new Ms(s)) : new Ls(new Ms(
|
|
7331
|
+
return t && t.byteLength >= 4 ? Un(t) ? new fo(new bo(yield s.read())) : new Ls(new Ms(s)) : new Ls(new Ms(function() {
|
|
7337
7332
|
return Tt(this, arguments, function* () {
|
|
7338
7333
|
});
|
|
7339
|
-
}
|
|
7334
|
+
}()));
|
|
7340
7335
|
});
|
|
7341
7336
|
}
|
|
7342
7337
|
function Kc(s) {
|
|
@@ -7559,7 +7554,7 @@ class mo extends On {
|
|
|
7559
7554
|
_writeDictionaries(t) {
|
|
7560
7555
|
var e, n;
|
|
7561
7556
|
for (const [r, i] of t.dictionaries) {
|
|
7562
|
-
const o = (e = i
|
|
7557
|
+
const o = (e = i == null ? void 0 : i.data) !== null && e !== void 0 ? e : [], a = this._seenDictionaries.get(r), l = (n = this._dictionaryDeltaOffsets.get(r)) !== null && n !== void 0 ? n : 0;
|
|
7563
7558
|
if (!a || a.data[0] !== o[0])
|
|
7564
7559
|
for (const [u, h] of o.entries())
|
|
7565
7560
|
this._writeDictionaryBatch(h, r, u > 0);
|