@manyducks.co/dolla 2.0.0-alpha.53 → 2.0.0-alpha.55

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.
Files changed (52) hide show
  1. package/README.md +1 -12
  2. package/dist/core/context.d.ts +80 -54
  3. package/dist/core/index.d.ts +8 -7
  4. package/dist/core/logger.d.ts +9 -4
  5. package/dist/core/markup.d.ts +10 -10
  6. package/dist/core/mount.d.ts +11 -6
  7. package/dist/core/nodes/dynamic.d.ts +3 -3
  8. package/dist/core/nodes/html.d.ts +6 -5
  9. package/dist/core/nodes/outlet.d.ts +3 -4
  10. package/dist/core/nodes/portal.d.ts +2 -2
  11. package/dist/core/nodes/repeat.d.ts +6 -6
  12. package/dist/core/nodes/view.d.ts +13 -81
  13. package/dist/core/symbols.d.ts +0 -2
  14. package/dist/core/views/default-crash-view.d.ts +5 -1
  15. package/dist/core/views/fragment.d.ts +2 -2
  16. package/dist/fragment-VXM-P2tT.js +7 -0
  17. package/dist/fragment-VXM-P2tT.js.map +1 -0
  18. package/dist/http.js +1 -1
  19. package/dist/i18n.js +14 -14
  20. package/dist/i18n.js.map +1 -1
  21. package/dist/index.js +54 -61
  22. package/dist/index.js.map +1 -1
  23. package/dist/jsx-dev-runtime.js +8 -8
  24. package/dist/jsx-dev-runtime.js.map +1 -1
  25. package/dist/jsx-runtime.js +9 -9
  26. package/dist/jsx-runtime.js.map +1 -1
  27. package/dist/{logger-CByUPmlz.js → logger-CXdzxt1e.js} +178 -176
  28. package/dist/{logger-CByUPmlz.js.map → logger-CXdzxt1e.js.map} +1 -1
  29. package/dist/markup-yTuFdC0t.js +923 -0
  30. package/dist/markup-yTuFdC0t.js.map +1 -0
  31. package/dist/router/router.d.ts +9 -6
  32. package/dist/router-B-rtBG7i.js +488 -0
  33. package/dist/router-B-rtBG7i.js.map +1 -0
  34. package/dist/router.js +1 -1
  35. package/dist/router.js.map +1 -1
  36. package/dist/{typeChecking-EAVNeFyB.js → typeChecking-lgllKIVq.js} +5 -5
  37. package/dist/{typeChecking-EAVNeFyB.js.map → typeChecking-lgllKIVq.js.map} +1 -1
  38. package/dist/types.d.ts +21 -0
  39. package/docs/mixins.md +32 -0
  40. package/docs/ref.md +93 -0
  41. package/index.d.ts +1 -1
  42. package/notes/mixins.md +22 -0
  43. package/notes/scratch.md +24 -0
  44. package/package.json +2 -2
  45. package/dist/core/store.d.ts +0 -57
  46. package/dist/core/views/passthrough.d.ts +0 -5
  47. package/dist/fragment-DFnx8z2z.js +0 -8
  48. package/dist/fragment-DFnx8z2z.js.map +0 -1
  49. package/dist/router-W2HPWbeI.js +0 -482
  50. package/dist/router-W2HPWbeI.js.map +0 -1
  51. package/dist/view-CAEIbcZt.js +0 -932
  52. package/dist/view-CAEIbcZt.js.map +0 -1
@@ -1,10 +1,10 @@
1
- import { c as T, t as N, i as B } from "./typeChecking-EAVNeFyB.js";
1
+ import { c as D, t as q, b as B } from "./typeChecking-lgllKIVq.js";
2
2
  var v = /* @__PURE__ */ ((e) => (e[e.Computed = 1] = "Computed", e[e.Effect = 2] = "Effect", e[e.Tracking = 4] = "Tracking", e[e.Notified = 8] = "Notified", e[e.Recursed = 16] = "Recursed", e[e.Dirty = 32] = "Dirty", e[e.PendingComputed = 64] = "PendingComputed", e[e.PendingEffect = 128] = "PendingEffect", e[e.Propagated = 224] = "Propagated", e))(v || {});
3
3
  function _({
4
4
  updateComputed: e,
5
5
  notifyEffect: t
6
6
  }) {
7
- let i, r;
7
+ let f, r;
8
8
  return {
9
9
  /**
10
10
  * Links a given dependency and subscriber if they are not already linked.
@@ -14,17 +14,17 @@ function _({
14
14
  * @returns The newly created link object if the two are not already linked; otherwise `undefined`.
15
15
  */
16
16
  link(n, s) {
17
- const f = s.depsTail;
18
- if (f !== void 0 && f.dep === n)
17
+ const i = s.depsTail;
18
+ if (i !== void 0 && i.dep === n)
19
19
  return;
20
- const c = f !== void 0 ? f.nextDep : s.deps;
20
+ const c = i !== void 0 ? i.nextDep : s.deps;
21
21
  if (c !== void 0 && c.dep === n) {
22
22
  s.depsTail = c;
23
23
  return;
24
24
  }
25
- const o = n.subsTail;
26
- if (!(o !== void 0 && o.sub === s && E(o, s)))
27
- return u(n, s, c, f);
25
+ const u = n.subsTail;
26
+ if (!(u !== void 0 && u.sub === s && E(u, s)))
27
+ return o(n, s, c, i);
28
28
  },
29
29
  /**
30
30
  * Traverses and marks subscribers starting from the provided link.
@@ -36,26 +36,26 @@ function _({
36
36
  * @param link - The starting link from which propagation begins.
37
37
  */
38
38
  propagate(n) {
39
- let s = 32, f = n, c = 0;
39
+ let s = 32, i = n, c = 0;
40
40
  e: do {
41
- const o = n.sub, l = o.flags;
42
- if (!(l & 244) && (o.flags = l | s | 8, !0) || l & 16 && !(l & 4) && (o.flags = l & -17 | s | 8, !0) || !(l & 224) && E(n, o) && (o.flags = l | 16 | s | 8, o.subs !== void 0)) {
43
- const g = o.subs;
41
+ const u = n.sub, a = u.flags;
42
+ if (!(a & 244) && (u.flags = a | s | 8, !0) || a & 16 && !(a & 4) && (u.flags = a & -17 | s | 8, !0) || !(a & 224) && E(n, u) && (u.flags = a | 16 | s | 8, u.subs !== void 0)) {
43
+ const g = u.subs;
44
44
  if (g !== void 0) {
45
- g.nextSub !== void 0 ? (g.prevSub = f, n = f = g, s = 64, ++c) : (n = g, s = l & 2 ? 128 : 64);
45
+ g.nextSub !== void 0 ? (g.prevSub = i, n = i = g, s = 64, ++c) : (n = g, s = a & 2 ? 128 : 64);
46
46
  continue;
47
47
  }
48
- l & 2 && (r !== void 0 ? r.depsTail.nextDep = o.deps : i = o, r = o);
49
- } else l & (4 | s) ? !(l & s) && l & 224 && E(n, o) && (o.flags = l | s) : (o.flags = l | s | 8, (l & 10) === 2 && (r !== void 0 ? r.depsTail.nextDep = o.deps : i = o, r = o));
50
- if ((n = f.nextSub) !== void 0) {
51
- f = n, s = c ? 64 : 32;
48
+ a & 2 && (r !== void 0 ? r.depsTail.nextDep = u.deps : f = u, r = u);
49
+ } else a & (4 | s) ? !(a & s) && a & 224 && E(n, u) && (u.flags = a | s) : (u.flags = a | s | 8, (a & 10) === 2 && (r !== void 0 ? r.depsTail.nextDep = u.deps : f = u, r = u));
50
+ if ((n = i.nextSub) !== void 0) {
51
+ i = n, s = c ? 64 : 32;
52
52
  continue;
53
53
  }
54
54
  for (; c; ) {
55
55
  --c;
56
- const q = f.dep.subs;
57
- if (f = q.prevSub, q.prevSub = void 0, (n = f.nextSub) !== void 0) {
58
- f = n, s = c ? 64 : 32;
56
+ const P = i.dep.subs;
57
+ if (i = P.prevSub, P.prevSub = void 0, (n = i.nextSub) !== void 0) {
58
+ i = n, s = c ? 64 : 32;
59
59
  continue e;
60
60
  }
61
61
  }
@@ -84,9 +84,9 @@ function _({
84
84
  endTracking(n) {
85
85
  const s = n.depsTail;
86
86
  if (s !== void 0) {
87
- const f = s.nextDep;
88
- f !== void 0 && (P(f), s.nextDep = void 0);
89
- } else n.deps !== void 0 && (P(n.deps), n.deps = void 0);
87
+ const i = s.nextDep;
88
+ i !== void 0 && (C(i), s.nextDep = void 0);
89
+ } else n.deps !== void 0 && (C(n.deps), n.deps = void 0);
90
90
  n.flags &= -5;
91
91
  },
92
92
  /**
@@ -100,7 +100,7 @@ function _({
100
100
  * @returns `true` if the subscriber is marked as Dirty; otherwise `false`.
101
101
  */
102
102
  updateDirtyFlag(n, s) {
103
- return a(n.deps) ? (n.flags = s | 32, !0) : (n.flags = s & -65, !1);
103
+ return l(n.deps) ? (n.flags = s | 32, !0) : (n.flags = s & -65, !1);
104
104
  },
105
105
  /**
106
106
  * Updates the computed subscriber if necessary before its value is accessed.
@@ -113,9 +113,9 @@ function _({
113
113
  * @param flags - The current flag set for this subscriber.
114
114
  */
115
115
  processComputedUpdate(n, s) {
116
- if ((s & 32 || (a(n.deps) || (n.flags = s & -65, !1))) && e(n)) {
117
- const f = n.subs;
118
- f !== void 0 && d(f);
116
+ if ((s & 32 || (l(n.deps) || (n.flags = s & -65, !1))) && e(n)) {
117
+ const i = n.subs;
118
+ i !== void 0 && d(i);
119
119
  }
120
120
  },
121
121
  /**
@@ -132,11 +132,11 @@ function _({
132
132
  processPendingInnerEffects(n, s) {
133
133
  if (s & 128) {
134
134
  n.flags = s & -129;
135
- let f = n.deps;
135
+ let i = n.deps;
136
136
  do {
137
- const c = f.dep;
138
- "flags" in c && c.flags & 2 && c.flags & 224 && t(c), f = f.nextDep;
139
- } while (f !== void 0);
137
+ const c = i.dep;
138
+ "flags" in c && c.flags & 2 && c.flags & 224 && t(c), i = i.nextDep;
139
+ } while (i !== void 0);
140
140
  }
141
141
  },
142
142
  /**
@@ -147,130 +147,130 @@ function _({
147
147
  * notifications may be triggered until fully handled.
148
148
  */
149
149
  processEffectNotifications() {
150
- for (; i !== void 0; ) {
151
- const n = i, s = n.depsTail, f = s.nextDep;
152
- f !== void 0 ? (s.nextDep = void 0, i = f.sub) : (i = void 0, r = void 0), t(n) || (n.flags &= -9);
150
+ for (; f !== void 0; ) {
151
+ const n = f, s = n.depsTail, i = s.nextDep;
152
+ i !== void 0 ? (s.nextDep = void 0, f = i.sub) : (f = void 0, r = void 0), t(n) || (n.flags &= -9);
153
153
  }
154
154
  }
155
155
  };
156
- function u(n, s, f, c) {
157
- const o = {
156
+ function o(n, s, i, c) {
157
+ const u = {
158
158
  dep: n,
159
159
  sub: s,
160
- nextDep: f,
160
+ nextDep: i,
161
161
  prevSub: void 0,
162
162
  nextSub: void 0
163
163
  };
164
- if (c === void 0 ? s.deps = o : c.nextDep = o, n.subs === void 0)
165
- n.subs = o;
164
+ if (c === void 0 ? s.deps = u : c.nextDep = u, n.subs === void 0)
165
+ n.subs = u;
166
166
  else {
167
- const l = n.subsTail;
168
- o.prevSub = l, l.nextSub = o;
167
+ const a = n.subsTail;
168
+ u.prevSub = a, a.nextSub = u;
169
169
  }
170
- return s.depsTail = o, n.subsTail = o, o;
170
+ return s.depsTail = u, n.subsTail = u, u;
171
171
  }
172
- function a(n) {
173
- let s = 0, f;
172
+ function l(n) {
173
+ let s = 0, i;
174
174
  e: do {
175
- f = !1;
175
+ i = !1;
176
176
  const c = n.dep;
177
177
  if ("flags" in c) {
178
- const o = c.flags;
179
- if ((o & 33) === 33) {
178
+ const u = c.flags;
179
+ if ((u & 33) === 33) {
180
180
  if (e(c)) {
181
- const l = c.subs;
182
- l.nextSub !== void 0 && d(l), f = !0;
181
+ const a = c.subs;
182
+ a.nextSub !== void 0 && d(a), i = !0;
183
183
  }
184
- } else if ((o & 65) === 65) {
185
- const l = c.subs;
186
- l.nextSub !== void 0 && (l.prevSub = n), n = c.deps, ++s;
184
+ } else if ((u & 65) === 65) {
185
+ const a = c.subs;
186
+ a.nextSub !== void 0 && (a.prevSub = n), n = c.deps, ++s;
187
187
  continue;
188
188
  }
189
189
  }
190
- if (!f && n.nextDep !== void 0) {
190
+ if (!i && n.nextDep !== void 0) {
191
191
  n = n.nextDep;
192
192
  continue;
193
193
  }
194
194
  if (s) {
195
- let o = n.sub;
195
+ let u = n.sub;
196
196
  do {
197
197
  --s;
198
- const l = o.subs;
199
- if (f) {
200
- if (e(o)) {
201
- (n = l.prevSub) !== void 0 ? (l.prevSub = void 0, d(o.subs), o = n.sub) : o = l.sub;
198
+ const a = u.subs;
199
+ if (i) {
200
+ if (e(u)) {
201
+ (n = a.prevSub) !== void 0 ? (a.prevSub = void 0, d(u.subs), u = n.sub) : u = a.sub;
202
202
  continue;
203
203
  }
204
204
  } else
205
- o.flags &= -65;
206
- if ((n = l.prevSub) !== void 0) {
207
- if (l.prevSub = void 0, n.nextDep !== void 0) {
205
+ u.flags &= -65;
206
+ if ((n = a.prevSub) !== void 0) {
207
+ if (a.prevSub = void 0, n.nextDep !== void 0) {
208
208
  n = n.nextDep;
209
209
  continue e;
210
210
  }
211
- o = n.sub;
211
+ u = n.sub;
212
212
  } else {
213
- if ((n = l.nextDep) !== void 0)
213
+ if ((n = a.nextDep) !== void 0)
214
214
  continue e;
215
- o = l.sub;
215
+ u = a.sub;
216
216
  }
217
- f = !1;
217
+ i = !1;
218
218
  } while (s);
219
219
  }
220
- return f;
220
+ return i;
221
221
  } while (!0);
222
222
  }
223
223
  function d(n) {
224
224
  do {
225
- const s = n.sub, f = s.flags;
226
- (f & 96) === 64 && (s.flags = f | 32 | 8, (f & 10) === 2 && (r !== void 0 ? r.depsTail.nextDep = s.deps : i = s, r = s)), n = n.nextSub;
225
+ const s = n.sub, i = s.flags;
226
+ (i & 96) === 64 && (s.flags = i | 32 | 8, (i & 10) === 2 && (r !== void 0 ? r.depsTail.nextDep = s.deps : f = s, r = s)), n = n.nextSub;
227
227
  } while (n !== void 0);
228
228
  }
229
229
  function E(n, s) {
230
- const f = s.depsTail;
231
- if (f !== void 0) {
230
+ const i = s.depsTail;
231
+ if (i !== void 0) {
232
232
  let c = s.deps;
233
233
  do {
234
234
  if (c === n)
235
235
  return !0;
236
- if (c === f)
236
+ if (c === i)
237
237
  break;
238
238
  c = c.nextDep;
239
239
  } while (c !== void 0);
240
240
  }
241
241
  return !1;
242
242
  }
243
- function P(n) {
243
+ function C(n) {
244
244
  do {
245
- const s = n.dep, f = n.nextDep, c = n.nextSub, o = n.prevSub;
246
- if (c !== void 0 ? c.prevSub = o : s.subsTail = o, o !== void 0 ? o.nextSub = c : s.subs = c, s.subs === void 0 && "deps" in s) {
247
- const l = s.flags;
248
- l & 32 || (s.flags = l | 32);
245
+ const s = n.dep, i = n.nextDep, c = n.nextSub, u = n.prevSub;
246
+ if (c !== void 0 ? c.prevSub = u : s.subsTail = u, u !== void 0 ? u.nextSub = c : s.subs = c, s.subs === void 0 && "deps" in s) {
247
+ const a = s.flags;
248
+ a & 32 || (s.flags = a | 32);
249
249
  const g = s.deps;
250
250
  if (g !== void 0) {
251
- n = g, s.depsTail.nextDep = f, s.deps = void 0, s.depsTail = void 0;
251
+ n = g, s.depsTail.nextDep = i, s.deps = void 0, s.depsTail = void 0;
252
252
  continue;
253
253
  }
254
254
  }
255
- n = f;
255
+ n = i;
256
256
  } while (n !== void 0);
257
257
  }
258
258
  }
259
259
  var {
260
260
  link: ce,
261
- propagate: le,
261
+ propagate: ae,
262
262
  updateDirtyFlag: X,
263
263
  startTracking: L,
264
264
  endTracking: A,
265
- processEffectNotifications: ae,
265
+ processEffectNotifications: le,
266
266
  processComputedUpdate: de,
267
267
  processPendingInnerEffects: I
268
268
  } = _({
269
269
  updateComputed(e) {
270
270
  L(e);
271
271
  try {
272
- const t = e.currentValue, i = e.getter(t);
273
- return t !== i ? (e.currentValue = i, !0) : !1;
272
+ const t = e.currentValue, f = e.getter(t);
273
+ return t !== f ? (e.currentValue = f, !0) : !1;
274
274
  } finally {
275
275
  A(e);
276
276
  }
@@ -299,7 +299,7 @@ const {
299
299
  propagate: Q,
300
300
  updateDirtyFlag: Y,
301
301
  startTracking: b,
302
- endTracking: C,
302
+ endTracking: N,
303
303
  processEffectNotifications: Z,
304
304
  processComputedUpdate: F,
305
305
  processPendingInnerEffects: ee
@@ -308,10 +308,10 @@ const {
308
308
  const t = p;
309
309
  p = e, b(e);
310
310
  try {
311
- const i = e.current, r = e.getter(i);
312
- return e.equals(i, r) ? !1 : (e.current = r, !0);
311
+ const f = e.current, r = e.getter(f);
312
+ return e.equals(f, r) ? !1 : (e.current = r, !0);
313
313
  } finally {
314
- p = t, C(e);
314
+ p = t, N(e);
315
315
  }
316
316
  },
317
317
  notifyEffect(e) {
@@ -326,12 +326,12 @@ function te() {
326
326
  S || (S = !0, queueMicrotask(() => {
327
327
  S = !1;
328
328
  for (let e = 0; e < h.length; e++) {
329
- const t = h[e], i = p;
329
+ const t = h[e], f = p;
330
330
  p = t, b(t);
331
331
  try {
332
332
  t.cleanup && (z(), t.cleanup(), R()), t.cleanup = t.fn() ?? void 0;
333
333
  } finally {
334
- p = i, C(t);
334
+ p = f, N(t);
335
335
  }
336
336
  }
337
337
  h.length = 0;
@@ -341,7 +341,7 @@ function V(e) {
341
341
  h.push(e), te();
342
342
  }
343
343
  function ne() {
344
- b(this), C(this), queueMicrotask(() => {
344
+ b(this), N(this), queueMicrotask(() => {
345
345
  h.splice(h.indexOf(this), 1), this.cleanup && this.cleanup();
346
346
  });
347
347
  }
@@ -352,13 +352,13 @@ function z() {
352
352
  function R() {
353
353
  p = k.pop();
354
354
  }
355
- const j = Symbol("SIGNAL"), U = Symbol("SOURCE");
355
+ const $ = Symbol("SIGNAL"), U = Symbol("SOURCE");
356
356
  function pe(e) {
357
357
  let t;
358
- return z(), t = D(e), R(), t;
358
+ return z(), t = T(e), R(), t;
359
359
  }
360
- function D(e) {
361
- return T(e) ? e() : e;
360
+ function T(e) {
361
+ return D(e) ? e() : e;
362
362
  }
363
363
  function ge(e) {
364
364
  const t = {
@@ -372,30 +372,30 @@ function ge(e) {
372
372
  return p !== void 0 && O(t, p), V(t), ne.bind(t);
373
373
  }
374
374
  function ve(e, t) {
375
- return T(e) ? re(e, t) : $(e === void 0 ? void 0 : e, t);
375
+ return D(e) ? re(e, t) : j(e === void 0 ? void 0 : e, t);
376
376
  }
377
- function $(e, t) {
378
- const i = {
377
+ function j(e, t) {
378
+ const f = {
379
379
  current: e,
380
380
  subs: void 0,
381
381
  subsTail: void 0
382
- }, r = (t == null ? void 0 : t.equals) ?? Object.is, u = function() {
382
+ }, r = (t == null ? void 0 : t.equals) ?? Object.is, o = function() {
383
383
  if (arguments.length > 0) {
384
- let a = arguments[0];
385
- if (typeof a == "function" && (a = a(i.current)), !r(i.current, a)) {
386
- i.current = a;
387
- const d = i.subs;
384
+ let l = arguments[0];
385
+ if (typeof l == "function" && (l = l(f.current)), !r(f.current, l)) {
386
+ f.current = l;
387
+ const d = f.subs;
388
388
  d !== void 0 && (Q(d), Z());
389
389
  }
390
390
  } else
391
- return p !== void 0 && O(i, p), i.current;
391
+ return p !== void 0 && O(f, p), f.current;
392
392
  };
393
- return u._type = U, u;
393
+ return o._type = U, o;
394
394
  }
395
395
  function re(e, t) {
396
- if (T(e) && e._type === j)
396
+ if (D(e) && e._type === $)
397
397
  return e._type === U ? () => e() : e;
398
- const i = {
398
+ const f = {
399
399
  current: void 0,
400
400
  equals: (t == null ? void 0 : t.equals) ?? Object.is,
401
401
  subs: void 0,
@@ -403,18 +403,18 @@ function re(e, t) {
403
403
  deps: void 0,
404
404
  depsTail: void 0,
405
405
  flags: v.Computed | v.Dirty,
406
- getter: (u) => {
407
- const a = e(u);
408
- return D(a);
406
+ getter: (o) => {
407
+ const l = e(o);
408
+ return T(l);
409
409
  }
410
410
  }, r = function() {
411
411
  if (arguments.length > 0)
412
412
  throw new Error("Signals cannot be set as their values are derived from the sources they depend on.");
413
- p !== void 0 && O(i, p);
414
- const u = i.flags;
415
- return u & (v.Dirty | v.PendingComputed) && F(i, u), i.current;
413
+ p !== void 0 && O(f, p);
414
+ const o = f.flags;
415
+ return o & (v.Dirty | v.PendingComputed) && F(f, o), f.current;
416
416
  };
417
- return r._type = j, r;
417
+ return r._type = $, r;
418
418
  }
419
419
  const se = () => {
420
420
  };
@@ -427,32 +427,32 @@ function ye(e, t) {
427
427
  }
428
428
  function xe(e, t) {
429
429
  if (Object.is(e, t)) return !0;
430
- const i = N(e);
431
- if (i !== N(t))
430
+ const f = q(e);
431
+ if (f !== q(t))
432
432
  return !1;
433
- switch (i) {
433
+ switch (f) {
434
434
  case "object":
435
435
  let r = 0;
436
- for (const u in e) {
437
- if (e[u] !== t[u]) return !1;
436
+ for (const o in e) {
437
+ if (e[o] !== t[o]) return !1;
438
438
  r++;
439
439
  }
440
440
  return Object.keys(t).length === r;
441
441
  case "array":
442
442
  if (e.length !== t.length) return !1;
443
- for (let u = 0; u < e.length; u++)
444
- if (e[u] !== t[u]) return !1;
443
+ for (let o = 0; o < e.length; o++)
444
+ if (e[o] !== t[o]) return !1;
445
445
  return !0;
446
446
  case "map":
447
447
  if (e.size !== t.size) return !1;
448
- for (const u of e.keys())
449
- if (e[u] !== t[u]) return !1;
448
+ for (const o of e.keys())
449
+ if (e[o] !== t[o]) return !1;
450
450
  return !0;
451
451
  case "set":
452
- if (T(e.symmetricDifference))
452
+ if (D(e.symmetricDifference))
453
453
  return e.symmetricDifference(t).size === 0;
454
- for (const u of e.keys())
455
- if (e[u] !== t.get(u)) return !1;
454
+ for (const o of e.keys())
455
+ if (e[o] !== t.get(o)) return !1;
456
456
  return !0;
457
457
  }
458
458
  return !1;
@@ -461,10 +461,10 @@ function m(e, t) {
461
461
  if (e === t) return !0;
462
462
  if (e && t && typeof e == "object" && typeof t == "object") {
463
463
  if (e.constructor !== t.constructor) return !1;
464
- var i, r, u;
464
+ var f, r, o;
465
465
  if (Array.isArray(e)) {
466
- if (i = e.length, i != t.length) return !1;
467
- for (r = i; r-- !== 0; ) if (!m(e[r], t[r])) return !1;
466
+ if (f = e.length, f != t.length) return !1;
467
+ for (r = f; r-- !== 0; ) if (!m(e[r], t[r])) return !1;
468
468
  return !0;
469
469
  }
470
470
  if (e instanceof Map && t instanceof Map) {
@@ -479,33 +479,33 @@ function m(e, t) {
479
479
  return !0;
480
480
  }
481
481
  if (ArrayBuffer.isView(e) && ArrayBuffer.isView(t)) {
482
- if (i = e.length, i != t.length) return !1;
483
- for (r = i; r-- !== 0; ) if (e[r] !== t[r]) return !1;
482
+ if (f = e.length, f != t.length) return !1;
483
+ for (r = f; r-- !== 0; ) if (e[r] !== t[r]) return !1;
484
484
  return !0;
485
485
  }
486
486
  if (e.constructor === RegExp) return e.source === t.source && e.flags === t.flags;
487
487
  if (e.valueOf !== Object.prototype.valueOf) return e.valueOf() === t.valueOf();
488
488
  if (e.toString !== Object.prototype.toString) return e.toString() === t.toString();
489
- if (u = Object.keys(e), i = u.length, i !== Object.keys(t).length) return !1;
490
- for (r = i; r-- !== 0; ) if (!Object.prototype.hasOwnProperty.call(t, u[r])) return !1;
491
- for (r = i; r-- !== 0; ) {
492
- var a = u[r];
493
- if (!m(e[a], t[a])) return !1;
489
+ if (o = Object.keys(e), f = o.length, f !== Object.keys(t).length) return !1;
490
+ for (r = f; r-- !== 0; ) if (!Object.prototype.hasOwnProperty.call(t, o[r])) return !1;
491
+ for (r = f; r-- !== 0; ) {
492
+ var l = o[r];
493
+ if (!m(e[l], t[l])) return !1;
494
494
  }
495
495
  return !0;
496
496
  }
497
497
  return e !== e && t !== t;
498
498
  }
499
- function De(e, t) {
500
- const i = {};
499
+ function Te(e, t) {
500
+ const f = {};
501
501
  for (const r in t)
502
- e.includes(r) || (i[r] = t[r]);
503
- return i;
502
+ e.includes(r) || (f[r] = t[r]);
503
+ return f;
504
504
  }
505
- function ie(e) {
505
+ function fe(e) {
506
506
  let t = 0;
507
- for (let i = 0; i < e.length; i++)
508
- t = (t + e.charCodeAt(i) * 10) % 360;
507
+ for (let f = 0; f < e.length; f++)
508
+ t = (t + e.charCodeAt(f) * 10) % 360;
509
509
  return `oklch(0.68 0.15 ${t}deg)`;
510
510
  }
511
511
  function M(e) {
@@ -514,27 +514,27 @@ function M(e) {
514
514
  const t = {
515
515
  positive: [],
516
516
  negative: []
517
- }, i = e.split(",").map((r) => r.trim()).filter((r) => r !== "");
518
- for (let r of i) {
519
- let u = "positive";
520
- r.startsWith("-") && (u = "negative", r = r.slice(1)), r === "*" ? t[u].push(function() {
517
+ }, f = e.split(",").map((r) => r.trim()).filter((r) => r !== "");
518
+ for (let r of f) {
519
+ let o = "positive";
520
+ r.startsWith("-") && (o = "negative", r = r.slice(1)), r === "*" ? t[o].push(function() {
521
521
  return !0;
522
- }) : r.endsWith("*") ? t[u].push(function(a) {
523
- return a.startsWith(r.slice(0, r.length - 1));
524
- }) : t[u].push(function(a) {
525
- return a === r;
522
+ }) : r.endsWith("*") ? t[o].push(function(l) {
523
+ return l.startsWith(r.slice(0, r.length - 1));
524
+ }) : t[o].push(function(l) {
525
+ return l === r;
526
526
  });
527
527
  }
528
528
  return function(r) {
529
- const { positive: u, negative: a } = t;
530
- return !(a.some((d) => d(r)) || u.length > 0 && !u.some((d) => d(r)));
529
+ const { positive: o, negative: l } = t;
530
+ return !(l.some((d) => d(r)) || o.length > 0 && !o.some((d) => d(r)));
531
531
  };
532
532
  }
533
533
  let G = "production";
534
- function fe() {
534
+ function ie() {
535
535
  return G;
536
536
  }
537
- function Te(e) {
537
+ function De(e) {
538
538
  G = e;
539
539
  }
540
540
  let y = {
@@ -542,23 +542,23 @@ let y = {
542
542
  log: "development",
543
543
  warn: "development",
544
544
  error: !0
545
- }, W = M("*,-Dolla.*"), x = [];
545
+ }, W = M("*,-dolla.*"), x = [];
546
546
  function Ee(e) {
547
547
  return x.push(e), function() {
548
548
  x.splice(x.indexOf(e), 1);
549
549
  };
550
550
  }
551
551
  function Se(e, t) {
552
- const i = (t == null ? void 0 : t.console) ?? oe(), r = (u) => {
553
- let a = D(e);
554
- if (y[u] === !1 || B(y[u]) && y[u] !== fe() || !W(a))
552
+ const f = (t == null ? void 0 : t.console) ?? ue(), r = (o) => {
553
+ let l = T(e);
554
+ if (y[o] === !1 || B(y[o]) && y[o] !== ie() || !W(l))
555
555
  return se;
556
556
  {
557
- let d = `%c${a}`;
558
- return t != null && t.uid ? d += ` %c[uid: %c${t.uid}%c]` : d += "%c%c%c", i[u].bind(
559
- i,
557
+ let d = `%c${l}`;
558
+ return t != null && t.tag ? t.tagName ? d += ` %c[${t.tagName}: %c${t.tag}%c]` : d += ` %c[%c${t.tag}%c]` : d += "%c%c%c", f[o].bind(
559
+ f,
560
560
  d,
561
- `color:${ie(d)};font-weight:bold`,
561
+ `color:${fe(d)};font-weight:bold`,
562
562
  "color:#777",
563
563
  "color:#aaa",
564
564
  "color:#777"
@@ -578,14 +578,16 @@ function Se(e, t) {
578
578
  get error() {
579
579
  return r("error");
580
580
  },
581
- crash(u) {
582
- const a = {
583
- error: u,
584
- loggerName: D(e),
585
- uid: t == null ? void 0 : t.uid
581
+ crash(o) {
582
+ const l = {
583
+ error: o,
584
+ loggerName: T(e),
585
+ tag: t == null ? void 0 : t.tag,
586
+ tagName: t == null ? void 0 : t.tagName
586
587
  };
587
588
  for (const d of x)
588
- d(a);
589
+ d(l);
590
+ return o;
589
591
  }
590
592
  };
591
593
  }
@@ -594,11 +596,11 @@ function we(e) {
594
596
  }
595
597
  function me(e) {
596
598
  for (const t in e) {
597
- const i = e[t];
598
- i && (y[t] = i);
599
+ const f = e[t];
600
+ f && (y[t] = f);
599
601
  }
600
602
  }
601
- function oe() {
603
+ function ue() {
602
604
  if (typeof window < "u" && window.console)
603
605
  return window.console;
604
606
  if (typeof global < "u" && global.console)
@@ -607,18 +609,18 @@ function oe() {
607
609
  export {
608
610
  ve as $,
609
611
  ye as a,
610
- fe as b,
611
- Te as c,
612
+ ie as b,
613
+ De as c,
612
614
  m as d,
613
615
  ge as e,
614
616
  Se as f,
615
- D as g,
617
+ T as g,
616
618
  we as h,
617
619
  me as i,
618
- De as j,
619
- he as k,
620
+ he as j,
621
+ Te as k,
620
622
  Ee as o,
621
623
  pe as p,
622
624
  xe as s
623
625
  };
624
- //# sourceMappingURL=logger-CByUPmlz.js.map
626
+ //# sourceMappingURL=logger-CXdzxt1e.js.map