@classytic/labs 0.3.0 → 0.4.0

package/README.md

@@ -31,19 +31,26 @@ npm i @classytic/labs @classytic/stage react react-dom katex lucide-react
 
 ```css
 /* in your global CSS, after `@import "tailwindcss";` */
-@import "@classytic/stage/styles.css";   /* engine tokens + asset kit */
-@import "@classytic/labs/styles.css";     /* control-UI kit + lab tokens */
+@import '@classytic/stage/styles.css'; /* engine tokens + asset kit */
+@import '@classytic/labs/styles.css'; /* control-UI kit + lab tokens */
 ```
 
-`styles.css` is the compatibility aggregate. Hosts that only load selected
-domains can import the layers explicitly instead:
+`styles.css` is the compatibility aggregate: every subject, which is right for a
+gallery and wasteful for a course page. Hosts that know which subjects a page
+shows should import the layers explicitly instead:
 
 ```css
-@import "@classytic/labs/styles/core.css";
-@import "@classytic/labs/styles/domains.css";  /* built-in science/math/domain visuals */
-@import "@classytic/labs/styles/commerce.css"; /* only on Commerce routes */
+@import '@classytic/labs/styles/core.css'; /* tokens, shell, components: always */
+@import '@classytic/labs/styles/figure.css'; /* figure art direction:        always */
+@import '@classytic/labs/styles/domains/math.css'; /* ONE subject */
+@import '@classytic/labs/styles/commerce.css'; /* only on Commerce routes */
 ```
 
+core.css and figure.css are the two always-required layers, then one sheet per
+subject from `styles/domains/`. Use `styles/domains.css` if you genuinely want
+every subject in one import. Per-subject budgets and the full list of sheets are
+in `docs/DESIGN-SYSTEM.md`.
+
 Three-dimensional renderers are deliberately opt-in. They reuse the same lesson,
 controls, evidence, and domain model as the lightweight renderer:
 
@@ -68,7 +75,7 @@ Stage fallbacks; they do not install or override a host theme.
 
 ```ts
 // once, if you use any lab that renders equations (DerivativeExplorer, Grapher, …)
-import "katex/dist/katex.min.css";
+import 'katex/dist/katex.min.css';
 ```
 
 ## Use a lab
@@ -96,10 +103,11 @@ authoring kit. Params are validated against the family's zod schema before a sce
 ```ts
 import { listLabTemplates, instantiateTemplate } from '@classytic/labs/catalog';
 
-listLabTemplates();                       // [{ id:'balance-algebra', category:'algebra', … }, …]
+listLabTemplates(); // [{ id:'balance-algebra', category:'algebra', … }, …]
 const r = instantiateTemplate('balance-algebra', { coef: 3, addend: 1, rhs: 10, answer: 3 });
-if (r.ok) renderScene(r.doc);             // r.doc is a portable SceneDoc
-else console.warn(r.error, r.issues);     // typed validation errors — no broken scene
+if (r.ok)
+  renderScene(r.doc); // r.doc is a portable SceneDoc
+else console.warn(r.error, r.issues); // typed validation errors — no broken scene
 ```
 
 Built-in families: `balance-algebra`, `area-model`, `growing-pattern`, `balance-lever`,
@@ -110,7 +118,7 @@ Built-in families: `balance-algebra`, `area-model`, `growing-pattern`, `balance-
 Community tools should import the host-neutral contract from `@classytic/labs/authoring`:
 
 ```ts
-import { defineLab, parseAuthoredActivity } from '@classytic/labs/authoring';
+import { defineInvestigation, defineLab, parseAuthoredActivity } from '@classytic/labs/authoring';
 ```
 
 This subpath contains no lab renderer, editor, or domain barrel. A manifest owns the
@@ -123,9 +131,8 @@ instead of receiving decorative empty steps. Authors replace the functional star
 with domain teaching; they do not rebuild headers, focus mode, responsive workspace,
 inspector, feedback, transcript, or transport controls.
 
-The generator emits five reviewable artifacts: a cheap `manifest.ts`, a pure compiled
-`activity.ts`, an isolated `runtime.tsx`, an `example.mdx` showing the CMS-facing
-configuration, and an interaction test covering
+The generator emits four reviewable artifacts: a cheap `manifest.ts`, a pure compiled
+`activity.ts`, an isolated `runtime.tsx`, and an interaction test covering
 the primary action, reset, live feedback, and transcript. The starter is functional, but it
 does not declare itself showcase-ready. Add the manifest `experience` contract only when the
 real domain activity has evidence for every declared phase and accessibility behavior.
@@ -133,10 +140,39 @@ real domain activity has evidence for every declared phase and accessibility beh
 it directly, while the global manifest catalog does not, preserving its schema/metadata-only
 boundary.
 
+Curated CMS recipes live under `examples/mdx/`, outside production source. They are intentionally
+few and demonstrate meaningful authoring choices rather than duplicating every manifest default.
+
 Authored activities support choice, numeric-with-tolerance, accepted-text, ordering, and
 rubric-based reflection responses. Hosts decide how those portable response contracts are
 rendered and persisted.
 
+In MDX, `mission` is the clearest name for the learner-facing instruction and takes precedence
+over the legacy `prompt` prop. Lab-specific presets remain typed domain props rather than a global
+preset registry:
+
+```mdx
+<StructureDetective mission="Collect three results, then identify the structure." sampleSet="core" />
+<CellSampleInvestigator
+  mission="Inspect each sample and defend its cell type from the evidence."
+  sampleSet="core"
+/>
+```
+
+For a custom investigation sequence, `defineInvestigation()` supplies the fixed
+`pattern: 'investigation'` field and compiles through the same canonical activity runtime:
+
+```ts
+const activity = defineInvestigation({
+  objectives: ['Use observations to support a structural claim'],
+  steps: [
+    { id: 'test', phase: 'act', title: 'Collect evidence', success: 'tested' },
+    { id: 'claim', phase: 'explain', title: 'Explain the evidence' },
+  ],
+  success: [{ id: 'tested', source: 'action', key: 'run-tests' }],
+});
+```
+
 Before featuring a community lab, call `assessLabExperience(manifest)`. It returns actionable
 issues when the experience is missing a phase, response, keyboard path, scene transcript, or
 reduced-motion behavior. This is a quality gate, not a second runtime or a versioned UI system.
@@ -156,10 +192,13 @@ completion/score events flow to the host's learner seam (xAPI) via `useLearner()
 
 Domain packs (lab components): `@classytic/labs/{math, physics, chem, circuits, geometry,
 language, ict, commerce, biology, geography, discrete, statistics, ml}`. Shared:
-`@classytic/labs/{core, catalog, schemas}`. Editor blocks use
+`@classytic/labs/{core, catalog, schemas}`. KaTeX-backed typesetting is available
+from `@classytic/labs/tex` so that dependency is explicit. Editor blocks use
 `@classytic/labs/blocks`; discovery-only hosts should prefer `/blocks/catalog`,
-`/blocks/gallery`, or `/blocks/domains`, and load the full block surface only when
-opening an authoring editor. Import only the domain runtime you need; the build
+`/blocks/gallery`, or `/blocks/domains`. Learner code that resolves a lab by key
+should use `/blocks/resolve`, which excludes CMS definitions, authoring schemas,
+and catalog metadata. Load the full block surface only when opening an authoring
+editor. Import only the domain runtime you need; the build
 preserves leaf modules so ESM bundlers can tree-shake them.
 
 ## Authoring algorithm lessons
@@ -227,12 +266,14 @@ in `labs/styles.css` `:root`. Override any of them in your own `:root` / `.dark`
   --lab-accent: oklch(0.55 0.2 300);
 
   /* density: paddings/gaps everywhere follow the spacing scale */
-  --lab-sp-2: 8px;  --lab-sp-3: 12px;  --lab-sp-4: 14px;   /* tighter UI */
+  --lab-sp-2: 8px;
+  --lab-sp-3: 12px;
+  --lab-sp-4: 14px; /* tighter UI */
 
   /* shape + type */
-  --lab-r-md: 8px;                  /* squarer cards/chips        */
-  --lab-t-lg: 16px;                 /* bigger question prompts    */
-  --lab-shadow-sm: none;            /* flat, borderless look      */
+  --lab-r-md: 8px; /* squarer cards/chips        */
+  --lab-t-lg: 16px; /* bigger question prompts    */
+  --lab-shadow-sm: none; /* flat, borderless look      */
 }
 ```
 

package/dist/_virtual/_rolldown/runtime.mjs

@@ -1,5 +1,8 @@
 //#region \0rolldown/runtime.js
 var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
 var __exportAll = (all, no_symbols) => {
 	let target = {};
 	for (var name in all) {
@@ -13,6 +16,21 @@ var __exportAll = (all, no_symbols) => {
 	}
 	return target;
 };
+var __copyProps = (to, from, except, desc) => {
+	if (from && typeof from === "object" || typeof from === "function") {
+		for (var keys = __getOwnPropNames(from), i = 0, n = keys.length, key; i < n; i++) {
+			key = keys[i];
+			if (!__hasOwnProp.call(to, key) && key !== except) {
+				__defProp(to, key, {
+					get: ((k) => from[k]).bind(null, key),
+					enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable
+				});
+			}
+		}
+	}
+	return to;
+};
+var __reExport = (target, mod, secondTarget) => (__copyProps(target, mod, "default"), secondTarget && __copyProps(secondTarget, mod, "default"));
 
 //#endregion
-export { __exportAll };
+export { __exportAll, __reExport };

package/dist/algorithms/GraphAlgorithmLab.d.mts

@@ -1,5 +1,4 @@
 import { AlgorithmGraph } from "./contract.mjs";
-
 //#region src/algorithms/GraphAlgorithmLab.d.ts
 interface GraphAlgorithmLabProps {
   algorithm?: 'bfs' | 'dfs' | 'dijkstra';
@@ -9,13 +8,6 @@ interface GraphAlgorithmLabProps {
   title?: string;
   prompt?: string;
 }
-declare function GraphAlgorithmLab({
-  algorithm,
-  graph,
-  source,
-  target,
-  title,
-  prompt
-}: GraphAlgorithmLabProps): import("react").JSX.Element;
+declare function GraphAlgorithmLab({ algorithm, graph, source, target, title, prompt }: GraphAlgorithmLabProps): import("react").JSX.Element;
 //#endregion
 export { GraphAlgorithmLab, GraphAlgorithmLabProps };

package/dist/algorithms/GraphAlgorithmLab.mjs

@@ -4,9 +4,9 @@ import { AssessedChoiceGroup } from "../kit/controls.mjs";
 import { Activity } from "../kit/activity.mjs";
 import { bfs, dfs, dijkstra, reconstructPath } from "./graph.mjs";
 import { teachingGraph } from "./presets.mjs";
+import { normalizeGraph } from "./normalize.mjs";
 import { GraphView } from "./GraphView.mjs";
 import { TraceTransport } from "./TraceTransport.mjs";
-import { normalizeGraph } from "./normalize.mjs";
 import { BinaryTransferCheck } from "./LearningChecks.mjs";
 import { useEffect, useMemo, useState } from "react";
 import { Fragment as Fragment$1, jsx, jsxs } from "react/jsx-runtime";
@@ -30,7 +30,7 @@ function GraphAlgorithmLab({ algorithm = "dijkstra", graph = teachingGraph, sour
 	useEffect(() => setTransferAnswer(void 0), [trace]);
 	const visible = trace.events.slice(0, step + 1);
 	const visited = /* @__PURE__ */ new Set();
-	const discovered = new Set([safeSource]);
+	const discovered = /* @__PURE__ */ new Set([safeSource]);
 	const distances = Object.fromEntries(safeGraph.nodes.map((n) => [n.id, n.id === safeSource ? 0 : Infinity]));
 	let current = safeSource;
 	let activeEdge;

package/dist/algorithms/GraphView.d.mts

@@ -1,5 +1,4 @@
 import { AlgorithmGraph } from "./contract.mjs";
-
 //#region src/algorithms/GraphView.d.ts
 interface GraphViewProps {
   graph: AlgorithmGraph;
@@ -10,14 +9,6 @@ interface GraphViewProps {
   path?: readonly string[];
   distances?: Record<string, number>;
 }
-declare function GraphView({
-  graph,
-  current,
-  activeEdge,
-  visited,
-  discovered,
-  path,
-  distances
-}: GraphViewProps): import("react").JSX.Element;
+declare function GraphView({ graph, current, activeEdge, visited, discovered, path, distances }: GraphViewProps): import("react").JSX.Element;
 //#endregion
 export { GraphView, GraphViewProps };

package/dist/algorithms/GridPathLab.d.mts

@@ -5,11 +5,6 @@ interface GridPathLabProps {
   title?: string;
   prompt?: string;
 }
-declare function GridPathLab({
-  rows,
-  cols,
-  title,
-  prompt
-}: GridPathLabProps): import("react").JSX.Element;
+declare function GridPathLab({ rows, cols, title, prompt }: GridPathLabProps): import("react").JSX.Element;
 //#endregion
 export { GridPathLab, GridPathLabProps };

package/dist/algorithms/GrowthLab.d.mts

@@ -7,12 +7,6 @@ interface GrowthLabProps {
   title?: string;
   prompt?: string;
 }
-declare function GrowthLab({
-  sizes,
-  start,
-  predict,
-  title,
-  prompt
-}: GrowthLabProps): import("react").JSX.Element;
+declare function GrowthLab({ sizes, start, predict, title, prompt }: GrowthLabProps): import("react").JSX.Element;
 //#endregion
 export { GrowthLab, GrowthLabProps };

package/dist/algorithms/GrowthLab.mjs

@@ -110,7 +110,7 @@ function GrowthLab({ sizes = DEFAULT_SIZES, start = 0, predict = true, title, pr
 									x: LABEL_W,
 									y: y + 6,
 									width: barW,
-									height: ROW_H - 12,
+									height: 22,
 									rx: 4,
 									fill: worst ? "var(--stage-warn, #f59e0b)" : "var(--stage-accent, #6366f1)",
 									opacity: worst ? 1 : .7

package/dist/algorithms/HashLab.d.mts

@@ -1,5 +1,4 @@
 import { HashStrategy } from "./hashing.mjs";
-
 //#region src/algorithms/HashLab.d.ts
 interface HashLabProps {
   keys?: string[];
@@ -9,13 +8,6 @@ interface HashLabProps {
   title?: string;
   prompt?: string;
 }
-declare function HashLab({
-  keys,
-  buckets,
-  strategy,
-  predict,
-  title,
-  prompt
-}: HashLabProps): import("react").JSX.Element;
+declare function HashLab({ keys, buckets, strategy, predict, title, prompt }: HashLabProps): import("react").JSX.Element;
 //#endregion
 export { HashLab, HashLabProps };

package/dist/algorithms/HashLab.mjs

@@ -2,9 +2,9 @@
 
 import { AssessedChoiceGroup } from "../kit/controls.mjs";
 import { Activity } from "../kit/activity.mjs";
+import { hashTrace } from "./hashing.mjs";
 import { TraceTransport } from "./TraceTransport.mjs";
 import { BinaryTransferCheck } from "./LearningChecks.mjs";
-import { hashTrace } from "./hashing.mjs";
 import { useEffect, useMemo, useState } from "react";
 import { Fragment as Fragment$1, jsx, jsxs } from "react/jsx-runtime";
 import { Check } from "lucide-react";
@@ -41,7 +41,8 @@ function HashLab({ keys = DEFAULT_KEYS, buckets = 7, strategy = "chaining", pred
 	const complete = total === 0 || step >= total - 1;
 	const checkpoint = predict && !!current && step < total;
 	const shown = current?.buckets ?? trace.buckets;
-	const width = LABEL_W + Math.max(1, ...shown.map((bucket) => bucket.length)) * 110;
+	const deepest = Math.max(1, ...shown.map((bucket) => bucket.length));
+	const width = LABEL_W + deepest * 110;
 	const height = shown.length * 36;
 	const placed = current ? trace.steps.indexOf(current) + 1 : 0;
 	const liveLoad = (placed / trace.size).toFixed(2);

package/dist/algorithms/HeapDualView.d.mts

@@ -1,13 +1,7 @@
 import { SequenceItem } from "./sequence-contract.mjs";
 import { HeapEvent } from "./heap.mjs";
-
 //#region src/algorithms/HeapDualView.d.ts
-declare function HeapDualView({
-  items,
-  event,
-  selectedId,
-  onSelect
-}: {
+declare function HeapDualView({ items, event, selectedId, onSelect }: {
   items: SequenceItem[];
   event: HeapEvent;
   selectedId?: string;

package/dist/algorithms/HeapQuestLab.d.mts

@@ -1,5 +1,4 @@
 import { HeapKind, HeapOperation } from "./heap.mjs";
-
 //#region src/algorithms/HeapQuestLab.d.ts
 interface HeapQuestLabProps {
   values?: number[];
@@ -10,14 +9,6 @@ interface HeapQuestLabProps {
   title?: string;
   prompt?: string;
 }
-declare function HeapQuestLab({
-  values,
-  kind,
-  operation,
-  value,
-  predict,
-  title,
-  prompt
-}: HeapQuestLabProps): import("react").JSX.Element;
+declare function HeapQuestLab({ values, kind, operation, value, predict, title, prompt }: HeapQuestLabProps): import("react").JSX.Element;
 //#endregion
 export { HeapQuestLab, HeapQuestLabProps };

package/dist/algorithms/HeapQuestLab.mjs

@@ -2,9 +2,9 @@
 
 import { AssessedChoiceGroup } from "../kit/controls.mjs";
 import { Activity } from "../kit/activity.mjs";
+import { buildHeap, extractHeap, insertHeap } from "./heap.mjs";
 import { TraceTransport } from "./TraceTransport.mjs";
 import { BinaryTransferCheck } from "./LearningChecks.mjs";
-import { buildHeap, extractHeap, insertHeap } from "./heap.mjs";
 import { HeapDualView } from "./HeapDualView.mjs";
 import { useEffect, useMemo, useState } from "react";
 import { Fragment as Fragment$1, jsx, jsxs } from "react/jsx-runtime";

package/dist/algorithms/ListLab.d.mts

@@ -1,5 +1,4 @@
 import { ListOperation } from "./lists.mjs";
-
 //#region src/algorithms/ListLab.d.ts
 interface ListLabProps {
   values?: number[];
@@ -10,13 +9,6 @@ interface ListLabProps {
   title?: string;
   prompt?: string;
 }
-declare function ListLab({
-  values,
-  operation,
-  argument,
-  predict,
-  title,
-  prompt
-}: ListLabProps): import("react").JSX.Element;
+declare function ListLab({ values, operation, argument, predict, title, prompt }: ListLabProps): import("react").JSX.Element;
 //#endregion
 export { ListLab, ListLabProps };

package/dist/algorithms/ListLab.mjs

@@ -2,8 +2,8 @@
 
 import { AssessedChoiceGroup } from "../kit/controls.mjs";
 import { Activity } from "../kit/activity.mjs";
-import { TraceTransport } from "./TraceTransport.mjs";
 import { OPERATION_LABEL, compareStructures } from "./lists.mjs";
+import { TraceTransport } from "./TraceTransport.mjs";
 import { useEffect, useMemo, useState } from "react";
 import { Fragment as Fragment$1, jsx, jsxs } from "react/jsx-runtime";
 import { Check } from "lucide-react";

package/dist/algorithms/SearchLab.d.mts

@@ -6,12 +6,6 @@ interface SearchLabProps {
   title?: string;
   prompt?: string;
 }
-declare function SearchLab({
-  values,
-  target,
-  predict,
-  title,
-  prompt
-}: SearchLabProps): import("react").JSX.Element;
+declare function SearchLab({ values, target, predict, title, prompt }: SearchLabProps): import("react").JSX.Element;
 //#endregion
 export { SearchLab, SearchLabProps };

package/dist/algorithms/SearchLab.mjs

@@ -2,9 +2,9 @@
 
 import { AssessedChoiceGroup } from "../kit/controls.mjs";
 import { Activity } from "../kit/activity.mjs";
+import { binarySearchTrace } from "./search.mjs";
 import { TraceTransport } from "./TraceTransport.mjs";
 import { BinaryTransferCheck } from "./LearningChecks.mjs";
-import { binarySearchTrace } from "./search.mjs";
 import { useEffect, useMemo, useState } from "react";
 import { Fragment as Fragment$1, jsx, jsxs } from "react/jsx-runtime";
 import { Check } from "lucide-react";

package/dist/algorithms/SortingLab.d.mts

@@ -1,5 +1,4 @@
 import { SortAlgorithm } from "./sorting.mjs";
-
 //#region src/algorithms/SortingLab.d.ts
 interface SortingLabProps {
   values?: number[];
@@ -10,13 +9,6 @@ interface SortingLabProps {
   title?: string;
   prompt?: string;
 }
-declare function SortingLab({
-  values,
-  algorithm,
-  predict,
-  showCosts,
-  title,
-  prompt
-}: SortingLabProps): import("react").JSX.Element;
+declare function SortingLab({ values, algorithm, predict, showCosts, title, prompt }: SortingLabProps): import("react").JSX.Element;
 //#endregion
 export { SortingLab, SortingLabProps };

package/dist/algorithms/SortingLab.mjs

@@ -2,9 +2,9 @@
 
 import { AssessedChoiceGroup } from "../kit/controls.mjs";
 import { Activity } from "../kit/activity.mjs";
+import { SORT_COMPLEXITY, SORT_LABEL, sortCosts, sortTrace } from "./sorting.mjs";
 import { TraceTransport } from "./TraceTransport.mjs";
 import { BinaryTransferCheck } from "./LearningChecks.mjs";
-import { SORT_COMPLEXITY, SORT_LABEL, sortCosts, sortTrace } from "./sorting.mjs";
 import { useEffect, useMemo, useState } from "react";
 import { Fragment as Fragment$1, jsx, jsxs } from "react/jsx-runtime";
 import { Check } from "lucide-react";

package/dist/algorithms/TraceTransport.d.mts

@@ -1,5 +1,4 @@
 import { Dispatch, SetStateAction } from "react";
-
 //#region src/algorithms/TraceTransport.d.ts
 interface TraceTransportProps {
   step: number;
@@ -8,12 +7,6 @@ interface TraceTransportProps {
   setStep: Dispatch<SetStateAction<number>>;
   canAdvance?: boolean;
 }
-declare function TraceTransport({
-  step,
-  count,
-  message,
-  setStep,
-  canAdvance
-}: TraceTransportProps): import("react").JSX.Element;
+declare function TraceTransport({ step, count, message, setStep, canAdvance }: TraceTransportProps): import("react").JSX.Element;
 //#endregion
 export { TraceTransport, TraceTransportProps };

package/dist/algorithms/TraceTransport.mjs

@@ -91,7 +91,6 @@ function TraceTransport({ step, count, message, setStep, canAdvance = true }) {
 				case "_":
 					event.preventDefault();
 					setSpeedIndex((value) => Math.max(0, value - 1));
-					break;
 			}
 		};
 		window.addEventListener("keydown", onKey);

package/dist/algorithms/TreeQuestLab.d.mts

@@ -1,6 +1,5 @@
 import { BinaryTree, TraversalOrder } from "./tree-contract.mjs";
 import { TreeBuildStrategy } from "./tree-builder.mjs";
-
 //#region src/algorithms/TreeQuestLab.d.ts
 interface TreeQuestLabProps {
   operation?: 'traversal' | 'search' | 'insert' | 'avl-insert';
@@ -13,16 +12,6 @@ interface TreeQuestLabProps {
   prompt?: string;
   predict?: boolean;
 }
-declare function TreeQuestLab({
-  operation,
-  order,
-  target,
-  tree,
-  values,
-  strategy,
-  title,
-  prompt,
-  predict
-}: TreeQuestLabProps): import("react").JSX.Element;
+declare function TreeQuestLab({ operation, order, target, tree, values, strategy, title, prompt, predict }: TreeQuestLabProps): import("react").JSX.Element;
 //#endregion
 export { TreeQuestLab, TreeQuestLabProps };

package/dist/algorithms/TreeQuestLab.mjs

@@ -2,12 +2,12 @@
 
 import { AssessedChoiceGroup } from "../kit/controls.mjs";
 import { Activity } from "../kit/activity.mjs";
-import { TraceTransport } from "./TraceTransport.mjs";
-import { BinaryTransferCheck } from "./LearningChecks.mjs";
 import { insertAVL, insertBST, searchBST, traverseTree } from "./tree.mjs";
+import { buildTeachingTree } from "./tree-builder.mjs";
 import { CLASSIC_BST } from "./tree-presets.mjs";
+import { TraceTransport } from "./TraceTransport.mjs";
+import { BinaryTransferCheck } from "./LearningChecks.mjs";
 import { TreeScene } from "./TreeScene.mjs";
-import { buildTeachingTree } from "./tree-builder.mjs";
 import { useEffect, useMemo, useState } from "react";
 import { Fragment as Fragment$1, jsx, jsxs } from "react/jsx-runtime";
 import { Check } from "lucide-react";

package/dist/algorithms/TreeScene.d.mts

@@ -1,5 +1,4 @@
 import { BinaryTree, TreeEvent } from "./tree-contract.mjs";
-
 //#region src/algorithms/TreeScene.d.ts
 interface TreeSceneProps {
   tree: BinaryTree;
@@ -7,11 +6,6 @@ interface TreeSceneProps {
   visited?: ReadonlySet<string>;
   onNodeSelect?: (id: string) => void;
 }
-declare function TreeScene({
-  tree,
-  event,
-  visited,
-  onNodeSelect
-}: TreeSceneProps): import("react").JSX.Element;
+declare function TreeScene({ tree, event, visited, onNodeSelect }: TreeSceneProps): import("react").JSX.Element;
 //#endregion
 export { TreeScene, TreeSceneProps };

package/dist/algorithms/TreeScene.mjs

@@ -7,8 +7,12 @@ import { Button } from "@/components/ui/button";
 import { Maximize2 } from "lucide-react";
 
 //#region src/algorithms/TreeScene.tsx
-const R_HALO = 22, R_FACE = 16, FONT = 10, PAD = 34;
-const READABLE_W = 760, READABLE_H = 620;
+const R_HALO = 22;
+const R_FACE = 16;
+const FONT = 10;
+const PAD = 34;
+const READABLE_W = 760;
+const READABLE_H = 620;
 function TreeScene({ tree, event, visited = /* @__PURE__ */ new Set(), onNodeSelect }) {
 	const positions = layoutBinaryTree(tree);
 	const at = new Map(positions.map((item) => [item.id, item]));
@@ -21,8 +25,8 @@ function TreeScene({ tree, event, visited = /* @__PURE__ */ new Set(), onNodeSel
 	const box = {
 		x: minX - PAD,
 		y: minY - PAD,
-		w: Math.max(1, Math.max(...xs) - minX) + PAD * 2,
-		h: Math.max(1, Math.max(...ys) - minY) + PAD * 2
+		w: Math.max(1, Math.max(...xs) - minX) + 68,
+		h: Math.max(1, Math.max(...ys) - minY) + 68
 	};
 	const large = box.w > READABLE_W || box.h > READABLE_H;
 	const [view, setView] = useState(box);

package/dist/algorithms/core/index.d.mts

@@ -9,4 +9,9 @@ import { TREE_GAP_X, TREE_GAP_Y, layoutBinaryTree } from "../tree-layout.mjs";
 import { insertAVL, insertBST, searchBST, traverseTree } from "../tree.mjs";
 import { TreeBuildStrategy, buildTeachingTree } from "../tree-builder.mjs";
 import { BALANCED_BST, CLASSIC_BST } from "../tree-presets.mjs";
-export { AlgorithmEdge, AlgorithmEvent, AlgorithmGraph, AlgorithmNode, AlgorithmTrace, BALANCED_BST, BinaryTree, BinaryTreeNode, CLASSIC_BST, DPCellEvent, DPTrace, HeapEvent, HeapKind, HeapOperation, HeapTrace, SequenceDecision, SequenceEvent, SequenceItem, TREE_GAP_X, TREE_GAP_Y, TraversalOrder, TreeBuildStrategy, TreeEvent, TreePosition, TreeTrace, bfs, buildHeap, buildTeachingTree, dfs, dijkstra, extractHeap, gridPaths, heapItems, insertAVL, insertBST, insertHeap, isHeap, layoutBinaryTree, normalizeGraph, reconstructPath, searchBST, snapshotItems, traverseTree };
+import { SearchDecision, SearchStep, SearchTrace, binarySearchTrace, linearSearchComparisons, sortedCopy } from "../search.mjs";
+import { HashStep, HashStrategy, HashTrace, hashKey, hashTrace, lookupCost } from "../hashing.mjs";
+import { SORT_ALGORITHMS, SORT_COMPLEXITY, SORT_LABEL, SortAlgorithm, SortTrace, sortCosts, sortTrace } from "../sorting.mjs";
+import { GROWTH_CLASSES, GROWTH_EXAMPLE, GROWTH_NOTATION, GrowthClass, GrowthRow, PRACTICAL_CLASSES, formatOperations, growthAt, intractableAt, operations, timesSlower } from "../growth.mjs";
+import { LIST_OPERATIONS, ListComparison, ListKind, ListOperation, ListRun, ListStep, OPERATION_LABEL, compareStructures, runOperation } from "../lists.mjs";
+export { AlgorithmEdge, AlgorithmEvent, AlgorithmGraph, AlgorithmNode, AlgorithmTrace, BALANCED_BST, BinaryTree, BinaryTreeNode, CLASSIC_BST, DPCellEvent, DPTrace, GROWTH_CLASSES, GROWTH_EXAMPLE, GROWTH_NOTATION, GrowthClass, GrowthRow, HashStep, HashStrategy, HashTrace, HeapEvent, HeapKind, HeapOperation, HeapTrace, LIST_OPERATIONS, ListComparison, ListKind, ListOperation, ListRun, ListStep, OPERATION_LABEL, PRACTICAL_CLASSES, SORT_ALGORITHMS, SORT_COMPLEXITY, SORT_LABEL, SearchDecision, SearchStep, SearchTrace, SequenceDecision, SequenceEvent, SequenceItem, SortAlgorithm, SortTrace, TREE_GAP_X, TREE_GAP_Y, TraversalOrder, TreeBuildStrategy, TreeEvent, TreePosition, TreeTrace, bfs, binarySearchTrace, buildHeap, buildTeachingTree, compareStructures, dfs, dijkstra, extractHeap, formatOperations, gridPaths, growthAt, hashKey, hashTrace, heapItems, insertAVL, insertBST, insertHeap, intractableAt, isHeap, layoutBinaryTree, linearSearchComparisons, lookupCost, normalizeGraph, operations, reconstructPath, runOperation, searchBST, snapshotItems, sortCosts, sortTrace, sortedCopy, timesSlower, traverseTree };

package/dist/algorithms/core/index.mjs

@@ -1,11 +1,16 @@
 import { bfs, dfs, dijkstra, reconstructPath } from "../graph.mjs";
 import { gridPaths } from "../dp.mjs";
 import { normalizeGraph } from "../normalize.mjs";
+import { snapshotItems } from "../sequence-contract.mjs";
+import { buildHeap, extractHeap, heapItems, insertHeap, isHeap } from "../heap.mjs";
 import { TREE_GAP_X, TREE_GAP_Y, layoutBinaryTree } from "../tree-layout.mjs";
 import { insertAVL, insertBST, searchBST, traverseTree } from "../tree.mjs";
-import { BALANCED_BST, CLASSIC_BST } from "../tree-presets.mjs";
 import { buildTeachingTree } from "../tree-builder.mjs";
-import { snapshotItems } from "../sequence-contract.mjs";
-import { buildHeap, extractHeap, heapItems, insertHeap, isHeap } from "../heap.mjs";
+import { BALANCED_BST, CLASSIC_BST } from "../tree-presets.mjs";
+import { binarySearchTrace, linearSearchComparisons, sortedCopy } from "../search.mjs";
+import { hashKey, hashTrace, lookupCost } from "../hashing.mjs";
+import { SORT_ALGORITHMS, SORT_COMPLEXITY, SORT_LABEL, sortCosts, sortTrace } from "../sorting.mjs";
+import { GROWTH_CLASSES, GROWTH_EXAMPLE, GROWTH_NOTATION, PRACTICAL_CLASSES, formatOperations, growthAt, intractableAt, operations, timesSlower } from "../growth.mjs";
+import { LIST_OPERATIONS, OPERATION_LABEL, compareStructures, runOperation } from "../lists.mjs";
 
-export { BALANCED_BST, CLASSIC_BST, TREE_GAP_X, TREE_GAP_Y, bfs, buildHeap, buildTeachingTree, dfs, dijkstra, extractHeap, gridPaths, heapItems, insertAVL, insertBST, insertHeap, isHeap, layoutBinaryTree, normalizeGraph, reconstructPath, searchBST, snapshotItems, traverseTree };
+export { BALANCED_BST, CLASSIC_BST, GROWTH_CLASSES, GROWTH_EXAMPLE, GROWTH_NOTATION, LIST_OPERATIONS, OPERATION_LABEL, PRACTICAL_CLASSES, SORT_ALGORITHMS, SORT_COMPLEXITY, SORT_LABEL, TREE_GAP_X, TREE_GAP_Y, bfs, binarySearchTrace, buildHeap, buildTeachingTree, compareStructures, dfs, dijkstra, extractHeap, formatOperations, gridPaths, growthAt, hashKey, hashTrace, heapItems, insertAVL, insertBST, insertHeap, intractableAt, isHeap, layoutBinaryTree, linearSearchComparisons, lookupCost, normalizeGraph, operations, reconstructPath, runOperation, searchBST, snapshotItems, sortCosts, sortTrace, sortedCopy, timesSlower, traverseTree };

package/dist/algorithms/cost-derivation/core.d.mts

@@ -63,4 +63,4 @@ interface CostReadout {
 }
 declare function readout(mode: CostMode, n: number): CostReadout;
 //#endregion
-export { CostMode, TreeLevel, halvingChain, halvingSteps, readout, recursionLevels, triangleRows, triangleTotal };
+export { CostMode, CostReadout, TreeLevel, halvingChain, halvingSteps, readout, recursionLevels, triangleRows, triangleTotal };

package/dist/algorithms/cost-derivation/core.mjs

@@ -90,4 +90,4 @@ function readout(mode, n) {
 }
 
 //#endregion
-export { halvingChain, halvingSteps, readout, recursionLevels, trianglePairs, triangleRows, triangleTotal };
+export { halvingChain, halvingSteps, readout, recursionLevels, recursionTotal, trianglePairs, triangleRows, triangleTotal };