@pismo/marola 2.1.73 → 2.1.74
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/{RadioOption-DyRY8xlF.js → RadioOption-CbeBwSaN.js} +1 -1
- package/dist/{Toggle-nnDfpqI1.js → Toggle-C4jN6Ewk.js} +51 -49
- package/dist/components/Chip/Chip.js +1 -1
- package/dist/components/DoubleAutocomplete/DoubleAutocomplete.js +1 -1
- package/dist/components/Draggable/useDraggable.js +1 -1
- package/dist/components/DropdownMenu/DropdownMenu.js +1 -1
- package/dist/components/IconButton/IconButton.d.ts +2 -0
- package/dist/components/IconButton/IconButton.js +19 -17
- package/dist/components/RadioButton/RadioButton.js +4 -4
- package/dist/components/RadioButton/RadioOption.js +2 -2
- package/dist/components/ResultWithChips/ResultWithChips.js +1 -1
- package/dist/components/RowItem/RowItem.js +1 -1
- package/dist/components/ToastCard/ToastCard.js +15 -7
- package/dist/components/ToggleGroup/Toggle.js +1 -1
- package/dist/components/ToggleGroup/ToggleGroup.js +1 -1
- package/dist/contexts/DraggableProvider/DraggableProvider.js +1 -1
- package/dist/main.js +2 -2
- package/dist/react-BTbo_5A3.js +526 -0
- package/package.json +3 -2
- package/dist/react-Dj06mE6D.js +0 -526
|
@@ -0,0 +1,526 @@
|
|
|
1
|
+
import U, { useRef as et, createElement as x, createContext as ot, useReducer as st, useEffect as it, useDebugValue as ct, useCallback as ut, useContext as rt } from "react";
|
|
2
|
+
const _ = { BASE_URL: "/", DEV: !1, MODE: "production", PROD: !0, SSR: !1 };
|
|
3
|
+
function J(t) {
|
|
4
|
+
return "init" in t;
|
|
5
|
+
}
|
|
6
|
+
function T(t) {
|
|
7
|
+
return !!t.write;
|
|
8
|
+
}
|
|
9
|
+
function F(t) {
|
|
10
|
+
return "v" in t || "e" in t;
|
|
11
|
+
}
|
|
12
|
+
function I(t) {
|
|
13
|
+
if ("e" in t)
|
|
14
|
+
throw t.e;
|
|
15
|
+
if ((_ ? "production" : void 0) !== "production" && !("v" in t))
|
|
16
|
+
throw new Error("[Bug] atom state is not initialized");
|
|
17
|
+
return t.v;
|
|
18
|
+
}
|
|
19
|
+
const P = /* @__PURE__ */ new WeakMap();
|
|
20
|
+
function $(t) {
|
|
21
|
+
var n;
|
|
22
|
+
return R(t) && !!((n = P.get(t)) != null && n[0]);
|
|
23
|
+
}
|
|
24
|
+
function at(t) {
|
|
25
|
+
const n = P.get(t);
|
|
26
|
+
n != null && n[0] && (n[0] = !1, n[1].forEach((o) => o()));
|
|
27
|
+
}
|
|
28
|
+
function O(t, n) {
|
|
29
|
+
let o = P.get(t);
|
|
30
|
+
if (!o) {
|
|
31
|
+
o = [!0, /* @__PURE__ */ new Set()], P.set(t, o);
|
|
32
|
+
const e = () => {
|
|
33
|
+
o[0] = !1;
|
|
34
|
+
};
|
|
35
|
+
t.then(e, e);
|
|
36
|
+
}
|
|
37
|
+
o[1].add(n);
|
|
38
|
+
}
|
|
39
|
+
function R(t) {
|
|
40
|
+
return typeof (t == null ? void 0 : t.then) == "function";
|
|
41
|
+
}
|
|
42
|
+
function G(t, n, o) {
|
|
43
|
+
if (!o.p.has(t)) {
|
|
44
|
+
o.p.add(t);
|
|
45
|
+
const e = () => o.p.delete(t);
|
|
46
|
+
n.then(e, e);
|
|
47
|
+
}
|
|
48
|
+
}
|
|
49
|
+
function q(t, n, o) {
|
|
50
|
+
var e;
|
|
51
|
+
const s = /* @__PURE__ */ new Set();
|
|
52
|
+
for (const i of ((e = o.get(t)) == null ? void 0 : e.t) || [])
|
|
53
|
+
s.add(i);
|
|
54
|
+
for (const i of n.p)
|
|
55
|
+
s.add(i);
|
|
56
|
+
return s;
|
|
57
|
+
}
|
|
58
|
+
const lt = (t, n, ...o) => n.read(...o), dt = (t, n, ...o) => n.write(...o), ft = (t, n) => {
|
|
59
|
+
if (n.INTERNAL_onInit)
|
|
60
|
+
return n.INTERNAL_onInit(t);
|
|
61
|
+
if (n.unstable_onInit)
|
|
62
|
+
return console.warn(
|
|
63
|
+
"[DEPRECATED] atom.unstable_onInit is renamed to atom.INTERNAL_onInit."
|
|
64
|
+
), n.unstable_onInit(t);
|
|
65
|
+
}, vt = (t, n, o) => {
|
|
66
|
+
var e;
|
|
67
|
+
return (e = n.onMount) == null ? void 0 : e.call(n, o);
|
|
68
|
+
}, ht = (t, n) => {
|
|
69
|
+
var o;
|
|
70
|
+
const e = S(t), s = e[0], i = e[6], a = e[9];
|
|
71
|
+
if ((_ ? "production" : void 0) !== "production" && !n)
|
|
72
|
+
throw new Error("Atom is undefined or null");
|
|
73
|
+
let v = s.get(n);
|
|
74
|
+
return v || (v = { d: /* @__PURE__ */ new Map(), p: /* @__PURE__ */ new Set(), n: 0 }, s.set(n, v), (o = i.i) == null || o.call(i, n), a == null || a(t, n)), v;
|
|
75
|
+
}, pt = (t) => {
|
|
76
|
+
const n = S(t), o = n[1], e = n[3], s = n[4], i = n[5], a = n[6], v = n[13], f = [], c = (d) => {
|
|
77
|
+
try {
|
|
78
|
+
d();
|
|
79
|
+
} catch (u) {
|
|
80
|
+
f.push(u);
|
|
81
|
+
}
|
|
82
|
+
};
|
|
83
|
+
do {
|
|
84
|
+
a.f && c(a.f);
|
|
85
|
+
const d = /* @__PURE__ */ new Set(), u = d.add.bind(d);
|
|
86
|
+
e.forEach((h) => {
|
|
87
|
+
var l;
|
|
88
|
+
return (l = o.get(h)) == null ? void 0 : l.l.forEach(u);
|
|
89
|
+
}), e.clear(), i.forEach(u), i.clear(), s.forEach(u), s.clear(), d.forEach(c), e.size && v(t);
|
|
90
|
+
} while (e.size || i.size || s.size);
|
|
91
|
+
if (f.length)
|
|
92
|
+
throw new AggregateError(f);
|
|
93
|
+
}, gt = (t) => {
|
|
94
|
+
const n = S(t), o = n[1], e = n[2], s = n[3], i = n[11], a = n[14], v = n[17], f = [], c = /* @__PURE__ */ new WeakSet(), d = /* @__PURE__ */ new WeakSet(), u = Array.from(s);
|
|
95
|
+
for (; u.length; ) {
|
|
96
|
+
const h = u[u.length - 1], l = i(t, h);
|
|
97
|
+
if (d.has(h)) {
|
|
98
|
+
u.pop();
|
|
99
|
+
continue;
|
|
100
|
+
}
|
|
101
|
+
if (c.has(h)) {
|
|
102
|
+
if (e.get(h) === l.n)
|
|
103
|
+
f.push([h, l]);
|
|
104
|
+
else if ((_ ? "production" : void 0) !== "production" && e.has(h))
|
|
105
|
+
throw new Error("[Bug] invalidated atom exists");
|
|
106
|
+
d.add(h), u.pop();
|
|
107
|
+
continue;
|
|
108
|
+
}
|
|
109
|
+
c.add(h);
|
|
110
|
+
for (const p of q(h, l, o))
|
|
111
|
+
c.has(p) || u.push(p);
|
|
112
|
+
}
|
|
113
|
+
for (let h = f.length - 1; h >= 0; --h) {
|
|
114
|
+
const [l, p] = f[h];
|
|
115
|
+
let b = !1;
|
|
116
|
+
for (const r of p.d.keys())
|
|
117
|
+
if (r !== l && s.has(r)) {
|
|
118
|
+
b = !0;
|
|
119
|
+
break;
|
|
120
|
+
}
|
|
121
|
+
b && (a(t, l), v(t, l)), e.delete(l);
|
|
122
|
+
}
|
|
123
|
+
}, W = /* @__PURE__ */ new WeakSet(), St = (t, n) => {
|
|
124
|
+
var o, e;
|
|
125
|
+
const s = S(t), i = s[1], a = s[2], v = s[3], f = s[6], c = s[7], d = s[11], u = s[12], h = s[13], l = s[14], p = s[16], b = s[17], r = d(t, n);
|
|
126
|
+
if (F(r)) {
|
|
127
|
+
if (i.has(n) && a.get(n) !== r.n)
|
|
128
|
+
return r;
|
|
129
|
+
let g = !1;
|
|
130
|
+
for (const [D, y] of r.d)
|
|
131
|
+
if (l(t, D).n !== y) {
|
|
132
|
+
g = !0;
|
|
133
|
+
break;
|
|
134
|
+
}
|
|
135
|
+
if (!g)
|
|
136
|
+
return r;
|
|
137
|
+
}
|
|
138
|
+
r.d.clear();
|
|
139
|
+
let A = !0;
|
|
140
|
+
function m() {
|
|
141
|
+
i.has(n) && (b(t, n), h(t), u(t));
|
|
142
|
+
}
|
|
143
|
+
function M(g) {
|
|
144
|
+
var D;
|
|
145
|
+
if (g === n) {
|
|
146
|
+
const N = d(t, g);
|
|
147
|
+
if (!F(N))
|
|
148
|
+
if (J(g))
|
|
149
|
+
C(t, g, g.init);
|
|
150
|
+
else
|
|
151
|
+
throw new Error("no atom init");
|
|
152
|
+
return I(N);
|
|
153
|
+
}
|
|
154
|
+
const y = l(t, g);
|
|
155
|
+
try {
|
|
156
|
+
return I(y);
|
|
157
|
+
} finally {
|
|
158
|
+
r.d.set(g, y.n), $(r.v) && G(n, r.v, y), i.has(n) && ((D = i.get(g)) == null || D.t.add(n)), A || m();
|
|
159
|
+
}
|
|
160
|
+
}
|
|
161
|
+
let w, k;
|
|
162
|
+
const nt = {
|
|
163
|
+
get signal() {
|
|
164
|
+
return w || (w = new AbortController()), w.signal;
|
|
165
|
+
},
|
|
166
|
+
get setSelf() {
|
|
167
|
+
return (_ ? "production" : void 0) !== "production" && !T(n) && console.warn("setSelf function cannot be used with read-only atom"), !k && T(n) && (k = (...g) => {
|
|
168
|
+
if ((_ ? "production" : void 0) !== "production" && A && console.warn("setSelf function cannot be called in sync"), !A)
|
|
169
|
+
try {
|
|
170
|
+
return p(t, n, ...g);
|
|
171
|
+
} finally {
|
|
172
|
+
h(t), u(t);
|
|
173
|
+
}
|
|
174
|
+
}), k;
|
|
175
|
+
}
|
|
176
|
+
}, H = r.n;
|
|
177
|
+
try {
|
|
178
|
+
(_ ? "production" : void 0) !== "production" && W.delete(t);
|
|
179
|
+
const g = c(t, n, M, nt);
|
|
180
|
+
return (_ ? "production" : void 0) !== "production" && W.has(t) && console.warn(
|
|
181
|
+
"Detected store mutation during atom read. This is not supported."
|
|
182
|
+
), C(t, n, g), R(g) && (O(g, () => w == null ? void 0 : w.abort()), g.then(m, m)), (o = f.r) == null || o.call(f, n), r;
|
|
183
|
+
} catch (g) {
|
|
184
|
+
return delete r.v, r.e = g, ++r.n, r;
|
|
185
|
+
} finally {
|
|
186
|
+
A = !1, H !== r.n && a.get(n) === H && (a.set(n, r.n), v.add(n), (e = f.c) == null || e.call(f, n));
|
|
187
|
+
}
|
|
188
|
+
}, bt = (t, n) => {
|
|
189
|
+
const o = S(t), e = o[1], s = o[2], i = o[11], a = [n];
|
|
190
|
+
for (; a.length; ) {
|
|
191
|
+
const v = a.pop(), f = i(t, v);
|
|
192
|
+
for (const c of q(v, f, e)) {
|
|
193
|
+
const d = i(t, c);
|
|
194
|
+
s.set(c, d.n), a.push(c);
|
|
195
|
+
}
|
|
196
|
+
}
|
|
197
|
+
}, K = (t, n, ...o) => {
|
|
198
|
+
const e = S(t), s = e[3], i = e[6], a = e[8], v = e[11], f = e[12], c = e[13], d = e[14], u = e[15], h = e[17];
|
|
199
|
+
let l = !0;
|
|
200
|
+
const p = (r) => I(d(t, r)), b = (r, ...A) => {
|
|
201
|
+
var m;
|
|
202
|
+
const M = v(t, r);
|
|
203
|
+
try {
|
|
204
|
+
if (r === n) {
|
|
205
|
+
if (!J(r))
|
|
206
|
+
throw new Error("atom not writable");
|
|
207
|
+
(_ ? "production" : void 0) !== "production" && W.add(t);
|
|
208
|
+
const w = M.n, k = A[0];
|
|
209
|
+
C(t, r, k), h(t, r), w !== M.n && (s.add(r), u(t, r), (m = i.c) == null || m.call(i, r));
|
|
210
|
+
return;
|
|
211
|
+
} else
|
|
212
|
+
return K(t, r, ...A);
|
|
213
|
+
} finally {
|
|
214
|
+
l || (c(t), f(t));
|
|
215
|
+
}
|
|
216
|
+
};
|
|
217
|
+
try {
|
|
218
|
+
return a(t, n, p, b, ...o);
|
|
219
|
+
} finally {
|
|
220
|
+
l = !1;
|
|
221
|
+
}
|
|
222
|
+
}, mt = (t, n) => {
|
|
223
|
+
var o;
|
|
224
|
+
const e = S(t), s = e[1], i = e[3], a = e[6], v = e[11], f = e[15], c = e[18], d = e[19], u = v(t, n), h = s.get(n);
|
|
225
|
+
if (h && !$(u.v)) {
|
|
226
|
+
for (const [l, p] of u.d)
|
|
227
|
+
if (!h.d.has(l)) {
|
|
228
|
+
const b = v(t, l);
|
|
229
|
+
c(t, l).t.add(n), h.d.add(l), p !== b.n && (i.add(l), f(t, l), (o = a.c) == null || o.call(a, l));
|
|
230
|
+
}
|
|
231
|
+
for (const l of h.d)
|
|
232
|
+
if (!u.d.has(l)) {
|
|
233
|
+
h.d.delete(l);
|
|
234
|
+
const p = d(t, l);
|
|
235
|
+
p == null || p.t.delete(n);
|
|
236
|
+
}
|
|
237
|
+
}
|
|
238
|
+
}, Q = (t, n) => {
|
|
239
|
+
var o;
|
|
240
|
+
const e = S(t), s = e[1], i = e[4], a = e[6], v = e[10], f = e[11], c = e[12], d = e[13], u = e[14], h = e[16], l = f(t, n);
|
|
241
|
+
let p = s.get(n);
|
|
242
|
+
if (!p) {
|
|
243
|
+
u(t, n);
|
|
244
|
+
for (const b of l.d.keys())
|
|
245
|
+
Q(t, b).t.add(n);
|
|
246
|
+
if (p = {
|
|
247
|
+
l: /* @__PURE__ */ new Set(),
|
|
248
|
+
d: new Set(l.d.keys()),
|
|
249
|
+
t: /* @__PURE__ */ new Set()
|
|
250
|
+
}, s.set(n, p), T(n)) {
|
|
251
|
+
const b = () => {
|
|
252
|
+
let r = !0;
|
|
253
|
+
const A = (...m) => {
|
|
254
|
+
try {
|
|
255
|
+
return h(t, n, ...m);
|
|
256
|
+
} finally {
|
|
257
|
+
r || (d(t), c(t));
|
|
258
|
+
}
|
|
259
|
+
};
|
|
260
|
+
try {
|
|
261
|
+
const m = v(t, n, A);
|
|
262
|
+
m && (p.u = () => {
|
|
263
|
+
r = !0;
|
|
264
|
+
try {
|
|
265
|
+
m();
|
|
266
|
+
} finally {
|
|
267
|
+
r = !1;
|
|
268
|
+
}
|
|
269
|
+
});
|
|
270
|
+
} finally {
|
|
271
|
+
r = !1;
|
|
272
|
+
}
|
|
273
|
+
};
|
|
274
|
+
i.add(b);
|
|
275
|
+
}
|
|
276
|
+
(o = a.m) == null || o.call(a, n);
|
|
277
|
+
}
|
|
278
|
+
return p;
|
|
279
|
+
}, At = (t, n) => {
|
|
280
|
+
var o, e;
|
|
281
|
+
const s = S(t), i = s[1], a = s[5], v = s[6], f = s[11], c = s[19], d = f(t, n);
|
|
282
|
+
let u = i.get(n);
|
|
283
|
+
if (!u || u.l.size)
|
|
284
|
+
return u;
|
|
285
|
+
let h = !1;
|
|
286
|
+
for (const l of u.t)
|
|
287
|
+
if ((o = i.get(l)) != null && o.d.has(n)) {
|
|
288
|
+
h = !0;
|
|
289
|
+
break;
|
|
290
|
+
}
|
|
291
|
+
if (!h) {
|
|
292
|
+
u.u && a.add(u.u), u = void 0, i.delete(n);
|
|
293
|
+
for (const l of d.d.keys()) {
|
|
294
|
+
const p = c(t, l);
|
|
295
|
+
p == null || p.t.delete(n);
|
|
296
|
+
}
|
|
297
|
+
(e = v.u) == null || e.call(v, n);
|
|
298
|
+
return;
|
|
299
|
+
}
|
|
300
|
+
return u;
|
|
301
|
+
}, C = (t, n, o) => {
|
|
302
|
+
const e = S(t)[11], s = e(t, n), i = "v" in s, a = s.v;
|
|
303
|
+
if (R(o))
|
|
304
|
+
for (const v of s.d.keys())
|
|
305
|
+
G(
|
|
306
|
+
n,
|
|
307
|
+
o,
|
|
308
|
+
e(t, v)
|
|
309
|
+
);
|
|
310
|
+
s.v = o, delete s.e, (!i || !Object.is(a, s.v)) && (++s.n, R(a) && at(a));
|
|
311
|
+
}, _t = (t, n) => {
|
|
312
|
+
const o = S(t)[14];
|
|
313
|
+
return I(o(t, n));
|
|
314
|
+
}, wt = (t, n, ...o) => {
|
|
315
|
+
const e = S(t), s = e[12], i = e[13], a = e[16];
|
|
316
|
+
try {
|
|
317
|
+
return a(t, n, ...o);
|
|
318
|
+
} finally {
|
|
319
|
+
i(t), s(t);
|
|
320
|
+
}
|
|
321
|
+
}, kt = (t, n, o) => {
|
|
322
|
+
const e = S(t), s = e[12], i = e[18], a = e[19], f = i(t, n).l;
|
|
323
|
+
return f.add(o), s(t), () => {
|
|
324
|
+
f.delete(o), a(t, n), s(t);
|
|
325
|
+
};
|
|
326
|
+
}, X = /* @__PURE__ */ new WeakMap(), S = (t) => {
|
|
327
|
+
const n = X.get(t);
|
|
328
|
+
if ((_ ? "production" : void 0) !== "production" && !n)
|
|
329
|
+
throw new Error(
|
|
330
|
+
"Store must be created by buildStore to read its building blocks"
|
|
331
|
+
);
|
|
332
|
+
return n;
|
|
333
|
+
};
|
|
334
|
+
function yt(...t) {
|
|
335
|
+
const n = {
|
|
336
|
+
get(e) {
|
|
337
|
+
const s = S(n)[21];
|
|
338
|
+
return s(n, e);
|
|
339
|
+
},
|
|
340
|
+
set(e, ...s) {
|
|
341
|
+
const i = S(n)[22];
|
|
342
|
+
return i(n, e, ...s);
|
|
343
|
+
},
|
|
344
|
+
sub(e, s) {
|
|
345
|
+
const i = S(n)[23];
|
|
346
|
+
return i(n, e, s);
|
|
347
|
+
}
|
|
348
|
+
}, o = [
|
|
349
|
+
// store state
|
|
350
|
+
/* @__PURE__ */ new WeakMap(),
|
|
351
|
+
// atomStateMap
|
|
352
|
+
/* @__PURE__ */ new WeakMap(),
|
|
353
|
+
// mountedMap
|
|
354
|
+
/* @__PURE__ */ new WeakMap(),
|
|
355
|
+
// invalidatedAtoms
|
|
356
|
+
/* @__PURE__ */ new Set(),
|
|
357
|
+
// changedAtoms
|
|
358
|
+
/* @__PURE__ */ new Set(),
|
|
359
|
+
// mountCallbacks
|
|
360
|
+
/* @__PURE__ */ new Set(),
|
|
361
|
+
// unmountCallbacks
|
|
362
|
+
{},
|
|
363
|
+
// storeHooks
|
|
364
|
+
// atom interceptors
|
|
365
|
+
lt,
|
|
366
|
+
dt,
|
|
367
|
+
ft,
|
|
368
|
+
vt,
|
|
369
|
+
// building-block functions
|
|
370
|
+
ht,
|
|
371
|
+
pt,
|
|
372
|
+
gt,
|
|
373
|
+
St,
|
|
374
|
+
bt,
|
|
375
|
+
K,
|
|
376
|
+
mt,
|
|
377
|
+
Q,
|
|
378
|
+
At,
|
|
379
|
+
C,
|
|
380
|
+
_t,
|
|
381
|
+
wt,
|
|
382
|
+
kt,
|
|
383
|
+
void 0
|
|
384
|
+
].map((e, s) => t[s] || e);
|
|
385
|
+
return X.set(n, Object.freeze(o)), n;
|
|
386
|
+
}
|
|
387
|
+
const Y = {};
|
|
388
|
+
let Et = 0;
|
|
389
|
+
function Ot(t, n) {
|
|
390
|
+
const o = `atom${++Et}`, e = {
|
|
391
|
+
toString() {
|
|
392
|
+
return (Y ? "production" : void 0) !== "production" && this.debugLabel ? o + ":" + this.debugLabel : o;
|
|
393
|
+
}
|
|
394
|
+
};
|
|
395
|
+
return e.init = t, e.read = Mt, e.write = Dt, e;
|
|
396
|
+
}
|
|
397
|
+
function Mt(t) {
|
|
398
|
+
return t(this);
|
|
399
|
+
}
|
|
400
|
+
function Dt(t, n, o) {
|
|
401
|
+
return n(
|
|
402
|
+
this,
|
|
403
|
+
typeof o == "function" ? o(t(this)) : o
|
|
404
|
+
);
|
|
405
|
+
}
|
|
406
|
+
function Z() {
|
|
407
|
+
return yt();
|
|
408
|
+
}
|
|
409
|
+
let E;
|
|
410
|
+
function It() {
|
|
411
|
+
return E || (E = Z(), (Y ? "production" : void 0) !== "production" && (globalThis.__JOTAI_DEFAULT_STORE__ || (globalThis.__JOTAI_DEFAULT_STORE__ = E), globalThis.__JOTAI_DEFAULT_STORE__ !== E && console.warn(
|
|
412
|
+
"Detected multiple Jotai instances. It may cause unexpected behavior with the default store. https://github.com/pmndrs/jotai/discussions/2044"
|
|
413
|
+
))), E;
|
|
414
|
+
}
|
|
415
|
+
const Pt = {}, L = ot(
|
|
416
|
+
void 0
|
|
417
|
+
);
|
|
418
|
+
function tt(t) {
|
|
419
|
+
return rt(L) || It();
|
|
420
|
+
}
|
|
421
|
+
function Wt({
|
|
422
|
+
children: t,
|
|
423
|
+
store: n
|
|
424
|
+
}) {
|
|
425
|
+
const o = et(null);
|
|
426
|
+
return n ? x(L.Provider, { value: n }, t) : (o.current === null && (o.current = Z()), x(
|
|
427
|
+
L.Provider,
|
|
428
|
+
{
|
|
429
|
+
// TODO: If this is not a false positive, consider using useState instead of useRef like https://github.com/pmndrs/jotai/pull/2771
|
|
430
|
+
// eslint-disable-next-line react-hooks/refs
|
|
431
|
+
value: o.current
|
|
432
|
+
},
|
|
433
|
+
t
|
|
434
|
+
));
|
|
435
|
+
}
|
|
436
|
+
const V = (t) => typeof (t == null ? void 0 : t.then) == "function", z = (t) => {
|
|
437
|
+
t.status || (t.status = "pending", t.then(
|
|
438
|
+
(n) => {
|
|
439
|
+
t.status = "fulfilled", t.value = n;
|
|
440
|
+
},
|
|
441
|
+
(n) => {
|
|
442
|
+
t.status = "rejected", t.reason = n;
|
|
443
|
+
}
|
|
444
|
+
));
|
|
445
|
+
}, Rt = U.use || // A shim for older React versions
|
|
446
|
+
((t) => {
|
|
447
|
+
if (t.status === "pending")
|
|
448
|
+
throw t;
|
|
449
|
+
if (t.status === "fulfilled")
|
|
450
|
+
return t.value;
|
|
451
|
+
throw t.status === "rejected" ? t.reason : (z(t), t);
|
|
452
|
+
}), B = /* @__PURE__ */ new WeakMap(), j = (t, n) => {
|
|
453
|
+
let o = B.get(t);
|
|
454
|
+
return o || (o = new Promise((e, s) => {
|
|
455
|
+
let i = t;
|
|
456
|
+
const a = (c) => (d) => {
|
|
457
|
+
i === c && e(d);
|
|
458
|
+
}, v = (c) => (d) => {
|
|
459
|
+
i === c && s(d);
|
|
460
|
+
}, f = () => {
|
|
461
|
+
try {
|
|
462
|
+
const c = n();
|
|
463
|
+
V(c) ? (B.set(c, o), i = c, c.then(a(c), v(c)), O(c, f)) : e(c);
|
|
464
|
+
} catch (c) {
|
|
465
|
+
s(c);
|
|
466
|
+
}
|
|
467
|
+
};
|
|
468
|
+
t.then(a(t), v(t)), O(t, f);
|
|
469
|
+
}), B.set(t, o)), o;
|
|
470
|
+
};
|
|
471
|
+
function Ct(t, n) {
|
|
472
|
+
const { delay: o, unstable_promiseStatus: e = !U.use } = {}, s = tt(), [[i, a, v], f] = st(
|
|
473
|
+
(d) => {
|
|
474
|
+
const u = s.get(t);
|
|
475
|
+
return Object.is(d[0], u) && d[1] === s && d[2] === t ? d : [u, s, t];
|
|
476
|
+
},
|
|
477
|
+
void 0,
|
|
478
|
+
() => [s.get(t), s, t]
|
|
479
|
+
);
|
|
480
|
+
let c = i;
|
|
481
|
+
if ((a !== s || v !== t) && (f(), c = s.get(t)), it(() => {
|
|
482
|
+
const d = s.sub(t, () => {
|
|
483
|
+
if (e)
|
|
484
|
+
try {
|
|
485
|
+
const u = s.get(t);
|
|
486
|
+
V(u) && z(
|
|
487
|
+
j(u, () => s.get(t))
|
|
488
|
+
);
|
|
489
|
+
} catch {
|
|
490
|
+
}
|
|
491
|
+
if (typeof o == "number") {
|
|
492
|
+
setTimeout(f, o);
|
|
493
|
+
return;
|
|
494
|
+
}
|
|
495
|
+
f();
|
|
496
|
+
});
|
|
497
|
+
return f(), d;
|
|
498
|
+
}, [s, t, o, e]), ct(c), V(c)) {
|
|
499
|
+
const d = j(c, () => s.get(t));
|
|
500
|
+
return e && z(d), Rt(d);
|
|
501
|
+
}
|
|
502
|
+
return c;
|
|
503
|
+
}
|
|
504
|
+
function Bt(t, n) {
|
|
505
|
+
const o = tt();
|
|
506
|
+
return ut(
|
|
507
|
+
(...s) => {
|
|
508
|
+
if ((Pt ? "production" : void 0) !== "production" && !("write" in t))
|
|
509
|
+
throw new Error("not writable atom");
|
|
510
|
+
return o.set(t, ...s);
|
|
511
|
+
},
|
|
512
|
+
[o, t]
|
|
513
|
+
);
|
|
514
|
+
}
|
|
515
|
+
function Lt(t, n) {
|
|
516
|
+
return [
|
|
517
|
+
Ct(t),
|
|
518
|
+
// We do wrong type assertion here, which results in throwing an error.
|
|
519
|
+
Bt(t)
|
|
520
|
+
];
|
|
521
|
+
}
|
|
522
|
+
export {
|
|
523
|
+
Wt as P,
|
|
524
|
+
Ot as a,
|
|
525
|
+
Lt as u
|
|
526
|
+
};
|
package/package.json
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@pismo/marola",
|
|
3
3
|
"description": "CDX tribe component library",
|
|
4
|
-
"version": "2.1.
|
|
4
|
+
"version": "2.1.74",
|
|
5
5
|
"type": "module",
|
|
6
6
|
"main": "dist/main.js",
|
|
7
7
|
"types": "dist/main.d.ts",
|
|
@@ -123,6 +123,7 @@
|
|
|
123
123
|
"tmp": "^0.2.5",
|
|
124
124
|
"brace-expansion": "^2.0.2",
|
|
125
125
|
"debug": "^4.4.3",
|
|
126
|
-
"js-yaml": "^4.1.1"
|
|
126
|
+
"js-yaml": "^4.1.1",
|
|
127
|
+
"nwsapi": "2.2.13"
|
|
127
128
|
}
|
|
128
129
|
}
|