@aetherwing/fcp-core 0.1.0

package/dist/event-log.d.ts

@@ -0,0 +1,78 @@
+/**
+ * Generic cursor-based event log with undo/redo and named checkpoints.
+ *
+ * Events are appended at the cursor position. The cursor always points
+ * one past the last applied event. Undo moves the cursor back; redo
+ * moves it forward. Appending a new event truncates the redo tail.
+ *
+ * Checkpoint sentinels are stored in the log but skipped during
+ * undo/redo traversal.
+ */
+export declare class EventLog<T> {
+    private events;
+    private _cursor;
+    private checkpoints;
+    /**
+     * Append an event, truncating any redo history beyond the cursor.
+     */
+    append(event: T): void;
+    /**
+     * Create a named checkpoint at the current cursor position.
+     */
+    checkpoint(name: string): void;
+    /**
+     * Undo up to `count` non-checkpoint events. Returns events in reverse
+     * order (most recent first) for the caller to reverse-apply.
+     */
+    undo(count?: number): T[];
+    /**
+     * Undo to a named checkpoint. Returns events in reverse order.
+     * Returns null if the checkpoint doesn't exist or is at/beyond cursor.
+     */
+    undoTo(name: string): T[] | null;
+    /**
+     * Redo up to `count` non-checkpoint events. Returns events in forward
+     * order for the caller to re-apply.
+     */
+    redo(count?: number): T[];
+    /**
+     * Get the last N non-checkpoint events (up to cursor). Returned in
+     * chronological order (oldest first).
+     */
+    recent(count?: number): T[];
+    /**
+     * Current cursor position (one past last applied event).
+     */
+    get cursor(): number;
+    /**
+     * Total number of entries in the log (including checkpoints).
+     */
+    get length(): number;
+    /**
+     * Whether there are events before the cursor that can be undone.
+     */
+    canUndo(): boolean;
+    /**
+     * Whether there are events after the cursor that can be redone.
+     */
+    canRedo(): boolean;
+    /**
+     * Get the event index for a named checkpoint.
+     * Returns undefined if the checkpoint doesn't exist.
+     */
+    getCheckpointIndex(name: string): number | undefined;
+    /**
+     * Number of named checkpoints.
+     */
+    get checkpointCount(): number;
+    /**
+     * Get all checkpoint names and their indices.
+     */
+    getCheckpoints(): Map<string, number>;
+    /**
+     * Get non-checkpoint events from a given index to the cursor.
+     * Used for diff queries.
+     */
+    eventsSince(fromIndex: number): T[];
+}
+//# sourceMappingURL=event-log.d.ts.map

package/dist/event-log.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"event-log.d.ts","sourceRoot":"","sources":["../src/event-log.ts"],"names":[],"mappings":"AAmBA;;;;;;;;;GASG;AACH,qBAAa,QAAQ,CAAC,CAAC;IACrB,OAAO,CAAC,MAAM,CAAkC;IAChD,OAAO,CAAC,OAAO,CAAK;IACpB,OAAO,CAAC,WAAW,CAA6B;IAEhD;;OAEG;IACH,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI;IActB;;OAEG;IACH,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAO9B;;;OAGG;IACH,IAAI,CAAC,KAAK,GAAE,MAAU,GAAG,CAAC,EAAE;IAkB5B;;;OAGG;IACH,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,CAAC,EAAE,GAAG,IAAI;IAehC;;;OAGG;IACH,IAAI,CAAC,KAAK,GAAE,MAAU,GAAG,CAAC,EAAE;IAkB5B;;;OAGG;IACH,MAAM,CAAC,KAAK,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE;IAY3B;;OAEG;IACH,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED;;OAEG;IACH,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED;;OAEG;IACH,OAAO,IAAI,OAAO;IAOlB;;OAEG;IACH,OAAO,IAAI,OAAO;IAIlB;;;OAGG;IACH,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAIpD;;OAEG;IACH,IAAI,eAAe,IAAI,MAAM,CAE5B;IAED;;OAEG;IACH,cAAc,IAAI,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IAIrC;;;OAGG;IACH,WAAW,CAAC,SAAS,EAAE,MAAM,GAAG,CAAC,EAAE;CAWpC"}

package/dist/event-log.js

@@ -0,0 +1,184 @@
+/**
+ * Sentinel object stored in the event log to mark a checkpoint.
+ */
+const CHECKPOINT_SENTINEL = Symbol("checkpoint");
+function isCheckpoint(entry) {
+    return (typeof entry === "object" &&
+        entry !== null &&
+        "__type" in entry &&
+        entry.__type === CHECKPOINT_SENTINEL);
+}
+/**
+ * Generic cursor-based event log with undo/redo and named checkpoints.
+ *
+ * Events are appended at the cursor position. The cursor always points
+ * one past the last applied event. Undo moves the cursor back; redo
+ * moves it forward. Appending a new event truncates the redo tail.
+ *
+ * Checkpoint sentinels are stored in the log but skipped during
+ * undo/redo traversal.
+ */
+export class EventLog {
+    events = [];
+    _cursor = 0;
+    checkpoints = new Map();
+    /**
+     * Append an event, truncating any redo history beyond the cursor.
+     */
+    append(event) {
+        if (this._cursor < this.events.length) {
+            this.events.length = this._cursor;
+            // Remove checkpoints pointing beyond new length
+            for (const [name, idx] of this.checkpoints) {
+                if (idx > this._cursor) {
+                    this.checkpoints.delete(name);
+                }
+            }
+        }
+        this.events.push(event);
+        this._cursor = this.events.length;
+    }
+    /**
+     * Create a named checkpoint at the current cursor position.
+     */
+    checkpoint(name) {
+        this.checkpoints.set(name, this._cursor);
+        const sentinel = { __type: CHECKPOINT_SENTINEL, name };
+        this.events.push(sentinel);
+        this._cursor = this.events.length;
+    }
+    /**
+     * Undo up to `count` non-checkpoint events. Returns events in reverse
+     * order (most recent first) for the caller to reverse-apply.
+     */
+    undo(count = 1) {
+        const result = [];
+        let pos = this._cursor - 1;
+        let undone = 0;
+        while (pos >= 0 && undone < count) {
+            const entry = this.events[pos];
+            if (!isCheckpoint(entry)) {
+                result.push(entry);
+                undone++;
+            }
+            pos--;
+        }
+        this._cursor = pos + 1;
+        return result;
+    }
+    /**
+     * Undo to a named checkpoint. Returns events in reverse order.
+     * Returns null if the checkpoint doesn't exist or is at/beyond cursor.
+     */
+    undoTo(name) {
+        const target = this.checkpoints.get(name);
+        if (target === undefined || target >= this._cursor)
+            return null;
+        const result = [];
+        for (let i = this._cursor - 1; i >= target; i--) {
+            const entry = this.events[i];
+            if (!isCheckpoint(entry)) {
+                result.push(entry);
+            }
+        }
+        this._cursor = target;
+        return result;
+    }
+    /**
+     * Redo up to `count` non-checkpoint events. Returns events in forward
+     * order for the caller to re-apply.
+     */
+    redo(count = 1) {
+        const result = [];
+        let pos = this._cursor;
+        let redone = 0;
+        while (pos < this.events.length && redone < count) {
+            const entry = this.events[pos];
+            if (!isCheckpoint(entry)) {
+                result.push(entry);
+                redone++;
+            }
+            pos++;
+        }
+        this._cursor = pos;
+        return result;
+    }
+    /**
+     * Get the last N non-checkpoint events (up to cursor). Returned in
+     * chronological order (oldest first).
+     */
+    recent(count) {
+        const limit = count ?? this._cursor;
+        const result = [];
+        for (let i = this._cursor - 1; i >= 0 && result.length < limit; i--) {
+            const entry = this.events[i];
+            if (!isCheckpoint(entry)) {
+                result.push(entry);
+            }
+        }
+        return result.reverse();
+    }
+    /**
+     * Current cursor position (one past last applied event).
+     */
+    get cursor() {
+        return this._cursor;
+    }
+    /**
+     * Total number of entries in the log (including checkpoints).
+     */
+    get length() {
+        return this.events.length;
+    }
+    /**
+     * Whether there are events before the cursor that can be undone.
+     */
+    canUndo() {
+        for (let i = this._cursor - 1; i >= 0; i--) {
+            if (!isCheckpoint(this.events[i]))
+                return true;
+        }
+        return false;
+    }
+    /**
+     * Whether there are events after the cursor that can be redone.
+     */
+    canRedo() {
+        return this._cursor < this.events.length;
+    }
+    /**
+     * Get the event index for a named checkpoint.
+     * Returns undefined if the checkpoint doesn't exist.
+     */
+    getCheckpointIndex(name) {
+        return this.checkpoints.get(name);
+    }
+    /**
+     * Number of named checkpoints.
+     */
+    get checkpointCount() {
+        return this.checkpoints.size;
+    }
+    /**
+     * Get all checkpoint names and their indices.
+     */
+    getCheckpoints() {
+        return new Map(this.checkpoints);
+    }
+    /**
+     * Get non-checkpoint events from a given index to the cursor.
+     * Used for diff queries.
+     */
+    eventsSince(fromIndex) {
+        const result = [];
+        const end = Math.min(this._cursor, this.events.length);
+        for (let i = fromIndex; i < end; i++) {
+            const entry = this.events[i];
+            if (!isCheckpoint(entry)) {
+                result.push(entry);
+            }
+        }
+        return result;
+    }
+}
+//# sourceMappingURL=event-log.js.map

package/dist/event-log.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"event-log.js","sourceRoot":"","sources":["../src/event-log.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,mBAAmB,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC;AAOjD,SAAS,YAAY,CAAI,KAA0B;IACjD,OAAO,CACL,OAAO,KAAK,KAAK,QAAQ;QACzB,KAAK,KAAK,IAAI;QACd,QAAQ,IAAI,KAAK;QAChB,KAAyB,CAAC,MAAM,KAAK,mBAAmB,CAC1D,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,OAAO,QAAQ;IACX,MAAM,GAA+B,EAAE,CAAC;IACxC,OAAO,GAAG,CAAC,CAAC;IACZ,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEhD;;OAEG;IACH,MAAM,CAAC,KAAQ;QACb,IAAI,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YACtC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;YAClC,gDAAgD;YAChD,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBAC3C,IAAI,GAAG,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;oBACvB,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAChC,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IACpC,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,IAAY;QACrB,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QACzC,MAAM,QAAQ,GAAoB,EAAE,MAAM,EAAE,mBAAmB,EAAE,IAAI,EAAE,CAAC;QACxE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC3B,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IACpC,CAAC;IAED;;;OAGG;IACH,IAAI,CAAC,QAAgB,CAAC;QACpB,MAAM,MAAM,GAAQ,EAAE,CAAC;QACvB,IAAI,GAAG,GAAG,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;QAC3B,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,OAAO,GAAG,IAAI,CAAC,IAAI,MAAM,GAAG,KAAK,EAAE,CAAC;YAClC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAC/B,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC;gBACzB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACnB,MAAM,EAAE,CAAC;YACX,CAAC;YACD,GAAG,EAAE,CAAC;QACR,CAAC;QAED,IAAI,CAAC,OAAO,GAAG,GAAG,GAAG,CAAC,CAAC;QACvB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,IAAY;QACjB,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,IAAI,IAAI,CAAC,OAAO;YAAE,OAAO,IAAI,CAAC;QAEhE,MAAM,MAAM,GAAQ,EAAE,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC;gBACzB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QACD,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,IAAI,CAAC,QAAgB,CAAC;QACpB,MAAM,MAAM,GAAQ,EAAE,CAAC;QACvB,IAAI,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC;QACvB,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,OAAO,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,MAAM,GAAG,KAAK,EAAE,CAAC;YAClD,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAC/B,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC;gBACzB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACnB,MAAM,EAAE,CAAC;YACX,CAAC;YACD,GAAG,EAAE,CAAC;QACR,CAAC;QAED,IAAI,CAAC,OAAO,GAAG,GAAG,CAAC;QACnB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,KAAc;QACnB,MAAM,KAAK,GAAG,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC;QACpC,MAAM,MAAM,GAAQ,EAAE,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACpE,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC;gBACzB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC,OAAO,EAAE,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,OAAO;QACL,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAAE,OAAO,IAAI,CAAC;QACjD,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC3C,CAAC;IAED;;;OAGG;IACH,kBAAkB,CAAC,IAAY;QAC7B,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IAED;;OAEG;IACH,IAAI,eAAe;QACjB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,cAAc;QACZ,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACnC,CAAC;IAED;;;OAGG;IACH,WAAW,CAAC,SAAiB;QAC3B,MAAM,MAAM,GAAQ,EAAE,CAAC;QACvB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACvD,KAAK,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC;gBACzB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF"}

package/dist/formatter.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Format a result message with a prefix character.
+ *
+ * Prefix conventions:
+ *   + created
+ *   ~ modified (edge/connection)
+ *   * changed (property)
+ *   - removed
+ *   ! meta/group operation
+ *   @ bulk/layout operation
+ */
+export declare function formatResult(success: boolean, message: string, prefix?: string): string;
+/**
+ * Suggest a correction for a misspelled input by finding the closest
+ * candidate using Levenshtein distance. Returns null if no candidate
+ * is close enough (distance > 3).
+ */
+export declare function suggest(input: string, candidates: string[]): string | null;
+//# sourceMappingURL=formatter.d.ts.map

package/dist/formatter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"formatter.d.ts","sourceRoot":"","sources":["../src/formatter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,wBAAgB,YAAY,CAC1B,OAAO,EAAE,OAAO,EAChB,OAAO,EAAE,MAAM,EACf,MAAM,CAAC,EAAE,MAAM,GACd,MAAM,CAIR;AAED;;;;GAIG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,MAAM,GAAG,IAAI,CAe1E"}

package/dist/formatter.js

@@ -0,0 +1,64 @@
+/**
+ * Format a result message with a prefix character.
+ *
+ * Prefix conventions:
+ *   + created
+ *   ~ modified (edge/connection)
+ *   * changed (property)
+ *   - removed
+ *   ! meta/group operation
+ *   @ bulk/layout operation
+ */
+export function formatResult(success, message, prefix) {
+    if (!success)
+        return `ERROR: ${message}`;
+    if (prefix)
+        return `${prefix} ${message}`;
+    return message;
+}
+/**
+ * Suggest a correction for a misspelled input by finding the closest
+ * candidate using Levenshtein distance. Returns null if no candidate
+ * is close enough (distance > 3).
+ */
+export function suggest(input, candidates) {
+    if (candidates.length === 0)
+        return null;
+    let best = null;
+    let bestDist = Infinity;
+    for (const candidate of candidates) {
+        const dist = levenshtein(input.toLowerCase(), candidate.toLowerCase());
+        if (dist < bestDist) {
+            bestDist = dist;
+            best = candidate;
+        }
+    }
+    return bestDist <= 3 ? best : null;
+}
+/**
+ * Compute Levenshtein distance between two strings.
+ */
+function levenshtein(a, b) {
+    const m = a.length;
+    const n = b.length;
+    // Use a single-row DP array
+    const prev = new Array(n + 1);
+    for (let j = 0; j <= n; j++)
+        prev[j] = j;
+    for (let i = 1; i <= m; i++) {
+        let prevDiag = prev[0];
+        prev[0] = i;
+        for (let j = 1; j <= n; j++) {
+            const temp = prev[j];
+            if (a[i - 1] === b[j - 1]) {
+                prev[j] = prevDiag;
+            }
+            else {
+                prev[j] = 1 + Math.min(prevDiag, prev[j - 1], prev[j]);
+            }
+            prevDiag = temp;
+        }
+    }
+    return prev[n];
+}
+//# sourceMappingURL=formatter.js.map

package/dist/formatter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"formatter.js","sourceRoot":"","sources":["../src/formatter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,MAAM,UAAU,YAAY,CAC1B,OAAgB,EAChB,OAAe,EACf,MAAe;IAEf,IAAI,CAAC,OAAO;QAAE,OAAO,UAAU,OAAO,EAAE,CAAC;IACzC,IAAI,MAAM;QAAE,OAAO,GAAG,MAAM,IAAI,OAAO,EAAE,CAAC;IAC1C,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,OAAO,CAAC,KAAa,EAAE,UAAoB;IACzD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEzC,IAAI,IAAI,GAAkB,IAAI,CAAC;IAC/B,IAAI,QAAQ,GAAG,QAAQ,CAAC;IAExB,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,IAAI,GAAG,WAAW,CAAC,KAAK,CAAC,WAAW,EAAE,EAAE,SAAS,CAAC,WAAW,EAAE,CAAC,CAAC;QACvE,IAAI,IAAI,GAAG,QAAQ,EAAE,CAAC;YACpB,QAAQ,GAAG,IAAI,CAAC;YAChB,IAAI,GAAG,SAAS,CAAC;QACnB,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;AACrC,CAAC;AAED;;GAEG;AACH,SAAS,WAAW,CAAC,CAAS,EAAE,CAAS;IACvC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IAEnB,4BAA4B;IAC5B,MAAM,IAAI,GAAG,IAAI,KAAK,CAAS,CAAC,GAAG,CAAC,CAAC,CAAC;IACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;QAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAEzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,IAAI,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBAC1B,IAAI,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;YACrB,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACzD,CAAC;YACD,QAAQ,GAAG,IAAI,CAAC;QAClB,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC;AACjB,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,8 @@
+export { tokenize, isKeyValue, parseKeyValue, isArrow, isSelector, } from "./tokenizer.js";
+export { parseOp, isParseError, type ParsedOp, type ParseError, } from "./parsed-op.js";
+export { EventLog } from "./event-log.js";
+export { VerbRegistry, type VerbSpec } from "./verb-registry.js";
+export { SessionDispatcher, type SessionHooks, } from "./session.js";
+export { formatResult, suggest } from "./formatter.js";
+export { createFcpServer, type FcpServerConfig, type FcpDomainAdapter, type OpResult, type QueryResult, } from "./server.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AACA,OAAO,EACL,QAAQ,EACR,UAAU,EACV,aAAa,EACb,OAAO,EACP,UAAU,GACX,MAAM,gBAAgB,CAAC;AAGxB,OAAO,EACL,OAAO,EACP,YAAY,EACZ,KAAK,QAAQ,EACb,KAAK,UAAU,GAChB,MAAM,gBAAgB,CAAC;AAGxB,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAG1C,OAAO,EAAE,YAAY,EAAE,KAAK,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAGjE,OAAO,EACL,iBAAiB,EACjB,KAAK,YAAY,GAClB,MAAM,cAAc,CAAC;AAGtB,OAAO,EAAE,YAAY,EAAE,OAAO,EAAE,MAAM,gBAAgB,CAAC;AAGvD,OAAO,EACL,eAAe,EACf,KAAK,eAAe,EACpB,KAAK,gBAAgB,EACrB,KAAK,QAAQ,EACb,KAAK,WAAW,GACjB,MAAM,aAAa,CAAC"}

package/dist/index.js

@@ -0,0 +1,15 @@
+// Tokenizer
+export { tokenize, isKeyValue, parseKeyValue, isArrow, isSelector, } from "./tokenizer.js";
+// Parsed operation
+export { parseOp, isParseError, } from "./parsed-op.js";
+// Event log
+export { EventLog } from "./event-log.js";
+// Verb registry
+export { VerbRegistry } from "./verb-registry.js";
+// Session
+export { SessionDispatcher, } from "./session.js";
+// Formatter
+export { formatResult, suggest } from "./formatter.js";
+// Server
+export { createFcpServer, } from "./server.js";
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,YAAY;AACZ,OAAO,EACL,QAAQ,EACR,UAAU,EACV,aAAa,EACb,OAAO,EACP,UAAU,GACX,MAAM,gBAAgB,CAAC;AAExB,mBAAmB;AACnB,OAAO,EACL,OAAO,EACP,YAAY,GAGb,MAAM,gBAAgB,CAAC;AAExB,YAAY;AACZ,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAE1C,gBAAgB;AAChB,OAAO,EAAE,YAAY,EAAiB,MAAM,oBAAoB,CAAC;AAEjE,UAAU;AACV,OAAO,EACL,iBAAiB,GAElB,MAAM,cAAc,CAAC;AAEtB,YAAY;AACZ,OAAO,EAAE,YAAY,EAAE,OAAO,EAAE,MAAM,gBAAgB,CAAC;AAEvD,SAAS;AACT,OAAO,EACL,eAAe,GAKhB,MAAM,aAAa,CAAC"}

package/dist/parsed-op.d.ts

@@ -0,0 +1,32 @@
+/**
+ * A successfully parsed operation.
+ */
+export interface ParsedOp {
+    verb: string;
+    positionals: string[];
+    params: Record<string, string>;
+    selectors: string[];
+    raw: string;
+}
+/**
+ * A parse failure.
+ */
+export interface ParseError {
+    success: false;
+    error: string;
+    raw: string;
+}
+/**
+ * Parse an operation string into a structured ParsedOp.
+ *
+ * First token becomes the verb. Remaining tokens are classified:
+ *   @-prefixed  -> selectors
+ *   key:value   -> params
+ *   everything else -> positionals (in order)
+ */
+export declare function parseOp(input: string): ParsedOp | ParseError;
+/**
+ * Type guard: check if a parse result is an error.
+ */
+export declare function isParseError(result: ParsedOp | ParseError): result is ParseError;
+//# sourceMappingURL=parsed-op.d.ts.map

package/dist/parsed-op.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"parsed-op.d.ts","sourceRoot":"","sources":["../src/parsed-op.ts"],"names":[],"mappings":"AAEA;;GAEG;AACH,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/B,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,GAAG,EAAE,MAAM,CAAC;CACb;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,OAAO,EAAE,KAAK,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;CACb;AAED;;;;;;;GAOG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,QAAQ,GAAG,UAAU,CA0B5D;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,QAAQ,GAAG,UAAU,GAAG,MAAM,IAAI,UAAU,CAEhF"}

package/dist/parsed-op.js

@@ -0,0 +1,41 @@
+import { tokenize, isKeyValue, parseKeyValue, isSelector } from "./tokenizer.js";
+/**
+ * Parse an operation string into a structured ParsedOp.
+ *
+ * First token becomes the verb. Remaining tokens are classified:
+ *   @-prefixed  -> selectors
+ *   key:value   -> params
+ *   everything else -> positionals (in order)
+ */
+export function parseOp(input) {
+    const raw = input.trim();
+    const tokens = tokenize(raw);
+    if (tokens.length === 0) {
+        return { success: false, error: "empty operation", raw };
+    }
+    const verb = tokens[0].toLowerCase();
+    const positionals = [];
+    const params = {};
+    const selectors = [];
+    for (let i = 1; i < tokens.length; i++) {
+        const token = tokens[i];
+        if (isSelector(token)) {
+            selectors.push(token);
+        }
+        else if (isKeyValue(token)) {
+            const { key, value } = parseKeyValue(token);
+            params[key] = value;
+        }
+        else {
+            positionals.push(token);
+        }
+    }
+    return { verb, positionals, params, selectors, raw };
+}
+/**
+ * Type guard: check if a parse result is an error.
+ */
+export function isParseError(result) {
+    return "success" in result && result.success === false;
+}
+//# sourceMappingURL=parsed-op.js.map

package/dist/parsed-op.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parsed-op.js","sourceRoot":"","sources":["../src/parsed-op.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,aAAa,EAAE,UAAU,EAAW,MAAM,gBAAgB,CAAC;AAsB1F;;;;;;;GAOG;AACH,MAAM,UAAU,OAAO,CAAC,KAAa;IACnC,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IACzB,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;IAE7B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,iBAAiB,EAAE,GAAG,EAAE,CAAC;IAC3D,CAAC;IAED,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;IACrC,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,MAAM,SAAS,GAAa,EAAE,CAAC;IAE/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;YACtB,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxB,CAAC;aAAM,IAAI,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;YAC7B,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;YAC5C,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;QACtB,CAAC;aAAM,CAAC;YACN,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC;AACvD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,MAA6B;IACxD,OAAO,SAAS,IAAI,MAAM,IAAI,MAAM,CAAC,OAAO,KAAK,KAAK,CAAC;AACzD,CAAC"}

package/dist/server.d.ts

@@ -0,0 +1,71 @@
+import { McpServer } from "@modelcontextprotocol/sdk/server/mcp.js";
+import { EventLog } from "./event-log.js";
+import type { ParsedOp } from "./parsed-op.js";
+import type { VerbSpec } from "./verb-registry.js";
+/**
+ * Result of executing a single operation.
+ */
+export interface OpResult {
+    success: boolean;
+    message: string;
+    prefix?: string;
+}
+/**
+ * Result of a query that may include an image.
+ */
+export interface QueryResult {
+    text: string;
+    image?: {
+        base64: string;
+        mimeType: string;
+    };
+}
+/**
+ * Domain adapter that an FCP domain must implement.
+ */
+export interface FcpDomainAdapter<Model, Event> {
+    /** Create a new empty model. */
+    createEmpty(title: string, params: Record<string, string>): Model;
+    /** Serialize model to saveable format. */
+    serialize(model: Model): Buffer | string;
+    /** Deserialize from file contents. */
+    deserialize(data: Buffer | string): Model;
+    /** Rebuild derived indices (e.g., after undo/redo). */
+    rebuildIndices(model: Model): void;
+    /** Return a compact digest for drift detection. */
+    getDigest(model: Model): string;
+    /** Execute a parsed operation against the model. */
+    dispatchOp(op: ParsedOp, model: Model, log: EventLog<Event>): OpResult | Promise<OpResult>;
+    /** Execute a query against the model. */
+    dispatchQuery(query: string, model: Model): string | QueryResult | Promise<string | QueryResult>;
+    /** Reverse a single event (for undo). */
+    reverseEvent(event: Event, model: Model): void;
+    /** Replay a single event (for redo). */
+    replayEvent(event: Event, model: Model): void;
+}
+/**
+ * Configuration for creating an FCP MCP server.
+ */
+export interface FcpServerConfig<Model, Event> {
+    /** Domain name (e.g., "midi", "studio"). Used as tool name prefix. */
+    domain: string;
+    /** Domain adapter implementing all domain-specific logic. */
+    adapter: FcpDomainAdapter<Model, Event>;
+    /** Verb specifications for this domain. */
+    verbs: VerbSpec[];
+    /** Optional reference card configuration. */
+    referenceCard?: {
+        sections?: Record<string, string>;
+    };
+}
+/**
+ * Create an MCP server wired up with FCP conventions.
+ *
+ * Registers 4 tools:
+ *   {domain}         — primary mutation tool (ops array)
+ *   {domain}_query   — read-only queries
+ *   {domain}_session — lifecycle (new, open, save, checkpoint, undo, redo)
+ *   {domain}_help    — reference card
+ */
+export declare function createFcpServer<Model, Event>(config: FcpServerConfig<Model, Event>): McpServer;
+//# sourceMappingURL=server.d.ts.map

package/dist/server.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"server.d.ts","sourceRoot":"","sources":["../src/server.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,yCAAyC,CAAC;AAEpE,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAE1C,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAE/C,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAInD;;GAEG;AACH,MAAM,WAAW,QAAQ;IACvB,OAAO,EAAE,OAAO,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,CAAC,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC;CAC9C;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB,CAAC,KAAK,EAAE,KAAK;IAC5C,gCAAgC;IAChC,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,KAAK,CAAC;IAClE,0CAA0C;IAC1C,SAAS,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,GAAG,MAAM,CAAC;IACzC,sCAAsC;IACtC,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,KAAK,CAAC;IAC1C,uDAAuD;IACvD,cAAc,CAAC,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC;IACnC,mDAAmD;IACnD,SAAS,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,CAAC;IAChC,oDAAoD;IACpD,UAAU,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,QAAQ,CAAC,KAAK,CAAC,GAAG,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;IAC3F,yCAAyC;IACzC,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,GAAG,MAAM,GAAG,WAAW,GAAG,OAAO,CAAC,MAAM,GAAG,WAAW,CAAC,CAAC;IACjG,yCAAyC;IACzC,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC;IAC/C,wCAAwC;IACxC,WAAW,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC;CAC/C;AAED;;GAEG;AACH,MAAM,WAAW,eAAe,CAAC,KAAK,EAAE,KAAK;IAC3C,sEAAsE;IACtE,MAAM,EAAE,MAAM,CAAC;IACf,6DAA6D;IAC7D,OAAO,EAAE,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACxC,2CAA2C;IAC3C,KAAK,EAAE,QAAQ,EAAE,CAAC;IAClB,6CAA6C;IAC7C,aAAa,CAAC,EAAE;QAAE,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;KAAE,CAAC;CACvD;AAED;;;;;;;;GAQG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,KAAK,EAC1C,MAAM,EAAE,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC,GACpC,SAAS,CAoKX"}