@algomotion/spec 0.0.0-stage → 1.0.0-alpha.1

package/dist/kinds/plane.js

@@ -0,0 +1,206 @@
+/**
+ * The `plane` kind (ADR 0038): points at coordinates and the segments
+ * between them, with named vertical lines (a sweep line, a dividing line)
+ * and optional axes, for computational geometry. Points and segments have
+ * ids, unique within the structure; a segment names its two end points.
+ *
+ * Marks: `highlight` and `compare` last one step; `visit`, `settle`,
+ * `select`, `pointer` and `line` persist.
+ */
+import { z } from 'zod';
+import { ElementId, isSafeKey, LIMITS, Place, PointerName } from "../common.js";
+import { typesOf } from "./kind.js";
+/** Most points, segments and lines a plane holds. */
+export const MAX_POINTS = 64;
+export const MAX_SEGMENTS = 128;
+export const MAX_LINES = 8;
+/** A coordinate: a finite number from −10⁶ to 10⁶. */
+export const Coordinate = z.number().min(-1e6).max(1e6);
+const Label = z.string().min(1).max(16);
+export const PlanePoint = z
+    .strictObject({
+    id: ElementId,
+    x: Coordinate,
+    y: Coordinate,
+    label: Label.optional().describe('Shown beside the point; its id if absent.'),
+})
+    .describe('A point at (x, y).');
+export const PlaneSegment = z
+    .strictObject({
+    id: ElementId,
+    from: ElementId.describe('The id of one end point.'),
+    to: ElementId.describe('The id of the other end point.'),
+    label: Label.optional().describe('Shown beside the segment.'),
+})
+    .describe('A segment between two points.');
+const shape = {
+    kind: z.literal('plane'),
+    label: z.string().max(LIMITS.textLength).optional(),
+    place: Place.optional(),
+    axes: z
+        .boolean()
+        .optional()
+        .describe('Draw the x and y axes (default false).'),
+};
+export const PlaneDecl = z
+    .strictObject({
+    ...shape,
+    points: z.array(PlanePoint).max(MAX_POINTS),
+    segments: z.array(PlaneSegment).max(MAX_SEGMENTS).optional(),
+})
+    .describe('Points and segments in the plane, for computational geometry.');
+export const PlaneDeclInput = z
+    .strictObject({
+    ...shape,
+    points: z
+        .array(PlanePoint)
+        .max(MAX_POINTS)
+        .optional()
+        .describe('The points; none by default.'),
+    segments: z.array(PlaneSegment).max(MAX_SEGMENTS).optional(),
+})
+    .describe('Points and segments in the plane, for computational geometry.');
+/** A segment's two ends, in either order. */
+const pairKey = (a, b) => (a < b ? `${a} ${b}` : `${b} ${a}`);
+/** Points apart, segment ends known and distinct, one segment per pair. */
+export function validatePlaneDecl(decl) {
+    const issues = [];
+    const at = new Map();
+    decl.points.forEach((p, k) => {
+        const where = `${p.x} ${p.y}`;
+        const other = at.get(where);
+        if (other !== undefined)
+            issues.push({
+                path: ['points', k],
+                message: `Points "${other}" and "${p.id}" are both at (${p.x}, ${p.y}); they would draw as one`,
+            });
+        else
+            at.set(where, p.id);
+    });
+    const ids = new Set(decl.points.map((p) => p.id));
+    const pairs = new Set();
+    (decl.segments ?? []).forEach((s, k) => {
+        for (const end of ['from', 'to'])
+            if (!ids.has(s[end]))
+                issues.push({
+                    path: ['segments', k, end],
+                    message: `Segment "${s.id}" ends at "${s[end]}", which is not a point`,
+                });
+        if (s.from === s.to)
+            issues.push({
+                path: ['segments', k, 'to'],
+                message: `Segment "${s.id}" goes from "${s.from}" to itself`,
+            });
+        const pair = pairKey(s.from, s.to);
+        if (pairs.has(pair))
+            issues.push({
+                path: ['segments', k],
+                message: `Two segments join "${s.from}" and "${s.to}"`,
+            });
+        pairs.add(pair);
+    });
+    return issues;
+}
+const PointRef = ElementId.describe('A point id.');
+const SegmentRef = ElementId.describe('A segment id.');
+const LineName = z
+    .string()
+    // No control characters, and no space at either end.
+    .regex(/^[^\s\p{Cc}](?:[^\p{Cc}]{0,10}[^\s\p{Cc}])?$/u)
+    .refine(isSafeKey, {
+    message: 'Line names may not be the names of object properties',
+})
+    .describe('A line name of up to 12 characters, e.g. "sweep", "l" or "l + δ".');
+const actions = z.discriminatedUnion('type', [
+    z
+        .strictObject({ type: z.literal('addPoint'), point: PlanePoint })
+        .describe('Add a point.'),
+    z
+        .strictObject({ type: z.literal('removePoint'), id: PointRef })
+        .describe('Remove a point that ends no segment.'),
+    z
+        .strictObject({ type: z.literal('addSegment'), segment: PlaneSegment })
+        .describe('Add a segment between two points.'),
+    z
+        .strictObject({ type: z.literal('removeSegment'), id: SegmentRef })
+        .describe('Remove a segment.'),
+    z
+        .strictObject({
+        type: z.literal('label'),
+        segment: SegmentRef,
+        text: Label.nullable(),
+    })
+        .describe("Change a segment's label, such as a distance; null removes it."),
+    z
+        .strictObject({
+        type: z.literal('highlight'),
+        points: z.array(PointRef).max(MAX_POINTS).optional(),
+        segments: z.array(SegmentRef).max(MAX_SEGMENTS).optional(),
+    })
+        .refine((a) => a.points !== undefined || a.segments !== undefined, {
+        message: 'Give `points`, `segments` or both',
+    })
+        .describe('Highlight points and segments (this step).'),
+    z
+        .strictObject({
+        type: z.literal('compare'),
+        points: z.array(PointRef).min(2).max(3),
+    })
+        .describe('Mark two or three points as being compared, as an orientation test or a distance does (this step).'),
+    z
+        .strictObject({ type: z.literal('visit'), point: PointRef })
+        .describe('Mark a point as considered (persists).'),
+    z
+        .strictObject({ type: z.literal('settle'), point: PointRef })
+        .describe('Mark a point as final, such as a hull vertex (persists).'),
+    z
+        .strictObject({
+        type: z.literal('select'),
+        segment: SegmentRef,
+        on: z.boolean(),
+    })
+        .describe('Mark a segment as chosen, such as a hull edge or a closest pair, or clear the mark (persists).'),
+    z
+        .strictObject({
+        type: z.literal('pointer'),
+        name: PointerName,
+        point: PointRef.nullable(),
+    })
+        .describe('A named badge at a point; null removes it (persists).'),
+    z
+        .strictObject({
+        type: z.literal('line'),
+        name: LineName,
+        x: Coordinate.nullable(),
+    })
+        .describe('A named vertical line at x, such as a sweep line; null removes it (persists).'),
+]);
+export const PlaneAction = actions;
+export const PlaneActionInput = actions;
+export const planeSpec = {
+    kind: 'plane',
+    decl: PlaneDecl,
+    declInput: PlaneDeclInput,
+    action: PlaneAction,
+    actionInput: PlaneActionInput,
+    actionTypes: typesOf(PlaneAction),
+    normalizeDecl: ({ points, ...rest }) => ({ ...rest, points: points ?? [] }),
+    declIds: (decl) => [
+        ...decl.points.map((p, k) => ({
+            id: p.id,
+            path: ['points', k, 'id'],
+        })),
+        ...(decl.segments ?? []).map((s, k) => ({
+            id: s.id,
+            path: ['segments', k, 'id'],
+        })),
+    ],
+    validateDecl: validatePlaneDecl,
+    normalizeAction: (input) => input,
+    introducedIds: (action) => action.type === 'addPoint'
+        ? [{ id: action.point.id, path: ['point', 'id'] }]
+        : action.type === 'addSegment'
+            ? [{ id: action.segment.id, path: ['segment', 'id'] }]
+            : [],
+};
+//# sourceMappingURL=plane.js.map

package/dist/kinds/plane.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"plane.js","sourceRoot":"","sources":["../../src/kinds/plane.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAChF,OAAO,EAAE,OAAO,EAA6C,MAAM,WAAW,CAAC;AAE/E,qDAAqD;AACrD,MAAM,CAAC,MAAM,UAAU,GAAG,EAAE,CAAC;AAC7B,MAAM,CAAC,MAAM,YAAY,GAAG,GAAG,CAAC;AAChC,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,CAAC;AAE3B,sDAAsD;AACtD,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAExD,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;AAExC,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC;KACxB,YAAY,CAAC;IACZ,EAAE,EAAE,SAAS;IACb,CAAC,EAAE,UAAU;IACb,CAAC,EAAE,UAAU;IACb,KAAK,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAC9B,2CAA2C,CAC5C;CACF,CAAC;KACD,QAAQ,CAAC,oBAAoB,CAAC,CAAC;AAGlC,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC;KAC1B,YAAY,CAAC;IACZ,EAAE,EAAE,SAAS;IACb,IAAI,EAAE,SAAS,CAAC,QAAQ,CAAC,0BAA0B,CAAC;IACpD,EAAE,EAAE,SAAS,CAAC,QAAQ,CAAC,gCAAgC,CAAC;IACxD,KAAK,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,2BAA2B,CAAC;CAC9D,CAAC;KACD,QAAQ,CAAC,+BAA+B,CAAC,CAAC;AAG7C,MAAM,KAAK,GAAG;IACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC;IACxB,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,EAAE;IACnD,KAAK,EAAE,KAAK,CAAC,QAAQ,EAAE;IACvB,IAAI,EAAE,CAAC;SACJ,OAAO,EAAE;SACT,QAAQ,EAAE;SACV,QAAQ,CAAC,wCAAwC,CAAC;CACtD,CAAC;AAEF,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC;KACvB,YAAY,CAAC;IACZ,GAAG,KAAK;IACR,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC;IAC3C,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,QAAQ,EAAE;CAC7D,CAAC;KACD,QAAQ,CAAC,+DAA+D,CAAC,CAAC;AAG7E,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC;KAC5B,YAAY,CAAC;IACZ,GAAG,KAAK;IACR,MAAM,EAAE,CAAC;SACN,KAAK,CAAC,UAAU,CAAC;SACjB,GAAG,CAAC,UAAU,CAAC;SACf,QAAQ,EAAE;SACV,QAAQ,CAAC,8BAA8B,CAAC;IAC3C,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,QAAQ,EAAE;CAC7D,CAAC;KACD,QAAQ,CAAC,+DAA+D,CAAC,CAAC;AAG7E,6CAA6C;AAC7C,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAE9E,2EAA2E;AAC3E,MAAM,UAAU,iBAAiB,CAAC,IAAe;IAC/C,MAAM,MAAM,GAAgB,EAAE,CAAC;IAC/B,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAC;IACrC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC3B,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC5B,IAAI,KAAK,KAAK,SAAS;YACrB,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC;gBACnB,OAAO,EAAE,WAAW,KAAK,UAAU,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,2BAA2B;aAChG,CAAC,CAAC;;YACA,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;IAC3B,CAAC,CAAC,CAAC;IACH,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACrC,KAAK,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,IAAI,CAAU;YACvC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBAClB,MAAM,CAAC,IAAI,CAAC;oBACV,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC,EAAE,GAAG,CAAC;oBAC1B,OAAO,EAAE,YAAY,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,GAAG,CAAC,yBAAyB;iBACvE,CAAC,CAAC;QACP,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,EAAE;YACjB,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC,EAAE,IAAI,CAAC;gBAC3B,OAAO,EAAE,YAAY,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC,IAAI,aAAa;aAC7D,CAAC,CAAC;QACL,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QACnC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;YACjB,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC,CAAC;gBACrB,OAAO,EAAE,sBAAsB,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,EAAE,GAAG;aACvD,CAAC,CAAC;QACL,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAClB,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC;AACnD,MAAM,UAAU,GAAG,SAAS,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;AACvD,MAAM,QAAQ,GAAG,CAAC;KACf,MAAM,EAAE;IACT,qDAAqD;KACpD,KAAK,CAAC,+CAA+C,CAAC;KACtD,MAAM,CAAC,SAAS,EAAE;IACjB,OAAO,EAAE,sDAAsD;CAChE,CAAC;KACD,QAAQ,CACP,mEAAmE,CACpE,CAAC;AAEJ,MAAM,OAAO,GAAG,CAAC,CAAC,kBAAkB,CAAC,MAAM,EAAE;IAC3C,CAAC;SACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;SAChE,QAAQ,CAAC,cAAc,CAAC;IAC3B,CAAC;SACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC;SAC9D,QAAQ,CAAC,sCAAsC,CAAC;IACnD,CAAC;SACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE,OAAO,EAAE,YAAY,EAAE,CAAC;SACtE,QAAQ,CAAC,mCAAmC,CAAC;IAChD,CAAC;SACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,eAAe,CAAC,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC;SAClE,QAAQ,CAAC,mBAAmB,CAAC;IAChC,CAAC;SACE,YAAY,CAAC;QACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC;QACxB,OAAO,EAAE,UAAU;QACnB,IAAI,EAAE,KAAK,CAAC,QAAQ,EAAE;KACvB,CAAC;SACD,QAAQ,CAAC,gEAAgE,CAAC;IAC7E,CAAC;SACE,YAAY,CAAC;QACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC;QAC5B,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,QAAQ,EAAE;QACpD,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,QAAQ,EAAE;KAC3D,CAAC;SACD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,QAAQ,KAAK,SAAS,EAAE;QACjE,OAAO,EAAE,mCAAmC;KAC7C,CAAC;SACD,QAAQ,CAAC,4CAA4C,CAAC;IACzD,CAAC;SACE,YAAY,CAAC;QACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC;QAC1B,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;KACxC,CAAC;SACD,QAAQ,CACP,oGAAoG,CACrG;IACH,CAAC;SACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;SAC3D,QAAQ,CAAC,wCAAwC,CAAC;IACrD,CAAC;SACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;SAC5D,QAAQ,CAAC,0DAA0D,CAAC;IACvE,CAAC;SACE,YAAY,CAAC;QACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC;QACzB,OAAO,EAAE,UAAU;QACnB,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE;KAChB,CAAC;SACD,QAAQ,CACP,gGAAgG,CACjG;IACH,CAAC;SACE,YAAY,CAAC;QACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC;QAC1B,IAAI,EAAE,WAAW;QACjB,KAAK,EAAE,QAAQ,CAAC,QAAQ,EAAE;KAC3B,CAAC;SACD,QAAQ,CAAC,uDAAuD,CAAC;IACpE,CAAC;SACE,YAAY,CAAC;QACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC;QACvB,IAAI,EAAE,QAAQ;QACd,CAAC,EAAE,UAAU,CAAC,QAAQ,EAAE;KACzB,CAAC;SACD,QAAQ,CACP,+EAA+E,CAChF;CACJ,CAAC,CAAC;AAEH,MAAM,CAAC,MAAM,WAAW,GAAG,OAAO,CAAC;AAEnC,MAAM,CAAC,MAAM,gBAAgB,GAAG,OAAO,CAAC;AAGxC,MAAM,CAAC,MAAM,SAAS,GAKjB;IACH,IAAI,EAAE,OAAO;IACb,IAAI,EAAE,SAAS;IACf,SAAS,EAAE,cAAc;IACzB,MAAM,EAAE,WAAW;IACnB,WAAW,EAAE,gBAAgB;IAC7B,WAAW,EAAE,OAAO,CAAC,WAAW,CAAC;IACjC,aAAa,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,MAAM,IAAI,EAAE,EAAE,CAAC;IAC3E,OAAO,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;QACjB,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAS,EAAE,CAAC,CAAC;YACnC,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,IAAI,EAAE,CAAC,QAAQ,EAAE,CAAC,EAAE,IAAI,CAAC;SAC1B,CAAC,CAAC;QACH,GAAG,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAS,EAAE,CAAC,CAAC;YAC7C,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC,EAAE,IAAI,CAAC;SAC5B,CAAC,CAAC;KACJ;IACD,YAAY,EAAE,iBAAiB;IAC/B,eAAe,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK;IACjC,aAAa,EAAE,CAAC,MAAM,EAAE,EAAE,CACxB,MAAM,CAAC,IAAI,KAAK,UAAU;QACxB,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC;QAClD,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,YAAY;YAC5B,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,SAAS,EAAE,IAAI,CAAC,EAAE,CAAC;YACtD,CAAC,CAAC,EAAE;CACX,CAAC"}

package/dist/kinds/priority-queue.d.ts

@@ -0,0 +1,120 @@
+/**
+ * The `priorityQueue` kind (ADR 0029): items with keys, kept in key order,
+ * for algorithms such as Dijkstra's and Prim's that keep a min-priority
+ * queue. Items are named by id, as their positions change with every key
+ * change.
+ *
+ * Order (implemented by the core reducer and layout, documented here
+ * because it is part of the protocol):
+ * - The front is the item of least key (`order: "min"`, the default) or
+ *   greatest key (`"max"`). A null key, no key yet, comes after every
+ *   number in either order.
+ * - Ties keep insertion order, also after a key change.
+ *
+ * Marks: `highlight`, `peek` and the mark `setKey` leaves last one step.
+ */
+import { z } from 'zod';
+import { type KindSpec } from './kind.ts';
+/** A key: a number, or null for none yet (∞, or −∞ in a max-queue). */
+export declare const PriorityKey: z.ZodNullable<z.ZodNumber>;
+export type PriorityKey = z.infer<typeof PriorityKey>;
+/** An element with its key. */
+export declare const PriorityItem: z.ZodObject<{
+    id: z.ZodString;
+    value: z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>;
+    key: z.ZodNullable<z.ZodNumber>;
+}, z.core.$strict>;
+export type PriorityItem = z.infer<typeof PriorityItem>;
+/** Authoring form of an item: `id` may be left out, and is then generated. */
+export declare const PriorityItemInput: z.ZodObject<{
+    id: z.ZodOptional<z.ZodString>;
+    value: z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>;
+    key: z.ZodNullable<z.ZodNumber>;
+}, z.core.$strict>;
+export type PriorityItemInput = z.infer<typeof PriorityItemInput>;
+export declare const PriorityQueueDecl: z.ZodObject<{
+    kind: z.ZodLiteral<"priorityQueue">;
+    label: z.ZodOptional<z.ZodString>;
+    place: z.ZodOptional<z.ZodEnum<{
+        main: "main";
+        side: "side";
+    }>>;
+    order: z.ZodOptional<z.ZodEnum<{
+        min: "min";
+        max: "max";
+    }>>;
+    initial: z.ZodArray<z.ZodObject<{
+        id: z.ZodString;
+        value: z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>;
+        key: z.ZodNullable<z.ZodNumber>;
+    }, z.core.$strict>>;
+}, z.core.$strict>;
+export type PriorityQueueDecl = z.infer<typeof PriorityQueueDecl>;
+export declare const PriorityQueueDeclInput: z.ZodObject<{
+    kind: z.ZodLiteral<"priorityQueue">;
+    label: z.ZodOptional<z.ZodString>;
+    place: z.ZodOptional<z.ZodEnum<{
+        main: "main";
+        side: "side";
+    }>>;
+    order: z.ZodOptional<z.ZodEnum<{
+        min: "min";
+        max: "max";
+    }>>;
+    initial: z.ZodArray<z.ZodObject<{
+        id: z.ZodOptional<z.ZodString>;
+        value: z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>;
+        key: z.ZodNullable<z.ZodNumber>;
+    }, z.core.$strict>>;
+}, z.core.$strict>;
+export type PriorityQueueDeclInput = z.infer<typeof PriorityQueueDeclInput>;
+/** Gives every item of the authoring form an id: e0, e1, … by position. */
+export declare function normalizePriorityQueueDecl(input: PriorityQueueDeclInput): PriorityQueueDecl;
+export declare const PriorityQueueAction: z.ZodDiscriminatedUnion<[z.ZodObject<{
+    type: z.ZodLiteral<"insert">;
+    element: z.ZodObject<{
+        id: z.ZodString;
+        value: z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>;
+    }, z.core.$strict>;
+    key: z.ZodNullable<z.ZodNumber>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"extract">;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"setKey">;
+    id: z.ZodString;
+    key: z.ZodNullable<z.ZodNumber>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"peek">;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"highlight">;
+    ids: z.ZodArray<z.ZodString>;
+}, z.core.$strict>], "type">;
+export type PriorityQueueAction = z.infer<typeof PriorityQueueAction>;
+/** Authoring actions: `insert` also takes a bare value, given an id. */
+export declare const PriorityQueueActionInput: z.ZodDiscriminatedUnion<[z.ZodObject<{
+    type: z.ZodLiteral<"insert">;
+    element: z.ZodUnion<readonly [z.ZodObject<{
+        id: z.ZodString;
+        value: z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>;
+    }, z.core.$strict>, z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>]>;
+    key: z.ZodNullable<z.ZodNumber>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"extract">;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"setKey">;
+    id: z.ZodString;
+    key: z.ZodNullable<z.ZodNumber>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"peek">;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"highlight">;
+    ids: z.ZodArray<z.ZodString>;
+}, z.core.$strict>], "type">;
+export type PriorityQueueActionInput = z.infer<typeof PriorityQueueActionInput>;
+export declare const priorityQueueSpec: KindSpec<{
+    decl: PriorityQueueDecl;
+    declInput: PriorityQueueDeclInput;
+    action: PriorityQueueAction;
+    actionInput: PriorityQueueActionInput;
+}>;
+//# sourceMappingURL=priority-queue.d.ts.map

package/dist/kinds/priority-queue.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"priority-queue.d.ts","sourceRoot":"","sources":["../../src/kinds/priority-queue.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AACH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAUxB,OAAO,EAAW,KAAK,QAAQ,EAAE,MAAM,WAAW,CAAC;AAGnD,uEAAuE;AACvE,eAAO,MAAM,WAAW,4BAKrB,CAAC;AACJ,MAAM,MAAM,WAAW,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,WAAW,CAAC,CAAC;AAEtD,+BAA+B;AAC/B,eAAO,MAAM,YAAY;;;;kBAEuB,CAAC;AACjD,MAAM,MAAM,YAAY,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,YAAY,CAAC,CAAC;AAExD,8EAA8E;AAC9E,eAAO,MAAM,iBAAiB;;;;kBAQ3B,CAAC;AACJ,MAAM,MAAM,iBAAiB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,iBAAiB,CAAC,CAAC;AASlE,eAAO,MAAM,iBAAiB;;;;;;;;;;;;;;;;kBAWsC,CAAC;AACrE,MAAM,MAAM,iBAAiB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,iBAAiB,CAAC,CAAC;AAElE,eAAO,MAAM,sBAAsB;;;;;;;;;;;;;;;;kBAOjC,CAAC;AACH,MAAM,MAAM,sBAAsB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,sBAAsB,CAAC,CAAC;AAE5E,2EAA2E;AAC3E,wBAAgB,0BAA0B,CACxC,KAAK,EAAE,sBAAsB,GAC5B,iBAAiB,CAOnB;AAmCD,eAAO,MAAM,mBAAmB;;;;;;;;;;;;;;;;;;4BAAmB,CAAC;AACpD,MAAM,MAAM,mBAAmB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,mBAAmB,CAAC,CAAC;AAEtE,wEAAwE;AACxE,eAAO,MAAM,wBAAwB;;;;;;;;;;;;;;;;;;4BAAwB,CAAC;AAC9D,MAAM,MAAM,wBAAwB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,wBAAwB,CAAC,CAAC;AAEhF,eAAO,MAAM,iBAAiB,EAAE,QAAQ,CAAC;IACvC,IAAI,EAAE,iBAAiB,CAAC;IACxB,SAAS,EAAE,sBAAsB,CAAC;IAClC,MAAM,EAAE,mBAAmB,CAAC;IAC5B,WAAW,EAAE,wBAAwB,CAAC;CACvC,CAiBA,CAAC"}

package/dist/kinds/priority-queue.js

@@ -0,0 +1,108 @@
+/**
+ * The `priorityQueue` kind (ADR 0029): items with keys, kept in key order,
+ * for algorithms such as Dijkstra's and Prim's that keep a min-priority
+ * queue. Items are named by id, as their positions change with every key
+ * change.
+ *
+ * Order (implemented by the core reducer and layout, documented here
+ * because it is part of the protocol):
+ * - The front is the item of least key (`order: "min"`, the default) or
+ *   greatest key (`"max"`). A null key, no key yet, comes after every
+ *   number in either order.
+ * - Ties keep insertion order, also after a key change.
+ *
+ * Marks: `highlight`, `peek` and the mark `setKey` leaves last one step.
+ */
+import { z } from 'zod';
+import { Element, ElementId, ElementInput, LIMITS, Place, Scalar, } from "../common.js";
+import { typesOf } from "./kind.js";
+import { elementFieldIds, normalizeElementField } from "./linear.js";
+/** A key: a number, or null for none yet (∞, or −∞ in a max-queue). */
+export const PriorityKey = z
+    .number()
+    .nullable()
+    .describe('The priority: a number, or null for no key yet, drawn as ∞ (−∞ in a max-priority queue) and ordered after every number.');
+/** An element with its key. */
+export const PriorityItem = z
+    .strictObject({ id: ElementId, value: Scalar, key: PriorityKey })
+    .describe('An item: an element with its key.');
+/** Authoring form of an item: `id` may be left out, and is then generated. */
+export const PriorityItemInput = z
+    .strictObject({
+    id: ElementId.optional(),
+    value: Scalar,
+    key: PriorityKey,
+})
+    .describe('An item `{ "value", "key" }`, with an `id` to choose one (ids "e0", "e1", … are generated otherwise).');
+const Order = z
+    .enum(['min', 'max'])
+    .optional()
+    .describe('"min" (default): the least key is at the front, as for EXTRACT-MIN; "max": the greatest.');
+export const PriorityQueueDecl = z
+    .strictObject({
+    kind: z.literal('priorityQueue'),
+    label: z.string().max(LIMITS.textLength).optional(),
+    place: Place.optional(),
+    order: Order,
+    initial: z
+        .array(PriorityItem)
+        .max(LIMITS.elementsPerStructure)
+        .describe('Items in insertion order, which breaks ties between keys.'),
+})
+    .describe('A priority queue: items with keys, kept in key order.');
+export const PriorityQueueDeclInput = PriorityQueueDecl.extend({
+    initial: z
+        .array(PriorityItemInput)
+        .max(LIMITS.elementsPerStructure)
+        .describe('Items in insertion order, which breaks ties between keys: [{ "value": "A", "key": 0 }, { "value": "B", "key": null }]; give "id" to choose an id.'),
+});
+/** Gives every item of the authoring form an id: e0, e1, … by position. */
+export function normalizePriorityQueueDecl(input) {
+    const initial = input.initial.map((item, k) => ({
+        id: item.id ?? `e${k}`,
+        value: item.value,
+        key: item.key,
+    }));
+    return { ...input, initial };
+}
+const Ids = z.array(ElementId).min(1).max(LIMITS.elementsPerStructure);
+const actions = (element) => z.discriminatedUnion('type', [
+    z
+        .strictObject({ type: z.literal('insert'), element, key: PriorityKey })
+        .describe('INSERT: add `element` with `key`; it takes its place in key order, after items of equal key.'),
+    z
+        .strictObject({ type: z.literal('extract') })
+        .describe('EXTRACT-MIN (or EXTRACT-MAX): remove the item at the front. The queue must not be empty.'),
+    z
+        .strictObject({
+        type: z.literal('setKey'),
+        id: ElementId,
+        key: PriorityKey,
+    })
+        .describe('DECREASE-KEY (or INCREASE-KEY): give item `id` a new key; it moves to its place and is highlighted this step.'),
+    z
+        .strictObject({ type: z.literal('peek') })
+        .describe('MINIMUM (or MAXIMUM): highlight the item at the front (this step only).'),
+    z
+        .strictObject({ type: z.literal('highlight'), ids: Ids })
+        .describe('Highlight items by id (this step only).'),
+]);
+export const PriorityQueueAction = actions(Element);
+/** Authoring actions: `insert` also takes a bare value, given an id. */
+export const PriorityQueueActionInput = actions(ElementInput);
+export const priorityQueueSpec = {
+    kind: 'priorityQueue',
+    decl: PriorityQueueDecl,
+    declInput: PriorityQueueDeclInput,
+    action: PriorityQueueAction,
+    actionInput: PriorityQueueActionInput,
+    actionTypes: typesOf(PriorityQueueAction),
+    normalizeDecl: normalizePriorityQueueDecl,
+    declIds: (decl) => decl.initial.map((item, k) => ({
+        id: item.id,
+        path: ['initial', k, 'id'],
+    })),
+    normalizeAction: (action, ctx) => normalizeElementField(action, ctx),
+    introducedIds: (action) => action.type === 'insert' ? elementFieldIds(action) : [],
+};
+//# sourceMappingURL=priority-queue.js.map

package/dist/kinds/priority-queue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"priority-queue.js","sourceRoot":"","sources":["../../src/kinds/priority-queue.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AACH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EACL,OAAO,EACP,SAAS,EACT,YAAY,EACZ,MAAM,EACN,KAAK,EACL,MAAM,GACP,MAAM,cAAc,CAAC;AACtB,OAAO,EAAE,OAAO,EAAiB,MAAM,WAAW,CAAC;AACnD,OAAO,EAAE,eAAe,EAAE,qBAAqB,EAAE,MAAM,aAAa,CAAC;AAErE,uEAAuE;AACvE,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC;KACzB,MAAM,EAAE;KACR,QAAQ,EAAE;KACV,QAAQ,CACP,yHAAyH,CAC1H,CAAC;AAGJ,+BAA+B;AAC/B,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC;KAC1B,YAAY,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,WAAW,EAAE,CAAC;KAChE,QAAQ,CAAC,mCAAmC,CAAC,CAAC;AAGjD,8EAA8E;AAC9E,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC;KAC/B,YAAY,CAAC;IACZ,EAAE,EAAE,SAAS,CAAC,QAAQ,EAAE;IACxB,KAAK,EAAE,MAAM;IACb,GAAG,EAAE,WAAW;CACjB,CAAC;KACD,QAAQ,CACP,uGAAuG,CACxG,CAAC;AAGJ,MAAM,KAAK,GAAG,CAAC;KACZ,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;KACpB,QAAQ,EAAE;KACV,QAAQ,CACP,0FAA0F,CAC3F,CAAC;AAEJ,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC;KAC/B,YAAY,CAAC;IACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,eAAe,CAAC;IAChC,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,EAAE;IACnD,KAAK,EAAE,KAAK,CAAC,QAAQ,EAAE;IACvB,KAAK,EAAE,KAAK;IACZ,OAAO,EAAE,CAAC;SACP,KAAK,CAAC,YAAY,CAAC;SACnB,GAAG,CAAC,MAAM,CAAC,oBAAoB,CAAC;SAChC,QAAQ,CAAC,2DAA2D,CAAC;CACzE,CAAC;KACD,QAAQ,CAAC,uDAAuD,CAAC,CAAC;AAGrE,MAAM,CAAC,MAAM,sBAAsB,GAAG,iBAAiB,CAAC,MAAM,CAAC;IAC7D,OAAO,EAAE,CAAC;SACP,KAAK,CAAC,iBAAiB,CAAC;SACxB,GAAG,CAAC,MAAM,CAAC,oBAAoB,CAAC;SAChC,QAAQ,CACP,mJAAmJ,CACpJ;CACJ,CAAC,CAAC;AAGH,2EAA2E;AAC3E,MAAM,UAAU,0BAA0B,CACxC,KAA6B;IAE7B,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAgB,EAAE,CAAC,CAAC;QAC5D,EAAE,EAAE,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE;QACtB,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,GAAG,EAAE,IAAI,CAAC,GAAG;KACd,CAAC,CAAC,CAAC;IACJ,OAAO,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,CAAC;AAC/B,CAAC;AAED,MAAM,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC;AAEvE,MAAM,OAAO,GAAG,CAAsB,OAAU,EAAE,EAAE,CAClD,CAAC,CAAC,kBAAkB,CAAC,MAAM,EAAE;IAC3B,CAAC;SACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,WAAW,EAAE,CAAC;SACtE,QAAQ,CACP,8FAA8F,CAC/F;IACH,CAAC;SACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;SAC5C,QAAQ,CACP,0FAA0F,CAC3F;IACH,CAAC;SACE,YAAY,CAAC;QACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC;QACzB,EAAE,EAAE,SAAS;QACb,GAAG,EAAE,WAAW;KACjB,CAAC;SACD,QAAQ,CACP,+GAA+G,CAChH;IACH,CAAC;SACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;SACzC,QAAQ,CACP,yEAAyE,CAC1E;IACH,CAAC;SACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;SACxD,QAAQ,CAAC,yCAAyC,CAAC;CACvD,CAAC,CAAC;AAEL,MAAM,CAAC,MAAM,mBAAmB,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;AAGpD,wEAAwE;AACxE,MAAM,CAAC,MAAM,wBAAwB,GAAG,OAAO,CAAC,YAAY,CAAC,CAAC;AAG9D,MAAM,CAAC,MAAM,iBAAiB,GAKzB;IACH,IAAI,EAAE,eAAe;IACrB,IAAI,EAAE,iBAAiB;IACvB,SAAS,EAAE,sBAAsB;IACjC,MAAM,EAAE,mBAAmB;IAC3B,WAAW,EAAE,wBAAwB;IACrC,WAAW,EAAE,OAAO,CAAC,mBAAmB,CAAC;IACzC,aAAa,EAAE,0BAA0B;IACzC,OAAO,EAAE,CAAC,IAAI,EAAE,EAAE,CAChB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAC7B,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,IAAI,EAAE,CAAC,SAAS,EAAE,CAAC,EAAE,IAAI,CAAC;KAC3B,CAAC,CAAC;IACL,eAAe,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,CAC/B,qBAAqB,CAAC,MAAM,EAAE,GAAG,CAAwB;IAC3D,aAAa,EAAE,CAAC,MAAM,EAAE,EAAE,CACxB,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE;CAC1D,CAAC"}

package/dist/kinds/queue.d.ts

@@ -0,0 +1,94 @@
+/**
+ * The `queue` kind: a double-ended queue. Positions count from the front (0).
+ *
+ * Marks: `highlight` and `peek` last one step.
+ */
+import { z } from 'zod';
+import { type KindSpec } from './kind.ts';
+export declare const QueueDecl: z.ZodObject<{
+    kind: z.ZodLiteral<"queue">;
+    label: z.ZodOptional<z.ZodString>;
+    place: z.ZodOptional<z.ZodEnum<{
+        main: "main";
+        side: "side";
+    }>>;
+    initial: z.ZodArray<z.ZodObject<{
+        id: z.ZodString;
+        value: z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>;
+    }, z.core.$strict>>;
+}, z.core.$strict>;
+export type QueueDecl = z.infer<typeof QueueDecl>;
+export declare const QueueDeclInput: z.ZodObject<{
+    kind: z.ZodLiteral<"queue">;
+    label: z.ZodOptional<z.ZodString>;
+    place: z.ZodOptional<z.ZodEnum<{
+        main: "main";
+        side: "side";
+    }>>;
+    initial: z.ZodUnion<readonly [z.ZodArray<z.ZodObject<{
+        id: z.ZodString;
+        value: z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>;
+    }, z.core.$strict>>, z.ZodArray<z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>>]>;
+}, z.core.$strict>;
+export type QueueDeclInput = z.infer<typeof QueueDeclInput>;
+export declare const QueueAction: z.ZodDiscriminatedUnion<[z.ZodObject<{
+    type: z.ZodLiteral<"enqueue">;
+    element: z.ZodObject<{
+        id: z.ZodString;
+        value: z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>;
+    }, z.core.$strict>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"dequeue">;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"pushFront">;
+    element: z.ZodObject<{
+        id: z.ZodString;
+        value: z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>;
+    }, z.core.$strict>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"popBack">;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"peek">;
+    end: z.ZodOptional<z.ZodEnum<{
+        front: "front";
+        back: "back";
+    }>>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"highlight">;
+    indices: z.ZodArray<z.ZodInt>;
+}, z.core.$strict>], "type">;
+export type QueueAction = z.infer<typeof QueueAction>;
+export declare const QueueActionInput: z.ZodDiscriminatedUnion<[z.ZodObject<{
+    type: z.ZodLiteral<"enqueue">;
+    element: z.ZodUnion<readonly [z.ZodObject<{
+        id: z.ZodString;
+        value: z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>;
+    }, z.core.$strict>, z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>]>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"dequeue">;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"pushFront">;
+    element: z.ZodUnion<readonly [z.ZodObject<{
+        id: z.ZodString;
+        value: z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>;
+    }, z.core.$strict>, z.ZodUnion<readonly [z.ZodNumber, z.ZodString, z.ZodBoolean, z.ZodNull]>]>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"popBack">;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"peek">;
+    end: z.ZodOptional<z.ZodEnum<{
+        front: "front";
+        back: "back";
+    }>>;
+}, z.core.$strict>, z.ZodObject<{
+    type: z.ZodLiteral<"highlight">;
+    indices: z.ZodArray<z.ZodInt>;
+}, z.core.$strict>], "type">;
+export type QueueActionInput = z.infer<typeof QueueActionInput>;
+export declare const queueSpec: KindSpec<{
+    decl: QueueDecl;
+    declInput: QueueDeclInput;
+    action: QueueAction;
+    actionInput: QueueActionInput;
+}>;
+//# sourceMappingURL=queue.d.ts.map

package/dist/kinds/queue.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"queue.d.ts","sourceRoot":"","sources":["../../src/kinds/queue.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAGxB,OAAO,EAAW,KAAK,QAAQ,EAAE,MAAM,WAAW,CAAC;AAWnD,eAAO,MAAM,SAAS;;;;;;;;;;;kBAO8C,CAAC;AACrE,MAAM,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,SAAS,CAAC,CAAC;AAElD,eAAO,MAAM,cAAc;;;;;;;;;;;kBAA+C,CAAC;AAC3E,MAAM,MAAM,cAAc,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,cAAc,CAAC,CAAC;AA4B5D,eAAO,MAAM,WAAW;;;;;;;;;;;;;;;;;;;;;;;;;4BAAmB,CAAC;AAC5C,MAAM,MAAM,WAAW,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,WAAW,CAAC,CAAC;AACtD,eAAO,MAAM,gBAAgB;;;;;;;;;;;;;;;;;;;;;;;;;4BAAwB,CAAC;AACtD,MAAM,MAAM,gBAAgB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,gBAAgB,CAAC,CAAC;AAEhE,eAAO,MAAM,SAAS,EAAE,QAAQ,CAAC;IAC/B,IAAI,EAAE,SAAS,CAAC;IAChB,SAAS,EAAE,cAAc,CAAC;IAC1B,MAAM,EAAE,WAAW,CAAC;IACpB,WAAW,EAAE,gBAAgB,CAAC;CAC/B,CAkBA,CAAC"}

package/dist/kinds/queue.js

@@ -0,0 +1,59 @@
+/**
+ * The `queue` kind: a double-ended queue. Positions count from the front (0).
+ *
+ * Marks: `highlight` and `peek` last one step.
+ */
+import { z } from 'zod';
+import { Element, ElementInput, LIMITS, Place } from "../common.js";
+import { typesOf } from "./kind.js";
+import { elementFieldIds, elementIds, Elements, ElementsInput, Indices, normalizeElementField, normalizeElements, } from "./linear.js";
+export const QueueDecl = z
+    .strictObject({
+    kind: z.literal('queue'),
+    label: z.string().max(LIMITS.textLength).optional(),
+    place: Place.optional(),
+    initial: Elements.describe('Elements from front to back.'),
+})
+    .describe('A queue; also supports deque operations at both ends.');
+export const QueueDeclInput = QueueDecl.extend({ initial: ElementsInput });
+const End = z.enum(['front', 'back']);
+const actions = (element) => z.discriminatedUnion('type', [
+    z
+        .strictObject({ type: z.literal('enqueue'), element })
+        .describe('Add `element` at the back.'),
+    z
+        .strictObject({ type: z.literal('dequeue') })
+        .describe('Remove the element at the front.'),
+    z
+        .strictObject({ type: z.literal('pushFront'), element })
+        .describe('Add `element` at the front (deque).'),
+    z
+        .strictObject({ type: z.literal('popBack') })
+        .describe('Remove the element at the back (deque).'),
+    z
+        .strictObject({ type: z.literal('peek'), end: End.optional() })
+        .describe('Highlight the element at `end` (default "front"), this step only.'),
+    z
+        .strictObject({ type: z.literal('highlight'), indices: Indices })
+        .describe('Highlight positions counted from the front (this step only).'),
+]);
+export const QueueAction = actions(Element);
+export const QueueActionInput = actions(ElementInput);
+export const queueSpec = {
+    kind: 'queue',
+    decl: QueueDecl,
+    declInput: QueueDeclInput,
+    action: QueueAction,
+    actionInput: QueueActionInput,
+    actionTypes: typesOf(QueueAction),
+    normalizeDecl: (input) => ({
+        ...input,
+        initial: normalizeElements(input.initial),
+    }),
+    declIds: (decl) => elementIds(decl.initial),
+    normalizeAction: (action, ctx) => normalizeElementField(action, ctx),
+    introducedIds: (action) => action.type === 'enqueue' || action.type === 'pushFront'
+        ? elementFieldIds(action)
+        : [],
+};
+//# sourceMappingURL=queue.js.map

package/dist/kinds/queue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"queue.js","sourceRoot":"","sources":["../../src/kinds/queue.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,cAAc,CAAC;AACpE,OAAO,EAAE,OAAO,EAAiB,MAAM,WAAW,CAAC;AACnD,OAAO,EACL,eAAe,EACf,UAAU,EACV,QAAQ,EACR,aAAa,EACb,OAAO,EACP,qBAAqB,EACrB,iBAAiB,GAClB,MAAM,aAAa,CAAC;AAErB,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC;KACvB,YAAY,CAAC;IACZ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC;IACxB,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,EAAE;IACnD,KAAK,EAAE,KAAK,CAAC,QAAQ,EAAE;IACvB,OAAO,EAAE,QAAQ,CAAC,QAAQ,CAAC,8BAA8B,CAAC;CAC3D,CAAC;KACD,QAAQ,CAAC,uDAAuD,CAAC,CAAC;AAGrE,MAAM,CAAC,MAAM,cAAc,GAAG,SAAS,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,aAAa,EAAE,CAAC,CAAC;AAG3E,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC;AAEtC,MAAM,OAAO,GAAG,CAAsB,OAAU,EAAE,EAAE,CAClD,CAAC,CAAC,kBAAkB,CAAC,MAAM,EAAE;IAC3B,CAAC;SACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,OAAO,EAAE,CAAC;SACrD,QAAQ,CAAC,4BAA4B,CAAC;IACzC,CAAC;SACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;SAC5C,QAAQ,CAAC,kCAAkC,CAAC;IAC/C,CAAC;SACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,OAAO,EAAE,CAAC;SACvD,QAAQ,CAAC,qCAAqC,CAAC;IAClD,CAAC;SACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;SAC5C,QAAQ,CAAC,yCAAyC,CAAC;IACtD,CAAC;SACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC;SAC9D,QAAQ,CACP,mEAAmE,CACpE;IACH,CAAC;SACE,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;SAChE,QAAQ,CAAC,8DAA8D,CAAC;CAC5E,CAAC,CAAC;AAEL,MAAM,CAAC,MAAM,WAAW,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;AAE5C,MAAM,CAAC,MAAM,gBAAgB,GAAG,OAAO,CAAC,YAAY,CAAC,CAAC;AAGtD,MAAM,CAAC,MAAM,SAAS,GAKjB;IACH,IAAI,EAAE,OAAO;IACb,IAAI,EAAE,SAAS;IACf,SAAS,EAAE,cAAc;IACzB,MAAM,EAAE,WAAW;IACnB,WAAW,EAAE,gBAAgB;IAC7B,WAAW,EAAE,OAAO,CAAC,WAAW,CAAC;IACjC,aAAa,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACzB,GAAG,KAAK;QACR,OAAO,EAAE,iBAAiB,CAAC,KAAK,CAAC,OAAO,CAAC;KAC1C,CAAC;IACF,OAAO,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC;IAC3C,eAAe,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,CAC/B,qBAAqB,CAAC,MAAM,EAAE,GAAG,CAAgB;IACnD,aAAa,EAAE,CAAC,MAAM,EAAE,EAAE,CACxB,MAAM,CAAC,IAAI,KAAK,SAAS,IAAI,MAAM,CAAC,IAAI,KAAK,WAAW;QACtD,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC;QACzB,CAAC,CAAC,EAAE;CACT,CAAC"}