@shiodome47/sekisho 0.0.0-stage → 0.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.
@@ -0,0 +1,452 @@
1
+ 'use client'
2
+
3
+ // src/core/progress.ts
4
+ var progressId = (courseId, itemId) => `${courseId}|${itemId}`;
5
+ var clearId = (courseId, gateId) => `${courseId}|${gateId ?? "*"}`;
6
+ var lapId = (courseId, round) => `${courseId}|${round}`;
7
+ function itemGoal(item) {
8
+ const n = Math.floor(Number(item.count ?? 1));
9
+ return Number.isFinite(n) && n >= 1 ? n : 1;
10
+ }
11
+ function makeCtx(data) {
12
+ const laps = data.laps ?? [];
13
+ const rounds = /* @__PURE__ */ new Map();
14
+ for (const l of laps) rounds.set(l.courseId, Math.max(rounds.get(l.courseId) ?? 0, l.round));
15
+ return {
16
+ progress: new Map((data.progress ?? []).map((p) => [p.id, p])),
17
+ clears: new Map((data.clears ?? []).map((c) => [c.id, c])),
18
+ laps,
19
+ rounds
20
+ };
21
+ }
22
+ var roundOf = (ctx, courseId) => (ctx.rounds.get(courseId) ?? 0) + 1;
23
+ var sameRound = (r, round) => !!r && (r.round ?? 1) === round;
24
+ function clearIn(ctx, courseId, gateId, round) {
25
+ const c = ctx.clears.get(clearId(courseId, gateId));
26
+ return sameRound(c, round) ? c : void 0;
27
+ }
28
+ function doneOf(ctx, courseId, item, round) {
29
+ const p = ctx.progress.get(progressId(courseId, item.id));
30
+ const n = sameRound(p, round) ? p.done : 0;
31
+ return Math.max(0, Math.min(itemGoal(item), n));
32
+ }
33
+ function openAt(ctx, course, index, round) {
34
+ if ((course.route ?? "free") === "free" || index <= 0) return true;
35
+ const gate = course.gates[index];
36
+ const prev = course.gates[index - 1];
37
+ return !!clearIn(ctx, course.id, prev.id, round) || !!gate && !!clearIn(ctx, course.id, gate.id, round);
38
+ }
39
+ function currentLap(data, courseId) {
40
+ return (data.laps ?? []).filter((l) => l.courseId === courseId && !l.hidden).length + 1;
41
+ }
42
+ function isGateOpen(data, course, gateId) {
43
+ const index = course.gates.findIndex((g) => g.id === gateId);
44
+ const ctx = makeCtx(data);
45
+ return index >= 0 && openAt(ctx, course, index, roundOf(ctx, course.id));
46
+ }
47
+ function viewWith(ctx, course) {
48
+ const round = roundOf(ctx, course.id);
49
+ const gates = course.gates.map((gate, index) => {
50
+ const items = gate.items.map((item) => {
51
+ const goal = itemGoal(item);
52
+ const done2 = doneOf(ctx, course.id, item, round);
53
+ return { item, done: done2, goal, complete: done2 >= goal };
54
+ });
55
+ const done = items.filter((i) => i.complete).length;
56
+ const clear = clearIn(ctx, course.id, gate.id, round);
57
+ return {
58
+ gate,
59
+ index,
60
+ items,
61
+ done,
62
+ total: items.length,
63
+ complete: items.length > 0 && done === items.length,
64
+ cleared: !!clear,
65
+ ...clear ? { clearedAt: clear.clearedAt } : {},
66
+ open: openAt(ctx, course, index, round)
67
+ };
68
+ });
69
+ const courseClear = clearIn(ctx, course.id, void 0, round);
70
+ const laps = ctx.laps.filter((l) => l.courseId === course.id && !l.hidden).sort((a, b) => a.round - b.round);
71
+ const cleared = gates.filter((g) => g.cleared).length;
72
+ return {
73
+ course,
74
+ gates,
75
+ cleared,
76
+ total: gates.length,
77
+ complete: !!courseClear,
78
+ ...courseClear ? { clearedAt: courseClear.clearedAt } : {},
79
+ lap: laps.length + 1,
80
+ laps,
81
+ started: cleared > 0 || gates.some((g) => g.items.some((i) => i.done > 0))
82
+ };
83
+ }
84
+ function viewCourse(data, course) {
85
+ return viewWith(makeCtx(data), course);
86
+ }
87
+ function findItem(course, itemId) {
88
+ for (let gateIndex = 0; gateIndex < course.gates.length; gateIndex++) {
89
+ const item = course.gates[gateIndex].items.find((i) => i.id === itemId);
90
+ if (item) return { gateIndex, item };
91
+ }
92
+ return null;
93
+ }
94
+ var withRound = (r, round) => round > 1 ? { ...r, round } : r;
95
+ function detectClears(courses, ctx, at) {
96
+ const added = [];
97
+ const events = [];
98
+ for (const course of courses) {
99
+ const round = roundOf(ctx, course.id);
100
+ const view = viewWith(ctx, course);
101
+ let cleared = view.cleared;
102
+ for (const g of view.gates) {
103
+ if (g.cleared || !g.complete) continue;
104
+ const c = withRound({ id: clearId(course.id, g.gate.id), courseId: course.id, gateId: g.gate.id, clearedAt: at }, round);
105
+ ctx.clears.set(c.id, c);
106
+ added.push(c);
107
+ cleared++;
108
+ events.push({ kind: "gate", course, gate: g.gate, cleared, total: view.total, at });
109
+ }
110
+ const allCleared = course.gates.length > 0 && course.gates.every((g) => clearIn(ctx, course.id, g.id, round));
111
+ if (allCleared && !clearIn(ctx, course.id, void 0, round)) {
112
+ const c = withRound({ id: clearId(course.id), courseId: course.id, clearedAt: at }, round);
113
+ ctx.clears.set(c.id, c);
114
+ added.push(c);
115
+ events.push({ kind: "course", course, cleared: view.total, total: view.total, at });
116
+ }
117
+ }
118
+ return { clears: added, events };
119
+ }
120
+ function applySteps(data, steps, now) {
121
+ const at = now.toISOString();
122
+ const ctx = makeCtx(data);
123
+ const courses = new Map(data.courses.map((c) => [c.id, c]));
124
+ const changed = /* @__PURE__ */ new Map();
125
+ const touched = /* @__PURE__ */ new Set();
126
+ for (const step of steps) {
127
+ const course = courses.get(step.courseId);
128
+ if (!course) continue;
129
+ const round = roundOf(ctx, course.id);
130
+ const found2 = findItem(course, step.itemId);
131
+ if (!found2 || !openAt(ctx, course, found2.gateIndex, round)) continue;
132
+ const goal = itemGoal(found2.item);
133
+ const id2 = progressId(course.id, found2.item.id);
134
+ const before = ctx.progress.get(id2);
135
+ const done = doneOf(ctx, course.id, found2.item, round);
136
+ const next = Math.max(0, Math.min(goal, Math.floor(step.next(done, goal))));
137
+ if (next === done) continue;
138
+ const keepCheckedAt = done >= goal && sameRound(before, round) ? before?.checkedAt : void 0;
139
+ const p = withRound(
140
+ {
141
+ id: id2,
142
+ courseId: course.id,
143
+ itemId: found2.item.id,
144
+ done: next,
145
+ ...next >= goal ? { checkedAt: keepCheckedAt ?? at } : {},
146
+ updatedAt: at
147
+ },
148
+ round
149
+ );
150
+ ctx.progress.set(id2, p);
151
+ changed.set(id2, p);
152
+ touched.add(course.id);
153
+ }
154
+ if (changed.size === 0) return {};
155
+ const found = detectClears(
156
+ data.courses.filter((c) => touched.has(c.id)),
157
+ ctx,
158
+ at
159
+ );
160
+ return {
161
+ progress: [...changed.values()],
162
+ ...found.clears.length > 0 ? { clears: found.clears, events: found.events } : {}
163
+ };
164
+ }
165
+ function addOne(data, courseId, itemId, now) {
166
+ return applySteps(data, [{ courseId, itemId, next: (d) => d + 1 }], now);
167
+ }
168
+ function removeOne(data, courseId, itemId, now) {
169
+ return applySteps(data, [{ courseId, itemId, next: (d) => d - 1 }], now);
170
+ }
171
+ function checkItem(data, courseId, itemId, now) {
172
+ return applySteps(data, [{ courseId, itemId, next: (_d, goal) => goal }], now);
173
+ }
174
+ function uncheckItem(data, courseId, itemId, now) {
175
+ return applySteps(data, [{ courseId, itemId, next: () => 0 }], now);
176
+ }
177
+ function toggleItem(data, courseId, itemId, now) {
178
+ return applySteps(data, [{ courseId, itemId, next: (d, goal) => d >= goal ? 0 : goal }], now);
179
+ }
180
+ function sameTarget(a, b) {
181
+ return !!a && !!b && a.type === b.type && (a.id ?? null) === (b.id ?? null);
182
+ }
183
+ function report(data, activity, now) {
184
+ const amount = Math.floor(Number(activity.amount ?? 1));
185
+ if (!Number.isFinite(amount) || amount < 1) return {};
186
+ const steps = [];
187
+ for (const course of data.courses) {
188
+ for (const gate of course.gates) {
189
+ for (const item of gate.items) {
190
+ if (sameTarget(item.target, activity.target)) steps.push({ courseId: course.id, itemId: item.id, next: (d) => d + amount });
191
+ }
192
+ }
193
+ }
194
+ return applySteps(data, steps, now);
195
+ }
196
+ function settleClears(data, now, courseIds) {
197
+ const only = courseIds ? new Set(courseIds) : null;
198
+ const courses = only ? data.courses.filter((c) => only.has(c.id)) : data.courses;
199
+ const found = detectClears(courses, makeCtx(data), now.toISOString());
200
+ return found.clears.length > 0 ? { clears: found.clears, events: found.events } : {};
201
+ }
202
+ function courseRows(data, courseId) {
203
+ return {
204
+ progressIds: data.progress.filter((p) => p.courseId === courseId).map((p) => p.id),
205
+ clearIds: data.clears.filter((c) => c.courseId === courseId).map((c) => c.id)
206
+ };
207
+ }
208
+ function nextLap(data, courseId, now) {
209
+ const course = data.courses.find((c) => c.id === courseId);
210
+ if (!course) return {};
211
+ const ctx = makeCtx(data);
212
+ const round = roundOf(ctx, courseId);
213
+ const view = viewWith(ctx, course);
214
+ const lap = {
215
+ id: lapId(courseId, round),
216
+ courseId,
217
+ round,
218
+ endedAt: now.toISOString(),
219
+ cleared: view.cleared,
220
+ total: view.total,
221
+ complete: view.complete
222
+ };
223
+ const rows = courseRows(data, courseId);
224
+ return { laps: [lap], deleteProgressIds: rows.progressIds, deleteClearIds: rows.clearIds };
225
+ }
226
+ function restartCourse(data, courseId, now) {
227
+ if (!data.courses.some((c) => c.id === courseId)) return {};
228
+ const ctx = makeCtx(data);
229
+ const round = roundOf(ctx, courseId);
230
+ const hiddenLaps = ctx.laps.filter((l) => l.courseId === courseId && !l.hidden).map((l) => ({ ...l, hidden: true }));
231
+ const marker = { id: lapId(courseId, round), courseId, round, endedAt: now.toISOString(), cleared: 0, total: 0, complete: false, hidden: true };
232
+ const rows = courseRows(data, courseId);
233
+ return { laps: [...hiddenLaps, marker], deleteProgressIds: rows.progressIds, deleteClearIds: rows.clearIds };
234
+ }
235
+ function deleteCourse(data, courseId) {
236
+ const rows = courseRows(data, courseId);
237
+ return {
238
+ deleteCourseIds: data.courses.some((c) => c.id === courseId) ? [courseId] : [],
239
+ deleteProgressIds: rows.progressIds,
240
+ deleteClearIds: rows.clearIds,
241
+ deleteLapIds: (data.laps ?? []).filter((l) => l.courseId === courseId).map((l) => l.id)
242
+ };
243
+ }
244
+ function upsert(rows, put, del) {
245
+ if (!put?.length && !del?.length) return rows;
246
+ const drop = new Set(del ?? []);
247
+ const byId = new Map(rows.filter((r) => !drop.has(r.id)).map((r) => [r.id, r]));
248
+ for (const r of put ?? []) byId.set(r.id, r);
249
+ return [...byId.values()];
250
+ }
251
+ function applyChanges(data, changes) {
252
+ return {
253
+ ...data,
254
+ courses: upsert(data.courses, changes.courses, changes.deleteCourseIds),
255
+ progress: upsert(data.progress, changes.progress, changes.deleteProgressIds),
256
+ clears: upsert(data.clears, changes.clears, changes.deleteClearIds),
257
+ laps: upsert(data.laps ?? [], changes.laps, changes.deleteLapIds)
258
+ };
259
+ }
260
+ function newerProgress(local, incoming) {
261
+ const byId = new Map(local.map((p) => [p.id, p]));
262
+ return incoming.filter((p) => {
263
+ const mine = byId.get(p.id);
264
+ return !mine || p.updatedAt > mine.updatedAt;
265
+ });
266
+ }
267
+
268
+ // src/core/io.ts
269
+ function exportCourses(courses) {
270
+ return {
271
+ format: "sekisho-courses",
272
+ version: 1,
273
+ courses: courses.map((c) => ({ ...structuredClone(c), origin: "given" }))
274
+ };
275
+ }
276
+ var isObj = (v) => typeof v === "object" && v !== null && !Array.isArray(v);
277
+ var str = (v) => typeof v === "string" ? v : void 0;
278
+ var text = (v) => {
279
+ const s = str(v)?.trim();
280
+ return s ? s : void 0;
281
+ };
282
+ var id = (v) => {
283
+ const s = str(v)?.trim();
284
+ return s && s.length <= 200 ? s : void 0;
285
+ };
286
+ var MAX_COUNT = 9999;
287
+ function ref(v) {
288
+ if (!isObj(v) || !text(v.type)) return void 0;
289
+ const out = { ...v, type: text(v.type) };
290
+ if ("id" in out && out.id !== void 0 && typeof out.id !== "string") return void 0;
291
+ return out;
292
+ }
293
+ function readItem(v, seen, errors, where) {
294
+ if (!isObj(v)) return null;
295
+ const itemId = id(v.id);
296
+ const title = text(v.title);
297
+ if (!itemId || !title || seen.has(itemId)) {
298
+ errors.push(`${where}: \u30C1\u30A7\u30C3\u30AF\u9805\u76EE\u3092 1 \u3064\u98DB\u3070\u3057\u307E\u3057\u305F\uFF08id\u30FB\u540D\u524D\u304C\u7121\u3044\u304B\u3001\u540C\u3058 id \u304C\u3042\u308A\u307E\u3059\uFF09`);
299
+ return null;
300
+ }
301
+ seen.add(itemId);
302
+ const count = Math.floor(Number(v.count));
303
+ const target = ref(v.target);
304
+ const note = text(v.note);
305
+ const { id: _i, title: _t, note: _n, target: _g, count: _c, ...rest } = v;
306
+ return {
307
+ ...rest,
308
+ id: itemId,
309
+ title,
310
+ ...note ? { note } : {},
311
+ ...target ? { target } : {},
312
+ ...Number.isFinite(count) && count > 1 ? { count: Math.min(count, MAX_COUNT) } : {}
313
+ };
314
+ }
315
+ function readGate(v, seenGates, seenItems, errors, where) {
316
+ if (!isObj(v)) return null;
317
+ const gateId = id(v.id);
318
+ const title = text(v.title);
319
+ if (!gateId || !title || seenGates.has(gateId)) {
320
+ errors.push(`${where}: \u95A2\u6240\u3092 1 \u3064\u98DB\u3070\u3057\u307E\u3057\u305F\uFF08id\u30FB\u540D\u524D\u304C\u7121\u3044\u304B\u3001\u540C\u3058 id \u304C\u3042\u308A\u307E\u3059\uFF09`);
321
+ return null;
322
+ }
323
+ seenGates.add(gateId);
324
+ const items = (Array.isArray(v.items) ? v.items : []).map((i) => readItem(i, seenItems, errors, `${where}\u300C${title}\u300D`)).filter((i) => i !== null);
325
+ const description = text(v.description);
326
+ const reward = ref(v.reward);
327
+ const stamp = isObj(v.stamp) ? { ...text(v.stamp.text) ? { text: text(v.stamp.text) } : {}, ...text(v.stamp.color) ? { color: text(v.stamp.color) } : {} } : void 0;
328
+ const points = Number(v.points);
329
+ const order = isObj(v.board) ? Number(v.board.order) : NaN;
330
+ const column = isObj(v.board) ? Number(v.board.column) : NaN;
331
+ const board = Number.isFinite(order) ? { order, ...Number.isInteger(column) && column >= 0 ? { column } : {} } : void 0;
332
+ const { id: _i, title: _t, description: _d, items: _it, stamp: _s, reward: _r, points: _p, board: _b, ...rest } = v;
333
+ return {
334
+ ...rest,
335
+ id: gateId,
336
+ title,
337
+ ...description ? { description } : {},
338
+ items,
339
+ ...stamp && Object.keys(stamp).length > 0 ? { stamp } : {},
340
+ ...reward ? { reward } : {},
341
+ ...Number.isFinite(points) && v.points !== void 0 ? { points } : {},
342
+ ...board ? { board } : {}
343
+ };
344
+ }
345
+ function readCourse(v, now, errors = []) {
346
+ if (!isObj(v)) return null;
347
+ const courseId = id(v.id);
348
+ const title = text(v.title);
349
+ if (!courseId || !title) {
350
+ errors.push("\u30B3\u30FC\u30B9\u3092 1 \u3064\u98DB\u3070\u3057\u307E\u3057\u305F\uFF08id \u304B\u540D\u524D\u304C\u3042\u308A\u307E\u305B\u3093\uFF09");
351
+ return null;
352
+ }
353
+ const where = `\u30B3\u30FC\u30B9\u300C${title}\u300D`;
354
+ const seenGates = /* @__PURE__ */ new Set();
355
+ const seenItems = /* @__PURE__ */ new Set();
356
+ const gates = (Array.isArray(v.gates) ? v.gates : []).map((g) => readGate(g, seenGates, seenItems, errors, where)).filter((g) => g !== null);
357
+ const at = now.toISOString();
358
+ const revision = Math.floor(Number(v.revision));
359
+ const description = text(v.description);
360
+ const color = text(v.color);
361
+ const reward = ref(v.reward);
362
+ const { id: _i, title: _t, description: _d, origin: _o, route: _r, gates: _g, color: _c, reward: _w, revision: _v, createdAt: _ca, updatedAt: _ua, ...rest } = v;
363
+ return {
364
+ ...rest,
365
+ id: courseId,
366
+ title,
367
+ ...description ? { description } : {},
368
+ origin: v.origin === "own" ? "own" : "given",
369
+ route: v.route === "ordered" ? "ordered" : "free",
370
+ gates,
371
+ ...color ? { color } : {},
372
+ ...reward ? { reward } : {},
373
+ revision: Number.isFinite(revision) && revision >= 1 ? revision : 1,
374
+ createdAt: str(v.createdAt) ?? at,
375
+ updatedAt: str(v.updatedAt) ?? at
376
+ };
377
+ }
378
+ function parseCourses(input, now) {
379
+ const errors = [];
380
+ let list;
381
+ if (isObj(input) && input.format === "sekisho-courses") {
382
+ if (input.version !== 1) return { courses: [], errors: ["\u3053\u306E\u30D5\u30A1\u30A4\u30EB\u306F\u65B0\u3057\u3044\u7248\u306E\u30A2\u30D7\u30EA\u3067\u4F5C\u3089\u308C\u3066\u3044\u307E\u3059\u3002\u30A2\u30D7\u30EA\u3092\u65B0\u3057\u304F\u3057\u3066\u304F\u3060\u3055\u3044"] };
383
+ list = Array.isArray(input.courses) ? input.courses : [];
384
+ } else if (Array.isArray(input)) {
385
+ list = input;
386
+ } else if (isObj(input)) {
387
+ list = [input];
388
+ } else {
389
+ return { courses: [], errors: ["\u30B3\u30FC\u30B9\u306E\u5F62\u3067\u306F\u3042\u308A\u307E\u305B\u3093"] };
390
+ }
391
+ const seen = /* @__PURE__ */ new Set();
392
+ const courses = [];
393
+ for (const v of list) {
394
+ const c = readCourse(v, now, errors);
395
+ if (!c) continue;
396
+ if (seen.has(c.id)) {
397
+ errors.push(`\u30B3\u30FC\u30B9\u300C${c.title}\u300D\u304C 2 \u3064\u3042\u3063\u305F\u306E\u3067\u3001\u3042\u3068\u306E\u307B\u3046\u3092\u98DB\u3070\u3057\u307E\u3057\u305F`);
398
+ continue;
399
+ }
400
+ seen.add(c.id);
401
+ courses.push(c);
402
+ }
403
+ return { courses, errors };
404
+ }
405
+ function importCourses(data, incoming, now) {
406
+ const local = new Map(data.courses.map((c) => [c.id, c]));
407
+ const added = [];
408
+ const updated = [];
409
+ const skipped = [];
410
+ for (const raw of incoming) {
411
+ const c = { ...raw, origin: "given" };
412
+ const mine = local.get(c.id);
413
+ if (!mine) added.push(c);
414
+ else if (mine.origin === "own") skipped.push(c);
415
+ else if (c.revision > mine.revision || c.revision === mine.revision && c.updatedAt > mine.updatedAt) updated.push(c);
416
+ else skipped.push(c);
417
+ }
418
+ const put = [...added, ...updated];
419
+ if (put.length === 0) return { changes: {}, added, updated, skipped };
420
+ const ids = new Set(put.map((c) => c.id));
421
+ const next = { ...data, courses: [...data.courses.filter((c) => !ids.has(c.id)), ...put] };
422
+ const settled = settleClears(next, now, [...ids]);
423
+ return { changes: { courses: put, ...settled }, added, updated, skipped };
424
+ }
425
+
426
+ export {
427
+ progressId,
428
+ clearId,
429
+ lapId,
430
+ itemGoal,
431
+ currentLap,
432
+ isGateOpen,
433
+ viewCourse,
434
+ addOne,
435
+ removeOne,
436
+ checkItem,
437
+ uncheckItem,
438
+ toggleItem,
439
+ sameTarget,
440
+ report,
441
+ settleClears,
442
+ nextLap,
443
+ restartCourse,
444
+ deleteCourse,
445
+ applyChanges,
446
+ newerProgress,
447
+ exportCourses,
448
+ readCourse,
449
+ parseCourses,
450
+ importCourses
451
+ };
452
+ //# sourceMappingURL=chunk-7YUKMUSF.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"sources":["../src/core/progress.ts","../src/core/io.ts"],"sourcesContent":["/**\n * 進み具合の計算(画面なし)。\n * 関数はデータを書き換えず、変更(Changes)を返す。保存はアプリがして、applyChanges で手元にも当てる。\n *\n * 周回: 進み具合とクリアの記録は「何周目のものか」(round)を持ち、今の周のものだけを数える。\n * 「もう一周する」(nextLap)で周回の記録(Lap)を残して次の周へ、「はじめからやり直す」(restartCourse)で 1 周目に戻る。\n */\nimport type { Activity, Changes, CheckItem, Clear, ClearEvent, Course, Gate, ItemProgress, Lap, SekishoData, TargetRef } from './types'\n\n/** 進み具合の id */\nexport const progressId = (courseId: string, itemId: string) => `${courseId}|${itemId}`\n\n/** クリアの記録の id。gateId が無ければコースを全部クリアした記録 */\nexport const clearId = (courseId: string, gateId?: string) => `${courseId}|${gateId ?? '*'}`\n\n/** 周回の記録の id */\nexport const lapId = (courseId: string, round: number) => `${courseId}|${round}`\n\n/** 項目の回数(無ければ 1。1 より小さい・数でないものも 1) */\nexport function itemGoal(item: Pick<CheckItem, 'count'>): number {\n const n = Math.floor(Number(item.count ?? 1))\n return Number.isFinite(n) && n >= 1 ? n : 1\n}\n\n// ─── 見るための形 ─────────────────────────────────────\n\nexport interface ItemView {\n item: CheckItem\n /** 今の回数 */\n done: number\n /** 回数(無ければ 1) */\n goal: number\n complete: boolean\n}\n\nexport interface GateView {\n gate: Gate\n index: number\n items: ItemView[]\n /** 済んだ項目の数 */\n done: number\n /** 項目の数 */\n total: number\n /** 今、項目が全部済んでいるか */\n complete: boolean\n /** この周でクリアの記録があるか(一度クリアしたら、項目を外しても true のまま) */\n cleared: boolean\n clearedAt?: string\n /** 開いているか(順番のコースでは、前の関所をクリアすると開く) */\n open: boolean\n}\n\nexport interface CourseView {\n course: Course\n gates: GateView[]\n /** この周でクリアした関所の数 */\n cleared: number\n /** 関所の数 */\n total: number\n /** この周でコースを全部クリアした記録があるか */\n complete: boolean\n clearedAt?: string\n /** 何周目か(画面に出す番号。はじめからやり直すと 1 に戻る) */\n lap: number\n /** これまでの周回の記録(古い順。隠したものは入れない) */\n laps: Lap[]\n /** この周で、何か進めたか(チェック・回数・クリアのどれか) */\n started: boolean\n}\n\n/** 計算のための入れ物(id から引けるようにしたもの) */\ninterface Ctx {\n progress: Map<string, ItemProgress>\n clears: Map<string, Clear>\n laps: Lap[]\n rounds: Map<string, number>\n}\n\nfunction makeCtx(data: Partial<SekishoData>): Ctx {\n const laps = data.laps ?? []\n const rounds = new Map<string, number>()\n for (const l of laps) rounds.set(l.courseId, Math.max(rounds.get(l.courseId) ?? 0, l.round))\n return {\n progress: new Map((data.progress ?? []).map((p) => [p.id, p])),\n clears: new Map((data.clears ?? []).map((c) => [c.id, c])),\n laps,\n rounds,\n }\n}\n\n/** 今が何周目か(中の番号。終えた周のいちばん大きい番号 + 1) */\nconst roundOf = (ctx: Ctx, courseId: string) => (ctx.rounds.get(courseId) ?? 0) + 1\nconst sameRound = (r: { round?: number } | undefined, round: number) => !!r && (r.round ?? 1) === round\n\n/** 今の周のクリアの記録 */\nfunction clearIn(ctx: Ctx, courseId: string, gateId: string | undefined, round: number): Clear | undefined {\n const c = ctx.clears.get(clearId(courseId, gateId))\n return sameRound(c, round) ? c : undefined\n}\n\nfunction doneOf(ctx: Ctx, courseId: string, item: CheckItem, round: number): number {\n const p = ctx.progress.get(progressId(courseId, item.id))\n const n = sameRound(p, round) ? p!.done : 0\n return Math.max(0, Math.min(itemGoal(item), n))\n}\n\nfunction openAt(ctx: Ctx, course: Course, index: number, round: number): boolean {\n if ((course.route ?? 'free') === 'free' || index <= 0) return true\n const gate = course.gates[index]\n const prev = course.gates[index - 1]\n // 前の関所をクリアしていれば開く。もうクリアした関所は、前に関所が足されても開いたまま\n return !!clearIn(ctx, course.id, prev.id, round) || (!!gate && !!clearIn(ctx, course.id, gate.id, round))\n}\n\n/** 今が何周目か(画面に出す番号) */\nexport function currentLap(data: Pick<SekishoData, 'laps'>, courseId: string): number {\n return (data.laps ?? []).filter((l) => l.courseId === courseId && !l.hidden).length + 1\n}\n\n/** 関所が開いているか */\nexport function isGateOpen(data: Pick<SekishoData, 'clears'> & Partial<SekishoData>, course: Course, gateId: string): boolean {\n const index = course.gates.findIndex((g) => g.id === gateId)\n const ctx = makeCtx(data)\n return index >= 0 && openAt(ctx, course, index, roundOf(ctx, course.id))\n}\n\nfunction viewWith(ctx: Ctx, course: Course): CourseView {\n const round = roundOf(ctx, course.id)\n const gates = course.gates.map((gate, index): GateView => {\n const items = gate.items.map((item): ItemView => {\n const goal = itemGoal(item)\n const done = doneOf(ctx, course.id, item, round)\n return { item, done, goal, complete: done >= goal }\n })\n const done = items.filter((i) => i.complete).length\n const clear = clearIn(ctx, course.id, gate.id, round)\n return {\n gate,\n index,\n items,\n done,\n total: items.length,\n complete: items.length > 0 && done === items.length,\n cleared: !!clear,\n ...(clear ? { clearedAt: clear.clearedAt } : {}),\n open: openAt(ctx, course, index, round),\n }\n })\n const courseClear = clearIn(ctx, course.id, undefined, round)\n const laps = ctx.laps.filter((l) => l.courseId === course.id && !l.hidden).sort((a, b) => a.round - b.round)\n const cleared = gates.filter((g) => g.cleared).length\n return {\n course,\n gates,\n cleared,\n total: gates.length,\n complete: !!courseClear,\n ...(courseClear ? { clearedAt: courseClear.clearedAt } : {}),\n lap: laps.length + 1,\n laps,\n started: cleared > 0 || gates.some((g) => g.items.some((i) => i.done > 0)),\n }\n}\n\n/** コースの進み具合(関所ごと・項目ごと・何周目か)。画面はこれを描く */\nexport function viewCourse(data: SekishoData, course: Course): CourseView {\n return viewWith(makeCtx(data), course)\n}\n\n// ─── 進める・戻す ─────────────────────────────────────\n\ninterface Step {\n courseId: string\n itemId: string\n next: (done: number, goal: number) => number\n}\n\nfunction findItem(course: Course, itemId: string): { gateIndex: number; item: CheckItem } | null {\n for (let gateIndex = 0; gateIndex < course.gates.length; gateIndex++) {\n const item = course.gates[gateIndex].items.find((i) => i.id === itemId)\n if (item) return { gateIndex, item }\n }\n return null\n}\n\nconst withRound = <T extends object>(r: T, round: number): T & { round?: number } => (round > 1 ? { ...r, round } : r)\n\n/**\n * この周でクリアの記録が無いのに項目が全部済んでいる関所を探して、記録と知らせを作る。\n * 関所を全部クリアしたコースには、コースの記録も作る\n */\nfunction detectClears(courses: Course[], ctx: Ctx, at: string): { clears: Clear[]; events: ClearEvent[] } {\n const added: Clear[] = []\n const events: ClearEvent[] = []\n for (const course of courses) {\n const round = roundOf(ctx, course.id)\n const view = viewWith(ctx, course)\n let cleared = view.cleared\n for (const g of view.gates) {\n if (g.cleared || !g.complete) continue\n const c = withRound<Clear>({ id: clearId(course.id, g.gate.id), courseId: course.id, gateId: g.gate.id, clearedAt: at }, round)\n ctx.clears.set(c.id, c)\n added.push(c)\n cleared++\n events.push({ kind: 'gate', course, gate: g.gate, cleared, total: view.total, at })\n }\n const allCleared = course.gates.length > 0 && course.gates.every((g) => clearIn(ctx, course.id, g.id, round))\n if (allCleared && !clearIn(ctx, course.id, undefined, round)) {\n const c = withRound<Clear>({ id: clearId(course.id), courseId: course.id, clearedAt: at }, round)\n ctx.clears.set(c.id, c)\n added.push(c)\n events.push({ kind: 'course', course, cleared: view.total, total: view.total, at })\n }\n }\n return { clears: added, events }\n}\n\nfunction applySteps(data: SekishoData, steps: Step[], now: Date): Changes {\n const at = now.toISOString()\n const ctx = makeCtx(data)\n const courses = new Map(data.courses.map((c) => [c.id, c]))\n const changed = new Map<string, ItemProgress>()\n const touched = new Set<string>()\n for (const step of steps) {\n const course = courses.get(step.courseId)\n if (!course) continue\n const round = roundOf(ctx, course.id)\n const found = findItem(course, step.itemId)\n // 順番のコースで、まだ開いていない関所の項目は進めない\n if (!found || !openAt(ctx, course, found.gateIndex, round)) continue\n const goal = itemGoal(found.item)\n const id = progressId(course.id, found.item.id)\n const before = ctx.progress.get(id)\n const done = doneOf(ctx, course.id, found.item, round)\n const next = Math.max(0, Math.min(goal, Math.floor(step.next(done, goal))))\n if (next === done) continue\n const keepCheckedAt = done >= goal && sameRound(before, round) ? before?.checkedAt : undefined\n const p = withRound<ItemProgress>(\n {\n id,\n courseId: course.id,\n itemId: found.item.id,\n done: next,\n ...(next >= goal ? { checkedAt: keepCheckedAt ?? at } : {}),\n updatedAt: at,\n },\n round,\n )\n ctx.progress.set(id, p)\n changed.set(id, p)\n touched.add(course.id)\n }\n if (changed.size === 0) return {}\n const found = detectClears(\n data.courses.filter((c) => touched.has(c.id)),\n ctx,\n at,\n )\n return {\n progress: [...changed.values()],\n ...(found.clears.length > 0 ? { clears: found.clears, events: found.events } : {}),\n }\n}\n\n/** 1 つ進める(「+1」。回数の無い項目なら済みにする) */\nexport function addOne(data: SekishoData, courseId: string, itemId: string, now: Date): Changes {\n return applySteps(data, [{ courseId, itemId, next: (d) => d + 1 }], now)\n}\n\n/** 1 つ戻す(まちがえたとき) */\nexport function removeOne(data: SekishoData, courseId: string, itemId: string, now: Date): Changes {\n return applySteps(data, [{ courseId, itemId, next: (d) => d - 1 }], now)\n}\n\n/** 済みにする(回数のある項目は、まとめて回数まで) */\nexport function checkItem(data: SekishoData, courseId: string, itemId: string, now: Date): Changes {\n return applySteps(data, [{ courseId, itemId, next: (_d, goal) => goal }], now)\n}\n\n/** 外す(回数は 0 に戻る。関所のクリアの記録は残る) */\nexport function uncheckItem(data: SekishoData, courseId: string, itemId: string, now: Date): Changes {\n return applySteps(data, [{ courseId, itemId, next: () => 0 }], now)\n}\n\n/** 済んでいれば外し、まだなら済みにする(チェック欄を押したとき) */\nexport function toggleItem(data: SekishoData, courseId: string, itemId: string, now: Date): Changes {\n return applySteps(data, [{ courseId, itemId, next: (d, goal) => (d >= goal ? 0 : goal) }], now)\n}\n\n/** target が同じか(type と id が同じ。ほかの項目は見ない) */\nexport function sameTarget(a: TargetRef | undefined, b: TargetRef | undefined): boolean {\n return !!a && !!b && a.type === b.type && (a.id ?? null) === (b.id ?? null)\n}\n\n/**\n * 自動のチェック。アプリが「これをした」と知らせると、target が同じチェック項目を、\n * 入っているコース全部で amount ずつ進める(回数の無い項目は済みにする)。\n * 数えるのは知らせを受けたときだけなので、コースを入れる前の練習はさかのぼらない\n */\nexport function report(data: SekishoData, activity: Activity, now: Date): Changes {\n const amount = Math.floor(Number(activity.amount ?? 1))\n if (!Number.isFinite(amount) || amount < 1) return {}\n const steps: Step[] = []\n for (const course of data.courses) {\n for (const gate of course.gates) {\n for (const item of gate.items) {\n if (sameTarget(item.target, activity.target)) steps.push({ courseId: course.id, itemId: item.id, next: (d) => d + amount })\n }\n }\n }\n return applySteps(data, steps, now)\n}\n\n/**\n * クリアの記録を整える。コースが新しい版になって項目が減ったときなど、\n * 進み具合は変わらないのに関所が全部済んだ状態になったら、ここでクリアにする。\n * courseIds を渡すと、そのコースだけを見る\n */\nexport function settleClears(data: SekishoData, now: Date, courseIds?: string[]): Changes {\n const only = courseIds ? new Set(courseIds) : null\n const courses = only ? data.courses.filter((c) => only.has(c.id)) : data.courses\n const found = detectClears(courses, makeCtx(data), now.toISOString())\n return found.clears.length > 0 ? { clears: found.clears, events: found.events } : {}\n}\n\n// ─── 周回 ─────────────────────────────────────\n\n/** そのコースの進み具合・クリアの記録の id(どの周のものも) */\nfunction courseRows(data: SekishoData, courseId: string) {\n return {\n progressIds: data.progress.filter((p) => p.courseId === courseId).map((p) => p.id),\n clearIds: data.clears.filter((c) => c.courseId === courseId).map((c) => c.id),\n }\n}\n\n/**\n * もう一周する: 今の周を周回の記録に残し、チェックとスタンプを空にして次の周へ進む。\n * 次の周でも、関所をクリアするとスタンプと演出がまた出る\n */\nexport function nextLap(data: SekishoData, courseId: string, now: Date): Changes {\n const course = data.courses.find((c) => c.id === courseId)\n if (!course) return {}\n const ctx = makeCtx(data)\n const round = roundOf(ctx, courseId)\n const view = viewWith(ctx, course)\n const lap: Lap = {\n id: lapId(courseId, round),\n courseId,\n round,\n endedAt: now.toISOString(),\n cleared: view.cleared,\n total: view.total,\n complete: view.complete,\n }\n const rows = courseRows(data, courseId)\n return { laps: [lap], deleteProgressIds: rows.progressIds, deleteClearIds: rows.clearIds }\n}\n\n/**\n * はじめからやり直す: チェック・スタンプ・周回の記録を全部消して、1 周目に戻る(画面の番号)。\n * 中の周の番号は進める(ほかの端末から古い周の記録が届いても、今の周に混ざらないように)\n */\nexport function restartCourse(data: SekishoData, courseId: string, now: Date): Changes {\n if (!data.courses.some((c) => c.id === courseId)) return {}\n const ctx = makeCtx(data)\n const round = roundOf(ctx, courseId)\n const hiddenLaps = ctx.laps.filter((l) => l.courseId === courseId && !l.hidden).map((l) => ({ ...l, hidden: true }))\n const marker: Lap = { id: lapId(courseId, round), courseId, round, endedAt: now.toISOString(), cleared: 0, total: 0, complete: false, hidden: true }\n const rows = courseRows(data, courseId)\n return { laps: [...hiddenLaps, marker], deleteProgressIds: rows.progressIds, deleteClearIds: rows.clearIds }\n}\n\n// ─── 保存・同期のための道具 ─────────────────────────────────\n\n/** コースを消す(進み具合・クリアの記録・周回の記録も一緒に) */\nexport function deleteCourse(data: SekishoData, courseId: string): Changes {\n const rows = courseRows(data, courseId)\n return {\n deleteCourseIds: data.courses.some((c) => c.id === courseId) ? [courseId] : [],\n deleteProgressIds: rows.progressIds,\n deleteClearIds: rows.clearIds,\n deleteLapIds: (data.laps ?? []).filter((l) => l.courseId === courseId).map((l) => l.id),\n }\n}\n\nfunction upsert<T extends { id: string }>(rows: T[], put: T[] | undefined, del: string[] | undefined): T[] {\n if (!put?.length && !del?.length) return rows\n const drop = new Set(del ?? [])\n const byId = new Map(rows.filter((r) => !drop.has(r.id)).map((r) => [r.id, r]))\n for (const r of put ?? []) byId.set(r.id, r)\n return [...byId.values()]\n}\n\n/** 変更を手元のデータに当てる(新しいデータを返す。元は変えない) */\nexport function applyChanges<T extends SekishoData>(data: T, changes: Changes): T {\n return {\n ...data,\n courses: upsert(data.courses, changes.courses, changes.deleteCourseIds),\n progress: upsert(data.progress, changes.progress, changes.deleteProgressIds),\n clears: upsert(data.clears, changes.clears, changes.deleteClearIds),\n laps: upsert(data.laps ?? [], changes.laps, changes.deleteLapIds),\n }\n}\n\n/**\n * 同期・追記で、ほかの端末の進み具合を受け取ったとき、書き直すものを返す。\n * 手元に無いもの・手元より新しい(updatedAt が後の)ものだけ。\n * クリアの記録は消えないので、手元に無い id のものを足すだけでよい\n */\nexport function newerProgress(local: ItemProgress[], incoming: ItemProgress[]): ItemProgress[] {\n const byId = new Map(local.map((p) => [p.id, p]))\n return incoming.filter((p) => {\n const mine = byId.get(p.id)\n return !mine || p.updatedAt > mine.updatedAt\n })\n}\n","/**\n * コースの書き出し・読み込み(JSON)。\n * 配る形(パックなど)はアプリが決める。部品は「コースの JSON」を作る・確かめる・取り込むだけ。\n */\nimport { settleClears } from './progress'\nimport type { Changes, CheckItem, Course, Gate, RewardRef, SekishoData, TargetRef } from './types'\n\n/** コースのファイルの形 */\nexport interface SekishoFile {\n format: 'sekisho-courses'\n version: 1\n courses: Course[]\n}\n\n/**\n * コースを書き出す(配る用)。\n * 受け取った人のところでは与えられたコースになるように、origin は 'given' にする\n */\nexport function exportCourses(courses: Course[]): SekishoFile {\n return {\n format: 'sekisho-courses',\n version: 1,\n courses: courses.map((c) => ({ ...structuredClone(c), origin: 'given' as const })),\n }\n}\n\n// ─── 形を確かめる ─────────────────────────────────────\n\ntype Obj = Record<string, unknown>\nconst isObj = (v: unknown): v is Obj => typeof v === 'object' && v !== null && !Array.isArray(v)\nconst str = (v: unknown): string | undefined => (typeof v === 'string' ? v : undefined)\nconst text = (v: unknown): string | undefined => {\n const s = str(v)?.trim()\n return s ? s : undefined\n}\nconst id = (v: unknown): string | undefined => {\n const s = str(v)?.trim()\n return s && s.length <= 200 ? s : undefined\n}\nconst MAX_COUNT = 9999\n\nfunction ref<T extends TargetRef | RewardRef>(v: unknown): T | undefined {\n if (!isObj(v) || !text(v.type)) return undefined\n const out = { ...v, type: text(v.type)! } as T\n if ('id' in out && out.id !== undefined && typeof out.id !== 'string') return undefined\n return out\n}\n\nfunction readItem(v: unknown, seen: Set<string>, errors: string[], where: string): CheckItem | null {\n if (!isObj(v)) return null\n const itemId = id(v.id)\n const title = text(v.title)\n if (!itemId || !title || seen.has(itemId)) {\n errors.push(`${where}: チェック項目を 1 つ飛ばしました(id・名前が無いか、同じ id があります)`)\n return null\n }\n seen.add(itemId)\n const count = Math.floor(Number(v.count))\n const target = ref<TargetRef>(v.target)\n const note = text(v.note)\n const { id: _i, title: _t, note: _n, target: _g, count: _c, ...rest } = v\n return {\n ...rest,\n id: itemId,\n title,\n ...(note ? { note } : {}),\n ...(target ? { target } : {}),\n ...(Number.isFinite(count) && count > 1 ? { count: Math.min(count, MAX_COUNT) } : {}),\n }\n}\n\nfunction readGate(v: unknown, seenGates: Set<string>, seenItems: Set<string>, errors: string[], where: string): Gate | null {\n if (!isObj(v)) return null\n const gateId = id(v.id)\n const title = text(v.title)\n if (!gateId || !title || seenGates.has(gateId)) {\n errors.push(`${where}: 関所を 1 つ飛ばしました(id・名前が無いか、同じ id があります)`)\n return null\n }\n seenGates.add(gateId)\n const items = (Array.isArray(v.items) ? v.items : [])\n .map((i) => readItem(i, seenItems, errors, `${where}「${title}」`))\n .filter((i): i is CheckItem => i !== null)\n const description = text(v.description)\n const reward = ref<RewardRef>(v.reward)\n const stamp = isObj(v.stamp)\n ? { ...(text(v.stamp.text) ? { text: text(v.stamp.text) } : {}), ...(text(v.stamp.color) ? { color: text(v.stamp.color) } : {}) }\n : undefined\n const points = Number(v.points)\n const order = isObj(v.board) ? Number(v.board.order) : NaN\n const column = isObj(v.board) ? Number(v.board.column) : NaN\n const board = Number.isFinite(order) ? { order, ...(Number.isInteger(column) && column >= 0 ? { column } : {}) } : undefined\n const { id: _i, title: _t, description: _d, items: _it, stamp: _s, reward: _r, points: _p, board: _b, ...rest } = v\n return {\n ...rest,\n id: gateId,\n title,\n ...(description ? { description } : {}),\n items,\n ...(stamp && Object.keys(stamp).length > 0 ? { stamp } : {}),\n ...(reward ? { reward } : {}),\n ...(Number.isFinite(points) && v.points !== undefined ? { points } : {}),\n ...(board ? { board } : {}),\n }\n}\n\n/** 1 つのコースの形を確かめる。使えなければ null(errors にわけを足す) */\nexport function readCourse(v: unknown, now: Date, errors: string[] = []): Course | null {\n if (!isObj(v)) return null\n const courseId = id(v.id)\n const title = text(v.title)\n if (!courseId || !title) {\n errors.push('コースを 1 つ飛ばしました(id か名前がありません)')\n return null\n }\n const where = `コース「${title}」`\n const seenGates = new Set<string>()\n const seenItems = new Set<string>()\n const gates = (Array.isArray(v.gates) ? v.gates : [])\n .map((g) => readGate(g, seenGates, seenItems, errors, where))\n .filter((g): g is Gate => g !== null)\n const at = now.toISOString()\n const revision = Math.floor(Number(v.revision))\n const description = text(v.description)\n const color = text(v.color)\n const reward = ref<RewardRef>(v.reward)\n const { id: _i, title: _t, description: _d, origin: _o, route: _r, gates: _g, color: _c, reward: _w, revision: _v, createdAt: _ca, updatedAt: _ua, ...rest } = v\n return {\n ...rest,\n id: courseId,\n title,\n ...(description ? { description } : {}),\n origin: v.origin === 'own' ? 'own' : 'given',\n route: v.route === 'ordered' ? 'ordered' : 'free',\n gates,\n ...(color ? { color } : {}),\n ...(reward ? { reward } : {}),\n revision: Number.isFinite(revision) && revision >= 1 ? revision : 1,\n createdAt: str(v.createdAt) ?? at,\n updatedAt: str(v.updatedAt) ?? at,\n }\n}\n\n/**\n * コースの JSON を読む。コースのファイル(SekishoFile)・コースの並び・コース 1 つ、のどれでもよい。\n * 形の合わないところは飛ばして、わけを errors に入れる\n */\nexport function parseCourses(input: unknown, now: Date): { courses: Course[]; errors: string[] } {\n const errors: string[] = []\n let list: unknown[]\n if (isObj(input) && input.format === 'sekisho-courses') {\n if (input.version !== 1) return { courses: [], errors: ['このファイルは新しい版のアプリで作られています。アプリを新しくしてください'] }\n list = Array.isArray(input.courses) ? input.courses : []\n } else if (Array.isArray(input)) {\n list = input\n } else if (isObj(input)) {\n list = [input]\n } else {\n return { courses: [], errors: ['コースの形ではありません'] }\n }\n const seen = new Set<string>()\n const courses: Course[] = []\n for (const v of list) {\n const c = readCourse(v, now, errors)\n if (!c) continue\n if (seen.has(c.id)) {\n errors.push(`コース「${c.title}」が 2 つあったので、あとのほうを飛ばしました`)\n continue\n }\n seen.add(c.id)\n courses.push(c)\n }\n return { courses, errors }\n}\n\n// ─── 取り込む ─────────────────────────────────────\n\nexport interface ImportResult {\n changes: Changes\n /** 新しく入れたコース */\n added: Course[]\n /** 新しい版にしたコース */\n updated: Course[]\n /** 入れなかったコース(同じか古い版・同じ id の自分のコース) */\n skipped: Course[]\n}\n\n/**\n * 配られたコースを取り込む(パックを取り込んだときなど)。\n * - この端末に無いコースは足す\n * - あるコースは、配られたほうが新しい版(revision が大きい。同じなら updatedAt が後)のときだけ置きかえる。\n * 進み具合はチェック項目の id で結びつくので残る。一度クリアした関所はクリアのまま\n * - 同じ id の自分のコースは置きかえない\n * 取り込んだコースは与えられたコース(origin: 'given')になる\n */\nexport function importCourses(data: SekishoData, incoming: Course[], now: Date): ImportResult {\n const local = new Map(data.courses.map((c) => [c.id, c]))\n const added: Course[] = []\n const updated: Course[] = []\n const skipped: Course[] = []\n for (const raw of incoming) {\n const c: Course = { ...raw, origin: 'given' }\n const mine = local.get(c.id)\n if (!mine) added.push(c)\n else if (mine.origin === 'own') skipped.push(c)\n else if (c.revision > mine.revision || (c.revision === mine.revision && c.updatedAt > mine.updatedAt)) updated.push(c)\n else skipped.push(c)\n }\n const put = [...added, ...updated]\n if (put.length === 0) return { changes: {}, added, updated, skipped }\n // 項目が減って、もう全部済んでいる関所があれば、ここでクリアにする\n const ids = new Set(put.map((c) => c.id))\n const next: SekishoData = { ...data, courses: [...data.courses.filter((c) => !ids.has(c.id)), ...put] }\n const settled = settleClears(next, now, [...ids])\n return { changes: { courses: put, ...settled }, added, updated, skipped }\n}\n"],"mappings":";;;AAUO,IAAM,aAAa,CAAC,UAAkB,WAAmB,GAAG,QAAQ,IAAI,MAAM;AAG9E,IAAM,UAAU,CAAC,UAAkB,WAAoB,GAAG,QAAQ,IAAI,UAAU,GAAG;AAGnF,IAAM,QAAQ,CAAC,UAAkB,UAAkB,GAAG,QAAQ,IAAI,KAAK;AAGvE,SAAS,SAAS,MAAwC;AAC/D,QAAM,IAAI,KAAK,MAAM,OAAO,KAAK,SAAS,CAAC,CAAC;AAC5C,SAAO,OAAO,SAAS,CAAC,KAAK,KAAK,IAAI,IAAI;AAC5C;AAwDA,SAAS,QAAQ,MAAiC;AAChD,QAAM,OAAO,KAAK,QAAQ,CAAC;AAC3B,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,KAAK,KAAM,QAAO,IAAI,EAAE,UAAU,KAAK,IAAI,OAAO,IAAI,EAAE,QAAQ,KAAK,GAAG,EAAE,KAAK,CAAC;AAC3F,SAAO;AAAA,IACL,UAAU,IAAI,KAAK,KAAK,YAAY,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAAA,IAC7D,QAAQ,IAAI,KAAK,KAAK,UAAU,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAAA,IACzD;AAAA,IACA;AAAA,EACF;AACF;AAGA,IAAM,UAAU,CAAC,KAAU,cAAsB,IAAI,OAAO,IAAI,QAAQ,KAAK,KAAK;AAClF,IAAM,YAAY,CAAC,GAAmC,UAAkB,CAAC,CAAC,MAAM,EAAE,SAAS,OAAO;AAGlG,SAAS,QAAQ,KAAU,UAAkB,QAA4B,OAAkC;AACzG,QAAM,IAAI,IAAI,OAAO,IAAI,QAAQ,UAAU,MAAM,CAAC;AAClD,SAAO,UAAU,GAAG,KAAK,IAAI,IAAI;AACnC;AAEA,SAAS,OAAO,KAAU,UAAkB,MAAiB,OAAuB;AAClF,QAAM,IAAI,IAAI,SAAS,IAAI,WAAW,UAAU,KAAK,EAAE,CAAC;AACxD,QAAM,IAAI,UAAU,GAAG,KAAK,IAAI,EAAG,OAAO;AAC1C,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,SAAS,IAAI,GAAG,CAAC,CAAC;AAChD;AAEA,SAAS,OAAO,KAAU,QAAgB,OAAe,OAAwB;AAC/E,OAAK,OAAO,SAAS,YAAY,UAAU,SAAS,EAAG,QAAO;AAC9D,QAAM,OAAO,OAAO,MAAM,KAAK;AAC/B,QAAM,OAAO,OAAO,MAAM,QAAQ,CAAC;AAEnC,SAAO,CAAC,CAAC,QAAQ,KAAK,OAAO,IAAI,KAAK,IAAI,KAAK,KAAM,CAAC,CAAC,QAAQ,CAAC,CAAC,QAAQ,KAAK,OAAO,IAAI,KAAK,IAAI,KAAK;AACzG;AAGO,SAAS,WAAW,MAAiC,UAA0B;AACpF,UAAQ,KAAK,QAAQ,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,aAAa,YAAY,CAAC,EAAE,MAAM,EAAE,SAAS;AACxF;AAGO,SAAS,WAAW,MAA0D,QAAgB,QAAyB;AAC5H,QAAM,QAAQ,OAAO,MAAM,UAAU,CAAC,MAAM,EAAE,OAAO,MAAM;AAC3D,QAAM,MAAM,QAAQ,IAAI;AACxB,SAAO,SAAS,KAAK,OAAO,KAAK,QAAQ,OAAO,QAAQ,KAAK,OAAO,EAAE,CAAC;AACzE;AAEA,SAAS,SAAS,KAAU,QAA4B;AACtD,QAAM,QAAQ,QAAQ,KAAK,OAAO,EAAE;AACpC,QAAM,QAAQ,OAAO,MAAM,IAAI,CAAC,MAAM,UAAoB;AACxD,UAAM,QAAQ,KAAK,MAAM,IAAI,CAAC,SAAmB;AAC/C,YAAM,OAAO,SAAS,IAAI;AAC1B,YAAMA,QAAO,OAAO,KAAK,OAAO,IAAI,MAAM,KAAK;AAC/C,aAAO,EAAE,MAAM,MAAAA,OAAM,MAAM,UAAUA,SAAQ,KAAK;AAAA,IACpD,CAAC;AACD,UAAM,OAAO,MAAM,OAAO,CAAC,MAAM,EAAE,QAAQ,EAAE;AAC7C,UAAM,QAAQ,QAAQ,KAAK,OAAO,IAAI,KAAK,IAAI,KAAK;AACpD,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,OAAO,MAAM;AAAA,MACb,UAAU,MAAM,SAAS,KAAK,SAAS,MAAM;AAAA,MAC7C,SAAS,CAAC,CAAC;AAAA,MACX,GAAI,QAAQ,EAAE,WAAW,MAAM,UAAU,IAAI,CAAC;AAAA,MAC9C,MAAM,OAAO,KAAK,QAAQ,OAAO,KAAK;AAAA,IACxC;AAAA,EACF,CAAC;AACD,QAAM,cAAc,QAAQ,KAAK,OAAO,IAAI,QAAW,KAAK;AAC5D,QAAM,OAAO,IAAI,KAAK,OAAO,CAAC,MAAM,EAAE,aAAa,OAAO,MAAM,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAC3G,QAAM,UAAU,MAAM,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE;AAC/C,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAO,MAAM;AAAA,IACb,UAAU,CAAC,CAAC;AAAA,IACZ,GAAI,cAAc,EAAE,WAAW,YAAY,UAAU,IAAI,CAAC;AAAA,IAC1D,KAAK,KAAK,SAAS;AAAA,IACnB;AAAA,IACA,SAAS,UAAU,KAAK,MAAM,KAAK,CAAC,MAAM,EAAE,MAAM,KAAK,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AAAA,EAC3E;AACF;AAGO,SAAS,WAAW,MAAmB,QAA4B;AACxE,SAAO,SAAS,QAAQ,IAAI,GAAG,MAAM;AACvC;AAUA,SAAS,SAAS,QAAgB,QAA+D;AAC/F,WAAS,YAAY,GAAG,YAAY,OAAO,MAAM,QAAQ,aAAa;AACpE,UAAM,OAAO,OAAO,MAAM,SAAS,EAAE,MAAM,KAAK,CAAC,MAAM,EAAE,OAAO,MAAM;AACtE,QAAI,KAAM,QAAO,EAAE,WAAW,KAAK;AAAA,EACrC;AACA,SAAO;AACT;AAEA,IAAM,YAAY,CAAmB,GAAM,UAA2C,QAAQ,IAAI,EAAE,GAAG,GAAG,MAAM,IAAI;AAMpH,SAAS,aAAa,SAAmB,KAAU,IAAuD;AACxG,QAAM,QAAiB,CAAC;AACxB,QAAM,SAAuB,CAAC;AAC9B,aAAW,UAAU,SAAS;AAC5B,UAAM,QAAQ,QAAQ,KAAK,OAAO,EAAE;AACpC,UAAM,OAAO,SAAS,KAAK,MAAM;AACjC,QAAI,UAAU,KAAK;AACnB,eAAW,KAAK,KAAK,OAAO;AAC1B,UAAI,EAAE,WAAW,CAAC,EAAE,SAAU;AAC9B,YAAM,IAAI,UAAiB,EAAE,IAAI,QAAQ,OAAO,IAAI,EAAE,KAAK,EAAE,GAAG,UAAU,OAAO,IAAI,QAAQ,EAAE,KAAK,IAAI,WAAW,GAAG,GAAG,KAAK;AAC9H,UAAI,OAAO,IAAI,EAAE,IAAI,CAAC;AACtB,YAAM,KAAK,CAAC;AACZ;AACA,aAAO,KAAK,EAAE,MAAM,QAAQ,QAAQ,MAAM,EAAE,MAAM,SAAS,OAAO,KAAK,OAAO,GAAG,CAAC;AAAA,IACpF;AACA,UAAM,aAAa,OAAO,MAAM,SAAS,KAAK,OAAO,MAAM,MAAM,CAAC,MAAM,QAAQ,KAAK,OAAO,IAAI,EAAE,IAAI,KAAK,CAAC;AAC5G,QAAI,cAAc,CAAC,QAAQ,KAAK,OAAO,IAAI,QAAW,KAAK,GAAG;AAC5D,YAAM,IAAI,UAAiB,EAAE,IAAI,QAAQ,OAAO,EAAE,GAAG,UAAU,OAAO,IAAI,WAAW,GAAG,GAAG,KAAK;AAChG,UAAI,OAAO,IAAI,EAAE,IAAI,CAAC;AACtB,YAAM,KAAK,CAAC;AACZ,aAAO,KAAK,EAAE,MAAM,UAAU,QAAQ,SAAS,KAAK,OAAO,OAAO,KAAK,OAAO,GAAG,CAAC;AAAA,IACpF;AAAA,EACF;AACA,SAAO,EAAE,QAAQ,OAAO,OAAO;AACjC;AAEA,SAAS,WAAW,MAAmB,OAAe,KAAoB;AACxE,QAAM,KAAK,IAAI,YAAY;AAC3B,QAAM,MAAM,QAAQ,IAAI;AACxB,QAAM,UAAU,IAAI,IAAI,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAC1D,QAAM,UAAU,oBAAI,IAA0B;AAC9C,QAAM,UAAU,oBAAI,IAAY;AAChC,aAAW,QAAQ,OAAO;AACxB,UAAM,SAAS,QAAQ,IAAI,KAAK,QAAQ;AACxC,QAAI,CAAC,OAAQ;AACb,UAAM,QAAQ,QAAQ,KAAK,OAAO,EAAE;AACpC,UAAMC,SAAQ,SAAS,QAAQ,KAAK,MAAM;AAE1C,QAAI,CAACA,UAAS,CAAC,OAAO,KAAK,QAAQA,OAAM,WAAW,KAAK,EAAG;AAC5D,UAAM,OAAO,SAASA,OAAM,IAAI;AAChC,UAAMC,MAAK,WAAW,OAAO,IAAID,OAAM,KAAK,EAAE;AAC9C,UAAM,SAAS,IAAI,SAAS,IAAIC,GAAE;AAClC,UAAM,OAAO,OAAO,KAAK,OAAO,IAAID,OAAM,MAAM,KAAK;AACrD,UAAM,OAAO,KAAK,IAAI,GAAG,KAAK,IAAI,MAAM,KAAK,MAAM,KAAK,KAAK,MAAM,IAAI,CAAC,CAAC,CAAC;AAC1E,QAAI,SAAS,KAAM;AACnB,UAAM,gBAAgB,QAAQ,QAAQ,UAAU,QAAQ,KAAK,IAAI,QAAQ,YAAY;AACrF,UAAM,IAAI;AAAA,MACR;AAAA,QACE,IAAAC;AAAA,QACA,UAAU,OAAO;AAAA,QACjB,QAAQD,OAAM,KAAK;AAAA,QACnB,MAAM;AAAA,QACN,GAAI,QAAQ,OAAO,EAAE,WAAW,iBAAiB,GAAG,IAAI,CAAC;AAAA,QACzD,WAAW;AAAA,MACb;AAAA,MACA;AAAA,IACF;AACA,QAAI,SAAS,IAAIC,KAAI,CAAC;AACtB,YAAQ,IAAIA,KAAI,CAAC;AACjB,YAAQ,IAAI,OAAO,EAAE;AAAA,EACvB;AACA,MAAI,QAAQ,SAAS,EAAG,QAAO,CAAC;AAChC,QAAM,QAAQ;AAAA,IACZ,KAAK,QAAQ,OAAO,CAAC,MAAM,QAAQ,IAAI,EAAE,EAAE,CAAC;AAAA,IAC5C;AAAA,IACA;AAAA,EACF;AACA,SAAO;AAAA,IACL,UAAU,CAAC,GAAG,QAAQ,OAAO,CAAC;AAAA,IAC9B,GAAI,MAAM,OAAO,SAAS,IAAI,EAAE,QAAQ,MAAM,QAAQ,QAAQ,MAAM,OAAO,IAAI,CAAC;AAAA,EAClF;AACF;AAGO,SAAS,OAAO,MAAmB,UAAkB,QAAgB,KAAoB;AAC9F,SAAO,WAAW,MAAM,CAAC,EAAE,UAAU,QAAQ,MAAM,CAAC,MAAM,IAAI,EAAE,CAAC,GAAG,GAAG;AACzE;AAGO,SAAS,UAAU,MAAmB,UAAkB,QAAgB,KAAoB;AACjG,SAAO,WAAW,MAAM,CAAC,EAAE,UAAU,QAAQ,MAAM,CAAC,MAAM,IAAI,EAAE,CAAC,GAAG,GAAG;AACzE;AAGO,SAAS,UAAU,MAAmB,UAAkB,QAAgB,KAAoB;AACjG,SAAO,WAAW,MAAM,CAAC,EAAE,UAAU,QAAQ,MAAM,CAAC,IAAI,SAAS,KAAK,CAAC,GAAG,GAAG;AAC/E;AAGO,SAAS,YAAY,MAAmB,UAAkB,QAAgB,KAAoB;AACnG,SAAO,WAAW,MAAM,CAAC,EAAE,UAAU,QAAQ,MAAM,MAAM,EAAE,CAAC,GAAG,GAAG;AACpE;AAGO,SAAS,WAAW,MAAmB,UAAkB,QAAgB,KAAoB;AAClG,SAAO,WAAW,MAAM,CAAC,EAAE,UAAU,QAAQ,MAAM,CAAC,GAAG,SAAU,KAAK,OAAO,IAAI,KAAM,CAAC,GAAG,GAAG;AAChG;AAGO,SAAS,WAAW,GAA0B,GAAmC;AACtF,SAAO,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,WAAW,EAAE,MAAM;AACxE;AAOO,SAAS,OAAO,MAAmB,UAAoB,KAAoB;AAChF,QAAM,SAAS,KAAK,MAAM,OAAO,SAAS,UAAU,CAAC,CAAC;AACtD,MAAI,CAAC,OAAO,SAAS,MAAM,KAAK,SAAS,EAAG,QAAO,CAAC;AACpD,QAAM,QAAgB,CAAC;AACvB,aAAW,UAAU,KAAK,SAAS;AACjC,eAAW,QAAQ,OAAO,OAAO;AAC/B,iBAAW,QAAQ,KAAK,OAAO;AAC7B,YAAI,WAAW,KAAK,QAAQ,SAAS,MAAM,EAAG,OAAM,KAAK,EAAE,UAAU,OAAO,IAAI,QAAQ,KAAK,IAAI,MAAM,CAAC,MAAM,IAAI,OAAO,CAAC;AAAA,MAC5H;AAAA,IACF;AAAA,EACF;AACA,SAAO,WAAW,MAAM,OAAO,GAAG;AACpC;AAOO,SAAS,aAAa,MAAmB,KAAW,WAA+B;AACxF,QAAM,OAAO,YAAY,IAAI,IAAI,SAAS,IAAI;AAC9C,QAAM,UAAU,OAAO,KAAK,QAAQ,OAAO,CAAC,MAAM,KAAK,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK;AACzE,QAAM,QAAQ,aAAa,SAAS,QAAQ,IAAI,GAAG,IAAI,YAAY,CAAC;AACpE,SAAO,MAAM,OAAO,SAAS,IAAI,EAAE,QAAQ,MAAM,QAAQ,QAAQ,MAAM,OAAO,IAAI,CAAC;AACrF;AAKA,SAAS,WAAW,MAAmB,UAAkB;AACvD,SAAO;AAAA,IACL,aAAa,KAAK,SAAS,OAAO,CAAC,MAAM,EAAE,aAAa,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE;AAAA,IACjF,UAAU,KAAK,OAAO,OAAO,CAAC,MAAM,EAAE,aAAa,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE;AAAA,EAC9E;AACF;AAMO,SAAS,QAAQ,MAAmB,UAAkB,KAAoB;AAC/E,QAAM,SAAS,KAAK,QAAQ,KAAK,CAAC,MAAM,EAAE,OAAO,QAAQ;AACzD,MAAI,CAAC,OAAQ,QAAO,CAAC;AACrB,QAAM,MAAM,QAAQ,IAAI;AACxB,QAAM,QAAQ,QAAQ,KAAK,QAAQ;AACnC,QAAM,OAAO,SAAS,KAAK,MAAM;AACjC,QAAM,MAAW;AAAA,IACf,IAAI,MAAM,UAAU,KAAK;AAAA,IACzB;AAAA,IACA;AAAA,IACA,SAAS,IAAI,YAAY;AAAA,IACzB,SAAS,KAAK;AAAA,IACd,OAAO,KAAK;AAAA,IACZ,UAAU,KAAK;AAAA,EACjB;AACA,QAAM,OAAO,WAAW,MAAM,QAAQ;AACtC,SAAO,EAAE,MAAM,CAAC,GAAG,GAAG,mBAAmB,KAAK,aAAa,gBAAgB,KAAK,SAAS;AAC3F;AAMO,SAAS,cAAc,MAAmB,UAAkB,KAAoB;AACrF,MAAI,CAAC,KAAK,QAAQ,KAAK,CAAC,MAAM,EAAE,OAAO,QAAQ,EAAG,QAAO,CAAC;AAC1D,QAAM,MAAM,QAAQ,IAAI;AACxB,QAAM,QAAQ,QAAQ,KAAK,QAAQ;AACnC,QAAM,aAAa,IAAI,KAAK,OAAO,CAAC,MAAM,EAAE,aAAa,YAAY,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,GAAG,QAAQ,KAAK,EAAE;AACnH,QAAM,SAAc,EAAE,IAAI,MAAM,UAAU,KAAK,GAAG,UAAU,OAAO,SAAS,IAAI,YAAY,GAAG,SAAS,GAAG,OAAO,GAAG,UAAU,OAAO,QAAQ,KAAK;AACnJ,QAAM,OAAO,WAAW,MAAM,QAAQ;AACtC,SAAO,EAAE,MAAM,CAAC,GAAG,YAAY,MAAM,GAAG,mBAAmB,KAAK,aAAa,gBAAgB,KAAK,SAAS;AAC7G;AAKO,SAAS,aAAa,MAAmB,UAA2B;AACzE,QAAM,OAAO,WAAW,MAAM,QAAQ;AACtC,SAAO;AAAA,IACL,iBAAiB,KAAK,QAAQ,KAAK,CAAC,MAAM,EAAE,OAAO,QAAQ,IAAI,CAAC,QAAQ,IAAI,CAAC;AAAA,IAC7E,mBAAmB,KAAK;AAAA,IACxB,gBAAgB,KAAK;AAAA,IACrB,eAAe,KAAK,QAAQ,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,aAAa,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE;AAAA,EACxF;AACF;AAEA,SAAS,OAAiC,MAAW,KAAsB,KAAgC;AACzG,MAAI,CAAC,KAAK,UAAU,CAAC,KAAK,OAAQ,QAAO;AACzC,QAAM,OAAO,IAAI,IAAI,OAAO,CAAC,CAAC;AAC9B,QAAM,OAAO,IAAI,IAAI,KAAK,OAAO,CAAC,MAAM,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAC9E,aAAW,KAAK,OAAO,CAAC,EAAG,MAAK,IAAI,EAAE,IAAI,CAAC;AAC3C,SAAO,CAAC,GAAG,KAAK,OAAO,CAAC;AAC1B;AAGO,SAAS,aAAoC,MAAS,SAAqB;AAChF,SAAO;AAAA,IACL,GAAG;AAAA,IACH,SAAS,OAAO,KAAK,SAAS,QAAQ,SAAS,QAAQ,eAAe;AAAA,IACtE,UAAU,OAAO,KAAK,UAAU,QAAQ,UAAU,QAAQ,iBAAiB;AAAA,IAC3E,QAAQ,OAAO,KAAK,QAAQ,QAAQ,QAAQ,QAAQ,cAAc;AAAA,IAClE,MAAM,OAAO,KAAK,QAAQ,CAAC,GAAG,QAAQ,MAAM,QAAQ,YAAY;AAAA,EAClE;AACF;AAOO,SAAS,cAAc,OAAuB,UAA0C;AAC7F,QAAM,OAAO,IAAI,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAChD,SAAO,SAAS,OAAO,CAAC,MAAM;AAC5B,UAAM,OAAO,KAAK,IAAI,EAAE,EAAE;AAC1B,WAAO,CAAC,QAAQ,EAAE,YAAY,KAAK;AAAA,EACrC,CAAC;AACH;;;AC7YO,SAAS,cAAc,SAAgC;AAC5D,SAAO;AAAA,IACL,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,SAAS,QAAQ,IAAI,CAAC,OAAO,EAAE,GAAG,gBAAgB,CAAC,GAAG,QAAQ,QAAiB,EAAE;AAAA,EACnF;AACF;AAKA,IAAM,QAAQ,CAAC,MAAyB,OAAO,MAAM,YAAY,MAAM,QAAQ,CAAC,MAAM,QAAQ,CAAC;AAC/F,IAAM,MAAM,CAAC,MAAoC,OAAO,MAAM,WAAW,IAAI;AAC7E,IAAM,OAAO,CAAC,MAAmC;AAC/C,QAAM,IAAI,IAAI,CAAC,GAAG,KAAK;AACvB,SAAO,IAAI,IAAI;AACjB;AACA,IAAM,KAAK,CAAC,MAAmC;AAC7C,QAAM,IAAI,IAAI,CAAC,GAAG,KAAK;AACvB,SAAO,KAAK,EAAE,UAAU,MAAM,IAAI;AACpC;AACA,IAAM,YAAY;AAElB,SAAS,IAAqC,GAA2B;AACvE,MAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,EAAG,QAAO;AACvC,QAAM,MAAM,EAAE,GAAG,GAAG,MAAM,KAAK,EAAE,IAAI,EAAG;AACxC,MAAI,QAAQ,OAAO,IAAI,OAAO,UAAa,OAAO,IAAI,OAAO,SAAU,QAAO;AAC9E,SAAO;AACT;AAEA,SAAS,SAAS,GAAY,MAAmB,QAAkB,OAAiC;AAClG,MAAI,CAAC,MAAM,CAAC,EAAG,QAAO;AACtB,QAAM,SAAS,GAAG,EAAE,EAAE;AACtB,QAAM,QAAQ,KAAK,EAAE,KAAK;AAC1B,MAAI,CAAC,UAAU,CAAC,SAAS,KAAK,IAAI,MAAM,GAAG;AACzC,WAAO,KAAK,GAAG,KAAK,uMAA4C;AAChE,WAAO;AAAA,EACT;AACA,OAAK,IAAI,MAAM;AACf,QAAM,QAAQ,KAAK,MAAM,OAAO,EAAE,KAAK,CAAC;AACxC,QAAM,SAAS,IAAe,EAAE,MAAM;AACtC,QAAM,OAAO,KAAK,EAAE,IAAI;AACxB,QAAM,EAAE,IAAI,IAAI,OAAO,IAAI,MAAM,IAAI,QAAQ,IAAI,OAAO,IAAI,GAAG,KAAK,IAAI;AACxE,SAAO;AAAA,IACL,GAAG;AAAA,IACH,IAAI;AAAA,IACJ;AAAA,IACA,GAAI,OAAO,EAAE,KAAK,IAAI,CAAC;AAAA,IACvB,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC;AAAA,IAC3B,GAAI,OAAO,SAAS,KAAK,KAAK,QAAQ,IAAI,EAAE,OAAO,KAAK,IAAI,OAAO,SAAS,EAAE,IAAI,CAAC;AAAA,EACrF;AACF;AAEA,SAAS,SAAS,GAAY,WAAwB,WAAwB,QAAkB,OAA4B;AAC1H,MAAI,CAAC,MAAM,CAAC,EAAG,QAAO;AACtB,QAAM,SAAS,GAAG,EAAE,EAAE;AACtB,QAAM,QAAQ,KAAK,EAAE,KAAK;AAC1B,MAAI,CAAC,UAAU,CAAC,SAAS,UAAU,IAAI,MAAM,GAAG;AAC9C,WAAO,KAAK,GAAG,KAAK,+KAAwC;AAC5D,WAAO;AAAA,EACT;AACA,YAAU,IAAI,MAAM;AACpB,QAAM,SAAS,MAAM,QAAQ,EAAE,KAAK,IAAI,EAAE,QAAQ,CAAC,GAChD,IAAI,CAAC,MAAM,SAAS,GAAG,WAAW,QAAQ,GAAG,KAAK,SAAI,KAAK,QAAG,CAAC,EAC/D,OAAO,CAAC,MAAsB,MAAM,IAAI;AAC3C,QAAM,cAAc,KAAK,EAAE,WAAW;AACtC,QAAM,SAAS,IAAe,EAAE,MAAM;AACtC,QAAM,QAAQ,MAAM,EAAE,KAAK,IACvB,EAAE,GAAI,KAAK,EAAE,MAAM,IAAI,IAAI,EAAE,MAAM,KAAK,EAAE,MAAM,IAAI,EAAE,IAAI,CAAC,GAAI,GAAI,KAAK,EAAE,MAAM,KAAK,IAAI,EAAE,OAAO,KAAK,EAAE,MAAM,KAAK,EAAE,IAAI,CAAC,EAAG,IAC9H;AACJ,QAAM,SAAS,OAAO,EAAE,MAAM;AAC9B,QAAM,QAAQ,MAAM,EAAE,KAAK,IAAI,OAAO,EAAE,MAAM,KAAK,IAAI;AACvD,QAAM,SAAS,MAAM,EAAE,KAAK,IAAI,OAAO,EAAE,MAAM,MAAM,IAAI;AACzD,QAAM,QAAQ,OAAO,SAAS,KAAK,IAAI,EAAE,OAAO,GAAI,OAAO,UAAU,MAAM,KAAK,UAAU,IAAI,EAAE,OAAO,IAAI,CAAC,EAAG,IAAI;AACnH,QAAM,EAAE,IAAI,IAAI,OAAO,IAAI,aAAa,IAAI,OAAO,KAAK,OAAO,IAAI,QAAQ,IAAI,QAAQ,IAAI,OAAO,IAAI,GAAG,KAAK,IAAI;AAClH,SAAO;AAAA,IACL,GAAG;AAAA,IACH,IAAI;AAAA,IACJ;AAAA,IACA,GAAI,cAAc,EAAE,YAAY,IAAI,CAAC;AAAA,IACrC;AAAA,IACA,GAAI,SAAS,OAAO,KAAK,KAAK,EAAE,SAAS,IAAI,EAAE,MAAM,IAAI,CAAC;AAAA,IAC1D,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC;AAAA,IAC3B,GAAI,OAAO,SAAS,MAAM,KAAK,EAAE,WAAW,SAAY,EAAE,OAAO,IAAI,CAAC;AAAA,IACtE,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC;AAAA,EAC3B;AACF;AAGO,SAAS,WAAW,GAAY,KAAW,SAAmB,CAAC,GAAkB;AACtF,MAAI,CAAC,MAAM,CAAC,EAAG,QAAO;AACtB,QAAM,WAAW,GAAG,EAAE,EAAE;AACxB,QAAM,QAAQ,KAAK,EAAE,KAAK;AAC1B,MAAI,CAAC,YAAY,CAAC,OAAO;AACvB,WAAO,KAAK,4IAA8B;AAC1C,WAAO;AAAA,EACT;AACA,QAAM,QAAQ,2BAAO,KAAK;AAC1B,QAAM,YAAY,oBAAI,IAAY;AAClC,QAAM,YAAY,oBAAI,IAAY;AAClC,QAAM,SAAS,MAAM,QAAQ,EAAE,KAAK,IAAI,EAAE,QAAQ,CAAC,GAChD,IAAI,CAAC,MAAM,SAAS,GAAG,WAAW,WAAW,QAAQ,KAAK,CAAC,EAC3D,OAAO,CAAC,MAAiB,MAAM,IAAI;AACtC,QAAM,KAAK,IAAI,YAAY;AAC3B,QAAM,WAAW,KAAK,MAAM,OAAO,EAAE,QAAQ,CAAC;AAC9C,QAAM,cAAc,KAAK,EAAE,WAAW;AACtC,QAAM,QAAQ,KAAK,EAAE,KAAK;AAC1B,QAAM,SAAS,IAAe,EAAE,MAAM;AACtC,QAAM,EAAE,IAAI,IAAI,OAAO,IAAI,aAAa,IAAI,QAAQ,IAAI,OAAO,IAAI,OAAO,IAAI,OAAO,IAAI,QAAQ,IAAI,UAAU,IAAI,WAAW,KAAK,WAAW,KAAK,GAAG,KAAK,IAAI;AAC/J,SAAO;AAAA,IACL,GAAG;AAAA,IACH,IAAI;AAAA,IACJ;AAAA,IACA,GAAI,cAAc,EAAE,YAAY,IAAI,CAAC;AAAA,IACrC,QAAQ,EAAE,WAAW,QAAQ,QAAQ;AAAA,IACrC,OAAO,EAAE,UAAU,YAAY,YAAY;AAAA,IAC3C;AAAA,IACA,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC;AAAA,IACzB,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC;AAAA,IAC3B,UAAU,OAAO,SAAS,QAAQ,KAAK,YAAY,IAAI,WAAW;AAAA,IAClE,WAAW,IAAI,EAAE,SAAS,KAAK;AAAA,IAC/B,WAAW,IAAI,EAAE,SAAS,KAAK;AAAA,EACjC;AACF;AAMO,SAAS,aAAa,OAAgB,KAAoD;AAC/F,QAAM,SAAmB,CAAC;AAC1B,MAAI;AACJ,MAAI,MAAM,KAAK,KAAK,MAAM,WAAW,mBAAmB;AACtD,QAAI,MAAM,YAAY,EAAG,QAAO,EAAE,SAAS,CAAC,GAAG,QAAQ,CAAC,gOAAuC,EAAE;AACjG,WAAO,MAAM,QAAQ,MAAM,OAAO,IAAI,MAAM,UAAU,CAAC;AAAA,EACzD,WAAW,MAAM,QAAQ,KAAK,GAAG;AAC/B,WAAO;AAAA,EACT,WAAW,MAAM,KAAK,GAAG;AACvB,WAAO,CAAC,KAAK;AAAA,EACf,OAAO;AACL,WAAO,EAAE,SAAS,CAAC,GAAG,QAAQ,CAAC,0EAAc,EAAE;AAAA,EACjD;AACA,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,UAAoB,CAAC;AAC3B,aAAW,KAAK,MAAM;AACpB,UAAM,IAAI,WAAW,GAAG,KAAK,MAAM;AACnC,QAAI,CAAC,EAAG;AACR,QAAI,KAAK,IAAI,EAAE,EAAE,GAAG;AAClB,aAAO,KAAK,2BAAO,EAAE,KAAK,mIAA0B;AACpD;AAAA,IACF;AACA,SAAK,IAAI,EAAE,EAAE;AACb,YAAQ,KAAK,CAAC;AAAA,EAChB;AACA,SAAO,EAAE,SAAS,OAAO;AAC3B;AAsBO,SAAS,cAAc,MAAmB,UAAoB,KAAyB;AAC5F,QAAM,QAAQ,IAAI,IAAI,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AACxD,QAAM,QAAkB,CAAC;AACzB,QAAM,UAAoB,CAAC;AAC3B,QAAM,UAAoB,CAAC;AAC3B,aAAW,OAAO,UAAU;AAC1B,UAAM,IAAY,EAAE,GAAG,KAAK,QAAQ,QAAQ;AAC5C,UAAM,OAAO,MAAM,IAAI,EAAE,EAAE;AAC3B,QAAI,CAAC,KAAM,OAAM,KAAK,CAAC;AAAA,aACd,KAAK,WAAW,MAAO,SAAQ,KAAK,CAAC;AAAA,aACrC,EAAE,WAAW,KAAK,YAAa,EAAE,aAAa,KAAK,YAAY,EAAE,YAAY,KAAK,UAAY,SAAQ,KAAK,CAAC;AAAA,QAChH,SAAQ,KAAK,CAAC;AAAA,EACrB;AACA,QAAM,MAAM,CAAC,GAAG,OAAO,GAAG,OAAO;AACjC,MAAI,IAAI,WAAW,EAAG,QAAO,EAAE,SAAS,CAAC,GAAG,OAAO,SAAS,QAAQ;AAEpE,QAAM,MAAM,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;AACxC,QAAM,OAAoB,EAAE,GAAG,MAAM,SAAS,CAAC,GAAG,KAAK,QAAQ,OAAO,CAAC,MAAM,CAAC,IAAI,IAAI,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,EAAE;AACtG,QAAM,UAAU,aAAa,MAAM,KAAK,CAAC,GAAG,GAAG,CAAC;AAChD,SAAO,EAAE,SAAS,EAAE,SAAS,KAAK,GAAG,QAAQ,GAAG,OAAO,SAAS,QAAQ;AAC1E;","names":["done","found","id"]}
@@ -0,0 +1,125 @@
1
+ 'use client'
2
+
3
+ // src/core/course.ts
4
+ var newId = () => crypto.randomUUID();
5
+ function newCourse(input, now) {
6
+ const at = now.toISOString();
7
+ return {
8
+ id: newId(),
9
+ title: input.title.trim(),
10
+ ...input.description?.trim() ? { description: input.description.trim() } : {},
11
+ origin: input.origin ?? "own",
12
+ route: input.route ?? "free",
13
+ ...input.color ? { color: input.color } : {},
14
+ gates: [],
15
+ revision: 1,
16
+ createdAt: at,
17
+ updatedAt: at
18
+ };
19
+ }
20
+ function newGate(input) {
21
+ return {
22
+ id: newId(),
23
+ title: input.title.trim(),
24
+ ...input.description?.trim() ? { description: input.description.trim() } : {},
25
+ items: []
26
+ };
27
+ }
28
+ function newItem(input) {
29
+ return {
30
+ id: newId(),
31
+ title: input.title.trim(),
32
+ ...input.note?.trim() ? { note: input.note.trim() } : {},
33
+ ...input.target ? { target: input.target } : {},
34
+ ...input.count && input.count > 1 ? { count: Math.floor(input.count) } : {}
35
+ };
36
+ }
37
+ function touch(course, gates, now, patch = {}) {
38
+ return { ...course, ...patch, gates, revision: course.revision + 1, updatedAt: now.toISOString() };
39
+ }
40
+ function moveIn(list, from, toIndex) {
41
+ const out = list.slice();
42
+ const [x] = out.splice(from, 1);
43
+ out.splice(Math.max(0, Math.min(out.length, toIndex)), 0, x);
44
+ return out;
45
+ }
46
+ function updateCourse(course, patch, now) {
47
+ return touch(course, course.gates, now, patch);
48
+ }
49
+ function addGate(course, gate, now, index) {
50
+ const gates = course.gates.slice();
51
+ gates.splice(index ?? gates.length, 0, gate);
52
+ return touch(course, gates, now);
53
+ }
54
+ function updateGate(course, gateId, patch, now) {
55
+ return touch(course, course.gates.map((g) => g.id === gateId ? { ...g, ...patch } : g), now);
56
+ }
57
+ function removeGate(course, gateId, now) {
58
+ return touch(course, course.gates.filter((g) => g.id !== gateId), now);
59
+ }
60
+ function moveGate(course, gateId, toIndex, now) {
61
+ const from = course.gates.findIndex((g) => g.id === gateId);
62
+ if (from < 0) return course;
63
+ return touch(course, moveIn(course.gates, from, toIndex), now);
64
+ }
65
+ function addItem(course, gateId, item, now, index) {
66
+ return touch(
67
+ course,
68
+ course.gates.map((g) => {
69
+ if (g.id !== gateId) return g;
70
+ const items = g.items.slice();
71
+ items.splice(index ?? items.length, 0, item);
72
+ return { ...g, items };
73
+ }),
74
+ now
75
+ );
76
+ }
77
+ function updateItem(course, itemId, patch, now) {
78
+ return touch(
79
+ course,
80
+ course.gates.map((g) => ({ ...g, items: g.items.map((i) => i.id === itemId ? { ...i, ...patch } : i) })),
81
+ now
82
+ );
83
+ }
84
+ function removeItem(course, itemId, now) {
85
+ return touch(course, course.gates.map((g) => ({ ...g, items: g.items.filter((i) => i.id !== itemId) })), now);
86
+ }
87
+ function moveItem(course, itemId, toGateId, toIndex, now) {
88
+ const item = course.gates.flatMap((g) => g.items).find((i) => i.id === itemId);
89
+ if (!item || !course.gates.some((g) => g.id === toGateId)) return course;
90
+ const gates = course.gates.map((g) => {
91
+ const items = g.items.filter((i) => i.id !== itemId);
92
+ if (g.id === toGateId) items.splice(Math.max(0, Math.min(items.length, toIndex)), 0, item);
93
+ return { ...g, items };
94
+ });
95
+ return touch(course, gates, now);
96
+ }
97
+ function duplicateCourse(course, now, title) {
98
+ const at = now.toISOString();
99
+ return {
100
+ ...structuredClone(course),
101
+ id: newId(),
102
+ title: (title ?? course.title).trim(),
103
+ origin: "own",
104
+ revision: 1,
105
+ createdAt: at,
106
+ updatedAt: at
107
+ };
108
+ }
109
+
110
+ export {
111
+ newCourse,
112
+ newGate,
113
+ newItem,
114
+ updateCourse,
115
+ addGate,
116
+ updateGate,
117
+ removeGate,
118
+ moveGate,
119
+ addItem,
120
+ updateItem,
121
+ removeItem,
122
+ moveItem,
123
+ duplicateCourse
124
+ };
125
+ //# sourceMappingURL=chunk-IQYSUTRQ.js.map