@horizon36596/zenith-core 0.1.1

package/dist/edit/groups.d.ts

@@ -0,0 +1,66 @@
+import { type Auto, type ParallelStep, type Step, type Waypoints } from "@horizon36596/zenith-schema";
+/**
+ * Wraps the steps named by `ids` in a new `sequence` or `parallel` group, in place.
+ *
+ * The steps must be siblings (members of one list: the top level, one group, or one branch arm)
+ * and must form one unbroken run in that list, in any order in `ids`; the group takes their
+ * document order. A `parallel` group takes `mode` (default `all`); a `deadline` group's deadline
+ * is the first member that drives the robot, or the first member when none does.
+ *
+ * The new group gets an explicit id (`sequence`, `parallel`, disambiguated with `-2`, `-3`, ...),
+ * which the result's `id` reports. When the run held the deadline of the parallel group around it,
+ * that deadline now names the new group, which is the member that contains it.
+ */
+export declare function wrapSteps(auto: Auto, ids: readonly string[], kind: "sequence" | "parallel", mode?: ParallelStep["mode"]): Auto;
+/** `wrapSteps`, also returning the id the new group was given. */
+export declare function wrapStepsWithId(auto: Auto, ids: readonly string[], kind: "sequence" | "parallel", mode?: ParallelStep["mode"]): {
+    auto: Auto;
+    id: string;
+};
+/**
+ * Replaces the `sequence` or `parallel` group `id` with its members, in place, in the list that
+ * held it. A branch is refused: its two arms cannot both stand where it stood.
+ *
+ * The members keep the ids they had (a positional member is given its old id explicitly), and so
+ * do the siblings after it whose position shifts. When the group was the deadline of the parallel
+ * group around it, that deadline passes to the member that decided when the group ended: its own
+ * deadline for a deadline group, else its last member that drives, else its last member.
+ */
+export declare function unwrapStep(auto: Auto, id: string): Auto;
+/** What `insertStepAfter` did, and what it left for the editor to offer. */
+export interface InsertResult {
+    auto: Auto;
+    /** The id the new step was given. */
+    id: string;
+    /**
+     * The path step after the new one that no longer starts where the robot now is, when there is
+     * one: the editor offers `repairContinuity` on it. Null when the insertion left no new gap.
+     */
+    continuityGapStepId: string | null;
+    /** How far that step starts from where the robot now is, in inches, when there is a gap. */
+    continuityGapIn: number | null;
+}
+/**
+ * Inserts `step` right after `afterId`, continuing from where that step ends
+ * (site/docs/editor.md, "The insert menu").
+ *
+ * When the new step is a path, its first segment starts at the pose the step at `afterId` ends
+ * at: `"current"` when the new step runs right after it (the top level, a sequence, a branch arm),
+ * or that pose written out when the two are members of one parallel group, where `"current"`
+ * would mean the pose the group started at. `waypoints` resolves any references on the way to
+ * that pose.
+ *
+ * The step after the insertion point used to follow `afterId` and now follows the new step, so it
+ * may no longer start where the robot is. The result names it (`continuityGapStepId`) when the
+ * insertion opened a CONTINUITY gap there that was not there before, and `repairContinuity` fixes
+ * it. A step without an explicit id is given one, as `addStep` does.
+ */
+export declare function insertStepAfter(auto: Auto, afterId: string, step: Step, waypoints?: Waypoints): InsertResult;
+/**
+ * Makes the path step `stepId` start wherever the robot is when it begins, by setting its first
+ * segment's `from` to `"current"`. This is the repair `insertStepAfter` offers for the gap it can
+ * leave; it removes a CONTINUITY finding between steps, and leaves any gap between one segment and
+ * the next inside the step alone.
+ */
+export declare function repairContinuity(auto: Auto, stepId: string): Auto;
+//# sourceMappingURL=groups.d.ts.map

package/dist/edit/groups.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"groups.d.ts","sourceRoot":"","sources":["../../src/edit/groups.ts"],"names":[],"mappings":"AAAA,OAAO,EAGL,KAAK,IAAI,EACT,KAAK,YAAY,EAGjB,KAAK,IAAI,EACT,KAAK,SAAS,EACf,MAAM,6BAA6B,CAAC;AA+FrC;;;;;;;;;;;GAWG;AACH,wBAAgB,SAAS,CACvB,IAAI,EAAE,IAAI,EACV,GAAG,EAAE,SAAS,MAAM,EAAE,EACtB,IAAI,EAAE,UAAU,GAAG,UAAU,EAC7B,IAAI,CAAC,EAAE,YAAY,CAAC,MAAM,CAAC,GAC1B,IAAI,CAEN;AAED,kEAAkE;AAClE,wBAAgB,eAAe,CAC7B,IAAI,EAAE,IAAI,EACV,GAAG,EAAE,SAAS,MAAM,EAAE,EACtB,IAAI,EAAE,UAAU,GAAG,UAAU,EAC7B,IAAI,CAAC,EAAE,YAAY,CAAC,MAAM,CAAC,GAC1B;IAAE,IAAI,EAAE,IAAI,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,CA2D5B;AAaD;;;;;;;;GAQG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI,CA6BvD;AAED,4EAA4E;AAC5E,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,IAAI,CAAC;IACX,qCAAqC;IACrC,EAAE,EAAE,MAAM,CAAC;IACX;;;OAGG;IACH,mBAAmB,EAAE,MAAM,GAAG,IAAI,CAAC;IACnC,4FAA4F;IAC5F,eAAe,EAAE,MAAM,GAAG,IAAI,CAAC;CAChC;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,eAAe,CAC7B,IAAI,EAAE,IAAI,EACV,OAAO,EAAE,MAAM,EACf,IAAI,EAAE,IAAI,EACV,SAAS,CAAC,EAAE,SAAS,GACpB,YAAY,CA6Dd;AAYD;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAcjE"}

package/dist/edit/groups.js

@@ -0,0 +1,277 @@
+import { childLists, withChildLists, } from "@horizon36596/zenith-schema";
+import { continuityGaps } from "../continuity.js";
+import { resolve } from "../resolve.js";
+import { EditError } from "./errors.js";
+import { finish } from "./finish.js";
+import { childPrefix, collectIds, effectiveId, uniqueId } from "./ids.js";
+import { findStep, insertAfter, updateStep } from "./tree.js";
+/** Finds the list whose members include `targetId`, anywhere in the tree. */
+function locate(steps, prefix, targetId, parent = null, parentId = null) {
+    for (const [index, step] of steps.entries()) {
+        const id = effectiveId(step, index, prefix);
+        if (id === targetId)
+            return { list: steps, prefix, parent, parentId };
+        const lists = childLists(step);
+        for (const [listIndex, list] of lists.entries()) {
+            const found = locate(list, childPrefix(id, lists.length, listIndex), targetId, step, id);
+            if (found !== null)
+                return found;
+        }
+    }
+    return null;
+}
+/**
+ * Replaces the list that holds `targetId` with `transform(list, prefix)`, wherever it sits.
+ * Returns null when no list holds it.
+ */
+function replaceList(steps, prefix, targetId, transform) {
+    for (const [index, step] of steps.entries()) {
+        if (effectiveId(step, index, prefix) === targetId)
+            return transform(steps, prefix);
+    }
+    for (const [index, step] of steps.entries()) {
+        const id = effectiveId(step, index, prefix);
+        const lists = childLists(step);
+        for (const [listIndex, list] of lists.entries()) {
+            const replaced = replaceList(list, childPrefix(id, lists.length, listIndex), targetId, transform);
+            if (replaced === null)
+                continue;
+            const rebuilt = lists.map((original, i) => (i === listIndex ? replaced : original));
+            return steps.map((sibling, i) => (i === index ? withChildLists(step, rebuilt) : sibling));
+        }
+    }
+    return null;
+}
+/** The step with its effective id written out, so moving it cannot change what it is called. */
+const pinned = (step, index, prefix) => step.id === undefined ? { ...step, id: effectiveId(step, index, prefix) } : step;
+/** Every `parallel.deadline` equal to `oldId` renamed to `newId`, throughout the tree. */
+function renameDeadline(steps, oldId, newId) {
+    return steps.map((step) => {
+        const lists = childLists(step);
+        if (lists.length === 0)
+            return step;
+        const updated = withChildLists(step, lists.map((list) => renameDeadline(list, oldId, newId)));
+        if (updated.kind === "parallel" && updated.deadline === oldId)
+            updated.deadline = newId;
+        return updated;
+    });
+}
+/**
+ * Wraps the steps named by `ids` in a new `sequence` or `parallel` group, in place.
+ *
+ * The steps must be siblings (members of one list: the top level, one group, or one branch arm)
+ * and must form one unbroken run in that list, in any order in `ids`; the group takes their
+ * document order. A `parallel` group takes `mode` (default `all`); a `deadline` group's deadline
+ * is the first member that drives the robot, or the first member when none does.
+ *
+ * The new group gets an explicit id (`sequence`, `parallel`, disambiguated with `-2`, `-3`, ...),
+ * which the result's `id` reports. When the run held the deadline of the parallel group around it,
+ * that deadline now names the new group, which is the member that contains it.
+ */
+export function wrapSteps(auto, ids, kind, mode) {
+    return wrapStepsWithId(auto, ids, kind, mode).auto;
+}
+/** `wrapSteps`, also returning the id the new group was given. */
+export function wrapStepsWithId(auto, ids, kind, mode) {
+    if (ids.length === 0)
+        throw new EditError("Name at least one step to wrap.");
+    if (kind === "sequence" && mode !== undefined) {
+        throw new EditError("A sequence has no mode; only a parallel group runs all, race or deadline.");
+    }
+    const first = ids[0];
+    const where = locate(auto.steps, "step", first);
+    if (where === null)
+        throw new EditError(`No step with id ${JSON.stringify(first)}.`);
+    const positions = ids.map((id) => {
+        const index = where.list.findIndex((step, i) => effectiveId(step, i, where.prefix) === id);
+        if (index < 0) {
+            throw new EditError(findStep(auto.steps, "step", id) === null
+                ? `No step with id ${JSON.stringify(id)}.`
+                : `Steps ${JSON.stringify(first)} and ${JSON.stringify(id)} are not in the same list; only siblings can be wrapped together.`);
+        }
+        return index;
+    });
+    const sorted = [...new Set(positions)].sort((a, b) => a - b);
+    const start = sorted[0];
+    const end = sorted[sorted.length - 1];
+    if (end - start + 1 !== sorted.length) {
+        throw new EditError("The steps to wrap have to be one unbroken run; wrapping steps with others between them would move those others.");
+    }
+    const groupId = uniqueId(kind, collectIds(auto.steps));
+    const steps = replaceList(auto.steps, "step", first, (list, prefix) => {
+        const frozen = list.map((step, index) => (index >= start ? pinned(step, index, prefix) : step));
+        const members = frozen.slice(start, end + 1);
+        let group;
+        if (kind === "sequence") {
+            const sequence = { id: groupId, kind: "sequence", steps: members };
+            group = sequence;
+        }
+        else {
+            const parallel = { id: groupId, kind: "parallel", mode: mode ?? "all", steps: members };
+            if (parallel.mode === "deadline") {
+                const driver = members.find((member) => stepDrives(member)) ?? members[0];
+                if (driver?.id !== undefined)
+                    parallel.deadline = driver.id;
+            }
+            group = parallel;
+        }
+        return [...frozen.slice(0, start), group, ...frozen.slice(end + 1)];
+    });
+    if (steps === null)
+        throw new EditError(`No step with id ${JSON.stringify(first)}.`);
+    let result = steps;
+    if (where.parent?.kind === "parallel" && where.parent.deadline !== undefined) {
+        const wrappedIds = new Set(where.list.slice(start, end + 1).map((step, i) => effectiveId(step, start + i, where.prefix)));
+        if (wrappedIds.has(where.parent.deadline)) {
+            result = repointParentDeadline(result, where.parentId, groupId);
+        }
+    }
+    return { auto: finish({ ...auto, steps: result }), id: groupId };
+}
+/** Sets the `deadline` of the parallel group `parentId` to `deadline`. */
+function repointParentDeadline(steps, parentId, deadline) {
+    return updateStep(steps, "step", parentId, (parent) => parent.kind === "parallel" ? { ...parent, deadline } : undefined).steps;
+}
+/** True for a path step, or a group with one somewhere inside it. */
+const stepDrives = (step) => step.kind === "path" || childLists(step).some((list) => list.some(stepDrives));
+/**
+ * Replaces the `sequence` or `parallel` group `id` with its members, in place, in the list that
+ * held it. A branch is refused: its two arms cannot both stand where it stood.
+ *
+ * The members keep the ids they had (a positional member is given its old id explicitly), and so
+ * do the siblings after it whose position shifts. When the group was the deadline of the parallel
+ * group around it, that deadline passes to the member that decided when the group ended: its own
+ * deadline for a deadline group, else its last member that drives, else its last member.
+ */
+export function unwrapStep(auto, id) {
+    const where = locate(auto.steps, "step", id);
+    if (where === null)
+        throw new EditError(`No step with id ${JSON.stringify(id)}.`);
+    const index = where.list.findIndex((step, i) => effectiveId(step, i, where.prefix) === id);
+    const group = where.list[index];
+    if (group.kind !== "sequence" && group.kind !== "parallel") {
+        throw new EditError(`Step ${JSON.stringify(id)} is a ${group.kind} step; only a sequence or a parallel group can be unwrapped.`);
+    }
+    const memberPrefix = childPrefix(id, 1, 0);
+    const members = group.steps.map((member, i) => pinned(member, i, memberPrefix));
+    const successor = (group.kind === "parallel" && group.deadline !== undefined
+        ? members.find((member) => member.id === group.deadline)
+        : undefined) ??
+        [...members].reverse().find((member) => stepDrives(member)) ??
+        members[members.length - 1];
+    const steps = replaceList(auto.steps, "step", id, (list, prefix) => {
+        const frozen = list.map((step, i) => (i > index ? pinned(step, i, prefix) : step));
+        return [...frozen.slice(0, index), ...members, ...frozen.slice(index + 1)];
+    });
+    if (steps === null)
+        throw new EditError(`No step with id ${JSON.stringify(id)}.`);
+    const result = successor?.id === undefined ? steps : renameDeadline(steps, id, successor.id);
+    return finish({ ...auto, steps: result });
+}
+/**
+ * Inserts `step` right after `afterId`, continuing from where that step ends
+ * (site/docs/editor.md, "The insert menu").
+ *
+ * When the new step is a path, its first segment starts at the pose the step at `afterId` ends
+ * at: `"current"` when the new step runs right after it (the top level, a sequence, a branch arm),
+ * or that pose written out when the two are members of one parallel group, where `"current"`
+ * would mean the pose the group started at. `waypoints` resolves any references on the way to
+ * that pose.
+ *
+ * The step after the insertion point used to follow `afterId` and now follows the new step, so it
+ * may no longer start where the robot is. The result names it (`continuityGapStepId`) when the
+ * insertion opened a CONTINUITY gap there that was not there before, and `repairContinuity` fixes
+ * it. A step without an explicit id is given one, as `addStep` does.
+ */
+export function insertStepAfter(auto, afterId, step, waypoints) {
+    const where = locate(auto.steps, "step", afterId);
+    if (where === null)
+        throw new EditError(`No step with id ${JSON.stringify(afterId)} to insert after.`);
+    const before = resolve(auto, waypoints);
+    const anchor = findResolved(before.steps, afterId);
+    if (anchor === null)
+        throw new EditError(`No step with id ${JSON.stringify(afterId)} to insert after.`);
+    let placed = step;
+    if (step.kind === "path") {
+        const concurrent = where.parent?.kind === "parallel";
+        const from = concurrent
+            ? {
+                xIn: anchor.endPose.xIn,
+                yIn: anchor.endPose.yIn,
+                headingRad: anchor.endPose.headingRad,
+                provenance: `SET FROM EDITOR: where ${afterId} ends`,
+            }
+            : "current";
+        const [firstSegment, ...rest] = step.segments;
+        if (firstSegment !== undefined) {
+            const path = { ...step, segments: [{ ...firstSegment, from }, ...rest] };
+            placed = path;
+        }
+    }
+    // Positional siblings after the insertion point shift by one; pin them first so they keep the
+    // ids the caller knows them by.
+    const frozen = replaceList(auto.steps, "step", afterId, (list, prefix) => {
+        const at = list.findIndex((sibling, i) => effectiveId(sibling, i, prefix) === afterId);
+        return list.map((sibling, i) => (i > at ? pinned(sibling, i, prefix) : sibling));
+    });
+    if (frozen === null)
+        throw new EditError(`No step with id ${JSON.stringify(afterId)} to insert after.`);
+    const PENDING = " inserting";
+    const inserted = insertAfter(frozen, "step", afterId, { ...placed, id: PENDING });
+    const taken = collectIds(inserted.steps);
+    taken.delete(PENDING);
+    let id;
+    if (step.id === undefined) {
+        id = uniqueId(step.kind, taken);
+    }
+    else {
+        if (taken.has(step.id)) {
+            throw new EditError(`A step with id ${JSON.stringify(step.id)} already exists.`);
+        }
+        id = step.id;
+    }
+    const named = updateStep(inserted.steps, "step", PENDING, (pending) => ({ ...pending, id }));
+    const result = finish({ ...auto, steps: named.steps });
+    const gapsBefore = new Map(continuityGaps(before.steps, before.startPose).map((gap) => [gap.stepId, gap.gapIn]));
+    const afterResolve = resolve(result, waypoints);
+    const opened = continuityGaps(afterResolve.steps, afterResolve.startPose).find((gap) => gap.stepId !== id && gap.gapIn > (gapsBefore.get(gap.stepId) ?? 0));
+    return {
+        auto: result,
+        id,
+        continuityGapStepId: opened?.stepId ?? null,
+        continuityGapIn: opened?.gapIn ?? null,
+    };
+}
+/** The resolved step with this id, anywhere in the tree. */
+function findResolved(steps, id) {
+    for (const step of steps) {
+        if (step.id === id)
+            return step;
+        const nested = findResolved(step.children ?? [], id);
+        if (nested !== null)
+            return nested;
+    }
+    return null;
+}
+/**
+ * Makes the path step `stepId` start wherever the robot is when it begins, by setting its first
+ * segment's `from` to `"current"`. This is the repair `insertStepAfter` offers for the gap it can
+ * leave; it removes a CONTINUITY finding between steps, and leaves any gap between one segment and
+ * the next inside the step alone.
+ */
+export function repairContinuity(auto, stepId) {
+    const result = updateStep(auto.steps, "step", stepId, (step) => {
+        if (step.kind !== "path") {
+            throw new EditError(`Step ${JSON.stringify(stepId)} is a ${step.kind} step; only a path step has a start to repair.`);
+        }
+        const [firstSegment, ...rest] = step.segments;
+        if (firstSegment === undefined)
+            return undefined;
+        const path = { ...step, segments: [{ ...firstSegment, from: "current" }, ...rest] };
+        return path;
+    });
+    if (!result.found)
+        throw new EditError(`No step with id ${JSON.stringify(stepId)}.`);
+    return finish({ ...auto, steps: result.steps });
+}
+//# sourceMappingURL=groups.js.map

package/dist/edit/groups.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"groups.js","sourceRoot":"","sources":["../../src/edit/groups.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,UAAU,EACV,cAAc,GAOf,MAAM,6BAA6B,CAAC;AACrC,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,OAAO,EAAqB,MAAM,eAAe,CAAC;AAC3D,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACrC,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAC;AAC1E,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAyB9D,6EAA6E;AAC7E,SAAS,MAAM,CACb,KAAsB,EACtB,MAAc,EACd,QAAgB,EAChB,SAAsB,IAAI,EAC1B,WAA0B,IAAI;IAE9B,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QAC5C,MAAM,EAAE,GAAG,WAAW,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;QAC5C,IAAI,EAAE,KAAK,QAAQ;YAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;QACtE,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;QAC/B,KAAK,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YAChD,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,EAAE,WAAW,CAAC,EAAE,EAAE,KAAK,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;YACzF,IAAI,KAAK,KAAK,IAAI;gBAAE,OAAO,KAAK,CAAC;QACnC,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,SAAS,WAAW,CAClB,KAAsB,EACtB,MAAc,EACd,QAAgB,EAChB,SAA4D;IAE5D,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QAC5C,IAAI,WAAW,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,QAAQ;YAAE,OAAO,SAAS,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACrF,CAAC;IACD,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QAC5C,MAAM,EAAE,GAAG,WAAW,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;QAC5C,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;QAC/B,KAAK,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YAChD,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC,EAAE,EAAE,KAAK,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;YAClG,IAAI,QAAQ,KAAK,IAAI;gBAAE,SAAS;YAChC,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;YACpF,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5F,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,gGAAgG;AAChG,MAAM,MAAM,GAAG,CAAC,IAAU,EAAE,KAAa,EAAE,MAAc,EAAQ,EAAE,CACjE,IAAI,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,WAAW,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;AAEnF,0FAA0F;AAC1F,SAAS,cAAc,CAAC,KAAsB,EAAE,KAAa,EAAE,KAAa;IAC1E,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACxB,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACpC,MAAM,OAAO,GAAG,cAAc,CAC5B,IAAI,EACJ,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,cAAc,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CACxD,CAAC;QACF,IAAI,OAAO,CAAC,IAAI,KAAK,UAAU,IAAI,OAAO,CAAC,QAAQ,KAAK,KAAK;YAAE,OAAO,CAAC,QAAQ,GAAG,KAAK,CAAC;QACxF,OAAO,OAAO,CAAC;IACjB,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,SAAS,CACvB,IAAU,EACV,GAAsB,EACtB,IAA6B,EAC7B,IAA2B;IAE3B,OAAO,eAAe,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC;AACrD,CAAC;AAED,kEAAkE;AAClE,MAAM,UAAU,eAAe,CAC7B,IAAU,EACV,GAAsB,EACtB,IAA6B,EAC7B,IAA2B;IAE3B,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,IAAI,SAAS,CAAC,iCAAiC,CAAC,CAAC;IAC7E,IAAI,IAAI,KAAK,UAAU,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QAC9C,MAAM,IAAI,SAAS,CAAC,2EAA2E,CAAC,CAAC;IACnG,CAAC;IACD,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAW,CAAC;IAC/B,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAChD,IAAI,KAAK,KAAK,IAAI;QAAE,MAAM,IAAI,SAAS,CAAC,mBAAmB,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAErF,MAAM,SAAS,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE;QAC/B,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;QAC3F,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,MAAM,IAAI,SAAS,CACjB,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC,KAAK,IAAI;gBACvC,CAAC,CAAC,mBAAmB,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG;gBAC1C,CAAC,CAAC,SAAS,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,mEAAmE,CAChI,CAAC;QACJ,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC,CAAC,CAAC;IACH,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7D,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAW,CAAC;IAClC,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAW,CAAC;IAChD,IAAI,GAAG,GAAG,KAAK,GAAG,CAAC,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;QACtC,MAAM,IAAI,SAAS,CACjB,iHAAiH,CAClH,CAAC;IACJ,CAAC;IAED,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IACvD,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE;QACpE,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAChG,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;QAC7C,IAAI,KAAW,CAAC;QAChB,IAAI,IAAI,KAAK,UAAU,EAAE,CAAC;YACxB,MAAM,QAAQ,GAAiB,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;YACjF,KAAK,GAAG,QAAQ,CAAC;QACnB,CAAC;aAAM,CAAC;YACN,MAAM,QAAQ,GAAiB,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,IAAI,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;YACtG,IAAI,QAAQ,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;gBACjC,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC1E,IAAI,MAAM,EAAE,EAAE,KAAK,SAAS;oBAAE,QAAQ,CAAC,QAAQ,GAAG,MAAM,CAAC,EAAE,CAAC;YAC9D,CAAC;YACD,KAAK,GAAG,QAAQ,CAAC;QACnB,CAAC;QACD,OAAO,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACtE,CAAC,CAAC,CAAC;IACH,IAAI,KAAK,KAAK,IAAI;QAAE,MAAM,IAAI,SAAS,CAAC,mBAAmB,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAErF,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,IAAI,KAAK,CAAC,MAAM,EAAE,IAAI,KAAK,UAAU,IAAI,KAAK,CAAC,MAAM,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC7E,MAAM,UAAU,GAAG,IAAI,GAAG,CACxB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAC9F,CAAC;QACF,IAAI,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC1C,MAAM,GAAG,qBAAqB,CAAC,MAAM,EAAE,KAAK,CAAC,QAAkB,EAAE,OAAO,CAAC,CAAC;QAC5E,CAAC;IACH,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC;AACnE,CAAC;AAED,0EAA0E;AAC1E,SAAS,qBAAqB,CAAC,KAAa,EAAE,QAAgB,EAAE,QAAgB;IAC9E,OAAO,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,MAAM,EAAE,EAAE,CACpD,MAAM,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,SAAS,CACjE,CAAC,KAAK,CAAC;AACV,CAAC;AAED,qEAAqE;AACrE,MAAM,UAAU,GAAG,CAAC,IAAU,EAAW,EAAE,CACzC,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;AAEjF;;;;;;;;GAQG;AACH,MAAM,UAAU,UAAU,CAAC,IAAU,EAAE,EAAU;IAC/C,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;IAC7C,IAAI,KAAK,KAAK,IAAI;QAAE,MAAM,IAAI,SAAS,CAAC,mBAAmB,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IAClF,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;IAC3F,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAS,CAAC;IACxC,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAC3D,MAAM,IAAI,SAAS,CACjB,QAAQ,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,IAAI,8DAA8D,CAC5G,CAAC;IACJ,CAAC;IAED,MAAM,YAAY,GAAG,WAAW,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC;IAChF,MAAM,SAAS,GACb,CAAC,KAAK,CAAC,IAAI,KAAK,UAAU,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS;QACxD,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,KAAK,KAAK,CAAC,QAAQ,CAAC;QACxD,CAAC,CAAC,SAAS,CAAC;QACd,CAAC,GAAG,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC3D,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAE9B,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE;QACjE,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACnF,OAAO,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,GAAG,OAAO,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7E,CAAC,CAAC,CAAC;IACH,IAAI,KAAK,KAAK,IAAI;QAAE,MAAM,IAAI,SAAS,CAAC,mBAAmB,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IAElF,MAAM,MAAM,GACV,SAAS,EAAE,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,EAAE,EAAE,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC;IAChF,OAAO,MAAM,CAAC,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;AAC5C,CAAC;AAgBD;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,eAAe,CAC7B,IAAU,EACV,OAAe,EACf,IAAU,EACV,SAAqB;IAErB,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IAClD,IAAI,KAAK,KAAK,IAAI;QAAE,MAAM,IAAI,SAAS,CAAC,mBAAmB,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,mBAAmB,CAAC,CAAC;IAEvG,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IACxC,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACnD,IAAI,MAAM,KAAK,IAAI;QAAE,MAAM,IAAI,SAAS,CAAC,mBAAmB,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,mBAAmB,CAAC,CAAC;IAExG,IAAI,MAAM,GAAS,IAAI,CAAC;IACxB,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QACzB,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,EAAE,IAAI,KAAK,UAAU,CAAC;QACrD,MAAM,IAAI,GAAG,UAAU;YACrB,CAAC,CAAC;gBACE,GAAG,EAAE,MAAM,CAAC,OAAO,CAAC,GAAG;gBACvB,GAAG,EAAE,MAAM,CAAC,OAAO,CAAC,GAAG;gBACvB,UAAU,EAAE,MAAM,CAAC,OAAO,CAAC,UAAU;gBACrC,UAAU,EAAE,0BAA0B,OAAO,OAAO;aACrD;YACH,CAAC,CAAE,SAAmB,CAAC;QACzB,MAAM,CAAC,YAAY,EAAE,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC9C,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;YAC/B,MAAM,IAAI,GAAa,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,CAAC,EAAE,GAAG,YAAY,EAAE,IAAI,EAAE,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;YACnF,MAAM,GAAG,IAAI,CAAC;QAChB,CAAC;IACH,CAAC;IAED,8FAA8F;IAC9F,gCAAgC;IAChC,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE;QACvE,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,OAAO,EAAE,CAAC,EAAE,MAAM,CAAC,KAAK,OAAO,CAAC,CAAC;QACvF,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;IACnF,CAAC,CAAC,CAAC;IACH,IAAI,MAAM,KAAK,IAAI;QAAE,MAAM,IAAI,SAAS,CAAC,mBAAmB,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,mBAAmB,CAAC,CAAC;IAExG,MAAM,OAAO,GAAG,YAAY,CAAC;IAC7B,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;IAClF,MAAM,KAAK,GAAG,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IACzC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACtB,IAAI,EAAU,CAAC;IACf,IAAI,IAAI,CAAC,EAAE,KAAK,SAAS,EAAE,CAAC;QAC1B,EAAE,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAClC,CAAC;SAAM,CAAC;QACN,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,SAAS,CAAC,kBAAkB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,kBAAkB,CAAC,CAAC;QACnF,CAAC;QACD,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;IACf,CAAC;IACD,MAAM,KAAK,GAAG,UAAU,CAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IAC7F,MAAM,MAAM,GAAG,MAAM,CAAC,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;IAEvD,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACjH,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAChD,MAAM,MAAM,GAAG,cAAc,CAAC,YAAY,CAAC,KAAK,EAAE,YAAY,CAAC,SAAS,CAAC,CAAC,IAAI,CAC5E,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,KAAK,EAAE,IAAI,GAAG,CAAC,KAAK,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAC5E,CAAC;IACF,OAAO;QACL,IAAI,EAAE,MAAM;QACZ,EAAE;QACF,mBAAmB,EAAE,MAAM,EAAE,MAAM,IAAI,IAAI;QAC3C,eAAe,EAAE,MAAM,EAAE,KAAK,IAAI,IAAI;KACvC,CAAC;AACJ,CAAC;AAED,4DAA4D;AAC5D,SAAS,YAAY,CAAC,KAA8B,EAAE,EAAU;IAC9D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,EAAE,KAAK,EAAE;YAAE,OAAO,IAAI,CAAC;QAChC,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,IAAI,MAAM,KAAK,IAAI;YAAE,OAAO,MAAM,CAAC;IACrC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAU,EAAE,MAAc;IACzD,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE;QAC7D,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YACzB,MAAM,IAAI,SAAS,CACjB,QAAQ,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,SAAS,IAAI,CAAC,IAAI,gDAAgD,CACjG,CAAC;QACJ,CAAC;QACD,MAAM,CAAC,YAAY,EAAE,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC9C,IAAI,YAAY,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QACjD,MAAM,IAAI,GAAa,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,CAAC,EAAE,GAAG,YAAY,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QAC9F,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,MAAM,CAAC,KAAK;QAAE,MAAM,IAAI,SAAS,CAAC,mBAAmB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACrF,OAAO,MAAM,CAAC,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;AAClD,CAAC"}

package/dist/edit/ids.d.ts

@@ -0,0 +1,39 @@
+import { type Step } from "@horizon36596/zenith-schema";
+/**
+ * The id a step is addressed by, whether or not it carries an explicit `id` field. This is the one
+ * definition: `resolve()`, `diff()` and the editor's step list all call it, so a `stepId` an edit
+ * primitive accepts, a `Finding.stepId` a check raises and the id the inspector shows are always
+ * the same string.
+ *
+ * A step with no explicit id is positional: removing or inserting a sibling before it in the same
+ * list changes its effective id. That is inherent to the file format, not something an edit
+ * primitive can paper over, which is why `addStep` always gives the new step an explicit id
+ * (`uniqueId` below) rather than leaving it positional.
+ */
+export declare function effectiveId(step: Step, index: number, prefix: string): string;
+/**
+ * The id prefix `resolve()` gives the children of a group step: `grp.` for the one list of a
+ * sequence or parallel group (so its members are `grp.1`, `grp.2`), and `br.1.` / `br.2.` for the
+ * two arms of a branch that has both. `branchCount` is how many child lists the group has, which
+ * `childLists` answers.
+ */
+export declare function childPrefix(parentId: string, branchCount: number, branchIndex: number): string;
+/**
+ * Every effective id in a step forest, depth first, in document order and with repeats kept.
+ *
+ * `collectIds` folds this into a set for the "is this id taken" question; `duplicateIds` is the
+ * other half, because an id that appears twice makes every finding, fix and edit primitive
+ * ambiguous and has to be reported rather than quietly collapsed.
+ */
+export declare function listIds(steps: readonly Step[], prefix?: string, ids?: string[]): string[];
+/** Every effective id in a step forest, depth first, for uniqueness checks. */
+export declare function collectIds(steps: readonly Step[], prefix?: string): Set<string>;
+/** The effective ids that appear more than once, in the order they are first seen. */
+export declare function duplicateIds(steps: readonly Step[], prefix?: string): string[];
+/**
+ * A deterministic id derived from `base` that is not already in `taken`: `base`, then `base-2`,
+ * `base-3`, and so on. No randomness and no clock (CLAUDE.md rule 1): the same inputs always
+ * choose the same id.
+ */
+export declare function uniqueId(base: string, taken: ReadonlySet<string>): string;
+//# sourceMappingURL=ids.d.ts.map

package/dist/edit/ids.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ids.d.ts","sourceRoot":"","sources":["../../src/edit/ids.ts"],"names":[],"mappings":"AAAA,OAAO,EAAc,KAAK,IAAI,EAAE,MAAM,6BAA6B,CAAC;AAEpE;;;;;;;;;;GAUG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAE7E;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,QAAQ,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM,CAE9F;AAED;;;;;;GAMG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,SAAS,IAAI,EAAE,EAAE,MAAM,SAAS,EAAE,GAAG,GAAE,MAAM,EAAO,GAAG,MAAM,EAAE,CAU7F;AAED,+EAA+E;AAC/E,wBAAgB,UAAU,CAAC,KAAK,EAAE,SAAS,IAAI,EAAE,EAAE,MAAM,SAAS,GAAG,GAAG,CAAC,MAAM,CAAC,CAE/E;AAED,sFAAsF;AACtF,wBAAgB,YAAY,CAAC,KAAK,EAAE,SAAS,IAAI,EAAE,EAAE,MAAM,SAAS,GAAG,MAAM,EAAE,CAW9E;AAED;;;;GAIG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,GAAG,MAAM,CAOzE"}

package/dist/edit/ids.js

@@ -0,0 +1,76 @@
+import { childLists } from "@horizon36596/zenith-schema";
+/**
+ * The id a step is addressed by, whether or not it carries an explicit `id` field. This is the one
+ * definition: `resolve()`, `diff()` and the editor's step list all call it, so a `stepId` an edit
+ * primitive accepts, a `Finding.stepId` a check raises and the id the inspector shows are always
+ * the same string.
+ *
+ * A step with no explicit id is positional: removing or inserting a sibling before it in the same
+ * list changes its effective id. That is inherent to the file format, not something an edit
+ * primitive can paper over, which is why `addStep` always gives the new step an explicit id
+ * (`uniqueId` below) rather than leaving it positional.
+ */
+export function effectiveId(step, index, prefix) {
+    return step.id ?? `${prefix}${String(index + 1)}`;
+}
+/**
+ * The id prefix `resolve()` gives the children of a group step: `grp.` for the one list of a
+ * sequence or parallel group (so its members are `grp.1`, `grp.2`), and `br.1.` / `br.2.` for the
+ * two arms of a branch that has both. `branchCount` is how many child lists the group has, which
+ * `childLists` answers.
+ */
+export function childPrefix(parentId, branchCount, branchIndex) {
+    return `${parentId}.${branchCount > 1 ? `${String(branchIndex + 1)}.` : ""}`;
+}
+/**
+ * Every effective id in a step forest, depth first, in document order and with repeats kept.
+ *
+ * `collectIds` folds this into a set for the "is this id taken" question; `duplicateIds` is the
+ * other half, because an id that appears twice makes every finding, fix and edit primitive
+ * ambiguous and has to be reported rather than quietly collapsed.
+ */
+export function listIds(steps, prefix = "step", ids = []) {
+    steps.forEach((step, index) => {
+        const id = effectiveId(step, index, prefix);
+        ids.push(id);
+        const lists = childLists(step);
+        lists.forEach((list, listIndex) => {
+            listIds(list, childPrefix(id, lists.length, listIndex), ids);
+        });
+    });
+    return ids;
+}
+/** Every effective id in a step forest, depth first, for uniqueness checks. */
+export function collectIds(steps, prefix = "step") {
+    return new Set(listIds(steps, prefix));
+}
+/** The effective ids that appear more than once, in the order they are first seen. */
+export function duplicateIds(steps, prefix = "step") {
+    const seen = new Set();
+    const repeated = [];
+    for (const id of listIds(steps, prefix)) {
+        if (seen.has(id)) {
+            if (!repeated.includes(id))
+                repeated.push(id);
+            continue;
+        }
+        seen.add(id);
+    }
+    return repeated;
+}
+/**
+ * A deterministic id derived from `base` that is not already in `taken`: `base`, then `base-2`,
+ * `base-3`, and so on. No randomness and no clock (CLAUDE.md rule 1): the same inputs always
+ * choose the same id.
+ */
+export function uniqueId(base, taken) {
+    if (!taken.has(base))
+        return base;
+    for (let n = 2; n < 10000; n += 1) {
+        const candidate = `${base}-${String(n)}`;
+        if (!taken.has(candidate))
+            return candidate;
+    }
+    throw new Error(`Could not make a unique id from ${JSON.stringify(base)}.`);
+}
+//# sourceMappingURL=ids.js.map

package/dist/edit/ids.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ids.js","sourceRoot":"","sources":["../../src/edit/ids.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAa,MAAM,6BAA6B,CAAC;AAEpE;;;;;;;;;;GAUG;AACH,MAAM,UAAU,WAAW,CAAC,IAAU,EAAE,KAAa,EAAE,MAAc;IACnE,OAAO,IAAI,CAAC,EAAE,IAAI,GAAG,MAAM,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC;AACpD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,QAAgB,EAAE,WAAmB,EAAE,WAAmB;IACpF,OAAO,GAAG,QAAQ,IAAI,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,WAAW,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;AAC/E,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,OAAO,CAAC,KAAsB,EAAE,MAAM,GAAG,MAAM,EAAE,MAAgB,EAAE;IACjF,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;QAC5B,MAAM,EAAE,GAAG,WAAW,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;QAC5C,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACb,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;QAC/B,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,SAAS,EAAE,EAAE;YAChC,OAAO,CAAC,IAAI,EAAE,WAAW,CAAC,EAAE,EAAE,KAAK,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IACH,OAAO,GAAG,CAAC;AACb,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,UAAU,CAAC,KAAsB,EAAE,MAAM,GAAG,MAAM;IAChE,OAAO,IAAI,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;AACzC,CAAC;AAED,sFAAsF;AACtF,MAAM,UAAU,YAAY,CAAC,KAAsB,EAAE,MAAM,GAAG,MAAM;IAClE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,KAAK,MAAM,EAAE,IAAI,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC;QACxC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACjB,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC9C,SAAS;QACX,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACf,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY,EAAE,KAA0B;IAC/D,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAClC,MAAM,SAAS,GAAG,GAAG,IAAI,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;QACzC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC;YAAE,OAAO,SAAS,CAAC;IAC9C,CAAC;IACD,MAAM,IAAI,KAAK,CAAC,mCAAmC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAC9E,CAAC"}

package/dist/edit/index.d.ts

@@ -0,0 +1,22 @@
+/**
+ * Structural edit primitives for `*.auto.json`: pure functions
+ * that take an `Auto` and return a new one, never mutate their input, and always leave the result
+ * canonically valid — each one ends by parsing its candidate through `@horizon36596/zenith-schema`'s
+ * `parseAuto`, which throws `EditError` with a helpful message if the edit would not validate.
+ *
+ * These are what `packages/mcp`'s `zenith.edit.*` tools call, and what an editor's drag/drop and
+ * inspector panels would call too, so an agent or a human never hand-edits the JSON directly.
+ */
+export * from "./errors.js";
+export * from "./ids.js";
+export * from "./tree.js";
+export * from "./finish.js";
+export * from "./steps.js";
+export * from "./groups.js";
+export * from "./path.js";
+export * from "./fields.js";
+export * from "./command.js";
+export * from "./timing.js";
+export * from "./meta.js";
+export * from "./template.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/edit/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/edit/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,cAAc,aAAa,CAAC;AAC5B,cAAc,UAAU,CAAC;AACzB,cAAc,WAAW,CAAC;AAC1B,cAAc,aAAa,CAAC;AAC5B,cAAc,YAAY,CAAC;AAC3B,cAAc,aAAa,CAAC;AAC5B,cAAc,WAAW,CAAC;AAC1B,cAAc,aAAa,CAAC;AAC5B,cAAc,cAAc,CAAC;AAC7B,cAAc,aAAa,CAAC;AAC5B,cAAc,WAAW,CAAC;AAC1B,cAAc,eAAe,CAAC"}

package/dist/edit/index.js

@@ -0,0 +1,22 @@
+/**
+ * Structural edit primitives for `*.auto.json`: pure functions
+ * that take an `Auto` and return a new one, never mutate their input, and always leave the result
+ * canonically valid — each one ends by parsing its candidate through `@horizon36596/zenith-schema`'s
+ * `parseAuto`, which throws `EditError` with a helpful message if the edit would not validate.
+ *
+ * These are what `packages/mcp`'s `zenith.edit.*` tools call, and what an editor's drag/drop and
+ * inspector panels would call too, so an agent or a human never hand-edits the JSON directly.
+ */
+export * from "./errors.js";
+export * from "./ids.js";
+export * from "./tree.js";
+export * from "./finish.js";
+export * from "./steps.js";
+export * from "./groups.js";
+export * from "./path.js";
+export * from "./fields.js";
+export * from "./command.js";
+export * from "./timing.js";
+export * from "./meta.js";
+export * from "./template.js";
+//# sourceMappingURL=index.js.map

package/dist/edit/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/edit/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,cAAc,aAAa,CAAC;AAC5B,cAAc,UAAU,CAAC;AACzB,cAAc,WAAW,CAAC;AAC1B,cAAc,aAAa,CAAC;AAC5B,cAAc,YAAY,CAAC;AAC3B,cAAc,aAAa,CAAC;AAC5B,cAAc,WAAW,CAAC;AAC1B,cAAc,aAAa,CAAC;AAC5B,cAAc,cAAc,CAAC;AAC7B,cAAc,aAAa,CAAC;AAC5B,cAAc,WAAW,CAAC;AAC1B,cAAc,eAAe,CAAC"}

package/dist/edit/meta.d.ts

@@ -0,0 +1,15 @@
+import type { Auto } from "@horizon36596/zenith-schema";
+/** Replaces the auto's `start` (pose and holds) outright. */
+export declare function setStart(auto: Auto, start: Auto["start"]): Auto;
+/** The auto-level fields `setMeta` may change. Passing `undefined` for a field clears it. */
+export interface AutoMeta {
+    title?: string;
+    description?: string;
+    authors?: string[];
+}
+/**
+ * Merges `title`, `description` and `authors` into the auto. A field left out of `meta` is
+ * unchanged; a field present with an explicit `undefined` is cleared.
+ */
+export declare function setMeta(auto: Auto, meta: AutoMeta): Auto;
+//# sourceMappingURL=meta.d.ts.map

package/dist/edit/meta.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"meta.d.ts","sourceRoot":"","sources":["../../src/edit/meta.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,6BAA6B,CAAC;AAGxD,6DAA6D;AAC7D,wBAAgB,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,GAAG,IAAI,CAE/D;AAED,6FAA6F;AAC7F,MAAM,WAAW,QAAQ;IACvB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;CACpB;AAED;;;GAGG;AACH,wBAAgB,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,GAAG,IAAI,CAExD"}

package/dist/edit/meta.js

@@ -0,0 +1,13 @@
+import { finish } from "./finish.js";
+/** Replaces the auto's `start` (pose and holds) outright. */
+export function setStart(auto, start) {
+    return finish({ ...auto, start });
+}
+/**
+ * Merges `title`, `description` and `authors` into the auto. A field left out of `meta` is
+ * unchanged; a field present with an explicit `undefined` is cleared.
+ */
+export function setMeta(auto, meta) {
+    return finish({ ...auto, ...meta });
+}
+//# sourceMappingURL=meta.js.map

package/dist/edit/meta.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"meta.js","sourceRoot":"","sources":["../../src/edit/meta.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAErC,6DAA6D;AAC7D,MAAM,UAAU,QAAQ,CAAC,IAAU,EAAE,KAAoB;IACvD,OAAO,MAAM,CAAC,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;AACpC,CAAC;AASD;;;GAGG;AACH,MAAM,UAAU,OAAO,CAAC,IAAU,EAAE,IAAc;IAChD,OAAO,MAAM,CAAC,EAAE,GAAG,IAAI,EAAE,GAAG,IAAI,EAAE,CAAC,CAAC;AACtC,CAAC"}

package/dist/edit/path.d.ts

@@ -0,0 +1,36 @@
+import type { Auto, Heading, Marker, MarkerAt, Segment } from "@horizon36596/zenith-schema";
+/** A literal pose to write into a segment endpoint or a Bezier control point. */
+export interface PoseInput {
+    xIn: number;
+    yIn: number;
+    headingRad?: number;
+    provenance?: string;
+}
+/** Which point of which segment `setPose` targets. */
+export interface PoseTarget {
+    segmentIndex: number;
+    pointKind: "from" | "to" | "control";
+    /** Required, and only meaningful, when `pointKind` is `"control"`. */
+    controlIndex?: number;
+}
+/**
+ * Sets one point of one segment of a path step to a literal pose: a segment endpoint (`from` or
+ * `to`, replacing whatever pose source — inline pose, waypoint ref or `"current"` — was there) or
+ * one Bezier control point.
+ */
+export declare function setPose(auto: Auto, stepId: string, target: PoseTarget, pose: PoseInput): Auto;
+/** Replaces a path step's heading mode outright. */
+export declare function setHeadingMode(auto: Auto, stepId: string, heading: Heading): Auto;
+/** Sets a path step's `speedFraction` (0 exclusive, 1 inclusive; the schema enforces the range). */
+export declare function setSpeed(auto: Auto, stepId: string, fraction: number): Auto;
+/** Appends a segment to a path step. A path's segments must stay continuous; `validate` checks that. */
+export declare function addSegment(auto: Auto, stepId: string, segment: Segment): Auto;
+/** Removes the segment at `segmentIndex`. A path step needs at least one segment. */
+export declare function removeSegment(auto: Auto, stepId: string, segmentIndex: number): Auto;
+/** Adds a marker to a path step. */
+export declare function addMarker(auto: Auto, stepId: string, marker: Marker): Auto;
+/** Removes the marker at `markerIndex` from a path step. */
+export declare function removeMarker(auto: Auto, stepId: string, markerIndex: number): Auto;
+/** Moves a marker to a new `at` (path parameter, distance, or distance from the end). */
+export declare function setMarkerAt(auto: Auto, stepId: string, markerIndex: number, at: MarkerAt): Auto;
+//# sourceMappingURL=path.d.ts.map

package/dist/edit/path.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"path.d.ts","sourceRoot":"","sources":["../../src/edit/path.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAY,OAAO,EAAE,MAAM,6BAA6B,CAAC;AAKtG,iFAAiF;AACjF,MAAM,WAAW,SAAS;IACxB,GAAG,EAAE,MAAM,CAAC;IACZ,GAAG,EAAE,MAAM,CAAC;IACZ,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,sDAAsD;AACtD,MAAM,WAAW,UAAU;IACzB,YAAY,EAAE,MAAM,CAAC;IACrB,SAAS,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,CAAC;IACrC,sEAAsE;IACtE,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAQD;;;;GAIG;AACH,wBAAgB,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,SAAS,GAAG,IAAI,CAoC7F;AAED,oDAAoD;AACpD,wBAAgB,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI,CAOjF;AAED,oGAAoG;AACpG,wBAAgB,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI,CAO3E;AAED,wGAAwG;AACxG,wBAAgB,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI,CAO7E;AAED,qFAAqF;AACrF,wBAAgB,aAAa,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,IAAI,CAiBpF;AAED,oCAAoC;AACpC,wBAAgB,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAO1E;AAED,4DAA4D;AAC5D,wBAAgB,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,IAAI,CAalF;AAED,yFAAyF;AACzF,wBAAgB,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,EAAE,EAAE,QAAQ,GAAG,IAAI,CAgB/F"}