@manyducks.co/dolla 2.0.0-alpha.66 → 2.0.0-alpha.67

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 { t as N, b as g } from "./typeChecking-_dGK_0uR.js";
1
+ import { t as I, b as g } from "./typeChecking-Cw-4pIto.js";
2
2
  const ue = () => {
3
3
  };
4
4
  let T = 1;
@@ -9,15 +9,15 @@ let D = 0;
9
9
  function ie() {
10
10
  return D = D % Number.MAX_SAFE_INTEGER + 1, D;
11
11
  }
12
- function z(e, t) {
12
+ function A(e, t) {
13
13
  return Object.is(e, t);
14
14
  }
15
15
  function oe(e, t) {
16
16
  if (Object.is(e, t)) return !0;
17
- const s = N(e);
18
- if (s !== N(t))
17
+ const r = I(e);
18
+ if (r !== I(t))
19
19
  return !1;
20
- switch (s) {
20
+ switch (r) {
21
21
  case "object":
22
22
  let n = 0;
23
23
  for (const u in e) {
@@ -48,10 +48,10 @@ function w(e, t) {
48
48
  if (e === t) return !0;
49
49
  if (e && t && typeof e == "object" && typeof t == "object") {
50
50
  if (e.constructor !== t.constructor) return !1;
51
- var s, n, u;
51
+ var r, n, u;
52
52
  if (Array.isArray(e)) {
53
- if (s = e.length, s != t.length) return !1;
54
- for (n = s; n-- !== 0; ) if (!w(e[n], t[n])) return !1;
53
+ if (r = e.length, r != t.length) return !1;
54
+ for (n = r; n-- !== 0; ) if (!w(e[n], t[n])) return !1;
55
55
  return !0;
56
56
  }
57
57
  if (e instanceof Map && t instanceof Map) {
@@ -66,16 +66,16 @@ function w(e, t) {
66
66
  return !0;
67
67
  }
68
68
  if (ArrayBuffer.isView(e) && ArrayBuffer.isView(t)) {
69
- if (s = e.length, s != t.length) return !1;
70
- for (n = s; n-- !== 0; ) if (e[n] !== t[n]) return !1;
69
+ if (r = e.length, r != t.length) return !1;
70
+ for (n = r; n-- !== 0; ) if (e[n] !== t[n]) return !1;
71
71
  return !0;
72
72
  }
73
73
  if (e.constructor === RegExp) return e.source === t.source && e.flags === t.flags;
74
74
  if (e.valueOf !== Object.prototype.valueOf) return e.valueOf() === t.valueOf();
75
75
  if (e.toString !== Object.prototype.toString) return e.toString() === t.toString();
76
- if (u = Object.keys(e), s = u.length, s !== Object.keys(t).length) return !1;
77
- for (n = s; n-- !== 0; ) if (!Object.prototype.hasOwnProperty.call(t, u[n])) return !1;
78
- for (n = s; n-- !== 0; ) {
76
+ if (u = Object.keys(e), r = u.length, r !== Object.keys(t).length) return !1;
77
+ for (n = r; n-- !== 0; ) if (!Object.prototype.hasOwnProperty.call(t, u[n])) return !1;
78
+ for (n = r; n-- !== 0; ) {
79
79
  var d = u[n];
80
80
  if (!w(e[d], t[d])) return !1;
81
81
  }
@@ -84,10 +84,10 @@ function w(e, t) {
84
84
  return e !== e && t !== t;
85
85
  }
86
86
  function ce(e, t) {
87
- const s = {};
87
+ const r = {};
88
88
  for (const n in t)
89
- e.includes(n) || (s[n] = t[n]);
90
- return s;
89
+ e.includes(n) || (r[n] = t[n]);
90
+ return r;
91
91
  }
92
92
  function le(e) {
93
93
  return Array.isArray(e) ? e : [e];
@@ -95,13 +95,13 @@ function le(e) {
95
95
  function ae(e) {
96
96
  return e.replace(/-./g, (t) => t[1].toUpperCase());
97
97
  }
98
- function de(e, t, s) {
99
- "moveBefore" in e ? e.moveBefore(t, s) : e.insertBefore(t, s);
98
+ function de(e, t, r) {
99
+ "moveBefore" in e ? e.moveBefore(t, r) : e.insertBefore(t, r);
100
100
  }
101
101
  function pe(e) {
102
102
  let t = 0;
103
- for (let s = 0; s < e.length; s++)
104
- t = (t + e.charCodeAt(s) * 10) % 360;
103
+ for (let r = 0; r < e.length; r++)
104
+ t = (t + e.charCodeAt(r) * 10) % 360;
105
105
  return `oklch(0.68 0.15 ${t}deg)`;
106
106
  }
107
107
  function he(e) {
@@ -110,8 +110,8 @@ function he(e) {
110
110
  const t = {
111
111
  positive: [],
112
112
  negative: []
113
- }, s = e.split(",").map((n) => n.trim()).filter((n) => n !== "");
114
- for (let n of s) {
113
+ }, r = e.split(",").map((n) => n.trim()).filter((n) => n !== "");
114
+ for (let n of r) {
115
115
  let u = "positive";
116
116
  n.startsWith("-") && (u = "negative", n = n.slice(1)), n === "*" ? t[u].push(function() {
117
117
  return !0;
@@ -127,119 +127,119 @@ function he(e) {
127
127
  };
128
128
  }
129
129
  let M = "production";
130
- function H() {
130
+ function K() {
131
131
  return M;
132
132
  }
133
133
  function ve(e) {
134
134
  M = e;
135
135
  }
136
- var I;
136
+ var z;
137
137
  (function(e) {
138
138
  e[e.None = 0] = "None", e[e.Mutable = 1] = "Mutable", e[e.Watching = 2] = "Watching", e[e.RecursedCheck = 4] = "RecursedCheck", e[e.Recursed = 8] = "Recursed", e[e.Dirty = 16] = "Dirty", e[e.Pending = 32] = "Pending";
139
- })(I || (I = {}));
140
- function J({ update: e, notify: t, unwatched: s }) {
139
+ })(z || (z = {}));
140
+ function Q({ update: e, notify: t, unwatched: r }) {
141
141
  return {
142
142
  link: n,
143
143
  unlink: u,
144
144
  propagate: d,
145
- checkDirty: Y,
146
- endTracking: R,
145
+ checkDirty: J,
146
+ endTracking: H,
147
147
  startTracking: p,
148
148
  shallowPropagate: m
149
149
  };
150
- function n(r, f) {
150
+ function n(s, f) {
151
151
  const o = f.depsTail;
152
- if (o !== void 0 && o.dep === r)
152
+ if (o !== void 0 && o.dep === s)
153
153
  return;
154
154
  let i;
155
155
  const c = f.flags & 4;
156
- if (c && (i = o !== void 0 ? o.nextDep : f.deps, i !== void 0 && i.dep === r)) {
156
+ if (c && (i = o !== void 0 ? o.nextDep : f.deps, i !== void 0 && i.dep === s)) {
157
157
  f.depsTail = i;
158
158
  return;
159
159
  }
160
- const l = r.subsTail;
161
- if (l !== void 0 && l.sub === f && (!c || j(l, f)))
160
+ const l = s.subsTail;
161
+ if (l !== void 0 && l.sub === f && (!c || _(l, f)))
162
162
  return;
163
- const a = f.depsTail = r.subsTail = {
164
- dep: r,
163
+ const a = f.depsTail = s.subsTail = {
164
+ dep: s,
165
165
  sub: f,
166
166
  prevDep: o,
167
167
  nextDep: i,
168
168
  prevSub: l,
169
169
  nextSub: void 0
170
170
  };
171
- i !== void 0 && (i.prevDep = a), o !== void 0 ? o.nextDep = a : f.deps = a, l !== void 0 ? l.nextSub = a : r.subs = a;
171
+ i !== void 0 && (i.prevDep = a), o !== void 0 ? o.nextDep = a : f.deps = a, l !== void 0 ? l.nextSub = a : s.subs = a;
172
172
  }
173
- function u(r, f = r.sub) {
174
- const o = r.dep, i = r.prevDep, c = r.nextDep, l = r.nextSub, a = r.prevSub;
175
- return c !== void 0 ? c.prevDep = i : f.depsTail = i, i !== void 0 ? i.nextDep = c : f.deps = c, l !== void 0 ? l.prevSub = a : o.subsTail = a, a !== void 0 ? a.nextSub = l : (o.subs = l) === void 0 && s(o), c;
173
+ function u(s, f = s.sub) {
174
+ const o = s.dep, i = s.prevDep, c = s.nextDep, l = s.nextSub, a = s.prevSub;
175
+ return c !== void 0 ? c.prevDep = i : f.depsTail = i, i !== void 0 ? i.nextDep = c : f.deps = c, l !== void 0 ? l.prevSub = a : o.subsTail = a, a !== void 0 ? a.nextSub = l : (o.subs = l) === void 0 && r(o), c;
176
176
  }
177
- function d(r) {
178
- let f = r.nextSub, o;
177
+ function d(s) {
178
+ let f = s.nextSub, o;
179
179
  e: do {
180
- const i = r.sub;
180
+ const i = s.sub;
181
181
  let c = i.flags;
182
- if (c & 3 && (c & 60 ? c & 12 ? c & 4 ? !(c & 48) && j(r, i) ? (i.flags = c | 40, c &= 1) : c = 0 : i.flags = c & -9 | 32 : c = 0 : i.flags = c | 32, c & 2 && t(i), c & 1)) {
182
+ if (c & 3 && (c & 60 ? c & 12 ? c & 4 ? !(c & 48) && _(s, i) ? (i.flags = c | 40, c &= 1) : c = 0 : i.flags = c & -9 | 32 : c = 0 : i.flags = c | 32, c & 2 && t(i), c & 1)) {
183
183
  const l = i.subs;
184
184
  if (l !== void 0) {
185
- r = l, l.nextSub !== void 0 && (o = { value: f, prev: o }, f = r.nextSub);
185
+ s = l, l.nextSub !== void 0 && (o = { value: f, prev: o }, f = s.nextSub);
186
186
  continue;
187
187
  }
188
188
  }
189
- if ((r = f) !== void 0) {
190
- f = r.nextSub;
189
+ if ((s = f) !== void 0) {
190
+ f = s.nextSub;
191
191
  continue;
192
192
  }
193
193
  for (; o !== void 0; )
194
- if (r = o.value, o = o.prev, r !== void 0) {
195
- f = r.nextSub;
194
+ if (s = o.value, o = o.prev, s !== void 0) {
195
+ f = s.nextSub;
196
196
  continue e;
197
197
  }
198
198
  break;
199
199
  } while (!0);
200
200
  }
201
- function p(r) {
202
- r.depsTail = void 0, r.flags = r.flags & -57 | 4;
201
+ function p(s) {
202
+ s.depsTail = void 0, s.flags = s.flags & -57 | 4;
203
203
  }
204
- function R(r) {
205
- const f = r.depsTail;
206
- let o = f !== void 0 ? f.nextDep : r.deps;
204
+ function H(s) {
205
+ const f = s.depsTail;
206
+ let o = f !== void 0 ? f.nextDep : s.deps;
207
207
  for (; o !== void 0; )
208
- o = u(o, r);
209
- r.flags &= -5;
208
+ o = u(o, s);
209
+ s.flags &= -5;
210
210
  }
211
- function Y(r, f) {
211
+ function J(s, f) {
212
212
  let o, i = 0;
213
213
  e: do {
214
- const c = r.dep, l = c.flags;
214
+ const c = s.dep, l = c.flags;
215
215
  let a = !1;
216
216
  if (f.flags & 16)
217
217
  a = !0;
218
218
  else if ((l & 17) === 17) {
219
219
  if (e(c)) {
220
- const S = c.subs;
221
- S.nextSub !== void 0 && m(S), a = !0;
220
+ const b = c.subs;
221
+ b.nextSub !== void 0 && m(b), a = !0;
222
222
  }
223
223
  } else if ((l & 33) === 33) {
224
- (r.nextSub !== void 0 || r.prevSub !== void 0) && (o = { value: r, prev: o }), r = c.deps, f = c, ++i;
224
+ (s.nextSub !== void 0 || s.prevSub !== void 0) && (o = { value: s, prev: o }), s = c.deps, f = c, ++i;
225
225
  continue;
226
226
  }
227
- if (!a && r.nextDep !== void 0) {
228
- r = r.nextDep;
227
+ if (!a && s.nextDep !== void 0) {
228
+ s = s.nextDep;
229
229
  continue;
230
230
  }
231
231
  for (; i; ) {
232
232
  --i;
233
- const S = f.subs, _ = S.nextSub !== void 0;
234
- if (_ ? (r = o.value, o = o.prev) : r = S, a) {
233
+ const b = f.subs, N = b.nextSub !== void 0;
234
+ if (N ? (s = o.value, o = o.prev) : s = b, a) {
235
235
  if (e(f)) {
236
- _ && m(S), f = r.sub;
236
+ N && m(b), f = s.sub;
237
237
  continue;
238
238
  }
239
239
  } else
240
240
  f.flags &= -33;
241
- if (f = r.sub, r.nextDep !== void 0) {
242
- r = r.nextDep;
241
+ if (f = s.sub, s.nextDep !== void 0) {
242
+ s = s.nextDep;
243
243
  continue e;
244
244
  }
245
245
  a = !1;
@@ -247,18 +247,18 @@ function J({ update: e, notify: t, unwatched: s }) {
247
247
  return a;
248
248
  } while (!0);
249
249
  }
250
- function m(r) {
250
+ function m(s) {
251
251
  do {
252
- const f = r.sub, o = r.nextSub, i = f.flags;
253
- (i & 48) === 32 && (f.flags = i | 16, i & 2 && t(f)), r = o;
254
- } while (r !== void 0);
252
+ const f = s.sub, o = s.nextSub, i = f.flags;
253
+ (i & 48) === 32 && (f.flags = i | 16, i & 2 && t(f)), s = o;
254
+ } while (s !== void 0);
255
255
  }
256
- function j(r, f) {
256
+ function _(s, f) {
257
257
  const o = f.depsTail;
258
258
  if (o !== void 0) {
259
259
  let i = f.deps;
260
260
  do {
261
- if (i === r)
261
+ if (i === s)
262
262
  return !0;
263
263
  if (i === o)
264
264
  break;
@@ -268,7 +268,7 @@ function J({ update: e, notify: t, unwatched: s }) {
268
268
  return !1;
269
269
  }
270
270
  }
271
- const E = [], { link: A, unlink: C, propagate: K, checkDirty: V, endTracking: B, startTracking: L, shallowPropagate: P } = J({
271
+ const E = [], { link: j, unlink: C, propagate: Z, checkDirty: V, endTracking: B, startTracking: L, shallowPropagate: P } = Q({
272
272
  update(e) {
273
273
  return "getter" in e ? W(e) : G(e, e.value);
274
274
  },
@@ -282,27 +282,27 @@ const E = [], { link: A, unlink: C, propagate: K, checkDirty: V, endTracking: B,
282
282
  t = C(t, e);
283
283
  while (t !== void 0);
284
284
  }
285
- } else "previousValue" in e || k.call(e);
285
+ } else "previousValue" in e || Y.call(e);
286
286
  }
287
287
  });
288
- let O = 0, x = 0, q = 0, h, b;
288
+ let q = 0, x = 0, O = 0, h, S;
289
289
  function v(e) {
290
290
  const t = h;
291
291
  return h = e, t;
292
292
  }
293
293
  function ge() {
294
- return b;
294
+ return S;
295
295
  }
296
- function Se(e) {
297
- const t = b;
298
- return b = e, t;
296
+ function be(e) {
297
+ const t = S;
298
+ return S = e, t;
299
299
  }
300
300
  function W(e) {
301
301
  const t = v(e);
302
302
  L(e);
303
303
  try {
304
- const s = e.value, n = { value: e.value };
305
- return !e.equals(s, e.value = e.getter.call(n));
304
+ const r = e.value, n = { value: e.value };
305
+ return !e.equals(r, e.value = e.getter.call(n));
306
306
  } finally {
307
307
  v(t), B(e);
308
308
  }
@@ -314,8 +314,8 @@ function U(e) {
314
314
  const t = e.flags;
315
315
  if (!(t & 64)) {
316
316
  e.flags = t | 64;
317
- const s = e.subs;
318
- s !== void 0 ? U(s.sub) : E[q++] = e;
317
+ const r = e.subs;
318
+ r !== void 0 ? U(r.sub) : E[O++] = e;
319
319
  }
320
320
  }
321
321
  function X(e, t) {
@@ -331,18 +331,18 @@ function X(e, t) {
331
331
  }
332
332
  return;
333
333
  } else t & 32 && (e.flags = t & -33);
334
- let s = e.deps;
335
- for (; s !== void 0; ) {
336
- const n = s.dep, u = n.flags;
334
+ let r = e.deps;
335
+ for (; r !== void 0; ) {
336
+ const n = r.dep, u = n.flags;
337
337
  u & 64 && X(
338
338
  n,
339
339
  n.flags = u & -65
340
340
  /* Queued */
341
- ), s = s.nextDep;
341
+ ), r = r.nextDep;
342
342
  }
343
343
  }
344
344
  function $() {
345
- for (; x < q; ) {
345
+ for (; x < O; ) {
346
346
  const e = E[x];
347
347
  E[x++] = void 0, X(
348
348
  e,
@@ -350,9 +350,9 @@ function $() {
350
350
  /* Queued */
351
351
  );
352
352
  }
353
- x = 0, q = 0;
353
+ x = 0, O = 0;
354
354
  }
355
- function Q() {
355
+ function F() {
356
356
  const e = this.flags;
357
357
  if (e & 16 || e & 32 && V(this.deps, this)) {
358
358
  if (W(this)) {
@@ -360,47 +360,58 @@ function Q() {
360
360
  t !== void 0 && P(t);
361
361
  }
362
362
  } else e & 32 && (this.flags = e & -33);
363
- return h !== void 0 && A(this, h), this.value;
363
+ return h !== void 0 && j(this, h), this.value;
364
364
  }
365
- function Z() {
365
+ function k() {
366
366
  const e = this.value;
367
367
  if (this.flags & 16 && G(this, e)) {
368
368
  const t = this.subs;
369
369
  t !== void 0 && P(t);
370
370
  }
371
- return h !== void 0 && A(this, h), e;
371
+ return h !== void 0 && j(this, h), e;
372
372
  }
373
- function F(e) {
373
+ function R(e) {
374
374
  let t = g(e) ? y(e(this.value)) : e;
375
375
  if (!this.equals(this.value, t)) {
376
376
  this.value = t, this.flags = 17;
377
- const s = this.subs;
378
- s !== void 0 && (K(s), O || $());
377
+ const r = this.subs;
378
+ r !== void 0 && (Z(r), q || $());
379
379
  }
380
380
  }
381
- function k() {
381
+ function Y() {
382
382
  let e = this.deps;
383
383
  for (; e !== void 0; )
384
384
  e = C(e, this);
385
385
  const t = this.subs;
386
386
  t !== void 0 && C(t), this.flags = 0, "cleanup" in this && this.cleanup != null && this.cleanup();
387
387
  }
388
- function be(...e) {
388
+ function Se(...e) {
389
389
  return g(e[0]) ? te(e[0], e[1]) : ee(e[0], e[1]);
390
390
  }
391
391
  function ee(e, t) {
392
- const s = {
392
+ const r = {
393
393
  previousValue: e,
394
394
  value: e,
395
- equals: (t == null ? void 0 : t.equals) ?? z,
395
+ equals: (t == null ? void 0 : t.equals) ?? A,
396
396
  subs: void 0,
397
397
  subsTail: void 0,
398
398
  flags: 1
399
- }, n = Z.bind(s);
400
- return n.set = F.bind(s), n;
399
+ }, n = k.bind(r);
400
+ return n.set = R.bind(r), n;
401
+ }
402
+ function xe(e, t) {
403
+ const r = {
404
+ previousValue: e,
405
+ value: e,
406
+ equals: (t == null ? void 0 : t.equals) ?? A,
407
+ subs: void 0,
408
+ subsTail: void 0,
409
+ flags: 1
410
+ };
411
+ return [k.bind(r), R.bind(r)];
401
412
  }
402
413
  function te(e, t) {
403
- return Q.bind({
414
+ return F.bind({
404
415
  value: void 0,
405
416
  subs: void 0,
406
417
  subsTail: void 0,
@@ -409,35 +420,35 @@ function te(e, t) {
409
420
  flags: 17,
410
421
  getter: function() {
411
422
  if (t != null && t.deps) {
412
- for (let s of t.deps) y(s);
423
+ for (let r of t.deps) y(r);
413
424
  return y(ne(() => e(this.value)));
414
425
  }
415
426
  return y(e(this.value));
416
427
  },
417
- equals: (t == null ? void 0 : t.equals) ?? z
428
+ equals: (t == null ? void 0 : t.equals) ?? A
418
429
  });
419
430
  }
420
- function xe(e) {
421
- ++O, e(), --O || $();
431
+ function ye(e) {
432
+ ++q, e(), --q || $();
422
433
  }
423
434
  function ne(e) {
424
435
  if (g(e)) {
425
436
  let t;
426
- const s = v(void 0);
427
- return t = e(), v(s), t;
437
+ const r = v(void 0);
438
+ return t = e(), v(r), t;
428
439
  } else
429
440
  return e;
430
441
  }
431
442
  function y(e) {
432
443
  return g(e) ? e() : e;
433
444
  }
434
- const re = Symbol("INTERNAL_EFFECT");
435
- function ye(e, t) {
445
+ const se = Symbol("INTERNAL_EFFECT");
446
+ function me(e, t) {
436
447
  var d;
437
- const s = (t == null ? void 0 : t._type) === re;
438
- if (!s && b)
439
- return b.effect(e);
440
- !s && H() === "development" && console.warn(
448
+ const r = (t == null ? void 0 : t._type) === se;
449
+ if (!r && S)
450
+ return S.effect(e);
451
+ !r && K() === "development" && console.warn(
441
452
  "This effect is not bound to a scope. You must call the unsubscribe function when done to avoid memory leaks."
442
453
  );
443
454
  const n = {
@@ -448,7 +459,7 @@ function ye(e, t) {
448
459
  depsTail: void 0,
449
460
  flags: 2
450
461
  };
451
- h !== void 0 && A(n, h);
462
+ h !== void 0 && j(n, h);
452
463
  const u = v(n);
453
464
  try {
454
465
  (d = n.cleanup) == null || d.call(n);
@@ -457,32 +468,33 @@ function ye(e, t) {
457
468
  } finally {
458
469
  v(u);
459
470
  }
460
- return k.bind(n);
471
+ return Y.bind(n);
461
472
  }
462
473
  export {
463
- be as $,
464
- re as I,
465
- z as a,
466
- xe as b,
467
- H as c,
474
+ Se as $,
475
+ se as I,
476
+ A as a,
477
+ ye as b,
478
+ K as c,
468
479
  w as d,
469
- ye as e,
480
+ me as e,
470
481
  ve as f,
471
482
  y as g,
472
- ge as h,
473
- fe as i,
474
- Se as j,
475
- de as k,
476
- ie as l,
483
+ xe as h,
484
+ ge as i,
485
+ fe as j,
486
+ be as k,
487
+ de as l,
477
488
  te as m,
478
- ae as n,
489
+ ie as n,
479
490
  ce as o,
480
- he as p,
481
- ue as q,
482
- pe as r,
491
+ ae as p,
492
+ he as q,
493
+ ue as r,
483
494
  oe as s,
484
495
  le as t,
485
496
  ne as u,
497
+ pe as v,
486
498
  ee as w
487
499
  };
488
- //# sourceMappingURL=signals-CkfFHd0d.js.map
500
+ //# sourceMappingURL=signals-HNnDUJRQ.js.map