@skygraph/core 0.0.0-placeholder.0 → 0.4.0

package/dist/chunk-AB3RLBLW.js

@@ -0,0 +1,357 @@
+import {
+  CALENDAR_PREFIX
+} from "./chunk-5CCD5Q4B.js";
+
+// src/engines/calendar/availability.ts
+var DAY_MS = 864e5;
+function parseHHMM(s, fallback) {
+  if (s === void 0) return fallback;
+  const m = /^(\d{1,2}):(\d{2})$/.exec(s);
+  if (!m) return fallback;
+  const h = Number(m[1]);
+  const mm = Number(m[2]);
+  if (!Number.isFinite(h) || !Number.isFinite(mm)) return fallback;
+  if (h < 0 || h > 24 || mm < 0 || mm >= 60) return fallback;
+  return h * 36e5 + mm * 6e4;
+}
+function rulesFor(resourceId, rules) {
+  return rules.filter((r) => r.resourceId === resourceId);
+}
+function dayBucket(t) {
+  const d = new Date(t);
+  const dayStart = Date.UTC(d.getUTCFullYear(), d.getUTCMonth(), d.getUTCDate());
+  const dayOfWeek = new Date(dayStart).getUTCDay();
+  return { dayStart, dayOfWeek };
+}
+function isAvailable(resource, range, rules) {
+  if (range.end <= range.start) return true;
+  const own = rulesFor(resource.id, rules);
+  if (own.length === 0) return true;
+  let cursor = range.start;
+  while (cursor < range.end) {
+    const { dayStart, dayOfWeek } = dayBucket(cursor);
+    const dayEnd = dayStart + DAY_MS;
+    const sliceEnd = Math.min(range.end, dayEnd);
+    const dayRules = own.filter(
+      (r) => r.dayOfWeek === void 0 || r.dayOfWeek === dayOfWeek
+    );
+    if (dayRules.length === 0) return false;
+    const intervals = dayRules.map((r) => {
+      const fromMs = parseHHMM(r.from, 0);
+      const toMs = parseHHMM(r.to, DAY_MS);
+      return { from: dayStart + fromMs, to: dayStart + toMs };
+    }).filter((w) => w.to > w.from).sort((a, b) => a.from - b.from);
+    if (intervals.length === 0) return false;
+    const merged = [];
+    for (const w of intervals) {
+      const last = merged[merged.length - 1];
+      if (last && w.from <= last.to) {
+        last.to = Math.max(last.to, w.to);
+      } else {
+        merged.push({ ...w });
+      }
+    }
+    let needed = cursor;
+    for (const w of merged) {
+      if (w.from > needed) return false;
+      if (w.to >= sliceEnd) {
+        needed = sliceEnd;
+        break;
+      }
+      needed = Math.max(needed, w.to);
+    }
+    if (needed < sliceEnd) return false;
+    cursor = sliceEnd;
+  }
+  return true;
+}
+
+// src/engines/calendar/conflicts.ts
+var DAY_MS2 = 864e5;
+var STEP_MS = {
+  day: DAY_MS2,
+  week: 7 * DAY_MS2,
+  month: 30 * DAY_MS2
+};
+function makeId(reason, ids) {
+  return `${reason}:${[...ids].sort().join(",")}`;
+}
+function pushConflict(out, reason, ids) {
+  if (ids.length === 0) return;
+  const sorted = [...ids].sort();
+  const id = makeId(reason, sorted);
+  if (out.has(id)) return;
+  out.set(id, { id, reason, assignmentIds: sorted });
+}
+function detectConflicts(state, opts = {}) {
+  const scale = opts.scale ?? "day";
+  const step = STEP_MS[scale];
+  const rules = opts.rules ?? [];
+  const conflicts = /* @__PURE__ */ new Map();
+  const byResource = /* @__PURE__ */ new Map();
+  for (const a of state.assignments) {
+    let bucket = byResource.get(a.resourceId);
+    if (!bucket) {
+      bucket = [];
+      byResource.set(a.resourceId, bucket);
+    }
+    bucket.push(a);
+  }
+  for (const list of byResource.values()) {
+    const sorted = [...list].sort((x, y) => x.start - y.start);
+    for (let i = 0; i < sorted.length; i++) {
+      const a = sorted[i];
+      for (let j = i + 1; j < sorted.length; j++) {
+        const b = sorted[j];
+        if (b.start >= a.end) break;
+        pushConflict(conflicts, "overlap", [a.id, b.id]);
+      }
+    }
+  }
+  const resourceById = /* @__PURE__ */ new Map();
+  for (const r of state.resources) resourceById.set(r.id, r);
+  for (const [rid, list] of byResource) {
+    const resource = resourceById.get(rid);
+    if (!resource || resource.capacityPerSlot === void 0) continue;
+    const cap = Math.max(0, Math.floor(resource.capacityPerSlot));
+    const slotMap = /* @__PURE__ */ new Map();
+    for (const a of list) {
+      const lo = Math.floor(a.start / step) * step;
+      const hi = Math.ceil(a.end / step) * step;
+      for (let s = lo; s < hi; s += step) {
+        let bucket = slotMap.get(s);
+        if (!bucket) {
+          bucket = [];
+          slotMap.set(s, bucket);
+        }
+        bucket.push(a.id);
+      }
+    }
+    for (const ids of slotMap.values()) {
+      if (ids.length > cap) {
+        pushConflict(conflicts, "over-capacity", ids);
+      }
+    }
+  }
+  if (rules.length > 0) {
+    for (const a of state.assignments) {
+      const r = resourceById.get(a.resourceId);
+      if (!r) continue;
+      if (!isAvailable(r, { start: a.start, end: a.end }, rules)) {
+        pushConflict(conflicts, "outside-availability", [a.id]);
+      }
+    }
+  }
+  return [...conflicts.values()];
+}
+
+// src/engines/calendar/CalendarEngine.ts
+var calendarCounter = 0;
+function createCalendar(core, options) {
+  const engineId = `c${calendarCounter++}${options?.name ? `-${options.name}` : ""}`;
+  const prefix = CALENDAR_PREFIX;
+  const resources = /* @__PURE__ */ new Map();
+  const assignments = /* @__PURE__ */ new Map();
+  let rules = options?.rules ? [...options.rules] : [];
+  let scale = options?.scale ?? "day";
+  let conflicts = [];
+  const localSubscribers = /* @__PURE__ */ new Set();
+  function publish() {
+    const resList = [...resources.values()];
+    const assignList = [...assignments.values()];
+    core.batch(() => {
+      core.set(`${prefix}${engineId}.resources`, resList);
+      core.set(`${prefix}${engineId}.assignments`, assignList);
+      core.set(`${prefix}${engineId}.conflicts`, conflicts);
+      core.set(`${prefix}${engineId}.view`, { scale });
+    });
+    for (const cb of localSubscribers) cb();
+  }
+  function recompute() {
+    conflicts = detectConflicts(
+      { resources: [...resources.values()], assignments: [...assignments.values()] },
+      { scale, rules }
+    );
+    const involved = /* @__PURE__ */ new Set();
+    for (const c of conflicts) for (const id of c.assignmentIds) involved.add(id);
+    for (const [id, a] of assignments) {
+      const isConflicting = involved.has(id);
+      if (isConflicting && a.status !== "conflict") {
+        assignments.set(id, { ...a, status: "conflict" });
+      } else if (!isConflicting && a.status === "conflict") {
+        assignments.set(id, { ...a, status: "tentative" });
+      }
+    }
+  }
+  function commitAndPublish() {
+    recompute();
+    publish();
+  }
+  function subscribe(cb) {
+    localSubscribers.add(cb);
+    return () => {
+      localSubscribers.delete(cb);
+    };
+  }
+  function addResource(resource) {
+    if (resources.has(resource.id)) {
+      throw new Error(
+        `[skygraph/calendar] resource id "${resource.id}" already exists`
+      );
+    }
+    resources.set(resource.id, { ...resource });
+    commitAndPublish();
+  }
+  function removeResource(id) {
+    if (!resources.has(id)) return;
+    resources.delete(id);
+    for (const [aid, a] of assignments) {
+      if (a.resourceId === id) assignments.delete(aid);
+    }
+    commitAndPublish();
+  }
+  function updateResource(id, patch) {
+    const r = resources.get(id);
+    if (!r) throw new Error(`[skygraph/calendar] resource "${id}" not found`);
+    resources.set(id, { ...r, ...patch, id });
+    commitAndPublish();
+  }
+  function getResource(id) {
+    return resources.get(id);
+  }
+  function getResources() {
+    return [...resources.values()];
+  }
+  function addAssignment(assignment) {
+    if (assignments.has(assignment.id)) {
+      throw new Error(
+        `[skygraph/calendar] assignment id "${assignment.id}" already exists`
+      );
+    }
+    if (!resources.has(assignment.resourceId)) {
+      throw new Error(
+        `[skygraph/calendar] addAssignment: resource "${assignment.resourceId}" not found`
+      );
+    }
+    if (assignment.end <= assignment.start) {
+      throw new Error(
+        `[skygraph/calendar] addAssignment: end (${assignment.end}) must be greater than start (${assignment.start})`
+      );
+    }
+    assignments.set(assignment.id, { ...assignment });
+    commitAndPublish();
+  }
+  function updateAssignment(id, patch) {
+    const a = assignments.get(id);
+    if (!a) throw new Error(`[skygraph/calendar] assignment "${id}" not found`);
+    const next = { ...a, ...patch, id };
+    if (next.end <= next.start) {
+      throw new Error(
+        `[skygraph/calendar] updateAssignment: end (${next.end}) must be greater than start (${next.start})`
+      );
+    }
+    if (!resources.has(next.resourceId)) {
+      throw new Error(
+        `[skygraph/calendar] updateAssignment: resource "${next.resourceId}" not found`
+      );
+    }
+    assignments.set(id, next);
+    commitAndPublish();
+  }
+  function removeAssignment(id) {
+    if (!assignments.has(id)) return;
+    assignments.delete(id);
+    commitAndPublish();
+  }
+  function moveAssignment(id, deltaMs) {
+    const a = assignments.get(id);
+    if (!a) throw new Error(`[skygraph/calendar] assignment "${id}" not found`);
+    if (deltaMs === 0) return;
+    assignments.set(id, { ...a, start: a.start + deltaMs, end: a.end + deltaMs });
+    commitAndPublish();
+  }
+  function resizeAssignment(id, side, deltaMs) {
+    const a = assignments.get(id);
+    if (!a) throw new Error(`[skygraph/calendar] assignment "${id}" not found`);
+    if (deltaMs === 0) return;
+    let next;
+    if (side === "end") {
+      const nextEnd = Math.max(a.start + 1, a.end + deltaMs);
+      next = { ...a, end: nextEnd };
+    } else {
+      const nextStart = Math.min(a.end - 1, a.start + deltaMs);
+      next = { ...a, start: nextStart };
+    }
+    assignments.set(id, next);
+    commitAndPublish();
+  }
+  function getAssignment(id) {
+    return assignments.get(id);
+  }
+  function getAssignments() {
+    return [...assignments.values()];
+  }
+  function setRules(next) {
+    rules = [...next];
+    commitAndPublish();
+  }
+  function getRules() {
+    return [...rules];
+  }
+  function getConflicts() {
+    return [...conflicts];
+  }
+  function setScale(next) {
+    if (next === scale) return;
+    scale = next;
+    commitAndPublish();
+  }
+  function getScale() {
+    return scale;
+  }
+  function getState() {
+    return {
+      resources: [...resources.values()],
+      assignments: [...assignments.values()],
+      conflicts: [...conflicts]
+    };
+  }
+  function clear() {
+    resources.clear();
+    assignments.clear();
+    rules = [];
+    conflicts = [];
+    publish();
+  }
+  publish();
+  return {
+    id: engineId,
+    addResource,
+    removeResource,
+    updateResource,
+    getResource,
+    getResources,
+    addAssignment,
+    updateAssignment,
+    removeAssignment,
+    moveAssignment,
+    resizeAssignment,
+    getAssignment,
+    getAssignments,
+    setRules,
+    getRules,
+    getConflicts,
+    setScale,
+    getScale,
+    getState,
+    subscribe,
+    clear
+  };
+}
+
+export {
+  isAvailable,
+  detectConflicts,
+  createCalendar
+};
+//# sourceMappingURL=chunk-AB3RLBLW.js.map

package/dist/chunk-AB3RLBLW.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/engines/calendar/availability.ts","../src/engines/calendar/conflicts.ts","../src/engines/calendar/CalendarEngine.ts"],"sourcesContent":["import type { AvailabilityRule, DayOfWeek, Resource } from './types'\n\nconst DAY_MS = 86_400_000\n\n/**\n * Parse `HH:MM` into milliseconds-from-midnight.\n *\n * Returns `null` for malformed input — callers treat that as \"rule has no\n * window on this side\" (i.e. the canonical 00:00 / 24:00 fallback).\n */\nfunction parseHHMM(s: string | undefined, fallback: number): number {\n  if (s === undefined) return fallback\n  const m = /^(\\d{1,2}):(\\d{2})$/.exec(s)\n  if (!m) return fallback\n  const h = Number(m[1])\n  const mm = Number(m[2])\n  if (!Number.isFinite(h) || !Number.isFinite(mm)) return fallback\n  if (h < 0 || h > 24 || mm < 0 || mm >= 60) return fallback\n  return h * 3_600_000 + mm * 60_000\n}\n\n/** Rules attached to one resource. Cheap to compute, cached per call. */\nfunction rulesFor(\n  resourceId: string,\n  rules: readonly AvailabilityRule[],\n): AvailabilityRule[] {\n  return rules.filter((r) => r.resourceId === resourceId)\n}\n\nfunction dayBucket(t: number): { dayStart: number; dayOfWeek: DayOfWeek } {\n  // Floor to UTC day boundary; getUTCDay returns 0..6 (Sun..Sat).\n  const d = new Date(t)\n  const dayStart =\n    Date.UTC(d.getUTCFullYear(), d.getUTCMonth(), d.getUTCDate())\n  const dayOfWeek = new Date(dayStart).getUTCDay() as DayOfWeek\n  return { dayStart, dayOfWeek }\n}\n\n/**\n * `true` ⇔ the entire `[start, end)` interval falls inside at least one\n * availability window for `resource`. A resource without any matching\n * rule (or without any rules at all) is considered always available —\n * unconfigured calendars stay friendly.\n *\n * Implementation: walk one UTC day at a time and check that the slice of\n * `[start, end)` intersected with that day is fully covered by the union\n * of windows attached to that day. The union is built by sorting rule\n * windows by `from` and merging overlaps in O(k log k) where k = rules\n * for that day (typically 1–3).\n */\nexport function isAvailable(\n  resource: Resource,\n  range: { start: number; end: number },\n  rules: readonly AvailabilityRule[],\n): boolean {\n  if (range.end <= range.start) return true\n\n  const own = rulesFor(resource.id, rules)\n  if (own.length === 0) return true\n\n  let cursor = range.start\n  while (cursor < range.end) {\n    const { dayStart, dayOfWeek } = dayBucket(cursor)\n    const dayEnd = dayStart + DAY_MS\n    const sliceEnd = Math.min(range.end, dayEnd)\n\n    const dayRules = own.filter(\n      (r) => r.dayOfWeek === undefined || r.dayOfWeek === dayOfWeek,\n    )\n    if (dayRules.length === 0) return false\n\n    // Build union of windows for this day, in absolute ms.\n    const intervals = dayRules\n      .map((r) => {\n        const fromMs = parseHHMM(r.from, 0)\n        const toMs = parseHHMM(r.to, DAY_MS)\n        return { from: dayStart + fromMs, to: dayStart + toMs }\n      })\n      .filter((w) => w.to > w.from)\n      .sort((a, b) => a.from - b.from)\n\n    if (intervals.length === 0) return false\n\n    const merged: Array<{ from: number; to: number }> = []\n    for (const w of intervals) {\n      const last = merged[merged.length - 1]\n      if (last && w.from <= last.to) {\n        last.to = Math.max(last.to, w.to)\n      } else {\n        merged.push({ ...w })\n      }\n    }\n\n    // The required slice for this day is [cursor, sliceEnd). It must be\n    // fully contained in the union. We sweep the merged windows.\n    let needed = cursor\n    for (const w of merged) {\n      if (w.from > needed) return false\n      if (w.to >= sliceEnd) {\n        needed = sliceEnd\n        break\n      }\n      needed = Math.max(needed, w.to)\n    }\n    if (needed < sliceEnd) return false\n\n    cursor = sliceEnd\n  }\n\n  return true\n}\n","import { isAvailable } from './availability'\nimport type {\n  Assignment,\n  AvailabilityRule,\n  CalendarScale,\n  CalendarState,\n  Conflict,\n  Resource,\n} from './types'\n\nconst DAY_MS = 86_400_000\nconst STEP_MS: Record<CalendarScale, number> = {\n  day: DAY_MS,\n  week: 7 * DAY_MS,\n  month: 30 * DAY_MS,\n}\n\nexport interface DetectConflictsArgs {\n  scale?: CalendarScale\n  rules?: readonly AvailabilityRule[]\n}\n\nfunction makeId(reason: Conflict['reason'], ids: readonly string[]): string {\n  return `${reason}:${[...ids].sort().join(',')}`\n}\n\nfunction pushConflict(\n  out: Map<string, Conflict>,\n  reason: Conflict['reason'],\n  ids: string[],\n): void {\n  if (ids.length === 0) return\n  const sorted = [...ids].sort()\n  const id = makeId(reason, sorted)\n  if (out.has(id)) return\n  out.set(id, { id, reason, assignmentIds: sorted })\n}\n\n/**\n * Find all conflicts in `state`.\n *\n * Algorithm — three independent passes, results de-duplicated by\n * `(reason, sorted-ids)` so the same overlapping pair is never reported\n * twice as `overlap`:\n *\n *   1. **overlap** (per resource): sort assignments by `start` and sweep.\n *      Keep an active set ordered by `end` ASC; whenever a new\n *      assignment opens, every still-active assignment forms a pairwise\n *      `overlap` conflict with it. O(n log n + k) where k = total\n *      overlapping pairs.\n *\n *   2. **over-capacity** (per resource with `capacityPerSlot`): bucket\n *      every assignment into the slots it touches (1 slot = 1 scale\n *      step). For each slot whose concurrent count exceeds capacity,\n *      emit one `over-capacity` conflict naming exactly the assignments\n *      that touch that slot. This is the simple counter approach (no\n *      interval tree) — fine up to ~10⁵ assignments per resource.\n *\n *   3. **outside-availability**: per-assignment check via\n *      `isAvailable`. Each violation becomes its own one-element\n *      conflict.\n */\nexport function detectConflicts(\n  state: Pick<CalendarState, 'resources' | 'assignments'>,\n  opts: DetectConflictsArgs = {},\n): Conflict[] {\n  const scale = opts.scale ?? 'day'\n  const step = STEP_MS[scale]\n  const rules = opts.rules ?? []\n  const conflicts = new Map<string, Conflict>()\n\n  const byResource = new Map<string, Assignment[]>()\n  for (const a of state.assignments) {\n    let bucket = byResource.get(a.resourceId)\n    if (!bucket) {\n      bucket = []\n      byResource.set(a.resourceId, bucket)\n    }\n    bucket.push(a)\n  }\n\n  // ── 1. Pairwise overlap (per resource) ─────────────────────────────\n  for (const list of byResource.values()) {\n    const sorted = [...list].sort((x, y) => x.start - y.start)\n    for (let i = 0; i < sorted.length; i++) {\n      const a = sorted[i]!\n      for (let j = i + 1; j < sorted.length; j++) {\n        const b = sorted[j]!\n        if (b.start >= a.end) break\n        // Touching boundaries (b.start === a.end) is NOT a conflict —\n        // assignment ranges are half-open [start, end).\n        pushConflict(conflicts, 'overlap', [a.id, b.id])\n      }\n    }\n  }\n\n  // ── 2. Over-capacity per slot (per resource with capacityPerSlot) ──\n  const resourceById = new Map<string, Resource>()\n  for (const r of state.resources) resourceById.set(r.id, r)\n\n  for (const [rid, list] of byResource) {\n    const resource = resourceById.get(rid)\n    if (!resource || resource.capacityPerSlot === undefined) continue\n    const cap = Math.max(0, Math.floor(resource.capacityPerSlot))\n\n    const slotMap = new Map<number, string[]>()\n    for (const a of list) {\n      // Every slot the assignment touches.\n      const lo = Math.floor(a.start / step) * step\n      const hi = Math.ceil(a.end / step) * step\n      for (let s = lo; s < hi; s += step) {\n        let bucket = slotMap.get(s)\n        if (!bucket) {\n          bucket = []\n          slotMap.set(s, bucket)\n        }\n        bucket.push(a.id)\n      }\n    }\n\n    for (const ids of slotMap.values()) {\n      if (ids.length > cap) {\n        pushConflict(conflicts, 'over-capacity', ids)\n      }\n    }\n  }\n\n  // ── 3. Outside availability (per assignment) ───────────────────────\n  if (rules.length > 0) {\n    for (const a of state.assignments) {\n      const r = resourceById.get(a.resourceId)\n      if (!r) continue\n      if (!isAvailable(r, { start: a.start, end: a.end }, rules)) {\n        pushConflict(conflicts, 'outside-availability', [a.id])\n      }\n    }\n  }\n\n  return [...conflicts.values()]\n}\n","import type { Core } from '../../types'\nimport { CALENDAR_PREFIX } from '../namespaces'\nimport { detectConflicts } from './conflicts'\nimport type {\n  Assignment,\n  AvailabilityRule,\n  CalendarEngine,\n  CalendarEngineOptions,\n  CalendarScale,\n  CalendarState,\n  Conflict,\n  Resource,\n} from './types'\n\nlet calendarCounter = 0\n\n/**\n * Resource Calendar engine — the sixth member of the\n * form / table / tree / virtual / graph / **calendar** family.\n *\n * The in-memory maps are the source of truth and the public read API;\n * snapshots are mirrored to the Core store under\n * `$calendar.<id>.{resources,assignments,conflicts,view}` so other\n * engines / external observers can react via `core.subscribe(...)`.\n *\n * v0 scope:\n *   - addResource / removeResource / updateResource\n *   - addAssignment / updateAssignment / removeAssignment\n *   - moveAssignment(id, deltaMs) — shifts both ends together\n *   - resizeAssignment(id, side, deltaMs) — clamps so width >= 1ms\n *   - setRules / setScale — re-compute conflicts on change\n *   - detectConflicts under the hood; status of involved assignments\n *     is auto-promoted to `'conflict'` so the React adapter can render\n *     without re-running the algorithm.\n *\n * NOT in v0 (deferred to round-10):\n *   - exception dates on `AvailabilityRule`\n *   - full per-engine undo/redo (use `core.snapshot/restore` instead)\n *   - aggregate read APIs over a sub-range\n */\nexport function createCalendar(\n  core: Core,\n  options?: CalendarEngineOptions,\n): CalendarEngine {\n  const engineId = `c${calendarCounter++}${options?.name ? `-${options.name}` : ''}`\n  const prefix = CALENDAR_PREFIX\n\n  const resources = new Map<string, Resource>()\n  const assignments = new Map<string, Assignment>()\n  let rules: AvailabilityRule[] = options?.rules ? [...options.rules] : []\n  let scale: CalendarScale = options?.scale ?? 'day'\n  let conflicts: Conflict[] = []\n\n  const localSubscribers = new Set<() => void>()\n\n  function publish(): void {\n    const resList = [...resources.values()]\n    const assignList = [...assignments.values()]\n    core.batch(() => {\n      core.set(`${prefix}${engineId}.resources`, resList)\n      core.set(`${prefix}${engineId}.assignments`, assignList)\n      core.set(`${prefix}${engineId}.conflicts`, conflicts)\n      core.set(`${prefix}${engineId}.view`, { scale })\n    })\n    for (const cb of localSubscribers) cb()\n  }\n\n  function recompute(): void {\n    conflicts = detectConflicts(\n      { resources: [...resources.values()], assignments: [...assignments.values()] },\n      { scale, rules },\n    )\n    // Promote involved assignments to status: 'conflict'. Assignments\n    // that aren't in any conflict get their original (or default)\n    // status restored. We don't lose the underlying intent: the\n    // promotion is reversible and recomputed on every mutation.\n    const involved = new Set<string>()\n    for (const c of conflicts) for (const id of c.assignmentIds) involved.add(id)\n    for (const [id, a] of assignments) {\n      const isConflicting = involved.has(id)\n      if (isConflicting && a.status !== 'conflict') {\n        assignments.set(id, { ...a, status: 'conflict' })\n      } else if (!isConflicting && a.status === 'conflict') {\n        // Drop the auto-`conflict` flag — the original intent (tentative\n        // / confirmed / undefined) was lost when we promoted, and the\n        // adapter only needs to know \"no longer conflicting\", so we\n        // default back to `'tentative'` which is the safest fallback.\n        assignments.set(id, { ...a, status: 'tentative' })\n      }\n    }\n  }\n\n  function commitAndPublish(): void {\n    recompute()\n    publish()\n  }\n\n  function subscribe(cb: () => void): () => void {\n    localSubscribers.add(cb)\n    return () => {\n      localSubscribers.delete(cb)\n    }\n  }\n\n  function addResource(resource: Resource): void {\n    if (resources.has(resource.id)) {\n      throw new Error(\n        `[skygraph/calendar] resource id \"${resource.id}\" already exists`,\n      )\n    }\n    resources.set(resource.id, { ...resource })\n    commitAndPublish()\n  }\n\n  function removeResource(id: string): void {\n    if (!resources.has(id)) return\n    resources.delete(id)\n    // Cascade: drop assignments tied to this resource.\n    for (const [aid, a] of assignments) {\n      if (a.resourceId === id) assignments.delete(aid)\n    }\n    commitAndPublish()\n  }\n\n  function updateResource(id: string, patch: Partial<Resource>): void {\n    const r = resources.get(id)\n    if (!r) throw new Error(`[skygraph/calendar] resource \"${id}\" not found`)\n    resources.set(id, { ...r, ...patch, id })\n    commitAndPublish()\n  }\n\n  function getResource(id: string): Resource | undefined {\n    return resources.get(id)\n  }\n\n  function getResources(): Resource[] {\n    return [...resources.values()]\n  }\n\n  function addAssignment(assignment: Assignment): void {\n    if (assignments.has(assignment.id)) {\n      throw new Error(\n        `[skygraph/calendar] assignment id \"${assignment.id}\" already exists`,\n      )\n    }\n    if (!resources.has(assignment.resourceId)) {\n      throw new Error(\n        `[skygraph/calendar] addAssignment: resource \"${assignment.resourceId}\" not found`,\n      )\n    }\n    if (assignment.end <= assignment.start) {\n      throw new Error(\n        `[skygraph/calendar] addAssignment: end (${assignment.end}) must be greater than start (${assignment.start})`,\n      )\n    }\n    assignments.set(assignment.id, { ...assignment })\n    commitAndPublish()\n  }\n\n  function updateAssignment(id: string, patch: Partial<Assignment>): void {\n    const a = assignments.get(id)\n    if (!a) throw new Error(`[skygraph/calendar] assignment \"${id}\" not found`)\n    const next: Assignment = { ...a, ...patch, id }\n    if (next.end <= next.start) {\n      throw new Error(\n        `[skygraph/calendar] updateAssignment: end (${next.end}) must be greater than start (${next.start})`,\n      )\n    }\n    if (!resources.has(next.resourceId)) {\n      throw new Error(\n        `[skygraph/calendar] updateAssignment: resource \"${next.resourceId}\" not found`,\n      )\n    }\n    assignments.set(id, next)\n    commitAndPublish()\n  }\n\n  function removeAssignment(id: string): void {\n    if (!assignments.has(id)) return\n    assignments.delete(id)\n    commitAndPublish()\n  }\n\n  function moveAssignment(id: string, deltaMs: number): void {\n    const a = assignments.get(id)\n    if (!a) throw new Error(`[skygraph/calendar] assignment \"${id}\" not found`)\n    if (deltaMs === 0) return\n    assignments.set(id, { ...a, start: a.start + deltaMs, end: a.end + deltaMs })\n    commitAndPublish()\n  }\n\n  function resizeAssignment(\n    id: string,\n    side: 'start' | 'end',\n    deltaMs: number,\n  ): void {\n    const a = assignments.get(id)\n    if (!a) throw new Error(`[skygraph/calendar] assignment \"${id}\" not found`)\n    if (deltaMs === 0) return\n    let next: Assignment\n    if (side === 'end') {\n      const nextEnd = Math.max(a.start + 1, a.end + deltaMs)\n      next = { ...a, end: nextEnd }\n    } else {\n      const nextStart = Math.min(a.end - 1, a.start + deltaMs)\n      next = { ...a, start: nextStart }\n    }\n    assignments.set(id, next)\n    commitAndPublish()\n  }\n\n  function getAssignment(id: string): Assignment | undefined {\n    return assignments.get(id)\n  }\n\n  function getAssignments(): Assignment[] {\n    return [...assignments.values()]\n  }\n\n  function setRules(next: readonly AvailabilityRule[]): void {\n    rules = [...next]\n    commitAndPublish()\n  }\n\n  function getRules(): AvailabilityRule[] {\n    return [...rules]\n  }\n\n  function getConflicts(): Conflict[] {\n    return [...conflicts]\n  }\n\n  function setScale(next: CalendarScale): void {\n    if (next === scale) return\n    scale = next\n    commitAndPublish()\n  }\n\n  function getScale(): CalendarScale {\n    return scale\n  }\n\n  function getState(): CalendarState {\n    return {\n      resources: [...resources.values()],\n      assignments: [...assignments.values()],\n      conflicts: [...conflicts],\n    }\n  }\n\n  function clear(): void {\n    resources.clear()\n    assignments.clear()\n    rules = []\n    conflicts = []\n    publish()\n  }\n\n  publish() // initial empty publish so subscribers see a stable shape\n\n  return {\n    id: engineId,\n    addResource,\n    removeResource,\n    updateResource,\n    getResource,\n    getResources,\n    addAssignment,\n    updateAssignment,\n    removeAssignment,\n    moveAssignment,\n    resizeAssignment,\n    getAssignment,\n    getAssignments,\n    setRules,\n    getRules,\n    getConflicts,\n    setScale,\n    getScale,\n    getState,\n    subscribe,\n    clear,\n  }\n}\n"],"mappings":";;;;;AAEA,IAAM,SAAS;AAQf,SAAS,UAAU,GAAuB,UAA0B;AAClE,MAAI,MAAM,OAAW,QAAO;AAC5B,QAAM,IAAI,sBAAsB,KAAK,CAAC;AACtC,MAAI,CAAC,EAAG,QAAO;AACf,QAAM,IAAI,OAAO,EAAE,CAAC,CAAC;AACrB,QAAM,KAAK,OAAO,EAAE,CAAC,CAAC;AACtB,MAAI,CAAC,OAAO,SAAS,CAAC,KAAK,CAAC,OAAO,SAAS,EAAE,EAAG,QAAO;AACxD,MAAI,IAAI,KAAK,IAAI,MAAM,KAAK,KAAK,MAAM,GAAI,QAAO;AAClD,SAAO,IAAI,OAAY,KAAK;AAC9B;AAGA,SAAS,SACP,YACA,OACoB;AACpB,SAAO,MAAM,OAAO,CAAC,MAAM,EAAE,eAAe,UAAU;AACxD;AAEA,SAAS,UAAU,GAAuD;AAExE,QAAM,IAAI,IAAI,KAAK,CAAC;AACpB,QAAM,WACJ,KAAK,IAAI,EAAE,eAAe,GAAG,EAAE,YAAY,GAAG,EAAE,WAAW,CAAC;AAC9D,QAAM,YAAY,IAAI,KAAK,QAAQ,EAAE,UAAU;AAC/C,SAAO,EAAE,UAAU,UAAU;AAC/B;AAcO,SAAS,YACd,UACA,OACA,OACS;AACT,MAAI,MAAM,OAAO,MAAM,MAAO,QAAO;AAErC,QAAM,MAAM,SAAS,SAAS,IAAI,KAAK;AACvC,MAAI,IAAI,WAAW,EAAG,QAAO;AAE7B,MAAI,SAAS,MAAM;AACnB,SAAO,SAAS,MAAM,KAAK;AACzB,UAAM,EAAE,UAAU,UAAU,IAAI,UAAU,MAAM;AAChD,UAAM,SAAS,WAAW;AAC1B,UAAM,WAAW,KAAK,IAAI,MAAM,KAAK,MAAM;AAE3C,UAAM,WAAW,IAAI;AAAA,MACnB,CAAC,MAAM,EAAE,cAAc,UAAa,EAAE,cAAc;AAAA,IACtD;AACA,QAAI,SAAS,WAAW,EAAG,QAAO;AAGlC,UAAM,YAAY,SACf,IAAI,CAAC,MAAM;AACV,YAAM,SAAS,UAAU,EAAE,MAAM,CAAC;AAClC,YAAM,OAAO,UAAU,EAAE,IAAI,MAAM;AACnC,aAAO,EAAE,MAAM,WAAW,QAAQ,IAAI,WAAW,KAAK;AAAA,IACxD,CAAC,EACA,OAAO,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,EAC3B,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE,IAAI;AAEjC,QAAI,UAAU,WAAW,EAAG,QAAO;AAEnC,UAAM,SAA8C,CAAC;AACrD,eAAW,KAAK,WAAW;AACzB,YAAM,OAAO,OAAO,OAAO,SAAS,CAAC;AACrC,UAAI,QAAQ,EAAE,QAAQ,KAAK,IAAI;AAC7B,aAAK,KAAK,KAAK,IAAI,KAAK,IAAI,EAAE,EAAE;AAAA,MAClC,OAAO;AACL,eAAO,KAAK,EAAE,GAAG,EAAE,CAAC;AAAA,MACtB;AAAA,IACF;AAIA,QAAI,SAAS;AACb,eAAW,KAAK,QAAQ;AACtB,UAAI,EAAE,OAAO,OAAQ,QAAO;AAC5B,UAAI,EAAE,MAAM,UAAU;AACpB,iBAAS;AACT;AAAA,MACF;AACA,eAAS,KAAK,IAAI,QAAQ,EAAE,EAAE;AAAA,IAChC;AACA,QAAI,SAAS,SAAU,QAAO;AAE9B,aAAS;AAAA,EACX;AAEA,SAAO;AACT;;;ACpGA,IAAMA,UAAS;AACf,IAAM,UAAyC;AAAA,EAC7C,KAAKA;AAAA,EACL,MAAM,IAAIA;AAAA,EACV,OAAO,KAAKA;AACd;AAOA,SAAS,OAAO,QAA4B,KAAgC;AAC1E,SAAO,GAAG,MAAM,IAAI,CAAC,GAAG,GAAG,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC;AAC/C;AAEA,SAAS,aACP,KACA,QACA,KACM;AACN,MAAI,IAAI,WAAW,EAAG;AACtB,QAAM,SAAS,CAAC,GAAG,GAAG,EAAE,KAAK;AAC7B,QAAM,KAAK,OAAO,QAAQ,MAAM;AAChC,MAAI,IAAI,IAAI,EAAE,EAAG;AACjB,MAAI,IAAI,IAAI,EAAE,IAAI,QAAQ,eAAe,OAAO,CAAC;AACnD;AA0BO,SAAS,gBACd,OACA,OAA4B,CAAC,GACjB;AACZ,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,OAAO,QAAQ,KAAK;AAC1B,QAAM,QAAQ,KAAK,SAAS,CAAC;AAC7B,QAAM,YAAY,oBAAI,IAAsB;AAE5C,QAAM,aAAa,oBAAI,IAA0B;AACjD,aAAW,KAAK,MAAM,aAAa;AACjC,QAAI,SAAS,WAAW,IAAI,EAAE,UAAU;AACxC,QAAI,CAAC,QAAQ;AACX,eAAS,CAAC;AACV,iBAAW,IAAI,EAAE,YAAY,MAAM;AAAA,IACrC;AACA,WAAO,KAAK,CAAC;AAAA,EACf;AAGA,aAAW,QAAQ,WAAW,OAAO,GAAG;AACtC,UAAM,SAAS,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AACzD,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,YAAM,IAAI,OAAO,CAAC;AAClB,eAAS,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AAC1C,cAAM,IAAI,OAAO,CAAC;AAClB,YAAI,EAAE,SAAS,EAAE,IAAK;AAGtB,qBAAa,WAAW,WAAW,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;AAAA,MACjD;AAAA,IACF;AAAA,EACF;AAGA,QAAM,eAAe,oBAAI,IAAsB;AAC/C,aAAW,KAAK,MAAM,UAAW,cAAa,IAAI,EAAE,IAAI,CAAC;AAEzD,aAAW,CAAC,KAAK,IAAI,KAAK,YAAY;AACpC,UAAM,WAAW,aAAa,IAAI,GAAG;AACrC,QAAI,CAAC,YAAY,SAAS,oBAAoB,OAAW;AACzD,UAAM,MAAM,KAAK,IAAI,GAAG,KAAK,MAAM,SAAS,eAAe,CAAC;AAE5D,UAAM,UAAU,oBAAI,IAAsB;AAC1C,eAAW,KAAK,MAAM;AAEpB,YAAM,KAAK,KAAK,MAAM,EAAE,QAAQ,IAAI,IAAI;AACxC,YAAM,KAAK,KAAK,KAAK,EAAE,MAAM,IAAI,IAAI;AACrC,eAAS,IAAI,IAAI,IAAI,IAAI,KAAK,MAAM;AAClC,YAAI,SAAS,QAAQ,IAAI,CAAC;AAC1B,YAAI,CAAC,QAAQ;AACX,mBAAS,CAAC;AACV,kBAAQ,IAAI,GAAG,MAAM;AAAA,QACvB;AACA,eAAO,KAAK,EAAE,EAAE;AAAA,MAClB;AAAA,IACF;AAEA,eAAW,OAAO,QAAQ,OAAO,GAAG;AAClC,UAAI,IAAI,SAAS,KAAK;AACpB,qBAAa,WAAW,iBAAiB,GAAG;AAAA,MAC9C;AAAA,IACF;AAAA,EACF;AAGA,MAAI,MAAM,SAAS,GAAG;AACpB,eAAW,KAAK,MAAM,aAAa;AACjC,YAAM,IAAI,aAAa,IAAI,EAAE,UAAU;AACvC,UAAI,CAAC,EAAG;AACR,UAAI,CAAC,YAAY,GAAG,EAAE,OAAO,EAAE,OAAO,KAAK,EAAE,IAAI,GAAG,KAAK,GAAG;AAC1D,qBAAa,WAAW,wBAAwB,CAAC,EAAE,EAAE,CAAC;AAAA,MACxD;AAAA,IACF;AAAA,EACF;AAEA,SAAO,CAAC,GAAG,UAAU,OAAO,CAAC;AAC/B;;;AC7HA,IAAI,kBAAkB;AA0Bf,SAAS,eACd,MACA,SACgB;AAChB,QAAM,WAAW,IAAI,iBAAiB,GAAG,SAAS,OAAO,IAAI,QAAQ,IAAI,KAAK,EAAE;AAChF,QAAM,SAAS;AAEf,QAAM,YAAY,oBAAI,IAAsB;AAC5C,QAAM,cAAc,oBAAI,IAAwB;AAChD,MAAI,QAA4B,SAAS,QAAQ,CAAC,GAAG,QAAQ,KAAK,IAAI,CAAC;AACvE,MAAI,QAAuB,SAAS,SAAS;AAC7C,MAAI,YAAwB,CAAC;AAE7B,QAAM,mBAAmB,oBAAI,IAAgB;AAE7C,WAAS,UAAgB;AACvB,UAAM,UAAU,CAAC,GAAG,UAAU,OAAO,CAAC;AACtC,UAAM,aAAa,CAAC,GAAG,YAAY,OAAO,CAAC;AAC3C,SAAK,MAAM,MAAM;AACf,WAAK,IAAI,GAAG,MAAM,GAAG,QAAQ,cAAc,OAAO;AAClD,WAAK,IAAI,GAAG,MAAM,GAAG,QAAQ,gBAAgB,UAAU;AACvD,WAAK,IAAI,GAAG,MAAM,GAAG,QAAQ,cAAc,SAAS;AACpD,WAAK,IAAI,GAAG,MAAM,GAAG,QAAQ,SAAS,EAAE,MAAM,CAAC;AAAA,IACjD,CAAC;AACD,eAAW,MAAM,iBAAkB,IAAG;AAAA,EACxC;AAEA,WAAS,YAAkB;AACzB,gBAAY;AAAA,MACV,EAAE,WAAW,CAAC,GAAG,UAAU,OAAO,CAAC,GAAG,aAAa,CAAC,GAAG,YAAY,OAAO,CAAC,EAAE;AAAA,MAC7E,EAAE,OAAO,MAAM;AAAA,IACjB;AAKA,UAAM,WAAW,oBAAI,IAAY;AACjC,eAAW,KAAK,UAAW,YAAW,MAAM,EAAE,cAAe,UAAS,IAAI,EAAE;AAC5E,eAAW,CAAC,IAAI,CAAC,KAAK,aAAa;AACjC,YAAM,gBAAgB,SAAS,IAAI,EAAE;AACrC,UAAI,iBAAiB,EAAE,WAAW,YAAY;AAC5C,oBAAY,IAAI,IAAI,EAAE,GAAG,GAAG,QAAQ,WAAW,CAAC;AAAA,MAClD,WAAW,CAAC,iBAAiB,EAAE,WAAW,YAAY;AAKpD,oBAAY,IAAI,IAAI,EAAE,GAAG,GAAG,QAAQ,YAAY,CAAC;AAAA,MACnD;AAAA,IACF;AAAA,EACF;AAEA,WAAS,mBAAyB;AAChC,cAAU;AACV,YAAQ;AAAA,EACV;AAEA,WAAS,UAAU,IAA4B;AAC7C,qBAAiB,IAAI,EAAE;AACvB,WAAO,MAAM;AACX,uBAAiB,OAAO,EAAE;AAAA,IAC5B;AAAA,EACF;AAEA,WAAS,YAAY,UAA0B;AAC7C,QAAI,UAAU,IAAI,SAAS,EAAE,GAAG;AAC9B,YAAM,IAAI;AAAA,QACR,oCAAoC,SAAS,EAAE;AAAA,MACjD;AAAA,IACF;AACA,cAAU,IAAI,SAAS,IAAI,EAAE,GAAG,SAAS,CAAC;AAC1C,qBAAiB;AAAA,EACnB;AAEA,WAAS,eAAe,IAAkB;AACxC,QAAI,CAAC,UAAU,IAAI,EAAE,EAAG;AACxB,cAAU,OAAO,EAAE;AAEnB,eAAW,CAAC,KAAK,CAAC,KAAK,aAAa;AAClC,UAAI,EAAE,eAAe,GAAI,aAAY,OAAO,GAAG;AAAA,IACjD;AACA,qBAAiB;AAAA,EACnB;AAEA,WAAS,eAAe,IAAY,OAAgC;AAClE,UAAM,IAAI,UAAU,IAAI,EAAE;AAC1B,QAAI,CAAC,EAAG,OAAM,IAAI,MAAM,iCAAiC,EAAE,aAAa;AACxE,cAAU,IAAI,IAAI,EAAE,GAAG,GAAG,GAAG,OAAO,GAAG,CAAC;AACxC,qBAAiB;AAAA,EACnB;AAEA,WAAS,YAAY,IAAkC;AACrD,WAAO,UAAU,IAAI,EAAE;AAAA,EACzB;AAEA,WAAS,eAA2B;AAClC,WAAO,CAAC,GAAG,UAAU,OAAO,CAAC;AAAA,EAC/B;AAEA,WAAS,cAAc,YAA8B;AACnD,QAAI,YAAY,IAAI,WAAW,EAAE,GAAG;AAClC,YAAM,IAAI;AAAA,QACR,sCAAsC,WAAW,EAAE;AAAA,MACrD;AAAA,IACF;AACA,QAAI,CAAC,UAAU,IAAI,WAAW,UAAU,GAAG;AACzC,YAAM,IAAI;AAAA,QACR,gDAAgD,WAAW,UAAU;AAAA,MACvE;AAAA,IACF;AACA,QAAI,WAAW,OAAO,WAAW,OAAO;AACtC,YAAM,IAAI;AAAA,QACR,2CAA2C,WAAW,GAAG,iCAAiC,WAAW,KAAK;AAAA,MAC5G;AAAA,IACF;AACA,gBAAY,IAAI,WAAW,IAAI,EAAE,GAAG,WAAW,CAAC;AAChD,qBAAiB;AAAA,EACnB;AAEA,WAAS,iBAAiB,IAAY,OAAkC;AACtE,UAAM,IAAI,YAAY,IAAI,EAAE;AAC5B,QAAI,CAAC,EAAG,OAAM,IAAI,MAAM,mCAAmC,EAAE,aAAa;AAC1E,UAAM,OAAmB,EAAE,GAAG,GAAG,GAAG,OAAO,GAAG;AAC9C,QAAI,KAAK,OAAO,KAAK,OAAO;AAC1B,YAAM,IAAI;AAAA,QACR,8CAA8C,KAAK,GAAG,iCAAiC,KAAK,KAAK;AAAA,MACnG;AAAA,IACF;AACA,QAAI,CAAC,UAAU,IAAI,KAAK,UAAU,GAAG;AACnC,YAAM,IAAI;AAAA,QACR,mDAAmD,KAAK,UAAU;AAAA,MACpE;AAAA,IACF;AACA,gBAAY,IAAI,IAAI,IAAI;AACxB,qBAAiB;AAAA,EACnB;AAEA,WAAS,iBAAiB,IAAkB;AAC1C,QAAI,CAAC,YAAY,IAAI,EAAE,EAAG;AAC1B,gBAAY,OAAO,EAAE;AACrB,qBAAiB;AAAA,EACnB;AAEA,WAAS,eAAe,IAAY,SAAuB;AACzD,UAAM,IAAI,YAAY,IAAI,EAAE;AAC5B,QAAI,CAAC,EAAG,OAAM,IAAI,MAAM,mCAAmC,EAAE,aAAa;AAC1E,QAAI,YAAY,EAAG;AACnB,gBAAY,IAAI,IAAI,EAAE,GAAG,GAAG,OAAO,EAAE,QAAQ,SAAS,KAAK,EAAE,MAAM,QAAQ,CAAC;AAC5E,qBAAiB;AAAA,EACnB;AAEA,WAAS,iBACP,IACA,MACA,SACM;AACN,UAAM,IAAI,YAAY,IAAI,EAAE;AAC5B,QAAI,CAAC,EAAG,OAAM,IAAI,MAAM,mCAAmC,EAAE,aAAa;AAC1E,QAAI,YAAY,EAAG;AACnB,QAAI;AACJ,QAAI,SAAS,OAAO;AAClB,YAAM,UAAU,KAAK,IAAI,EAAE,QAAQ,GAAG,EAAE,MAAM,OAAO;AACrD,aAAO,EAAE,GAAG,GAAG,KAAK,QAAQ;AAAA,IAC9B,OAAO;AACL,YAAM,YAAY,KAAK,IAAI,EAAE,MAAM,GAAG,EAAE,QAAQ,OAAO;AACvD,aAAO,EAAE,GAAG,GAAG,OAAO,UAAU;AAAA,IAClC;AACA,gBAAY,IAAI,IAAI,IAAI;AACxB,qBAAiB;AAAA,EACnB;AAEA,WAAS,cAAc,IAAoC;AACzD,WAAO,YAAY,IAAI,EAAE;AAAA,EAC3B;AAEA,WAAS,iBAA+B;AACtC,WAAO,CAAC,GAAG,YAAY,OAAO,CAAC;AAAA,EACjC;AAEA,WAAS,SAAS,MAAyC;AACzD,YAAQ,CAAC,GAAG,IAAI;AAChB,qBAAiB;AAAA,EACnB;AAEA,WAAS,WAA+B;AACtC,WAAO,CAAC,GAAG,KAAK;AAAA,EAClB;AAEA,WAAS,eAA2B;AAClC,WAAO,CAAC,GAAG,SAAS;AAAA,EACtB;AAEA,WAAS,SAAS,MAA2B;AAC3C,QAAI,SAAS,MAAO;AACpB,YAAQ;AACR,qBAAiB;AAAA,EACnB;AAEA,WAAS,WAA0B;AACjC,WAAO;AAAA,EACT;AAEA,WAAS,WAA0B;AACjC,WAAO;AAAA,MACL,WAAW,CAAC,GAAG,UAAU,OAAO,CAAC;AAAA,MACjC,aAAa,CAAC,GAAG,YAAY,OAAO,CAAC;AAAA,MACrC,WAAW,CAAC,GAAG,SAAS;AAAA,IAC1B;AAAA,EACF;AAEA,WAAS,QAAc;AACrB,cAAU,MAAM;AAChB,gBAAY,MAAM;AAClB,YAAQ,CAAC;AACT,gBAAY,CAAC;AACb,YAAQ;AAAA,EACV;AAEA,UAAQ;AAER,SAAO;AAAA,IACL,IAAI;AAAA,IACJ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;","names":["DAY_MS"]}

package/dist/chunk-GEMALROQ.js

@@ -0,0 +1,258 @@
+// src/runtime/Node.ts
+function createNode(id, value) {
+  return { id, value, version: 0 };
+}
+
+// src/runtime/Store.ts
+var Store = class {
+  nodes = /* @__PURE__ */ new Map();
+  has(path) {
+    return this.nodes.has(path);
+  }
+  get(path) {
+    return this.nodes.get(path)?.value;
+  }
+  getNode(path) {
+    return this.nodes.get(path);
+  }
+  set(path, value) {
+    let node = this.nodes.get(path);
+    if (node) {
+      node.value = value;
+      node.version++;
+      return node;
+    }
+    node = createNode(path, value);
+    this.nodes.set(path, node);
+    return node;
+  }
+  delete(path) {
+    return this.nodes.delete(path);
+  }
+  paths() {
+    return this.nodes.keys();
+  }
+  size() {
+    return this.nodes.size;
+  }
+};
+
+// src/runtime/SubscriptionEngine.ts
+var SubscriptionEngine = class {
+  listeners = /* @__PURE__ */ new Map();
+  subscribe(path, cb) {
+    let set = this.listeners.get(path);
+    if (!set) {
+      set = /* @__PURE__ */ new Set();
+      this.listeners.set(path, set);
+    }
+    set.add(cb);
+    return () => {
+      set.delete(cb);
+      if (set.size === 0) {
+        this.listeners.delete(path);
+      }
+    };
+  }
+  notify(path, value) {
+    const set = this.listeners.get(path);
+    if (!set) return;
+    for (const cb of set) {
+      cb(value);
+    }
+  }
+  notifyMany(changes) {
+    for (const [path, value] of changes) {
+      this.notify(path, value);
+    }
+  }
+  hasListeners(path) {
+    const set = this.listeners.get(path);
+    return set !== void 0 && set.size > 0;
+  }
+  clear() {
+    this.listeners.clear();
+  }
+};
+
+// src/runtime/Batch.ts
+var Batch = class {
+  depth = 0;
+  pending = /* @__PURE__ */ new Map();
+  get isActive() {
+    return this.depth > 0;
+  }
+  start() {
+    this.depth++;
+  }
+  end() {
+    this.depth--;
+    if (this.depth > 0) return null;
+    if (this.pending.size === 0) return null;
+    const changes = new Map(this.pending);
+    this.pending.clear();
+    return changes;
+  }
+  enqueue(path, value) {
+    this.pending.set(path, value);
+  }
+};
+
+// src/runtime/Transaction.ts
+var Transaction = class {
+  active = false;
+  staged = [];
+  get isActive() {
+    return this.active;
+  }
+  start() {
+    if (this.active) {
+      throw new Error("SkyGraph: nested transactions are not supported");
+    }
+    this.active = true;
+    this.staged = [];
+  }
+  /** STAGE: record a write without mutating the store */
+  stage(path, value, prevValue) {
+    this.staged.push({ path, value, prevValue });
+  }
+  /**
+   * RESOLVE + COMMIT: drop unchanged values, apply the rest to store.
+   * Returns the map of actually changed paths and their new values.
+   */
+  commit(store) {
+    const changes = /* @__PURE__ */ new Map();
+    for (const write of this.staged) {
+      if (Object.is(write.value, write.prevValue)) continue;
+      store.set(write.path, write.value);
+      changes.set(write.path, write.value);
+    }
+    this.active = false;
+    this.staged = [];
+    return changes;
+  }
+  getStaged() {
+    return this.staged;
+  }
+  complete() {
+    this.active = false;
+    this.staged = [];
+  }
+  rollback() {
+    this.active = false;
+    this.staged = [];
+  }
+};
+
+// src/runtime/CycleDetector.ts
+var CycleDetector = class {
+  graph = /* @__PURE__ */ new Map();
+  addEdge(from, to) {
+    let deps = this.graph.get(from);
+    if (!deps) {
+      deps = /* @__PURE__ */ new Set();
+      this.graph.set(from, deps);
+    }
+    deps.add(to);
+    if (this.hasCycle(to, /* @__PURE__ */ new Set([from]))) {
+      deps.delete(to);
+      if (deps.size === 0) this.graph.delete(from);
+      throw new Error(
+        `SkyGraph: circular dependency detected: ${from} -> ${to}`
+      );
+    }
+  }
+  removeNode(id) {
+    this.graph.delete(id);
+    for (const deps of this.graph.values()) {
+      deps.delete(id);
+    }
+  }
+  getDependents(id) {
+    const targets = this.graph.get(id);
+    return targets ? [...targets] : [];
+  }
+  hasCycle(node, visited) {
+    if (visited.has(node)) return true;
+    const deps = this.graph.get(node);
+    if (!deps) return false;
+    visited.add(node);
+    for (const dep of deps) {
+      if (this.hasCycle(dep, new Set(visited))) return true;
+    }
+    return false;
+  }
+};
+
+// src/runtime/ComputedEngine.ts
+var ComputedEngine = class {
+  computedNodes = /* @__PURE__ */ new Map();
+  cycleDetector = new CycleDetector();
+  register(target, deps, fn) {
+    if (this.computedNodes.has(target)) {
+      this.remove(target);
+    }
+    for (const dep of deps) {
+      this.cycleDetector.addEdge(dep, target);
+    }
+    this.computedNodes.set(target, { target, deps, fn });
+  }
+  remove(target) {
+    this.computedNodes.delete(target);
+    this.cycleDetector.removeNode(target);
+  }
+  isComputed(path) {
+    return this.computedNodes.has(path);
+  }
+  /**
+   * Like propagate, but returns both new and old values for middleware support.
+   * Does NOT write to the store — the caller handles that via dispatchWrite.
+   */
+  propagateRaw(changedPaths, store) {
+    const result = /* @__PURE__ */ new Map();
+    const visited = /* @__PURE__ */ new Set();
+    const queue = [...changedPaths];
+    while (queue.length > 0) {
+      const path = queue.shift();
+      if (visited.has(path)) continue;
+      visited.add(path);
+      const dependents = this.cycleDetector.getDependents(path);
+      for (const depTarget of dependents) {
+        const computed = this.computedNodes.get(depTarget);
+        if (!computed) continue;
+        const depValues = computed.deps.map((d) => {
+          const pending = result.get(d);
+          return pending ? pending.value : store.get(d);
+        });
+        const newValue = computed.fn(...depValues);
+        const oldValue = result.has(depTarget) ? result.get(depTarget).oldValue : store.get(depTarget);
+        if (!Object.is(newValue, oldValue)) {
+          result.set(depTarget, { value: newValue, oldValue });
+          queue.push(depTarget);
+        }
+      }
+    }
+    return result;
+  }
+  /**
+   * Initialize all computed values based on current store state.
+   */
+  initializeAll(store) {
+    for (const computed of this.computedNodes.values()) {
+      const depValues = computed.deps.map((d) => store.get(d));
+      const value = computed.fn(...depValues);
+      store.set(computed.target, value);
+    }
+  }
+};
+
+export {
+  createNode,
+  Store,
+  SubscriptionEngine,
+  Batch,
+  Transaction,
+  CycleDetector,
+  ComputedEngine
+};
+//# sourceMappingURL=chunk-GEMALROQ.js.map