@0xbuff/throughline 0.0.0-stage → 0.0.2

package/dist/examples.js

@@ -0,0 +1,70 @@
+// src/examples.ts
+/** Copyable sources shared by the gallery, editor and compiler acceptance tests. */
+const EXAMPLES = [
+	{
+		id: "reconciliation",
+		title: "Reconciliation",
+		description: "Compare keyed children, preserve identity, and prepare the changes to commit.",
+		source: [
+			"```thl flow",
+			"group \"Current tree\" as tree",
+			"group \"Work in progress\" as tree",
+			"group \"Changes\" as column",
+			"node current \"List\" in \"Current tree\" = \"ul\"",
+			"node a \"Key a\" in \"Current tree\" = \"li\"",
+			"node b \"Key b\" in \"Current tree\" = \"li\"",
+			"node next \"List\" in \"Work in progress\" = \"ul\"",
+			"node reuse \"Key a\" in \"Work in progress\" = \"li\"",
+			"node added \"Key c\" in \"Work in progress\" hidden = \"li\"",
+			"node changes \"Commit plan\" in \"Changes\" as array = []",
+			"link currentA current -> a",
+			"link currentB current -> b",
+			"link nextA next -> reuse",
+			"link nextC next -> added hidden",
+			"step \"Compare the roots\"",
+			"  focus current, next",
+			"  note \"Both roots are ul elements. Compare their keyed children.\"",
+			"step \"Reuse key a\"",
+			"  focus a, reuse",
+			"  set reuse = \"li · reused\"",
+			"  note \"The type and key match. Preserve this child’s identity.\"",
+			"step \"Remove key b\"",
+			"  focus b, changes",
+			"  set changes = [\"remove b\"]",
+			"  note \"Key b is absent from the next children. Schedule its removal; the current tree stays intact until commit.\"",
+			"step \"Insert key c\"",
+			"  show node added",
+			"  show link nextC",
+			"  focus added, changes",
+			"  set added = \"li · new\"",
+			"  set changes = [\"remove b\", \"insert c\"]",
+			"  note \"Key c has no match in the current children. Prepare a new child.\"",
+			"step \"Ready to commit\"",
+			"  focus reuse, added, changes",
+			"  note \"The comparison is complete. Commit applies the planned changes; key a keeps its identity.\"",
+			"```"
+		].join("\n")
+	},
+	{
+		id: "references",
+		title: "Shared references",
+		description: "Copy a reference, mutate the shared object, then move one pointer.",
+		source: [
+			"```thl bindings",
+			"let list = [1, 2]",
+			"let alias = list",
+			"alias.push(3)",
+			"alias = [7]",
+			"```"
+		].join("\n")
+	},
+	{
+		id: "matrix",
+		title: "Matrix multiplication",
+		description: "Follow one row and one column to each output cell.",
+		source: "```thl matrix\nA = [[1,2],[3,4]]\nB = [[5,6],[7,8]]\n```"
+	}
+];
+export { EXAMPLES };
+
+//# sourceMappingURL=examples.js.map

package/dist/examples.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"examples.js","names":[],"sources":["../src/examples.ts"],"sourcesContent":["/** Copyable sources shared by the gallery, editor and compiler acceptance tests. */\nexport const EXAMPLES = [\n\t{\n\t\tid: \"reconciliation\",\n\t\ttitle: \"Reconciliation\",\n\t\tdescription:\n\t\t\t\"Compare keyed children, preserve identity, and prepare the changes to commit.\",\n\t\tsource: [\n\t\t\t\"```thl flow\",\n\t\t\t'group \"Current tree\" as tree',\n\t\t\t'group \"Work in progress\" as tree',\n\t\t\t'group \"Changes\" as column',\n\t\t\t'node current \"List\" in \"Current tree\" = \"ul\"',\n\t\t\t'node a \"Key a\" in \"Current tree\" = \"li\"',\n\t\t\t'node b \"Key b\" in \"Current tree\" = \"li\"',\n\t\t\t'node next \"List\" in \"Work in progress\" = \"ul\"',\n\t\t\t'node reuse \"Key a\" in \"Work in progress\" = \"li\"',\n\t\t\t'node added \"Key c\" in \"Work in progress\" hidden = \"li\"',\n\t\t\t'node changes \"Commit plan\" in \"Changes\" as array = []',\n\t\t\t\"link currentA current -> a\",\n\t\t\t\"link currentB current -> b\",\n\t\t\t\"link nextA next -> reuse\",\n\t\t\t\"link nextC next -> added hidden\",\n\t\t\t'step \"Compare the roots\"',\n\t\t\t\"  focus current, next\",\n\t\t\t'  note \"Both roots are ul elements. Compare their keyed children.\"',\n\t\t\t'step \"Reuse key a\"',\n\t\t\t\"  focus a, reuse\",\n\t\t\t'  set reuse = \"li · reused\"',\n\t\t\t'  note \"The type and key match. Preserve this child’s identity.\"',\n\t\t\t'step \"Remove key b\"',\n\t\t\t\"  focus b, changes\",\n\t\t\t'  set changes = [\"remove b\"]',\n\t\t\t'  note \"Key b is absent from the next children. Schedule its removal; the current tree stays intact until commit.\"',\n\t\t\t'step \"Insert key c\"',\n\t\t\t\"  show node added\",\n\t\t\t\"  show link nextC\",\n\t\t\t\"  focus added, changes\",\n\t\t\t'  set added = \"li · new\"',\n\t\t\t'  set changes = [\"remove b\", \"insert c\"]',\n\t\t\t'  note \"Key c has no match in the current children. Prepare a new child.\"',\n\t\t\t'step \"Ready to commit\"',\n\t\t\t\"  focus reuse, added, changes\",\n\t\t\t'  note \"The comparison is complete. Commit applies the planned changes; key a keeps its identity.\"',\n\t\t\t\"```\",\n\t\t].join(\"\\n\"),\n\t},\n\t{\n\t\tid: \"references\",\n\t\ttitle: \"Shared references\",\n\t\tdescription:\n\t\t\t\"Copy a reference, mutate the shared object, then move one pointer.\",\n\t\tsource: [\n\t\t\t\"```thl bindings\",\n\t\t\t\"let list = [1, 2]\",\n\t\t\t\"let alias = list\",\n\t\t\t\"alias.push(3)\",\n\t\t\t\"alias = [7]\",\n\t\t\t\"```\",\n\t\t].join(\"\\n\"),\n\t},\n\t{\n\t\tid: \"matrix\",\n\t\ttitle: \"Matrix multiplication\",\n\t\tdescription: \"Follow one row and one column to each output cell.\",\n\t\tsource: \"```thl matrix\\nA = [[1,2],[3,4]]\\nB = [[5,6],[7,8]]\\n```\",\n\t},\n] as const;\n"],"mappings":";;AACA,MAAa,WAAW;CACvB;EACC,IAAI;EACJ,OAAO;EACP,aACC;EACD,QAAQ;GACP;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;EACD,CAAC,CAAC,KAAK,IAAI;CACZ;CACA;EACC,IAAI;EACJ,OAAO;EACP,aACC;EACD,QAAQ;GACP;GACA;GACA;GACA;GACA;GACA;EACD,CAAC,CAAC,KAAK,IAAI;CACZ;CACA;EACC,IAAI;EACJ,OAAO;EACP,aAAa;EACb,QAAQ;CACT;AACD"}

package/dist/index.d.ts

@@ -0,0 +1,68 @@
+/** Pure authoring and compilation API. The optional renderer lives at ./react. */
+import { a as Frame, c as ProgramError, d as Snapshot, f as SourceLocation, h as View, i as Event, l as Relation, m as Value, n as Diagnostic, o as GroupLayout, p as Trace, r as Entity, s as Program, t as Beat, u as SceneGroup } from "./model-Dwy20ibD.js";
+/** A single parsed fence. Markdown adapters supply lines directly, without reparsing. */
+type ThlBlock = {
+  kind: string;
+  lines: string[];
+  /** Location of the header, so the first body line is source.line + 1. */
+  source?: SourceLocation;
+};
+/**
+ * Parse one thl block, optionally fenced with backticks or tildes. Fence
+ * lengths/indentation follow CommonMark; document/container parsing belongs
+ * to the host's Markdown parser, not a second parser inside the engine.
+ */
+export declare function parseThl(src: string): ThlBlock | null;
+export declare function parseProgram(ast: ThlBlock): Program;
+export declare function validateProgram(input: unknown): asserts input is Program;
+export declare function compileProgram(input: unknown): Trace;
+/**
+ * One paragraph naming the step position, label, changed values,
+ * focus targets, transfers, and author notes. Deterministic: the
+ * same frame always reads the same way.
+ */
+export declare function describeFrame(frame: Frame, total?: number): string;
+/** Domains routed by the ```thl <domain> info string. */
+type DomainName = "flow" | "bindings" | "binary" | "matrix" | "callstack";
+export declare const SUPPORTED_DOMAINS: readonly DomainName[];
+/** Compile any fenced thl block, routing on the info-string domain. */
+export declare function compile(src: string): Trace;
+export declare function compileAst(ast: ThlBlock): Trace;
+/** Fixed v1 safety ceilings, independent of machine speed or wall-clock timing. */
+export declare const COMPILATION_LIMITS: Readonly<{
+  sourceCharacters: 262144;
+  programUnits: 1000000;
+  traceUnits: 8000000;
+  entities: 200;
+  relations: 1000;
+  steps: 2000;
+  events: 10000;
+}>;
+type StepApi = {
+  set(target: string, value: Value): void;
+  focus(...targets: string[]): void;
+  send(relation: string, value?: Value): void;
+  note(text: string): void;
+  show(kind: "node" | "link", id: string): void;
+  hide(kind: "node" | "link", id: string): void;
+};
+type Tracer = {
+  group(name: string, layout: GroupLayout): Tracer;
+  node(id: string, label: string, value: Value, options?: {
+    lane?: string;
+    view?: View;
+    hidden?: boolean;
+  }): Tracer;
+  link(id: string, from: string, to: string, label?: string, options?: {
+    hidden?: boolean;
+  }): Tracer;
+  get(target: string): Value | undefined;
+  step(label: string, body: (step: StepApi) => void): Tracer;
+  program(): Program;
+};
+/**
+ * Computation adapter: run any ordinary algorithm and narrate it.
+ * Values written in a step become visible together, exactly like authored steps.
+ */
+export declare function tracer(): Tracer;
+export { type Beat, type Diagnostic, type DomainName, type Entity, type Event, type Frame, type GroupLayout, type Program, ProgramError, type Relation, type SceneGroup, type Snapshot, type SourceLocation, type StepApi, type ThlBlock, type Trace, type Tracer, type Value, type View };