@tanstack/query-devtools 5.0.0-alpha.84 → 5.0.0-alpha.87
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/build/Devtools/OYHFZDAP.jsx +6711 -0
- package/build/Devtools/QBS7PB6D.js +5885 -0
- package/build/Devtools/QPWQM7BG.js +6068 -0
- package/build/Devtools/RZF5MSB2.jsx +6637 -0
- package/build/chunk/DFC6JMPR.jsx +1280 -0
- package/build/chunk/LOJK4LQB.jsx +1280 -0
- package/{dist/esm/index-7c6d68e3.js → build/chunk/MZOCHHZD.js} +648 -416
- package/{dist/cjs/index-edbb2275.cjs → build/chunk/YHTPXJWR.js} +648 -446
- package/build/dev.cjs +8116 -0
- package/build/dev.js +99 -0
- package/build/dev.jsx +98 -0
- package/build/index.cjs +7940 -0
- package/build/index.d.cts +55 -0
- package/build/index.d.ts +55 -0
- package/build/index.js +99 -0
- package/build/index.jsx +98 -0
- package/package.json +24 -18
- package/src/Devtools.tsx +1 -3
- package/dist/cjs/Devtools-0f2840bd.cjs +0 -6766
- package/dist/cjs/Devtools-0f2840bd.cjs.map +0 -1
- package/dist/cjs/index-edbb2275.cjs.map +0 -1
- package/dist/cjs/index.cjs +0 -8
- package/dist/cjs/index.cjs.map +0 -1
- package/dist/esm/Devtools-26de9f2c.js +0 -6758
- package/dist/esm/Devtools-26de9f2c.js.map +0 -1
- package/dist/esm/index-7c6d68e3.js.map +0 -1
- package/dist/esm/index.js +0 -2
- package/dist/esm/index.js.map +0 -1
- package/dist/source/Context.js +0 -10
- package/dist/source/Devtools.jsx +0 -1512
- package/dist/source/Explorer.jsx +0 -264
- package/dist/source/fonts.js +0 -7
- package/dist/source/icons/index.jsx +0 -344
- package/dist/source/index.jsx +0 -88
- package/dist/source/theme.js +0 -304
- package/dist/source/utils.jsx +0 -77
- package/dist/types/Context.d.ts +0 -28
- package/dist/types/Devtools.d.ts +0 -22
- package/dist/types/Explorer.d.ts +0 -21
- package/dist/types/fonts.d.ts +0 -1
- package/dist/types/icons/index.d.ts +0 -11
- package/dist/types/index.d.ts +0 -29
- package/dist/types/theme.d.ts +0 -296
- package/dist/types/utils.d.ts +0 -23
|
@@ -0,0 +1,1280 @@
|
|
|
1
|
+
// ../../node_modules/.pnpm/solid-js@1.6.13/node_modules/solid-js/dist/solid.js
|
|
2
|
+
var sharedConfig = {};
|
|
3
|
+
function setHydrateContext(context) {
|
|
4
|
+
sharedConfig.context = context;
|
|
5
|
+
}
|
|
6
|
+
var equalFn = (a, b) => a === b;
|
|
7
|
+
var $PROXY = Symbol("solid-proxy");
|
|
8
|
+
var $TRACK = Symbol("solid-track");
|
|
9
|
+
var $DEVCOMP = Symbol("solid-dev-component");
|
|
10
|
+
var signalOptions = {
|
|
11
|
+
equals: equalFn
|
|
12
|
+
};
|
|
13
|
+
var ERROR = null;
|
|
14
|
+
var runEffects = runQueue;
|
|
15
|
+
var STALE = 1;
|
|
16
|
+
var PENDING = 2;
|
|
17
|
+
var UNOWNED = {
|
|
18
|
+
owned: null,
|
|
19
|
+
cleanups: null,
|
|
20
|
+
context: null,
|
|
21
|
+
owner: null
|
|
22
|
+
};
|
|
23
|
+
var NO_INIT = {};
|
|
24
|
+
var Owner = null;
|
|
25
|
+
var Transition = null;
|
|
26
|
+
var Scheduler = null;
|
|
27
|
+
var ExternalSourceFactory = null;
|
|
28
|
+
var Listener = null;
|
|
29
|
+
var Updates = null;
|
|
30
|
+
var Effects = null;
|
|
31
|
+
var ExecCount = 0;
|
|
32
|
+
var [transPending, setTransPending] = /* @__PURE__ */ createSignal(false);
|
|
33
|
+
function createRoot(fn, detachedOwner) {
|
|
34
|
+
const listener = Listener, owner = Owner, unowned = fn.length === 0, root = unowned ? UNOWNED : {
|
|
35
|
+
owned: null,
|
|
36
|
+
cleanups: null,
|
|
37
|
+
context: null,
|
|
38
|
+
owner: detachedOwner === void 0 ? owner : detachedOwner
|
|
39
|
+
}, updateFn = unowned ? fn : () => fn(() => untrack(() => cleanNode(root)));
|
|
40
|
+
Owner = root;
|
|
41
|
+
Listener = null;
|
|
42
|
+
try {
|
|
43
|
+
return runUpdates(updateFn, true);
|
|
44
|
+
} finally {
|
|
45
|
+
Listener = listener;
|
|
46
|
+
Owner = owner;
|
|
47
|
+
}
|
|
48
|
+
}
|
|
49
|
+
function createSignal(value, options) {
|
|
50
|
+
options = options ? Object.assign({}, signalOptions, options) : signalOptions;
|
|
51
|
+
const s = {
|
|
52
|
+
value,
|
|
53
|
+
observers: null,
|
|
54
|
+
observerSlots: null,
|
|
55
|
+
comparator: options.equals || void 0
|
|
56
|
+
};
|
|
57
|
+
const setter = (value2) => {
|
|
58
|
+
if (typeof value2 === "function") {
|
|
59
|
+
if (Transition && Transition.running && Transition.sources.has(s))
|
|
60
|
+
value2 = value2(s.tValue);
|
|
61
|
+
else
|
|
62
|
+
value2 = value2(s.value);
|
|
63
|
+
}
|
|
64
|
+
return writeSignal(s, value2);
|
|
65
|
+
};
|
|
66
|
+
return [readSignal.bind(s), setter];
|
|
67
|
+
}
|
|
68
|
+
function createComputed(fn, value, options) {
|
|
69
|
+
const c = createComputation(fn, value, true, STALE);
|
|
70
|
+
if (Scheduler && Transition && Transition.running)
|
|
71
|
+
Updates.push(c);
|
|
72
|
+
else
|
|
73
|
+
updateComputation(c);
|
|
74
|
+
}
|
|
75
|
+
function createRenderEffect(fn, value, options) {
|
|
76
|
+
const c = createComputation(fn, value, false, STALE);
|
|
77
|
+
if (Scheduler && Transition && Transition.running)
|
|
78
|
+
Updates.push(c);
|
|
79
|
+
else
|
|
80
|
+
updateComputation(c);
|
|
81
|
+
}
|
|
82
|
+
function createEffect(fn, value, options) {
|
|
83
|
+
runEffects = runUserEffects;
|
|
84
|
+
const c = createComputation(fn, value, false, STALE), s = SuspenseContext && lookup(Owner, SuspenseContext.id);
|
|
85
|
+
if (s)
|
|
86
|
+
c.suspense = s;
|
|
87
|
+
c.user = true;
|
|
88
|
+
Effects ? Effects.push(c) : updateComputation(c);
|
|
89
|
+
}
|
|
90
|
+
function createMemo(fn, value, options) {
|
|
91
|
+
options = options ? Object.assign({}, signalOptions, options) : signalOptions;
|
|
92
|
+
const c = createComputation(fn, value, true, 0);
|
|
93
|
+
c.observers = null;
|
|
94
|
+
c.observerSlots = null;
|
|
95
|
+
c.comparator = options.equals || void 0;
|
|
96
|
+
if (Scheduler && Transition && Transition.running) {
|
|
97
|
+
c.tState = STALE;
|
|
98
|
+
Updates.push(c);
|
|
99
|
+
} else
|
|
100
|
+
updateComputation(c);
|
|
101
|
+
return readSignal.bind(c);
|
|
102
|
+
}
|
|
103
|
+
function createResource(pSource, pFetcher, pOptions) {
|
|
104
|
+
let source;
|
|
105
|
+
let fetcher;
|
|
106
|
+
let options;
|
|
107
|
+
if (arguments.length === 2 && typeof pFetcher === "object" || arguments.length === 1) {
|
|
108
|
+
source = true;
|
|
109
|
+
fetcher = pSource;
|
|
110
|
+
options = pFetcher || {};
|
|
111
|
+
} else {
|
|
112
|
+
source = pSource;
|
|
113
|
+
fetcher = pFetcher;
|
|
114
|
+
options = pOptions || {};
|
|
115
|
+
}
|
|
116
|
+
let pr = null, initP = NO_INIT, id = null, loadedUnderTransition = false, scheduled = false, resolved = "initialValue" in options, dynamic = typeof source === "function" && createMemo(source);
|
|
117
|
+
const contexts = /* @__PURE__ */ new Set(), [value, setValue] = (options.storage || createSignal)(options.initialValue), [error, setError] = createSignal(void 0), [track, trigger] = createSignal(void 0, {
|
|
118
|
+
equals: false
|
|
119
|
+
}), [state, setState] = createSignal(resolved ? "ready" : "unresolved");
|
|
120
|
+
if (sharedConfig.context) {
|
|
121
|
+
id = `${sharedConfig.context.id}${sharedConfig.context.count++}`;
|
|
122
|
+
let v;
|
|
123
|
+
if (options.ssrLoadFrom === "initial")
|
|
124
|
+
initP = options.initialValue;
|
|
125
|
+
else if (sharedConfig.load && (v = sharedConfig.load(id)))
|
|
126
|
+
initP = v[0];
|
|
127
|
+
}
|
|
128
|
+
function loadEnd(p, v, error2, key) {
|
|
129
|
+
if (pr === p) {
|
|
130
|
+
pr = null;
|
|
131
|
+
resolved = true;
|
|
132
|
+
if ((p === initP || v === initP) && options.onHydrated)
|
|
133
|
+
queueMicrotask(() => options.onHydrated(key, {
|
|
134
|
+
value: v
|
|
135
|
+
}));
|
|
136
|
+
initP = NO_INIT;
|
|
137
|
+
if (Transition && p && loadedUnderTransition) {
|
|
138
|
+
Transition.promises.delete(p);
|
|
139
|
+
loadedUnderTransition = false;
|
|
140
|
+
runUpdates(() => {
|
|
141
|
+
Transition.running = true;
|
|
142
|
+
completeLoad(v, error2);
|
|
143
|
+
}, false);
|
|
144
|
+
} else
|
|
145
|
+
completeLoad(v, error2);
|
|
146
|
+
}
|
|
147
|
+
return v;
|
|
148
|
+
}
|
|
149
|
+
function completeLoad(v, err) {
|
|
150
|
+
runUpdates(() => {
|
|
151
|
+
if (err === void 0)
|
|
152
|
+
setValue(() => v);
|
|
153
|
+
setState(err !== void 0 ? "errored" : "ready");
|
|
154
|
+
setError(err);
|
|
155
|
+
for (const c of contexts.keys())
|
|
156
|
+
c.decrement();
|
|
157
|
+
contexts.clear();
|
|
158
|
+
}, false);
|
|
159
|
+
}
|
|
160
|
+
function read() {
|
|
161
|
+
const c = SuspenseContext && lookup(Owner, SuspenseContext.id), v = value(), err = error();
|
|
162
|
+
if (err !== void 0 && !pr)
|
|
163
|
+
throw err;
|
|
164
|
+
if (Listener && !Listener.user && c) {
|
|
165
|
+
createComputed(() => {
|
|
166
|
+
track();
|
|
167
|
+
if (pr) {
|
|
168
|
+
if (c.resolved && Transition && loadedUnderTransition)
|
|
169
|
+
Transition.promises.add(pr);
|
|
170
|
+
else if (!contexts.has(c)) {
|
|
171
|
+
c.increment();
|
|
172
|
+
contexts.add(c);
|
|
173
|
+
}
|
|
174
|
+
}
|
|
175
|
+
});
|
|
176
|
+
}
|
|
177
|
+
return v;
|
|
178
|
+
}
|
|
179
|
+
function load(refetching = true) {
|
|
180
|
+
if (refetching !== false && scheduled)
|
|
181
|
+
return;
|
|
182
|
+
scheduled = false;
|
|
183
|
+
const lookup2 = dynamic ? dynamic() : source;
|
|
184
|
+
loadedUnderTransition = Transition && Transition.running;
|
|
185
|
+
if (lookup2 == null || lookup2 === false) {
|
|
186
|
+
loadEnd(pr, untrack(value));
|
|
187
|
+
return;
|
|
188
|
+
}
|
|
189
|
+
if (Transition && pr)
|
|
190
|
+
Transition.promises.delete(pr);
|
|
191
|
+
const p = initP !== NO_INIT ? initP : untrack(() => fetcher(lookup2, {
|
|
192
|
+
value: value(),
|
|
193
|
+
refetching
|
|
194
|
+
}));
|
|
195
|
+
if (typeof p !== "object" || !(p && "then" in p)) {
|
|
196
|
+
loadEnd(pr, p, void 0, lookup2);
|
|
197
|
+
return p;
|
|
198
|
+
}
|
|
199
|
+
pr = p;
|
|
200
|
+
scheduled = true;
|
|
201
|
+
queueMicrotask(() => scheduled = false);
|
|
202
|
+
runUpdates(() => {
|
|
203
|
+
setState(resolved ? "refreshing" : "pending");
|
|
204
|
+
trigger();
|
|
205
|
+
}, false);
|
|
206
|
+
return p.then((v) => loadEnd(p, v, void 0, lookup2), (e) => loadEnd(p, void 0, castError(e), lookup2));
|
|
207
|
+
}
|
|
208
|
+
Object.defineProperties(read, {
|
|
209
|
+
state: {
|
|
210
|
+
get: () => state()
|
|
211
|
+
},
|
|
212
|
+
error: {
|
|
213
|
+
get: () => error()
|
|
214
|
+
},
|
|
215
|
+
loading: {
|
|
216
|
+
get() {
|
|
217
|
+
const s = state();
|
|
218
|
+
return s === "pending" || s === "refreshing";
|
|
219
|
+
}
|
|
220
|
+
},
|
|
221
|
+
latest: {
|
|
222
|
+
get() {
|
|
223
|
+
if (!resolved)
|
|
224
|
+
return read();
|
|
225
|
+
const err = error();
|
|
226
|
+
if (err && !pr)
|
|
227
|
+
throw err;
|
|
228
|
+
return value();
|
|
229
|
+
}
|
|
230
|
+
}
|
|
231
|
+
});
|
|
232
|
+
if (dynamic)
|
|
233
|
+
createComputed(() => load(false));
|
|
234
|
+
else
|
|
235
|
+
load(false);
|
|
236
|
+
return [read, {
|
|
237
|
+
refetch: load,
|
|
238
|
+
mutate: setValue
|
|
239
|
+
}];
|
|
240
|
+
}
|
|
241
|
+
function untrack(fn) {
|
|
242
|
+
if (Listener === null)
|
|
243
|
+
return fn();
|
|
244
|
+
const listener = Listener;
|
|
245
|
+
Listener = null;
|
|
246
|
+
try {
|
|
247
|
+
return fn();
|
|
248
|
+
} finally {
|
|
249
|
+
Listener = listener;
|
|
250
|
+
}
|
|
251
|
+
}
|
|
252
|
+
function on(deps, fn, options) {
|
|
253
|
+
const isArray = Array.isArray(deps);
|
|
254
|
+
let prevInput;
|
|
255
|
+
let defer = options && options.defer;
|
|
256
|
+
return (prevValue) => {
|
|
257
|
+
let input;
|
|
258
|
+
if (isArray) {
|
|
259
|
+
input = Array(deps.length);
|
|
260
|
+
for (let i = 0; i < deps.length; i++)
|
|
261
|
+
input[i] = deps[i]();
|
|
262
|
+
} else
|
|
263
|
+
input = deps();
|
|
264
|
+
if (defer) {
|
|
265
|
+
defer = false;
|
|
266
|
+
return void 0;
|
|
267
|
+
}
|
|
268
|
+
const result = untrack(() => fn(input, prevInput, prevValue));
|
|
269
|
+
prevInput = input;
|
|
270
|
+
return result;
|
|
271
|
+
};
|
|
272
|
+
}
|
|
273
|
+
function onMount(fn) {
|
|
274
|
+
createEffect(() => untrack(fn));
|
|
275
|
+
}
|
|
276
|
+
function onCleanup(fn) {
|
|
277
|
+
if (Owner === null)
|
|
278
|
+
;
|
|
279
|
+
else if (Owner.cleanups === null)
|
|
280
|
+
Owner.cleanups = [fn];
|
|
281
|
+
else
|
|
282
|
+
Owner.cleanups.push(fn);
|
|
283
|
+
return fn;
|
|
284
|
+
}
|
|
285
|
+
function startTransition(fn) {
|
|
286
|
+
if (Transition && Transition.running) {
|
|
287
|
+
fn();
|
|
288
|
+
return Transition.done;
|
|
289
|
+
}
|
|
290
|
+
const l = Listener;
|
|
291
|
+
const o = Owner;
|
|
292
|
+
return Promise.resolve().then(() => {
|
|
293
|
+
Listener = l;
|
|
294
|
+
Owner = o;
|
|
295
|
+
let t;
|
|
296
|
+
if (Scheduler || SuspenseContext) {
|
|
297
|
+
t = Transition || (Transition = {
|
|
298
|
+
sources: /* @__PURE__ */ new Set(),
|
|
299
|
+
effects: [],
|
|
300
|
+
promises: /* @__PURE__ */ new Set(),
|
|
301
|
+
disposed: /* @__PURE__ */ new Set(),
|
|
302
|
+
queue: /* @__PURE__ */ new Set(),
|
|
303
|
+
running: true
|
|
304
|
+
});
|
|
305
|
+
t.done || (t.done = new Promise((res) => t.resolve = res));
|
|
306
|
+
t.running = true;
|
|
307
|
+
}
|
|
308
|
+
runUpdates(fn, false);
|
|
309
|
+
Listener = Owner = null;
|
|
310
|
+
return t ? t.done : void 0;
|
|
311
|
+
});
|
|
312
|
+
}
|
|
313
|
+
function useTransition() {
|
|
314
|
+
return [transPending, startTransition];
|
|
315
|
+
}
|
|
316
|
+
function createContext(defaultValue, options) {
|
|
317
|
+
const id = Symbol("context");
|
|
318
|
+
return {
|
|
319
|
+
id,
|
|
320
|
+
Provider: createProvider(id),
|
|
321
|
+
defaultValue
|
|
322
|
+
};
|
|
323
|
+
}
|
|
324
|
+
function useContext(context) {
|
|
325
|
+
let ctx;
|
|
326
|
+
return (ctx = lookup(Owner, context.id)) !== void 0 ? ctx : context.defaultValue;
|
|
327
|
+
}
|
|
328
|
+
function children(fn) {
|
|
329
|
+
const children2 = createMemo(fn);
|
|
330
|
+
const memo = createMemo(() => resolveChildren(children2()));
|
|
331
|
+
memo.toArray = () => {
|
|
332
|
+
const c = memo();
|
|
333
|
+
return Array.isArray(c) ? c : c != null ? [c] : [];
|
|
334
|
+
};
|
|
335
|
+
return memo;
|
|
336
|
+
}
|
|
337
|
+
var SuspenseContext;
|
|
338
|
+
function readSignal() {
|
|
339
|
+
const runningTransition = Transition && Transition.running;
|
|
340
|
+
if (this.sources && (!runningTransition && this.state || runningTransition && this.tState)) {
|
|
341
|
+
if (!runningTransition && this.state === STALE || runningTransition && this.tState === STALE)
|
|
342
|
+
updateComputation(this);
|
|
343
|
+
else {
|
|
344
|
+
const updates = Updates;
|
|
345
|
+
Updates = null;
|
|
346
|
+
runUpdates(() => lookUpstream(this), false);
|
|
347
|
+
Updates = updates;
|
|
348
|
+
}
|
|
349
|
+
}
|
|
350
|
+
if (Listener) {
|
|
351
|
+
const sSlot = this.observers ? this.observers.length : 0;
|
|
352
|
+
if (!Listener.sources) {
|
|
353
|
+
Listener.sources = [this];
|
|
354
|
+
Listener.sourceSlots = [sSlot];
|
|
355
|
+
} else {
|
|
356
|
+
Listener.sources.push(this);
|
|
357
|
+
Listener.sourceSlots.push(sSlot);
|
|
358
|
+
}
|
|
359
|
+
if (!this.observers) {
|
|
360
|
+
this.observers = [Listener];
|
|
361
|
+
this.observerSlots = [Listener.sources.length - 1];
|
|
362
|
+
} else {
|
|
363
|
+
this.observers.push(Listener);
|
|
364
|
+
this.observerSlots.push(Listener.sources.length - 1);
|
|
365
|
+
}
|
|
366
|
+
}
|
|
367
|
+
if (runningTransition && Transition.sources.has(this))
|
|
368
|
+
return this.tValue;
|
|
369
|
+
return this.value;
|
|
370
|
+
}
|
|
371
|
+
function writeSignal(node, value, isComp) {
|
|
372
|
+
let current = Transition && Transition.running && Transition.sources.has(node) ? node.tValue : node.value;
|
|
373
|
+
if (!node.comparator || !node.comparator(current, value)) {
|
|
374
|
+
if (Transition) {
|
|
375
|
+
const TransitionRunning = Transition.running;
|
|
376
|
+
if (TransitionRunning || !isComp && Transition.sources.has(node)) {
|
|
377
|
+
Transition.sources.add(node);
|
|
378
|
+
node.tValue = value;
|
|
379
|
+
}
|
|
380
|
+
if (!TransitionRunning)
|
|
381
|
+
node.value = value;
|
|
382
|
+
} else
|
|
383
|
+
node.value = value;
|
|
384
|
+
if (node.observers && node.observers.length) {
|
|
385
|
+
runUpdates(() => {
|
|
386
|
+
for (let i = 0; i < node.observers.length; i += 1) {
|
|
387
|
+
const o = node.observers[i];
|
|
388
|
+
const TransitionRunning = Transition && Transition.running;
|
|
389
|
+
if (TransitionRunning && Transition.disposed.has(o))
|
|
390
|
+
continue;
|
|
391
|
+
if (TransitionRunning && !o.tState || !TransitionRunning && !o.state) {
|
|
392
|
+
if (o.pure)
|
|
393
|
+
Updates.push(o);
|
|
394
|
+
else
|
|
395
|
+
Effects.push(o);
|
|
396
|
+
if (o.observers)
|
|
397
|
+
markDownstream(o);
|
|
398
|
+
}
|
|
399
|
+
if (TransitionRunning)
|
|
400
|
+
o.tState = STALE;
|
|
401
|
+
else
|
|
402
|
+
o.state = STALE;
|
|
403
|
+
}
|
|
404
|
+
if (Updates.length > 1e6) {
|
|
405
|
+
Updates = [];
|
|
406
|
+
if (false)
|
|
407
|
+
;
|
|
408
|
+
throw new Error();
|
|
409
|
+
}
|
|
410
|
+
}, false);
|
|
411
|
+
}
|
|
412
|
+
}
|
|
413
|
+
return value;
|
|
414
|
+
}
|
|
415
|
+
function updateComputation(node) {
|
|
416
|
+
if (!node.fn)
|
|
417
|
+
return;
|
|
418
|
+
cleanNode(node);
|
|
419
|
+
const owner = Owner, listener = Listener, time = ExecCount;
|
|
420
|
+
Listener = Owner = node;
|
|
421
|
+
runComputation(node, Transition && Transition.running && Transition.sources.has(node) ? node.tValue : node.value, time);
|
|
422
|
+
if (Transition && !Transition.running && Transition.sources.has(node)) {
|
|
423
|
+
queueMicrotask(() => {
|
|
424
|
+
runUpdates(() => {
|
|
425
|
+
Transition && (Transition.running = true);
|
|
426
|
+
Listener = Owner = node;
|
|
427
|
+
runComputation(node, node.tValue, time);
|
|
428
|
+
Listener = Owner = null;
|
|
429
|
+
}, false);
|
|
430
|
+
});
|
|
431
|
+
}
|
|
432
|
+
Listener = listener;
|
|
433
|
+
Owner = owner;
|
|
434
|
+
}
|
|
435
|
+
function runComputation(node, value, time) {
|
|
436
|
+
let nextValue;
|
|
437
|
+
try {
|
|
438
|
+
nextValue = node.fn(value);
|
|
439
|
+
} catch (err) {
|
|
440
|
+
if (node.pure) {
|
|
441
|
+
if (Transition && Transition.running) {
|
|
442
|
+
node.tState = STALE;
|
|
443
|
+
node.tOwned && node.tOwned.forEach(cleanNode);
|
|
444
|
+
node.tOwned = void 0;
|
|
445
|
+
} else {
|
|
446
|
+
node.state = STALE;
|
|
447
|
+
node.owned && node.owned.forEach(cleanNode);
|
|
448
|
+
node.owned = null;
|
|
449
|
+
}
|
|
450
|
+
}
|
|
451
|
+
node.updatedAt = time + 1;
|
|
452
|
+
return handleError(err);
|
|
453
|
+
}
|
|
454
|
+
if (!node.updatedAt || node.updatedAt <= time) {
|
|
455
|
+
if (node.updatedAt != null && "observers" in node) {
|
|
456
|
+
writeSignal(node, nextValue, true);
|
|
457
|
+
} else if (Transition && Transition.running && node.pure) {
|
|
458
|
+
Transition.sources.add(node);
|
|
459
|
+
node.tValue = nextValue;
|
|
460
|
+
} else
|
|
461
|
+
node.value = nextValue;
|
|
462
|
+
node.updatedAt = time;
|
|
463
|
+
}
|
|
464
|
+
}
|
|
465
|
+
function createComputation(fn, init, pure, state = STALE, options) {
|
|
466
|
+
const c = {
|
|
467
|
+
fn,
|
|
468
|
+
state,
|
|
469
|
+
updatedAt: null,
|
|
470
|
+
owned: null,
|
|
471
|
+
sources: null,
|
|
472
|
+
sourceSlots: null,
|
|
473
|
+
cleanups: null,
|
|
474
|
+
value: init,
|
|
475
|
+
owner: Owner,
|
|
476
|
+
context: null,
|
|
477
|
+
pure
|
|
478
|
+
};
|
|
479
|
+
if (Transition && Transition.running) {
|
|
480
|
+
c.state = 0;
|
|
481
|
+
c.tState = state;
|
|
482
|
+
}
|
|
483
|
+
if (Owner === null)
|
|
484
|
+
;
|
|
485
|
+
else if (Owner !== UNOWNED) {
|
|
486
|
+
if (Transition && Transition.running && Owner.pure) {
|
|
487
|
+
if (!Owner.tOwned)
|
|
488
|
+
Owner.tOwned = [c];
|
|
489
|
+
else
|
|
490
|
+
Owner.tOwned.push(c);
|
|
491
|
+
} else {
|
|
492
|
+
if (!Owner.owned)
|
|
493
|
+
Owner.owned = [c];
|
|
494
|
+
else
|
|
495
|
+
Owner.owned.push(c);
|
|
496
|
+
}
|
|
497
|
+
}
|
|
498
|
+
if (ExternalSourceFactory) {
|
|
499
|
+
const [track, trigger] = createSignal(void 0, {
|
|
500
|
+
equals: false
|
|
501
|
+
});
|
|
502
|
+
const ordinary = ExternalSourceFactory(c.fn, trigger);
|
|
503
|
+
onCleanup(() => ordinary.dispose());
|
|
504
|
+
const triggerInTransition = () => startTransition(trigger).then(() => inTransition.dispose());
|
|
505
|
+
const inTransition = ExternalSourceFactory(c.fn, triggerInTransition);
|
|
506
|
+
c.fn = (x) => {
|
|
507
|
+
track();
|
|
508
|
+
return Transition && Transition.running ? inTransition.track(x) : ordinary.track(x);
|
|
509
|
+
};
|
|
510
|
+
}
|
|
511
|
+
return c;
|
|
512
|
+
}
|
|
513
|
+
function runTop(node) {
|
|
514
|
+
const runningTransition = Transition && Transition.running;
|
|
515
|
+
if (!runningTransition && node.state === 0 || runningTransition && node.tState === 0)
|
|
516
|
+
return;
|
|
517
|
+
if (!runningTransition && node.state === PENDING || runningTransition && node.tState === PENDING)
|
|
518
|
+
return lookUpstream(node);
|
|
519
|
+
if (node.suspense && untrack(node.suspense.inFallback))
|
|
520
|
+
return node.suspense.effects.push(node);
|
|
521
|
+
const ancestors = [node];
|
|
522
|
+
while ((node = node.owner) && (!node.updatedAt || node.updatedAt < ExecCount)) {
|
|
523
|
+
if (runningTransition && Transition.disposed.has(node))
|
|
524
|
+
return;
|
|
525
|
+
if (!runningTransition && node.state || runningTransition && node.tState)
|
|
526
|
+
ancestors.push(node);
|
|
527
|
+
}
|
|
528
|
+
for (let i = ancestors.length - 1; i >= 0; i--) {
|
|
529
|
+
node = ancestors[i];
|
|
530
|
+
if (runningTransition) {
|
|
531
|
+
let top = node, prev = ancestors[i + 1];
|
|
532
|
+
while ((top = top.owner) && top !== prev) {
|
|
533
|
+
if (Transition.disposed.has(top))
|
|
534
|
+
return;
|
|
535
|
+
}
|
|
536
|
+
}
|
|
537
|
+
if (!runningTransition && node.state === STALE || runningTransition && node.tState === STALE) {
|
|
538
|
+
updateComputation(node);
|
|
539
|
+
} else if (!runningTransition && node.state === PENDING || runningTransition && node.tState === PENDING) {
|
|
540
|
+
const updates = Updates;
|
|
541
|
+
Updates = null;
|
|
542
|
+
runUpdates(() => lookUpstream(node, ancestors[0]), false);
|
|
543
|
+
Updates = updates;
|
|
544
|
+
}
|
|
545
|
+
}
|
|
546
|
+
}
|
|
547
|
+
function runUpdates(fn, init) {
|
|
548
|
+
if (Updates)
|
|
549
|
+
return fn();
|
|
550
|
+
let wait = false;
|
|
551
|
+
if (!init)
|
|
552
|
+
Updates = [];
|
|
553
|
+
if (Effects)
|
|
554
|
+
wait = true;
|
|
555
|
+
else
|
|
556
|
+
Effects = [];
|
|
557
|
+
ExecCount++;
|
|
558
|
+
try {
|
|
559
|
+
const res = fn();
|
|
560
|
+
completeUpdates(wait);
|
|
561
|
+
return res;
|
|
562
|
+
} catch (err) {
|
|
563
|
+
if (!wait)
|
|
564
|
+
Effects = null;
|
|
565
|
+
Updates = null;
|
|
566
|
+
handleError(err);
|
|
567
|
+
}
|
|
568
|
+
}
|
|
569
|
+
function completeUpdates(wait) {
|
|
570
|
+
if (Updates) {
|
|
571
|
+
if (Scheduler && Transition && Transition.running)
|
|
572
|
+
scheduleQueue(Updates);
|
|
573
|
+
else
|
|
574
|
+
runQueue(Updates);
|
|
575
|
+
Updates = null;
|
|
576
|
+
}
|
|
577
|
+
if (wait)
|
|
578
|
+
return;
|
|
579
|
+
let res;
|
|
580
|
+
if (Transition) {
|
|
581
|
+
if (!Transition.promises.size && !Transition.queue.size) {
|
|
582
|
+
const sources = Transition.sources;
|
|
583
|
+
const disposed = Transition.disposed;
|
|
584
|
+
Effects.push.apply(Effects, Transition.effects);
|
|
585
|
+
res = Transition.resolve;
|
|
586
|
+
for (const e2 of Effects) {
|
|
587
|
+
"tState" in e2 && (e2.state = e2.tState);
|
|
588
|
+
delete e2.tState;
|
|
589
|
+
}
|
|
590
|
+
Transition = null;
|
|
591
|
+
runUpdates(() => {
|
|
592
|
+
for (const d of disposed)
|
|
593
|
+
cleanNode(d);
|
|
594
|
+
for (const v of sources) {
|
|
595
|
+
v.value = v.tValue;
|
|
596
|
+
if (v.owned) {
|
|
597
|
+
for (let i = 0, len = v.owned.length; i < len; i++)
|
|
598
|
+
cleanNode(v.owned[i]);
|
|
599
|
+
}
|
|
600
|
+
if (v.tOwned)
|
|
601
|
+
v.owned = v.tOwned;
|
|
602
|
+
delete v.tValue;
|
|
603
|
+
delete v.tOwned;
|
|
604
|
+
v.tState = 0;
|
|
605
|
+
}
|
|
606
|
+
setTransPending(false);
|
|
607
|
+
}, false);
|
|
608
|
+
} else if (Transition.running) {
|
|
609
|
+
Transition.running = false;
|
|
610
|
+
Transition.effects.push.apply(Transition.effects, Effects);
|
|
611
|
+
Effects = null;
|
|
612
|
+
setTransPending(true);
|
|
613
|
+
return;
|
|
614
|
+
}
|
|
615
|
+
}
|
|
616
|
+
const e = Effects;
|
|
617
|
+
Effects = null;
|
|
618
|
+
if (e.length)
|
|
619
|
+
runUpdates(() => runEffects(e), false);
|
|
620
|
+
if (res)
|
|
621
|
+
res();
|
|
622
|
+
}
|
|
623
|
+
function runQueue(queue) {
|
|
624
|
+
for (let i = 0; i < queue.length; i++)
|
|
625
|
+
runTop(queue[i]);
|
|
626
|
+
}
|
|
627
|
+
function scheduleQueue(queue) {
|
|
628
|
+
for (let i = 0; i < queue.length; i++) {
|
|
629
|
+
const item = queue[i];
|
|
630
|
+
const tasks = Transition.queue;
|
|
631
|
+
if (!tasks.has(item)) {
|
|
632
|
+
tasks.add(item);
|
|
633
|
+
Scheduler(() => {
|
|
634
|
+
tasks.delete(item);
|
|
635
|
+
runUpdates(() => {
|
|
636
|
+
Transition.running = true;
|
|
637
|
+
runTop(item);
|
|
638
|
+
}, false);
|
|
639
|
+
Transition && (Transition.running = false);
|
|
640
|
+
});
|
|
641
|
+
}
|
|
642
|
+
}
|
|
643
|
+
}
|
|
644
|
+
function runUserEffects(queue) {
|
|
645
|
+
let i, userLength = 0;
|
|
646
|
+
for (i = 0; i < queue.length; i++) {
|
|
647
|
+
const e = queue[i];
|
|
648
|
+
if (!e.user)
|
|
649
|
+
runTop(e);
|
|
650
|
+
else
|
|
651
|
+
queue[userLength++] = e;
|
|
652
|
+
}
|
|
653
|
+
if (sharedConfig.context)
|
|
654
|
+
setHydrateContext();
|
|
655
|
+
for (i = 0; i < userLength; i++)
|
|
656
|
+
runTop(queue[i]);
|
|
657
|
+
}
|
|
658
|
+
function lookUpstream(node, ignore) {
|
|
659
|
+
const runningTransition = Transition && Transition.running;
|
|
660
|
+
if (runningTransition)
|
|
661
|
+
node.tState = 0;
|
|
662
|
+
else
|
|
663
|
+
node.state = 0;
|
|
664
|
+
for (let i = 0; i < node.sources.length; i += 1) {
|
|
665
|
+
const source = node.sources[i];
|
|
666
|
+
if (source.sources) {
|
|
667
|
+
if (!runningTransition && source.state === STALE || runningTransition && source.tState === STALE) {
|
|
668
|
+
if (source !== ignore && (!source.updatedAt || source.updatedAt < ExecCount))
|
|
669
|
+
runTop(source);
|
|
670
|
+
} else if (!runningTransition && source.state === PENDING || runningTransition && source.tState === PENDING)
|
|
671
|
+
lookUpstream(source, ignore);
|
|
672
|
+
}
|
|
673
|
+
}
|
|
674
|
+
}
|
|
675
|
+
function markDownstream(node) {
|
|
676
|
+
const runningTransition = Transition && Transition.running;
|
|
677
|
+
for (let i = 0; i < node.observers.length; i += 1) {
|
|
678
|
+
const o = node.observers[i];
|
|
679
|
+
if (!runningTransition && !o.state || runningTransition && !o.tState) {
|
|
680
|
+
if (runningTransition)
|
|
681
|
+
o.tState = PENDING;
|
|
682
|
+
else
|
|
683
|
+
o.state = PENDING;
|
|
684
|
+
if (o.pure)
|
|
685
|
+
Updates.push(o);
|
|
686
|
+
else
|
|
687
|
+
Effects.push(o);
|
|
688
|
+
o.observers && markDownstream(o);
|
|
689
|
+
}
|
|
690
|
+
}
|
|
691
|
+
}
|
|
692
|
+
function cleanNode(node) {
|
|
693
|
+
let i;
|
|
694
|
+
if (node.sources) {
|
|
695
|
+
while (node.sources.length) {
|
|
696
|
+
const source = node.sources.pop(), index = node.sourceSlots.pop(), obs = source.observers;
|
|
697
|
+
if (obs && obs.length) {
|
|
698
|
+
const n = obs.pop(), s = source.observerSlots.pop();
|
|
699
|
+
if (index < obs.length) {
|
|
700
|
+
n.sourceSlots[s] = index;
|
|
701
|
+
obs[index] = n;
|
|
702
|
+
source.observerSlots[index] = s;
|
|
703
|
+
}
|
|
704
|
+
}
|
|
705
|
+
}
|
|
706
|
+
}
|
|
707
|
+
if (Transition && Transition.running && node.pure) {
|
|
708
|
+
if (node.tOwned) {
|
|
709
|
+
for (i = 0; i < node.tOwned.length; i++)
|
|
710
|
+
cleanNode(node.tOwned[i]);
|
|
711
|
+
delete node.tOwned;
|
|
712
|
+
}
|
|
713
|
+
reset(node, true);
|
|
714
|
+
} else if (node.owned) {
|
|
715
|
+
for (i = 0; i < node.owned.length; i++)
|
|
716
|
+
cleanNode(node.owned[i]);
|
|
717
|
+
node.owned = null;
|
|
718
|
+
}
|
|
719
|
+
if (node.cleanups) {
|
|
720
|
+
for (i = 0; i < node.cleanups.length; i++)
|
|
721
|
+
node.cleanups[i]();
|
|
722
|
+
node.cleanups = null;
|
|
723
|
+
}
|
|
724
|
+
if (Transition && Transition.running)
|
|
725
|
+
node.tState = 0;
|
|
726
|
+
else
|
|
727
|
+
node.state = 0;
|
|
728
|
+
node.context = null;
|
|
729
|
+
}
|
|
730
|
+
function reset(node, top) {
|
|
731
|
+
if (!top) {
|
|
732
|
+
node.tState = 0;
|
|
733
|
+
Transition.disposed.add(node);
|
|
734
|
+
}
|
|
735
|
+
if (node.owned) {
|
|
736
|
+
for (let i = 0; i < node.owned.length; i++)
|
|
737
|
+
reset(node.owned[i]);
|
|
738
|
+
}
|
|
739
|
+
}
|
|
740
|
+
function castError(err) {
|
|
741
|
+
if (err instanceof Error || typeof err === "string")
|
|
742
|
+
return err;
|
|
743
|
+
return new Error("Unknown error");
|
|
744
|
+
}
|
|
745
|
+
function runErrors(fns, err) {
|
|
746
|
+
for (const f of fns)
|
|
747
|
+
f(err);
|
|
748
|
+
}
|
|
749
|
+
function handleError(err) {
|
|
750
|
+
err = castError(err);
|
|
751
|
+
const fns = ERROR && lookup(Owner, ERROR);
|
|
752
|
+
if (!fns)
|
|
753
|
+
throw err;
|
|
754
|
+
if (Effects)
|
|
755
|
+
Effects.push({
|
|
756
|
+
fn() {
|
|
757
|
+
runErrors(fns, err);
|
|
758
|
+
},
|
|
759
|
+
state: STALE
|
|
760
|
+
});
|
|
761
|
+
else
|
|
762
|
+
runErrors(fns, err);
|
|
763
|
+
}
|
|
764
|
+
function lookup(owner, key) {
|
|
765
|
+
return owner ? owner.context && owner.context[key] !== void 0 ? owner.context[key] : lookup(owner.owner, key) : void 0;
|
|
766
|
+
}
|
|
767
|
+
function resolveChildren(children2) {
|
|
768
|
+
if (typeof children2 === "function" && !children2.length)
|
|
769
|
+
return resolveChildren(children2());
|
|
770
|
+
if (Array.isArray(children2)) {
|
|
771
|
+
const results = [];
|
|
772
|
+
for (let i = 0; i < children2.length; i++) {
|
|
773
|
+
const result = resolveChildren(children2[i]);
|
|
774
|
+
Array.isArray(result) ? results.push.apply(results, result) : results.push(result);
|
|
775
|
+
}
|
|
776
|
+
return results;
|
|
777
|
+
}
|
|
778
|
+
return children2;
|
|
779
|
+
}
|
|
780
|
+
function createProvider(id, options) {
|
|
781
|
+
return function provider(props) {
|
|
782
|
+
let res;
|
|
783
|
+
createRenderEffect(() => res = untrack(() => {
|
|
784
|
+
Owner.context = {
|
|
785
|
+
[id]: props.value
|
|
786
|
+
};
|
|
787
|
+
return children(() => props.children);
|
|
788
|
+
}), void 0);
|
|
789
|
+
return res;
|
|
790
|
+
};
|
|
791
|
+
}
|
|
792
|
+
var FALLBACK = Symbol("fallback");
|
|
793
|
+
function dispose(d) {
|
|
794
|
+
for (let i = 0; i < d.length; i++)
|
|
795
|
+
d[i]();
|
|
796
|
+
}
|
|
797
|
+
function mapArray(list, mapFn, options = {}) {
|
|
798
|
+
let items = [], mapped = [], disposers = [], len = 0, indexes = mapFn.length > 1 ? [] : null;
|
|
799
|
+
onCleanup(() => dispose(disposers));
|
|
800
|
+
return () => {
|
|
801
|
+
let newItems = list() || [], i, j;
|
|
802
|
+
newItems[$TRACK];
|
|
803
|
+
return untrack(() => {
|
|
804
|
+
let newLen = newItems.length, newIndices, newIndicesNext, temp, tempdisposers, tempIndexes, start, end, newEnd, item;
|
|
805
|
+
if (newLen === 0) {
|
|
806
|
+
if (len !== 0) {
|
|
807
|
+
dispose(disposers);
|
|
808
|
+
disposers = [];
|
|
809
|
+
items = [];
|
|
810
|
+
mapped = [];
|
|
811
|
+
len = 0;
|
|
812
|
+
indexes && (indexes = []);
|
|
813
|
+
}
|
|
814
|
+
if (options.fallback) {
|
|
815
|
+
items = [FALLBACK];
|
|
816
|
+
mapped[0] = createRoot((disposer) => {
|
|
817
|
+
disposers[0] = disposer;
|
|
818
|
+
return options.fallback();
|
|
819
|
+
});
|
|
820
|
+
len = 1;
|
|
821
|
+
}
|
|
822
|
+
} else if (len === 0) {
|
|
823
|
+
mapped = new Array(newLen);
|
|
824
|
+
for (j = 0; j < newLen; j++) {
|
|
825
|
+
items[j] = newItems[j];
|
|
826
|
+
mapped[j] = createRoot(mapper);
|
|
827
|
+
}
|
|
828
|
+
len = newLen;
|
|
829
|
+
} else {
|
|
830
|
+
temp = new Array(newLen);
|
|
831
|
+
tempdisposers = new Array(newLen);
|
|
832
|
+
indexes && (tempIndexes = new Array(newLen));
|
|
833
|
+
for (start = 0, end = Math.min(len, newLen); start < end && items[start] === newItems[start]; start++)
|
|
834
|
+
;
|
|
835
|
+
for (end = len - 1, newEnd = newLen - 1; end >= start && newEnd >= start && items[end] === newItems[newEnd]; end--, newEnd--) {
|
|
836
|
+
temp[newEnd] = mapped[end];
|
|
837
|
+
tempdisposers[newEnd] = disposers[end];
|
|
838
|
+
indexes && (tempIndexes[newEnd] = indexes[end]);
|
|
839
|
+
}
|
|
840
|
+
newIndices = /* @__PURE__ */ new Map();
|
|
841
|
+
newIndicesNext = new Array(newEnd + 1);
|
|
842
|
+
for (j = newEnd; j >= start; j--) {
|
|
843
|
+
item = newItems[j];
|
|
844
|
+
i = newIndices.get(item);
|
|
845
|
+
newIndicesNext[j] = i === void 0 ? -1 : i;
|
|
846
|
+
newIndices.set(item, j);
|
|
847
|
+
}
|
|
848
|
+
for (i = start; i <= end; i++) {
|
|
849
|
+
item = items[i];
|
|
850
|
+
j = newIndices.get(item);
|
|
851
|
+
if (j !== void 0 && j !== -1) {
|
|
852
|
+
temp[j] = mapped[i];
|
|
853
|
+
tempdisposers[j] = disposers[i];
|
|
854
|
+
indexes && (tempIndexes[j] = indexes[i]);
|
|
855
|
+
j = newIndicesNext[j];
|
|
856
|
+
newIndices.set(item, j);
|
|
857
|
+
} else
|
|
858
|
+
disposers[i]();
|
|
859
|
+
}
|
|
860
|
+
for (j = start; j < newLen; j++) {
|
|
861
|
+
if (j in temp) {
|
|
862
|
+
mapped[j] = temp[j];
|
|
863
|
+
disposers[j] = tempdisposers[j];
|
|
864
|
+
if (indexes) {
|
|
865
|
+
indexes[j] = tempIndexes[j];
|
|
866
|
+
indexes[j](j);
|
|
867
|
+
}
|
|
868
|
+
} else
|
|
869
|
+
mapped[j] = createRoot(mapper);
|
|
870
|
+
}
|
|
871
|
+
mapped = mapped.slice(0, len = newLen);
|
|
872
|
+
items = newItems.slice(0);
|
|
873
|
+
}
|
|
874
|
+
return mapped;
|
|
875
|
+
});
|
|
876
|
+
function mapper(disposer) {
|
|
877
|
+
disposers[j] = disposer;
|
|
878
|
+
if (indexes) {
|
|
879
|
+
const [s, set] = createSignal(j);
|
|
880
|
+
indexes[j] = set;
|
|
881
|
+
return mapFn(newItems[j], s);
|
|
882
|
+
}
|
|
883
|
+
return mapFn(newItems[j]);
|
|
884
|
+
}
|
|
885
|
+
};
|
|
886
|
+
}
|
|
887
|
+
function indexArray(list, mapFn, options = {}) {
|
|
888
|
+
let items = [], mapped = [], disposers = [], signals = [], len = 0, i;
|
|
889
|
+
onCleanup(() => dispose(disposers));
|
|
890
|
+
return () => {
|
|
891
|
+
const newItems = list() || [];
|
|
892
|
+
newItems[$TRACK];
|
|
893
|
+
return untrack(() => {
|
|
894
|
+
if (newItems.length === 0) {
|
|
895
|
+
if (len !== 0) {
|
|
896
|
+
dispose(disposers);
|
|
897
|
+
disposers = [];
|
|
898
|
+
items = [];
|
|
899
|
+
mapped = [];
|
|
900
|
+
len = 0;
|
|
901
|
+
signals = [];
|
|
902
|
+
}
|
|
903
|
+
if (options.fallback) {
|
|
904
|
+
items = [FALLBACK];
|
|
905
|
+
mapped[0] = createRoot((disposer) => {
|
|
906
|
+
disposers[0] = disposer;
|
|
907
|
+
return options.fallback();
|
|
908
|
+
});
|
|
909
|
+
len = 1;
|
|
910
|
+
}
|
|
911
|
+
return mapped;
|
|
912
|
+
}
|
|
913
|
+
if (items[0] === FALLBACK) {
|
|
914
|
+
disposers[0]();
|
|
915
|
+
disposers = [];
|
|
916
|
+
items = [];
|
|
917
|
+
mapped = [];
|
|
918
|
+
len = 0;
|
|
919
|
+
}
|
|
920
|
+
for (i = 0; i < newItems.length; i++) {
|
|
921
|
+
if (i < items.length && items[i] !== newItems[i]) {
|
|
922
|
+
signals[i](() => newItems[i]);
|
|
923
|
+
} else if (i >= items.length) {
|
|
924
|
+
mapped[i] = createRoot(mapper);
|
|
925
|
+
}
|
|
926
|
+
}
|
|
927
|
+
for (; i < items.length; i++) {
|
|
928
|
+
disposers[i]();
|
|
929
|
+
}
|
|
930
|
+
len = signals.length = disposers.length = newItems.length;
|
|
931
|
+
items = newItems.slice(0);
|
|
932
|
+
return mapped = mapped.slice(0, len);
|
|
933
|
+
});
|
|
934
|
+
function mapper(disposer) {
|
|
935
|
+
disposers[i] = disposer;
|
|
936
|
+
const [s, set] = createSignal(newItems[i]);
|
|
937
|
+
signals[i] = set;
|
|
938
|
+
return mapFn(s, i);
|
|
939
|
+
}
|
|
940
|
+
};
|
|
941
|
+
}
|
|
942
|
+
function lazy(fn) {
|
|
943
|
+
let comp;
|
|
944
|
+
let p;
|
|
945
|
+
const wrap = (props) => {
|
|
946
|
+
const ctx = sharedConfig.context;
|
|
947
|
+
if (ctx) {
|
|
948
|
+
const [s, set] = createSignal();
|
|
949
|
+
(p || (p = fn())).then((mod) => {
|
|
950
|
+
setHydrateContext(ctx);
|
|
951
|
+
set(() => mod.default);
|
|
952
|
+
setHydrateContext();
|
|
953
|
+
});
|
|
954
|
+
comp = s;
|
|
955
|
+
} else if (!comp) {
|
|
956
|
+
const [s] = createResource(() => (p || (p = fn())).then((mod) => mod.default));
|
|
957
|
+
comp = s;
|
|
958
|
+
}
|
|
959
|
+
let Comp;
|
|
960
|
+
return createMemo(() => (Comp = comp()) && untrack(() => {
|
|
961
|
+
if (false)
|
|
962
|
+
;
|
|
963
|
+
if (!ctx)
|
|
964
|
+
return Comp(props);
|
|
965
|
+
const c = sharedConfig.context;
|
|
966
|
+
setHydrateContext(ctx);
|
|
967
|
+
const r = Comp(props);
|
|
968
|
+
setHydrateContext(c);
|
|
969
|
+
return r;
|
|
970
|
+
}));
|
|
971
|
+
};
|
|
972
|
+
wrap.preload = () => p || ((p = fn()).then((mod) => comp = () => mod.default), p);
|
|
973
|
+
return wrap;
|
|
974
|
+
}
|
|
975
|
+
function For(props) {
|
|
976
|
+
const fallback = "fallback" in props && {
|
|
977
|
+
fallback: () => props.fallback
|
|
978
|
+
};
|
|
979
|
+
return createMemo(mapArray(() => props.each, props.children, fallback || void 0));
|
|
980
|
+
}
|
|
981
|
+
function Index(props) {
|
|
982
|
+
const fallback = "fallback" in props && {
|
|
983
|
+
fallback: () => props.fallback
|
|
984
|
+
};
|
|
985
|
+
return createMemo(indexArray(() => props.each, props.children, fallback || void 0));
|
|
986
|
+
}
|
|
987
|
+
function Show(props) {
|
|
988
|
+
let strictEqual = false;
|
|
989
|
+
const keyed = props.keyed;
|
|
990
|
+
const condition = createMemo(() => props.when, void 0, {
|
|
991
|
+
equals: (a, b) => strictEqual ? a === b : !a === !b
|
|
992
|
+
});
|
|
993
|
+
return createMemo(() => {
|
|
994
|
+
const c = condition();
|
|
995
|
+
if (c) {
|
|
996
|
+
const child = props.children;
|
|
997
|
+
const fn = typeof child === "function" && child.length > 0;
|
|
998
|
+
strictEqual = keyed || fn;
|
|
999
|
+
return fn ? untrack(() => child(c)) : child;
|
|
1000
|
+
}
|
|
1001
|
+
return props.fallback;
|
|
1002
|
+
}, void 0, void 0);
|
|
1003
|
+
}
|
|
1004
|
+
function Switch(props) {
|
|
1005
|
+
let strictEqual = false;
|
|
1006
|
+
let keyed = false;
|
|
1007
|
+
const equals = (a, b) => a[0] === b[0] && (strictEqual ? a[1] === b[1] : !a[1] === !b[1]) && a[2] === b[2];
|
|
1008
|
+
const conditions = children(() => props.children), evalConditions = createMemo(() => {
|
|
1009
|
+
let conds = conditions();
|
|
1010
|
+
if (!Array.isArray(conds))
|
|
1011
|
+
conds = [conds];
|
|
1012
|
+
for (let i = 0; i < conds.length; i++) {
|
|
1013
|
+
const c = conds[i].when;
|
|
1014
|
+
if (c) {
|
|
1015
|
+
keyed = !!conds[i].keyed;
|
|
1016
|
+
return [i, c, conds[i]];
|
|
1017
|
+
}
|
|
1018
|
+
}
|
|
1019
|
+
return [-1];
|
|
1020
|
+
}, void 0, {
|
|
1021
|
+
equals
|
|
1022
|
+
});
|
|
1023
|
+
return createMemo(() => {
|
|
1024
|
+
const [index, when, cond] = evalConditions();
|
|
1025
|
+
if (index < 0)
|
|
1026
|
+
return props.fallback;
|
|
1027
|
+
const c = cond.children;
|
|
1028
|
+
const fn = typeof c === "function" && c.length > 0;
|
|
1029
|
+
strictEqual = keyed || fn;
|
|
1030
|
+
return fn ? untrack(() => c(when)) : c;
|
|
1031
|
+
}, void 0, void 0);
|
|
1032
|
+
}
|
|
1033
|
+
function Match(props) {
|
|
1034
|
+
return props;
|
|
1035
|
+
}
|
|
1036
|
+
var SuspenseListContext = createContext();
|
|
1037
|
+
|
|
1038
|
+
// ../../node_modules/.pnpm/solid-js@1.6.13/node_modules/solid-js/web/dist/web.js
|
|
1039
|
+
var booleans = ["allowfullscreen", "async", "autofocus", "autoplay", "checked", "controls", "default", "disabled", "formnovalidate", "hidden", "indeterminate", "ismap", "loop", "multiple", "muted", "nomodule", "novalidate", "open", "playsinline", "readonly", "required", "reversed", "seamless", "selected"];
|
|
1040
|
+
var Properties = /* @__PURE__ */ new Set(["className", "value", "readOnly", "formNoValidate", "isMap", "noModule", "playsInline", ...booleans]);
|
|
1041
|
+
function reconcileArrays(parentNode, a, b) {
|
|
1042
|
+
let bLength = b.length, aEnd = a.length, bEnd = bLength, aStart = 0, bStart = 0, after = a[aEnd - 1].nextSibling, map = null;
|
|
1043
|
+
while (aStart < aEnd || bStart < bEnd) {
|
|
1044
|
+
if (a[aStart] === b[bStart]) {
|
|
1045
|
+
aStart++;
|
|
1046
|
+
bStart++;
|
|
1047
|
+
continue;
|
|
1048
|
+
}
|
|
1049
|
+
while (a[aEnd - 1] === b[bEnd - 1]) {
|
|
1050
|
+
aEnd--;
|
|
1051
|
+
bEnd--;
|
|
1052
|
+
}
|
|
1053
|
+
if (aEnd === aStart) {
|
|
1054
|
+
const node = bEnd < bLength ? bStart ? b[bStart - 1].nextSibling : b[bEnd - bStart] : after;
|
|
1055
|
+
while (bStart < bEnd)
|
|
1056
|
+
parentNode.insertBefore(b[bStart++], node);
|
|
1057
|
+
} else if (bEnd === bStart) {
|
|
1058
|
+
while (aStart < aEnd) {
|
|
1059
|
+
if (!map || !map.has(a[aStart]))
|
|
1060
|
+
a[aStart].remove();
|
|
1061
|
+
aStart++;
|
|
1062
|
+
}
|
|
1063
|
+
} else if (a[aStart] === b[bEnd - 1] && b[bStart] === a[aEnd - 1]) {
|
|
1064
|
+
const node = a[--aEnd].nextSibling;
|
|
1065
|
+
parentNode.insertBefore(b[bStart++], a[aStart++].nextSibling);
|
|
1066
|
+
parentNode.insertBefore(b[--bEnd], node);
|
|
1067
|
+
a[aEnd] = b[bEnd];
|
|
1068
|
+
} else {
|
|
1069
|
+
if (!map) {
|
|
1070
|
+
map = /* @__PURE__ */ new Map();
|
|
1071
|
+
let i = bStart;
|
|
1072
|
+
while (i < bEnd)
|
|
1073
|
+
map.set(b[i], i++);
|
|
1074
|
+
}
|
|
1075
|
+
const index = map.get(a[aStart]);
|
|
1076
|
+
if (index != null) {
|
|
1077
|
+
if (bStart < index && index < bEnd) {
|
|
1078
|
+
let i = aStart, sequence = 1, t;
|
|
1079
|
+
while (++i < aEnd && i < bEnd) {
|
|
1080
|
+
if ((t = map.get(a[i])) == null || t !== index + sequence)
|
|
1081
|
+
break;
|
|
1082
|
+
sequence++;
|
|
1083
|
+
}
|
|
1084
|
+
if (sequence > index - bStart) {
|
|
1085
|
+
const node = a[aStart];
|
|
1086
|
+
while (bStart < index)
|
|
1087
|
+
parentNode.insertBefore(b[bStart++], node);
|
|
1088
|
+
} else
|
|
1089
|
+
parentNode.replaceChild(b[bStart++], a[aStart++]);
|
|
1090
|
+
} else
|
|
1091
|
+
aStart++;
|
|
1092
|
+
} else
|
|
1093
|
+
a[aStart++].remove();
|
|
1094
|
+
}
|
|
1095
|
+
}
|
|
1096
|
+
}
|
|
1097
|
+
function render(code, element, init, options = {}) {
|
|
1098
|
+
let disposer;
|
|
1099
|
+
createRoot((dispose2) => {
|
|
1100
|
+
disposer = dispose2;
|
|
1101
|
+
element === document ? code() : insert(element, code(), element.firstChild ? null : void 0, init);
|
|
1102
|
+
}, options.owner);
|
|
1103
|
+
return () => {
|
|
1104
|
+
disposer();
|
|
1105
|
+
element.textContent = "";
|
|
1106
|
+
};
|
|
1107
|
+
}
|
|
1108
|
+
function insert(parent, accessor, marker, initial) {
|
|
1109
|
+
if (marker !== void 0 && !initial)
|
|
1110
|
+
initial = [];
|
|
1111
|
+
if (typeof accessor !== "function")
|
|
1112
|
+
return insertExpression(parent, accessor, initial, marker);
|
|
1113
|
+
createRenderEffect((current) => insertExpression(parent, accessor(), current, marker), initial);
|
|
1114
|
+
}
|
|
1115
|
+
function insertExpression(parent, value, current, marker, unwrapArray) {
|
|
1116
|
+
if (sharedConfig.context && !current)
|
|
1117
|
+
current = [...parent.childNodes];
|
|
1118
|
+
while (typeof current === "function")
|
|
1119
|
+
current = current();
|
|
1120
|
+
if (value === current)
|
|
1121
|
+
return current;
|
|
1122
|
+
const t = typeof value, multi = marker !== void 0;
|
|
1123
|
+
parent = multi && current[0] && current[0].parentNode || parent;
|
|
1124
|
+
if (t === "string" || t === "number") {
|
|
1125
|
+
if (sharedConfig.context)
|
|
1126
|
+
return current;
|
|
1127
|
+
if (t === "number")
|
|
1128
|
+
value = value.toString();
|
|
1129
|
+
if (multi) {
|
|
1130
|
+
let node = current[0];
|
|
1131
|
+
if (node && node.nodeType === 3) {
|
|
1132
|
+
node.data = value;
|
|
1133
|
+
} else
|
|
1134
|
+
node = document.createTextNode(value);
|
|
1135
|
+
current = cleanChildren(parent, current, marker, node);
|
|
1136
|
+
} else {
|
|
1137
|
+
if (current !== "" && typeof current === "string") {
|
|
1138
|
+
current = parent.firstChild.data = value;
|
|
1139
|
+
} else
|
|
1140
|
+
current = parent.textContent = value;
|
|
1141
|
+
}
|
|
1142
|
+
} else if (value == null || t === "boolean") {
|
|
1143
|
+
if (sharedConfig.context)
|
|
1144
|
+
return current;
|
|
1145
|
+
current = cleanChildren(parent, current, marker);
|
|
1146
|
+
} else if (t === "function") {
|
|
1147
|
+
createRenderEffect(() => {
|
|
1148
|
+
let v = value();
|
|
1149
|
+
while (typeof v === "function")
|
|
1150
|
+
v = v();
|
|
1151
|
+
current = insertExpression(parent, v, current, marker);
|
|
1152
|
+
});
|
|
1153
|
+
return () => current;
|
|
1154
|
+
} else if (Array.isArray(value)) {
|
|
1155
|
+
const array = [];
|
|
1156
|
+
const currentArray = current && Array.isArray(current);
|
|
1157
|
+
if (normalizeIncomingArray(array, value, current, unwrapArray)) {
|
|
1158
|
+
createRenderEffect(() => current = insertExpression(parent, array, current, marker, true));
|
|
1159
|
+
return () => current;
|
|
1160
|
+
}
|
|
1161
|
+
if (sharedConfig.context) {
|
|
1162
|
+
if (!array.length)
|
|
1163
|
+
return current;
|
|
1164
|
+
for (let i = 0; i < array.length; i++) {
|
|
1165
|
+
if (array[i].parentNode)
|
|
1166
|
+
return current = array;
|
|
1167
|
+
}
|
|
1168
|
+
}
|
|
1169
|
+
if (array.length === 0) {
|
|
1170
|
+
current = cleanChildren(parent, current, marker);
|
|
1171
|
+
if (multi)
|
|
1172
|
+
return current;
|
|
1173
|
+
} else if (currentArray) {
|
|
1174
|
+
if (current.length === 0) {
|
|
1175
|
+
appendNodes(parent, array, marker);
|
|
1176
|
+
} else
|
|
1177
|
+
reconcileArrays(parent, current, array);
|
|
1178
|
+
} else {
|
|
1179
|
+
current && cleanChildren(parent);
|
|
1180
|
+
appendNodes(parent, array);
|
|
1181
|
+
}
|
|
1182
|
+
current = array;
|
|
1183
|
+
} else if (value instanceof Node) {
|
|
1184
|
+
if (sharedConfig.context && value.parentNode)
|
|
1185
|
+
return current = multi ? [value] : value;
|
|
1186
|
+
if (Array.isArray(current)) {
|
|
1187
|
+
if (multi)
|
|
1188
|
+
return current = cleanChildren(parent, current, marker, value);
|
|
1189
|
+
cleanChildren(parent, current, null, value);
|
|
1190
|
+
} else if (current == null || current === "" || !parent.firstChild) {
|
|
1191
|
+
parent.appendChild(value);
|
|
1192
|
+
} else
|
|
1193
|
+
parent.replaceChild(value, parent.firstChild);
|
|
1194
|
+
current = value;
|
|
1195
|
+
} else
|
|
1196
|
+
;
|
|
1197
|
+
return current;
|
|
1198
|
+
}
|
|
1199
|
+
function normalizeIncomingArray(normalized, array, current, unwrap) {
|
|
1200
|
+
let dynamic = false;
|
|
1201
|
+
for (let i = 0, len = array.length; i < len; i++) {
|
|
1202
|
+
let item = array[i], prev = current && current[i];
|
|
1203
|
+
if (item instanceof Node) {
|
|
1204
|
+
normalized.push(item);
|
|
1205
|
+
} else if (item == null || item === true || item === false)
|
|
1206
|
+
;
|
|
1207
|
+
else if (Array.isArray(item)) {
|
|
1208
|
+
dynamic = normalizeIncomingArray(normalized, item, prev) || dynamic;
|
|
1209
|
+
} else if (typeof item === "function") {
|
|
1210
|
+
if (unwrap) {
|
|
1211
|
+
while (typeof item === "function")
|
|
1212
|
+
item = item();
|
|
1213
|
+
dynamic = normalizeIncomingArray(normalized, Array.isArray(item) ? item : [item], Array.isArray(prev) ? prev : [prev]) || dynamic;
|
|
1214
|
+
} else {
|
|
1215
|
+
normalized.push(item);
|
|
1216
|
+
dynamic = true;
|
|
1217
|
+
}
|
|
1218
|
+
} else {
|
|
1219
|
+
const value = String(item);
|
|
1220
|
+
if (value === "<!>") {
|
|
1221
|
+
if (prev && prev.nodeType === 8)
|
|
1222
|
+
normalized.push(prev);
|
|
1223
|
+
} else if (prev && prev.nodeType === 3) {
|
|
1224
|
+
prev.data = value;
|
|
1225
|
+
normalized.push(prev);
|
|
1226
|
+
} else
|
|
1227
|
+
normalized.push(document.createTextNode(value));
|
|
1228
|
+
}
|
|
1229
|
+
}
|
|
1230
|
+
return dynamic;
|
|
1231
|
+
}
|
|
1232
|
+
function appendNodes(parent, array, marker = null) {
|
|
1233
|
+
for (let i = 0, len = array.length; i < len; i++)
|
|
1234
|
+
parent.insertBefore(array[i], marker);
|
|
1235
|
+
}
|
|
1236
|
+
function cleanChildren(parent, current, marker, replacement) {
|
|
1237
|
+
if (marker === void 0)
|
|
1238
|
+
return parent.textContent = "";
|
|
1239
|
+
const node = replacement || document.createTextNode("");
|
|
1240
|
+
if (current.length) {
|
|
1241
|
+
let inserted = false;
|
|
1242
|
+
for (let i = current.length - 1; i >= 0; i--) {
|
|
1243
|
+
const el = current[i];
|
|
1244
|
+
if (node !== el) {
|
|
1245
|
+
const isParent = el.parentNode === parent;
|
|
1246
|
+
if (!inserted && !i)
|
|
1247
|
+
isParent ? parent.replaceChild(node, el) : parent.insertBefore(node, marker);
|
|
1248
|
+
else
|
|
1249
|
+
isParent && el.remove();
|
|
1250
|
+
} else
|
|
1251
|
+
inserted = true;
|
|
1252
|
+
}
|
|
1253
|
+
} else
|
|
1254
|
+
parent.insertBefore(node, marker);
|
|
1255
|
+
return [node];
|
|
1256
|
+
}
|
|
1257
|
+
var isServer = false;
|
|
1258
|
+
|
|
1259
|
+
export {
|
|
1260
|
+
$TRACK,
|
|
1261
|
+
createRoot,
|
|
1262
|
+
createSignal,
|
|
1263
|
+
createEffect,
|
|
1264
|
+
createMemo,
|
|
1265
|
+
untrack,
|
|
1266
|
+
on,
|
|
1267
|
+
onMount,
|
|
1268
|
+
onCleanup,
|
|
1269
|
+
useTransition,
|
|
1270
|
+
createContext,
|
|
1271
|
+
useContext,
|
|
1272
|
+
lazy,
|
|
1273
|
+
For,
|
|
1274
|
+
Index,
|
|
1275
|
+
Show,
|
|
1276
|
+
Switch,
|
|
1277
|
+
Match,
|
|
1278
|
+
render,
|
|
1279
|
+
isServer
|
|
1280
|
+
};
|