@manyducks.co/dolla 2.0.0-alpha.53 → 2.0.0-alpha.54
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/core/index.d.ts +1 -0
- package/dist/core/logger.d.ts +8 -3
- package/dist/core/mixin.d.ts +62 -0
- package/dist/core/nodes/html.d.ts +3 -2
- package/dist/core/nodes/view.d.ts +2 -2
- package/dist/core/views/default-crash-view.d.ts +5 -1
- package/dist/{fragment-DFnx8z2z.js → fragment-CmWsN-4Y.js} +2 -2
- package/dist/{fragment-DFnx8z2z.js.map → fragment-CmWsN-4Y.js.map} +1 -1
- package/dist/i18n.js +1 -1
- package/dist/index.js +46 -39
- package/dist/index.js.map +1 -1
- package/dist/jsx-dev-runtime.js +2 -2
- package/dist/jsx-runtime.js +2 -2
- package/dist/{logger-CByUPmlz.js → logger-CBfhf3fA.js} +136 -135
- package/dist/{logger-CByUPmlz.js.map → logger-CBfhf3fA.js.map} +1 -1
- package/dist/{router-W2HPWbeI.js → router-BoJac1lD.js} +3 -3
- package/dist/{router-W2HPWbeI.js.map → router-BoJac1lD.js.map} +1 -1
- package/dist/router.js +1 -1
- package/dist/types.d.ts +21 -0
- package/dist/{view-CAEIbcZt.js → view-BKpHFpWG.js} +504 -392
- package/dist/view-BKpHFpWG.js.map +1 -0
- package/docs/mixins.md +32 -0
- package/index.d.ts +1 -1
- package/notes/mixins.md +22 -0
- package/package.json +1 -1
- package/dist/view-CAEIbcZt.js.map +0 -1
|
@@ -1,10 +1,10 @@
|
|
|
1
|
-
import { c as T, t as
|
|
1
|
+
import { c as T, t as q, i as B } from "./typeChecking-EAVNeFyB.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
|
|
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
|
|
18
|
-
if (
|
|
17
|
+
const i = s.depsTail;
|
|
18
|
+
if (i !== void 0 && i.dep === n)
|
|
19
19
|
return;
|
|
20
|
-
const c =
|
|
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
25
|
const o = n.subsTail;
|
|
26
26
|
if (!(o !== void 0 && o.sub === s && E(o, s)))
|
|
27
|
-
return u(n, s, c,
|
|
27
|
+
return u(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,
|
|
39
|
+
let s = 32, i = n, c = 0;
|
|
40
40
|
e: do {
|
|
41
|
-
const o = n.sub,
|
|
42
|
-
if (!(
|
|
41
|
+
const o = n.sub, a = o.flags;
|
|
42
|
+
if (!(a & 244) && (o.flags = a | s | 8, !0) || a & 16 && !(a & 4) && (o.flags = a & -17 | s | 8, !0) || !(a & 224) && E(n, o) && (o.flags = a | 16 | s | 8, o.subs !== void 0)) {
|
|
43
43
|
const g = o.subs;
|
|
44
44
|
if (g !== void 0) {
|
|
45
|
-
g.nextSub !== void 0 ? (g.prevSub =
|
|
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
|
-
|
|
49
|
-
} else
|
|
50
|
-
if ((n =
|
|
51
|
-
|
|
48
|
+
a & 2 && (r !== void 0 ? r.depsTail.nextDep = o.deps : f = o, r = o);
|
|
49
|
+
} else a & (4 | s) ? !(a & s) && a & 224 && E(n, o) && (o.flags = a | s) : (o.flags = a | s | 8, (a & 10) === 2 && (r !== void 0 ? r.depsTail.nextDep = o.deps : f = o, r = o));
|
|
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
|
|
57
|
-
if (
|
|
58
|
-
|
|
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
|
|
88
|
-
|
|
89
|
-
} else 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
|
|
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 || (
|
|
117
|
-
const
|
|
118
|
-
|
|
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
|
|
135
|
+
let i = n.deps;
|
|
136
136
|
do {
|
|
137
|
-
const c =
|
|
138
|
-
"flags" in c && c.flags & 2 && c.flags & 224 && t(c),
|
|
139
|
-
} while (
|
|
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,47 +147,47 @@ function _({
|
|
|
147
147
|
* notifications may be triggered until fully handled.
|
|
148
148
|
*/
|
|
149
149
|
processEffectNotifications() {
|
|
150
|
-
for (;
|
|
151
|
-
const n =
|
|
152
|
-
|
|
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,
|
|
156
|
+
function u(n, s, i, c) {
|
|
157
157
|
const o = {
|
|
158
158
|
dep: n,
|
|
159
159
|
sub: s,
|
|
160
|
-
nextDep:
|
|
160
|
+
nextDep: i,
|
|
161
161
|
prevSub: void 0,
|
|
162
162
|
nextSub: void 0
|
|
163
163
|
};
|
|
164
164
|
if (c === void 0 ? s.deps = o : c.nextDep = o, n.subs === void 0)
|
|
165
165
|
n.subs = o;
|
|
166
166
|
else {
|
|
167
|
-
const
|
|
168
|
-
o.prevSub =
|
|
167
|
+
const a = n.subsTail;
|
|
168
|
+
o.prevSub = a, a.nextSub = o;
|
|
169
169
|
}
|
|
170
170
|
return s.depsTail = o, n.subsTail = o, o;
|
|
171
171
|
}
|
|
172
|
-
function
|
|
173
|
-
let s = 0,
|
|
172
|
+
function l(n) {
|
|
173
|
+
let s = 0, i;
|
|
174
174
|
e: do {
|
|
175
|
-
|
|
175
|
+
i = !1;
|
|
176
176
|
const c = n.dep;
|
|
177
177
|
if ("flags" in c) {
|
|
178
178
|
const o = c.flags;
|
|
179
179
|
if ((o & 33) === 33) {
|
|
180
180
|
if (e(c)) {
|
|
181
|
-
const
|
|
182
|
-
|
|
181
|
+
const a = c.subs;
|
|
182
|
+
a.nextSub !== void 0 && d(a), i = !0;
|
|
183
183
|
}
|
|
184
184
|
} else if ((o & 65) === 65) {
|
|
185
|
-
const
|
|
186
|
-
|
|
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 (!
|
|
190
|
+
if (!i && n.nextDep !== void 0) {
|
|
191
191
|
n = n.nextDep;
|
|
192
192
|
continue;
|
|
193
193
|
}
|
|
@@ -195,82 +195,82 @@ function _({
|
|
|
195
195
|
let o = n.sub;
|
|
196
196
|
do {
|
|
197
197
|
--s;
|
|
198
|
-
const
|
|
199
|
-
if (
|
|
198
|
+
const a = o.subs;
|
|
199
|
+
if (i) {
|
|
200
200
|
if (e(o)) {
|
|
201
|
-
(n =
|
|
201
|
+
(n = a.prevSub) !== void 0 ? (a.prevSub = void 0, d(o.subs), o = n.sub) : o = a.sub;
|
|
202
202
|
continue;
|
|
203
203
|
}
|
|
204
204
|
} else
|
|
205
205
|
o.flags &= -65;
|
|
206
|
-
if ((n =
|
|
207
|
-
if (
|
|
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
211
|
o = n.sub;
|
|
212
212
|
} else {
|
|
213
|
-
if ((n =
|
|
213
|
+
if ((n = a.nextDep) !== void 0)
|
|
214
214
|
continue e;
|
|
215
|
-
o =
|
|
215
|
+
o = a.sub;
|
|
216
216
|
}
|
|
217
|
-
|
|
217
|
+
i = !1;
|
|
218
218
|
} while (s);
|
|
219
219
|
}
|
|
220
|
-
return
|
|
220
|
+
return i;
|
|
221
221
|
} while (!0);
|
|
222
222
|
}
|
|
223
223
|
function d(n) {
|
|
224
224
|
do {
|
|
225
|
-
const s = n.sub,
|
|
226
|
-
(
|
|
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
|
|
231
|
-
if (
|
|
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 ===
|
|
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
|
|
243
|
+
function C(n) {
|
|
244
244
|
do {
|
|
245
|
-
const s = n.dep,
|
|
245
|
+
const s = n.dep, i = n.nextDep, c = n.nextSub, o = n.prevSub;
|
|
246
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
|
|
248
|
-
|
|
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 =
|
|
251
|
+
n = g, s.depsTail.nextDep = i, s.deps = void 0, s.depsTail = void 0;
|
|
252
252
|
continue;
|
|
253
253
|
}
|
|
254
254
|
}
|
|
255
|
-
n =
|
|
255
|
+
n = i;
|
|
256
256
|
} while (n !== void 0);
|
|
257
257
|
}
|
|
258
258
|
}
|
|
259
259
|
var {
|
|
260
260
|
link: ce,
|
|
261
|
-
propagate:
|
|
261
|
+
propagate: ae,
|
|
262
262
|
updateDirtyFlag: X,
|
|
263
263
|
startTracking: L,
|
|
264
264
|
endTracking: A,
|
|
265
|
-
processEffectNotifications:
|
|
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,
|
|
273
|
-
return t !==
|
|
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:
|
|
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
|
|
312
|
-
return e.equals(
|
|
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,
|
|
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],
|
|
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 =
|
|
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),
|
|
344
|
+
b(this), N(this), queueMicrotask(() => {
|
|
345
345
|
h.splice(h.indexOf(this), 1), this.cleanup && this.cleanup();
|
|
346
346
|
});
|
|
347
347
|
}
|
|
@@ -352,7 +352,7 @@ function z() {
|
|
|
352
352
|
function R() {
|
|
353
353
|
p = k.pop();
|
|
354
354
|
}
|
|
355
|
-
const
|
|
355
|
+
const $ = Symbol("SIGNAL"), U = Symbol("SOURCE");
|
|
356
356
|
function pe(e) {
|
|
357
357
|
let t;
|
|
358
358
|
return z(), t = D(e), R(), 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) :
|
|
375
|
+
return T(e) ? re(e, t) : j(e === void 0 ? void 0 : e, t);
|
|
376
376
|
}
|
|
377
|
-
function
|
|
378
|
-
const
|
|
377
|
+
function j(e, t) {
|
|
378
|
+
const f = {
|
|
379
379
|
current: e,
|
|
380
380
|
subs: void 0,
|
|
381
381
|
subsTail: void 0
|
|
382
382
|
}, r = (t == null ? void 0 : t.equals) ?? Object.is, u = function() {
|
|
383
383
|
if (arguments.length > 0) {
|
|
384
|
-
let
|
|
385
|
-
if (typeof
|
|
386
|
-
|
|
387
|
-
const d =
|
|
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(
|
|
391
|
+
return p !== void 0 && O(f, p), f.current;
|
|
392
392
|
};
|
|
393
393
|
return u._type = U, u;
|
|
394
394
|
}
|
|
395
395
|
function re(e, t) {
|
|
396
|
-
if (T(e) && e._type ===
|
|
396
|
+
if (T(e) && e._type === $)
|
|
397
397
|
return e._type === U ? () => e() : e;
|
|
398
|
-
const
|
|
398
|
+
const f = {
|
|
399
399
|
current: void 0,
|
|
400
400
|
equals: (t == null ? void 0 : t.equals) ?? Object.is,
|
|
401
401
|
subs: void 0,
|
|
@@ -404,17 +404,17 @@ function re(e, t) {
|
|
|
404
404
|
depsTail: void 0,
|
|
405
405
|
flags: v.Computed | v.Dirty,
|
|
406
406
|
getter: (u) => {
|
|
407
|
-
const
|
|
408
|
-
return D(
|
|
407
|
+
const l = e(u);
|
|
408
|
+
return D(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(
|
|
414
|
-
const u =
|
|
415
|
-
return u & (v.Dirty | v.PendingComputed) && F(
|
|
413
|
+
p !== void 0 && O(f, p);
|
|
414
|
+
const u = f.flags;
|
|
415
|
+
return u & (v.Dirty | v.PendingComputed) && F(f, u), f.current;
|
|
416
416
|
};
|
|
417
|
-
return r._type =
|
|
417
|
+
return r._type = $, r;
|
|
418
418
|
}
|
|
419
419
|
const se = () => {
|
|
420
420
|
};
|
|
@@ -427,10 +427,10 @@ function ye(e, t) {
|
|
|
427
427
|
}
|
|
428
428
|
function xe(e, t) {
|
|
429
429
|
if (Object.is(e, t)) return !0;
|
|
430
|
-
const
|
|
431
|
-
if (
|
|
430
|
+
const f = q(e);
|
|
431
|
+
if (f !== q(t))
|
|
432
432
|
return !1;
|
|
433
|
-
switch (
|
|
433
|
+
switch (f) {
|
|
434
434
|
case "object":
|
|
435
435
|
let r = 0;
|
|
436
436
|
for (const u in e) {
|
|
@@ -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
|
|
464
|
+
var f, r, u;
|
|
465
465
|
if (Array.isArray(e)) {
|
|
466
|
-
if (
|
|
467
|
-
for (r =
|
|
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 (
|
|
483
|
-
for (r =
|
|
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),
|
|
490
|
-
for (r =
|
|
491
|
-
for (r =
|
|
492
|
-
var
|
|
493
|
-
if (!m(e[
|
|
489
|
+
if (u = Object.keys(e), f = u.length, f !== Object.keys(t).length) return !1;
|
|
490
|
+
for (r = f; r-- !== 0; ) if (!Object.prototype.hasOwnProperty.call(t, u[r])) return !1;
|
|
491
|
+
for (r = f; r-- !== 0; ) {
|
|
492
|
+
var l = u[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
499
|
function De(e, t) {
|
|
500
|
-
const
|
|
500
|
+
const f = {};
|
|
501
501
|
for (const r in t)
|
|
502
|
-
e.includes(r) || (
|
|
503
|
-
return
|
|
502
|
+
e.includes(r) || (f[r] = t[r]);
|
|
503
|
+
return f;
|
|
504
504
|
}
|
|
505
|
-
function
|
|
505
|
+
function fe(e) {
|
|
506
506
|
let t = 0;
|
|
507
|
-
for (let
|
|
508
|
-
t = (t + e.charCodeAt(
|
|
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,24 +514,24 @@ function M(e) {
|
|
|
514
514
|
const t = {
|
|
515
515
|
positive: [],
|
|
516
516
|
negative: []
|
|
517
|
-
},
|
|
518
|
-
for (let r of
|
|
517
|
+
}, f = e.split(",").map((r) => r.trim()).filter((r) => r !== "");
|
|
518
|
+
for (let r of f) {
|
|
519
519
|
let u = "positive";
|
|
520
520
|
r.startsWith("-") && (u = "negative", r = r.slice(1)), r === "*" ? t[u].push(function() {
|
|
521
521
|
return !0;
|
|
522
|
-
}) : r.endsWith("*") ? t[u].push(function(
|
|
523
|
-
return
|
|
524
|
-
}) : t[u].push(function(
|
|
525
|
-
return
|
|
522
|
+
}) : r.endsWith("*") ? t[u].push(function(l) {
|
|
523
|
+
return l.startsWith(r.slice(0, r.length - 1));
|
|
524
|
+
}) : t[u].push(function(l) {
|
|
525
|
+
return l === r;
|
|
526
526
|
});
|
|
527
527
|
}
|
|
528
528
|
return function(r) {
|
|
529
|
-
const { positive: u, negative:
|
|
530
|
-
return !(
|
|
529
|
+
const { positive: u, negative: l } = t;
|
|
530
|
+
return !(l.some((d) => d(r)) || u.length > 0 && !u.some((d) => d(r)));
|
|
531
531
|
};
|
|
532
532
|
}
|
|
533
533
|
let G = "production";
|
|
534
|
-
function
|
|
534
|
+
function ie() {
|
|
535
535
|
return G;
|
|
536
536
|
}
|
|
537
537
|
function Te(e) {
|
|
@@ -549,16 +549,16 @@ function Ee(e) {
|
|
|
549
549
|
};
|
|
550
550
|
}
|
|
551
551
|
function Se(e, t) {
|
|
552
|
-
const
|
|
553
|
-
let
|
|
554
|
-
if (y[u] === !1 || B(y[u]) && y[u] !==
|
|
552
|
+
const f = (t == null ? void 0 : t.console) ?? oe(), r = (u) => {
|
|
553
|
+
let l = D(e);
|
|
554
|
+
if (y[u] === !1 || B(y[u]) && y[u] !== ie() || !W(l))
|
|
555
555
|
return se;
|
|
556
556
|
{
|
|
557
|
-
let d = `%c${
|
|
558
|
-
return t != null && t.
|
|
559
|
-
|
|
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[u].bind(
|
|
559
|
+
f,
|
|
560
560
|
d,
|
|
561
|
-
`color:${
|
|
561
|
+
`color:${fe(d)};font-weight:bold`,
|
|
562
562
|
"color:#777",
|
|
563
563
|
"color:#aaa",
|
|
564
564
|
"color:#777"
|
|
@@ -579,13 +579,14 @@ function Se(e, t) {
|
|
|
579
579
|
return r("error");
|
|
580
580
|
},
|
|
581
581
|
crash(u) {
|
|
582
|
-
const
|
|
582
|
+
const l = {
|
|
583
583
|
error: u,
|
|
584
584
|
loggerName: D(e),
|
|
585
|
-
|
|
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(
|
|
589
|
+
d(l);
|
|
589
590
|
}
|
|
590
591
|
};
|
|
591
592
|
}
|
|
@@ -594,8 +595,8 @@ function we(e) {
|
|
|
594
595
|
}
|
|
595
596
|
function me(e) {
|
|
596
597
|
for (const t in e) {
|
|
597
|
-
const
|
|
598
|
-
|
|
598
|
+
const f = e[t];
|
|
599
|
+
f && (y[t] = f);
|
|
599
600
|
}
|
|
600
601
|
}
|
|
601
602
|
function oe() {
|
|
@@ -607,7 +608,7 @@ function oe() {
|
|
|
607
608
|
export {
|
|
608
609
|
ve as $,
|
|
609
610
|
ye as a,
|
|
610
|
-
|
|
611
|
+
ie as b,
|
|
611
612
|
Te as c,
|
|
612
613
|
m as d,
|
|
613
614
|
ge as e,
|
|
@@ -615,10 +616,10 @@ export {
|
|
|
615
616
|
D as g,
|
|
616
617
|
we as h,
|
|
617
618
|
me as i,
|
|
618
|
-
|
|
619
|
-
|
|
619
|
+
he as j,
|
|
620
|
+
De as k,
|
|
620
621
|
Ee as o,
|
|
621
622
|
pe as p,
|
|
622
623
|
xe as s
|
|
623
624
|
};
|
|
624
|
-
//# sourceMappingURL=logger-
|
|
625
|
+
//# sourceMappingURL=logger-CBfhf3fA.js.map
|