@densedash/core 0.0.0-stage → 0.1.1

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Anthony Altieri
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/dist/bare.d.ts

@@ -0,0 +1,14 @@
+import { BasePorts, CheckedKernelOptions, Kernel, KernelOptions, Plugin, PortProviders, Ports, ResolvedPorts } from "./kernel.js";
+import { createCommands } from "./commands/index.js";
+import { tradingPreset } from "./commands/trading-preset.js";
+import { Command, CommandContext, CommandId, CommandScopeOptions, Commands, KeyOverrideId, KeyOverrides, KeymapEntry, KeysOptions, PendingConfirm, Preset, Register, ValidatedKeyOverrides } from "./commands/types.js";
+import { ClockPort } from "./ports/clock.js";
+import { KeyboardBinding, KeyboardBindingOptions, KeyboardHandler, KeyboardHotkey, KeyboardHotkeyChord, KeyboardParseResult, KeyboardPendingStore, KeyboardPlatform, KeyboardPort, KeyboardScopeOptions, KeyboardTarget, PendingKeyboardSequence } from "./ports/keyboard.js";
+import { ReporterPort } from "./ports/reporter.js";
+import { Store, StorePort } from "./ports/store.js";
+import { Task } from "./task.js";
+import { ChangeDetails, Controllable } from "./controllable.js";
+/** No defaults: every port must be supplied by plugins or explicit ports. */
+export declare function createKernel<const Options extends KernelOptions = KernelOptions>(options?: Options & CheckedKernelOptions<Options>): Kernel<ResolvedPorts<Options>>;
+export { type BasePorts, type ChangeDetails, type ClockPort, type Command, type CommandContext, type CommandId, type CommandScopeOptions, type Commands, type Controllable, type Kernel, type KernelOptions, type KeyOverrideId, type KeyOverrides, type KeyboardBinding, type KeyboardBindingOptions, type KeyboardHandler, type KeyboardHotkey, type KeyboardHotkeyChord, type KeyboardParseResult, type KeyboardPendingStore, type KeyboardPlatform, type KeyboardPort, type KeyboardScopeOptions, type KeyboardTarget, type KeymapEntry, type KeysOptions, type PendingConfirm, type PendingKeyboardSequence, type Plugin, type PortProviders, type Ports, type Preset, type Register, type ReporterPort, type ResolvedPorts, type Store, type StorePort, type Task, type ValidatedKeyOverrides, createCommands, tradingPreset };
+//# sourceMappingURL=bare.d.ts.map

package/dist/bare.js

@@ -0,0 +1,11 @@
+import { tradingPreset } from "./commands/trading-preset.js";
+import { resolveKernel } from "./kernel.js";
+import { createCommands } from "./commands/index.js";
+// src/bare.ts
+/** No defaults: every port must be supplied by plugins or explicit ports. */
+function createKernel(options) {
+	return resolveKernel({ options: options ?? {} });
+}
+export { createCommands, createKernel, tradingPreset };
+
+//# sourceMappingURL=bare.js.map

package/dist/bare.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bare.js","names":[],"sources":["../src/bare.ts"],"sourcesContent":["import { resolveKernel } from \"./kernel.js\";\nimport type { CheckedKernelOptions, Kernel, KernelOptions, ResolvedPorts } from \"./kernel.js\";\n\nexport type {\n  BasePorts,\n  Kernel,\n  KernelOptions,\n  Plugin,\n  PortProviders,\n  Ports,\n  ResolvedPorts,\n} from \"./kernel.js\";\nexport * from \"./commands/index.js\";\nexport type { ClockPort } from \"./ports/clock.js\";\nexport type {\n  KeyboardPort,\n  KeyboardHotkey,\n  KeyboardHotkeyChord,\n  KeyboardPlatform,\n  KeyboardTarget,\n  KeyboardHandler,\n  KeyboardParseResult,\n  KeyboardScopeOptions,\n  KeyboardBindingOptions,\n  KeyboardBinding,\n  PendingKeyboardSequence,\n  KeyboardPendingStore,\n} from \"./ports/keyboard.js\";\nexport type { ReporterPort } from \"./ports/reporter.js\";\nexport type { Store, StorePort } from \"./ports/store.js\";\nexport type { Task } from \"./task.js\";\nexport type { ChangeDetails, Controllable } from \"./controllable.js\";\n\n/** No defaults: every port must be supplied by plugins or explicit ports. */\nexport function createKernel<const Options extends KernelOptions = KernelOptions>(\n  options?: Options & CheckedKernelOptions<Options>,\n): Kernel<ResolvedPorts<Options>> {\n  // The resolver applies the same precedence encoded by ResolvedPorts.\n  return resolveKernel({ options: options ?? {} }) as Kernel<ResolvedPorts<Options>>;\n}\n"],"mappings":";;;;;AAkCA,SAAgB,aACd,SACgC;CAEhC,OAAO,cAAc,EAAE,SAAS,WAAW,CAAC,EAAE,CAAC;AACjD"}

package/dist/collections/flatten.d.ts

@@ -0,0 +1,8 @@
+import { Key, TreeRow, TreeSource } from "./types.js";
+/**
+ * Visible preorder rows. Index/depth are zero-based; sibling positions are one-based.
+ * Validate the entire source, including collapsed branches, in O(total items).
+ * Duplicate keys and ancestor cycles throw in every environment, naming the key.
+ */
+export declare function flatten<T>(source: TreeSource<T>, expanded: ReadonlySet<Key>): TreeRow<T>[];
+//# sourceMappingURL=flatten.d.ts.map

package/dist/collections/flatten.js

@@ -0,0 +1,59 @@
+// src/collections/flatten.ts
+/**
+* Visible preorder rows. Index/depth are zero-based; sibling positions are one-based.
+* Validate the entire source, including collapsed branches, in O(total items).
+* Duplicate keys and ancestor cycles throw in every environment, naming the key.
+*/
+function flatten(source, expanded) {
+	const rows = [];
+	const seen = /* @__PURE__ */ new Set();
+	const ancestors = /* @__PURE__ */ new Set();
+	const stack = [{
+		items: source.roots,
+		offset: 0,
+		parentKey: null,
+		visible: true
+	}];
+	while (stack.length > 0) {
+		const frame = stack[stack.length - 1];
+		if (frame.offset === frame.items.length) {
+			if (frame.parentKey !== null) ancestors.delete(frame.parentKey);
+			stack.pop();
+			continue;
+		}
+		const item = frame.items[frame.offset++];
+		const key = source.getKey(item);
+		if (ancestors.has(key)) throw new Error(`Collection cycle at key "${key}".`);
+		if (seen.has(key)) throw new Error(`Duplicate collection key "${key}".`);
+		seen.add(key);
+		const children = source.getChildren?.(item);
+		const hasChildren = children !== void 0 && children.length > 0;
+		const isExpanded = hasChildren && expanded.has(key);
+		if (frame.visible) rows.push({
+			key,
+			item,
+			index: rows.length,
+			depth: stack.length - 1,
+			parentKey: frame.parentKey,
+			hasChildren,
+			expanded: isExpanded,
+			posInSet: frame.offset,
+			setSize: frame.items.length,
+			disabled: source.isDisabled?.(item) ?? false,
+			textValue: source.getTextValue?.(item) ?? key
+		});
+		if (children !== void 0 && hasChildren) {
+			ancestors.add(key);
+			stack.push({
+				items: children,
+				offset: 0,
+				parentKey: key,
+				visible: frame.visible && isExpanded
+			});
+		}
+	}
+	return rows;
+}
+export { flatten };
+
+//# sourceMappingURL=flatten.js.map

package/dist/collections/flatten.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"flatten.js","names":[],"sources":["../../src/collections/flatten.ts"],"sourcesContent":["import type { Key, TreeRow, TreeSource } from \"./types.js\";\n\ninterface Frame<T> {\n  items: readonly T[];\n  offset: number;\n  parentKey: Key | null;\n  visible: boolean;\n}\n\n/**\n * Visible preorder rows. Index/depth are zero-based; sibling positions are one-based.\n * Validate the entire source, including collapsed branches, in O(total items).\n * Duplicate keys and ancestor cycles throw in every environment, naming the key.\n */\nexport function flatten<T>(source: TreeSource<T>, expanded: ReadonlySet<Key>): TreeRow<T>[] {\n  const rows: TreeRow<T>[] = [];\n  const seen = new Set<Key>();\n  const ancestors = new Set<Key>();\n  const stack: Frame<T>[] = [{ items: source.roots, offset: 0, parentKey: null, visible: true }];\n\n  while (stack.length > 0) {\n    const frame = stack[stack.length - 1]!;\n    if (frame.offset === frame.items.length) {\n      if (frame.parentKey !== null) ancestors.delete(frame.parentKey);\n      stack.pop();\n      continue;\n    }\n\n    const item = frame.items[frame.offset++]!;\n    const key = source.getKey(item);\n    if (ancestors.has(key)) throw new Error(`Collection cycle at key \"${key}\".`);\n    if (seen.has(key)) throw new Error(`Duplicate collection key \"${key}\".`);\n    seen.add(key);\n\n    const children = source.getChildren?.(item);\n    const hasChildren = children !== undefined && children.length > 0;\n    const isExpanded = hasChildren && expanded.has(key);\n    if (frame.visible) {\n      rows.push({\n        key,\n        item,\n        index: rows.length,\n        depth: stack.length - 1,\n        parentKey: frame.parentKey,\n        hasChildren,\n        expanded: isExpanded,\n        posInSet: frame.offset,\n        setSize: frame.items.length,\n        disabled: source.isDisabled?.(item) ?? false,\n        textValue: source.getTextValue?.(item) ?? key,\n      });\n    }\n\n    if (children !== undefined && hasChildren) {\n      ancestors.add(key);\n      stack.push({\n        items: children,\n        offset: 0,\n        parentKey: key,\n        visible: frame.visible && isExpanded,\n      });\n    }\n  }\n\n  return rows;\n}\n"],"mappings":";;;;;;AAcA,SAAgB,QAAW,QAAuB,UAA0C;CAC1F,MAAM,OAAqB,CAAC;CAC5B,MAAM,uBAAO,IAAI,IAAS;CAC1B,MAAM,4BAAY,IAAI,IAAS;CAC/B,MAAM,QAAoB,CAAC;EAAE,OAAO,OAAO;EAAO,QAAQ;EAAG,WAAW;EAAM,SAAS;CAAK,CAAC;CAE7F,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,QAAQ,MAAM,MAAM,SAAS;EACnC,IAAI,MAAM,WAAW,MAAM,MAAM,QAAQ;GACvC,IAAI,MAAM,cAAc,MAAM,UAAU,OAAO,MAAM,SAAS;GAC9D,MAAM,IAAI;GACV;EACF;EAEA,MAAM,OAAO,MAAM,MAAM,MAAM;EAC/B,MAAM,MAAM,OAAO,OAAO,IAAI;EAC9B,IAAI,UAAU,IAAI,GAAG,GAAG,MAAM,IAAI,MAAM,4BAA4B,IAAI,GAAG;EAC3E,IAAI,KAAK,IAAI,GAAG,GAAG,MAAM,IAAI,MAAM,6BAA6B,IAAI,GAAG;EACvE,KAAK,IAAI,GAAG;EAEZ,MAAM,WAAW,OAAO,cAAc,IAAI;EAC1C,MAAM,cAAc,aAAa,KAAA,KAAa,SAAS,SAAS;EAChE,MAAM,aAAa,eAAe,SAAS,IAAI,GAAG;EAClD,IAAI,MAAM,SACR,KAAK,KAAK;GACR;GACA;GACA,OAAO,KAAK;GACZ,OAAO,MAAM,SAAS;GACtB,WAAW,MAAM;GACjB;GACA,UAAU;GACV,UAAU,MAAM;GAChB,SAAS,MAAM,MAAM;GACrB,UAAU,OAAO,aAAa,IAAI,KAAK;GACvC,WAAW,OAAO,eAAe,IAAI,KAAK;EAC5C,CAAC;EAGH,IAAI,aAAa,KAAA,KAAa,aAAa;GACzC,UAAU,IAAI,GAAG;GACjB,MAAM,KAAK;IACT,OAAO;IACP,QAAQ;IACR,WAAW;IACX,SAAS,MAAM,WAAW;GAC5B,CAAC;EACH;CACF;CAEA,OAAO;AACT"}

package/dist/collections/move.d.ts

@@ -0,0 +1,7 @@
+import { Key, Move, MoveOptions, TreeRow } from "./types.js";
+/**
+ * Return a key; never mutate rows or state. No target leaves the current enabled
+ * key in place (or null). Counts and pages count enabled rows. Empty rows return null.
+ */
+export declare function move<T>(rows: readonly TreeRow<T>[], from: Key | null, movement: Move, { loop }?: MoveOptions): Key | null;
+//# sourceMappingURL=move.d.ts.map

package/dist/collections/move.js

@@ -0,0 +1,74 @@
+// src/collections/move.ts
+/** Move by enabled rows without iterating count times, even for huge counts. */
+function step(rows, fromIndex, count, direction, loop) {
+	if (!Number.isSafeInteger(count) || count < 0) throw new RangeError("Collection move count/size must be a non-negative safe integer.");
+	const keys = [];
+	let before = 0;
+	let current = -1;
+	for (let index = 0; index < rows.length; index++) {
+		const row = rows[index];
+		if (row.disabled) continue;
+		if (index < fromIndex) before++;
+		if (index === fromIndex) current = keys.length;
+		keys.push(row.key);
+	}
+	if (keys.length === 0) return null;
+	if (count === 0) return current < 0 ? null : keys[current];
+	let start = current;
+	if (current < 0) start = fromIndex < 0 ? direction === 1 ? -1 : keys.length : direction === 1 ? before - 1 : before;
+	const distance = loop ? count % keys.length : Math.min(count, keys.length);
+	const target = start + direction * distance;
+	return keys[loop ? (target % keys.length + keys.length) % keys.length : Math.max(0, Math.min(keys.length - 1, target))];
+}
+/**
+* Return a key; never mutate rows or state. No target leaves the current enabled
+* key in place (or null). Counts and pages count enabled rows. Empty rows return null.
+*/
+function move(rows, from, movement, { loop = false } = {}) {
+	const fromIndex = from === null ? -1 : rows.findIndex((row) => row.key === from);
+	const current = rows[fromIndex];
+	const unchanged = current && !current.disabled ? current.key : null;
+	switch (movement.type) {
+		case "next":
+		case "prev": return step(rows, fromIndex, movement.count ?? 1, movement.type === "next" ? 1 : -1, loop);
+		case "page": return step(rows, fromIndex, movement.size, movement.direction, loop);
+		case "first": return rows.find((row) => !row.disabled)?.key ?? null;
+		case "last":
+			for (let index = rows.length - 1; index >= 0; index--) {
+				const row = rows[index];
+				if (!row.disabled) return row.key;
+			}
+			return null;
+		case "parent": {
+			let parentKey = current?.parentKey;
+			for (let index = fromIndex - 1; index >= 0 && parentKey != null; index--) {
+				const row = rows[index];
+				if (row.key !== parentKey) continue;
+				if (!row.disabled) return row.key;
+				parentKey = row.parentKey;
+			}
+			return unchanged;
+		}
+		case "firstChild":
+			if (!current) return null;
+			for (let index = fromIndex + 1; index < rows.length; index++) {
+				const row = rows[index];
+				if (row.depth <= current.depth) break;
+				if (row.parentKey === current.key && !row.disabled) return row.key;
+			}
+			return unchanged;
+		case "typeahead": {
+			const text = movement.text.toLowerCase();
+			if (text.length === 0) return unchanged;
+			const end = loop ? rows.length + fromIndex + 1 : rows.length;
+			for (let index = fromIndex + 1; index < end; index++) {
+				const row = rows[index % rows.length];
+				if (!row.disabled && row.textValue.toLowerCase().startsWith(text)) return row.key;
+			}
+			return unchanged;
+		}
+	}
+}
+export { move };
+
+//# sourceMappingURL=move.js.map

package/dist/collections/move.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"move.js","names":[],"sources":["../../src/collections/move.ts"],"sourcesContent":["import type { Key, Move, MoveOptions, TreeRow } from \"./types.js\";\n\n/** Move by enabled rows without iterating count times, even for huge counts. */\nfunction step<T>(\n  rows: readonly TreeRow<T>[],\n  fromIndex: number,\n  count: number,\n  direction: 1 | -1,\n  loop: boolean,\n): Key | null {\n  if (!Number.isSafeInteger(count) || count < 0) {\n    throw new RangeError(\"Collection move count/size must be a non-negative safe integer.\");\n  }\n\n  const keys: Key[] = [];\n  let before = 0;\n  let current = -1;\n  for (let index = 0; index < rows.length; index++) {\n    const row = rows[index]!;\n    if (row.disabled) continue;\n    if (index < fromIndex) before++;\n    if (index === fromIndex) current = keys.length;\n    keys.push(row.key);\n  }\n  if (keys.length === 0) return null;\n  if (count === 0) return current < 0 ? null : keys[current]!;\n\n  let start = current;\n  if (current < 0) {\n    start =\n      fromIndex < 0 ? (direction === 1 ? -1 : keys.length) : direction === 1 ? before - 1 : before;\n  }\n  // Reduce before addition so even MAX_SAFE_INTEGER stays arithmetically exact.\n  const distance = loop ? count % keys.length : Math.min(count, keys.length);\n  const target = start + direction * distance;\n  const bounded = loop\n    ? ((target % keys.length) + keys.length) % keys.length\n    : Math.max(0, Math.min(keys.length - 1, target));\n  return keys[bounded]!;\n}\n\n/**\n * Return a key; never mutate rows or state. No target leaves the current enabled\n * key in place (or null). Counts and pages count enabled rows. Empty rows return null.\n */\nexport function move<T>(\n  rows: readonly TreeRow<T>[],\n  from: Key | null,\n  movement: Move,\n  { loop = false }: MoveOptions = {},\n): Key | null {\n  const fromIndex = from === null ? -1 : rows.findIndex((row) => row.key === from);\n  const current = rows[fromIndex];\n  const unchanged = current && !current.disabled ? current.key : null;\n\n  switch (movement.type) {\n    case \"next\":\n    case \"prev\":\n      return step(rows, fromIndex, movement.count ?? 1, movement.type === \"next\" ? 1 : -1, loop);\n    case \"page\":\n      return step(rows, fromIndex, movement.size, movement.direction, loop);\n    case \"first\":\n      return rows.find((row) => !row.disabled)?.key ?? null;\n    case \"last\":\n      for (let index = rows.length - 1; index >= 0; index--) {\n        const row = rows[index]!;\n        if (!row.disabled) return row.key;\n      }\n      return null;\n    case \"parent\": {\n      let parentKey = current?.parentKey;\n      for (let index = fromIndex - 1; index >= 0 && parentKey != null; index--) {\n        const row = rows[index]!;\n        if (row.key !== parentKey) continue;\n        if (!row.disabled) return row.key;\n        parentKey = row.parentKey;\n      }\n      return unchanged;\n    }\n    case \"firstChild\":\n      if (!current) return null;\n      for (let index = fromIndex + 1; index < rows.length; index++) {\n        const row = rows[index]!;\n        if (row.depth <= current.depth) break;\n        if (row.parentKey === current.key && !row.disabled) return row.key;\n      }\n      return unchanged;\n    case \"typeahead\": {\n      const text = movement.text.toLowerCase();\n      if (text.length === 0) return unchanged;\n      const end = loop ? rows.length + fromIndex + 1 : rows.length;\n      for (let index = fromIndex + 1; index < end; index++) {\n        const row = rows[index % rows.length]!;\n        if (!row.disabled && row.textValue.toLowerCase().startsWith(text)) return row.key;\n      }\n      return unchanged;\n    }\n  }\n}\n"],"mappings":";;AAGA,SAAS,KACP,MACA,WACA,OACA,WACA,MACY;CACZ,IAAI,CAAC,OAAO,cAAc,KAAK,KAAK,QAAQ,GAC1C,MAAM,IAAI,WAAW,iEAAiE;CAGxF,MAAM,OAAc,CAAC;CACrB,IAAI,SAAS;CACb,IAAI,UAAU;CACd,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,QAAQ,SAAS;EAChD,MAAM,MAAM,KAAK;EACjB,IAAI,IAAI,UAAU;EAClB,IAAI,QAAQ,WAAW;EACvB,IAAI,UAAU,WAAW,UAAU,KAAK;EACxC,KAAK,KAAK,IAAI,GAAG;CACnB;CACA,IAAI,KAAK,WAAW,GAAG,OAAO;CAC9B,IAAI,UAAU,GAAG,OAAO,UAAU,IAAI,OAAO,KAAK;CAElD,IAAI,QAAQ;CACZ,IAAI,UAAU,GACZ,QACE,YAAY,IAAK,cAAc,IAAI,KAAK,KAAK,SAAU,cAAc,IAAI,SAAS,IAAI;CAG1F,MAAM,WAAW,OAAO,QAAQ,KAAK,SAAS,KAAK,IAAI,OAAO,KAAK,MAAM;CACzE,MAAM,SAAS,QAAQ,YAAY;CAInC,OAAO,KAHS,QACV,SAAS,KAAK,SAAU,KAAK,UAAU,KAAK,SAC9C,KAAK,IAAI,GAAG,KAAK,IAAI,KAAK,SAAS,GAAG,MAAM,CAAC;AAEnD;;;;;AAMA,SAAgB,KACd,MACA,MACA,UACA,EAAE,OAAO,UAAuB,CAAC,GACrB;CACZ,MAAM,YAAY,SAAS,OAAO,KAAK,KAAK,WAAW,QAAQ,IAAI,QAAQ,IAAI;CAC/E,MAAM,UAAU,KAAK;CACrB,MAAM,YAAY,WAAW,CAAC,QAAQ,WAAW,QAAQ,MAAM;CAE/D,QAAQ,SAAS,MAAjB;EACE,KAAK;EACL,KAAK,QACH,OAAO,KAAK,MAAM,WAAW,SAAS,SAAS,GAAG,SAAS,SAAS,SAAS,IAAI,IAAI,IAAI;EAC3F,KAAK,QACH,OAAO,KAAK,MAAM,WAAW,SAAS,MAAM,SAAS,WAAW,IAAI;EACtE,KAAK,SACH,OAAO,KAAK,MAAM,QAAQ,CAAC,IAAI,QAAQ,CAAC,EAAE,OAAO;EACnD,KAAK;GACH,KAAK,IAAI,QAAQ,KAAK,SAAS,GAAG,SAAS,GAAG,SAAS;IACrD,MAAM,MAAM,KAAK;IACjB,IAAI,CAAC,IAAI,UAAU,OAAO,IAAI;GAChC;GACA,OAAO;EACT,KAAK,UAAU;GACb,IAAI,YAAY,SAAS;GACzB,KAAK,IAAI,QAAQ,YAAY,GAAG,SAAS,KAAK,aAAa,MAAM,SAAS;IACxE,MAAM,MAAM,KAAK;IACjB,IAAI,IAAI,QAAQ,WAAW;IAC3B,IAAI,CAAC,IAAI,UAAU,OAAO,IAAI;IAC9B,YAAY,IAAI;GAClB;GACA,OAAO;EACT;EACA,KAAK;GACH,IAAI,CAAC,SAAS,OAAO;GACrB,KAAK,IAAI,QAAQ,YAAY,GAAG,QAAQ,KAAK,QAAQ,SAAS;IAC5D,MAAM,MAAM,KAAK;IACjB,IAAI,IAAI,SAAS,QAAQ,OAAO;IAChC,IAAI,IAAI,cAAc,QAAQ,OAAO,CAAC,IAAI,UAAU,OAAO,IAAI;GACjE;GACA,OAAO;EACT,KAAK,aAAa;GAChB,MAAM,OAAO,SAAS,KAAK,YAAY;GACvC,IAAI,KAAK,WAAW,GAAG,OAAO;GAC9B,MAAM,MAAM,OAAO,KAAK,SAAS,YAAY,IAAI,KAAK;GACtD,KAAK,IAAI,QAAQ,YAAY,GAAG,QAAQ,KAAK,SAAS;IACpD,MAAM,MAAM,KAAK,QAAQ,KAAK;IAC9B,IAAI,CAAC,IAAI,YAAY,IAAI,UAAU,YAAY,CAAC,CAAC,WAAW,IAAI,GAAG,OAAO,IAAI;GAChF;GACA,OAAO;EACT;CACF;AACF"}

package/dist/collections/reconcile.d.ts

@@ -0,0 +1,9 @@
+import { TreeRow, TreeState } from "./types.js";
+/**
+ * Reconcile against supplied visible rows in O(prev + next + selected).
+ * Keep a live enabled cursor by key. Otherwise prefer the nearest enabled survivor
+ * in the old order (following wins ties), then the first enabled new row.
+ * Prune invisible selection/anchor; retain expansion for hidden descendants.
+ */
+export declare function reconcile<T>(prev: readonly TreeRow<T>[], next: readonly TreeRow<T>[], state: TreeState): TreeState;
+//# sourceMappingURL=reconcile.d.ts.map

package/dist/collections/reconcile.js

@@ -0,0 +1,44 @@
+// src/collections/reconcile.ts
+/**
+* Reconcile against supplied visible rows in O(prev + next + selected).
+* Keep a live enabled cursor by key. Otherwise prefer the nearest enabled survivor
+* in the old order (following wins ties), then the first enabled new row.
+* Prune invisible selection/anchor; retain expansion for hidden descendants.
+*/
+function reconcile(prev, next, state) {
+	const existing = /* @__PURE__ */ new Set();
+	const enabled = /* @__PURE__ */ new Set();
+	for (const row of next) {
+		existing.add(row.key);
+		if (!row.disabled) enabled.add(row.key);
+	}
+	let highlighted = state.highlighted;
+	if (highlighted !== null && !enabled.has(highlighted)) {
+		const previousIndex = prev.findIndex((row) => row.key === highlighted);
+		highlighted = null;
+		if (previousIndex >= 0) for (let distance = 1; distance < prev.length; distance++) {
+			const following = prev[previousIndex + distance];
+			const preceding = prev[previousIndex - distance];
+			if (following && enabled.has(following.key)) {
+				highlighted = following.key;
+				break;
+			}
+			if (preceding && enabled.has(preceding.key)) {
+				highlighted = preceding.key;
+				break;
+			}
+		}
+		highlighted ??= next.find((row) => !row.disabled)?.key ?? null;
+	}
+	const selected = /* @__PURE__ */ new Set();
+	for (const key of state.selected) if (existing.has(key)) selected.add(key);
+	return {
+		highlighted,
+		selected,
+		anchor: state.anchor !== null && existing.has(state.anchor) ? state.anchor : null,
+		expanded: state.expanded
+	};
+}
+export { reconcile };
+
+//# sourceMappingURL=reconcile.js.map

package/dist/collections/reconcile.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reconcile.js","names":[],"sources":["../../src/collections/reconcile.ts"],"sourcesContent":["import type { Key, TreeRow, TreeState } from \"./types.js\";\n\n/**\n * Reconcile against supplied visible rows in O(prev + next + selected).\n * Keep a live enabled cursor by key. Otherwise prefer the nearest enabled survivor\n * in the old order (following wins ties), then the first enabled new row.\n * Prune invisible selection/anchor; retain expansion for hidden descendants.\n */\nexport function reconcile<T>(\n  prev: readonly TreeRow<T>[],\n  next: readonly TreeRow<T>[],\n  state: TreeState,\n): TreeState {\n  const existing = new Set<Key>();\n  const enabled = new Set<Key>();\n  for (const row of next) {\n    existing.add(row.key);\n    if (!row.disabled) enabled.add(row.key);\n  }\n\n  let highlighted = state.highlighted;\n  if (highlighted !== null && !enabled.has(highlighted)) {\n    const previousIndex = prev.findIndex((row) => row.key === highlighted);\n    highlighted = null;\n    if (previousIndex >= 0) {\n      for (let distance = 1; distance < prev.length; distance++) {\n        const following = prev[previousIndex + distance];\n        const preceding = prev[previousIndex - distance];\n        if (following && enabled.has(following.key)) {\n          highlighted = following.key;\n          break;\n        }\n        if (preceding && enabled.has(preceding.key)) {\n          highlighted = preceding.key;\n          break;\n        }\n      }\n    }\n    highlighted ??= next.find((row) => !row.disabled)?.key ?? null;\n  }\n\n  const selected = new Set<Key>();\n  for (const key of state.selected) {\n    if (existing.has(key)) selected.add(key);\n  }\n\n  return {\n    highlighted,\n    selected,\n    anchor: state.anchor !== null && existing.has(state.anchor) ? state.anchor : null,\n    expanded: state.expanded,\n  };\n}\n"],"mappings":";;;;;;;AAQA,SAAgB,UACd,MACA,MACA,OACW;CACX,MAAM,2BAAW,IAAI,IAAS;CAC9B,MAAM,0BAAU,IAAI,IAAS;CAC7B,KAAK,MAAM,OAAO,MAAM;EACtB,SAAS,IAAI,IAAI,GAAG;EACpB,IAAI,CAAC,IAAI,UAAU,QAAQ,IAAI,IAAI,GAAG;CACxC;CAEA,IAAI,cAAc,MAAM;CACxB,IAAI,gBAAgB,QAAQ,CAAC,QAAQ,IAAI,WAAW,GAAG;EACrD,MAAM,gBAAgB,KAAK,WAAW,QAAQ,IAAI,QAAQ,WAAW;EACrE,cAAc;EACd,IAAI,iBAAiB,GACnB,KAAK,IAAI,WAAW,GAAG,WAAW,KAAK,QAAQ,YAAY;GACzD,MAAM,YAAY,KAAK,gBAAgB;GACvC,MAAM,YAAY,KAAK,gBAAgB;GACvC,IAAI,aAAa,QAAQ,IAAI,UAAU,GAAG,GAAG;IAC3C,cAAc,UAAU;IACxB;GACF;GACA,IAAI,aAAa,QAAQ,IAAI,UAAU,GAAG,GAAG;IAC3C,cAAc,UAAU;IACxB;GACF;EACF;EAEF,gBAAgB,KAAK,MAAM,QAAQ,CAAC,IAAI,QAAQ,CAAC,EAAE,OAAO;CAC5D;CAEA,MAAM,2BAAW,IAAI,IAAS;CAC9B,KAAK,MAAM,OAAO,MAAM,UACtB,IAAI,SAAS,IAAI,GAAG,GAAG,SAAS,IAAI,GAAG;CAGzC,OAAO;EACL;EACA;EACA,QAAQ,MAAM,WAAW,QAAQ,SAAS,IAAI,MAAM,MAAM,IAAI,MAAM,SAAS;EAC7E,UAAU,MAAM;CAClB;AACF"}

package/dist/collections/selection.d.ts

@@ -0,0 +1,12 @@
+import { Key, TreeRow } from "./types.js";
+/** Toggle a visible enabled key, preserving the caller's selected set. */
+export declare function toggleSelection<T>(rows: readonly TreeRow<T>[], selected: ReadonlySet<Key>, key: Key): ReadonlySet<Key>;
+/**
+ * Replace selection with an inclusive visible range, excluding disabled rows.
+ * A missing anchor selects only the target; a missing target yields an empty set.
+ */
+export declare function selectRange<T>(rows: readonly TreeRow<T>[], anchor: Key | null, to: Key): ReadonlySet<Key>;
+/** Select every visible enabled row. */
+export declare function selectAll<T>(rows: readonly TreeRow<T>[]): ReadonlySet<Key>;
+export declare function clearSelection(): ReadonlySet<Key>;
+//# sourceMappingURL=selection.d.ts.map

package/dist/collections/selection.js

@@ -0,0 +1,39 @@
+// src/collections/selection.ts
+/** Toggle a visible enabled key, preserving the caller's selected set. */
+function toggleSelection(rows, selected, key) {
+	const row = rows.find((candidate) => candidate.key === key);
+	if (!row || row.disabled) return selected;
+	const next = new Set(selected);
+	if (next.has(key)) next.delete(key);
+	else next.add(key);
+	return next;
+}
+/**
+* Replace selection with an inclusive visible range, excluding disabled rows.
+* A missing anchor selects only the target; a missing target yields an empty set.
+*/
+function selectRange(rows, anchor, to) {
+	const targetIndex = rows.findIndex((row) => row.key === to);
+	const selected = /* @__PURE__ */ new Set();
+	if (targetIndex < 0) return selected;
+	const anchorIndex = anchor === null ? -1 : rows.findIndex((row) => row.key === anchor);
+	const start = anchorIndex < 0 ? targetIndex : Math.min(anchorIndex, targetIndex);
+	const end = Math.max(anchorIndex, targetIndex);
+	for (let index = start; index <= end; index++) {
+		const row = rows[index];
+		if (!row.disabled) selected.add(row.key);
+	}
+	return selected;
+}
+/** Select every visible enabled row. */
+function selectAll(rows) {
+	const selected = /* @__PURE__ */ new Set();
+	for (const row of rows) if (!row.disabled) selected.add(row.key);
+	return selected;
+}
+function clearSelection() {
+	return /* @__PURE__ */ new Set();
+}
+export { clearSelection, selectAll, selectRange, toggleSelection };
+
+//# sourceMappingURL=selection.js.map

package/dist/collections/selection.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"selection.js","names":[],"sources":["../../src/collections/selection.ts"],"sourcesContent":["import type { Key, TreeRow } from \"./types.js\";\n\n/** Toggle a visible enabled key, preserving the caller's selected set. */\nexport function toggleSelection<T>(\n  rows: readonly TreeRow<T>[],\n  selected: ReadonlySet<Key>,\n  key: Key,\n): ReadonlySet<Key> {\n  const row = rows.find((candidate) => candidate.key === key);\n  if (!row || row.disabled) return selected;\n  const next = new Set(selected);\n  if (next.has(key)) next.delete(key);\n  else next.add(key);\n  return next;\n}\n\n/**\n * Replace selection with an inclusive visible range, excluding disabled rows.\n * A missing anchor selects only the target; a missing target yields an empty set.\n */\nexport function selectRange<T>(\n  rows: readonly TreeRow<T>[],\n  anchor: Key | null,\n  to: Key,\n): ReadonlySet<Key> {\n  const targetIndex = rows.findIndex((row) => row.key === to);\n  const selected = new Set<Key>();\n  if (targetIndex < 0) return selected;\n  const anchorIndex = anchor === null ? -1 : rows.findIndex((row) => row.key === anchor);\n  const start = anchorIndex < 0 ? targetIndex : Math.min(anchorIndex, targetIndex);\n  const end = Math.max(anchorIndex, targetIndex);\n  for (let index = start; index <= end; index++) {\n    const row = rows[index]!;\n    if (!row.disabled) selected.add(row.key);\n  }\n  return selected;\n}\n\n/** Select every visible enabled row. */\nexport function selectAll<T>(rows: readonly TreeRow<T>[]): ReadonlySet<Key> {\n  const selected = new Set<Key>();\n  for (const row of rows) {\n    if (!row.disabled) selected.add(row.key);\n  }\n  return selected;\n}\n\nexport function clearSelection(): ReadonlySet<Key> {\n  return new Set<Key>();\n}\n"],"mappings":";;AAGA,SAAgB,gBACd,MACA,UACA,KACkB;CAClB,MAAM,MAAM,KAAK,MAAM,cAAc,UAAU,QAAQ,GAAG;CAC1D,IAAI,CAAC,OAAO,IAAI,UAAU,OAAO;CACjC,MAAM,OAAO,IAAI,IAAI,QAAQ;CAC7B,IAAI,KAAK,IAAI,GAAG,GAAG,KAAK,OAAO,GAAG;MAC7B,KAAK,IAAI,GAAG;CACjB,OAAO;AACT;;;;;AAMA,SAAgB,YACd,MACA,QACA,IACkB;CAClB,MAAM,cAAc,KAAK,WAAW,QAAQ,IAAI,QAAQ,EAAE;CAC1D,MAAM,2BAAW,IAAI,IAAS;CAC9B,IAAI,cAAc,GAAG,OAAO;CAC5B,MAAM,cAAc,WAAW,OAAO,KAAK,KAAK,WAAW,QAAQ,IAAI,QAAQ,MAAM;CACrF,MAAM,QAAQ,cAAc,IAAI,cAAc,KAAK,IAAI,aAAa,WAAW;CAC/E,MAAM,MAAM,KAAK,IAAI,aAAa,WAAW;CAC7C,KAAK,IAAI,QAAQ,OAAO,SAAS,KAAK,SAAS;EAC7C,MAAM,MAAM,KAAK;EACjB,IAAI,CAAC,IAAI,UAAU,SAAS,IAAI,IAAI,GAAG;CACzC;CACA,OAAO;AACT;;AAGA,SAAgB,UAAa,MAA+C;CAC1E,MAAM,2BAAW,IAAI,IAAS;CAC9B,KAAK,MAAM,OAAO,MAChB,IAAI,CAAC,IAAI,UAAU,SAAS,IAAI,IAAI,GAAG;CAEzC,OAAO;AACT;AAEA,SAAgB,iBAAmC;CACjD,uBAAO,IAAI,IAAS;AACtB"}

package/dist/collections/types.d.ts

@@ -0,0 +1,48 @@
+export type Key = string;
+/** Callbacks must be synchronous and stable for the duration of a call. */
+export interface TreeSource<T> {
+  roots: readonly T[];
+  getKey(item: NoInfer<T>): Key;
+  getChildren?(item: NoInfer<T>): readonly NoInfer<T>[] | undefined;
+  isDisabled?(item: NoInfer<T>): boolean;
+  getTextValue?(item: NoInfer<T>): string;
+}
+export interface TreeRow<T> {
+  readonly key: Key;
+  readonly item: T;
+  readonly index: number;
+  readonly depth: number;
+  readonly parentKey: Key | null;
+  readonly hasChildren: boolean;
+  readonly expanded: boolean;
+  readonly posInSet: number;
+  readonly setSize: number;
+  readonly disabled: boolean;
+  readonly textValue: string;
+}
+export interface TreeState {
+  highlighted: Key | null;
+  selected: ReadonlySet<Key>;
+  anchor: Key | null;
+  expanded: ReadonlySet<Key>;
+}
+export type Move = {
+  type: "next" | "prev";
+  count?: number;
+} | {
+  type: "first" | "last";
+} | {
+  type: "parent" | "firstChild";
+} | {
+  type: "page";
+  direction: 1 | -1;
+  size: number;
+} | {
+  type: "typeahead";
+  text: string;
+};
+export interface MoveOptions {
+  /** Wrap next, prev, page and typeahead at the ends. Defaults to false. */
+  loop?: boolean;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/commands/index.d.ts

@@ -0,0 +1,10 @@
+import { tradingPreset } from "./trading-preset.js";
+import { Ports } from "../kernel.js";
+import { Command, CommandContext, CommandId, CommandScopeOptions, Commands, KeyOverrideId, KeyOverrides, KeymapEntry, KeysOptions, PendingConfirm, Preset, Register, ValidatedKeyOverrides } from "./types.js";
+/** Only port interfaces enter this owner; bare and default kernels share the same layer. */
+export declare function createCommands({ ports: { keyboard, store, reporter }, keys: options }: {
+  ports: Pick<Ports, "keyboard" | "store" | "reporter">;
+  keys?: KeysOptions;
+}): Commands;
+export { type Command, type CommandContext, type CommandId, type CommandScopeOptions, type Commands, type KeyOverrideId, type KeyOverrides, type KeymapEntry, type KeysOptions, type PendingConfirm, type Preset, type Register, type ValidatedKeyOverrides, tradingPreset };
+//# sourceMappingURL=index.d.ts.map