@instantdb/react 0.22.83 → 0.22.84-experimental.trackqueryhash.20082268843.1

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.
@@ -1,4 +1,4 @@
1
- import ci, { useRef as at, useCallback as ge, useSyncExternalStore as tn, useEffect as je, useMemo as nn, useState as di, createElement as js } from "react";
1
+ import ci, { useRef as at, useCallback as ge, useSyncExternalStore as tn, useEffect as ke, useMemo as nn, useState as di, createElement as ks } from "react";
2
2
  function z(t) {
3
3
  if (typeof t == "number")
4
4
  return (Math.abs(t * 2654435761) >>> 0).toString(16);
@@ -41,7 +41,7 @@ const U = {
41
41
  Remove: "remove",
42
42
  Replace: "replace",
43
43
  Add: "add"
44
- }, fi = Symbol.for("__MUTATIVE_PROXY_DRAFT__"), ks = Symbol("__MUTATIVE_RAW_RETURN_SYMBOL__"), vt = Symbol.iterator, ne = {
44
+ }, fi = Symbol.for("__MUTATIVE_PROXY_DRAFT__"), js = Symbol("__MUTATIVE_RAW_RETURN_SYMBOL__"), vt = Symbol.iterator, ne = {
45
45
  mutable: "mutable",
46
46
  immutable: "immutable"
47
47
  }, Mn = {};
@@ -69,15 +69,15 @@ function te(t) {
69
69
  var e;
70
70
  return (e = t.copy) !== null && e !== void 0 ? e : t.original;
71
71
  }
72
- function ke(t) {
73
- return !!k(t);
72
+ function je(t) {
73
+ return !!j(t);
74
74
  }
75
- function k(t) {
75
+ function j(t) {
76
76
  return typeof t != "object" ? null : t == null ? void 0 : t[fi];
77
77
  }
78
78
  function $n(t) {
79
79
  var e;
80
- const n = k(t);
80
+ const n = j(t);
81
81
  return n ? (e = n.copy) !== null && e !== void 0 ? e : n.original : t;
82
82
  }
83
83
  function ae(t, e) {
@@ -88,7 +88,7 @@ function ae(t, e) {
88
88
  }
89
89
  function li(t, e = []) {
90
90
  if (Object.hasOwnProperty.call(t, "key")) {
91
- const n = t.parent.copy, r = k(be(n, t.key));
91
+ const n = t.parent.copy, r = j(be(n, t.key));
92
92
  if (r !== null && (r == null ? void 0 : r.original) !== t.original)
93
93
  return null;
94
94
  const i = t.parent.type === 3, s = i ? Array.from(t.parent.setMap.keys()).indexOf(t.key) : t.key;
@@ -116,7 +116,7 @@ function ct(t, e, n) {
116
116
  Ce(t) === 2 ? t.set(e, n) : t[e] = n;
117
117
  }
118
118
  function Ht(t, e) {
119
- const n = k(t);
119
+ const n = j(t);
120
120
  return (n ? te(n) : t)[e];
121
121
  }
122
122
  function ye(t, e) {
@@ -226,7 +226,7 @@ function Je(t) {
226
226
  return e;
227
227
  }
228
228
  function St(t) {
229
- return ke(t) ? Je(t) : t;
229
+ return je(t) ? Je(t) : t;
230
230
  }
231
231
  function fe(t) {
232
232
  var e;
@@ -242,17 +242,17 @@ function Me(t, e, n, r, i) {
242
242
  if (r.length > 0) {
243
243
  const a = r.indexOf(o);
244
244
  if (o && typeof o == "object" && a !== -1)
245
- throw r[0] === o ? new Error("Forbids circular reference") : new Error(`Forbids circular reference: ~/${i.slice(0, a).map((u, d) => {
245
+ throw r[0] === o ? new Error("Forbids circular reference") : new Error(`Forbids circular reference: ~/${i.slice(0, a).map((u, c) => {
246
246
  if (typeof u == "symbol")
247
247
  return `[${u.toString()}]`;
248
- const c = r[d];
249
- return typeof u == "object" && (c instanceof Map || c instanceof Set) ? Array.from(c.keys()).indexOf(u) : u;
248
+ const d = r[c];
249
+ return typeof u == "object" && (d instanceof Map || d instanceof Set) ? Array.from(d.keys()).indexOf(u) : u;
250
250
  }).join("/")}`);
251
251
  r.push(o), i.push(e);
252
252
  } else
253
253
  r.push(o);
254
254
  }
255
- if (Object.isFrozen(t) || ke(t)) {
255
+ if (Object.isFrozen(t) || je(t)) {
256
256
  r.pop(), i.pop();
257
257
  return;
258
258
  }
@@ -295,16 +295,16 @@ function Dn(t, e) {
295
295
  t.forEach((r, i) => e(i, r, t));
296
296
  }
297
297
  function pi(t, e, n) {
298
- if (ke(t) || !ae(t, n) || e.has(t) || Object.isFrozen(t))
298
+ if (je(t) || !ae(t, n) || e.has(t) || Object.isFrozen(t))
299
299
  return;
300
300
  const r = t instanceof Set, i = r ? /* @__PURE__ */ new Map() : void 0;
301
301
  if (e.add(t), Dn(t, (s, o) => {
302
302
  var a;
303
- if (ke(o)) {
304
- const u = k(o);
303
+ if (je(o)) {
304
+ const u = j(o);
305
305
  Q(u);
306
- const d = !((a = u.assignedMap) === null || a === void 0) && a.size || u.operated ? u.copy : u.original;
307
- ct(r ? i : t, s, d);
306
+ const c = !((a = u.assignedMap) === null || a === void 0) && a.size || u.operated ? u.copy : u.original;
307
+ ct(r ? i : t, s, c);
308
308
  } else
309
309
  pi(o, e, n);
310
310
  }), i) {
@@ -333,13 +333,13 @@ function on(t, e, n, r) {
333
333
  }
334
334
  }
335
335
  function Un(t, e, n, r) {
336
- const i = k(n);
336
+ const i = j(n);
337
337
  i && (i.callbacks || (i.callbacks = []), i.callbacks.push((s, o) => {
338
338
  var a;
339
339
  const u = t.type === 3 ? t.setMap : t.copy;
340
340
  if (ye(be(u, e), n)) {
341
- let d = i.original;
342
- i.copy && (d = i.copy), sn(t), on(t, r, s, o), t.options.enableAutoFreeze && (t.options.updatedValues = (a = t.options.updatedValues) !== null && a !== void 0 ? a : /* @__PURE__ */ new WeakMap(), t.options.updatedValues.set(d, i.original)), ct(u, e, d);
341
+ let c = i.original;
342
+ i.copy && (c = i.copy), sn(t), on(t, r, s, o), t.options.enableAutoFreeze && (t.options.updatedValues = (a = t.options.updatedValues) !== null && a !== void 0 ? a : /* @__PURE__ */ new WeakMap(), t.options.updatedValues.set(c, i.original)), ct(u, e, c);
343
343
  }
344
344
  }), t.options.enableAutoFreeze && i.finalities !== t.finalities && (t.options.enableAutoFreeze = !1)), ae(n, t.options) && t.finalities.draft.push(() => {
345
345
  const s = t.type === 3 ? t.setMap : t.copy;
@@ -349,42 +349,42 @@ function Un(t, e, n, r) {
349
349
  function Rs(t, e, n, r, i) {
350
350
  let { original: s, assignedMap: o, options: a } = t, u = t.copy;
351
351
  u.length < s.length && ([s, u] = [u, s], [n, r] = [r, n]);
352
- for (let d = 0; d < s.length; d += 1)
353
- if (o.get(d.toString()) && u[d] !== s[d]) {
354
- const c = e.concat([d]), f = Ee(c, i);
352
+ for (let c = 0; c < s.length; c += 1)
353
+ if (o.get(c.toString()) && u[c] !== s[c]) {
354
+ const d = e.concat([c]), f = Ee(d, i);
355
355
  n.push({
356
356
  op: U.Replace,
357
357
  path: f,
358
358
  // If it is a draft, it needs to be deep cloned, and it may also be non-draft.
359
- value: St(u[d])
359
+ value: St(u[c])
360
360
  }), r.push({
361
361
  op: U.Replace,
362
362
  path: f,
363
363
  // If it is a draft, it needs to be deep cloned, and it may also be non-draft.
364
- value: St(s[d])
364
+ value: St(s[c])
365
365
  });
366
366
  }
367
- for (let d = s.length; d < u.length; d += 1) {
368
- const c = e.concat([d]), f = Ee(c, i);
367
+ for (let c = s.length; c < u.length; c += 1) {
368
+ const d = e.concat([c]), f = Ee(d, i);
369
369
  n.push({
370
370
  op: U.Add,
371
371
  path: f,
372
372
  // If it is a draft, it needs to be deep cloned, and it may also be non-draft.
373
- value: St(u[d])
373
+ value: St(u[c])
374
374
  });
375
375
  }
376
376
  if (s.length < u.length) {
377
- const { arrayLengthAssignment: d = !0 } = a.enablePatches;
378
- if (d) {
379
- const c = e.concat(["length"]), f = Ee(c, i);
377
+ const { arrayLengthAssignment: c = !0 } = a.enablePatches;
378
+ if (c) {
379
+ const d = e.concat(["length"]), f = Ee(d, i);
380
380
  r.push({
381
381
  op: U.Replace,
382
382
  path: f,
383
383
  value: s.length
384
384
  });
385
385
  } else
386
- for (let c = u.length; s.length < c; c -= 1) {
387
- const f = e.concat([c - 1]), l = Ee(f, i);
386
+ for (let d = u.length; s.length < d; d -= 1) {
387
+ const f = e.concat([d - 1]), l = Ee(f, i);
388
388
  r.push({
389
389
  op: U.Remove,
390
390
  path: l
@@ -394,39 +394,39 @@ function Rs(t, e, n, r, i) {
394
394
  }
395
395
  function xs({ original: t, copy: e, assignedMap: n }, r, i, s, o) {
396
396
  n.forEach((a, u) => {
397
- const d = be(t, u), c = St(be(e, u)), f = a ? nt(t, u) ? U.Replace : U.Add : U.Remove;
398
- if (ye(d, c) && f === U.Replace)
397
+ const c = be(t, u), d = St(be(e, u)), f = a ? nt(t, u) ? U.Replace : U.Add : U.Remove;
398
+ if (ye(c, d) && f === U.Replace)
399
399
  return;
400
400
  const l = r.concat(u), p = Ee(l, o);
401
- i.push(f === U.Remove ? { op: f, path: p } : { op: f, path: p, value: c }), s.push(f === U.Add ? { op: U.Remove, path: p } : f === U.Remove ? { op: U.Add, path: p, value: d } : { op: U.Replace, path: p, value: d });
401
+ i.push(f === U.Remove ? { op: f, path: p } : { op: f, path: p, value: d }), s.push(f === U.Add ? { op: U.Remove, path: p } : f === U.Remove ? { op: U.Add, path: p, value: c } : { op: U.Replace, path: p, value: c });
402
402
  });
403
403
  }
404
404
  function $s({ original: t, copy: e }, n, r, i, s) {
405
405
  let o = 0;
406
406
  t.forEach((a) => {
407
407
  if (!e.has(a)) {
408
- const u = n.concat([o]), d = Ee(u, s);
408
+ const u = n.concat([o]), c = Ee(u, s);
409
409
  r.push({
410
410
  op: U.Remove,
411
- path: d,
411
+ path: c,
412
412
  value: a
413
413
  }), i.unshift({
414
414
  op: U.Add,
415
- path: d,
415
+ path: c,
416
416
  value: a
417
417
  });
418
418
  }
419
419
  o += 1;
420
420
  }), o = 0, e.forEach((a) => {
421
421
  if (!t.has(a)) {
422
- const u = n.concat([o]), d = Ee(u, s);
422
+ const u = n.concat([o]), c = Ee(u, s);
423
423
  r.push({
424
424
  op: U.Add,
425
- path: d,
425
+ path: c,
426
426
  value: a
427
427
  }), i.unshift({
428
428
  op: U.Remove,
429
- path: d,
429
+ path: c,
430
430
  value: a
431
431
  });
432
432
  }
@@ -445,28 +445,28 @@ function ut(t, e, n, r) {
445
445
  return $s(t, e, n, r, i);
446
446
  }
447
447
  }
448
- const kt = (t, e, n = !1) => {
448
+ const jt = (t, e, n = !1) => {
449
449
  if (typeof t == "object" && t !== null && (!ae(t, e) || n))
450
450
  throw new Error("Strict mode: Mutable data cannot be accessed directly, please use 'unsafe(callback)' wrap.");
451
451
  }, an = {
452
452
  get size() {
453
- return te(k(this)).size;
453
+ return te(j(this)).size;
454
454
  },
455
455
  has(t) {
456
- return te(k(this)).has(t);
456
+ return te(j(this)).has(t);
457
457
  },
458
458
  set(t, e) {
459
- const n = k(this), r = te(n);
459
+ const n = j(this), r = te(n);
460
460
  return (!r.has(t) || !ye(r.get(t), e)) && (Q(n), fe(n), n.assignedMap.set(t, !0), n.copy.set(t, e), Un(n, t, e, ut)), this;
461
461
  },
462
462
  delete(t) {
463
463
  if (!this.has(t))
464
464
  return !1;
465
- const e = k(this);
465
+ const e = j(this);
466
466
  return Q(e), fe(e), e.original.has(t) ? e.assignedMap.set(t, !1) : e.assignedMap.delete(t), e.copy.delete(t), !0;
467
467
  },
468
468
  clear() {
469
- const t = k(this);
469
+ const t = j(this);
470
470
  if (this.size) {
471
471
  Q(t), fe(t), t.assignedMap = /* @__PURE__ */ new Map();
472
472
  for (const [e] of t.original)
@@ -475,15 +475,15 @@ const kt = (t, e, n = !1) => {
475
475
  }
476
476
  },
477
477
  forEach(t, e) {
478
- const n = k(this);
478
+ const n = j(this);
479
479
  te(n).forEach((r, i) => {
480
480
  t.call(e, this.get(i), i, this);
481
481
  });
482
482
  },
483
483
  get(t) {
484
484
  var e, n;
485
- const r = k(this), i = te(r).get(t), s = ((n = (e = r.options).mark) === null || n === void 0 ? void 0 : n.call(e, i, ne)) === ne.mutable;
486
- if (r.options.strict && kt(i, r.options, s), s || r.finalized || !ae(i, r.options) || i !== r.original.get(t))
485
+ const r = j(this), i = te(r).get(t), s = ((n = (e = r.options).mark) === null || n === void 0 ? void 0 : n.call(e, i, ne)) === ne.mutable;
486
+ if (r.options.strict && jt(i, r.options, s), s || r.finalized || !ae(i, r.options) || i !== r.original.get(t))
487
487
  return i;
488
488
  const o = Mn.createDraft({
489
489
  original: i,
@@ -495,7 +495,7 @@ const kt = (t, e, n = !1) => {
495
495
  return Q(r), r.copy.set(t, o), o;
496
496
  },
497
497
  keys() {
498
- return te(k(this)).keys();
498
+ return te(j(this)).keys();
499
499
  },
500
500
  values() {
501
501
  const t = this.keys();
@@ -536,16 +536,16 @@ const kt = (t, e, n = !1) => {
536
536
  return s;
537
537
  const o = s.value;
538
538
  let a = t.setMap.get(o);
539
- const u = k(a), d = ((i = (r = t.options).mark) === null || i === void 0 ? void 0 : i.call(r, a, ne)) === ne.mutable;
540
- if (t.options.strict && kt(o, t.options, d), !d && !u && ae(o, t.options) && !t.finalized && t.original.has(o)) {
541
- const c = Mn.createDraft({
539
+ const u = j(a), c = ((i = (r = t.options).mark) === null || i === void 0 ? void 0 : i.call(r, a, ne)) === ne.mutable;
540
+ if (t.options.strict && jt(o, t.options, c), !c && !u && ae(o, t.options) && !t.finalized && t.original.has(o)) {
541
+ const d = Mn.createDraft({
542
542
  original: o,
543
543
  parentDraft: t,
544
544
  key: o,
545
545
  finalities: t.finalities,
546
546
  options: t.options
547
547
  });
548
- t.setMap.set(o, c), a = c;
548
+ t.setMap.set(o, d), a = d;
549
549
  } else u && (a = u.proxy);
550
550
  return {
551
551
  done: !1,
@@ -553,39 +553,39 @@ const kt = (t, e, n = !1) => {
553
553
  };
554
554
  }, Ct = {
555
555
  get size() {
556
- return k(this).setMap.size;
556
+ return j(this).setMap.size;
557
557
  },
558
558
  has(t) {
559
- const e = k(this);
559
+ const e = j(this);
560
560
  if (e.setMap.has(t))
561
561
  return !0;
562
562
  Q(e);
563
- const n = k(t);
563
+ const n = j(t);
564
564
  return !!(n && e.setMap.has(n.original));
565
565
  },
566
566
  add(t) {
567
- const e = k(this);
567
+ const e = j(this);
568
568
  return this.has(t) || (Q(e), fe(e), e.assignedMap.set(t, !0), e.setMap.set(t, t), Un(e, t, t, ut)), this;
569
569
  },
570
570
  delete(t) {
571
571
  if (!this.has(t))
572
572
  return !1;
573
- const e = k(this);
573
+ const e = j(this);
574
574
  Q(e), fe(e);
575
- const n = k(t);
575
+ const n = j(t);
576
576
  return n && e.setMap.has(n.original) ? (e.assignedMap.set(n.original, !1), e.setMap.delete(n.original)) : (!n && e.setMap.has(t) ? e.assignedMap.set(t, !1) : e.assignedMap.delete(t), e.setMap.delete(t));
577
577
  },
578
578
  clear() {
579
579
  if (!this.size)
580
580
  return;
581
- const t = k(this);
581
+ const t = j(this);
582
582
  Q(t), fe(t);
583
583
  for (const e of t.original)
584
584
  t.assignedMap.set(e, !1);
585
585
  t.setMap.clear();
586
586
  },
587
587
  values() {
588
- const t = k(this);
588
+ const t = j(this);
589
589
  Q(t);
590
590
  const e = t.setMap.keys();
591
591
  return {
@@ -594,7 +594,7 @@ const kt = (t, e, n = !1) => {
594
594
  };
595
595
  },
596
596
  entries() {
597
- const t = k(this);
597
+ const t = j(this);
598
598
  Q(t);
599
599
  const e = t.setMap.keys();
600
600
  return {
@@ -650,34 +650,34 @@ const Us = Reflect.ownKeys(Ct), yi = /* @__PURE__ */ new WeakSet(), bi = {
650
650
  return t;
651
651
  let o;
652
652
  if (t.options.mark) {
653
- const d = e === "size" && (t.original instanceof Map || t.original instanceof Set) ? Reflect.get(t.original, e) : Reflect.get(t.original, e, n);
654
- if (o = t.options.mark(d, ne), o === ne.mutable)
655
- return t.options.strict && kt(d, t.options, !0), d;
653
+ const c = e === "size" && (t.original instanceof Map || t.original instanceof Set) ? Reflect.get(t.original, e) : Reflect.get(t.original, e, n);
654
+ if (o = t.options.mark(c, ne), o === ne.mutable)
655
+ return t.options.strict && jt(c, t.options, !0), c;
656
656
  }
657
657
  const a = te(t);
658
658
  if (a instanceof Map && Ds.includes(e)) {
659
659
  if (e === "size")
660
660
  return Object.getOwnPropertyDescriptor(an, "size").get.call(t.proxy);
661
- const d = an[e];
662
- if (d)
663
- return d.bind(t.proxy);
661
+ const c = an[e];
662
+ if (c)
663
+ return c.bind(t.proxy);
664
664
  }
665
665
  if (a instanceof Set && Us.includes(e)) {
666
666
  if (e === "size")
667
667
  return Object.getOwnPropertyDescriptor(Ct, "size").get.call(t.proxy);
668
- const d = Ct[e];
669
- if (d)
670
- return d.bind(t.proxy);
668
+ const c = Ct[e];
669
+ if (c)
670
+ return c.bind(t.proxy);
671
671
  }
672
672
  if (!nt(a, e)) {
673
- const d = gr(a, e);
674
- return d ? "value" in d ? d.value : (
673
+ const c = gr(a, e);
674
+ return c ? "value" in c ? c.value : (
675
675
  // !case: support for getter
676
- (i = d.get) === null || i === void 0 ? void 0 : i.call(t.proxy)
676
+ (i = c.get) === null || i === void 0 ? void 0 : i.call(t.proxy)
677
677
  ) : void 0;
678
678
  }
679
679
  const u = a[e];
680
- if (t.options.strict && kt(u, t.options), t.finalized || !ae(u, t.options))
680
+ if (t.options.strict && jt(u, t.options), t.finalized || !ae(u, t.options))
681
681
  return u;
682
682
  if (u === Ht(t.original, e)) {
683
683
  if (Q(t), t.copy[e] = Ln({
@@ -687,8 +687,8 @@ const Us = Reflect.ownKeys(Ct), yi = /* @__PURE__ */ new WeakSet(), bi = {
687
687
  finalities: t.finalities,
688
688
  options: t.options
689
689
  }), typeof o == "function") {
690
- const d = k(t.copy[e]);
691
- return Q(d), fe(d), d.copy;
690
+ const c = j(t.copy[e]);
691
+ return Q(c), fe(c), c.copy;
692
692
  }
693
693
  return t.copy[e];
694
694
  }
@@ -704,7 +704,7 @@ const Us = Reflect.ownKeys(Ct), yi = /* @__PURE__ */ new WeakSet(), bi = {
704
704
  const s = gr(te(t), e);
705
705
  if (s != null && s.set)
706
706
  return s.set.call(t.proxy, n), !0;
707
- const o = Ht(te(t), e), a = k(o);
707
+ const o = Ht(te(t), e), a = j(o);
708
708
  return a && ye(a.original, n) ? (t.copy[e] = n, t.assignedMap = (r = t.assignedMap) !== null && r !== void 0 ? r : /* @__PURE__ */ new Map(), t.assignedMap.set(e, !1), !0) : (ye(n, o) && (n !== void 0 || nt(t.original, e)) || (Q(t), fe(t), nt(t.original, e) && ye(n, t.original[e]) ? t.assignedMap.delete(e) : t.assignedMap.set(e, !0), t.copy[e] = n, Un(t, e, n, ut)), !0);
709
709
  },
710
710
  has(t, e) {
@@ -750,26 +750,26 @@ function Ln(t) {
750
750
  setMap: o === 3 ? new Map(e.entries()) : void 0
751
751
  };
752
752
  (r || "key" in t) && (a.key = r);
753
- const { proxy: u, revoke: d } = Proxy.revocable(o === 1 ? Object.assign([], a) : a, bi);
754
- if (i.revoke.push(d), yi.add(u), a.proxy = u, n) {
755
- const c = n;
756
- c.finalities.draft.push((f, l) => {
753
+ const { proxy: u, revoke: c } = Proxy.revocable(o === 1 ? Object.assign([], a) : a, bi);
754
+ if (i.revoke.push(c), yi.add(u), a.proxy = u, n) {
755
+ const d = n;
756
+ d.finalities.draft.push((f, l) => {
757
757
  var p, y;
758
- const b = k(u);
759
- let _ = c.type === 3 ? c.setMap : c.copy;
760
- const w = be(_, r), g = k(w);
758
+ const b = j(u);
759
+ let _ = d.type === 3 ? d.setMap : d.copy;
760
+ const w = be(_, r), g = j(w);
761
761
  if (g) {
762
762
  let m = g.original;
763
- g.operated && (m = $n(w)), sn(g), on(g, ut, f, l), c.options.enableAutoFreeze && (c.options.updatedValues = (p = c.options.updatedValues) !== null && p !== void 0 ? p : /* @__PURE__ */ new WeakMap(), c.options.updatedValues.set(m, g.original)), ct(_, r, m);
763
+ g.operated && (m = $n(w)), sn(g), on(g, ut, f, l), d.options.enableAutoFreeze && (d.options.updatedValues = (p = d.options.updatedValues) !== null && p !== void 0 ? p : /* @__PURE__ */ new WeakMap(), d.options.updatedValues.set(m, g.original)), ct(_, r, m);
764
764
  }
765
765
  (y = b.callbacks) === null || y === void 0 || y.forEach((m) => {
766
766
  m(f, l);
767
767
  });
768
768
  });
769
769
  } else {
770
- const c = k(u);
771
- c.finalities.draft.push((f, l) => {
772
- sn(c), on(c, ut, f, l);
770
+ const d = j(u);
771
+ d.finalities.draft.push((f, l) => {
772
+ sn(d), on(d, ut, f, l);
773
773
  });
774
774
  }
775
775
  return u;
@@ -777,13 +777,13 @@ function Ln(t) {
777
777
  Mn.createDraft = Ln;
778
778
  function Ls(t, e, n, r, i) {
779
779
  var s;
780
- const o = k(t), a = (s = o == null ? void 0 : o.original) !== null && s !== void 0 ? s : t, u = !!e.length;
780
+ const o = j(t), a = (s = o == null ? void 0 : o.original) !== null && s !== void 0 ? s : t, u = !!e.length;
781
781
  if (o != null && o.operated)
782
782
  for (; o.finalities.draft.length > 0; )
783
783
  o.finalities.draft.pop()(n, r);
784
- const d = u ? e[0] : o ? o.operated ? o.copy : o.original : t;
785
- return o && rn(o), i && Me(d, d, o == null ? void 0 : o.options.updatedValues), [
786
- d,
784
+ const c = u ? e[0] : o ? o.operated ? o.copy : o.original : t;
785
+ return o && rn(o), i && Me(c, c, o == null ? void 0 : o.options.updatedValues), [
786
+ c,
787
787
  n && u ? [{ op: U.Replace, path: [], value: e[0] }] : n,
788
788
  r && u ? [{ op: U.Replace, path: [], value: a }] : r
789
789
  ];
@@ -806,29 +806,29 @@ function Fs(t, e) {
806
806
  return [
807
807
  a,
808
808
  (u = []) => {
809
- const [d, c, f] = Ls(a, u, i, s, e.enableAutoFreeze);
810
- return e.enablePatches ? [d, c, f] : d;
809
+ const [c, d, f] = Ls(a, u, i, s, e.enableAutoFreeze);
810
+ return e.enablePatches ? [c, d, f] : c;
811
811
  }
812
812
  ];
813
813
  }
814
814
  function un(t) {
815
815
  const { rootDraft: e, value: n, useRawReturn: r = !1, isRoot: i = !0 } = t;
816
816
  Dn(n, (s, o, a) => {
817
- const u = k(o);
817
+ const u = j(o);
818
818
  if (u && e && u.finalities === e.finalities) {
819
819
  t.isContainDraft = !0;
820
- const d = u.original;
820
+ const c = u.original;
821
821
  if (a instanceof Set) {
822
- const c = Array.from(a);
823
- a.clear(), c.forEach((f) => a.add(s === f ? d : f));
822
+ const d = Array.from(a);
823
+ a.clear(), d.forEach((f) => a.add(s === f ? c : f));
824
824
  } else
825
- ct(a, s, d);
825
+ ct(a, s, c);
826
826
  } else typeof o == "object" && o !== null && (t.value = o, t.isRoot = !1, un(t));
827
827
  }), i && (t.isContainDraft || console.warn("The return value does not contain any draft, please use 'rawReturn()' to wrap the return value to improve performance."), r && console.warn("The return value contains drafts, please don't use 'rawReturn()' to wrap the return value."));
828
828
  }
829
829
  function _i(t) {
830
830
  var e;
831
- const n = k(t);
831
+ const n = j(t);
832
832
  if (!ae(t, n == null ? void 0 : n.options))
833
833
  return t;
834
834
  const r = Ce(t);
@@ -859,7 +859,7 @@ function _i(t) {
859
859
  return i;
860
860
  }
861
861
  function mr(t) {
862
- if (!ke(t))
862
+ if (!je(t))
863
863
  throw new Error(`current() is only used for Draft, parameter: ${t}`);
864
864
  return _i(t);
865
865
  }
@@ -869,21 +869,21 @@ const Ns = (t) => function e(n, r, i) {
869
869
  return function(S, ...I) {
870
870
  return e(S, (x) => n.call(this, x, ...I), r);
871
871
  };
872
- const u = n, d = r;
873
- let c = i;
874
- if (typeof r != "function" && (c = r), c !== void 0 && Object.prototype.toString.call(c) !== "[object Object]")
875
- throw new Error(`Invalid options: ${c}, 'options' should be an object.`);
876
- c = Object.assign(Object.assign({}, t), c);
877
- const f = ke(u) ? mr(u) : u, l = Array.isArray(c.mark) ? (S, I) => {
878
- for (const x of c.mark) {
872
+ const u = n, c = r;
873
+ let d = i;
874
+ if (typeof r != "function" && (d = r), d !== void 0 && Object.prototype.toString.call(d) !== "[object Object]")
875
+ throw new Error(`Invalid options: ${d}, 'options' should be an object.`);
876
+ d = Object.assign(Object.assign({}, t), d);
877
+ const f = je(u) ? mr(u) : u, l = Array.isArray(d.mark) ? (S, I) => {
878
+ for (const x of d.mark) {
879
879
  if (typeof x != "function")
880
880
  throw new Error(`Invalid mark: ${x}, 'mark' should be a function.`);
881
881
  const B = x(S, I);
882
882
  if (B)
883
883
  return B;
884
884
  }
885
- } : c.mark, p = (s = c.enablePatches) !== null && s !== void 0 ? s : !1, y = (o = c.strict) !== null && o !== void 0 ? o : !1, _ = {
886
- enableAutoFreeze: (a = c.enableAutoFreeze) !== null && a !== void 0 ? a : !1,
885
+ } : d.mark, p = (s = d.enablePatches) !== null && s !== void 0 ? s : !1, y = (o = d.strict) !== null && o !== void 0 ? o : !1, _ = {
886
+ enableAutoFreeze: (a = d.enableAutoFreeze) !== null && a !== void 0 ? a : !1,
887
887
  mark: l,
888
888
  strict: y,
889
889
  enablePatches: p
@@ -898,16 +898,16 @@ const Ns = (t) => function e(n, r, i) {
898
898
  }
899
899
  let m;
900
900
  try {
901
- m = d(w);
901
+ m = c(w);
902
902
  } catch (S) {
903
- throw rn(k(w)), S;
903
+ throw rn(j(w)), S;
904
904
  }
905
905
  const E = (S) => {
906
- const I = k(w);
907
- if (!ke(S)) {
906
+ const I = j(w);
907
+ if (!je(S)) {
908
908
  if (S !== void 0 && !ye(S, w) && (I != null && I.operated))
909
909
  throw new Error("Either the value is returned as a new non-draft value, or only the draft is modified without returning any value.");
910
- const B = S == null ? void 0 : S[ks];
910
+ const B = S == null ? void 0 : S[js];
911
911
  if (B) {
912
912
  const Ve = B[0];
913
913
  return _.strict && typeof S == "object" && S !== null && un({
@@ -921,7 +921,7 @@ const Ns = (t) => function e(n, r, i) {
921
921
  }
922
922
  if (S === w || S === void 0)
923
923
  return g([]);
924
- const x = k(S);
924
+ const x = j(S);
925
925
  if (_ === x.options) {
926
926
  if (x.operated)
927
927
  throw new Error("Cannot return a modified child draft.");
@@ -930,7 +930,7 @@ const Ns = (t) => function e(n, r, i) {
930
930
  return g([S]);
931
931
  };
932
932
  return m instanceof Promise ? m.then(E, (S) => {
933
- throw rn(k(w)), S;
933
+ throw rn(j(w)), S;
934
934
  }) : E(m);
935
935
  }, Pt = Ns();
936
936
  Object.prototype.constructor.toString();
@@ -1246,8 +1246,8 @@ function Zs(t) {
1246
1246
  function Xs(t) {
1247
1247
  const e = /^(\d+)-(\d{1,2})-(\d{1,2})([ T])(.+)$/, n = t.match(e);
1248
1248
  if (n) {
1249
- const [, r, i, s, o, a] = n, u = i.padStart(2, "0"), d = s.padStart(2, "0"), c = `${r}-${u}-${d}T${a}`;
1250
- return new Date(c);
1249
+ const [, r, i, s, o, a] = n, u = i.padStart(2, "0"), c = s.padStart(2, "0"), d = `${r}-${u}-${c}T${a}`;
1250
+ return new Date(d);
1251
1251
  }
1252
1252
  return null;
1253
1253
  }
@@ -1255,8 +1255,8 @@ function eo(t) {
1255
1255
  const [e, n] = t.split(", "), [r, i, s] = e.split("/").map(Number), o = n.match(/(\d{1,2}):(\d{2}):(\d{2}) (AM|PM)/);
1256
1256
  if (!o)
1257
1257
  throw new Error(`Unable to parse time from: ${t}`);
1258
- let [, a, u, d, c] = o;
1259
- return a = Number(a), u = Number(u), d = Number(d), c === "PM" && a !== 12 ? a += 12 : c === "AM" && a === 12 && (a = 0), new Date(Date.UTC(s, r - 1, i, a, u, d));
1258
+ let [, a, u, c, d] = o;
1259
+ return a = Number(a), u = Number(u), c = Number(c), d === "PM" && a !== 12 ? a += 12 : d === "AM" && a === 12 && (a = 0), new Date(Date.UTC(s, r - 1, i, a, u, c));
1260
1260
  }
1261
1261
  function to(t) {
1262
1262
  switch (t) {
@@ -1370,22 +1370,22 @@ function Z(t, e, n) {
1370
1370
  function mi(t, e, n) {
1371
1371
  const r = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map(), s = /* @__PURE__ */ new Map();
1372
1372
  for (const o of e) {
1373
- let [a, u, d, c] = o;
1373
+ let [a, u, c, d] = o;
1374
1374
  const f = qe(t, u);
1375
1375
  if (!f) {
1376
1376
  console.warn("no such attr", a, t);
1377
1377
  continue;
1378
1378
  }
1379
- f["checked-data-type"] === "date" && n && (d = xt(d), o[2] = d), Nn(f) && Z(s, [d, u, a], o), Z(r, [a, u, d], o), Z(i, [u, a, d], o);
1379
+ f["checked-data-type"] === "date" && n && (c = xt(c), o[2] = c), Nn(f) && Z(s, [c, u, a], o), Z(r, [a, u, c], o), Z(i, [u, a, c], o);
1380
1380
  }
1381
1381
  return { eav: r, aev: i, vae: s };
1382
1382
  }
1383
1383
  function vi(t) {
1384
1384
  const e = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map();
1385
1385
  for (const s of Object.values(t)) {
1386
- const o = s["forward-identity"], [a, u, d] = o, c = s["reverse-identity"];
1387
- if (Z(r, [u, d], s), Kn(s) && Z(e, [u, d], s), s["primary?"] && Z(n, [u], s), c) {
1388
- const [f, l, p] = c;
1386
+ const o = s["forward-identity"], [a, u, c] = o, d = s["reverse-identity"];
1387
+ if (Z(r, [u, c], s), Kn(s) && Z(e, [u, c], s), s["primary?"] && Z(n, [u], s), d) {
1388
+ const [f, l, p] = d;
1389
1389
  Z(i, [l, p], s);
1390
1390
  }
1391
1391
  }
@@ -1421,7 +1421,7 @@ function dt(t, e) {
1421
1421
  const [o, a] = e[0], u = t.aev.get(o);
1422
1422
  if (!u)
1423
1423
  return null;
1424
- i = (n = X(u, 2).find((c) => c[2] === a)) === null || n === void 0 ? void 0 : n[0];
1424
+ i = (n = X(u, 2).find((d) => d[2] === a)) === null || n === void 0 ? void 0 : n[0];
1425
1425
  } else
1426
1426
  i = e[0];
1427
1427
  if (!i)
@@ -1431,11 +1431,11 @@ function dt(t, e) {
1431
1431
  const [o, a] = s, u = t.aev.get(o);
1432
1432
  if (!u)
1433
1433
  return null;
1434
- const c = (r = X(u, 2).find((b) => b[2] === a)) === null || r === void 0 ? void 0 : r[0];
1435
- if (!c)
1434
+ const d = (r = X(u, 2).find((b) => b[2] === a)) === null || r === void 0 ? void 0 : r[0];
1435
+ if (!d)
1436
1436
  return null;
1437
1437
  const [f, l, p, ...y] = e;
1438
- return [i, l, c, ...y];
1438
+ return [i, l, d, ...y];
1439
1439
  } else {
1440
1440
  const [o, ...a] = e;
1441
1441
  return [i, ...a];
@@ -1452,10 +1452,10 @@ let uo = 0;
1452
1452
  function Ai(t, e, n) {
1453
1453
  const [r, i, s] = n;
1454
1454
  let o;
1455
- const a = We(t.ea, [r, i, s]);
1455
+ const a = We(t.eav, [r, i, s]);
1456
1456
  return a && (o = a[3]), o || Date.now() * 10 + uo++;
1457
1457
  }
1458
- function ji(t, e) {
1458
+ function ki(t, e) {
1459
1459
  var n;
1460
1460
  const r = dt(t, e);
1461
1461
  if (!r)
@@ -1465,8 +1465,8 @@ function ji(t, e) {
1465
1465
  if (!a)
1466
1466
  return;
1467
1467
  a["checked-data-type"] === "date" && t.useDateObjects && (o = xt(o));
1468
- const u = We(t.eav, [i, s, o]), d = (n = u == null ? void 0 : u[3]) !== null && n !== void 0 ? n : Ai(t, a, r), c = [i, s, o, d];
1469
- oo(a) ? (Z(t.eav, [i, s], /* @__PURE__ */ new Map([[o, c]])), Z(t.aev, [s, i], /* @__PURE__ */ new Map([[o, c]]))) : (Z(t.eav, [i, s, o], c), Z(t.aev, [s, i, o], c)), Nn(a) && Z(t.vae, [o, s, i], c);
1468
+ const u = We(t.eav, [i, s, o]), c = (n = u == null ? void 0 : u[3]) !== null && n !== void 0 ? n : Ai(t, a, r), d = [i, s, o, c];
1469
+ oo(a) ? (Z(t.eav, [i, s], /* @__PURE__ */ new Map([[o, d]])), Z(t.aev, [s, i], /* @__PURE__ */ new Map([[o, d]]))) : (Z(t.eav, [i, s, o], d), Z(t.aev, [s, i, o], d)), Nn(a) && Z(t.vae, [o, s, i], d);
1470
1470
  }
1471
1471
  function co(t, e) {
1472
1472
  var n;
@@ -1481,14 +1481,14 @@ function co(t, e) {
1481
1481
  const u = We(t.eav, [i, s]);
1482
1482
  if (!u)
1483
1483
  return;
1484
- const d = (n = u.values().next()) === null || n === void 0 ? void 0 : n.value;
1485
- if (!d)
1484
+ const c = (n = u.values().next()) === null || n === void 0 ? void 0 : n.value;
1485
+ if (!c)
1486
1486
  return;
1487
- const c = d[2], f = Ti(c, o), l = [
1487
+ const d = c[2], f = Ti(d, o), l = [
1488
1488
  i,
1489
1489
  s,
1490
1490
  f,
1491
- Ai(t, a, d)
1491
+ Ai(t, a, c)
1492
1492
  ];
1493
1493
  Z(t.eav, [i, s], /* @__PURE__ */ new Map([[f, l]]));
1494
1494
  }
@@ -1499,27 +1499,27 @@ function dn(t, e) {
1499
1499
  return;
1500
1500
  const [a] = o, u = t.eav.get(a);
1501
1501
  if (u) {
1502
- for (const c of u.keys()) {
1503
- const f = t.attrs[c];
1504
- f && f["on-delete-reverse"] === "cascade" && X(u.get(c), 1).forEach(([l, p, y]) => {
1502
+ for (const d of u.keys()) {
1503
+ const f = t.attrs[d];
1504
+ f && f["on-delete-reverse"] === "cascade" && X(u.get(d), 1).forEach(([l, p, y]) => {
1505
1505
  var b;
1506
1506
  return dn(t, [y, (b = f["reverse-identity"]) === null || b === void 0 ? void 0 : b[1]]);
1507
1507
  }), // Fall back to deleting everything if we've rehydrated tx-steps from
1508
1508
  // the store that didn't set `etype` in deleteEntity
1509
1509
  (!s || // If we don't know about the attr, let's just get rid of it
1510
1510
  !f || // Make sure it matches the etype
1511
- ((n = f["forward-identity"]) === null || n === void 0 ? void 0 : n[1]) === s) && (oe(t.aev, [c, a]), oe(t.eav, [a, c]));
1511
+ ((n = f["forward-identity"]) === null || n === void 0 ? void 0 : n[1]) === s) && (oe(t.aev, [d, a]), oe(t.eav, [a, d]));
1512
1512
  }
1513
1513
  u.size === 0 && oe(t.eav, [a]);
1514
1514
  }
1515
- const d = t.vae.get(a) && X(t.vae.get(a), 2);
1516
- d && d.forEach((c) => {
1515
+ const c = t.vae.get(a) && X(t.vae.get(a), 2);
1516
+ c && c.forEach((d) => {
1517
1517
  var f, l, p;
1518
- const [y, b, _] = c, w = t.attrs[b];
1518
+ const [y, b, _] = d, w = t.attrs[b];
1519
1519
  (!s || !w || ((f = w["reverse-identity"]) === null || f === void 0 ? void 0 : f[1]) === s) && (oe(t.eav, [y, b, _]), oe(t.aev, [b, y, _]), oe(t.vae, [_, b, y])), w && w["on-delete"] === "cascade" && ((l = w["reverse-identity"]) === null || l === void 0 ? void 0 : l[1]) === s && dn(t, [y, (p = w["forward-identity"]) === null || p === void 0 ? void 0 : p[1]]);
1520
1520
  }), ((r = t.vae.get(a)) === null || r === void 0 ? void 0 : r.size) === 0 && oe(t.vae, [a]);
1521
1521
  }
1522
- function ki(t, e) {
1522
+ function ji(t, e) {
1523
1523
  const n = mi(t.attrs, e, t.useDateObjects);
1524
1524
  Object.keys(n).forEach((r) => {
1525
1525
  t[r] = n[r];
@@ -1535,17 +1535,17 @@ function lo(t, [e]) {
1535
1535
  if (!t.attrs[e])
1536
1536
  return;
1537
1537
  const n = Ci(t).filter(([r, i]) => i !== e);
1538
- delete t.attrs[e], qn(t), ki(t, n);
1538
+ delete t.attrs[e], qn(t), ji(t, n);
1539
1539
  }
1540
1540
  function ho(t, [e]) {
1541
1541
  const n = t.attrs[e.id];
1542
- n && (t.attrs[e.id] = Object.assign(Object.assign({}, n), e), qn(t), ki(t, Ci(t)));
1542
+ n && (t.attrs[e.id] = Object.assign(Object.assign({}, n), e), qn(t), ji(t, Ci(t)));
1543
1543
  }
1544
1544
  function po(t, e) {
1545
1545
  const [n, ...r] = e;
1546
1546
  switch (n) {
1547
1547
  case "add-triple":
1548
- ji(t, r);
1548
+ ki(t, r);
1549
1549
  break;
1550
1550
  case "deep-merge-triple":
1551
1551
  co(t, r);
@@ -1586,37 +1586,37 @@ function X(t, e, n = []) {
1586
1586
  return n;
1587
1587
  }
1588
1588
  function gt(t, e, n) {
1589
- var r, i;
1590
- const s = [];
1589
+ var r;
1590
+ const i = [];
1591
1591
  if (n != null && n.hasOwnProperty("$not")) {
1592
- for (const a of e.keys())
1593
- n.$not !== a && s.push(e.get(a));
1594
- return s;
1592
+ for (const o of e.keys())
1593
+ n.$not !== o && i.push(e.get(o));
1594
+ return i;
1595
1595
  }
1596
1596
  if (n != null && n.hasOwnProperty("$isNull")) {
1597
- const { attrId: a, isNull: u, reverse: d } = n.$isNull;
1598
- if (d)
1597
+ const { attrId: o, isNull: a, reverse: u } = n.$isNull;
1598
+ if (u)
1599
1599
  for (const c of e.keys()) {
1600
- const f = t.vae.get(c), l = !f || ((r = f.get(a)) === null || r === void 0 ? void 0 : r.get(null)) || !f.get(a);
1601
- (u ? l : !l) && s.push(e.get(c));
1600
+ const d = t.vae.get(c), f = !d || !d.get(o);
1601
+ (a ? f : !f) && i.push(e.get(c));
1602
1602
  }
1603
1603
  else {
1604
- const c = t.aev.get(a);
1605
- for (const f of e.keys()) {
1606
- const l = !c || ((i = c.get(f)) === null || i === void 0 ? void 0 : i.get(null)) || !c.get(f);
1607
- (u ? l : !l) && s.push(e.get(f));
1604
+ const c = t.aev.get(o);
1605
+ for (const d of e.keys()) {
1606
+ const f = !c || ((r = c.get(d)) === null || r === void 0 ? void 0 : r.get(null)) || !c.get(d);
1607
+ (a ? f : !f) && i.push(e.get(d));
1608
1608
  }
1609
1609
  }
1610
- return s;
1610
+ return i;
1611
1611
  }
1612
1612
  if (n != null && n.$comparator)
1613
1613
  return X(e, 1).filter(n.$op);
1614
- const o = n.in || n.$in || [n];
1615
- for (const a of o) {
1616
- const u = e.get(a);
1617
- u && s.push(u);
1614
+ const s = n.in || n.$in || [n];
1615
+ for (const o of s) {
1616
+ const a = e.get(o);
1617
+ a && i.push(a);
1618
1618
  }
1619
- return s;
1619
+ return i;
1620
1620
  }
1621
1621
  function yo(t, e, n) {
1622
1622
  let r = "";
@@ -1642,8 +1642,8 @@ function bo(t, [e, n, r]) {
1642
1642
  if (!a)
1643
1643
  return [];
1644
1644
  const u = [];
1645
- for (const d of a.values())
1646
- u.push(...gt(t, d, r));
1645
+ for (const c of a.values())
1646
+ u.push(...gt(t, c, r));
1647
1647
  return u;
1648
1648
  }
1649
1649
  case "a": {
@@ -1655,15 +1655,15 @@ function bo(t, [e, n, r]) {
1655
1655
  if (!a)
1656
1656
  return [];
1657
1657
  const u = [];
1658
- for (const d of a.values())
1659
- u.push(...gt(t, d, r));
1658
+ for (const c of a.values())
1659
+ u.push(...gt(t, c, r));
1660
1660
  return u;
1661
1661
  }
1662
1662
  case "v": {
1663
1663
  const a = [];
1664
1664
  for (const u of t.eav.values())
1665
- for (const d of u.values())
1666
- a.push(...gt(t, d, r));
1665
+ for (const c of u.values())
1666
+ a.push(...gt(t, c, r));
1667
1667
  return a;
1668
1668
  }
1669
1669
  default:
@@ -1675,8 +1675,8 @@ function _o(t, e, n) {
1675
1675
  const i = {};
1676
1676
  for (const [s, o] of e.entries()) {
1677
1677
  const a = (r = t.eav.get(n)) === null || r === void 0 ? void 0 : r.get(o.id), u = X(a, 1);
1678
- for (const d of u)
1679
- i[s] = d[2];
1678
+ for (const c of u)
1679
+ i[s] = c[2];
1680
1680
  }
1681
1681
  return i;
1682
1682
  }
@@ -1711,13 +1711,17 @@ function wo(t, e) {
1711
1711
  const u = a == null ? void 0 : a.mode;
1712
1712
  if (u !== "create" && u !== "update")
1713
1713
  return !0;
1714
- let d = !1;
1715
- const c = qe(t.attrs, s);
1716
- if (c) {
1717
- const f = Ii(t, c["forward-identity"][1]);
1718
- d = !!To(t, [i, f.id, i]);
1714
+ let c = !1;
1715
+ const d = qe(t.attrs, s);
1716
+ if (d) {
1717
+ const f = Ii(t, d["forward-identity"][1]);
1718
+ c = !!To(t, [
1719
+ i,
1720
+ f == null ? void 0 : f.id,
1721
+ i
1722
+ ]);
1719
1723
  }
1720
- return !(u === "create" && d || u === "update" && !d);
1724
+ return !(u === "create" && c || u === "update" && !c);
1721
1725
  });
1722
1726
  return Pt(t, (r) => {
1723
1727
  n.forEach((i) => {
@@ -1769,14 +1773,14 @@ function Ao(t, e, n) {
1769
1773
  return Mi(i, o, r);
1770
1774
  }, n);
1771
1775
  }
1772
- function jo(t, e, n) {
1776
+ function ko(t, e, n) {
1773
1777
  return Po(t, e, n).map((r) => Ao(e, r, n)).filter((r) => r);
1774
1778
  }
1775
- function ko(t, e, n) {
1776
- return e.or ? e.or.patterns.flatMap((r) => fn(t, r, n)) : e.and ? e.and.patterns.reduce((r, i) => fn(t, i, r), n) : n.flatMap((r) => jo(t, e, r));
1779
+ function jo(t, e, n) {
1780
+ return e.or ? e.or.patterns.flatMap((r) => fn(t, r, n)) : e.and ? e.and.patterns.reduce((r, i) => fn(t, i, r), n) : n.flatMap((r) => ko(t, e, r));
1777
1781
  }
1778
1782
  function fn(t, e, n = [{}]) {
1779
- return e.reduce((r, i) => ko(t, i, r), n);
1783
+ return e.reduce((r, i) => jo(t, i, r), n);
1780
1784
  }
1781
1785
  function Wn(t, e) {
1782
1786
  return Array.isArray(e) ? e.map((n) => Wn(t, n)) : mo(e) ? t[e] : e;
@@ -1818,7 +1822,7 @@ function Do(t, e, n) {
1818
1822
  throw new Error("Random bytes length must be >= 16");
1819
1823
  return r[6] = r[6] & 15 | 64, r[8] = r[8] & 63 | 128, Mo(r);
1820
1824
  }
1821
- function jr(t) {
1825
+ function kr(t) {
1822
1826
  const e = t.replace(/-/g, ""), n = [];
1823
1827
  for (let r = 0; r < e.length; r += 2)
1824
1828
  n.push(parseInt(e.substring(r, r + 2), 16));
@@ -1834,7 +1838,7 @@ function Uo(t, e) {
1834
1838
  return 0;
1835
1839
  }
1836
1840
  function Lo(t, e) {
1837
- return Uo(jr(t), jr(e));
1841
+ return Uo(kr(t), kr(e));
1838
1842
  }
1839
1843
  function K() {
1840
1844
  return Do();
@@ -1870,7 +1874,7 @@ function Wo(t, e) {
1870
1874
  throw new Ne(`Could not find id attr for ${e}`);
1871
1875
  return n;
1872
1876
  }
1873
- function kr(t, e, n, r) {
1877
+ function jr(t, e, n, r) {
1874
1878
  return [zo(t, e, n, r)];
1875
1879
  }
1876
1880
  function zo(t, e, n, r) {
@@ -1890,18 +1894,18 @@ function Ri(t, e, n, r, i) {
1890
1894
  throw new Ne(`Could not find attr for ${[n, i]}`);
1891
1895
  if (a["value-type"] !== "ref")
1892
1896
  throw new Error(`Attr ${a.id} is not a ref`);
1893
- const [u, d] = a["forward-identity"], [c, f] = a["reverse-identity"], l = r + 1, p = s ? [
1894
- t(d, r),
1897
+ const [u, c] = a["forward-identity"], [d, f] = a["reverse-identity"], l = r + 1, p = s ? [
1898
+ t(c, r),
1895
1899
  a.id,
1896
1900
  t(f, l),
1897
1901
  rt("time")
1898
1902
  ] : [
1899
- t(d, l),
1903
+ t(c, l),
1900
1904
  a.id,
1901
1905
  t(f, r),
1902
1906
  rt("time")
1903
1907
  ];
1904
- return [s ? f : d, l, p, a, !!s];
1908
+ return [s ? f : c, l, p, a, !!s];
1905
1909
  }
1906
1910
  function Cr(t, e) {
1907
1911
  if (typeof e != "string")
@@ -1978,12 +1982,12 @@ function Go(t, e, n, r, i, s) {
1978
1982
  if (!u)
1979
1983
  throw new Ne(`No attr for etype = ${n} label = ${i}`);
1980
1984
  if (s != null && s.hasOwnProperty("$isNull")) {
1981
- const d = Te(e, n, "id");
1982
- if (!d)
1985
+ const c = Te(e, n, "id");
1986
+ if (!c)
1983
1987
  throw new Ne(`No attr for etype = ${n} label = id`);
1984
1988
  return [
1985
1989
  t(n, r),
1986
- d.id,
1990
+ c.id,
1987
1991
  { $isNull: { attrId: u.id, isNull: s.$isNull, reverse: !o } },
1988
1992
  rt("time")
1989
1993
  ];
@@ -1996,15 +2000,15 @@ function Go(t, e, n, r, i, s) {
1996
2000
  ] : [s, u.id, t(n, r), rt("time")];
1997
2001
  }
1998
2002
  function Qo(t, e, n, r, i) {
1999
- const [s, o, a] = i.reduce((u, d) => {
2000
- const [c, f, l] = u, [p, y, b] = Ri(t, e, c, f, d);
2003
+ const [s, o, a] = i.reduce((u, c) => {
2004
+ const [d, f, l] = u, [p, y, b] = Ri(t, e, d, f, c);
2001
2005
  return [p, y, [...l, b]];
2002
2006
  }, [n, r, []]);
2003
2007
  return [s, o, a];
2004
2008
  }
2005
2009
  function ln(t, e, n, r, i, s) {
2006
- const o = i.slice(0, i.length - 1), a = i[i.length - 1], [u, d, c] = Qo(t, e, n, r, o), f = Go(t, e, u, d, a, s);
2007
- return c.concat([f]);
2010
+ const o = i.slice(0, i.length - 1), a = i[i.length - 1], [u, c, d] = Qo(t, e, n, r, o), f = Go(t, e, u, c, a, s);
2011
+ return d.concat([f]);
2008
2012
  }
2009
2013
  function Ho(t, e) {
2010
2014
  return e ? [e].concat(t) : t;
@@ -2022,9 +2026,9 @@ function Zo(t, e, n) {
2022
2026
  };
2023
2027
  }
2024
2028
  function Pr(t, e, n, r, i, s) {
2025
- const o = t(r, i), a = s.map((u, d) => {
2026
- const c = Zo(t, o, d);
2027
- return xi(c, n, r, i, u);
2029
+ const o = t(r, i), a = s.map((u, c) => {
2030
+ const d = Zo(t, o, c);
2031
+ return xi(d, n, r, i, u);
2028
2032
  });
2029
2033
  return { [e]: { patterns: a, joinSym: o } };
2030
2034
  }
@@ -2047,11 +2051,11 @@ function xi(t, e, n, r, i) {
2047
2051
  return [];
2048
2052
  const a = s.split(".");
2049
2053
  if (o != null && o.hasOwnProperty("$ne") && (o = Object.assign(Object.assign({}, o), { $not: o.$ne }), delete o.$ne), o != null && o.hasOwnProperty("$not")) {
2050
- const u = ln(t, e, n, r, a, o), d = Ir(t, e, n, r, a);
2054
+ const u = ln(t, e, n, r, a, o), c = Ir(t, e, n, r, a);
2051
2055
  return [
2052
2056
  {
2053
2057
  or: {
2054
- patterns: [u, ...d],
2058
+ patterns: [u, ...c],
2055
2059
  joinSym: t(n, r)
2056
2060
  }
2057
2061
  }
@@ -2069,18 +2073,18 @@ function xi(t, e, n, r, i) {
2069
2073
  }
2070
2074
  function ea(t, e, n, r) {
2071
2075
  const i = $t;
2072
- return r ? xi(i, t, e, n, r).concat(kr(i, t, e, n)) : kr(i, t, e, n);
2076
+ return r ? xi(i, t, e, n, r).concat(jr(i, t, e, n)) : jr(i, t, e, n);
2073
2077
  }
2074
2078
  function ta(t, e, n) {
2075
2079
  return [t(e, n), t("time", n)];
2076
2080
  }
2077
2081
  function na(t, e, n, r, i, s) {
2078
- const [o, a, u, d, c] = Ri(t, e, n, r, i), f = Vo(u, t(n, r), s);
2079
- return [o, a, f, d, c];
2082
+ const [o, a, u, c, d] = Ri(t, e, n, r, i), f = Vo(u, t(n, r), s);
2083
+ return [o, a, f, c, d];
2080
2084
  }
2081
2085
  function ra(t, e, { etype: n, level: r, form: i }, s) {
2082
2086
  const o = Object.keys(i).filter((a) => a !== "$");
2083
- return o.length ? Object.entries(s).map(function([u, d]) {
2087
+ return o.length ? Object.entries(s).map(function([u, c]) {
2084
2088
  return o.map(function(l) {
2085
2089
  var p, y, b;
2086
2090
  const _ = !!(e.cardinalityInference && (!((b = (y = (p = e.linkIndex) === null || p === void 0 ? void 0 : p[n]) === null || y === void 0 ? void 0 : y[l]) === null || b === void 0) && b.isSingular));
@@ -2099,7 +2103,7 @@ function ra(t, e, { etype: n, level: r, form: i }, s) {
2099
2103
  }
2100
2104
  }).reduce(function(l, p) {
2101
2105
  return Object.assign(Object.assign({}, l), p);
2102
- }, d);
2106
+ }, c);
2103
2107
  }) : Object.values(s);
2104
2108
  }
2105
2109
  function ia(t, e, n) {
@@ -2116,11 +2120,11 @@ function hn(t) {
2116
2120
  }
2117
2121
  function sa(t, e, n, r) {
2118
2122
  var i;
2119
- const [s, o, a, u] = t, d = n === "desc" ? 1 : -1;
2123
+ const [s, o, a, u] = t, c = n === "desc" ? 1 : -1;
2120
2124
  if (((i = e["forward-identity"]) === null || i === void 0 ? void 0 : i[2]) === "id")
2121
- return It(r, [s, u], null) === d;
2122
- const [c, f] = r, l = e["checked-data-type"], p = l === "date" ? hn(f) : f, y = l === "date" ? hn(a) : a;
2123
- return It([c, p], [s, y], l) === d;
2125
+ return It(r, [s, u], null) === c;
2126
+ const [d, f] = r, l = e["checked-data-type"], p = l === "date" ? hn(f) : f, y = l === "date" ? hn(a) : a;
2127
+ return It([d, p], [s, y], l) === c;
2124
2128
  }
2125
2129
  function oa(t, e) {
2126
2130
  const n = e[1];
@@ -2153,27 +2157,27 @@ function ca(t, e, n) {
2153
2157
  }
2154
2158
  function da(t, { etype: e, pageInfo: n, dq: r, form: i }) {
2155
2159
  var s, o;
2156
- const a = (s = i == null ? void 0 : i.$) === null || s === void 0 ? void 0 : s.order, u = $i(i), d = fa(i);
2157
- let c = Co(t, r);
2160
+ const a = (s = i == null ? void 0 : i.$) === null || s === void 0 ? void 0 : s.order, u = $i(i), c = fa(i);
2161
+ let d = Co(t, r);
2158
2162
  const f = n == null ? void 0 : n["start-cursor"], l = ua(t, e, f, a);
2159
2163
  if (l && ((o = l == null ? void 0 : l["forward-identity"]) === null || o === void 0 ? void 0 : o[2]) !== "id") {
2160
2164
  const b = l["checked-data-type"] === "date", _ = l.id;
2161
- c = c.map(([w]) => {
2165
+ d = d.map(([w]) => {
2162
2166
  var g, m, E, S, I;
2163
2167
  let x = (I = (S = (E = (m = (g = t.eav.get(w)) === null || g === void 0 ? void 0 : g.get(_)) === null || m === void 0 ? void 0 : m.values()) === null || E === void 0 ? void 0 : E.next()) === null || S === void 0 ? void 0 : S.value) === null || I === void 0 ? void 0 : I[2];
2164
2168
  return b && (x = hn(x)), [w, x];
2165
2169
  });
2166
2170
  }
2167
- c.sort(d === "asc" ? function(_, w) {
2171
+ d.sort(c === "asc" ? function(_, w) {
2168
2172
  return It(_, w, l == null ? void 0 : l["checked-data-type"]);
2169
2173
  } : function(_, w) {
2170
2174
  return It(w, _, l == null ? void 0 : l["checked-data-type"]);
2171
2175
  });
2172
2176
  let p = {};
2173
2177
  const y = ca(t, e, r);
2174
- for (const b of c) {
2178
+ for (const b of d) {
2175
2179
  const [_] = b;
2176
- if (p[_] || !u && f && l && sa(f, l, d, b))
2180
+ if (p[_] || !u && f && l && sa(f, l, c, b))
2177
2181
  continue;
2178
2182
  const w = _o(t, y, _);
2179
2183
  w && (p[_] = w);
@@ -2191,7 +2195,7 @@ function $i(t) {
2191
2195
  return !i && !s && !o;
2192
2196
  }
2193
2197
  function la(t, { etype: e, level: n, form: r, join: i, pageInfo: s }) {
2194
- var o, a, u, d, c;
2198
+ var o, a, u, c, d;
2195
2199
  if (!$i(r) && (!s || !s["start-cursor"]))
2196
2200
  return [];
2197
2201
  const f = Ho(ea(t, e, n, (o = r.$) === null || o === void 0 ? void 0 : o.where), i), l = ta($t, e, n), p = (a = r.$) === null || a === void 0 ? void 0 : a.fields, y = da(t, {
@@ -2199,7 +2203,7 @@ function la(t, { etype: e, level: n, form: r, join: i, pageInfo: s }) {
2199
2203
  pageInfo: s,
2200
2204
  form: r,
2201
2205
  dq: { where: f, find: l, fields: p }
2202
- }), b = ((u = r.$) === null || u === void 0 ? void 0 : u.limit) || ((d = r.$) === null || d === void 0 ? void 0 : d.first) || ((c = r.$) === null || c === void 0 ? void 0 : c.last);
2206
+ }), b = ((u = r.$) === null || u === void 0 ? void 0 : u.limit) || ((c = r.$) === null || c === void 0 ? void 0 : c.first) || ((d = r.$) === null || d === void 0 ? void 0 : d.last);
2203
2207
  if (b != null) {
2204
2208
  n > 0 && console.warn("WARNING: Limits in child queries are only run client-side. Data returned from the server will not have a limit.");
2205
2209
  const _ = Object.entries(y);
@@ -2316,8 +2320,8 @@ function Ta(t, e) {
2316
2320
  if (a)
2317
2321
  i.push(a);
2318
2322
  else if (Array.isArray(o) && o.length == 2 && n[o[0]]) {
2319
- const [u, d] = o;
2320
- i.push([n[u], d]);
2323
+ const [u, c] = o;
2324
+ i.push([n[u], c]);
2321
2325
  } else
2322
2326
  i.push(o);
2323
2327
  }
@@ -2393,16 +2397,16 @@ function Fi(t, e, n, r) {
2393
2397
  }
2394
2398
  function va({ attrs: t }, [e, n, r]) {
2395
2399
  const i = Object.entries(r).flatMap(([s, o]) => {
2396
- const a = Array.isArray(o) ? o : [o], u = V(t, e, s), d = Ae(t, e, s);
2397
- return a.map((c) => u ? [
2400
+ const a = Array.isArray(o) ? o : [o], u = V(t, e, s), c = Ae(t, e, s);
2401
+ return a.map((d) => u ? [
2398
2402
  "add-triple",
2399
2403
  ee(t, e, n),
2400
2404
  u.id,
2401
- ee(t, u["reverse-identity"][1], c)
2405
+ ee(t, u["reverse-identity"][1], d)
2402
2406
  ] : [
2403
2407
  "add-triple",
2404
- ee(t, d["forward-identity"][1], c),
2405
- d.id,
2408
+ ee(t, c["forward-identity"][1], d),
2409
+ c.id,
2406
2410
  ee(t, e, n)
2407
2411
  ]);
2408
2412
  });
@@ -2410,16 +2414,16 @@ function va({ attrs: t }, [e, n, r]) {
2410
2414
  }
2411
2415
  function Sa({ attrs: t }, [e, n, r]) {
2412
2416
  const i = Object.entries(r).flatMap(([s, o]) => {
2413
- const a = Array.isArray(o) ? o : [o], u = V(t, e, s), d = Ae(t, e, s);
2414
- return a.map((c) => u ? [
2417
+ const a = Array.isArray(o) ? o : [o], u = V(t, e, s), c = Ae(t, e, s);
2418
+ return a.map((d) => u ? [
2415
2419
  "retract-triple",
2416
2420
  ee(t, e, n),
2417
2421
  u.id,
2418
- ee(t, u["reverse-identity"][1], c)
2422
+ ee(t, u["reverse-identity"][1], d)
2419
2423
  ] : [
2420
2424
  "retract-triple",
2421
- ee(t, d["forward-identity"][1], c),
2422
- d.id,
2425
+ ee(t, c["forward-identity"][1], d),
2426
+ c.id,
2423
2427
  ee(t, e, n)
2424
2428
  ]);
2425
2429
  });
@@ -2431,8 +2435,8 @@ function Oa(t, e, n) {
2431
2435
  for (const s of t || []) {
2432
2436
  const o = s == null ? void 0 : s.aev.get(r);
2433
2437
  if (o) {
2434
- for (const [a, u, d] of X(o, 2))
2435
- if (d === i)
2438
+ for (const [a, u, c] of X(o, 2))
2439
+ if (c === i)
2436
2440
  return !0;
2437
2441
  }
2438
2442
  }
@@ -2451,45 +2455,45 @@ function Ni({ stores: t, attrs: e }, [n, r, i, s]) {
2451
2455
  return (s == null ? void 0 : s.upsert) === !1 ? { mode: "update" } : (s == null ? void 0 : s.upsert) === !0 ? null : Oa(t, n, r) ? { mode: "update" } : null;
2452
2456
  }
2453
2457
  function Ea(t, e) {
2454
- const { stores: n, attrs: r } = t, [i, s, o, a] = e, u = Fn(o), d = ee(r, i, s);
2455
- return [["id", d]].concat(Object.entries(u)).map(([f, l]) => {
2458
+ const { stores: n, attrs: r } = t, [i, s, o, a] = e, u = Fn(o), c = ee(r, i, s);
2459
+ return [["id", c]].concat(Object.entries(u)).map(([f, l]) => {
2456
2460
  const p = V(r, i, f);
2457
- return p["checked-data-type"] === "date" && t.useDateObjects && (l = xt(l)), ["add-triple", d, p.id, l, { mode: "create" }];
2461
+ return p["checked-data-type"] === "date" && t.useDateObjects && (l = xt(l)), ["add-triple", c, p.id, l, { mode: "create" }];
2458
2462
  });
2459
2463
  }
2460
2464
  function Aa(t, e) {
2461
- const { stores: n, attrs: r } = t, [i, s, o, a] = e, u = Fn(o), d = ee(r, i, s), c = Ni(t, [i, d, o, a]);
2462
- return [["id", d]].concat(Object.entries(u)).map(([l, p]) => {
2465
+ const { stores: n, attrs: r } = t, [i, s, o, a] = e, u = Fn(o), c = ee(r, i, s), d = Ni(t, [i, c, o, a]);
2466
+ return [["id", c]].concat(Object.entries(u)).map(([l, p]) => {
2463
2467
  const y = V(r, i, l);
2464
2468
  return y["checked-data-type"] === "date" && t.useDateObjects && (p = xt(p)), [
2465
2469
  "add-triple",
2466
- d,
2470
+ c,
2467
2471
  y.id,
2468
2472
  p,
2469
- ...c ? [c] : []
2473
+ ...d ? [d] : []
2470
2474
  ];
2471
2475
  });
2472
2476
  }
2473
- function ja({ attrs: t }, [e, n]) {
2477
+ function ka({ attrs: t }, [e, n]) {
2474
2478
  return [["delete-entity", ee(t, e, n), e]];
2475
2479
  }
2476
- function ka(t, e) {
2477
- const { stores: n, attrs: r } = t, [i, s, o, a] = e, u = Fn(o), d = ee(r, i, s), c = Ni(t, [i, d, o, a]), f = Object.entries(u).map(([p, y]) => {
2480
+ function ja(t, e) {
2481
+ const { stores: n, attrs: r } = t, [i, s, o, a] = e, u = Fn(o), c = ee(r, i, s), d = Ni(t, [i, c, o, a]), f = Object.entries(u).map(([p, y]) => {
2478
2482
  const b = V(r, i, p);
2479
2483
  return [
2480
2484
  "deep-merge-triple",
2481
- d,
2485
+ c,
2482
2486
  b.id,
2483
2487
  y,
2484
- ...c ? [c] : []
2488
+ ...d ? [d] : []
2485
2489
  ];
2486
2490
  });
2487
2491
  return [[
2488
2492
  "add-triple",
2489
- d,
2493
+ c,
2490
2494
  V(r, i, "id").id,
2491
- d,
2492
- ...c ? [c] : []
2495
+ c,
2496
+ ...d ? [d] : []
2493
2497
  ]].concat(f);
2494
2498
  }
2495
2499
  function Ca({ attrs: t }, [e, n, r]) {
@@ -2506,7 +2510,7 @@ function Ia(t, e) {
2506
2510
  const [n, ...r] = Pa(e);
2507
2511
  switch (n) {
2508
2512
  case "merge":
2509
- return ka(t, r);
2513
+ return ja(t, r);
2510
2514
  case "create":
2511
2515
  return Ea(t, r);
2512
2516
  case "update":
@@ -2516,7 +2520,7 @@ function Ia(t, e) {
2516
2520
  case "unlink":
2517
2521
  return Sa(t, r);
2518
2522
  case "delete":
2519
- return ja(t, r);
2523
+ return ka(t, r);
2520
2524
  case "ruleParams":
2521
2525
  return Ca(t, r);
2522
2526
  default:
@@ -2589,9 +2593,9 @@ function Ka(t) {
2589
2593
  const o = _n(i);
2590
2594
  if (o && e.push({ etype: r, lookupPair: o }), n === "link")
2591
2595
  for (const [a, u] of Object.entries(s)) {
2592
- const d = Array.isArray(u) ? u : [u];
2593
- for (const c of d) {
2594
- const f = _n(c);
2596
+ const c = Array.isArray(u) ? u : [u];
2597
+ for (const d of c) {
2598
+ const f = _n(d);
2595
2599
  f && e.push({
2596
2600
  etype: r,
2597
2601
  lookupPair: f,
@@ -2607,44 +2611,44 @@ function qa({ attrs: t, schema: e }, n) {
2607
2611
  function u(f) {
2608
2612
  o[f.id] = f, a.push(["add-attr", f]), s.add(f.id);
2609
2613
  }
2610
- function d(f) {
2614
+ function c(f) {
2611
2615
  f != null && f.isUnsynced && !s.has(f.id) && (a.push(["add-attr", f]), s.add(f.id));
2612
2616
  }
2613
- function c(f, l) {
2617
+ function d(f, l) {
2614
2618
  const p = V(o, f, l), y = Ae(o, f, l);
2615
- d(p), d(y), !p && !y && u(Mr(e, f, l, Na));
2619
+ c(p), c(y), !p && !y && u(Mr(e, f, l, Na));
2616
2620
  }
2617
2621
  for (const f of n)
2618
2622
  for (const { etype: l, lookupPair: p, linkLabel: y } of Ka(f)) {
2619
2623
  const b = p[0];
2620
2624
  if (y) {
2621
- c(l, y);
2625
+ d(l, y);
2622
2626
  const _ = V(o, l, y), w = Ae(o, l, y);
2623
- d(_), d(w);
2627
+ c(_), c(w);
2624
2628
  const g = ((r = _ == null ? void 0 : _["reverse-identity"]) === null || r === void 0 ? void 0 : r[1]) || ((i = w == null ? void 0 : w["forward-identity"]) === null || i === void 0 ? void 0 : i[1]) || y;
2625
2629
  if (yn(o, g, b))
2626
- c(g, bn(b));
2630
+ d(g, bn(b));
2627
2631
  else {
2628
2632
  const m = V(o, g, b);
2629
- m || u(Tt(e, g, b, gn)), d(m);
2633
+ m || u(Tt(e, g, b, gn)), c(m);
2630
2634
  }
2631
2635
  } else if (yn(o, l, b))
2632
- c(l, bn(b));
2636
+ d(l, bn(b));
2633
2637
  else {
2634
2638
  const _ = V(o, l, b);
2635
- _ || u(Tt(e, l, b, gn)), d(_);
2639
+ _ || u(Tt(e, l, b, gn)), c(_);
2636
2640
  }
2637
2641
  }
2638
2642
  for (const f of n) {
2639
2643
  const [l, p, y, b] = f;
2640
2644
  if (Da.has(l)) {
2641
2645
  const _ = V(o, p, "id");
2642
- d(_), _ || u(Tt(e, p, "id", { "unique?": !0 }));
2646
+ c(_), _ || u(Tt(e, p, "id", { "unique?": !0 }));
2643
2647
  for (const w of Object.keys(b)) {
2644
2648
  const g = V(o, p, w);
2645
- if (d(g), La.has(l) && (g || u(Tt(e, p, w, w === "id" ? { "unique?": !0 } : null))), Ua.has(l)) {
2649
+ if (c(g), La.has(l) && (g || u(Tt(e, p, w, w === "id" ? { "unique?": !0 } : null))), Ua.has(l)) {
2646
2650
  const m = Ae(o, p, w);
2647
- !g && !m && u(Mr(e, p, w)), d(m);
2651
+ !g && !m && u(Mr(e, p, w)), c(m);
2648
2652
  }
2649
2653
  }
2650
2654
  }
@@ -2662,24 +2666,24 @@ var de = function(t, e, n, r) {
2662
2666
  });
2663
2667
  }
2664
2668
  return new (n || (n = Promise))(function(s, o) {
2665
- function a(c) {
2669
+ function a(d) {
2666
2670
  try {
2667
- d(r.next(c));
2671
+ c(r.next(d));
2668
2672
  } catch (f) {
2669
2673
  o(f);
2670
2674
  }
2671
2675
  }
2672
- function u(c) {
2676
+ function u(d) {
2673
2677
  try {
2674
- d(r.throw(c));
2678
+ c(r.throw(d));
2675
2679
  } catch (f) {
2676
2680
  o(f);
2677
2681
  }
2678
2682
  }
2679
- function d(c) {
2680
- c.done ? s(c.value) : i(c.value).then(a, u);
2683
+ function c(d) {
2684
+ d.done ? s(d.value) : i(d.value).then(a, u);
2681
2685
  }
2682
- d((r = r.apply(t, e || [])).next());
2686
+ c((r = r.apply(t, e || [])).next());
2683
2687
  });
2684
2688
  };
2685
2689
  function Rr(t, e) {
@@ -2802,12 +2806,12 @@ class Tn {
2802
2806
  const y = this._persister.removeItem(p);
2803
2807
  i.push(y.then(() => 1)), this._loadedKeys.delete(p), this._pendingSaveKeys.delete(p);
2804
2808
  }
2805
- const d = [], c = [[it, o]], f = (n = o.objects) !== null && n !== void 0 ? n : {};
2809
+ const c = [], d = [[it, o]], f = (n = o.objects) !== null && n !== void 0 ? n : {};
2806
2810
  o.objects = f;
2807
2811
  for (const p of u)
2808
2812
  if (this._loadedKeys.has(p)) {
2809
2813
  const y = this.serialize(p, this.currentValue[p]);
2810
- c.push([p, y]);
2814
+ d.push([p, y]);
2811
2815
  const b = this._objectSize(y), _ = (r = f[p]) !== null && r !== void 0 ? r : {
2812
2816
  createdAt: Date.now(),
2813
2817
  updatedAt: Date.now(),
@@ -2815,10 +2819,10 @@ class Tn {
2815
2819
  };
2816
2820
  _.updatedAt = Date.now(), _.size = b, f[p] = _, this._pendingSaveKeys.delete(p);
2817
2821
  } else
2818
- d.push(p);
2819
- const l = this._persister.multiSet(c);
2822
+ c.push(p);
2823
+ const l = this._persister.multiSet(d);
2820
2824
  i.push(l.then(() => 1));
2821
- for (const p of d) {
2825
+ for (const p of c) {
2822
2826
  const y = this._loadKey(p).then(() => this._enqueuePersist(e));
2823
2827
  i.push(y);
2824
2828
  }
@@ -2867,12 +2871,12 @@ class Tn {
2867
2871
  if (a.length > this._gcOpts.maxEntries)
2868
2872
  for (const [l] of u.slice(0, a.length - this._gcOpts.maxEntries))
2869
2873
  i.push(this._persister.removeItem(l)), delete r.objects[l], s.removed.push(l), s.removedThresholdCount++;
2870
- const d = Object.entries(r.objects);
2871
- d.sort(([l, p], [y, b]) => p.updatedAt - b.updatedAt);
2872
- const c = d.filter(([l]) => !n.has(l));
2873
- let f = d.reduce((l, [p, y]) => l + y.size, 0);
2874
- for (; f > 0 && f > this._gcOpts.maxSize && c.length; ) {
2875
- const [[l, p]] = c.splice(0, 1);
2874
+ const c = Object.entries(r.objects);
2875
+ c.sort(([l, p], [y, b]) => p.updatedAt - b.updatedAt);
2876
+ const d = c.filter(([l]) => !n.has(l));
2877
+ let f = c.reduce((l, [p, y]) => l + y.size, 0);
2878
+ for (; f > 0 && f > this._gcOpts.maxSize && d.length; ) {
2879
+ const [[l, p]] = d.splice(0, 1);
2876
2880
  f -= p.size, i.push(this._persister.removeItem(l)), delete r.objects[l], s.removed.push(l), s.removedSizeCount++;
2877
2881
  }
2878
2882
  for (const l of Object.keys(r.objects))
@@ -2938,24 +2942,24 @@ var pe = function(t, e, n, r) {
2938
2942
  });
2939
2943
  }
2940
2944
  return new (n || (n = Promise))(function(s, o) {
2941
- function a(c) {
2945
+ function a(d) {
2942
2946
  try {
2943
- d(r.next(c));
2947
+ c(r.next(d));
2944
2948
  } catch (f) {
2945
2949
  o(f);
2946
2950
  }
2947
2951
  }
2948
- function u(c) {
2952
+ function u(d) {
2949
2953
  try {
2950
- d(r.throw(c));
2954
+ c(r.throw(d));
2951
2955
  } catch (f) {
2952
2956
  o(f);
2953
2957
  }
2954
2958
  }
2955
- function d(c) {
2956
- c.done ? s(c.value) : i(c.value).then(a, u);
2959
+ function c(d) {
2960
+ d.done ? s(d.value) : i(d.value).then(a, u);
2957
2961
  }
2958
- d((r = r.apply(t, e || [])).next());
2962
+ c((r = r.apply(t, e || [])).next());
2959
2963
  });
2960
2964
  };
2961
2965
  const Va = 6, Ba = ["kv", "querySubs", "syncSubs"];
@@ -2990,7 +2994,7 @@ function Ha(t, e, n) {
2990
2994
  return;
2991
2995
  const i = /* @__PURE__ */ new Set();
2992
2996
  return new Promise((s, o) => {
2993
- var a, u, d, c;
2997
+ var a, u, c, d;
2994
2998
  const f = {};
2995
2999
  for (const [y, b] of Object.entries(r)) {
2996
3000
  const _ = typeof b == "string" ? JSON.parse(b) : b;
@@ -2998,7 +3002,7 @@ function Ha(t, e, n) {
2998
3002
  const g = {
2999
3003
  createdAt: _.lastAccessed,
3000
3004
  updatedAt: _.lastAccessed,
3001
- size: (c = (d = (u = (a = _.result) === null || a === void 0 ? void 0 : a.store) === null || u === void 0 ? void 0 : u.triples) === null || d === void 0 ? void 0 : d.length) !== null && c !== void 0 ? c : 0
3005
+ size: (d = (c = (u = (a = _.result) === null || a === void 0 ? void 0 : a.store) === null || u === void 0 ? void 0 : u.triples) === null || c === void 0 ? void 0 : c.length) !== null && d !== void 0 ? d : 0
3002
3006
  };
3003
3007
  f[y] = g;
3004
3008
  }
@@ -3029,7 +3033,7 @@ function Ya(t, e) {
3029
3033
  const n = yield Qa(`instant_${t}_5`);
3030
3034
  if (!n)
3031
3035
  return;
3032
- const r = yield new Promise((c, f) => {
3036
+ const r = yield new Promise((d, f) => {
3033
3037
  const y = n.transaction(["kv"], "readonly").objectStore("kv").openCursor();
3034
3038
  y.onerror = (_) => {
3035
3039
  f(_);
@@ -3041,33 +3045,33 @@ function Ya(t, e) {
3041
3045
  const w = _.key, g = _.value;
3042
3046
  b.push([w, g]), _.continue();
3043
3047
  } else
3044
- c(b);
3048
+ d(b);
3045
3049
  }, y.onerror = (_) => {
3046
3050
  f(_);
3047
3051
  };
3048
3052
  }), i = e.transaction(["kv", "querySubs"], "readwrite"), s = i.objectStore("kv"), o = i.objectStore("querySubs"), a = [], u = { objects: {} };
3049
- for (const [c, f] of r)
3050
- switch (c) {
3053
+ for (const [d, f] of r)
3054
+ switch (d) {
3051
3055
  case "querySubs": {
3052
- const l = Ha(c, f, o);
3056
+ const l = Ha(d, f, o);
3053
3057
  a.push(l);
3054
3058
  break;
3055
3059
  }
3056
3060
  default: {
3057
- const l = xr(c, f, s);
3061
+ const l = xr(d, f, s);
3058
3062
  a.push(l);
3059
3063
  const p = {
3060
3064
  createdAt: Date.now(),
3061
3065
  updatedAt: Date.now(),
3062
3066
  size: 0
3063
3067
  };
3064
- u.objects[c] = p;
3068
+ u.objects[d] = p;
3065
3069
  break;
3066
3070
  }
3067
3071
  }
3068
- const d = xr(it, u, s);
3069
- a.push(d), yield Promise.all(a), yield new Promise((c, f) => {
3070
- i.oncomplete = (l) => c(l), i.onerror = (l) => f(l), i.onabort = (l) => f(l);
3072
+ const c = xr(it, u, s);
3073
+ a.push(c), yield Promise.all(a), yield new Promise((d, f) => {
3074
+ i.oncomplete = (l) => d(l), i.onerror = (l) => f(l), i.onabort = (l) => f(l);
3071
3075
  });
3072
3076
  });
3073
3077
  }
@@ -3085,8 +3089,8 @@ class Ki extends za {
3085
3089
  }, i.onsuccess = (s) => {
3086
3090
  const a = s.target.result;
3087
3091
  if (r) {
3088
- const u = Ya(this._appId, a).catch((d) => {
3089
- Ga("Error upgrading store from version 5 to 6.")(d);
3092
+ const u = Ya(this._appId, a).catch((c) => {
3093
+ Ga("Error upgrading store from version 5 to 6.")(c);
3090
3094
  });
3091
3095
  $r.set(this.dbName, u), u.then(() => e(a)).catch(() => e(a));
3092
3096
  } else {
@@ -3121,9 +3125,9 @@ class Ki extends za {
3121
3125
  const r = yield this._dbPromise;
3122
3126
  return new Promise((i, s) => {
3123
3127
  const u = r.transaction([this._storeName], "readwrite").objectStore(this._storeName).put(n, e);
3124
- u.onerror = (d) => {
3125
- s(d);
3126
- }, u.onsuccess = (d) => {
3128
+ u.onerror = (c) => {
3129
+ s(c);
3130
+ }, u.onsuccess = (c) => {
3127
3131
  i();
3128
3132
  };
3129
3133
  });
@@ -3135,14 +3139,14 @@ class Ki extends za {
3135
3139
  const n = yield this._dbPromise;
3136
3140
  return new Promise((r, i) => {
3137
3141
  const s = n.transaction([this._storeName], "readwrite"), o = s.objectStore(this._storeName), a = /* @__PURE__ */ new Set();
3138
- for (const [u, d] of e) {
3139
- const c = o.put(d, u);
3140
- a.add(c);
3142
+ for (const [u, c] of e) {
3143
+ const d = o.put(c, u);
3144
+ a.add(d);
3141
3145
  }
3142
3146
  for (const u of a)
3143
- u.onerror = (d) => {
3144
- s.abort(), i(d);
3145
- }, u.onsuccess = (d) => {
3147
+ u.onerror = (c) => {
3148
+ s.abort(), i(c);
3149
+ }, u.onsuccess = (c) => {
3146
3150
  a.delete(u), a.size === 0 && r();
3147
3151
  };
3148
3152
  });
@@ -3182,24 +3186,24 @@ var Ja = function(t, e, n, r) {
3182
3186
  });
3183
3187
  }
3184
3188
  return new (n || (n = Promise))(function(s, o) {
3185
- function a(c) {
3189
+ function a(d) {
3186
3190
  try {
3187
- d(r.next(c));
3191
+ c(r.next(d));
3188
3192
  } catch (f) {
3189
3193
  o(f);
3190
3194
  }
3191
3195
  }
3192
- function u(c) {
3196
+ function u(d) {
3193
3197
  try {
3194
- d(r.throw(c));
3198
+ c(r.throw(d));
3195
3199
  } catch (f) {
3196
3200
  o(f);
3197
3201
  }
3198
3202
  }
3199
- function d(c) {
3200
- c.done ? s(c.value) : i(c.value).then(a, u);
3203
+ function c(d) {
3204
+ d.done ? s(d.value) : i(d.value).then(a, u);
3201
3205
  }
3202
- d((r = r.apply(t, e || [])).next());
3206
+ c((r = r.apply(t, e || [])).next());
3203
3207
  });
3204
3208
  };
3205
3209
  class qi {
@@ -3236,24 +3240,24 @@ var Za = function(t, e, n, r) {
3236
3240
  });
3237
3241
  }
3238
3242
  return new (n || (n = Promise))(function(s, o) {
3239
- function a(c) {
3243
+ function a(d) {
3240
3244
  try {
3241
- d(r.next(c));
3245
+ c(r.next(d));
3242
3246
  } catch (f) {
3243
3247
  o(f);
3244
3248
  }
3245
3249
  }
3246
- function u(c) {
3250
+ function u(d) {
3247
3251
  try {
3248
- d(r.throw(c));
3252
+ c(r.throw(d));
3249
3253
  } catch (f) {
3250
3254
  o(f);
3251
3255
  }
3252
3256
  }
3253
- function d(c) {
3254
- c.done ? s(c.value) : i(c.value).then(a, u);
3257
+ function c(d) {
3258
+ d.done ? s(d.value) : i(d.value).then(a, u);
3255
3259
  }
3256
- d((r = r.apply(t, e || [])).next());
3260
+ c((r = r.apply(t, e || [])).next());
3257
3261
  });
3258
3262
  };
3259
3263
  class Dt extends Ke {
@@ -3281,24 +3285,24 @@ var ze = function(t, e, n, r) {
3281
3285
  });
3282
3286
  }
3283
3287
  return new (n || (n = Promise))(function(s, o) {
3284
- function a(c) {
3288
+ function a(d) {
3285
3289
  try {
3286
- d(r.next(c));
3290
+ c(r.next(d));
3287
3291
  } catch (f) {
3288
3292
  o(f);
3289
3293
  }
3290
3294
  }
3291
- function u(c) {
3295
+ function u(d) {
3292
3296
  try {
3293
- d(r.throw(c));
3297
+ c(r.throw(d));
3294
3298
  } catch (f) {
3295
3299
  o(f);
3296
3300
  }
3297
3301
  }
3298
- function d(c) {
3299
- c.done ? s(c.value) : i(c.value).then(a, u);
3302
+ function c(d) {
3303
+ d.done ? s(d.value) : i(d.value).then(a, u);
3300
3304
  }
3301
- d((r = r.apply(t, e || [])).next());
3305
+ c((r = r.apply(t, e || [])).next());
3302
3306
  });
3303
3307
  };
3304
3308
  function Xa({ apiURI: t, appId: e, email: n }) {
@@ -3394,24 +3398,24 @@ var ft = function(t, e, n, r) {
3394
3398
  });
3395
3399
  }
3396
3400
  return new (n || (n = Promise))(function(s, o) {
3397
- function a(c) {
3401
+ function a(d) {
3398
3402
  try {
3399
- d(r.next(c));
3403
+ c(r.next(d));
3400
3404
  } catch (f) {
3401
3405
  o(f);
3402
3406
  }
3403
3407
  }
3404
- function u(c) {
3408
+ function u(d) {
3405
3409
  try {
3406
- d(r.throw(c));
3410
+ c(r.throw(d));
3407
3411
  } catch (f) {
3408
3412
  o(f);
3409
3413
  }
3410
3414
  }
3411
- function d(c) {
3412
- c.done ? s(c.value) : i(c.value).then(a, u);
3415
+ function c(d) {
3416
+ d.done ? s(d.value) : i(d.value).then(a, u);
3413
3417
  }
3414
- d((r = r.apply(t, e || [])).next());
3418
+ c((r = r.apply(t, e || [])).next());
3415
3419
  });
3416
3420
  };
3417
3421
  function su(t) {
@@ -3500,10 +3504,10 @@ function du(t, e, n) {
3500
3504
  s.user = Object.assign(Object.assign({}, a), { peerId: n });
3501
3505
  }
3502
3506
  for (const a of Object.keys((i = t.peers) !== null && i !== void 0 ? i : {})) {
3503
- const u = (e == null ? void 0 : e.peers) === void 0, d = Array.isArray(e == null ? void 0 : e.peers) && (e == null ? void 0 : e.peers.includes(a));
3504
- if (u || d) {
3505
- const c = Ur(t.peers[a], e == null ? void 0 : e.keys);
3506
- s.peers[a] = Object.assign(Object.assign({}, c), { peerId: a });
3507
+ const u = (e == null ? void 0 : e.peers) === void 0, c = Array.isArray(e == null ? void 0 : e.peers) && (e == null ? void 0 : e.peers.includes(a));
3508
+ if (u || c) {
3509
+ const d = Ur(t.peers[a], e == null ? void 0 : e.keys);
3510
+ s.peers[a] = Object.assign(Object.assign({}, d), { peerId: a });
3507
3511
  }
3508
3512
  }
3509
3513
  return s;
@@ -3556,7 +3560,7 @@ function Nr(t) {
3556
3560
  }, e;
3557
3561
  }, {});
3558
3562
  }
3559
- const Bn = "v0.22.83";
3563
+ const Bn = "v0.22.84-experimental.trackqueryhash.20082268843.1";
3560
3564
  function lu(t, e) {
3561
3565
  return {
3562
3566
  info: t ? (...n) => console.info(...n, e()) : () => {
@@ -3657,17 +3661,17 @@ const Kr = [
3657
3661
  return !0;
3658
3662
  }
3659
3663
  }, pu = (t, e, n, r, i, s, o) => {
3660
- const a = s.valueType === "json", u = (d, c, f) => {
3661
- if (!Bi(f, c, a))
3662
- throw new R(`Invalid value for operator '${d}' on attribute '${r}' in entity '${i}'. Expected ${c}, but received: ${typeof f}`, o);
3664
+ const a = s.valueType === "json", u = (c, d, f) => {
3665
+ if (!Bi(f, d, a))
3666
+ throw new R(`Invalid value for operator '${c}' on attribute '${r}' in entity '${i}'. Expected ${d}, but received: ${typeof f}`, o);
3663
3667
  };
3664
3668
  switch (t) {
3665
3669
  case "in":
3666
3670
  case "$in":
3667
3671
  if (!Array.isArray(e))
3668
3672
  throw new R(`Operator '${t}' for attribute '${r}' in entity '${i}' must be an array, but received: ${typeof e}`, o);
3669
- for (const d of e)
3670
- u(t, n, d);
3673
+ for (const c of e)
3674
+ u(t, n, c);
3671
3675
  break;
3672
3676
  case "$not":
3673
3677
  case "$ne":
@@ -3694,8 +3698,8 @@ const Kr = [
3694
3698
  if (o)
3695
3699
  return;
3696
3700
  const u = t;
3697
- for (const [d, c] of Object.entries(u))
3698
- pu(d, c, s, e, r, n, `${i}.${d}`);
3701
+ for (const [c, d] of Object.entries(u))
3702
+ pu(c, d, s, e, r, n, `${i}.${c}`);
3699
3703
  } else if (!Bi(t, s, o))
3700
3704
  throw new R(`Invalid value for attribute '${e}' in entity '${r}'. Expected ${s}, but received: ${typeof t}`, i);
3701
3705
  }, yu = (t, e, n, r, i) => {
@@ -3703,8 +3707,8 @@ const Kr = [
3703
3707
  if (s.length < 2)
3704
3708
  throw new R(`Invalid dot notation path '${t}'. Must contain at least one dot.`, i);
3705
3709
  let o = n;
3706
- for (let c = 0; c < s.length - 1; c++) {
3707
- const f = s[c], l = r.entities[o];
3710
+ for (let d = 0; d < s.length - 1; d++) {
3711
+ const f = s[d], l = r.entities[o];
3708
3712
  if (!l)
3709
3713
  throw new R(`Entity '${o}' does not exist in schema while traversing dot notation path '${t}'.`, i);
3710
3714
  const p = l.links[f];
@@ -3723,24 +3727,24 @@ const Kr = [
3723
3727
  Ue(e, t, new H("string", !1, !0), n, i);
3724
3728
  return;
3725
3729
  }
3726
- const d = u.attrs[a];
3730
+ const c = u.attrs[a];
3727
3731
  if (Object.keys(u.links).includes(a)) {
3728
3732
  if (typeof e == "string" && !Fe(e))
3729
3733
  throw new R(`Invalid value for link '${a}' in entity '${o}'. Expected a UUID, but received: ${e}`, i);
3730
3734
  Ue(e, t, new H("string", !1, !0), n, i);
3731
3735
  return;
3732
3736
  }
3733
- if (!d) {
3734
- const c = Object.keys(u.attrs);
3735
- throw new R(`Attribute '${a}' does not exist on entity '${o}' in dot notation path '${t}'. Available attributes: ${c.length > 0 ? c.join(", ") + ", id" : "id"}`, i);
3737
+ if (!c) {
3738
+ const d = Object.keys(u.attrs);
3739
+ throw new R(`Attribute '${a}' does not exist on entity '${o}' in dot notation path '${t}'. Available attributes: ${d.length > 0 ? d.join(", ") + ", id" : "id"}`, i);
3736
3740
  }
3737
- Ue(e, t, d, n, i);
3741
+ Ue(e, t, c, n, i);
3738
3742
  }, Gi = (t, e, n, r) => {
3739
3743
  for (const [i, s] of Object.entries(t)) {
3740
3744
  if (i === "or" || i === "and") {
3741
3745
  if (Array.isArray(s))
3742
- for (const d of s)
3743
- typeof d == "object" && d !== null && Gi(d, e, n, `${r}.${i}[${d}]`);
3746
+ for (const c of s)
3747
+ typeof c == "object" && c !== null && Gi(c, e, n, `${r}.${i}[${c}]`);
3744
3748
  continue;
3745
3749
  }
3746
3750
  if (i === "id") {
@@ -3756,16 +3760,16 @@ const Kr = [
3756
3760
  continue;
3757
3761
  const a = o.attrs[i], u = o.links[i];
3758
3762
  if (!a && !u) {
3759
- const d = Object.keys(o.attrs), c = Object.keys(o.links);
3760
- throw new R(`Attribute or link '${i}' does not exist on entity '${e}'. Available attributes: ${d.length > 0 ? d.join(", ") : "none"}. Available links: ${c.length > 0 ? c.join(", ") : "none"}`, `${r}.${i}`);
3763
+ const c = Object.keys(o.attrs), d = Object.keys(o.links);
3764
+ throw new R(`Attribute or link '${i}' does not exist on entity '${e}'. Available attributes: ${c.length > 0 ? c.join(", ") : "none"}. Available links: ${d.length > 0 ? d.join(", ") : "none"}`, `${r}.${i}`);
3761
3765
  }
3762
3766
  if (a)
3763
3767
  Ue(s, i, a, e, `${r}.${i}`);
3764
3768
  else if (u) {
3765
3769
  if (typeof s == "string" && !Fe(s))
3766
3770
  throw new R(`Invalid value for link '${i}' in entity '${e}'. Expected a UUID, but received: ${s}`, `${r}.${i}`);
3767
- const d = new H("string", !1, !0);
3768
- Ue(s, i, d, e, `${r}.${i}`);
3771
+ const c = new H("string", !1, !0);
3772
+ Ue(s, i, c, e, `${r}.${i}`);
3769
3773
  }
3770
3774
  }
3771
3775
  }, bu = (t, e, n, r, i = 0) => {
@@ -3916,24 +3920,24 @@ var Br = function(t, e, n, r) {
3916
3920
  });
3917
3921
  }
3918
3922
  return new (n || (n = Promise))(function(s, o) {
3919
- function a(c) {
3923
+ function a(d) {
3920
3924
  try {
3921
- d(r.next(c));
3925
+ c(r.next(d));
3922
3926
  } catch (f) {
3923
3927
  o(f);
3924
3928
  }
3925
3929
  }
3926
- function u(c) {
3930
+ function u(d) {
3927
3931
  try {
3928
- d(r.throw(c));
3932
+ c(r.throw(d));
3929
3933
  } catch (f) {
3930
3934
  o(f);
3931
3935
  }
3932
3936
  }
3933
- function d(c) {
3934
- c.done ? s(c.value) : i(c.value).then(a, u);
3937
+ function c(d) {
3938
+ d.done ? s(d.value) : i(d.value).then(a, u);
3935
3939
  }
3936
- d((r = r.apply(t, e || [])).next());
3940
+ c((r = r.apply(t, e || [])).next());
3937
3941
  });
3938
3942
  };
3939
3943
  let Ji = 0;
@@ -4060,24 +4064,24 @@ var Qr = function(t, e, n, r) {
4060
4064
  });
4061
4065
  }
4062
4066
  return new (n || (n = Promise))(function(s, o) {
4063
- function a(c) {
4067
+ function a(d) {
4064
4068
  try {
4065
- d(r.next(c));
4069
+ c(r.next(d));
4066
4070
  } catch (f) {
4067
4071
  o(f);
4068
4072
  }
4069
4073
  }
4070
- function u(c) {
4074
+ function u(d) {
4071
4075
  try {
4072
- d(r.throw(c));
4076
+ c(r.throw(d));
4073
4077
  } catch (f) {
4074
4078
  o(f);
4075
4079
  }
4076
4080
  }
4077
- function d(c) {
4078
- c.done ? s(c.value) : i(c.value).then(a, u);
4081
+ function c(d) {
4082
+ d.done ? s(d.value) : i(d.value).then(a, u);
4079
4083
  }
4080
- d((r = r.apply(t, e || [])).next());
4084
+ c((r = r.apply(t, e || [])).next());
4081
4085
  });
4082
4086
  };
4083
4087
  function Su(t, e) {
@@ -4119,7 +4123,7 @@ function Yr(t, e) {
4119
4123
  for (const { action: n, triple: r } of e)
4120
4124
  switch (n) {
4121
4125
  case "added":
4122
- ji(t, r);
4126
+ ki(t, r);
4123
4127
  break;
4124
4128
  case "removed":
4125
4129
  Ei(t, r);
@@ -4130,11 +4134,11 @@ function Au(t, e) {
4130
4134
  var n, r, i, s;
4131
4135
  const o = {};
4132
4136
  for (const { action: a, triple: u } of e) {
4133
- const [d, c, f] = u, l = (r = (n = t.attrs[c]) === null || n === void 0 ? void 0 : n["forward-identity"]) === null || r === void 0 ? void 0 : r[2];
4137
+ const [c, d, f] = u, l = (r = (n = t.attrs[d]) === null || n === void 0 ? void 0 : n["forward-identity"]) === null || r === void 0 ? void 0 : r[2];
4134
4138
  if (!l)
4135
4139
  continue;
4136
- const p = (i = o[d]) !== null && i !== void 0 ? i : {};
4137
- o[d] = p;
4140
+ const p = (i = o[c]) !== null && i !== void 0 ? i : {};
4141
+ o[c] = p;
4138
4142
  const y = (s = p[l]) !== null && s !== void 0 ? s : {};
4139
4143
  switch (p[l] = y, a) {
4140
4144
  case "added":
@@ -4146,22 +4150,22 @@ function Au(t, e) {
4146
4150
  }
4147
4151
  }
4148
4152
  for (const a of Object.keys(o)) {
4149
- const { oldValue: u, newValue: d } = o[a];
4150
- u === d && delete o[a];
4153
+ const { oldValue: u, newValue: c } = o[a];
4154
+ u === c && delete o[a];
4151
4155
  }
4152
4156
  return o;
4153
4157
  }
4154
4158
  function wt(t, e) {
4155
4159
  return { [t.table]: e.map((n) => n.entity) };
4156
4160
  }
4157
- function ju(t, e) {
4161
+ function ku(t, e) {
4158
4162
  var n;
4159
4163
  if (t.orderFieldType)
4160
4164
  return t.orderFieldType;
4161
4165
  const r = t.orderField === "serverCreatedAt" ? "number" : (n = Te(e([]), t.table, t.orderField)) === null || n === void 0 ? void 0 : n["checked-data-type"];
4162
4166
  return t.orderFieldType = r, r;
4163
4167
  }
4164
- function ku(t, e, n) {
4168
+ function ju(t, e, n) {
4165
4169
  const r = e;
4166
4170
  if (t.orderField === "serverCreatedAt") {
4167
4171
  n.sort(t.orderDirection === "asc" ? function(o, a) {
@@ -4256,12 +4260,12 @@ class Cu {
4256
4260
  });
4257
4261
  return;
4258
4262
  }
4259
- const d = Object.keys(e)[0], c = ((a = (o = e[d]) === null || o === void 0 ? void 0 : o.$) === null || a === void 0 ? void 0 : a.order) || { serverCreatedAt: "asc" }, [f, l] = Object.entries(c)[0];
4263
+ const c = Object.keys(e)[0], d = ((a = (o = e[c]) === null || o === void 0 ? void 0 : o.$) === null || a === void 0 ? void 0 : a.order) || { serverCreatedAt: "asc" }, [f, l] = Object.entries(d)[0];
4260
4264
  this.subs.updateInPlace((p) => {
4261
4265
  p[n] = {
4262
4266
  query: e,
4263
4267
  hash: n,
4264
- table: d,
4268
+ table: c,
4265
4269
  orderDirection: l,
4266
4270
  orderField: f,
4267
4271
  createdAt: Date.now(),
@@ -4312,19 +4316,19 @@ class Cu {
4312
4316
  attrs: this.createStore([]).attrs
4313
4317
  };
4314
4318
  a.values = u;
4315
- const d = u.entities;
4316
- for (const c of i) {
4317
- const f = this.createStore(c);
4319
+ const c = u.entities;
4320
+ for (const d of i) {
4321
+ const f = this.createStore(d);
4318
4322
  u.attrs = f.attrs;
4319
4323
  const l = Zt(a, f);
4320
- d.push({
4324
+ c.push({
4321
4325
  store: f,
4322
4326
  entity: l,
4323
4327
  serverCreatedAt: Hr(a, f, l.id)
4324
4328
  }), o.push(l);
4325
4329
  }
4326
- this.subs.updateInPlace((c) => {
4327
- c[s] = a, c[s].updatedAt = Date.now();
4330
+ this.subs.updateInPlace((d) => {
4331
+ d[s] = a, d[s].updatedAt = Date.now();
4328
4332
  }), a.values && this.notifyCbs(s, {
4329
4333
  type: ve.InitialSyncBatch,
4330
4334
  data: wt(a, a.values.entities),
@@ -4372,12 +4376,12 @@ class Cu {
4372
4376
  this.log.error("Missing state for sub", a, e);
4373
4377
  return;
4374
4378
  }
4375
- for (const d of e.txes) {
4376
- if (u.txId && u.txId >= d["tx-id"])
4379
+ for (const c of e.txes) {
4380
+ if (u.txId && u.txId >= c["tx-id"])
4377
4381
  continue;
4378
- u.txId = d["tx-id"];
4379
- const c = [], f = {};
4380
- for (const g of d.changes) {
4382
+ u.txId = c["tx-id"];
4383
+ const d = [], f = {};
4384
+ for (const g of c.changes) {
4381
4385
  const m = (n = f[g.triple[0]]) !== null && n !== void 0 ? n : [];
4382
4386
  f[g.triple[0]] = m, m.push(g);
4383
4387
  }
@@ -4397,7 +4401,7 @@ class Cu {
4397
4401
  oldEntity: S.entity,
4398
4402
  newEntity: I,
4399
4403
  changedFields: x || {}
4400
- }), S.entity = I) : c.push(E), delete f[g];
4404
+ }), S.entity = I) : d.push(E), delete f[g];
4401
4405
  continue e;
4402
4406
  }
4403
4407
  }
@@ -4421,10 +4425,10 @@ class Cu {
4421
4425
  }), b.push(S);
4422
4426
  }
4423
4427
  const _ = [];
4424
- for (const g of c.sort().reverse())
4428
+ for (const g of d.sort().reverse())
4425
4429
  _.push(p[g].entity), p.splice(g, 1);
4426
- const w = ju(a, this.createStore);
4427
- ku(a, w, p), this.notifyCbs(o, {
4430
+ const w = ku(a, this.createStore);
4431
+ ju(a, w, p), this.notifyCbs(o, {
4428
4432
  type: ve.SyncTransaction,
4429
4433
  data: wt(a, (i = a.values) === null || i === void 0 ? void 0 : i.entities),
4430
4434
  added: b,
@@ -4432,8 +4436,8 @@ class Cu {
4432
4436
  updated: y
4433
4437
  });
4434
4438
  }
4435
- this.subs.updateInPlace((d) => {
4436
- d[o] = a, d[o].updatedAt = Date.now();
4439
+ this.subs.updateInPlace((c) => {
4440
+ c[o] = a, c[o].updatedAt = Date.now();
4437
4441
  });
4438
4442
  }
4439
4443
  clearSubscriptionData(e, n) {
@@ -4472,24 +4476,24 @@ var F = function(t, e, n, r) {
4472
4476
  });
4473
4477
  }
4474
4478
  return new (n || (n = Promise))(function(s, o) {
4475
- function a(c) {
4479
+ function a(d) {
4476
4480
  try {
4477
- d(r.next(c));
4481
+ c(r.next(d));
4478
4482
  } catch (f) {
4479
4483
  o(f);
4480
4484
  }
4481
4485
  }
4482
- function u(c) {
4486
+ function u(d) {
4483
4487
  try {
4484
- d(r.throw(c));
4488
+ c(r.throw(d));
4485
4489
  } catch (f) {
4486
4490
  o(f);
4487
4491
  }
4488
4492
  }
4489
- function d(c) {
4490
- c.done ? s(c.value) : i(c.value).then(a, u);
4493
+ function c(d) {
4494
+ d.done ? s(d.value) : i(d.value).then(a, u);
4491
4495
  }
4492
- d((r = r.apply(t, e || [])).next());
4496
+ c((r = r.apply(t, e || [])).next());
4493
4497
  });
4494
4498
  }, Pu = function(t, e) {
4495
4499
  var n = {};
@@ -4573,39 +4577,39 @@ function Zr(t) {
4573
4577
  class qu {
4574
4578
  constructor(e, n = Ki, r = qi, i, s) {
4575
4579
  var o, a, u;
4576
- if (this._isOnline = !0, this._isShutdown = !1, this.status = le.CONNECTING, this.queryCbs = {}, this.queryOnceDfds = {}, this.authCbs = [], this.attrsCbs = [], this.mutationErrorCbs = [], this.connectionStatusCbs = [], this.mutationDeferredStore = /* @__PURE__ */ new Map(), this._reconnectTimeoutId = null, this._reconnectTimeoutMs = 0, this._transportType = "ws", this._wsOk = null, this._localIdPromises = {}, this._errorMessage = null, this._oauthCallbackResponse = null, this._linkIndex = null, this._rooms = {}, this._roomsPendingLeave = {}, this._presence = {}, this._broadcastQueue = [], this._broadcastSubs = {}, this._currentUserCached = { isLoading: !0, error: void 0, user: void 0 }, this._beforeUnloadCbs = [], this._dataForQueryCache = {}, this._inFlightMutationEventIds = /* @__PURE__ */ new Set(), this._onMergeKv = (d, c, f) => {
4580
+ if (this._isOnline = !0, this._isShutdown = !1, this.status = le.CONNECTING, this.queryCbs = {}, this.queryOnceDfds = {}, this.authCbs = [], this.attrsCbs = [], this.mutationErrorCbs = [], this.connectionStatusCbs = [], this.mutationDeferredStore = /* @__PURE__ */ new Map(), this._reconnectTimeoutId = null, this._reconnectTimeoutMs = 0, this._transportType = "ws", this._wsOk = null, this._localIdPromises = {}, this._errorMessage = null, this._oauthCallbackResponse = null, this._linkIndex = null, this._rooms = {}, this._roomsPendingLeave = {}, this._presence = {}, this._broadcastQueue = [], this._broadcastSubs = {}, this._currentUserCached = { isLoading: !0, error: void 0, user: void 0 }, this._beforeUnloadCbs = [], this._dataForQueryCache = {}, this._inFlightMutationEventIds = /* @__PURE__ */ new Set(), this._onMergeKv = (c, d, f) => {
4577
4581
  var l, p;
4578
- switch (d) {
4582
+ switch (c) {
4579
4583
  case "pendingMutations": {
4580
- const y = (l = c == null ? void 0 : c.entries()) !== null && l !== void 0 ? l : [], b = (p = f == null ? void 0 : f.entries()) !== null && p !== void 0 ? p : [], _ = new Map([...y, ...b]);
4581
- return (c ? this._rewriteMutationsSorted(this.attrs, c) : []).forEach(([g, m]) => {
4584
+ const y = (l = d == null ? void 0 : d.entries()) !== null && l !== void 0 ? l : [], b = (p = f == null ? void 0 : f.entries()) !== null && p !== void 0 ? p : [], _ = new Map([...y, ...b]);
4585
+ return (d ? this._rewriteMutationsSorted(this.attrs, d) : []).forEach(([g, m]) => {
4582
4586
  var E;
4583
4587
  !(!((E = f == null ? void 0 : f.pendingMutations) === null || E === void 0) && E.has(g)) && !m["tx-id"] && this._sendMutation(g, m);
4584
4588
  }), _;
4585
4589
  }
4586
4590
  default:
4587
- return f || c;
4591
+ return f || d;
4588
4592
  }
4589
- }, this.getPreviousResult = (d) => {
4590
- var c;
4591
- const f = z(d);
4592
- return (c = this.dataForQuery(f)) === null || c === void 0 ? void 0 : c.data;
4593
- }, this.notifyOne = (d) => {
4594
- var c, f;
4595
- const l = (c = this.queryCbs[d]) !== null && c !== void 0 ? c : [], p = (f = this._dataForQueryCache[d]) === null || f === void 0 ? void 0 : f.data, y = this.dataForQuery(d);
4596
- y != null && y.data && (this._dataForQueryCache[d] = y, !Ot(y.data, p) && l.forEach((b) => b.cb(y.data)));
4597
- }, this.notifyOneQueryOnce = (d) => {
4598
- var c, f;
4599
- const l = (c = this.queryOnceDfds[d]) !== null && c !== void 0 ? c : [], p = (f = this.dataForQuery(d)) === null || f === void 0 ? void 0 : f.data;
4593
+ }, this.getPreviousResult = (c) => {
4594
+ var d;
4595
+ const f = z(c);
4596
+ return (d = this.dataForQuery(f)) === null || d === void 0 ? void 0 : d.data;
4597
+ }, this.notifyOne = (c) => {
4598
+ var d, f;
4599
+ const l = (d = this.queryCbs[c]) !== null && d !== void 0 ? d : [], p = (f = this._dataForQueryCache[c]) === null || f === void 0 ? void 0 : f.data, y = this.dataForQuery(c);
4600
+ y != null && y.data && (this._dataForQueryCache[c] = y, !Ot(y.data, p) && l.forEach((b) => b.cb(y.data)));
4601
+ }, this.notifyOneQueryOnce = (c) => {
4602
+ var d, f;
4603
+ const l = (d = this.queryOnceDfds[c]) !== null && d !== void 0 ? d : [], p = (f = this.dataForQuery(c)) === null || f === void 0 ? void 0 : f.data;
4600
4604
  l.forEach((y) => {
4601
- this._completeQueryOnce(y.q, d, y.dfd), y.dfd.resolve(p);
4605
+ this._completeQueryOnce(y.q, c, y.dfd), y.dfd.resolve(p);
4602
4606
  });
4603
- }, this.notifyQueryError = (d, c) => {
4604
- (this.queryCbs[d] || []).forEach((l) => l.cb({ error: c }));
4605
- }, this.pushTx = (d) => {
4606
- this.config.disableValidation || mu(d, this.config.schema);
4607
+ }, this.notifyQueryError = (c, d) => {
4608
+ (this.queryCbs[c] || []).forEach((l) => l.cb({ error: d }));
4609
+ }, this.pushTx = (c) => {
4610
+ this.config.disableValidation || mu(c, this.config.schema);
4607
4611
  try {
4608
- const c = Wa({
4612
+ const d = Wa({
4609
4613
  attrs: this.optimisticAttrs(),
4610
4614
  schema: this.config.schema,
4611
4615
  stores: Object.values(this.querySubs.currentValue).map((f) => {
@@ -4613,17 +4617,17 @@ class qu {
4613
4617
  return (l = f == null ? void 0 : f.result) === null || l === void 0 ? void 0 : l.store;
4614
4618
  }),
4615
4619
  useDateObjects: this.config.useDateObjects
4616
- }, d);
4617
- return this.pushOps(c);
4618
- } catch (c) {
4619
- return this.pushOps([], c);
4620
+ }, c);
4621
+ return this.pushOps(d);
4622
+ } catch (d) {
4623
+ return this.pushOps([], d);
4620
4624
  }
4621
- }, this.pushOps = (d, c) => {
4625
+ }, this.pushOps = (c, d) => {
4622
4626
  const f = K(), l = [...this._pendingMutations().values()], p = Math.max(0, ...l.map((_) => _.order || 0)) + 1, y = {
4623
4627
  op: "transact",
4624
- "tx-steps": d,
4628
+ "tx-steps": c,
4625
4629
  created: Date.now(),
4626
- error: c,
4630
+ error: d,
4627
4631
  order: p
4628
4632
  };
4629
4633
  this._updatePendingMutations((_) => {
@@ -4631,10 +4635,10 @@ class qu {
4631
4635
  });
4632
4636
  const b = new Lr();
4633
4637
  return this.mutationDeferredStore.set(f, b), this._sendMutation(f, y), this.notifyAll(), b.promise;
4634
- }, this._transportOnOpen = (d) => {
4635
- const c = d.target;
4636
- if (this._transport !== c) {
4637
- this._log.info("[socket][open]", c.id, "skip; this is no longer the current transport");
4638
+ }, this._transportOnOpen = (c) => {
4639
+ const d = c.target;
4640
+ if (this._transport !== d) {
4641
+ this._log.info("[socket][open]", d.id, "skip; this is no longer the current transport");
4638
4642
  return;
4639
4643
  }
4640
4644
  this._log.info("[socket][open]", this._transport.id), this._setStatus(le.OPENED), this.getCurrentUser().then((f) => {
@@ -4652,26 +4656,26 @@ class qu {
4652
4656
  "__admin-token": this.config.__adminToken
4653
4657
  });
4654
4658
  }).catch((f) => {
4655
- this._log.error("[socket][error]", c.id, f);
4659
+ this._log.error("[socket][error]", d.id, f);
4656
4660
  });
4657
- }, this._transportOnMessage = (d) => {
4658
- const c = d.target, f = d.message;
4659
- if (this._transport !== c) {
4660
- this._log.info("[socket][message]", c.id, f, "skip; this is no longer the current transport");
4661
+ }, this._transportOnMessage = (c) => {
4662
+ const d = c.target, f = c.message;
4663
+ if (this._transport !== d) {
4664
+ this._log.info("[socket][message]", d.id, f, "skip; this is no longer the current transport");
4661
4665
  return;
4662
4666
  }
4663
- if (!this._wsOk && c.type === "ws" && (this._wsOk = !0), this._transportType = "ws", Array.isArray(d.message))
4664
- for (const l of d.message)
4665
- this._handleReceive(c.id, l);
4667
+ if (!this._wsOk && d.type === "ws" && (this._wsOk = !0), this._transportType = "ws", Array.isArray(c.message))
4668
+ for (const l of c.message)
4669
+ this._handleReceive(d.id, l);
4666
4670
  else
4667
- this._handleReceive(c.id, d.message);
4668
- }, this._transportOnError = (d) => {
4669
- const c = d.target;
4670
- if (this._transport !== c) {
4671
- this._log.info("[socket][error]", c.id, "skip; this is no longer the current transport");
4671
+ this._handleReceive(d.id, c.message);
4672
+ }, this._transportOnError = (c) => {
4673
+ const d = c.target;
4674
+ if (this._transport !== d) {
4675
+ this._log.info("[socket][error]", d.id, "skip; this is no longer the current transport");
4672
4676
  return;
4673
4677
  }
4674
- this._log.error("[socket][error]", c.id, d);
4678
+ this._log.error("[socket][error]", d.id, c);
4675
4679
  }, this._scheduleReconnect = () => {
4676
4680
  !this._wsOk && this._transportType !== "sse" && (this._transportType = "sse", this._reconnectTimeoutMs = 0), setTimeout(() => {
4677
4681
  if (this._reconnectTimeoutMs = Math.min(this._reconnectTimeoutMs + 1e3, 1e4), !this._isOnline) {
@@ -4680,29 +4684,29 @@ class qu {
4680
4684
  }
4681
4685
  this._startSocket();
4682
4686
  }, this._reconnectTimeoutMs);
4683
- }, this._transportOnClose = (d) => {
4684
- const c = d.target;
4685
- if (this._transport !== c) {
4686
- this._log.info("[socket][close]", c.id, "skip; this is no longer the current transport");
4687
+ }, this._transportOnClose = (c) => {
4688
+ const d = c.target;
4689
+ if (this._transport !== d) {
4690
+ this._log.info("[socket][close]", d.id, "skip; this is no longer the current transport");
4687
4691
  return;
4688
4692
  }
4689
4693
  this._setStatus(le.CLOSED);
4690
4694
  for (const f of Object.values(this._rooms))
4691
4695
  f.isConnected = !1;
4692
4696
  if (this._isShutdown) {
4693
- this._log.info("[socket][close]", c.id, "Reactor has been shut down and will not reconnect");
4697
+ this._log.info("[socket][close]", d.id, "Reactor has been shut down and will not reconnect");
4694
4698
  return;
4695
4699
  }
4696
- this._log.info("[socket][close]", c.id, "schedule reconnect, ms =", this._reconnectTimeoutMs), this._scheduleReconnect();
4700
+ this._log.info("[socket][close]", d.id, "schedule reconnect, ms =", this._reconnectTimeoutMs), this._scheduleReconnect();
4697
4701
  }, this._EventSource = s, this.config = Object.assign(Object.assign({}, xu), e), this.queryCacheLimit = (o = this.config.queryCacheLimit) !== null && o !== void 0 ? o : 10, this._pendingTxCleanupTimeout = (a = this.config.pendingTxCleanupTimeout) !== null && a !== void 0 ? a : Mu, this._pendingMutationCleanupThreshold = (u = this.config.pendingMutationCleanupThreshold) !== null && u !== void 0 ? u : Ru, this._log = lu(e.verbose || Vn || Wi, () => this._reactorStats()), this.versions = Object.assign(Object.assign({}, i || {}), { "@instantdb/core": Bn }), this.config.schema && (this._linkIndex = Nr(this.config.schema)), !!Du()) {
4698
4702
  if (!e.appId)
4699
4703
  throw new Error("Instant must be initialized with an appId.");
4700
4704
  if (!Fe(e.appId))
4701
4705
  throw new Error(`Instant must be initialized with a valid appId. \`${e.appId}\` is not a valid uuid.`);
4702
- typeof BroadcastChannel == "function" && (this._broadcastChannel = new BroadcastChannel("@instantdb"), this._broadcastChannel.addEventListener("message", (d) => F(this, void 0, void 0, function* () {
4703
- var c;
4706
+ typeof BroadcastChannel == "function" && (this._broadcastChannel = new BroadcastChannel("@instantdb"), this._broadcastChannel.addEventListener("message", (c) => F(this, void 0, void 0, function* () {
4707
+ var d;
4704
4708
  try {
4705
- if (((c = d.data) === null || c === void 0 ? void 0 : c.type) === "auth") {
4709
+ if (((d = c.data) === null || d === void 0 ? void 0 : d.type) === "auth") {
4706
4710
  const f = yield this.getCurrentUser();
4707
4711
  this.updateUser(f.user);
4708
4712
  }
@@ -4711,9 +4715,9 @@ class qu {
4711
4715
  }
4712
4716
  }))), this._initStorage(n), this._syncTable = new Cu(this._trySendAuthed.bind(this), new n(this.config.appId, "syncSubs"), {
4713
4717
  useDateObjects: this.config.useDateObjects
4714
- }, this._log, (d) => Et(this.attrs, d, this.config.enableCardinalityInference, this._linkIndex, this.config.useDateObjects)), this._oauthCallbackResponse = this._oauthLoginInit(), this.getCurrentUser(), r.getIsOnline().then((d) => {
4715
- this._isOnline = d, this._startSocket(), r.listen((c) => {
4716
- c !== this._isOnline && (this._log.info("[network] online =", c), this._isOnline = c, this._isOnline ? this._startSocket() : (this._log.info("Changing status from", this.status, "to", le.CLOSED), this._setStatus(le.CLOSED)));
4718
+ }, this._log, (c) => Et(this.attrs, c, this.config.enableCardinalityInference, this._linkIndex, this.config.useDateObjects)), this._oauthCallbackResponse = this._oauthLoginInit(), this.getCurrentUser(), r.getIsOnline().then((c) => {
4719
+ this._isOnline = c, this._startSocket(), r.listen((d) => {
4720
+ d !== this._isOnline && (this._log.info("[network] online =", d), this._isOnline = d, this._isOnline ? this._startSocket() : (this._log.info("Changing status from", this.status, "to", le.CLOSED), this._setStatus(le.CLOSED)));
4717
4721
  });
4718
4722
  }), typeof addEventListener < "u" && (this._beforeUnload = this._beforeUnload.bind(this), addEventListener("beforeunload", this._beforeUnload));
4719
4723
  }
@@ -4804,13 +4808,13 @@ class qu {
4804
4808
  const i = (r = (n = this._presence[e]) === null || n === void 0 ? void 0 : n.result) === null || r === void 0 ? void 0 : r.user, s = this._broadcastQueue[e];
4805
4809
  if (this._broadcastQueue[e] = [], i && this._trySetPresence(e, i), s)
4806
4810
  for (const o of s) {
4807
- const { topic: a, roomType: u, data: d } = o;
4808
- this._tryBroadcast(e, u, a, d);
4811
+ const { topic: a, roomType: u, data: c } = o;
4812
+ this._tryBroadcast(e, u, a, c);
4809
4813
  }
4810
4814
  }
4811
4815
  _handleReceive(e, n) {
4812
4816
  var r, i, s, o, a, u;
4813
- const d = !!this.config.schema && ("cardinalityInference" in this.config ? !!this.config.cardinalityInference : !0);
4817
+ const c = !!this.config.schema && ("cardinalityInference" in this.config ? !!this.config.cardinalityInference : !0);
4814
4818
  switch (Jr[n.op] || this._log.info("[receive]", e, n.op, n), n.op) {
4815
4819
  case "init-ok": {
4816
4820
  this._setStatus(le.AUTHENTICATED), this._reconnectTimeoutMs = 0, this._setAttrs(n.attrs), this._flushPendingMessages(), this._sessionId = n["session-id"];
@@ -4828,7 +4832,7 @@ class qu {
4828
4832
  const { q: l, result: p } = n, y = z(l);
4829
4833
  if (!this._hasQueryListeners() && !this.querySubs.currentValue[y])
4830
4834
  break;
4831
- const b = (o = (s = p == null ? void 0 : p[0]) === null || s === void 0 ? void 0 : s.data) === null || o === void 0 ? void 0 : o["page-info"], _ = (u = (a = p == null ? void 0 : p[0]) === null || a === void 0 ? void 0 : a.data) === null || u === void 0 ? void 0 : u.aggregate, w = Fr(p), g = Et(this.attrs, w, d, this._linkIndex, this.config.useDateObjects);
4835
+ const b = (o = (s = p == null ? void 0 : p[0]) === null || s === void 0 ? void 0 : s.data) === null || o === void 0 ? void 0 : o["page-info"], _ = (u = (a = p == null ? void 0 : p[0]) === null || a === void 0 ? void 0 : a.data) === null || u === void 0 ? void 0 : u.aggregate, w = Fr(p), g = Et(this.attrs, w, c, this._linkIndex, this.config.useDateObjects);
4832
4836
  this.querySubs.updateInPlace((m) => {
4833
4837
  if (!m[y]) {
4834
4838
  this._log.info("Missing value in querySubs", { hash: y, q: l });
@@ -4868,7 +4872,7 @@ class qu {
4868
4872
  });
4869
4873
  const _ = Zr(b.entries()), w = l.map((g) => {
4870
4874
  var m, E, S, I;
4871
- const x = g["instaql-query"], B = g["instaql-result"], Ve = z(x), lt = Fr(B), Ft = Et(this.attrs, lt, d, this._linkIndex, this.config.useDateObjects), Nt = this._applyOptimisticUpdates(Ft, _, y), ht = (E = (m = B == null ? void 0 : B[0]) === null || m === void 0 ? void 0 : m.data) === null || E === void 0 ? void 0 : E["page-info"], ce = (I = (S = B == null ? void 0 : B[0]) === null || S === void 0 ? void 0 : S.data) === null || I === void 0 ? void 0 : I.aggregate;
4875
+ const x = g["instaql-query"], B = g["instaql-result"], Ve = z(x), lt = Fr(B), Ft = Et(this.attrs, lt, c, this._linkIndex, this.config.useDateObjects), Nt = this._applyOptimisticUpdates(Ft, _, y), ht = (E = (m = B == null ? void 0 : B[0]) === null || m === void 0 ? void 0 : m.data) === null || E === void 0 ? void 0 : E["page-info"], ce = (I = (S = B == null ? void 0 : B[0]) === null || S === void 0 ? void 0 : S.data) === null || I === void 0 ? void 0 : I.aggregate;
4872
4876
  return { q: x, hash: Ve, store: Nt, pageInfo: ht, aggregate: ce };
4873
4877
  });
4874
4878
  w.forEach(({ hash: g, q: m, store: E, pageInfo: S, aggregate: I }) => {
@@ -4927,8 +4931,8 @@ class qu {
4927
4931
  break;
4928
4932
  }
4929
4933
  case "join-room-error":
4930
- const c = n["room-id"], f = this._rooms[c];
4931
- f && (f.error = n.error), this._notifyPresenceSubs(c);
4934
+ const d = n["room-id"], f = this._rooms[d];
4935
+ f && (f.error = n.error), this._notifyPresenceSubs(d);
4932
4936
  break;
4933
4937
  case "error":
4934
4938
  this._handleReceiveError(n);
@@ -4968,18 +4972,18 @@ class qu {
4968
4972
  _handleReceiveError(e) {
4969
4973
  var n, r, i, s, o, a, u;
4970
4974
  console.log("error", e);
4971
- const d = e["client-event-id"];
4972
- this._inFlightMutationEventIds.delete(d);
4973
- const c = this._pendingMutations().get(d), f = {
4975
+ const c = e["client-event-id"];
4976
+ this._inFlightMutationEventIds.delete(c);
4977
+ const d = this._pendingMutations().get(c), f = {
4974
4978
  message: e.message || "Uh-oh, something went wrong. Ping Joe & Stopa."
4975
4979
  };
4976
- if (e.hint && (f.hint = e.hint), c) {
4977
- this._handleMutationError("error", d, e);
4980
+ if (e.hint && (f.hint = e.hint), d) {
4981
+ this._handleMutationError("error", c, e);
4978
4982
  return;
4979
4983
  }
4980
4984
  if (!((n = e["original-event"]) === null || n === void 0) && n.hasOwnProperty("q") && ((r = e["original-event"]) === null || r === void 0 ? void 0 : r.op) === "add-query") {
4981
4985
  const y = (i = e["original-event"]) === null || i === void 0 ? void 0 : i.q, b = z(y);
4982
- this.notifyQueryError(z(y), f), this.notifyQueryOnceError(y, b, d, f);
4986
+ this.notifyQueryError(z(y), f), this.notifyQueryOnceError(y, b, c, f);
4983
4987
  return;
4984
4988
  }
4985
4989
  if (((s = e["original-event"]) === null || s === void 0 ? void 0 : s.op) === "init") {
@@ -5077,17 +5081,17 @@ class qu {
5077
5081
  return n;
5078
5082
  if (!n)
5079
5083
  return /* @__PURE__ */ new Map();
5080
- const i = (c) => {
5081
- const [f, l, p] = c["forward-identity"];
5084
+ const i = (d) => {
5085
+ const [f, l, p] = d["forward-identity"];
5082
5086
  return V(e, l, p);
5083
- }, s = (c) => {
5084
- const [f, l, p] = c["forward-identity"];
5087
+ }, s = (d) => {
5088
+ const [f, l, p] = d["forward-identity"];
5085
5089
  return Ae(e, l, p);
5086
5090
  }, o = { attrIdMap: {}, refSwapAttrIds: /* @__PURE__ */ new Set() };
5087
5091
  let a = !1;
5088
- const u = (c, f) => {
5092
+ const u = (d, f) => {
5089
5093
  const l = [];
5090
- for (const p of c) {
5094
+ for (const p of d) {
5091
5095
  const [y] = p;
5092
5096
  if (y === "add-attr") {
5093
5097
  const [_, w] = p, g = i(w);
@@ -5110,11 +5114,11 @@ class qu {
5110
5114
  const b = a ? Ta(o, p) : p;
5111
5115
  l.push(b);
5112
5116
  }
5113
- return a ? l : c;
5114
- }, d = /* @__PURE__ */ new Map();
5115
- for (const [c, f] of n.entries())
5116
- d.set(c, Object.assign(Object.assign({}, f), { "tx-steps": u(f["tx-steps"], f["tx-id"]) }));
5117
- return a ? d : n;
5117
+ return a ? l : d;
5118
+ }, c = /* @__PURE__ */ new Map();
5119
+ for (const [d, f] of n.entries())
5120
+ c.set(d, Object.assign(Object.assign({}, f), { "tx-steps": u(f["tx-steps"], f["tx-id"]) }));
5121
+ return a ? c : n;
5118
5122
  }
5119
5123
  _rewriteMutationsSorted(e, n) {
5120
5124
  return Zr(this._rewriteMutations(e, n).entries());
@@ -5128,8 +5132,8 @@ class qu {
5128
5132
  if (a === "add-attr")
5129
5133
  i.push(u);
5130
5134
  else if (a === "update-attr" && u.id && (!((e = this.attrs) === null || e === void 0) && e[u.id])) {
5131
- const d = Object.assign(Object.assign({}, this.attrs[u.id]), u);
5132
- i.push(d);
5135
+ const c = Object.assign(Object.assign({}, this.attrs[u.id]), u);
5136
+ i.push(c);
5133
5137
  }
5134
5138
  const s = [
5135
5139
  ...Object.values(this.attrs || {}),
@@ -5147,10 +5151,10 @@ class qu {
5147
5151
  const r = this.querySubs.version(), i = this.querySubs.currentValue, s = this.kv.version(), o = this._pendingMutations(), { q: a, result: u } = i[e] || {};
5148
5152
  if (!u)
5149
5153
  return;
5150
- const d = this._dataForQueryCache[e];
5151
- if (d && r === d.querySubVersion && s === d.pendingMutationsVersion)
5152
- return d;
5153
- const { store: c, pageInfo: f, aggregate: l, processedTxId: p } = u, y = this._rewriteMutationsSorted(c.attrs, o), b = this._applyOptimisticUpdates(c, y, p);
5154
+ const c = this._dataForQueryCache[e];
5155
+ if (c && r === c.querySubVersion && s === c.pendingMutationsVersion)
5156
+ return c;
5157
+ const { store: d, pageInfo: f, aggregate: l, processedTxId: p } = u, y = this._rewriteMutationsSorted(d.attrs, o), b = this._applyOptimisticUpdates(d, y, p);
5154
5158
  return { data: Ui({ store: b, pageInfo: f, aggregate: l }, a), querySubVersion: r, pendingMutationsVersion: s };
5155
5159
  }
5156
5160
  _applyOptimisticUpdates(e, n, r) {
@@ -5337,13 +5341,13 @@ class qu {
5337
5341
  return null;
5338
5342
  this._replaceUrlAfterOAuth();
5339
5343
  try {
5340
- const u = yield this._getCurrentUser(), d = (u == null ? void 0 : u.type) === "guest", { user: c } = yield Dr({
5344
+ const u = yield this._getCurrentUser(), c = (u == null ? void 0 : u.type) === "guest", { user: d } = yield Dr({
5341
5345
  apiURI: this.config.apiURI,
5342
5346
  appId: this.config.appId,
5343
5347
  code: a,
5344
- refreshToken: d ? u.refresh_token : void 0
5348
+ refreshToken: c ? u.refresh_token : void 0
5345
5349
  });
5346
- return this.setCurrentUser(c), null;
5350
+ return this.setCurrentUser(d), null;
5347
5351
  } catch (u) {
5348
5352
  return ((e = u == null ? void 0 : u.body) === null || e === void 0 ? void 0 : e.type) === "record-not-found" && ((r = (n = u == null ? void 0 : u.body) === null || n === void 0 ? void 0 : n.hint) === null || r === void 0 ? void 0 : r["record-type"]) === "app-oauth-code" && (yield this._hasCurrentUser()) ? null : { error: { message: ((i = u == null ? void 0 : u.body) === null || i === void 0 ? void 0 : i.message) || "Error logging in." } };
5349
5353
  }
@@ -5651,8 +5655,8 @@ class qu {
5651
5655
  r.initialPresence || r.initialData
5652
5656
  ), o = Object.assign(Object.assign({}, r), { roomId: n, cb: i, prev: null });
5653
5657
  return this._presence[n] = this._presence[n] || {}, this._presence[n].handlers = this._presence[n].handlers || [], this._presence[n].handlers.push(o), this._notifyPresenceSub(n, o), () => {
5654
- var a, u, d;
5655
- this._presence[n].handlers = (d = (u = (a = this._presence[n]) === null || a === void 0 ? void 0 : a.handlers) === null || u === void 0 ? void 0 : u.filter((c) => c !== o)) !== null && d !== void 0 ? d : [], s();
5658
+ var a, u, c;
5659
+ this._presence[n].handlers = (c = (u = (a = this._presence[n]) === null || a === void 0 ? void 0 : a.handlers) === null || u === void 0 ? void 0 : u.filter((d) => d !== o)) !== null && c !== void 0 ? c : [], s();
5656
5660
  };
5657
5661
  }
5658
5662
  _notifyPresenceSubs(e) {
@@ -5668,22 +5672,22 @@ class qu {
5668
5672
  _patchPresencePeers(e, n) {
5669
5673
  var r, i, s;
5670
5674
  const o = ((i = (r = this._presence[e]) === null || r === void 0 ? void 0 : r.result) === null || i === void 0 ? void 0 : i.peers) || {};
5671
- let a = Object.fromEntries(Object.entries(o).map(([d, c]) => [d, { data: c }]));
5675
+ let a = Object.fromEntries(Object.entries(o).map(([c, d]) => [c, { data: d }]));
5672
5676
  (s = this._presence[e]) === null || s === void 0 || s.result;
5673
- const u = Pt(a, (d) => {
5674
- for (let [c, f, l] of n)
5677
+ const u = Pt(a, (c) => {
5678
+ for (let [d, f, l] of n)
5675
5679
  switch (f) {
5676
5680
  case "+":
5677
- Ks(d, c, l);
5681
+ Ks(c, d, l);
5678
5682
  break;
5679
5683
  case "r":
5680
- Sr(d, c, l);
5684
+ Sr(c, d, l);
5681
5685
  break;
5682
5686
  case "-":
5683
- wi(d, c);
5687
+ wi(c, d);
5684
5688
  break;
5685
5689
  }
5686
- delete d[this._sessionId];
5690
+ delete c[this._sessionId];
5687
5691
  });
5688
5692
  this._setPresencePeers(e, u);
5689
5693
  }
@@ -5726,8 +5730,8 @@ class qu {
5726
5730
  _notifyBroadcastSubs(e, n, r) {
5727
5731
  var i, s, o;
5728
5732
  (o = (s = (i = this._broadcastSubs) === null || i === void 0 ? void 0 : i[e]) === null || s === void 0 ? void 0 : s[n]) === null || o === void 0 || o.forEach((a) => {
5729
- var u, d, c, f, l, p;
5730
- const y = (u = r.data) === null || u === void 0 ? void 0 : u.data, b = r.data["peer-id"] === this._sessionId ? (c = (d = this._presence[e]) === null || d === void 0 ? void 0 : d.result) === null || c === void 0 ? void 0 : c.user : (p = (l = (f = this._presence[e]) === null || f === void 0 ? void 0 : f.result) === null || l === void 0 ? void 0 : l.peers) === null || p === void 0 ? void 0 : p[r.data["peer-id"]];
5733
+ var u, c, d, f, l, p;
5734
+ const y = (u = r.data) === null || u === void 0 ? void 0 : u.data, b = r.data["peer-id"] === this._sessionId ? (d = (c = this._presence[e]) === null || c === void 0 ? void 0 : c.result) === null || d === void 0 ? void 0 : d.user : (p = (l = (f = this._presence[e]) === null || f === void 0 ? void 0 : f.result) === null || l === void 0 ? void 0 : l.peers) === null || p === void 0 ? void 0 : p[r.data["peer-id"]];
5731
5735
  return a(y, b);
5732
5736
  });
5733
5737
  }
@@ -5823,9 +5827,9 @@ function Zi(t, e) {
5823
5827
  entityName: u.forward.on,
5824
5828
  cardinality: u.reverse.has
5825
5829
  };
5826
- return Object.fromEntries(Object.entries(t).map(([u, d]) => [
5830
+ return Object.fromEntries(Object.entries(t).map(([u, c]) => [
5827
5831
  u,
5828
- new Ut(d.attrs, Object.assign(Object.assign({}, o.fwd[u]), o.rev[u]))
5832
+ new Ut(c.attrs, Object.assign(Object.assign({}, o.fwd[u]), o.rev[u]))
5829
5833
  ]));
5830
5834
  }
5831
5835
  function Ju({ entities: t, links: e, rooms: n }) {
@@ -5858,12 +5862,12 @@ let mt;
5858
5862
  function Zu(t, e) {
5859
5863
  mt == null || mt.dispose();
5860
5864
  const n = ic(e), r = tc(e, a), i = ec(Xu(t));
5861
- function s(c) {
5865
+ function s(d) {
5862
5866
  var f;
5863
- c.source === i.element.contentWindow && ((f = c.data) === null || f === void 0 ? void 0 : f.type) === "close" && n.isVisible() && a();
5867
+ d.source === i.element.contentWindow && ((f = d.data) === null || f === void 0 ? void 0 : f.type) === "close" && n.isVisible() && a();
5864
5868
  }
5865
- function o(c) {
5866
- const f = c.shiftKey && c.ctrlKey && c.key === "0", l = c.key === "Escape" || c.key === "Esc";
5869
+ function o(d) {
5870
+ const f = d.shiftKey && d.ctrlKey && d.key === "0", l = d.key === "Escape" || d.key === "Esc";
5867
5871
  (f || l && n.isVisible()) && a();
5868
5872
  }
5869
5873
  function a() {
@@ -5872,12 +5876,12 @@ function Zu(t, e) {
5872
5876
  function u() {
5873
5877
  n.element.remove(), r.element.remove(), removeEventListener("keydown", o), removeEventListener("message", s);
5874
5878
  }
5875
- function d() {
5879
+ function c() {
5876
5880
  document.body.appendChild(n.element), document.body.appendChild(r.element), addEventListener("keydown", o), addEventListener("message", s), mt = {
5877
5881
  dispose: u
5878
5882
  };
5879
5883
  }
5880
- return d();
5884
+ return c();
5881
5885
  }
5882
5886
  function Xu(t) {
5883
5887
  return `${Vn || zi ? "http://localhost:3000" : "https://instantdb.com"}/_devtool?appId=${t}`;
@@ -6171,8 +6175,8 @@ function hc(t, e, n, r, i) {
6171
6175
  const o = Object.assign(Object.assign({}, t), { useDateObjects: (s = t.useDateObjects) !== null && s !== void 0 ? s : !1 }), a = mn[wn(o)];
6172
6176
  if (a)
6173
6177
  return lc(a, o.schema) && a._reactor.updateSchema(o.schema), a;
6174
- const u = new qu(Object.assign(Object.assign(Object.assign({}, sc), o), { cardinalityInference: !!o.schema }), e || Ki, n || qi, Object.assign(Object.assign({}, r || {}), { "@instantdb/core": Bn }), i), d = new fc(u);
6175
- return mn[wn(o)] = d, pc(o.appId, o.devtool), d;
6178
+ const u = new qu(Object.assign(Object.assign(Object.assign({}, sc), o), { cardinalityInference: !!o.schema }), e || Ki, n || qi, Object.assign(Object.assign({}, r || {}), { "@instantdb/core": Bn }), i), c = new fc(u);
6179
+ return mn[wn(o)] = c, pc(o.appId, o.devtool), c;
6176
6180
  }
6177
6181
  function pc(t, e) {
6178
6182
  if (typeof window > "u" || typeof window.location > "u" || typeof document > "u" || typeof e == "boolean" && !e)
@@ -6195,11 +6199,11 @@ function yc() {
6195
6199
  if (ti) return He;
6196
6200
  ti = 1;
6197
6201
  var t = ci, e = Symbol.for("react.element"), n = Symbol.for("react.fragment"), r = Object.prototype.hasOwnProperty, i = t.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED.ReactCurrentOwner, s = { key: !0, ref: !0, __self: !0, __source: !0 };
6198
- function o(a, u, d) {
6199
- var c, f = {}, l = null, p = null;
6200
- d !== void 0 && (l = "" + d), u.key !== void 0 && (l = "" + u.key), u.ref !== void 0 && (p = u.ref);
6201
- for (c in u) r.call(u, c) && !s.hasOwnProperty(c) && (f[c] = u[c]);
6202
- if (a && a.defaultProps) for (c in u = a.defaultProps, u) f[c] === void 0 && (f[c] = u[c]);
6202
+ function o(a, u, c) {
6203
+ var d, f = {}, l = null, p = null;
6204
+ c !== void 0 && (l = "" + c), u.key !== void 0 && (l = "" + u.key), u.ref !== void 0 && (p = u.ref);
6205
+ for (d in u) r.call(u, d) && !s.hasOwnProperty(d) && (f[d] = u[d]);
6206
+ if (a && a.defaultProps) for (d in u = a.defaultProps, u) f[d] === void 0 && (f[d] = u[d]);
6203
6207
  return { $$typeof: e, type: a, key: l, ref: p, props: f, _owner: i.current };
6204
6208
  }
6205
6209
  return He.Fragment = n, He.jsx = o, He.jsxs = o, He;
@@ -6219,7 +6223,7 @@ function bc() {
6219
6223
  * LICENSE file in the root directory of this source tree.
6220
6224
  */
6221
6225
  return t.NODE_ENV !== "production" && function() {
6222
- var e = ci, n = Symbol.for("react.element"), r = Symbol.for("react.portal"), i = Symbol.for("react.fragment"), s = Symbol.for("react.strict_mode"), o = Symbol.for("react.profiler"), a = Symbol.for("react.provider"), u = Symbol.for("react.context"), d = Symbol.for("react.forward_ref"), c = Symbol.for("react.suspense"), f = Symbol.for("react.suspense_list"), l = Symbol.for("react.memo"), p = Symbol.for("react.lazy"), y = Symbol.for("react.offscreen"), b = Symbol.iterator, _ = "@@iterator";
6226
+ var e = ci, n = Symbol.for("react.element"), r = Symbol.for("react.portal"), i = Symbol.for("react.fragment"), s = Symbol.for("react.strict_mode"), o = Symbol.for("react.profiler"), a = Symbol.for("react.provider"), u = Symbol.for("react.context"), c = Symbol.for("react.forward_ref"), d = Symbol.for("react.suspense"), f = Symbol.for("react.suspense_list"), l = Symbol.for("react.memo"), p = Symbol.for("react.lazy"), y = Symbol.for("react.offscreen"), b = Symbol.iterator, _ = "@@iterator";
6223
6227
  function w(h) {
6224
6228
  if (h === null || typeof h != "object")
6225
6229
  return null;
@@ -6247,7 +6251,7 @@ function bc() {
6247
6251
  var S = !1, I = !1, x = !1, B = !1, Ve = !1, lt;
6248
6252
  lt = Symbol.for("react.module.reference");
6249
6253
  function Ft(h) {
6250
- return !!(typeof h == "string" || typeof h == "function" || h === i || h === o || Ve || h === s || h === c || h === f || B || h === y || S || I || x || typeof h == "object" && h !== null && (h.$$typeof === p || h.$$typeof === l || h.$$typeof === a || h.$$typeof === u || h.$$typeof === d || // This needs to include all possible module reference object
6254
+ return !!(typeof h == "string" || typeof h == "function" || h === i || h === o || Ve || h === s || h === d || h === f || B || h === y || S || I || x || typeof h == "object" && h !== null && (h.$$typeof === p || h.$$typeof === l || h.$$typeof === a || h.$$typeof === u || h.$$typeof === c || // This needs to include all possible module reference object
6251
6255
  // types supported by any Flight configuration anywhere since
6252
6256
  // we don't know which Flight build this will end up being used
6253
6257
  // with.
@@ -6279,7 +6283,7 @@ function bc() {
6279
6283
  return "Profiler";
6280
6284
  case s:
6281
6285
  return "StrictMode";
6282
- case c:
6286
+ case d:
6283
6287
  return "Suspense";
6284
6288
  case f:
6285
6289
  return "SuspenseList";
@@ -6292,7 +6296,7 @@ function bc() {
6292
6296
  case a:
6293
6297
  var v = h;
6294
6298
  return ht(v._context) + ".Provider";
6295
- case d:
6299
+ case c:
6296
6300
  return Nt(h, h.render, "ForwardRef");
6297
6301
  case l:
6298
6302
  var O = h.displayName || null;
@@ -6437,17 +6441,17 @@ function bc() {
6437
6441
  }
6438
6442
  } catch (Y) {
6439
6443
  if (Y && O && typeof Y.stack == "string") {
6440
- for (var j = Y.stack.split(`
6444
+ for (var k = Y.stack.split(`
6441
6445
  `), G = O.stack.split(`
6442
- `), D = j.length - 1, L = G.length - 1; D >= 1 && L >= 0 && j[D] !== G[L]; )
6446
+ `), D = k.length - 1, L = G.length - 1; D >= 1 && L >= 0 && k[D] !== G[L]; )
6443
6447
  L--;
6444
6448
  for (; D >= 1 && L >= 0; D--, L--)
6445
- if (j[D] !== G[L]) {
6449
+ if (k[D] !== G[L]) {
6446
6450
  if (D !== 1 || L !== 1)
6447
6451
  do
6448
- if (D--, L--, L < 0 || j[D] !== G[L]) {
6452
+ if (D--, L--, L < 0 || k[D] !== G[L]) {
6449
6453
  var re = `
6450
- ` + j[D].replace(" at new ", " at ");
6454
+ ` + k[D].replace(" at new ", " at ");
6451
6455
  return h.displayName && re.includes("<anonymous>") && (re = re.replace("<anonymous>", h.displayName)), typeof h == "function" && yt.set(h, re), re;
6452
6456
  }
6453
6457
  while (D >= 1 && L >= 0);
@@ -6475,14 +6479,14 @@ function bc() {
6475
6479
  if (typeof h == "string")
6476
6480
  return pt(h);
6477
6481
  switch (h) {
6478
- case c:
6482
+ case d:
6479
6483
  return pt("Suspense");
6480
6484
  case f:
6481
6485
  return pt("SuspenseList");
6482
6486
  }
6483
6487
  if (typeof h == "object")
6484
6488
  switch (h.$$typeof) {
6485
- case d:
6489
+ case c:
6486
6490
  return rs(h.render);
6487
6491
  case l:
6488
6492
  return bt(h.type, T, v);
@@ -6509,17 +6513,17 @@ function bc() {
6509
6513
  var M = Function.call.bind(Ge);
6510
6514
  for (var C in h)
6511
6515
  if (M(h, C)) {
6512
- var j = void 0;
6516
+ var k = void 0;
6513
6517
  try {
6514
6518
  if (typeof h[C] != "function") {
6515
6519
  var G = Error((O || "React class") + ": " + v + " type `" + C + "` is invalid; it must be a function, usually from the `prop-types` package, but received `" + typeof h[C] + "`.This often happens because of typos such as `PropTypes.function` instead of `PropTypes.func`.");
6516
6520
  throw G.name = "Invariant Violation", G;
6517
6521
  }
6518
- j = h[C](T, C, O, v, null, "SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED");
6522
+ k = h[C](T, C, O, v, null, "SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED");
6519
6523
  } catch (D) {
6520
- j = D;
6524
+ k = D;
6521
6525
  }
6522
- j && !(j instanceof Error) && (_t(P), m("%s: type specification of %s `%s` is invalid; the type checker function must return `null` or an `Error` but returned a %s. You may have forgotten to pass an argument to the type checker creator (arrayOf, instanceOf, objectOf, oneOf, oneOfType, and shape all require an argument).", O || "React class", v, C, typeof j), _t(null)), j instanceof Error && !(j.message in ir) && (ir[j.message] = !0, _t(P), m("Failed %s type: %s", v, j.message), _t(null));
6526
+ k && !(k instanceof Error) && (_t(P), m("%s: type specification of %s `%s` is invalid; the type checker function must return `null` or an `Error` but returned a %s. You may have forgotten to pass an argument to the type checker creator (arrayOf, instanceOf, objectOf, oneOf, oneOfType, and shape all require an argument).", O || "React class", v, C, typeof k), _t(null)), k instanceof Error && !(k.message in ir) && (ir[k.message] = !0, _t(P), m("Failed %s type: %s", v, k.message), _t(null));
6523
6527
  }
6524
6528
  }
6525
6529
  }
@@ -6595,7 +6599,7 @@ function bc() {
6595
6599
  }
6596
6600
  }
6597
6601
  var ys = function(h, T, v, O, P, M, C) {
6598
- var j = {
6602
+ var k = {
6599
6603
  // This tag allows us to uniquely identify this as a React Element
6600
6604
  $$typeof: n,
6601
6605
  // Built-in properties that belong on the element
@@ -6606,27 +6610,27 @@ function bc() {
6606
6610
  // Record the component responsible for creating this element.
6607
6611
  _owner: M
6608
6612
  };
6609
- return j._store = {}, Object.defineProperty(j._store, "validated", {
6613
+ return k._store = {}, Object.defineProperty(k._store, "validated", {
6610
6614
  configurable: !1,
6611
6615
  enumerable: !1,
6612
6616
  writable: !0,
6613
6617
  value: !1
6614
- }), Object.defineProperty(j, "_self", {
6618
+ }), Object.defineProperty(k, "_self", {
6615
6619
  configurable: !1,
6616
6620
  enumerable: !1,
6617
6621
  writable: !1,
6618
6622
  value: O
6619
- }), Object.defineProperty(j, "_source", {
6623
+ }), Object.defineProperty(k, "_source", {
6620
6624
  configurable: !1,
6621
6625
  enumerable: !1,
6622
6626
  writable: !1,
6623
6627
  value: P
6624
- }), Object.freeze && (Object.freeze(j.props), Object.freeze(j)), j;
6628
+ }), Object.freeze && (Object.freeze(k.props), Object.freeze(k)), k;
6625
6629
  };
6626
6630
  function bs(h, T, v, O, P) {
6627
6631
  {
6628
- var M, C = {}, j = null, G = null;
6629
- v !== void 0 && (ar(v), j = "" + v), fs(T) && (ar(T.key), j = "" + T.key), ds(T) && (G = T.ref, ls(T, P));
6632
+ var M, C = {}, k = null, G = null;
6633
+ v !== void 0 && (ar(v), k = "" + v), fs(T) && (ar(T.key), k = "" + T.key), ds(T) && (G = T.ref, ls(T, P));
6630
6634
  for (M in T)
6631
6635
  Ge.call(T, M) && !cs.hasOwnProperty(M) && (C[M] = T[M]);
6632
6636
  if (h && h.defaultProps) {
@@ -6634,11 +6638,11 @@ function bc() {
6634
6638
  for (M in D)
6635
6639
  C[M] === void 0 && (C[M] = D[M]);
6636
6640
  }
6637
- if (j || G) {
6641
+ if (k || G) {
6638
6642
  var L = typeof h == "function" ? h.displayName || h.name || "Unknown" : h;
6639
- j && hs(C, L), G && ps(C, L);
6643
+ k && hs(C, L), G && ps(C, L);
6640
6644
  }
6641
- return ys(h, j, G, P, O, ur.current, C);
6645
+ return ys(h, k, G, P, O, ur.current, C);
6642
6646
  }
6643
6647
  }
6644
6648
  var Vt = g.ReactCurrentOwner, fr = g.ReactDebugCurrentFrame;
@@ -6722,7 +6726,7 @@ Check the top-level render call using <` + v + ">.");
6722
6726
  var v;
6723
6727
  if (typeof T == "function")
6724
6728
  v = T.propTypes;
6725
- else if (typeof T == "object" && (T.$$typeof === d || // Note: Memo only checks outer props here.
6729
+ else if (typeof T == "object" && (T.$$typeof === c || // Note: Memo only checks outer props here.
6726
6730
  // Inner props are checked in the reconciler.
6727
6731
  T.$$typeof === l))
6728
6732
  v = T.propTypes;
@@ -6756,12 +6760,12 @@ Check the top-level render call using <` + v + ">.");
6756
6760
  {
6757
6761
  var C = Ft(h);
6758
6762
  if (!C) {
6759
- var j = "";
6760
- (h === void 0 || typeof h == "object" && h !== null && Object.keys(h).length === 0) && (j += " You likely forgot to export your component from the file it's defined in, or you might have mixed up default and named imports.");
6763
+ var k = "";
6764
+ (h === void 0 || typeof h == "object" && h !== null && Object.keys(h).length === 0) && (k += " You likely forgot to export your component from the file it's defined in, or you might have mixed up default and named imports.");
6761
6765
  var G = _s();
6762
- G ? j += G : j += lr();
6766
+ G ? k += G : k += lr();
6763
6767
  var D;
6764
- h === null ? D = "null" : zt(h) ? D = "array" : h !== void 0 && h.$$typeof === n ? (D = "<" + (ce(h.type) || "Unknown") + " />", j = " Did you accidentally export a JSX literal instead of a component?") : D = typeof h, m("React.jsx: type is invalid -- expected a string (for built-in components) or a class/function (for composite components) but got: %s.%s", D, j);
6768
+ h === null ? D = "null" : zt(h) ? D = "array" : h !== void 0 && h.$$typeof === n ? (D = "<" + (ce(h.type) || "Unknown") + " />", k = " Did you accidentally export a JSX literal instead of a component?") : D = typeof h, m("React.jsx: type is invalid -- expected a string (for built-in components) or a class/function (for composite components) but got: %s.%s", D, k);
6765
6769
  }
6766
6770
  var L = bs(h, T, v, P, M);
6767
6771
  if (L == null)
@@ -6821,16 +6825,16 @@ function ri(t) {
6821
6825
  function Tc(t, e, n) {
6822
6826
  e && n && "ruleParams" in n && (e = Object.assign({ $$ruleParams: n.ruleParams }, e));
6823
6827
  const r = e ? dc(e) : null, i = z(r), s = at(ri(t._reactor.getPreviousResult(r))), o = ge(
6824
- (u) => (s.current = ri(t._reactor.getPreviousResult(r)), r ? t.subscribeQuery(r, (c) => {
6828
+ (u) => (s.current = ri(t._reactor.getPreviousResult(r)), r ? t.subscribeQuery(r, (d) => {
6825
6829
  s.current = Object.assign({
6826
- isLoading: !c,
6830
+ isLoading: !d,
6827
6831
  // @ts-expect-error: ts thinks this will always be overwritten
6828
6832
  data: void 0,
6829
6833
  // @ts-expect-error: ts thinks this will always be overwritten
6830
6834
  pageInfo: void 0,
6831
6835
  // @ts-expect-error: ts thinks this will always be overwritten
6832
6836
  error: void 0
6833
- }, c), u();
6837
+ }, d), u();
6834
6838
  }) : () => {
6835
6839
  }),
6836
6840
  // Build a new subscribe function if the query changes
@@ -6840,7 +6844,7 @@ function Tc(t, e, n) {
6840
6844
  }
6841
6845
  function wc() {
6842
6846
  const t = at(null);
6843
- je(() => {
6847
+ ke(() => {
6844
6848
  n();
6845
6849
  }, []);
6846
6850
  function e(r, i) {
@@ -6854,12 +6858,12 @@ function wc() {
6854
6858
  const mc = 1e3;
6855
6859
  function vc(t, e, n) {
6856
6860
  const r = at(n);
6857
- r.current = n, je(() => t.core._reactor.subscribeTopic(t.id, e, (s, o) => {
6861
+ r.current = n, ke(() => t.core._reactor.subscribeTopic(t.id, e, (s, o) => {
6858
6862
  r.current(s, o);
6859
6863
  }), [t.id, e]);
6860
6864
  }
6861
6865
  function Sc(t, e) {
6862
- return je(() => t.core._reactor.joinRoom(t.id), [t.id]), ge((r) => {
6866
+ return ke(() => t.core._reactor.joinRoom(t.id), [t.id]), ge((r) => {
6863
6867
  t.core._reactor.publishTopic({
6864
6868
  roomType: t.type,
6865
6869
  roomId: t.id,
@@ -6877,8 +6881,8 @@ function Oc(t, e = {}) {
6877
6881
  isLoading: !0
6878
6882
  };
6879
6883
  });
6880
- je(() => t.core._reactor.subscribePresence(t.type, t.id, e, (d) => {
6881
- s(d);
6884
+ ke(() => t.core._reactor.subscribePresence(t.type, t.id, e, (c) => {
6885
+ s(c);
6882
6886
  }), [t.id, e.user, (n = e.peers) === null || n === void 0 ? void 0 : n.join(), (r = e.keys) === null || r === void 0 ? void 0 : r.join()]);
6883
6887
  const o = ge((u) => {
6884
6888
  t.core._reactor.publishPresence(t.type, t.id, u);
@@ -6886,34 +6890,34 @@ function Oc(t, e = {}) {
6886
6890
  return nn(() => Object.assign(Object.assign({}, i), { publishPresence: o }), [i, o]);
6887
6891
  }
6888
6892
  function Ec(t, e, n) {
6889
- je(() => t.core._reactor.joinRoom(t.id, e), [t.id]), je(() => t.core._reactor.publishPresence(t.type, t.id, e), [t.type, t.id, n ?? JSON.stringify(e)]);
6893
+ ke(() => t.core._reactor.joinRoom(t.id, e), [t.id]), ke(() => t.core._reactor.publishPresence(t.type, t.id, e), [t.type, t.id, n ?? JSON.stringify(e)]);
6890
6894
  }
6891
6895
  function Ac(t, e, n = {}) {
6892
6896
  const r = wc(), i = Se.usePresence(t, {
6893
6897
  keys: [e]
6894
6898
  }), s = nn(() => {
6895
- var c;
6899
+ var d;
6896
6900
  const f = t._core._reactor.getPresence(t.type, t.id);
6897
- return n != null && n.writeOnly ? [] : Object.values((c = f == null ? void 0 : f.peers) !== null && c !== void 0 ? c : {}).filter((l) => l[e] === !0);
6898
- }, [n == null ? void 0 : n.writeOnly, i]), o = ge((c) => {
6901
+ return n != null && n.writeOnly ? [] : Object.values((d = f == null ? void 0 : f.peers) !== null && d !== void 0 ? d : {}).filter((l) => l[e] === !0);
6902
+ }, [n == null ? void 0 : n.writeOnly, i]), o = ge((d) => {
6899
6903
  var f;
6900
6904
  t.core._reactor.publishPresence(t.type, t.id, {
6901
- [e]: c
6902
- }), c && ((n == null ? void 0 : n.timeout) === null || (n == null ? void 0 : n.timeout) === 0 || r.set((f = n == null ? void 0 : n.timeout) !== null && f !== void 0 ? f : mc, () => {
6905
+ [e]: d
6906
+ }), d && ((n == null ? void 0 : n.timeout) === null || (n == null ? void 0 : n.timeout) === 0 || r.set((f = n == null ? void 0 : n.timeout) !== null && f !== void 0 ? f : mc, () => {
6903
6907
  t.core._reactor.publishPresence(t.type, t.id, {
6904
6908
  [e]: null
6905
6909
  });
6906
6910
  }));
6907
- }, [t.type, t.id, e, n == null ? void 0 : n.timeout, r]), a = ge((c) => {
6908
- const l = !((n == null ? void 0 : n.stopOnEnter) && c.key === "Enter");
6911
+ }, [t.type, t.id, e, n == null ? void 0 : n.timeout, r]), a = ge((d) => {
6912
+ const l = !((n == null ? void 0 : n.stopOnEnter) && d.key === "Enter");
6909
6913
  o(l);
6910
6914
  }, [n.stopOnEnter, o]), u = ge(() => {
6911
6915
  o(!1);
6912
- }, [o]), d = nn(() => ({ onKeyDown: a, onBlur: u }), [a, u]);
6916
+ }, [o]), c = nn(() => ({ onKeyDown: a, onBlur: u }), [a, u]);
6913
6917
  return {
6914
6918
  active: s,
6915
6919
  setActive: o,
6916
- inputProps: d
6920
+ inputProps: c
6917
6921
  };
6918
6922
  }
6919
6923
  const Se = {
@@ -6923,38 +6927,38 @@ const Se = {
6923
6927
  useSyncPresence: Ec,
6924
6928
  useTypingIndicator: Ac
6925
6929
  };
6926
- class jc {
6930
+ class kc {
6927
6931
  constructor(e, n, r) {
6928
6932
  this.useTopicEffect = (i, s) => {
6929
6933
  Se.useTopicEffect(this, i, s);
6930
6934
  }, this.usePublishTopic = (i) => Se.usePublishTopic(this, i), this.usePresence = (i = {}) => Se.usePresence(this, i), this.useSyncPresence = (i, s) => Se.useSyncPresence(this, i, s), this.useTypingIndicator = (i, s = {}) => Se.useTypingIndicator(this, i, s), this.core = e, this._core = this.core, this.type = n, this.id = r;
6931
6935
  }
6932
6936
  }
6933
- var kc = function(t, e, n, r) {
6937
+ var jc = function(t, e, n, r) {
6934
6938
  function i(s) {
6935
6939
  return s instanceof n ? s : new n(function(o) {
6936
6940
  o(s);
6937
6941
  });
6938
6942
  }
6939
6943
  return new (n || (n = Promise))(function(s, o) {
6940
- function a(c) {
6944
+ function a(d) {
6941
6945
  try {
6942
- d(r.next(c));
6946
+ c(r.next(d));
6943
6947
  } catch (f) {
6944
6948
  o(f);
6945
6949
  }
6946
6950
  }
6947
- function u(c) {
6951
+ function u(d) {
6948
6952
  try {
6949
- d(r.throw(c));
6953
+ c(r.throw(d));
6950
6954
  } catch (f) {
6951
6955
  o(f);
6952
6956
  }
6953
6957
  }
6954
- function d(c) {
6955
- c.done ? s(c.value) : i(c.value).then(a, u);
6958
+ function c(d) {
6959
+ d.done ? s(d.value) : i(d.value).then(a, u);
6956
6960
  }
6957
- d((r = r.apply(t, e || [])).next());
6961
+ c((r = r.apply(t, e || [])).next());
6958
6962
  });
6959
6963
  };
6960
6964
  const Cc = {
@@ -6966,8 +6970,8 @@ class Pc {
6966
6970
  constructor(e, n) {
6967
6971
  this.tx = zn(), this.getLocalId = (r) => this.core.getLocalId(r), this.useLocalId = (r) => {
6968
6972
  const [i, s] = di(null);
6969
- return je(() => {
6970
- kc(this, void 0, void 0, function* () {
6973
+ return ke(() => {
6974
+ jc(this, void 0, void 0, function* () {
6971
6975
  const a = yield this.getLocalId(r);
6972
6976
  s(a);
6973
6977
  });
@@ -7022,7 +7026,7 @@ class Pc {
7022
7026
  * const { peers } = db.rooms.usePresence(room);
7023
7027
  */
7024
7028
  room(e = "_defaultRoomType", n = "_defaultRoomId") {
7025
- return new jc(this.core, e, n);
7029
+ return new kc(this.core, e, n);
7026
7030
  }
7027
7031
  /**
7028
7032
  * One time query for the logged in state. This is useful
@@ -7051,8 +7055,8 @@ function Ic(t) {
7051
7055
  "`callbacks` must be an object, got a function instead. Did you mean `{onEvent: fn}`?"
7052
7056
  );
7053
7057
  const { onEvent: e = en, onError: n = en, onRetry: r = en, onComment: i } = t;
7054
- let s = "", o = !0, a, u = "", d = "";
7055
- function c(b) {
7058
+ let s = "", o = !0, a, u = "", c = "";
7059
+ function d(b) {
7056
7060
  const _ = o ? b.replace(/^\xEF\xBB\xBF/, "") : b, [w, g] = Mc(`${s}${_}`);
7057
7061
  for (const m of w)
7058
7062
  f(m);
@@ -7078,7 +7082,7 @@ function Ic(t) {
7078
7082
  function l(b, _, w) {
7079
7083
  switch (b) {
7080
7084
  case "event":
7081
- d = _;
7085
+ c = _;
7082
7086
  break;
7083
7087
  case "data":
7084
7088
  u = `${u}${_}
@@ -7109,17 +7113,17 @@ function Ic(t) {
7109
7113
  function p() {
7110
7114
  u.length > 0 && e({
7111
7115
  id: a,
7112
- event: d || void 0,
7116
+ event: c || void 0,
7113
7117
  // If the data buffer's last character is a U+000A LINE FEED (LF) character,
7114
7118
  // then remove the last character from the data buffer.
7115
7119
  data: u.endsWith(`
7116
7120
  `) ? u.slice(0, -1) : u
7117
- }), a = void 0, u = "", d = "";
7121
+ }), a = void 0, u = "", c = "";
7118
7122
  }
7119
7123
  function y(b = {}) {
7120
- s && b.consume && f(s), o = !0, a = void 0, u = "", d = "", s = "";
7124
+ s && b.consume && f(s), o = !0, a = void 0, u = "", c = "", s = "";
7121
7125
  }
7122
- return { feed: c, reset: y };
7126
+ return { feed: d, reset: y };
7123
7127
  }
7124
7128
  function Mc(t) {
7125
7129
  const e = [];
@@ -7200,24 +7204,24 @@ function oi(t) {
7200
7204
  }
7201
7205
  var Xi = (t) => {
7202
7206
  throw TypeError(t);
7203
- }, Gn = (t, e, n) => e.has(t) || Xi("Cannot " + n), A = (t, e, n) => (Gn(t, e, "read from private field"), n ? n.call(t) : e.get(t)), N = (t, e, n) => e.has(t) ? Xi("Cannot add the same private member more than once") : e instanceof WeakSet ? e.add(t) : e.set(t, n), $ = (t, e, n, r) => (Gn(t, e, "write to private field"), e.set(t, n), n), he = (t, e, n) => (Gn(t, e, "access private method"), n), J, Oe, Re, At, Rt, st, De, ot, _e, xe, Le, $e, et, se, On, En, An, ai, jn, kn, tt, Cn, Pn;
7204
- class jt extends EventTarget {
7207
+ }, Gn = (t, e, n) => e.has(t) || Xi("Cannot " + n), A = (t, e, n) => (Gn(t, e, "read from private field"), n ? n.call(t) : e.get(t)), N = (t, e, n) => e.has(t) ? Xi("Cannot add the same private member more than once") : e instanceof WeakSet ? e.add(t) : e.set(t, n), $ = (t, e, n, r) => (Gn(t, e, "write to private field"), e.set(t, n), n), he = (t, e, n) => (Gn(t, e, "access private method"), n), J, Oe, Re, At, Rt, st, De, ot, _e, xe, Le, $e, et, se, On, En, An, ai, kn, jn, tt, Cn, Pn;
7208
+ class kt extends EventTarget {
7205
7209
  constructor(e, n) {
7206
7210
  var r, i;
7207
7211
  super(), N(this, se), this.CONNECTING = 0, this.OPEN = 1, this.CLOSED = 2, N(this, J), N(this, Oe), N(this, Re), N(this, At), N(this, Rt), N(this, st), N(this, De), N(this, ot, null), N(this, _e), N(this, xe), N(this, Le, null), N(this, $e, null), N(this, et, null), N(this, En, async (s) => {
7208
7212
  var o;
7209
7213
  A(this, xe).reset();
7210
- const { body: a, redirected: u, status: d, headers: c } = s;
7211
- if (d === 204) {
7214
+ const { body: a, redirected: u, status: c, headers: d } = s;
7215
+ if (c === 204) {
7212
7216
  he(this, se, tt).call(this, "Server sent HTTP 204, not reconnecting", 204), this.close();
7213
7217
  return;
7214
7218
  }
7215
- if (u ? $(this, Re, new URL(s.url)) : $(this, Re, void 0), d !== 200) {
7216
- he(this, se, tt).call(this, `Non-200 status code (${d})`, d);
7219
+ if (u ? $(this, Re, new URL(s.url)) : $(this, Re, void 0), c !== 200) {
7220
+ he(this, se, tt).call(this, `Non-200 status code (${c})`, c);
7217
7221
  return;
7218
7222
  }
7219
- if (!(c.get("content-type") || "").startsWith("text/event-stream")) {
7220
- he(this, se, tt).call(this, 'Invalid content type, expected "text/event-stream"', d);
7223
+ if (!(d.get("content-type") || "").startsWith("text/event-stream")) {
7224
+ he(this, se, tt).call(this, 'Invalid content type, expected "text/event-stream"', c);
7221
7225
  return;
7222
7226
  }
7223
7227
  if (A(this, J) === this.CLOSED)
@@ -7225,7 +7229,7 @@ class jt extends EventTarget {
7225
7229
  $(this, J, this.OPEN);
7226
7230
  const f = new Event("open");
7227
7231
  if ((o = A(this, et)) == null || o.call(this, f), this.dispatchEvent(f), typeof a != "object" || !a || !("getReader" in a)) {
7228
- he(this, se, tt).call(this, "Invalid response body, expected a web ReadableStream", d), this.close();
7232
+ he(this, se, tt).call(this, "Invalid response body, expected a web ReadableStream", c), this.close();
7229
7233
  return;
7230
7234
  }
7231
7235
  const l = new TextDecoder(), p = a.getReader();
@@ -7236,7 +7240,7 @@ class jt extends EventTarget {
7236
7240
  } while (y);
7237
7241
  }), N(this, An, (s) => {
7238
7242
  $(this, _e, void 0), !(s.name === "AbortError" || s.type === "aborted") && he(this, se, Cn).call(this, Sn(s));
7239
- }), N(this, jn, (s) => {
7243
+ }), N(this, kn, (s) => {
7240
7244
  typeof s.id == "string" && $(this, ot, s.id);
7241
7245
  const o = new MessageEvent(s.event || "message", {
7242
7246
  data: s.data,
@@ -7244,7 +7248,7 @@ class jt extends EventTarget {
7244
7248
  lastEventId: s.id || ""
7245
7249
  });
7246
7250
  A(this, $e) && (!s.event || s.event === "message") && A(this, $e).call(this, o), this.dispatchEvent(o);
7247
- }), N(this, kn, (s) => {
7251
+ }), N(this, jn, (s) => {
7248
7252
  $(this, st, s);
7249
7253
  }), N(this, Pn, () => {
7250
7254
  $(this, De, void 0), A(this, J) === this.CONNECTING && he(this, se, On).call(this);
@@ -7260,8 +7264,8 @@ class jt extends EventTarget {
7260
7264
  throw Rc("An invalid or illegal string was specified");
7261
7265
  }
7262
7266
  $(this, xe, Ic({
7263
- onEvent: A(this, jn),
7264
- onRetry: A(this, kn)
7267
+ onEvent: A(this, kn),
7268
+ onRetry: A(this, jn)
7265
7269
  })), $(this, J, this.CONNECTING), $(this, st, 3e3), $(this, Rt, (r = n == null ? void 0 : n.fetch) != null ? r : globalThis.fetch), $(this, At, (i = n == null ? void 0 : n.withCredentials) != null ? i : !1), he(this, se, On).call(this);
7266
7270
  }
7267
7271
  /**
@@ -7360,7 +7364,7 @@ ai = function() {
7360
7364
  signal: (t = A(this, _e)) == null ? void 0 : t.signal
7361
7365
  };
7362
7366
  return "window" in globalThis && (e.credentials = this.withCredentials ? "include" : "same-origin"), e;
7363
- }, jn = /* @__PURE__ */ new WeakMap(), kn = /* @__PURE__ */ new WeakMap(), /**
7367
+ }, kn = /* @__PURE__ */ new WeakMap(), jn = /* @__PURE__ */ new WeakMap(), /**
7364
7368
  * Handles the process referred to in the EventSource specification as "failing a connection".
7365
7369
  *
7366
7370
  * @param error - The error causing the connection to fail
@@ -7391,24 +7395,24 @@ Cn = function(t, e) {
7391
7395
  *
7392
7396
  * @public
7393
7397
  */
7394
- jt.CONNECTING = 0, /**
7398
+ kt.CONNECTING = 0, /**
7395
7399
  * ReadyState representing an EventSource connection that is open (eg connected)
7396
7400
  *
7397
7401
  * @public
7398
7402
  */
7399
- jt.OPEN = 1, /**
7403
+ kt.OPEN = 1, /**
7400
7404
  * ReadyState representing an EventSource connection that is closed (eg disconnected)
7401
7405
  *
7402
7406
  * @public
7403
7407
  */
7404
- jt.CLOSED = 2;
7408
+ kt.CLOSED = 2;
7405
7409
  function xc() {
7406
7410
  const t = "document" in globalThis ? globalThis.document : void 0;
7407
7411
  return t && typeof t == "object" && "baseURI" in t && typeof t.baseURI == "string" ? t.baseURI : void 0;
7408
7412
  }
7409
7413
  const Qn = class Qn extends Pc {
7410
7414
  };
7411
- Qn.EventSourceImpl = jt;
7415
+ Qn.EventSourceImpl = kt;
7412
7416
  let In = Qn;
7413
7417
  function $c(t) {
7414
7418
  const e = {
@@ -7430,15 +7434,15 @@ function zc({
7430
7434
  children: o,
7431
7435
  renderCursor: a,
7432
7436
  propagate: u,
7433
- zIndex: d
7437
+ zIndex: c
7434
7438
  }) {
7435
- const c = e || `cursors-space-default--${String(n.type)}-${n.id}`, f = n.usePresence({
7436
- keys: [c]
7439
+ const d = e || `cursors-space-default--${String(n.type)}-${n.id}`, f = n.usePresence({
7440
+ keys: [d]
7437
7441
  }), l = n._core._reactor.getPresence(n.type, n.id);
7438
7442
  function p(g, m) {
7439
7443
  const E = m.clientX, S = m.clientY, I = (E - g.left) / g.width * 100, x = (S - g.top) / g.height * 100;
7440
7444
  f.publishPresence({
7441
- [c]: {
7445
+ [d]: {
7442
7446
  x: E,
7443
7447
  y: S,
7444
7448
  xPercent: I,
@@ -7454,7 +7458,7 @@ function zc({
7454
7458
  }
7455
7459
  function b(g) {
7456
7460
  f.publishPresence({
7457
- [c]: void 0
7461
+ [d]: void 0
7458
7462
  });
7459
7463
  }
7460
7464
  function _(g) {
@@ -7469,10 +7473,10 @@ function zc({
7469
7473
  }
7470
7474
  function w(g) {
7471
7475
  f.publishPresence({
7472
- [c]: void 0
7476
+ [d]: void 0
7473
7477
  });
7474
7478
  }
7475
- return js(
7479
+ return ks(
7476
7480
  t,
7477
7481
  {
7478
7482
  onMouseMove: y,
@@ -7493,10 +7497,10 @@ function zc({
7493
7497
  style: {
7494
7498
  ...ui,
7495
7499
  ...Uc,
7496
- zIndex: d !== void 0 ? d : Lc
7500
+ zIndex: c !== void 0 ? c : Lc
7497
7501
  },
7498
7502
  children: Object.entries(f.peers).map(([g, m]) => {
7499
- const E = m[c];
7503
+ const E = m[d];
7500
7504
  return E ? /* @__PURE__ */ W.jsx(
7501
7505
  "div",
7502
7506
  {
@@ -7515,7 +7519,7 @@ function zc({
7515
7519
  ) : null;
7516
7520
  })
7517
7521
  },
7518
- c
7522
+ d
7519
7523
  )
7520
7524
  ]
7521
7525
  );