xote 4.1.0 → 4.2.0
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/README.md +2 -2
- package/dist/xote.cjs +1 -1
- package/dist/xote.mjs +641 -393
- package/dist/xote.umd.js +1 -1
- package/package.json +2 -2
package/dist/xote.mjs
CHANGED
|
@@ -1,21 +1,21 @@
|
|
|
1
|
-
let
|
|
1
|
+
let U = {
|
|
2
2
|
contents: 0
|
|
3
3
|
};
|
|
4
|
-
function
|
|
5
|
-
return
|
|
4
|
+
function Y() {
|
|
5
|
+
return U.contents = U.contents + 1 | 0, U.contents;
|
|
6
6
|
}
|
|
7
|
-
function
|
|
7
|
+
function xe(e) {
|
|
8
8
|
return e === void 0 ? {
|
|
9
9
|
BS_PRIVATE_NESTED_SOME_NONE: 0
|
|
10
10
|
} : e !== null && e.BS_PRIVATE_NESTED_SOME_NONE !== void 0 ? {
|
|
11
11
|
BS_PRIVATE_NESTED_SOME_NONE: e.BS_PRIVATE_NESTED_SOME_NONE + 1 | 0
|
|
12
12
|
} : e;
|
|
13
13
|
}
|
|
14
|
-
function
|
|
14
|
+
function Ie(e) {
|
|
15
15
|
if (e != null)
|
|
16
|
-
return
|
|
16
|
+
return xe(e);
|
|
17
17
|
}
|
|
18
|
-
function
|
|
18
|
+
function ae(e) {
|
|
19
19
|
if (e === null || e.BS_PRIVATE_NESTED_SOME_NONE === void 0)
|
|
20
20
|
return e;
|
|
21
21
|
let t = e.BS_PRIVATE_NESTED_SOME_NONE;
|
|
@@ -24,219 +24,219 @@ function L(e) {
|
|
|
24
24
|
BS_PRIVATE_NESTED_SOME_NONE: t - 1 | 0
|
|
25
25
|
};
|
|
26
26
|
}
|
|
27
|
-
function
|
|
28
|
-
return e !== void 0 ?
|
|
27
|
+
function K(e, t) {
|
|
28
|
+
return e !== void 0 ? ae(e) : t;
|
|
29
29
|
}
|
|
30
|
-
function
|
|
30
|
+
function Me(e, t, n) {
|
|
31
31
|
return e.reduce(n, t);
|
|
32
32
|
}
|
|
33
|
-
function
|
|
34
|
-
let n = e.length, r = new Array(n),
|
|
35
|
-
for (let
|
|
36
|
-
let
|
|
37
|
-
|
|
33
|
+
function De(e, t) {
|
|
34
|
+
let n = e.length, r = new Array(n), l = 0;
|
|
35
|
+
for (let o = 0; o < n; ++o) {
|
|
36
|
+
let u = e[o], c = t(u);
|
|
37
|
+
c !== void 0 && (r[l] = ae(c), l = l + 1 | 0);
|
|
38
38
|
}
|
|
39
|
-
return r.length =
|
|
39
|
+
return r.length = l, r;
|
|
40
40
|
}
|
|
41
|
-
function
|
|
41
|
+
function je(e, t) {
|
|
42
42
|
let n = 0;
|
|
43
43
|
for (; ; ) {
|
|
44
44
|
let r = n;
|
|
45
45
|
if (r === e.length)
|
|
46
46
|
return;
|
|
47
|
-
let
|
|
48
|
-
if (
|
|
49
|
-
return
|
|
47
|
+
let l = t(e[r]);
|
|
48
|
+
if (l !== void 0)
|
|
49
|
+
return l;
|
|
50
50
|
n = r + 1 | 0;
|
|
51
51
|
}
|
|
52
52
|
}
|
|
53
|
-
let
|
|
53
|
+
let _ = /* @__PURE__ */ new Map(), D = /* @__PURE__ */ new Map(), R = /* @__PURE__ */ new Map(), m = {
|
|
54
54
|
contents: void 0
|
|
55
|
-
},
|
|
55
|
+
}, M = /* @__PURE__ */ new Set(), O = {
|
|
56
56
|
contents: !1
|
|
57
|
-
},
|
|
57
|
+
}, b = {
|
|
58
58
|
contents: !1
|
|
59
59
|
};
|
|
60
|
-
function
|
|
61
|
-
if (
|
|
62
|
-
|
|
60
|
+
function Z(e) {
|
|
61
|
+
if (D.get(e) === void 0) {
|
|
62
|
+
D.set(e, /* @__PURE__ */ new Set());
|
|
63
63
|
return;
|
|
64
64
|
}
|
|
65
65
|
}
|
|
66
|
-
function
|
|
67
|
-
let n =
|
|
66
|
+
function Ge(e, t) {
|
|
67
|
+
let n = D.get(e);
|
|
68
68
|
if (n !== void 0) {
|
|
69
69
|
n.forEach(t);
|
|
70
70
|
return;
|
|
71
71
|
}
|
|
72
72
|
}
|
|
73
|
-
function
|
|
74
|
-
let n =
|
|
73
|
+
function Pe(e, t) {
|
|
74
|
+
let n = D.get(e);
|
|
75
75
|
if (n !== void 0) {
|
|
76
76
|
n.add(t);
|
|
77
77
|
return;
|
|
78
78
|
}
|
|
79
79
|
}
|
|
80
|
-
function
|
|
81
|
-
let n =
|
|
80
|
+
function Le(e, t) {
|
|
81
|
+
let n = D.get(e);
|
|
82
82
|
if (n !== void 0) {
|
|
83
83
|
n.delete(t);
|
|
84
84
|
return;
|
|
85
85
|
}
|
|
86
86
|
}
|
|
87
|
-
function
|
|
88
|
-
return Array.from(
|
|
87
|
+
function Re(e) {
|
|
88
|
+
return Array.from(K(D.get(e), /* @__PURE__ */ new Set()).values());
|
|
89
89
|
}
|
|
90
|
-
function
|
|
91
|
-
let n =
|
|
92
|
-
|
|
90
|
+
function de(e, t) {
|
|
91
|
+
let n = m.contents;
|
|
92
|
+
m.contents = e;
|
|
93
93
|
try {
|
|
94
94
|
let r = t();
|
|
95
|
-
return
|
|
95
|
+
return m.contents = n, r;
|
|
96
96
|
} catch (r) {
|
|
97
|
-
throw
|
|
97
|
+
throw m.contents = n, r;
|
|
98
98
|
}
|
|
99
99
|
}
|
|
100
|
-
function
|
|
101
|
-
let t =
|
|
102
|
-
|
|
100
|
+
function Fe(e) {
|
|
101
|
+
let t = m.contents;
|
|
102
|
+
m.contents = void 0;
|
|
103
103
|
try {
|
|
104
104
|
let n = e();
|
|
105
|
-
return
|
|
105
|
+
return m.contents = t, n;
|
|
106
106
|
} catch (n) {
|
|
107
|
-
throw
|
|
107
|
+
throw m.contents = t, n;
|
|
108
108
|
}
|
|
109
109
|
}
|
|
110
|
-
function
|
|
111
|
-
let t =
|
|
110
|
+
function Be(e) {
|
|
111
|
+
let t = m.contents;
|
|
112
112
|
return t !== void 0 ? t === e : !1;
|
|
113
113
|
}
|
|
114
|
-
function
|
|
115
|
-
if (!
|
|
116
|
-
|
|
114
|
+
function ze(e) {
|
|
115
|
+
if (!O.contents) {
|
|
116
|
+
O.contents = !0;
|
|
117
117
|
try {
|
|
118
|
-
e(),
|
|
118
|
+
e(), O.contents = !1;
|
|
119
119
|
return;
|
|
120
120
|
} catch (t) {
|
|
121
|
-
throw
|
|
121
|
+
throw O.contents = !1, t;
|
|
122
122
|
}
|
|
123
123
|
}
|
|
124
124
|
}
|
|
125
|
-
function
|
|
126
|
-
|
|
127
|
-
let n =
|
|
125
|
+
function Ve(e, t) {
|
|
126
|
+
Z(t);
|
|
127
|
+
let n = Be(e), r = _.get(e);
|
|
128
128
|
if (n && r !== void 0 && !r.deps.has(t))
|
|
129
|
-
return r.deps.add(t),
|
|
129
|
+
return r.deps.add(t), Pe(t, e);
|
|
130
130
|
}
|
|
131
|
-
function
|
|
132
|
-
e.deps.forEach((t) =>
|
|
131
|
+
function j(e) {
|
|
132
|
+
e.deps.forEach((t) => Le(t, e.id)), e.deps.clear();
|
|
133
133
|
}
|
|
134
|
-
function
|
|
135
|
-
let t =
|
|
134
|
+
function We(e) {
|
|
135
|
+
let t = R.get(e);
|
|
136
136
|
if (t === void 0)
|
|
137
137
|
return;
|
|
138
|
-
|
|
139
|
-
let n =
|
|
138
|
+
R.delete(e);
|
|
139
|
+
let n = _.get(t);
|
|
140
140
|
if (n !== void 0) {
|
|
141
|
-
|
|
141
|
+
j(n), _.delete(t);
|
|
142
142
|
return;
|
|
143
143
|
}
|
|
144
144
|
}
|
|
145
|
-
function
|
|
146
|
-
return
|
|
145
|
+
function fe(e) {
|
|
146
|
+
return Me(e, 0, (t, n) => n > t ? n : t);
|
|
147
147
|
}
|
|
148
|
-
function
|
|
148
|
+
function Ke(e) {
|
|
149
149
|
let t = [];
|
|
150
|
-
return e.deps.forEach((n) =>
|
|
150
|
+
return e.deps.forEach((n) => Ge(n, (r) => {
|
|
151
151
|
if (r === e.id)
|
|
152
152
|
return;
|
|
153
|
-
let
|
|
154
|
-
if (
|
|
153
|
+
let l = _.get(r);
|
|
154
|
+
if (l === void 0)
|
|
155
155
|
return;
|
|
156
|
-
if (typeof
|
|
157
|
-
t.push(
|
|
156
|
+
if (typeof l.kind == "object") {
|
|
157
|
+
t.push(l.level);
|
|
158
158
|
return;
|
|
159
159
|
}
|
|
160
|
-
})),
|
|
160
|
+
})), fe(t) + 1 | 0;
|
|
161
161
|
}
|
|
162
|
-
function
|
|
162
|
+
function Xe(e) {
|
|
163
163
|
let t = [];
|
|
164
164
|
return e.deps.forEach((n) => {
|
|
165
|
-
let r =
|
|
165
|
+
let r = R.get(n);
|
|
166
166
|
if (r === void 0 || r === e.id)
|
|
167
167
|
return;
|
|
168
|
-
let
|
|
169
|
-
if (
|
|
170
|
-
t.push(
|
|
168
|
+
let l = _.get(r);
|
|
169
|
+
if (l !== void 0) {
|
|
170
|
+
t.push(l.level);
|
|
171
171
|
return;
|
|
172
172
|
}
|
|
173
|
-
}),
|
|
173
|
+
}), fe(t) + 1 | 0;
|
|
174
174
|
}
|
|
175
|
-
function
|
|
176
|
-
return typeof e.kind == "object" ?
|
|
175
|
+
function X(e) {
|
|
176
|
+
return typeof e.kind == "object" ? Xe(e) : Ke(e);
|
|
177
177
|
}
|
|
178
|
-
function
|
|
179
|
-
let n =
|
|
178
|
+
function qe(e, t) {
|
|
179
|
+
let n = _.get(e), r = _.get(t);
|
|
180
180
|
if (n === void 0)
|
|
181
181
|
return r !== void 0 ? 1 : 0;
|
|
182
182
|
if (r === void 0)
|
|
183
183
|
return -1;
|
|
184
|
-
let
|
|
185
|
-
return
|
|
184
|
+
let o = typeof n.kind == "object" ? 0 : 1, c = typeof r.kind == "object" ? 0 : 1, f = o - c | 0;
|
|
185
|
+
return f !== 0 ? f : n.level - r.level | 0;
|
|
186
186
|
}
|
|
187
|
-
function
|
|
188
|
-
|
|
189
|
-
e.run(),
|
|
190
|
-
}), e.level =
|
|
191
|
-
}
|
|
192
|
-
function
|
|
193
|
-
for (;
|
|
194
|
-
let e = Array.from(
|
|
195
|
-
|
|
196
|
-
let n =
|
|
187
|
+
function He(e) {
|
|
188
|
+
b.contents = !0, j(e), de(e.id, () => {
|
|
189
|
+
e.run(), b.contents = !1;
|
|
190
|
+
}), e.level = X(e);
|
|
191
|
+
}
|
|
192
|
+
function pe() {
|
|
193
|
+
for (; M.size > 0; ) {
|
|
194
|
+
let e = Array.from(M.values());
|
|
195
|
+
M.clear(), e.sort(qe), e.forEach((t) => {
|
|
196
|
+
let n = _.get(t);
|
|
197
197
|
if (n !== void 0)
|
|
198
|
-
return
|
|
198
|
+
return He(n);
|
|
199
199
|
});
|
|
200
200
|
}
|
|
201
201
|
}
|
|
202
|
-
function
|
|
203
|
-
if (
|
|
204
|
-
let n =
|
|
202
|
+
function me(e) {
|
|
203
|
+
if (Z(e), Re(e).forEach((t) => {
|
|
204
|
+
let n = _.get(t);
|
|
205
205
|
if (n === void 0)
|
|
206
206
|
return;
|
|
207
207
|
let r = n.kind;
|
|
208
208
|
if (typeof r == "object")
|
|
209
|
-
return n.dirty ? void 0 : (n.dirty = !0,
|
|
210
|
-
|
|
211
|
-
}),
|
|
212
|
-
return
|
|
209
|
+
return n.dirty ? void 0 : (n.dirty = !0, me(r.VAL));
|
|
210
|
+
M.add(t);
|
|
211
|
+
}), M.size > 0)
|
|
212
|
+
return ze(pe);
|
|
213
213
|
}
|
|
214
|
-
function
|
|
215
|
-
let t =
|
|
214
|
+
function he(e) {
|
|
215
|
+
let t = R.get(e);
|
|
216
216
|
if (t === void 0)
|
|
217
217
|
return;
|
|
218
|
-
let n =
|
|
218
|
+
let n = _.get(t);
|
|
219
219
|
if (n !== void 0 && n.dirty) {
|
|
220
|
-
|
|
221
|
-
n.run(), n.dirty = !1,
|
|
222
|
-
}), n.level =
|
|
220
|
+
b.contents = !0, j(n), de(t, () => {
|
|
221
|
+
n.run(), n.dirty = !1, b.contents = !1;
|
|
222
|
+
}), n.level = X(n);
|
|
223
223
|
return;
|
|
224
224
|
}
|
|
225
225
|
}
|
|
226
|
-
function
|
|
227
|
-
let t =
|
|
228
|
-
|
|
226
|
+
function Ue(e) {
|
|
227
|
+
let t = O.contents;
|
|
228
|
+
O.contents = !0;
|
|
229
229
|
try {
|
|
230
230
|
let n = e();
|
|
231
|
-
return t || (
|
|
231
|
+
return t || (O.contents = !1, M.size > 0 && pe()), n;
|
|
232
232
|
} catch (n) {
|
|
233
|
-
throw t || (
|
|
233
|
+
throw t || (O.contents = !1), n;
|
|
234
234
|
}
|
|
235
235
|
}
|
|
236
|
-
let
|
|
237
|
-
function
|
|
238
|
-
let r =
|
|
239
|
-
return
|
|
236
|
+
let Je = Fe, Qe = Z;
|
|
237
|
+
function _e(e, t, n) {
|
|
238
|
+
let r = Y();
|
|
239
|
+
return Qe(r), {
|
|
240
240
|
id: r,
|
|
241
241
|
value: {
|
|
242
242
|
contents: e
|
|
@@ -244,19 +244,19 @@ function X(e, t, n) {
|
|
|
244
244
|
version: {
|
|
245
245
|
contents: 0
|
|
246
246
|
},
|
|
247
|
-
equals:
|
|
247
|
+
equals: K(n, (l, o) => l === o),
|
|
248
248
|
name: t
|
|
249
249
|
};
|
|
250
250
|
}
|
|
251
|
-
function
|
|
252
|
-
|
|
253
|
-
let t =
|
|
254
|
-
return t !== void 0 &&
|
|
251
|
+
function Ye(e) {
|
|
252
|
+
he(e.id);
|
|
253
|
+
let t = m.contents;
|
|
254
|
+
return t !== void 0 && Ve(t, e.id), e.value.contents;
|
|
255
255
|
}
|
|
256
|
-
function
|
|
257
|
-
return
|
|
256
|
+
function Ze(e) {
|
|
257
|
+
return he(e.id), e.value.contents;
|
|
258
258
|
}
|
|
259
|
-
function
|
|
259
|
+
function ge(e, t) {
|
|
260
260
|
let n;
|
|
261
261
|
try {
|
|
262
262
|
n = !e.equals(e.value.contents, t);
|
|
@@ -264,25 +264,25 @@ function q(e, t) {
|
|
|
264
264
|
n = !0;
|
|
265
265
|
}
|
|
266
266
|
if (n)
|
|
267
|
-
return e.value.contents = t, e.version.contents = e.version.contents + 1 | 0,
|
|
267
|
+
return e.value.contents = t, e.version.contents = e.version.contents + 1 | 0, me(e.id);
|
|
268
268
|
}
|
|
269
|
-
function
|
|
270
|
-
|
|
269
|
+
function et(e, t) {
|
|
270
|
+
ge(e, t(e.value.contents));
|
|
271
271
|
}
|
|
272
|
-
let
|
|
273
|
-
const
|
|
272
|
+
let tt, nt, rt = Ue, lt = Je;
|
|
273
|
+
const ut = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
|
|
274
274
|
__proto__: null,
|
|
275
|
-
Id:
|
|
276
|
-
Scheduler:
|
|
277
|
-
batch:
|
|
278
|
-
get:
|
|
279
|
-
make:
|
|
280
|
-
peek:
|
|
281
|
-
set:
|
|
282
|
-
untrack:
|
|
283
|
-
update:
|
|
275
|
+
Id: tt,
|
|
276
|
+
Scheduler: nt,
|
|
277
|
+
batch: rt,
|
|
278
|
+
get: Ye,
|
|
279
|
+
make: _e,
|
|
280
|
+
peek: Ze,
|
|
281
|
+
set: ge,
|
|
282
|
+
untrack: lt,
|
|
283
|
+
update: et
|
|
284
284
|
}, Symbol.toStringTag, { value: "Module" }));
|
|
285
|
-
function
|
|
285
|
+
function Se(e, t, n) {
|
|
286
286
|
return {
|
|
287
287
|
id: e,
|
|
288
288
|
kind: t,
|
|
@@ -292,73 +292,73 @@ function H(e, t, n) {
|
|
|
292
292
|
dirty: !0
|
|
293
293
|
};
|
|
294
294
|
}
|
|
295
|
-
function
|
|
296
|
-
let t =
|
|
295
|
+
function ot(e) {
|
|
296
|
+
let t = Y(), n = {
|
|
297
297
|
contents: void 0
|
|
298
|
-
},
|
|
299
|
-
let
|
|
300
|
-
|
|
298
|
+
}, l = Se(t, "Effect", () => {
|
|
299
|
+
let c = n.contents;
|
|
300
|
+
c !== void 0 && c(), n.contents = e();
|
|
301
301
|
});
|
|
302
|
-
|
|
303
|
-
let
|
|
304
|
-
|
|
302
|
+
_.set(t, l), b.contents = !0, j(l);
|
|
303
|
+
let o = m.contents;
|
|
304
|
+
m.contents = t;
|
|
305
305
|
try {
|
|
306
|
-
|
|
307
|
-
} catch (
|
|
308
|
-
throw
|
|
306
|
+
l.run(), b.contents = !1;
|
|
307
|
+
} catch (c) {
|
|
308
|
+
throw m.contents = o, b.contents = !1, c;
|
|
309
309
|
}
|
|
310
|
-
return
|
|
310
|
+
return m.contents = o, l.level = X(l), {
|
|
311
311
|
dispose: () => {
|
|
312
|
-
let
|
|
313
|
-
if (
|
|
312
|
+
let c = _.get(t);
|
|
313
|
+
if (c === void 0)
|
|
314
314
|
return;
|
|
315
|
-
let
|
|
316
|
-
|
|
315
|
+
let f = n.contents;
|
|
316
|
+
f !== void 0 && f(), j(c), _.delete(t);
|
|
317
317
|
}
|
|
318
318
|
};
|
|
319
319
|
}
|
|
320
|
-
let
|
|
321
|
-
const
|
|
320
|
+
let it, st, ct;
|
|
321
|
+
const at = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
|
|
322
322
|
__proto__: null,
|
|
323
|
-
Id:
|
|
324
|
-
Observer:
|
|
325
|
-
Scheduler:
|
|
326
|
-
run:
|
|
323
|
+
Id: it,
|
|
324
|
+
Observer: st,
|
|
325
|
+
Scheduler: ct,
|
|
326
|
+
run: ot
|
|
327
327
|
}, Symbol.toStringTag, { value: "Module" }));
|
|
328
|
-
function
|
|
329
|
-
let t =
|
|
330
|
-
let
|
|
331
|
-
t.value.contents =
|
|
332
|
-
},
|
|
328
|
+
function dt(e) {
|
|
329
|
+
let t = _e(void 0, void 0, void 0), n = Y(), r = () => {
|
|
330
|
+
let u = e();
|
|
331
|
+
t.value.contents = u;
|
|
332
|
+
}, l = Se(n, {
|
|
333
333
|
NAME: "Computed",
|
|
334
334
|
VAL: t.id
|
|
335
335
|
}, r);
|
|
336
|
-
|
|
337
|
-
let
|
|
338
|
-
|
|
336
|
+
_.set(n, l), b.contents = !0, j(l);
|
|
337
|
+
let o = m.contents;
|
|
338
|
+
m.contents = n;
|
|
339
339
|
try {
|
|
340
|
-
|
|
341
|
-
} catch (
|
|
342
|
-
throw
|
|
340
|
+
l.run(), l.dirty = !1, b.contents = !1;
|
|
341
|
+
} catch (u) {
|
|
342
|
+
throw m.contents = o, b.contents = !1, u;
|
|
343
343
|
}
|
|
344
|
-
return
|
|
344
|
+
return m.contents = o, l.level = X(l), R.set(t.id, n), t;
|
|
345
345
|
}
|
|
346
|
-
function
|
|
347
|
-
|
|
346
|
+
function ft(e) {
|
|
347
|
+
We(e.id);
|
|
348
348
|
}
|
|
349
|
-
let
|
|
350
|
-
const
|
|
349
|
+
let pt, mt, ht, _t;
|
|
350
|
+
const gt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
|
|
351
351
|
__proto__: null,
|
|
352
|
-
Id:
|
|
353
|
-
Observer:
|
|
354
|
-
Scheduler:
|
|
355
|
-
Signal:
|
|
356
|
-
dispose:
|
|
357
|
-
make:
|
|
352
|
+
Id: pt,
|
|
353
|
+
Observer: ht,
|
|
354
|
+
Scheduler: _t,
|
|
355
|
+
Signal: mt,
|
|
356
|
+
dispose: ft,
|
|
357
|
+
make: dt
|
|
358
358
|
}, Symbol.toStringTag, { value: "Module" }));
|
|
359
|
-
let
|
|
360
|
-
function
|
|
361
|
-
return
|
|
359
|
+
let i = ut, v = gt, w = at;
|
|
360
|
+
function ve(e) {
|
|
361
|
+
return De(e.split("/"), (t) => {
|
|
362
362
|
if (t !== "")
|
|
363
363
|
return t.startsWith(":") ? {
|
|
364
364
|
TAG: "Param",
|
|
@@ -369,29 +369,32 @@ function U(e) {
|
|
|
369
369
|
};
|
|
370
370
|
});
|
|
371
371
|
}
|
|
372
|
-
function
|
|
373
|
-
let n = t.split("/").filter((
|
|
372
|
+
function Ee(e, t) {
|
|
373
|
+
let n = t.split("/").filter((o) => o !== "");
|
|
374
374
|
if (e.length !== n.length)
|
|
375
375
|
return "NoMatch";
|
|
376
376
|
let r = {};
|
|
377
|
-
return e.every((
|
|
378
|
-
let
|
|
379
|
-
return
|
|
377
|
+
return e.every((o, u) => {
|
|
378
|
+
let c = n[u];
|
|
379
|
+
return o.TAG === "Static" ? c === o._0 : (r[o._0] = c, !0);
|
|
380
380
|
}) ? {
|
|
381
381
|
TAG: "Match",
|
|
382
382
|
_0: r
|
|
383
383
|
} : "NoMatch";
|
|
384
384
|
}
|
|
385
|
-
function
|
|
386
|
-
return
|
|
385
|
+
function ee(e, t) {
|
|
386
|
+
return Ee(ve(e), t);
|
|
387
387
|
}
|
|
388
|
-
const
|
|
388
|
+
const St = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
|
|
389
389
|
__proto__: null,
|
|
390
|
-
match:
|
|
391
|
-
matchPath:
|
|
392
|
-
parsePattern:
|
|
390
|
+
match: ee,
|
|
391
|
+
matchPath: Ee,
|
|
392
|
+
parsePattern: ve
|
|
393
393
|
}, Symbol.toStringTag, { value: "Module" }));
|
|
394
|
-
function
|
|
394
|
+
function vt(e, t) {
|
|
395
|
+
delete e[t];
|
|
396
|
+
}
|
|
397
|
+
function we(e, t) {
|
|
395
398
|
return [
|
|
396
399
|
e,
|
|
397
400
|
{
|
|
@@ -400,7 +403,7 @@ function K(e, t) {
|
|
|
400
403
|
}
|
|
401
404
|
];
|
|
402
405
|
}
|
|
403
|
-
function
|
|
406
|
+
function Et(e, t) {
|
|
404
407
|
return [
|
|
405
408
|
e,
|
|
406
409
|
{
|
|
@@ -409,7 +412,7 @@ function Xe(e, t) {
|
|
|
409
412
|
}
|
|
410
413
|
];
|
|
411
414
|
}
|
|
412
|
-
function
|
|
415
|
+
function wt(e, t) {
|
|
413
416
|
return [
|
|
414
417
|
e,
|
|
415
418
|
{
|
|
@@ -418,287 +421,532 @@ function qe(e, t) {
|
|
|
418
421
|
}
|
|
419
422
|
];
|
|
420
423
|
}
|
|
421
|
-
function
|
|
424
|
+
function yt(e) {
|
|
422
425
|
return {
|
|
423
426
|
TAG: "Text",
|
|
424
427
|
_0: e
|
|
425
428
|
};
|
|
426
429
|
}
|
|
427
|
-
function
|
|
430
|
+
function bt(e) {
|
|
428
431
|
return {
|
|
429
432
|
TAG: "SignalText",
|
|
430
|
-
_0:
|
|
433
|
+
_0: v.make(e)
|
|
431
434
|
};
|
|
432
435
|
}
|
|
433
|
-
function
|
|
436
|
+
function kt(e) {
|
|
434
437
|
return {
|
|
435
438
|
TAG: "Fragment",
|
|
436
439
|
_0: e
|
|
437
440
|
};
|
|
438
441
|
}
|
|
439
|
-
function
|
|
442
|
+
function te(e) {
|
|
440
443
|
return {
|
|
441
444
|
TAG: "SignalFragment",
|
|
442
445
|
_0: e
|
|
443
446
|
};
|
|
444
447
|
}
|
|
445
|
-
function
|
|
448
|
+
function Tt(e, t) {
|
|
446
449
|
return {
|
|
447
450
|
TAG: "SignalFragment",
|
|
448
|
-
_0:
|
|
451
|
+
_0: v.make(() => i.get(e).map(t))
|
|
449
452
|
};
|
|
450
453
|
}
|
|
451
|
-
function
|
|
452
|
-
let
|
|
454
|
+
function E(e, t, n, r, l) {
|
|
455
|
+
let o = t !== void 0 ? t : [].map((f) => f), u = n !== void 0 ? n : [].map((f) => f), c = r !== void 0 ? r : [].map((f) => f);
|
|
453
456
|
return {
|
|
454
457
|
TAG: "Element",
|
|
455
458
|
tag: e,
|
|
456
|
-
attrs:
|
|
457
|
-
events:
|
|
458
|
-
children:
|
|
459
|
+
attrs: o,
|
|
460
|
+
events: u,
|
|
461
|
+
children: c
|
|
459
462
|
};
|
|
460
463
|
}
|
|
461
|
-
function
|
|
462
|
-
return
|
|
464
|
+
function At(e, t, n, r) {
|
|
465
|
+
return E("div", e, t, n);
|
|
466
|
+
}
|
|
467
|
+
function Ot(e, t, n, r) {
|
|
468
|
+
return E("span", e, t, n);
|
|
469
|
+
}
|
|
470
|
+
function $t(e, t, n, r) {
|
|
471
|
+
return E("button", e, t, n);
|
|
472
|
+
}
|
|
473
|
+
function Ct(e, t, n) {
|
|
474
|
+
return E("input", e, t, void 0);
|
|
475
|
+
}
|
|
476
|
+
function Nt(e, t, n, r) {
|
|
477
|
+
return E("h1", e, t, n);
|
|
463
478
|
}
|
|
464
|
-
function
|
|
465
|
-
return
|
|
479
|
+
function xt(e, t, n, r) {
|
|
480
|
+
return E("h2", e, t, n);
|
|
466
481
|
}
|
|
467
|
-
function
|
|
468
|
-
return
|
|
482
|
+
function It(e, t, n, r) {
|
|
483
|
+
return E("h3", e, t, n);
|
|
469
484
|
}
|
|
470
|
-
function
|
|
471
|
-
return
|
|
485
|
+
function Mt(e, t, n, r) {
|
|
486
|
+
return E("p", e, t, n);
|
|
472
487
|
}
|
|
473
|
-
function
|
|
474
|
-
return
|
|
488
|
+
function Dt(e, t, n, r) {
|
|
489
|
+
return E("ul", e, t, n);
|
|
475
490
|
}
|
|
476
|
-
function
|
|
477
|
-
return
|
|
491
|
+
function jt(e, t, n, r) {
|
|
492
|
+
return E("li", e, t, n);
|
|
478
493
|
}
|
|
479
|
-
function
|
|
480
|
-
return
|
|
494
|
+
function ye(e, t, n, r) {
|
|
495
|
+
return E("a", e, t, n);
|
|
496
|
+
}
|
|
497
|
+
let $ = {
|
|
498
|
+
contents: void 0
|
|
499
|
+
};
|
|
500
|
+
function Gt() {
|
|
501
|
+
return {
|
|
502
|
+
disposers: [],
|
|
503
|
+
signals: [],
|
|
504
|
+
computeds: []
|
|
505
|
+
};
|
|
481
506
|
}
|
|
482
|
-
function
|
|
483
|
-
|
|
507
|
+
function N(e, t) {
|
|
508
|
+
let n = $.contents;
|
|
509
|
+
$.contents = e;
|
|
510
|
+
let r = t();
|
|
511
|
+
return $.contents = n, r;
|
|
484
512
|
}
|
|
485
|
-
function
|
|
486
|
-
|
|
513
|
+
function Pt(e) {
|
|
514
|
+
let t = $.contents;
|
|
515
|
+
if (t !== void 0) {
|
|
516
|
+
t.signals.push(e);
|
|
517
|
+
return;
|
|
518
|
+
}
|
|
487
519
|
}
|
|
488
|
-
function
|
|
489
|
-
|
|
520
|
+
function Lt(e) {
|
|
521
|
+
let t = $.contents;
|
|
522
|
+
if (t !== void 0) {
|
|
523
|
+
t.computeds.push(e);
|
|
524
|
+
return;
|
|
525
|
+
}
|
|
490
526
|
}
|
|
491
|
-
function
|
|
492
|
-
|
|
527
|
+
function Rt(e) {
|
|
528
|
+
let t = $.contents;
|
|
529
|
+
if (t !== void 0) {
|
|
530
|
+
t.disposers.push(e);
|
|
531
|
+
return;
|
|
532
|
+
}
|
|
493
533
|
}
|
|
494
|
-
function
|
|
495
|
-
let n =
|
|
534
|
+
function A(e, t) {
|
|
535
|
+
let n = K(Ie(e.__xote_disposers), []);
|
|
496
536
|
e.__xote_disposers = n.concat([t]);
|
|
537
|
+
let r = $.contents;
|
|
538
|
+
if (r !== void 0) {
|
|
539
|
+
r.disposers.push(t);
|
|
540
|
+
return;
|
|
541
|
+
}
|
|
497
542
|
}
|
|
498
|
-
|
|
499
|
-
|
|
500
|
-
|
|
543
|
+
let J = (function(e) {
|
|
544
|
+
e.__devtoolsId && window.__xoteDevToolsMarkAsDisposed && window.__xoteDevToolsMarkAsDisposed(e.__devtoolsId);
|
|
545
|
+
});
|
|
546
|
+
function W(e) {
|
|
547
|
+
e.disposers.forEach((t) => t.dispose()), e.computeds.forEach((t) => {
|
|
548
|
+
v.dispose(t), J(t);
|
|
549
|
+
}), e.signals.forEach((t) => J(t));
|
|
550
|
+
}
|
|
551
|
+
function Ft(e) {
|
|
552
|
+
let t = {
|
|
553
|
+
disposers: [],
|
|
554
|
+
signals: [],
|
|
555
|
+
computeds: []
|
|
556
|
+
};
|
|
557
|
+
return N(t, () => e(() => W(t))), () => W(t);
|
|
558
|
+
}
|
|
559
|
+
function Bt(e) {
|
|
560
|
+
return {
|
|
561
|
+
TAG: "LazyComponent",
|
|
562
|
+
_0: e
|
|
563
|
+
};
|
|
564
|
+
}
|
|
565
|
+
function L(e) {
|
|
566
|
+
let t = e.__xote_owner;
|
|
567
|
+
t != null && (W(t), e.__xote_owner = {
|
|
568
|
+
disposers: [],
|
|
569
|
+
signals: [],
|
|
570
|
+
computeds: []
|
|
571
|
+
});
|
|
572
|
+
let n = e.__xote_disposers;
|
|
573
|
+
n != null && (n.forEach((l) => l.dispose()), e.__xote_disposers = []), Array.from(e.childNodes || []).forEach(L);
|
|
501
574
|
}
|
|
502
|
-
function
|
|
575
|
+
function k(e) {
|
|
503
576
|
switch (e.TAG) {
|
|
504
577
|
case "Element":
|
|
505
|
-
let t =
|
|
506
|
-
|
|
507
|
-
|
|
508
|
-
|
|
509
|
-
|
|
510
|
-
|
|
511
|
-
|
|
512
|
-
|
|
513
|
-
|
|
514
|
-
|
|
515
|
-
|
|
516
|
-
|
|
517
|
-
|
|
518
|
-
|
|
519
|
-
|
|
520
|
-
|
|
521
|
-
|
|
522
|
-
|
|
523
|
-
|
|
524
|
-
|
|
525
|
-
|
|
526
|
-
|
|
527
|
-
|
|
528
|
-
|
|
529
|
-
|
|
530
|
-
|
|
531
|
-
|
|
532
|
-
|
|
533
|
-
|
|
534
|
-
|
|
578
|
+
let t = e.children, n = e.events, r = e.attrs, l = e.tag, o = {
|
|
579
|
+
disposers: [],
|
|
580
|
+
signals: [],
|
|
581
|
+
computeds: []
|
|
582
|
+
}, u;
|
|
583
|
+
switch (l) {
|
|
584
|
+
case "circle":
|
|
585
|
+
case "clipPath":
|
|
586
|
+
case "defs":
|
|
587
|
+
case "ellipse":
|
|
588
|
+
case "g":
|
|
589
|
+
case "line":
|
|
590
|
+
case "linearGradient":
|
|
591
|
+
case "marker":
|
|
592
|
+
case "mask":
|
|
593
|
+
case "path":
|
|
594
|
+
case "pattern":
|
|
595
|
+
case "polygon":
|
|
596
|
+
case "polyline":
|
|
597
|
+
case "radialGradient":
|
|
598
|
+
case "rect":
|
|
599
|
+
case "stop":
|
|
600
|
+
case "svg":
|
|
601
|
+
case "symbol":
|
|
602
|
+
case "text":
|
|
603
|
+
case "textPath":
|
|
604
|
+
case "tspan":
|
|
605
|
+
case "use":
|
|
606
|
+
u = document.createElementNS("http://www.w3.org/2000/svg", l);
|
|
607
|
+
break;
|
|
608
|
+
default:
|
|
609
|
+
u = document.createElement(l);
|
|
610
|
+
}
|
|
611
|
+
return u.__xote_owner = o, N(o, () => {
|
|
612
|
+
r.forEach((a) => {
|
|
613
|
+
let p = a[1], h = a[0];
|
|
614
|
+
switch (p.TAG) {
|
|
615
|
+
case "Static":
|
|
616
|
+
let y = p._0;
|
|
617
|
+
h === "value" && l === "input" ? u.value = y : u.setAttribute(h, y);
|
|
618
|
+
return;
|
|
619
|
+
case "SignalValue":
|
|
620
|
+
let g = p._0;
|
|
621
|
+
if (h === "value" && l === "input") {
|
|
622
|
+
u.value = i.peek(g);
|
|
623
|
+
let S = w.run(() => {
|
|
624
|
+
let P = i.get(g);
|
|
625
|
+
u.value = P;
|
|
626
|
+
});
|
|
627
|
+
return A(u, S);
|
|
628
|
+
}
|
|
629
|
+
u.setAttribute(h, i.peek(g));
|
|
630
|
+
let V = w.run(() => {
|
|
631
|
+
let S = i.get(g);
|
|
632
|
+
u.setAttribute(h, S);
|
|
633
|
+
});
|
|
634
|
+
return A(u, V);
|
|
635
|
+
case "Compute":
|
|
636
|
+
let I = p._0, s = v.make(() => I());
|
|
637
|
+
if (h === "value" && l === "input") {
|
|
638
|
+
u.value = i.peek(s);
|
|
639
|
+
let S = w.run(() => {
|
|
640
|
+
let P = i.get(s);
|
|
641
|
+
u.value = P;
|
|
642
|
+
});
|
|
643
|
+
return A(u, S);
|
|
644
|
+
}
|
|
645
|
+
u.setAttribute(h, i.peek(s));
|
|
646
|
+
let d = w.run(() => {
|
|
647
|
+
let S = i.get(s);
|
|
648
|
+
u.setAttribute(h, S);
|
|
649
|
+
});
|
|
650
|
+
return A(u, d);
|
|
651
|
+
}
|
|
652
|
+
}), n.forEach((a) => {
|
|
653
|
+
u.addEventListener(a[0], a[1]);
|
|
654
|
+
}), t.forEach((a) => {
|
|
655
|
+
let p = k(a);
|
|
656
|
+
u.appendChild(p);
|
|
657
|
+
});
|
|
658
|
+
}), u;
|
|
535
659
|
case "Text":
|
|
536
660
|
return document.createTextNode(e._0);
|
|
537
661
|
case "SignalText":
|
|
538
|
-
let
|
|
539
|
-
|
|
540
|
-
|
|
541
|
-
|
|
542
|
-
|
|
662
|
+
let c = e._0, f = {
|
|
663
|
+
disposers: [],
|
|
664
|
+
signals: [],
|
|
665
|
+
computeds: []
|
|
666
|
+
}, F = document.createTextNode(i.peek(c));
|
|
667
|
+
return F.__xote_owner = f, N(f, () => {
|
|
668
|
+
let a = w.run(() => {
|
|
669
|
+
let p = i.get(c);
|
|
670
|
+
F.textContent = p;
|
|
671
|
+
});
|
|
672
|
+
A(F, a);
|
|
673
|
+
}), F;
|
|
543
674
|
case "Fragment":
|
|
544
|
-
let
|
|
545
|
-
return e._0.forEach((
|
|
546
|
-
let
|
|
547
|
-
|
|
548
|
-
}),
|
|
675
|
+
let ne = document.createDocumentFragment();
|
|
676
|
+
return e._0.forEach((a) => {
|
|
677
|
+
let p = k(a);
|
|
678
|
+
ne.appendChild(p);
|
|
679
|
+
}), ne;
|
|
549
680
|
case "SignalFragment":
|
|
550
|
-
let
|
|
551
|
-
|
|
552
|
-
|
|
553
|
-
|
|
554
|
-
|
|
555
|
-
|
|
556
|
-
|
|
681
|
+
let Te = e._0, re = {
|
|
682
|
+
disposers: [],
|
|
683
|
+
signals: [],
|
|
684
|
+
computeds: []
|
|
685
|
+
}, T = document.createElement("div");
|
|
686
|
+
return T.setAttribute("data-signal-fragment", "true"), T.setAttribute("style", "display: contents"), T.__xote_owner = re, N(re, () => {
|
|
687
|
+
let a = w.run(() => {
|
|
688
|
+
let p = i.get(Te);
|
|
689
|
+
Array.from(T.childNodes || []).forEach(L), T.innerHTML = "", p.forEach((y) => {
|
|
690
|
+
let g = k(y);
|
|
691
|
+
T.appendChild(g);
|
|
692
|
+
});
|
|
693
|
+
});
|
|
694
|
+
A(T, a);
|
|
695
|
+
}), T;
|
|
696
|
+
case "LazyComponent":
|
|
697
|
+
let le = {
|
|
698
|
+
disposers: [],
|
|
699
|
+
signals: [],
|
|
700
|
+
computeds: []
|
|
701
|
+
}, Ae = N(le, e._0), ue = k(Ae);
|
|
702
|
+
return ue.__xote_owner = le, ue;
|
|
703
|
+
case "KeyedList":
|
|
704
|
+
let q = e.renderItem, H = e.keyFn, oe = e.signal, ie = {
|
|
705
|
+
disposers: [],
|
|
706
|
+
signals: [],
|
|
707
|
+
computeds: []
|
|
708
|
+
}, B = document.createComment(" keyed-list-start "), G = document.createComment(" keyed-list-end ");
|
|
709
|
+
B.__xote_owner = ie;
|
|
710
|
+
let C = {}, Oe = () => {
|
|
711
|
+
let a = G.parentNode;
|
|
712
|
+
if (a == null)
|
|
713
|
+
return;
|
|
714
|
+
let p = i.get(oe), h = {};
|
|
715
|
+
p.forEach((s) => {
|
|
716
|
+
let d = H(s);
|
|
717
|
+
h[d] = s;
|
|
718
|
+
});
|
|
719
|
+
let y = [];
|
|
720
|
+
Object.keys(C).forEach((s) => {
|
|
721
|
+
if (h[s] === void 0) {
|
|
722
|
+
y.push(s);
|
|
723
|
+
return;
|
|
724
|
+
}
|
|
725
|
+
}), y.forEach((s) => {
|
|
726
|
+
let d = C[s];
|
|
727
|
+
if (d !== void 0) {
|
|
728
|
+
L(d.element), d.element.remove(), vt(C, s);
|
|
729
|
+
return;
|
|
730
|
+
}
|
|
731
|
+
});
|
|
732
|
+
let g = [], V = {};
|
|
733
|
+
p.forEach((s) => {
|
|
734
|
+
let d = H(s), S = C[d];
|
|
735
|
+
if (S !== void 0) {
|
|
736
|
+
if (S.item !== s) {
|
|
737
|
+
V[d] = !0;
|
|
738
|
+
let Ce = q(s), Ne = k(Ce), ce = {
|
|
739
|
+
key: d,
|
|
740
|
+
item: s,
|
|
741
|
+
element: Ne
|
|
742
|
+
};
|
|
743
|
+
g.push(ce), C[d] = ce;
|
|
744
|
+
return;
|
|
745
|
+
}
|
|
746
|
+
g.push(S);
|
|
747
|
+
return;
|
|
748
|
+
}
|
|
749
|
+
let P = q(s), $e = k(P), se = {
|
|
750
|
+
key: d,
|
|
751
|
+
item: s,
|
|
752
|
+
element: $e
|
|
753
|
+
};
|
|
754
|
+
g.push(se), C[d] = se;
|
|
557
755
|
});
|
|
558
|
-
|
|
559
|
-
|
|
756
|
+
let I = {
|
|
757
|
+
contents: B.nextSibling
|
|
758
|
+
};
|
|
759
|
+
g.forEach((s) => {
|
|
760
|
+
let d = I.contents;
|
|
761
|
+
if (d == null) {
|
|
762
|
+
a.insertBefore(s.element, G);
|
|
763
|
+
return;
|
|
764
|
+
}
|
|
765
|
+
if (d === G) {
|
|
766
|
+
a.insertBefore(s.element, G);
|
|
767
|
+
return;
|
|
768
|
+
}
|
|
769
|
+
if (d === s.element) {
|
|
770
|
+
I.contents = d.nextSibling;
|
|
771
|
+
return;
|
|
772
|
+
}
|
|
773
|
+
K(V[s.key], !1) ? (L(d), a.replaceChild(s.element, d), I.contents = s.element.nextSibling) : (a.insertBefore(s.element, d), I.contents = s.element.nextSibling);
|
|
774
|
+
});
|
|
775
|
+
}, z = document.createDocumentFragment();
|
|
776
|
+
return z.appendChild(B), i.peek(oe).forEach((a) => {
|
|
777
|
+
let p = H(a), h = q(a), y = k(h), g = {
|
|
778
|
+
key: p,
|
|
779
|
+
item: a,
|
|
780
|
+
element: y
|
|
781
|
+
};
|
|
782
|
+
C[p] = g, z.appendChild(y);
|
|
783
|
+
}), z.appendChild(G), N(ie, () => {
|
|
784
|
+
let a = w.run(() => {
|
|
785
|
+
Oe();
|
|
786
|
+
});
|
|
787
|
+
A(B, a);
|
|
788
|
+
}), z;
|
|
560
789
|
}
|
|
561
790
|
}
|
|
562
|
-
function
|
|
563
|
-
let n =
|
|
791
|
+
function be(e, t) {
|
|
792
|
+
let n = k(e);
|
|
564
793
|
t.appendChild(n);
|
|
565
794
|
}
|
|
566
|
-
function
|
|
795
|
+
function zt(e, t) {
|
|
567
796
|
let n = document.getElementById(t);
|
|
568
797
|
if (n == null) {
|
|
569
798
|
console.error("Container element not found: " + t);
|
|
570
799
|
return;
|
|
571
800
|
} else
|
|
572
|
-
return
|
|
801
|
+
return be(e, n);
|
|
573
802
|
}
|
|
574
|
-
|
|
803
|
+
function Vt(e, t, n) {
|
|
804
|
+
return {
|
|
805
|
+
TAG: "KeyedList",
|
|
806
|
+
signal: e,
|
|
807
|
+
keyFn: t,
|
|
808
|
+
renderItem: n
|
|
809
|
+
};
|
|
810
|
+
}
|
|
811
|
+
const Wt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
|
|
575
812
|
__proto__: null,
|
|
576
|
-
a:
|
|
577
|
-
addDisposer:
|
|
578
|
-
attr:
|
|
579
|
-
button:
|
|
580
|
-
|
|
581
|
-
|
|
582
|
-
|
|
583
|
-
|
|
584
|
-
|
|
585
|
-
|
|
586
|
-
|
|
587
|
-
|
|
588
|
-
|
|
589
|
-
|
|
590
|
-
|
|
591
|
-
|
|
592
|
-
|
|
593
|
-
|
|
594
|
-
|
|
595
|
-
|
|
596
|
-
|
|
597
|
-
|
|
598
|
-
|
|
599
|
-
|
|
600
|
-
|
|
813
|
+
a: ye,
|
|
814
|
+
addDisposer: A,
|
|
815
|
+
attr: we,
|
|
816
|
+
button: $t,
|
|
817
|
+
component: Bt,
|
|
818
|
+
computedAttr: wt,
|
|
819
|
+
createOwner: Gt,
|
|
820
|
+
createRoot: Ft,
|
|
821
|
+
currentOwner: $,
|
|
822
|
+
disposeElement: L,
|
|
823
|
+
disposeOwner: W,
|
|
824
|
+
div: At,
|
|
825
|
+
element: E,
|
|
826
|
+
fragment: kt,
|
|
827
|
+
h1: Nt,
|
|
828
|
+
h2: xt,
|
|
829
|
+
h3: It,
|
|
830
|
+
input: Ct,
|
|
831
|
+
keyedList: Vt,
|
|
832
|
+
li: jt,
|
|
833
|
+
list: Tt,
|
|
834
|
+
markAsDisposedInDevTools: J,
|
|
835
|
+
mount: be,
|
|
836
|
+
mountById: zt,
|
|
837
|
+
p: Mt,
|
|
838
|
+
registerComputed: Lt,
|
|
839
|
+
registerEffectDisposer: Rt,
|
|
840
|
+
registerSignal: Pt,
|
|
841
|
+
render: k,
|
|
842
|
+
runWithOwner: N,
|
|
843
|
+
signalAttr: Et,
|
|
844
|
+
signalFragment: te,
|
|
845
|
+
span: Ot,
|
|
846
|
+
text: yt,
|
|
847
|
+
textSignal: bt,
|
|
848
|
+
ul: Dt
|
|
601
849
|
}, Symbol.toStringTag, { value: "Module" }));
|
|
602
|
-
let
|
|
850
|
+
let x = i.make({
|
|
603
851
|
pathname: "/",
|
|
604
852
|
search: "",
|
|
605
853
|
hash: ""
|
|
606
854
|
}, void 0, void 0);
|
|
607
|
-
function
|
|
855
|
+
function Q() {
|
|
608
856
|
return {
|
|
609
857
|
pathname: window.location.pathname,
|
|
610
858
|
search: window.location.search,
|
|
611
859
|
hash: window.location.hash
|
|
612
860
|
};
|
|
613
861
|
}
|
|
614
|
-
function
|
|
615
|
-
|
|
616
|
-
let e = (t) =>
|
|
862
|
+
function Kt() {
|
|
863
|
+
i.set(x, Q());
|
|
864
|
+
let e = (t) => i.set(x, Q());
|
|
617
865
|
window.addEventListener("popstate", e);
|
|
618
866
|
}
|
|
619
|
-
function
|
|
620
|
-
let
|
|
867
|
+
function ke(e, t, n, r) {
|
|
868
|
+
let l = t !== void 0 ? t : "", o = n !== void 0 ? n : "", u = {
|
|
621
869
|
pathname: e,
|
|
622
|
-
search:
|
|
623
|
-
hash:
|
|
624
|
-
},
|
|
625
|
-
window.history.pushState(
|
|
870
|
+
search: l,
|
|
871
|
+
hash: o
|
|
872
|
+
}, c = e + l + o, f = {};
|
|
873
|
+
window.history.pushState(f, "", c), i.set(x, u);
|
|
626
874
|
}
|
|
627
|
-
function
|
|
628
|
-
let
|
|
875
|
+
function Xt(e, t, n, r) {
|
|
876
|
+
let l = t !== void 0 ? t : "", o = n !== void 0 ? n : "", u = {
|
|
629
877
|
pathname: e,
|
|
630
|
-
search:
|
|
631
|
-
hash:
|
|
632
|
-
},
|
|
633
|
-
window.history.replaceState(
|
|
634
|
-
}
|
|
635
|
-
function
|
|
636
|
-
return
|
|
637
|
-
let n =
|
|
878
|
+
search: l,
|
|
879
|
+
hash: o
|
|
880
|
+
}, c = e + l + o, f = {};
|
|
881
|
+
window.history.replaceState(f, "", c), i.set(x, u);
|
|
882
|
+
}
|
|
883
|
+
function qt(e, t) {
|
|
884
|
+
return te(v.make(() => {
|
|
885
|
+
let n = i.get(x), r = ee(e, n.pathname);
|
|
638
886
|
return typeof r != "object" ? [] : [t(r._0)];
|
|
639
887
|
}));
|
|
640
888
|
}
|
|
641
|
-
function
|
|
642
|
-
return
|
|
643
|
-
let t =
|
|
644
|
-
let
|
|
645
|
-
if (typeof
|
|
646
|
-
return r.render(
|
|
889
|
+
function Ht(e) {
|
|
890
|
+
return te(v.make(() => {
|
|
891
|
+
let t = i.get(x), n = je(e, (r) => {
|
|
892
|
+
let l = ee(r.pattern, t.pathname);
|
|
893
|
+
if (typeof l == "object")
|
|
894
|
+
return r.render(l._0);
|
|
647
895
|
});
|
|
648
896
|
return n !== void 0 ? [n] : [];
|
|
649
897
|
}));
|
|
650
898
|
}
|
|
651
|
-
function
|
|
652
|
-
let
|
|
653
|
-
|
|
899
|
+
function Ut(e, t, n, r) {
|
|
900
|
+
let l = t !== void 0 ? t : [], o = n !== void 0 ? n : [], u = (c) => {
|
|
901
|
+
c.preventDefault(), ke(e, void 0, void 0);
|
|
654
902
|
};
|
|
655
|
-
return
|
|
903
|
+
return ye(l.concat([we("href", e)]), [[
|
|
656
904
|
"click",
|
|
657
|
-
|
|
658
|
-
]],
|
|
905
|
+
u
|
|
906
|
+
]], o);
|
|
659
907
|
}
|
|
660
|
-
let
|
|
661
|
-
const
|
|
908
|
+
let Jt, Qt;
|
|
909
|
+
const Yt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
|
|
662
910
|
__proto__: null,
|
|
663
|
-
Component:
|
|
664
|
-
Route:
|
|
665
|
-
getCurrentLocation:
|
|
666
|
-
init:
|
|
667
|
-
link:
|
|
668
|
-
location:
|
|
669
|
-
push:
|
|
670
|
-
replace:
|
|
671
|
-
route:
|
|
672
|
-
routes:
|
|
911
|
+
Component: Jt,
|
|
912
|
+
Route: Qt,
|
|
913
|
+
getCurrentLocation: Q,
|
|
914
|
+
init: Kt,
|
|
915
|
+
link: Ut,
|
|
916
|
+
location: x,
|
|
917
|
+
push: ke,
|
|
918
|
+
replace: Xt,
|
|
919
|
+
route: qt,
|
|
920
|
+
routes: Ht
|
|
673
921
|
}, Symbol.toStringTag, { value: "Module" }));
|
|
674
|
-
let
|
|
675
|
-
Id:
|
|
676
|
-
Scheduler:
|
|
677
|
-
make:
|
|
678
|
-
get:
|
|
679
|
-
peek:
|
|
680
|
-
set:
|
|
681
|
-
update:
|
|
682
|
-
batch:
|
|
683
|
-
untrack:
|
|
684
|
-
},
|
|
685
|
-
Id:
|
|
686
|
-
Signal:
|
|
687
|
-
Observer:
|
|
688
|
-
Scheduler:
|
|
689
|
-
make:
|
|
690
|
-
dispose:
|
|
691
|
-
},
|
|
692
|
-
Id:
|
|
693
|
-
Observer:
|
|
694
|
-
Scheduler:
|
|
695
|
-
run:
|
|
696
|
-
},
|
|
922
|
+
let Zt = i.Id, en = i.Scheduler, tn = i.make, nn = i.get, rn = i.peek, ln = i.set, un = i.update, on = i.batch, sn = i.untrack, En = {
|
|
923
|
+
Id: Zt,
|
|
924
|
+
Scheduler: en,
|
|
925
|
+
make: tn,
|
|
926
|
+
get: nn,
|
|
927
|
+
peek: rn,
|
|
928
|
+
set: ln,
|
|
929
|
+
update: un,
|
|
930
|
+
batch: on,
|
|
931
|
+
untrack: sn
|
|
932
|
+
}, cn = v.Id, an = v.Signal, dn = v.Observer, fn = v.Scheduler, pn = v.make, mn = v.dispose, wn = {
|
|
933
|
+
Id: cn,
|
|
934
|
+
Signal: an,
|
|
935
|
+
Observer: dn,
|
|
936
|
+
Scheduler: fn,
|
|
937
|
+
make: pn,
|
|
938
|
+
dispose: mn
|
|
939
|
+
}, hn = w.Id, _n = w.Observer, gn = w.Scheduler, Sn = w.run, yn = {
|
|
940
|
+
Id: hn,
|
|
941
|
+
Observer: _n,
|
|
942
|
+
Scheduler: gn,
|
|
943
|
+
run: Sn
|
|
944
|
+
}, bn = Wt, kn = St, Tn = Yt;
|
|
697
945
|
export {
|
|
698
|
-
|
|
699
|
-
|
|
700
|
-
|
|
701
|
-
|
|
702
|
-
|
|
703
|
-
|
|
946
|
+
bn as Component,
|
|
947
|
+
wn as Computed,
|
|
948
|
+
yn as Effect,
|
|
949
|
+
kn as Route,
|
|
950
|
+
Tn as Router,
|
|
951
|
+
En as Signal
|
|
704
952
|
};
|