@streetui/graph 1.0.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 StreetUI contributors
+
+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/README.md

@@ -0,0 +1,26 @@
+# @streetui/graph
+
+StreetUI Semantic Application Graph — nodes, relationships, traversal, validation
+
+Part of [StreetUI](https://github.com/streetui/streetui) — a semantic,
+signal-based UI framework with its own reactivity and keyed DOM reconciler
+(no virtual DOM).
+
+## Install
+
+```sh
+npm install @streetui/graph
+```
+
+## Usage
+
+```ts
+import * as pkg from '@streetui/graph';
+```
+
+Both ESM (`import`) and CommonJS (`require`) entry points are shipped, with
+matching TypeScript declarations.
+
+## License
+
+MIT

package/dist/index.cjs

@@ -0,0 +1,287 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/index.ts
+var index_exports = {};
+__export(index_exports, {
+  ApplicationGraph: () => ApplicationGraph,
+  GraphNode: () => GraphNode
+});
+module.exports = __toCommonJS(index_exports);
+
+// src/graph-node.ts
+var import_core = require("@streetui/core");
+var GraphNode = class _GraphNode {
+  id;
+  type;
+  key;
+  props;
+  events;
+  stateRefs;
+  children;
+  parent;
+  constructor(type, options = {}) {
+    this.type = type;
+    this.id = options.id ?? (0, import_core.generateNodeId)(type);
+    this.key = options.key;
+    this.props = options.props ?? {};
+    this.events = options.events ?? [];
+    this.stateRefs = options.stateRefs ?? [];
+    this.children = [];
+    this.parent = null;
+  }
+  // ── Child management ────────────────────────────────────────────────────────
+  appendChild(child) {
+    if (child.parent !== null) {
+      child.parent.removeChild(child);
+    }
+    child.parent = this;
+    this.children.push(child);
+  }
+  insertBefore(child, reference) {
+    const idx = this.children.indexOf(reference);
+    if (idx === -1) {
+      this.appendChild(child);
+      return;
+    }
+    if (child.parent !== null) {
+      child.parent.removeChild(child);
+    }
+    child.parent = this;
+    this.children.splice(idx, 0, child);
+  }
+  removeChild(child) {
+    const idx = this.children.indexOf(child);
+    if (idx === -1) return;
+    this.children.splice(idx, 1);
+    child.parent = null;
+  }
+  replaceChild(newChild, oldChild) {
+    const idx = this.children.indexOf(oldChild);
+    if (idx === -1) {
+      throw new Error(`GraphNode.replaceChild: oldChild is not a child of this node`);
+    }
+    if (newChild.parent !== null) {
+      newChild.parent.removeChild(newChild);
+    }
+    oldChild.parent = null;
+    newChild.parent = this;
+    this.children.splice(idx, 1, newChild);
+  }
+  // ── Prop helpers ────────────────────────────────────────────────────────────
+  setProp(key, value) {
+    this.props = { ...this.props, [key]: value };
+  }
+  getProp(key) {
+    return this.props[key];
+  }
+  // ── Event helpers ───────────────────────────────────────────────────────────
+  addEvent(descriptor) {
+    this.events.push(descriptor);
+  }
+  removeEvent(type) {
+    this.events = this.events.filter((e) => e.type !== type);
+  }
+  // ── Queries ─────────────────────────────────────────────────────────────────
+  get isLeaf() {
+    return this.children.length === 0;
+  }
+  get depth() {
+    let d = 0;
+    let node = this.parent;
+    while (node !== null) {
+      d++;
+      node = node.parent;
+    }
+    return d;
+  }
+  get root() {
+    let node = this;
+    while (node.parent !== null) {
+      node = node.parent;
+    }
+    return node;
+  }
+  /** Shallow clone — does not clone children. */
+  shallowClone() {
+    const opts = {
+      props: { ...this.props },
+      events: [...this.events],
+      stateRefs: [...this.stateRefs]
+    };
+    if (this.key !== void 0) opts.key = this.key;
+    return new _GraphNode(this.type, opts);
+  }
+};
+
+// src/graph.ts
+var import_core2 = require("@streetui/core");
+var ApplicationGraph = class {
+  root;
+  name;
+  version;
+  _nodeIndex = /* @__PURE__ */ new Map();
+  /** Handler registry — maps handlerKey → actual function */
+  handlers = /* @__PURE__ */ new Map();
+  constructor(options) {
+    this.name = options.name;
+    this.version = options.version ?? "0.0.1";
+    this.root = new GraphNode("application", { props: { name: options.name } });
+    this._nodeIndex.set(this.root.id, this.root);
+  }
+  // ── Node creation & attachment ────────────────────────────────────────────
+  createNode(type, options = {}) {
+    const nodeOpts = {};
+    if (options.key !== void 0) nodeOpts.key = options.key;
+    if (options.props !== void 0) nodeOpts.props = options.props;
+    const node = new GraphNode(type, nodeOpts);
+    this._nodeIndex.set(node.id, node);
+    if (options.parent !== void 0) {
+      options.parent.appendChild(node);
+    }
+    return node;
+  }
+  attachNode(node, parent) {
+    this._nodeIndex.set(node.id, node);
+    parent.appendChild(node);
+  }
+  detachNode(node) {
+    if (node.parent !== null) {
+      node.parent.removeChild(node);
+    }
+    this._removeFromIndex(node);
+  }
+  _removeFromIndex(node) {
+    this._nodeIndex.delete(node.id);
+    this._unregisterNodeHandlers(node);
+    for (const child of node.children) {
+      this._removeFromIndex(child);
+    }
+  }
+  /**
+   * Remove every handler-registry entry owned by a single node. A node owns:
+   *  - one entry per event descriptor (its `handlerKey`),
+   *  - one `__signal__<signalId>` entry per state ref (signalIds are namespaced
+   *    by node id, so they are never shared between nodes), and
+   *  - a `__listbuild__<id>` entry if it is a reactive-list.
+   * Called for every node in a detached subtree so removing list items (or
+   * discarding freshly-built-but-unadopted item subtrees) leaves no stale
+   * registrations behind.
+   */
+  _unregisterNodeHandlers(node) {
+    for (const event of node.events) {
+      this.handlers.delete(event.handlerKey);
+    }
+    for (const ref of node.stateRefs) {
+      this.handlers.delete(`__signal__${ref.signalId}`);
+    }
+    this.handlers.delete(`__listbuild__${node.id}`);
+  }
+  // ── Handler registry ──────────────────────────────────────────────────────
+  registerHandler(key, fn) {
+    this.handlers.set(key, fn);
+  }
+  getHandler(key) {
+    return this.handlers.get(key);
+  }
+  /** True if a handler is currently registered under `key`. Inspection helper. */
+  hasHandler(key) {
+    return this.handlers.has(key);
+  }
+  /** Number of currently-registered handlers. Inspection helper. */
+  get handlerCount() {
+    return this.handlers.size;
+  }
+  // ── Lookup ────────────────────────────────────────────────────────────────
+  findById(id) {
+    return this._nodeIndex.get(id);
+  }
+  findAll(predicate) {
+    const results = [];
+    this._walk(this.root, (node) => {
+      if (predicate(node)) results.push(node);
+    });
+    return results;
+  }
+  findByType(type) {
+    return this.findAll((n) => n.type === type);
+  }
+  // ── Traversal ─────────────────────────────────────────────────────────────
+  walk(visitor) {
+    this._walk(this.root, visitor, 0);
+  }
+  _walk(node, visitor, depth = 0) {
+    visitor(node, depth);
+    for (const child of node.children) {
+      this._walk(child, visitor, depth + 1);
+    }
+  }
+  get nodeCount() {
+    return this._nodeIndex.size;
+  }
+  // ── Validation ────────────────────────────────────────────────────────────
+  validate() {
+    const dc = new import_core2.DiagnosticCollector();
+    this.walk((node) => {
+      for (const event of node.events) {
+        if (!this.handlers.has(event.handlerKey)) {
+          dc.warn(
+            "GRAPH_MISSING_HANDLER",
+            `Node "${node.id}" references handler "${event.handlerKey}" which is not registered`,
+            { nodeId: node.id }
+          );
+        }
+      }
+      if (node.type === "page" && node.parent?.type !== "application") {
+        dc.error(
+          "GRAPH_PAGE_DEPTH",
+          `Page node "${node.id}" must be a direct child of the application root`,
+          { nodeId: node.id }
+        );
+      }
+    });
+    return dc;
+  }
+  // ── Serialization ─────────────────────────────────────────────────────────
+  serialize() {
+    return {
+      name: this.name,
+      version: this.version,
+      root: this._serializeNode(this.root)
+    };
+  }
+  _serializeNode(node) {
+    const result = {
+      id: node.id,
+      type: node.type,
+      key: node.key,
+      props: node.props,
+      events: node.events,
+      stateRefs: node.stateRefs,
+      children: node.children.map((c) => this._serializeNode(c))
+    };
+    return result;
+  }
+};
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  ApplicationGraph,
+  GraphNode
+});
+//# sourceMappingURL=index.cjs.map

package/dist/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/index.ts","../src/graph-node.ts","../src/graph.ts"],"sourcesContent":["export * from './graph-node.js';\nexport * from './graph.js';\n","/**\n * Semantic Application Graph nodes.\n *\n * Every element in a StreetUI application is represented as a GraphNode.\n * Nodes form a tree: each has an optional parent and an ordered list of children.\n */\n\nimport { generateNodeId, type NodeId, type SemanticNodeType } from '@streetui/core';\n\n// ── Property values ───────────────────────────────────────────────────────────\n\nexport type PropValue =\n  | string\n  | number\n  | boolean\n  | null\n  | undefined\n  | string[]\n  | number[]\n  | Record<string, unknown>;\n\nexport type Props = Record<string, PropValue>;\n\n// ── Event descriptors ─────────────────────────────────────────────────────────\n\nexport interface EventDescriptor {\n  readonly type: string;\n  /** Reference key into the application's handler registry. */\n  readonly handlerKey: string;\n}\n\n// ── State references ──────────────────────────────────────────────────────────\n\nexport interface StateRef {\n  /** ID of the signal/store this node's property is bound to. */\n  readonly signalId: string;\n  /** The prop key on this node that is bound. */\n  readonly propKey: string;\n}\n\n// ── The core graph node ───────────────────────────────────────────────────────\n\nexport interface GraphNodeData {\n  readonly id: NodeId;\n  readonly type: SemanticNodeType;\n  readonly key: string | undefined;\n  props: Props;\n  events: EventDescriptor[];\n  stateRefs: StateRef[];\n  children: GraphNode[];\n  parent: GraphNode | null;\n}\n\nexport class GraphNode implements GraphNodeData {\n  readonly id: NodeId;\n  readonly type: SemanticNodeType;\n  readonly key: string | undefined;\n  props: Props;\n  events: EventDescriptor[];\n  stateRefs: StateRef[];\n  children: GraphNode[];\n  parent: GraphNode | null;\n\n  constructor(\n    type: SemanticNodeType,\n    options: {\n      id?: NodeId;\n      key?: string;\n      props?: Props;\n      events?: EventDescriptor[];\n      stateRefs?: StateRef[];\n    } = {},\n  ) {\n    this.type = type;\n    this.id = options.id ?? generateNodeId(type);\n    this.key = options.key;\n    this.props = options.props ?? {};\n    this.events = options.events ?? [];\n    this.stateRefs = options.stateRefs ?? [];\n    this.children = [];\n    this.parent = null;\n  }\n\n  // ── Child management ────────────────────────────────────────────────────────\n\n  appendChild(child: GraphNode): void {\n    if (child.parent !== null) {\n      child.parent.removeChild(child);\n    }\n    child.parent = this;\n    this.children.push(child);\n  }\n\n  insertBefore(child: GraphNode, reference: GraphNode): void {\n    const idx = this.children.indexOf(reference);\n    if (idx === -1) {\n      this.appendChild(child);\n      return;\n    }\n    if (child.parent !== null) {\n      child.parent.removeChild(child);\n    }\n    child.parent = this;\n    this.children.splice(idx, 0, child);\n  }\n\n  removeChild(child: GraphNode): void {\n    const idx = this.children.indexOf(child);\n    if (idx === -1) return;\n    this.children.splice(idx, 1);\n    child.parent = null;\n  }\n\n  replaceChild(newChild: GraphNode, oldChild: GraphNode): void {\n    const idx = this.children.indexOf(oldChild);\n    if (idx === -1) {\n      throw new Error(`GraphNode.replaceChild: oldChild is not a child of this node`);\n    }\n    if (newChild.parent !== null) {\n      newChild.parent.removeChild(newChild);\n    }\n    oldChild.parent = null;\n    newChild.parent = this;\n    this.children.splice(idx, 1, newChild);\n  }\n\n  // ── Prop helpers ────────────────────────────────────────────────────────────\n\n  setProp(key: string, value: PropValue): void {\n    this.props = { ...this.props, [key]: value };\n  }\n\n  getProp<T extends PropValue = PropValue>(key: string): T | undefined {\n    return this.props[key] as T | undefined;\n  }\n\n  // ── Event helpers ───────────────────────────────────────────────────────────\n\n  addEvent(descriptor: EventDescriptor): void {\n    this.events.push(descriptor);\n  }\n\n  removeEvent(type: string): void {\n    this.events = this.events.filter(e => e.type !== type);\n  }\n\n  // ── Queries ─────────────────────────────────────────────────────────────────\n\n  get isLeaf(): boolean {\n    return this.children.length === 0;\n  }\n\n  get depth(): number {\n    let d = 0;\n    let node: GraphNode | null = this.parent;\n    while (node !== null) {\n      d++;\n      node = node.parent;\n    }\n    return d;\n  }\n\n  get root(): GraphNode {\n    // eslint-disable-next-line @typescript-eslint/no-this-alias\n    let node: GraphNode = this;\n    while (node.parent !== null) {\n      node = node.parent;\n    }\n    return node;\n  }\n\n  /** Shallow clone — does not clone children. */\n  shallowClone(): GraphNode {\n    const opts: { key?: string; props: Props; events: EventDescriptor[]; stateRefs: StateRef[] } = {\n      props: { ...this.props },\n      events: [...this.events],\n      stateRefs: [...this.stateRefs],\n    };\n    if (this.key !== undefined) opts.key = this.key;\n    return new GraphNode(this.type, opts);\n  }\n}\n","/**\n * The Semantic Application Graph.\n *\n * Holds the application root node and all its descendants.\n * Supports traversal, lookup by ID, validation, and serialization.\n */\n\nimport { type NodeId, DiagnosticCollector } from '@streetui/core';\nimport { GraphNode, type Props, type EventDescriptor } from './graph-node.js';\n\nexport interface ApplicationGraphOptions {\n  readonly name: string;\n  readonly version?: string;\n}\n\nexport interface HandlerFn {\n  (...args: unknown[]): unknown;\n}\n\nexport class ApplicationGraph {\n  readonly root: GraphNode;\n  readonly name: string;\n  readonly version: string;\n  private readonly _nodeIndex: Map<NodeId, GraphNode> = new Map();\n  /** Handler registry — maps handlerKey → actual function */\n  readonly handlers: Map<string, HandlerFn> = new Map();\n\n  constructor(options: ApplicationGraphOptions) {\n    this.name = options.name;\n    this.version = options.version ?? '0.0.1';\n    this.root = new GraphNode('application', { props: { name: options.name } });\n    this._nodeIndex.set(this.root.id, this.root);\n  }\n\n  // ── Node creation & attachment ────────────────────────────────────────────\n\n  createNode(\n    type: GraphNode['type'],\n    options: { key?: string; props?: Props; parent?: GraphNode } = {},\n  ): GraphNode {\n    const nodeOpts: { key?: string; props?: Props } = {};\n    if (options.key !== undefined) nodeOpts.key = options.key;\n    if (options.props !== undefined) nodeOpts.props = options.props;\n    const node = new GraphNode(type, nodeOpts);\n    this._nodeIndex.set(node.id, node);\n    if (options.parent !== undefined) {\n      options.parent.appendChild(node);\n    }\n    return node;\n  }\n\n  attachNode(node: GraphNode, parent: GraphNode): void {\n    this._nodeIndex.set(node.id, node);\n    parent.appendChild(node);\n  }\n\n  detachNode(node: GraphNode): void {\n    if (node.parent !== null) {\n      node.parent.removeChild(node);\n    }\n    this._removeFromIndex(node);\n  }\n\n  private _removeFromIndex(node: GraphNode): void {\n    this._nodeIndex.delete(node.id);\n    this._unregisterNodeHandlers(node);\n    for (const child of node.children) {\n      this._removeFromIndex(child);\n    }\n  }\n\n  /**\n   * Remove every handler-registry entry owned by a single node. A node owns:\n   *  - one entry per event descriptor (its `handlerKey`),\n   *  - one `__signal__<signalId>` entry per state ref (signalIds are namespaced\n   *    by node id, so they are never shared between nodes), and\n   *  - a `__listbuild__<id>` entry if it is a reactive-list.\n   * Called for every node in a detached subtree so removing list items (or\n   * discarding freshly-built-but-unadopted item subtrees) leaves no stale\n   * registrations behind.\n   */\n  private _unregisterNodeHandlers(node: GraphNode): void {\n    for (const event of node.events) {\n      this.handlers.delete(event.handlerKey);\n    }\n    for (const ref of node.stateRefs) {\n      this.handlers.delete(`__signal__${ref.signalId}`);\n    }\n    this.handlers.delete(`__listbuild__${node.id}`);\n  }\n\n  // ── Handler registry ──────────────────────────────────────────────────────\n\n  registerHandler(key: string, fn: HandlerFn): void {\n    this.handlers.set(key, fn);\n  }\n\n  getHandler(key: string): HandlerFn | undefined {\n    return this.handlers.get(key);\n  }\n\n  /** True if a handler is currently registered under `key`. Inspection helper. */\n  hasHandler(key: string): boolean {\n    return this.handlers.has(key);\n  }\n\n  /** Number of currently-registered handlers. Inspection helper. */\n  get handlerCount(): number {\n    return this.handlers.size;\n  }\n\n  // ── Lookup ────────────────────────────────────────────────────────────────\n\n  findById(id: NodeId): GraphNode | undefined {\n    return this._nodeIndex.get(id);\n  }\n\n  findAll(predicate: (node: GraphNode) => boolean): GraphNode[] {\n    const results: GraphNode[] = [];\n    this._walk(this.root, node => {\n      if (predicate(node)) results.push(node);\n    });\n    return results;\n  }\n\n  findByType(type: GraphNode['type']): GraphNode[] {\n    return this.findAll(n => n.type === type);\n  }\n\n  // ── Traversal ─────────────────────────────────────────────────────────────\n\n  walk(visitor: (node: GraphNode, depth: number) => void): void {\n    this._walk(this.root, visitor, 0);\n  }\n\n  private _walk(\n    node: GraphNode,\n    visitor: (node: GraphNode, depth: number) => void,\n    depth: number = 0,\n  ): void {\n    visitor(node, depth);\n    for (const child of node.children) {\n      this._walk(child, visitor, depth + 1);\n    }\n  }\n\n  get nodeCount(): number {\n    return this._nodeIndex.size;\n  }\n\n  // ── Validation ────────────────────────────────────────────────────────────\n\n  validate(): DiagnosticCollector {\n    const dc = new DiagnosticCollector();\n\n    this.walk((node) => {\n      // Validate event handler references exist\n      for (const event of node.events) {\n        if (!this.handlers.has(event.handlerKey)) {\n          dc.warn(\n            'GRAPH_MISSING_HANDLER',\n            `Node \"${node.id}\" references handler \"${event.handlerKey}\" which is not registered`,\n            { nodeId: node.id },\n          );\n        }\n      }\n\n      // Validate page nodes are direct children of root\n      if (node.type === 'page' && node.parent?.type !== 'application') {\n        dc.error(\n          'GRAPH_PAGE_DEPTH',\n          `Page node \"${node.id}\" must be a direct child of the application root`,\n          { nodeId: node.id },\n        );\n      }\n    });\n\n    return dc;\n  }\n\n  // ── Serialization ─────────────────────────────────────────────────────────\n\n  serialize(): SerializedGraph {\n    return {\n      name: this.name,\n      version: this.version,\n      root: this._serializeNode(this.root),\n    };\n  }\n\n  private _serializeNode(node: GraphNode): SerializedNode {\n    const result: SerializedNode = {\n      id: node.id,\n      type: node.type,\n      key: node.key,\n      props: node.props,\n      events: node.events,\n      stateRefs: node.stateRefs,\n      children: node.children.map(c => this._serializeNode(c)),\n    };\n    return result;\n  }\n}\n\nexport interface SerializedNode {\n  readonly id: string;\n  readonly type: string;\n  readonly key: string | undefined;\n  readonly props: Props;\n  readonly events: EventDescriptor[];\n  readonly stateRefs: unknown[];\n  readonly children: SerializedNode[];\n}\n\nexport interface SerializedGraph {\n  readonly name: string;\n  readonly version: string;\n  readonly root: SerializedNode;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACOA,kBAAmE;AA8C5D,IAAM,YAAN,MAAM,WAAmC;AAAA,EACrC;AAAA,EACA;AAAA,EACA;AAAA,EACT;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAEA,YACE,MACA,UAMI,CAAC,GACL;AACA,SAAK,OAAO;AACZ,SAAK,KAAK,QAAQ,UAAM,4BAAe,IAAI;AAC3C,SAAK,MAAM,QAAQ;AACnB,SAAK,QAAQ,QAAQ,SAAS,CAAC;AAC/B,SAAK,SAAS,QAAQ,UAAU,CAAC;AACjC,SAAK,YAAY,QAAQ,aAAa,CAAC;AACvC,SAAK,WAAW,CAAC;AACjB,SAAK,SAAS;AAAA,EAChB;AAAA;AAAA,EAIA,YAAY,OAAwB;AAClC,QAAI,MAAM,WAAW,MAAM;AACzB,YAAM,OAAO,YAAY,KAAK;AAAA,IAChC;AACA,UAAM,SAAS;AACf,SAAK,SAAS,KAAK,KAAK;AAAA,EAC1B;AAAA,EAEA,aAAa,OAAkB,WAA4B;AACzD,UAAM,MAAM,KAAK,SAAS,QAAQ,SAAS;AAC3C,QAAI,QAAQ,IAAI;AACd,WAAK,YAAY,KAAK;AACtB;AAAA,IACF;AACA,QAAI,MAAM,WAAW,MAAM;AACzB,YAAM,OAAO,YAAY,KAAK;AAAA,IAChC;AACA,UAAM,SAAS;AACf,SAAK,SAAS,OAAO,KAAK,GAAG,KAAK;AAAA,EACpC;AAAA,EAEA,YAAY,OAAwB;AAClC,UAAM,MAAM,KAAK,SAAS,QAAQ,KAAK;AACvC,QAAI,QAAQ,GAAI;AAChB,SAAK,SAAS,OAAO,KAAK,CAAC;AAC3B,UAAM,SAAS;AAAA,EACjB;AAAA,EAEA,aAAa,UAAqB,UAA2B;AAC3D,UAAM,MAAM,KAAK,SAAS,QAAQ,QAAQ;AAC1C,QAAI,QAAQ,IAAI;AACd,YAAM,IAAI,MAAM,8DAA8D;AAAA,IAChF;AACA,QAAI,SAAS,WAAW,MAAM;AAC5B,eAAS,OAAO,YAAY,QAAQ;AAAA,IACtC;AACA,aAAS,SAAS;AAClB,aAAS,SAAS;AAClB,SAAK,SAAS,OAAO,KAAK,GAAG,QAAQ;AAAA,EACvC;AAAA;AAAA,EAIA,QAAQ,KAAa,OAAwB;AAC3C,SAAK,QAAQ,EAAE,GAAG,KAAK,OAAO,CAAC,GAAG,GAAG,MAAM;AAAA,EAC7C;AAAA,EAEA,QAAyC,KAA4B;AACnE,WAAO,KAAK,MAAM,GAAG;AAAA,EACvB;AAAA;AAAA,EAIA,SAAS,YAAmC;AAC1C,SAAK,OAAO,KAAK,UAAU;AAAA,EAC7B;AAAA,EAEA,YAAY,MAAoB;AAC9B,SAAK,SAAS,KAAK,OAAO,OAAO,OAAK,EAAE,SAAS,IAAI;AAAA,EACvD;AAAA;AAAA,EAIA,IAAI,SAAkB;AACpB,WAAO,KAAK,SAAS,WAAW;AAAA,EAClC;AAAA,EAEA,IAAI,QAAgB;AAClB,QAAI,IAAI;AACR,QAAI,OAAyB,KAAK;AAClC,WAAO,SAAS,MAAM;AACpB;AACA,aAAO,KAAK;AAAA,IACd;AACA,WAAO;AAAA,EACT;AAAA,EAEA,IAAI,OAAkB;AAEpB,QAAI,OAAkB;AACtB,WAAO,KAAK,WAAW,MAAM;AAC3B,aAAO,KAAK;AAAA,IACd;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,eAA0B;AACxB,UAAM,OAAyF;AAAA,MAC7F,OAAO,EAAE,GAAG,KAAK,MAAM;AAAA,MACvB,QAAQ,CAAC,GAAG,KAAK,MAAM;AAAA,MACvB,WAAW,CAAC,GAAG,KAAK,SAAS;AAAA,IAC/B;AACA,QAAI,KAAK,QAAQ,OAAW,MAAK,MAAM,KAAK;AAC5C,WAAO,IAAI,WAAU,KAAK,MAAM,IAAI;AAAA,EACtC;AACF;;;AC9KA,IAAAA,eAAiD;AAY1C,IAAM,mBAAN,MAAuB;AAAA,EACnB;AAAA,EACA;AAAA,EACA;AAAA,EACQ,aAAqC,oBAAI,IAAI;AAAA;AAAA,EAErD,WAAmC,oBAAI,IAAI;AAAA,EAEpD,YAAY,SAAkC;AAC5C,SAAK,OAAO,QAAQ;AACpB,SAAK,UAAU,QAAQ,WAAW;AAClC,SAAK,OAAO,IAAI,UAAU,eAAe,EAAE,OAAO,EAAE,MAAM,QAAQ,KAAK,EAAE,CAAC;AAC1E,SAAK,WAAW,IAAI,KAAK,KAAK,IAAI,KAAK,IAAI;AAAA,EAC7C;AAAA;AAAA,EAIA,WACE,MACA,UAA+D,CAAC,GACrD;AACX,UAAM,WAA4C,CAAC;AACnD,QAAI,QAAQ,QAAQ,OAAW,UAAS,MAAM,QAAQ;AACtD,QAAI,QAAQ,UAAU,OAAW,UAAS,QAAQ,QAAQ;AAC1D,UAAM,OAAO,IAAI,UAAU,MAAM,QAAQ;AACzC,SAAK,WAAW,IAAI,KAAK,IAAI,IAAI;AACjC,QAAI,QAAQ,WAAW,QAAW;AAChC,cAAQ,OAAO,YAAY,IAAI;AAAA,IACjC;AACA,WAAO;AAAA,EACT;AAAA,EAEA,WAAW,MAAiB,QAAyB;AACnD,SAAK,WAAW,IAAI,KAAK,IAAI,IAAI;AACjC,WAAO,YAAY,IAAI;AAAA,EACzB;AAAA,EAEA,WAAW,MAAuB;AAChC,QAAI,KAAK,WAAW,MAAM;AACxB,WAAK,OAAO,YAAY,IAAI;AAAA,IAC9B;AACA,SAAK,iBAAiB,IAAI;AAAA,EAC5B;AAAA,EAEQ,iBAAiB,MAAuB;AAC9C,SAAK,WAAW,OAAO,KAAK,EAAE;AAC9B,SAAK,wBAAwB,IAAI;AACjC,eAAW,SAAS,KAAK,UAAU;AACjC,WAAK,iBAAiB,KAAK;AAAA,IAC7B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYQ,wBAAwB,MAAuB;AACrD,eAAW,SAAS,KAAK,QAAQ;AAC/B,WAAK,SAAS,OAAO,MAAM,UAAU;AAAA,IACvC;AACA,eAAW,OAAO,KAAK,WAAW;AAChC,WAAK,SAAS,OAAO,aAAa,IAAI,QAAQ,EAAE;AAAA,IAClD;AACA,SAAK,SAAS,OAAO,gBAAgB,KAAK,EAAE,EAAE;AAAA,EAChD;AAAA;AAAA,EAIA,gBAAgB,KAAa,IAAqB;AAChD,SAAK,SAAS,IAAI,KAAK,EAAE;AAAA,EAC3B;AAAA,EAEA,WAAW,KAAoC;AAC7C,WAAO,KAAK,SAAS,IAAI,GAAG;AAAA,EAC9B;AAAA;AAAA,EAGA,WAAW,KAAsB;AAC/B,WAAO,KAAK,SAAS,IAAI,GAAG;AAAA,EAC9B;AAAA;AAAA,EAGA,IAAI,eAAuB;AACzB,WAAO,KAAK,SAAS;AAAA,EACvB;AAAA;AAAA,EAIA,SAAS,IAAmC;AAC1C,WAAO,KAAK,WAAW,IAAI,EAAE;AAAA,EAC/B;AAAA,EAEA,QAAQ,WAAsD;AAC5D,UAAM,UAAuB,CAAC;AAC9B,SAAK,MAAM,KAAK,MAAM,UAAQ;AAC5B,UAAI,UAAU,IAAI,EAAG,SAAQ,KAAK,IAAI;AAAA,IACxC,CAAC;AACD,WAAO;AAAA,EACT;AAAA,EAEA,WAAW,MAAsC;AAC/C,WAAO,KAAK,QAAQ,OAAK,EAAE,SAAS,IAAI;AAAA,EAC1C;AAAA;AAAA,EAIA,KAAK,SAAyD;AAC5D,SAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAAA,EAClC;AAAA,EAEQ,MACN,MACA,SACA,QAAgB,GACV;AACN,YAAQ,MAAM,KAAK;AACnB,eAAW,SAAS,KAAK,UAAU;AACjC,WAAK,MAAM,OAAO,SAAS,QAAQ,CAAC;AAAA,IACtC;AAAA,EACF;AAAA,EAEA,IAAI,YAAoB;AACtB,WAAO,KAAK,WAAW;AAAA,EACzB;AAAA;AAAA,EAIA,WAAgC;AAC9B,UAAM,KAAK,IAAI,iCAAoB;AAEnC,SAAK,KAAK,CAAC,SAAS;AAElB,iBAAW,SAAS,KAAK,QAAQ;AAC/B,YAAI,CAAC,KAAK,SAAS,IAAI,MAAM,UAAU,GAAG;AACxC,aAAG;AAAA,YACD;AAAA,YACA,SAAS,KAAK,EAAE,yBAAyB,MAAM,UAAU;AAAA,YACzD,EAAE,QAAQ,KAAK,GAAG;AAAA,UACpB;AAAA,QACF;AAAA,MACF;AAGA,UAAI,KAAK,SAAS,UAAU,KAAK,QAAQ,SAAS,eAAe;AAC/D,WAAG;AAAA,UACD;AAAA,UACA,cAAc,KAAK,EAAE;AAAA,UACrB,EAAE,QAAQ,KAAK,GAAG;AAAA,QACpB;AAAA,MACF;AAAA,IACF,CAAC;AAED,WAAO;AAAA,EACT;AAAA;AAAA,EAIA,YAA6B;AAC3B,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX,SAAS,KAAK;AAAA,MACd,MAAM,KAAK,eAAe,KAAK,IAAI;AAAA,IACrC;AAAA,EACF;AAAA,EAEQ,eAAe,MAAiC;AACtD,UAAM,SAAyB;AAAA,MAC7B,IAAI,KAAK;AAAA,MACT,MAAM,KAAK;AAAA,MACX,KAAK,KAAK;AAAA,MACV,OAAO,KAAK;AAAA,MACZ,QAAQ,KAAK;AAAA,MACb,WAAW,KAAK;AAAA,MAChB,UAAU,KAAK,SAAS,IAAI,OAAK,KAAK,eAAe,CAAC,CAAC;AAAA,IACzD;AACA,WAAO;AAAA,EACT;AACF;","names":["import_core"]}

package/dist/index.d.cts

@@ -0,0 +1,136 @@
+import { NodeId, SemanticNodeType, DiagnosticCollector } from '@streetui/core';
+
+/**
+ * Semantic Application Graph nodes.
+ *
+ * Every element in a StreetUI application is represented as a GraphNode.
+ * Nodes form a tree: each has an optional parent and an ordered list of children.
+ */
+
+type PropValue = string | number | boolean | null | undefined | string[] | number[] | Record<string, unknown>;
+type Props = Record<string, PropValue>;
+interface EventDescriptor {
+    readonly type: string;
+    /** Reference key into the application's handler registry. */
+    readonly handlerKey: string;
+}
+interface StateRef {
+    /** ID of the signal/store this node's property is bound to. */
+    readonly signalId: string;
+    /** The prop key on this node that is bound. */
+    readonly propKey: string;
+}
+interface GraphNodeData {
+    readonly id: NodeId;
+    readonly type: SemanticNodeType;
+    readonly key: string | undefined;
+    props: Props;
+    events: EventDescriptor[];
+    stateRefs: StateRef[];
+    children: GraphNode[];
+    parent: GraphNode | null;
+}
+declare class GraphNode implements GraphNodeData {
+    readonly id: NodeId;
+    readonly type: SemanticNodeType;
+    readonly key: string | undefined;
+    props: Props;
+    events: EventDescriptor[];
+    stateRefs: StateRef[];
+    children: GraphNode[];
+    parent: GraphNode | null;
+    constructor(type: SemanticNodeType, options?: {
+        id?: NodeId;
+        key?: string;
+        props?: Props;
+        events?: EventDescriptor[];
+        stateRefs?: StateRef[];
+    });
+    appendChild(child: GraphNode): void;
+    insertBefore(child: GraphNode, reference: GraphNode): void;
+    removeChild(child: GraphNode): void;
+    replaceChild(newChild: GraphNode, oldChild: GraphNode): void;
+    setProp(key: string, value: PropValue): void;
+    getProp<T extends PropValue = PropValue>(key: string): T | undefined;
+    addEvent(descriptor: EventDescriptor): void;
+    removeEvent(type: string): void;
+    get isLeaf(): boolean;
+    get depth(): number;
+    get root(): GraphNode;
+    /** Shallow clone — does not clone children. */
+    shallowClone(): GraphNode;
+}
+
+/**
+ * The Semantic Application Graph.
+ *
+ * Holds the application root node and all its descendants.
+ * Supports traversal, lookup by ID, validation, and serialization.
+ */
+
+interface ApplicationGraphOptions {
+    readonly name: string;
+    readonly version?: string;
+}
+interface HandlerFn {
+    (...args: unknown[]): unknown;
+}
+declare class ApplicationGraph {
+    readonly root: GraphNode;
+    readonly name: string;
+    readonly version: string;
+    private readonly _nodeIndex;
+    /** Handler registry — maps handlerKey → actual function */
+    readonly handlers: Map<string, HandlerFn>;
+    constructor(options: ApplicationGraphOptions);
+    createNode(type: GraphNode['type'], options?: {
+        key?: string;
+        props?: Props;
+        parent?: GraphNode;
+    }): GraphNode;
+    attachNode(node: GraphNode, parent: GraphNode): void;
+    detachNode(node: GraphNode): void;
+    private _removeFromIndex;
+    /**
+     * Remove every handler-registry entry owned by a single node. A node owns:
+     *  - one entry per event descriptor (its `handlerKey`),
+     *  - one `__signal__<signalId>` entry per state ref (signalIds are namespaced
+     *    by node id, so they are never shared between nodes), and
+     *  - a `__listbuild__<id>` entry if it is a reactive-list.
+     * Called for every node in a detached subtree so removing list items (or
+     * discarding freshly-built-but-unadopted item subtrees) leaves no stale
+     * registrations behind.
+     */
+    private _unregisterNodeHandlers;
+    registerHandler(key: string, fn: HandlerFn): void;
+    getHandler(key: string): HandlerFn | undefined;
+    /** True if a handler is currently registered under `key`. Inspection helper. */
+    hasHandler(key: string): boolean;
+    /** Number of currently-registered handlers. Inspection helper. */
+    get handlerCount(): number;
+    findById(id: NodeId): GraphNode | undefined;
+    findAll(predicate: (node: GraphNode) => boolean): GraphNode[];
+    findByType(type: GraphNode['type']): GraphNode[];
+    walk(visitor: (node: GraphNode, depth: number) => void): void;
+    private _walk;
+    get nodeCount(): number;
+    validate(): DiagnosticCollector;
+    serialize(): SerializedGraph;
+    private _serializeNode;
+}
+interface SerializedNode {
+    readonly id: string;
+    readonly type: string;
+    readonly key: string | undefined;
+    readonly props: Props;
+    readonly events: EventDescriptor[];
+    readonly stateRefs: unknown[];
+    readonly children: SerializedNode[];
+}
+interface SerializedGraph {
+    readonly name: string;
+    readonly version: string;
+    readonly root: SerializedNode;
+}
+
+export { ApplicationGraph, type ApplicationGraphOptions, type EventDescriptor, GraphNode, type GraphNodeData, type HandlerFn, type PropValue, type Props, type SerializedGraph, type SerializedNode, type StateRef };

package/dist/index.d.ts

@@ -0,0 +1,136 @@
+import { NodeId, SemanticNodeType, DiagnosticCollector } from '@streetui/core';
+
+/**
+ * Semantic Application Graph nodes.
+ *
+ * Every element in a StreetUI application is represented as a GraphNode.
+ * Nodes form a tree: each has an optional parent and an ordered list of children.
+ */
+
+type PropValue = string | number | boolean | null | undefined | string[] | number[] | Record<string, unknown>;
+type Props = Record<string, PropValue>;
+interface EventDescriptor {
+    readonly type: string;
+    /** Reference key into the application's handler registry. */
+    readonly handlerKey: string;
+}
+interface StateRef {
+    /** ID of the signal/store this node's property is bound to. */
+    readonly signalId: string;
+    /** The prop key on this node that is bound. */
+    readonly propKey: string;
+}
+interface GraphNodeData {
+    readonly id: NodeId;
+    readonly type: SemanticNodeType;
+    readonly key: string | undefined;
+    props: Props;
+    events: EventDescriptor[];
+    stateRefs: StateRef[];
+    children: GraphNode[];
+    parent: GraphNode | null;
+}
+declare class GraphNode implements GraphNodeData {
+    readonly id: NodeId;
+    readonly type: SemanticNodeType;
+    readonly key: string | undefined;
+    props: Props;
+    events: EventDescriptor[];
+    stateRefs: StateRef[];
+    children: GraphNode[];
+    parent: GraphNode | null;
+    constructor(type: SemanticNodeType, options?: {
+        id?: NodeId;
+        key?: string;
+        props?: Props;
+        events?: EventDescriptor[];
+        stateRefs?: StateRef[];
+    });
+    appendChild(child: GraphNode): void;
+    insertBefore(child: GraphNode, reference: GraphNode): void;
+    removeChild(child: GraphNode): void;
+    replaceChild(newChild: GraphNode, oldChild: GraphNode): void;
+    setProp(key: string, value: PropValue): void;
+    getProp<T extends PropValue = PropValue>(key: string): T | undefined;
+    addEvent(descriptor: EventDescriptor): void;
+    removeEvent(type: string): void;
+    get isLeaf(): boolean;
+    get depth(): number;
+    get root(): GraphNode;
+    /** Shallow clone — does not clone children. */
+    shallowClone(): GraphNode;
+}
+
+/**
+ * The Semantic Application Graph.
+ *
+ * Holds the application root node and all its descendants.
+ * Supports traversal, lookup by ID, validation, and serialization.
+ */
+
+interface ApplicationGraphOptions {
+    readonly name: string;
+    readonly version?: string;
+}
+interface HandlerFn {
+    (...args: unknown[]): unknown;
+}
+declare class ApplicationGraph {
+    readonly root: GraphNode;
+    readonly name: string;
+    readonly version: string;
+    private readonly _nodeIndex;
+    /** Handler registry — maps handlerKey → actual function */
+    readonly handlers: Map<string, HandlerFn>;
+    constructor(options: ApplicationGraphOptions);
+    createNode(type: GraphNode['type'], options?: {
+        key?: string;
+        props?: Props;
+        parent?: GraphNode;
+    }): GraphNode;
+    attachNode(node: GraphNode, parent: GraphNode): void;
+    detachNode(node: GraphNode): void;
+    private _removeFromIndex;
+    /**
+     * Remove every handler-registry entry owned by a single node. A node owns:
+     *  - one entry per event descriptor (its `handlerKey`),
+     *  - one `__signal__<signalId>` entry per state ref (signalIds are namespaced
+     *    by node id, so they are never shared between nodes), and
+     *  - a `__listbuild__<id>` entry if it is a reactive-list.
+     * Called for every node in a detached subtree so removing list items (or
+     * discarding freshly-built-but-unadopted item subtrees) leaves no stale
+     * registrations behind.
+     */
+    private _unregisterNodeHandlers;
+    registerHandler(key: string, fn: HandlerFn): void;
+    getHandler(key: string): HandlerFn | undefined;
+    /** True if a handler is currently registered under `key`. Inspection helper. */
+    hasHandler(key: string): boolean;
+    /** Number of currently-registered handlers. Inspection helper. */
+    get handlerCount(): number;
+    findById(id: NodeId): GraphNode | undefined;
+    findAll(predicate: (node: GraphNode) => boolean): GraphNode[];
+    findByType(type: GraphNode['type']): GraphNode[];
+    walk(visitor: (node: GraphNode, depth: number) => void): void;
+    private _walk;
+    get nodeCount(): number;
+    validate(): DiagnosticCollector;
+    serialize(): SerializedGraph;
+    private _serializeNode;
+}
+interface SerializedNode {
+    readonly id: string;
+    readonly type: string;
+    readonly key: string | undefined;
+    readonly props: Props;
+    readonly events: EventDescriptor[];
+    readonly stateRefs: unknown[];
+    readonly children: SerializedNode[];
+}
+interface SerializedGraph {
+    readonly name: string;
+    readonly version: string;
+    readonly root: SerializedNode;
+}
+
+export { ApplicationGraph, type ApplicationGraphOptions, type EventDescriptor, GraphNode, type GraphNodeData, type HandlerFn, type PropValue, type Props, type SerializedGraph, type SerializedNode, type StateRef };

package/dist/index.js

@@ -0,0 +1,259 @@
+// src/graph-node.ts
+import { generateNodeId } from "@streetui/core";
+var GraphNode = class _GraphNode {
+  id;
+  type;
+  key;
+  props;
+  events;
+  stateRefs;
+  children;
+  parent;
+  constructor(type, options = {}) {
+    this.type = type;
+    this.id = options.id ?? generateNodeId(type);
+    this.key = options.key;
+    this.props = options.props ?? {};
+    this.events = options.events ?? [];
+    this.stateRefs = options.stateRefs ?? [];
+    this.children = [];
+    this.parent = null;
+  }
+  // ── Child management ────────────────────────────────────────────────────────
+  appendChild(child) {
+    if (child.parent !== null) {
+      child.parent.removeChild(child);
+    }
+    child.parent = this;
+    this.children.push(child);
+  }
+  insertBefore(child, reference) {
+    const idx = this.children.indexOf(reference);
+    if (idx === -1) {
+      this.appendChild(child);
+      return;
+    }
+    if (child.parent !== null) {
+      child.parent.removeChild(child);
+    }
+    child.parent = this;
+    this.children.splice(idx, 0, child);
+  }
+  removeChild(child) {
+    const idx = this.children.indexOf(child);
+    if (idx === -1) return;
+    this.children.splice(idx, 1);
+    child.parent = null;
+  }
+  replaceChild(newChild, oldChild) {
+    const idx = this.children.indexOf(oldChild);
+    if (idx === -1) {
+      throw new Error(`GraphNode.replaceChild: oldChild is not a child of this node`);
+    }
+    if (newChild.parent !== null) {
+      newChild.parent.removeChild(newChild);
+    }
+    oldChild.parent = null;
+    newChild.parent = this;
+    this.children.splice(idx, 1, newChild);
+  }
+  // ── Prop helpers ────────────────────────────────────────────────────────────
+  setProp(key, value) {
+    this.props = { ...this.props, [key]: value };
+  }
+  getProp(key) {
+    return this.props[key];
+  }
+  // ── Event helpers ───────────────────────────────────────────────────────────
+  addEvent(descriptor) {
+    this.events.push(descriptor);
+  }
+  removeEvent(type) {
+    this.events = this.events.filter((e) => e.type !== type);
+  }
+  // ── Queries ─────────────────────────────────────────────────────────────────
+  get isLeaf() {
+    return this.children.length === 0;
+  }
+  get depth() {
+    let d = 0;
+    let node = this.parent;
+    while (node !== null) {
+      d++;
+      node = node.parent;
+    }
+    return d;
+  }
+  get root() {
+    let node = this;
+    while (node.parent !== null) {
+      node = node.parent;
+    }
+    return node;
+  }
+  /** Shallow clone — does not clone children. */
+  shallowClone() {
+    const opts = {
+      props: { ...this.props },
+      events: [...this.events],
+      stateRefs: [...this.stateRefs]
+    };
+    if (this.key !== void 0) opts.key = this.key;
+    return new _GraphNode(this.type, opts);
+  }
+};
+
+// src/graph.ts
+import { DiagnosticCollector } from "@streetui/core";
+var ApplicationGraph = class {
+  root;
+  name;
+  version;
+  _nodeIndex = /* @__PURE__ */ new Map();
+  /** Handler registry — maps handlerKey → actual function */
+  handlers = /* @__PURE__ */ new Map();
+  constructor(options) {
+    this.name = options.name;
+    this.version = options.version ?? "0.0.1";
+    this.root = new GraphNode("application", { props: { name: options.name } });
+    this._nodeIndex.set(this.root.id, this.root);
+  }
+  // ── Node creation & attachment ────────────────────────────────────────────
+  createNode(type, options = {}) {
+    const nodeOpts = {};
+    if (options.key !== void 0) nodeOpts.key = options.key;
+    if (options.props !== void 0) nodeOpts.props = options.props;
+    const node = new GraphNode(type, nodeOpts);
+    this._nodeIndex.set(node.id, node);
+    if (options.parent !== void 0) {
+      options.parent.appendChild(node);
+    }
+    return node;
+  }
+  attachNode(node, parent) {
+    this._nodeIndex.set(node.id, node);
+    parent.appendChild(node);
+  }
+  detachNode(node) {
+    if (node.parent !== null) {
+      node.parent.removeChild(node);
+    }
+    this._removeFromIndex(node);
+  }
+  _removeFromIndex(node) {
+    this._nodeIndex.delete(node.id);
+    this._unregisterNodeHandlers(node);
+    for (const child of node.children) {
+      this._removeFromIndex(child);
+    }
+  }
+  /**
+   * Remove every handler-registry entry owned by a single node. A node owns:
+   *  - one entry per event descriptor (its `handlerKey`),
+   *  - one `__signal__<signalId>` entry per state ref (signalIds are namespaced
+   *    by node id, so they are never shared between nodes), and
+   *  - a `__listbuild__<id>` entry if it is a reactive-list.
+   * Called for every node in a detached subtree so removing list items (or
+   * discarding freshly-built-but-unadopted item subtrees) leaves no stale
+   * registrations behind.
+   */
+  _unregisterNodeHandlers(node) {
+    for (const event of node.events) {
+      this.handlers.delete(event.handlerKey);
+    }
+    for (const ref of node.stateRefs) {
+      this.handlers.delete(`__signal__${ref.signalId}`);
+    }
+    this.handlers.delete(`__listbuild__${node.id}`);
+  }
+  // ── Handler registry ──────────────────────────────────────────────────────
+  registerHandler(key, fn) {
+    this.handlers.set(key, fn);
+  }
+  getHandler(key) {
+    return this.handlers.get(key);
+  }
+  /** True if a handler is currently registered under `key`. Inspection helper. */
+  hasHandler(key) {
+    return this.handlers.has(key);
+  }
+  /** Number of currently-registered handlers. Inspection helper. */
+  get handlerCount() {
+    return this.handlers.size;
+  }
+  // ── Lookup ────────────────────────────────────────────────────────────────
+  findById(id) {
+    return this._nodeIndex.get(id);
+  }
+  findAll(predicate) {
+    const results = [];
+    this._walk(this.root, (node) => {
+      if (predicate(node)) results.push(node);
+    });
+    return results;
+  }
+  findByType(type) {
+    return this.findAll((n) => n.type === type);
+  }
+  // ── Traversal ─────────────────────────────────────────────────────────────
+  walk(visitor) {
+    this._walk(this.root, visitor, 0);
+  }
+  _walk(node, visitor, depth = 0) {
+    visitor(node, depth);
+    for (const child of node.children) {
+      this._walk(child, visitor, depth + 1);
+    }
+  }
+  get nodeCount() {
+    return this._nodeIndex.size;
+  }
+  // ── Validation ────────────────────────────────────────────────────────────
+  validate() {
+    const dc = new DiagnosticCollector();
+    this.walk((node) => {
+      for (const event of node.events) {
+        if (!this.handlers.has(event.handlerKey)) {
+          dc.warn(
+            "GRAPH_MISSING_HANDLER",
+            `Node "${node.id}" references handler "${event.handlerKey}" which is not registered`,
+            { nodeId: node.id }
+          );
+        }
+      }
+      if (node.type === "page" && node.parent?.type !== "application") {
+        dc.error(
+          "GRAPH_PAGE_DEPTH",
+          `Page node "${node.id}" must be a direct child of the application root`,
+          { nodeId: node.id }
+        );
+      }
+    });
+    return dc;
+  }
+  // ── Serialization ─────────────────────────────────────────────────────────
+  serialize() {
+    return {
+      name: this.name,
+      version: this.version,
+      root: this._serializeNode(this.root)
+    };
+  }
+  _serializeNode(node) {
+    const result = {
+      id: node.id,
+      type: node.type,
+      key: node.key,
+      props: node.props,
+      events: node.events,
+      stateRefs: node.stateRefs,
+      children: node.children.map((c) => this._serializeNode(c))
+    };
+    return result;
+  }
+};
+export {
+  ApplicationGraph,
+  GraphNode
+};
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/graph-node.ts","../src/graph.ts"],"sourcesContent":["/**\n * Semantic Application Graph nodes.\n *\n * Every element in a StreetUI application is represented as a GraphNode.\n * Nodes form a tree: each has an optional parent and an ordered list of children.\n */\n\nimport { generateNodeId, type NodeId, type SemanticNodeType } from '@streetui/core';\n\n// ── Property values ───────────────────────────────────────────────────────────\n\nexport type PropValue =\n  | string\n  | number\n  | boolean\n  | null\n  | undefined\n  | string[]\n  | number[]\n  | Record<string, unknown>;\n\nexport type Props = Record<string, PropValue>;\n\n// ── Event descriptors ─────────────────────────────────────────────────────────\n\nexport interface EventDescriptor {\n  readonly type: string;\n  /** Reference key into the application's handler registry. */\n  readonly handlerKey: string;\n}\n\n// ── State references ──────────────────────────────────────────────────────────\n\nexport interface StateRef {\n  /** ID of the signal/store this node's property is bound to. */\n  readonly signalId: string;\n  /** The prop key on this node that is bound. */\n  readonly propKey: string;\n}\n\n// ── The core graph node ───────────────────────────────────────────────────────\n\nexport interface GraphNodeData {\n  readonly id: NodeId;\n  readonly type: SemanticNodeType;\n  readonly key: string | undefined;\n  props: Props;\n  events: EventDescriptor[];\n  stateRefs: StateRef[];\n  children: GraphNode[];\n  parent: GraphNode | null;\n}\n\nexport class GraphNode implements GraphNodeData {\n  readonly id: NodeId;\n  readonly type: SemanticNodeType;\n  readonly key: string | undefined;\n  props: Props;\n  events: EventDescriptor[];\n  stateRefs: StateRef[];\n  children: GraphNode[];\n  parent: GraphNode | null;\n\n  constructor(\n    type: SemanticNodeType,\n    options: {\n      id?: NodeId;\n      key?: string;\n      props?: Props;\n      events?: EventDescriptor[];\n      stateRefs?: StateRef[];\n    } = {},\n  ) {\n    this.type = type;\n    this.id = options.id ?? generateNodeId(type);\n    this.key = options.key;\n    this.props = options.props ?? {};\n    this.events = options.events ?? [];\n    this.stateRefs = options.stateRefs ?? [];\n    this.children = [];\n    this.parent = null;\n  }\n\n  // ── Child management ────────────────────────────────────────────────────────\n\n  appendChild(child: GraphNode): void {\n    if (child.parent !== null) {\n      child.parent.removeChild(child);\n    }\n    child.parent = this;\n    this.children.push(child);\n  }\n\n  insertBefore(child: GraphNode, reference: GraphNode): void {\n    const idx = this.children.indexOf(reference);\n    if (idx === -1) {\n      this.appendChild(child);\n      return;\n    }\n    if (child.parent !== null) {\n      child.parent.removeChild(child);\n    }\n    child.parent = this;\n    this.children.splice(idx, 0, child);\n  }\n\n  removeChild(child: GraphNode): void {\n    const idx = this.children.indexOf(child);\n    if (idx === -1) return;\n    this.children.splice(idx, 1);\n    child.parent = null;\n  }\n\n  replaceChild(newChild: GraphNode, oldChild: GraphNode): void {\n    const idx = this.children.indexOf(oldChild);\n    if (idx === -1) {\n      throw new Error(`GraphNode.replaceChild: oldChild is not a child of this node`);\n    }\n    if (newChild.parent !== null) {\n      newChild.parent.removeChild(newChild);\n    }\n    oldChild.parent = null;\n    newChild.parent = this;\n    this.children.splice(idx, 1, newChild);\n  }\n\n  // ── Prop helpers ────────────────────────────────────────────────────────────\n\n  setProp(key: string, value: PropValue): void {\n    this.props = { ...this.props, [key]: value };\n  }\n\n  getProp<T extends PropValue = PropValue>(key: string): T | undefined {\n    return this.props[key] as T | undefined;\n  }\n\n  // ── Event helpers ───────────────────────────────────────────────────────────\n\n  addEvent(descriptor: EventDescriptor): void {\n    this.events.push(descriptor);\n  }\n\n  removeEvent(type: string): void {\n    this.events = this.events.filter(e => e.type !== type);\n  }\n\n  // ── Queries ─────────────────────────────────────────────────────────────────\n\n  get isLeaf(): boolean {\n    return this.children.length === 0;\n  }\n\n  get depth(): number {\n    let d = 0;\n    let node: GraphNode | null = this.parent;\n    while (node !== null) {\n      d++;\n      node = node.parent;\n    }\n    return d;\n  }\n\n  get root(): GraphNode {\n    // eslint-disable-next-line @typescript-eslint/no-this-alias\n    let node: GraphNode = this;\n    while (node.parent !== null) {\n      node = node.parent;\n    }\n    return node;\n  }\n\n  /** Shallow clone — does not clone children. */\n  shallowClone(): GraphNode {\n    const opts: { key?: string; props: Props; events: EventDescriptor[]; stateRefs: StateRef[] } = {\n      props: { ...this.props },\n      events: [...this.events],\n      stateRefs: [...this.stateRefs],\n    };\n    if (this.key !== undefined) opts.key = this.key;\n    return new GraphNode(this.type, opts);\n  }\n}\n","/**\n * The Semantic Application Graph.\n *\n * Holds the application root node and all its descendants.\n * Supports traversal, lookup by ID, validation, and serialization.\n */\n\nimport { type NodeId, DiagnosticCollector } from '@streetui/core';\nimport { GraphNode, type Props, type EventDescriptor } from './graph-node.js';\n\nexport interface ApplicationGraphOptions {\n  readonly name: string;\n  readonly version?: string;\n}\n\nexport interface HandlerFn {\n  (...args: unknown[]): unknown;\n}\n\nexport class ApplicationGraph {\n  readonly root: GraphNode;\n  readonly name: string;\n  readonly version: string;\n  private readonly _nodeIndex: Map<NodeId, GraphNode> = new Map();\n  /** Handler registry — maps handlerKey → actual function */\n  readonly handlers: Map<string, HandlerFn> = new Map();\n\n  constructor(options: ApplicationGraphOptions) {\n    this.name = options.name;\n    this.version = options.version ?? '0.0.1';\n    this.root = new GraphNode('application', { props: { name: options.name } });\n    this._nodeIndex.set(this.root.id, this.root);\n  }\n\n  // ── Node creation & attachment ────────────────────────────────────────────\n\n  createNode(\n    type: GraphNode['type'],\n    options: { key?: string; props?: Props; parent?: GraphNode } = {},\n  ): GraphNode {\n    const nodeOpts: { key?: string; props?: Props } = {};\n    if (options.key !== undefined) nodeOpts.key = options.key;\n    if (options.props !== undefined) nodeOpts.props = options.props;\n    const node = new GraphNode(type, nodeOpts);\n    this._nodeIndex.set(node.id, node);\n    if (options.parent !== undefined) {\n      options.parent.appendChild(node);\n    }\n    return node;\n  }\n\n  attachNode(node: GraphNode, parent: GraphNode): void {\n    this._nodeIndex.set(node.id, node);\n    parent.appendChild(node);\n  }\n\n  detachNode(node: GraphNode): void {\n    if (node.parent !== null) {\n      node.parent.removeChild(node);\n    }\n    this._removeFromIndex(node);\n  }\n\n  private _removeFromIndex(node: GraphNode): void {\n    this._nodeIndex.delete(node.id);\n    this._unregisterNodeHandlers(node);\n    for (const child of node.children) {\n      this._removeFromIndex(child);\n    }\n  }\n\n  /**\n   * Remove every handler-registry entry owned by a single node. A node owns:\n   *  - one entry per event descriptor (its `handlerKey`),\n   *  - one `__signal__<signalId>` entry per state ref (signalIds are namespaced\n   *    by node id, so they are never shared between nodes), and\n   *  - a `__listbuild__<id>` entry if it is a reactive-list.\n   * Called for every node in a detached subtree so removing list items (or\n   * discarding freshly-built-but-unadopted item subtrees) leaves no stale\n   * registrations behind.\n   */\n  private _unregisterNodeHandlers(node: GraphNode): void {\n    for (const event of node.events) {\n      this.handlers.delete(event.handlerKey);\n    }\n    for (const ref of node.stateRefs) {\n      this.handlers.delete(`__signal__${ref.signalId}`);\n    }\n    this.handlers.delete(`__listbuild__${node.id}`);\n  }\n\n  // ── Handler registry ──────────────────────────────────────────────────────\n\n  registerHandler(key: string, fn: HandlerFn): void {\n    this.handlers.set(key, fn);\n  }\n\n  getHandler(key: string): HandlerFn | undefined {\n    return this.handlers.get(key);\n  }\n\n  /** True if a handler is currently registered under `key`. Inspection helper. */\n  hasHandler(key: string): boolean {\n    return this.handlers.has(key);\n  }\n\n  /** Number of currently-registered handlers. Inspection helper. */\n  get handlerCount(): number {\n    return this.handlers.size;\n  }\n\n  // ── Lookup ────────────────────────────────────────────────────────────────\n\n  findById(id: NodeId): GraphNode | undefined {\n    return this._nodeIndex.get(id);\n  }\n\n  findAll(predicate: (node: GraphNode) => boolean): GraphNode[] {\n    const results: GraphNode[] = [];\n    this._walk(this.root, node => {\n      if (predicate(node)) results.push(node);\n    });\n    return results;\n  }\n\n  findByType(type: GraphNode['type']): GraphNode[] {\n    return this.findAll(n => n.type === type);\n  }\n\n  // ── Traversal ─────────────────────────────────────────────────────────────\n\n  walk(visitor: (node: GraphNode, depth: number) => void): void {\n    this._walk(this.root, visitor, 0);\n  }\n\n  private _walk(\n    node: GraphNode,\n    visitor: (node: GraphNode, depth: number) => void,\n    depth: number = 0,\n  ): void {\n    visitor(node, depth);\n    for (const child of node.children) {\n      this._walk(child, visitor, depth + 1);\n    }\n  }\n\n  get nodeCount(): number {\n    return this._nodeIndex.size;\n  }\n\n  // ── Validation ────────────────────────────────────────────────────────────\n\n  validate(): DiagnosticCollector {\n    const dc = new DiagnosticCollector();\n\n    this.walk((node) => {\n      // Validate event handler references exist\n      for (const event of node.events) {\n        if (!this.handlers.has(event.handlerKey)) {\n          dc.warn(\n            'GRAPH_MISSING_HANDLER',\n            `Node \"${node.id}\" references handler \"${event.handlerKey}\" which is not registered`,\n            { nodeId: node.id },\n          );\n        }\n      }\n\n      // Validate page nodes are direct children of root\n      if (node.type === 'page' && node.parent?.type !== 'application') {\n        dc.error(\n          'GRAPH_PAGE_DEPTH',\n          `Page node \"${node.id}\" must be a direct child of the application root`,\n          { nodeId: node.id },\n        );\n      }\n    });\n\n    return dc;\n  }\n\n  // ── Serialization ─────────────────────────────────────────────────────────\n\n  serialize(): SerializedGraph {\n    return {\n      name: this.name,\n      version: this.version,\n      root: this._serializeNode(this.root),\n    };\n  }\n\n  private _serializeNode(node: GraphNode): SerializedNode {\n    const result: SerializedNode = {\n      id: node.id,\n      type: node.type,\n      key: node.key,\n      props: node.props,\n      events: node.events,\n      stateRefs: node.stateRefs,\n      children: node.children.map(c => this._serializeNode(c)),\n    };\n    return result;\n  }\n}\n\nexport interface SerializedNode {\n  readonly id: string;\n  readonly type: string;\n  readonly key: string | undefined;\n  readonly props: Props;\n  readonly events: EventDescriptor[];\n  readonly stateRefs: unknown[];\n  readonly children: SerializedNode[];\n}\n\nexport interface SerializedGraph {\n  readonly name: string;\n  readonly version: string;\n  readonly root: SerializedNode;\n}\n"],"mappings":";AAOA,SAAS,sBAA0D;AA8C5D,IAAM,YAAN,MAAM,WAAmC;AAAA,EACrC;AAAA,EACA;AAAA,EACA;AAAA,EACT;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAEA,YACE,MACA,UAMI,CAAC,GACL;AACA,SAAK,OAAO;AACZ,SAAK,KAAK,QAAQ,MAAM,eAAe,IAAI;AAC3C,SAAK,MAAM,QAAQ;AACnB,SAAK,QAAQ,QAAQ,SAAS,CAAC;AAC/B,SAAK,SAAS,QAAQ,UAAU,CAAC;AACjC,SAAK,YAAY,QAAQ,aAAa,CAAC;AACvC,SAAK,WAAW,CAAC;AACjB,SAAK,SAAS;AAAA,EAChB;AAAA;AAAA,EAIA,YAAY,OAAwB;AAClC,QAAI,MAAM,WAAW,MAAM;AACzB,YAAM,OAAO,YAAY,KAAK;AAAA,IAChC;AACA,UAAM,SAAS;AACf,SAAK,SAAS,KAAK,KAAK;AAAA,EAC1B;AAAA,EAEA,aAAa,OAAkB,WAA4B;AACzD,UAAM,MAAM,KAAK,SAAS,QAAQ,SAAS;AAC3C,QAAI,QAAQ,IAAI;AACd,WAAK,YAAY,KAAK;AACtB;AAAA,IACF;AACA,QAAI,MAAM,WAAW,MAAM;AACzB,YAAM,OAAO,YAAY,KAAK;AAAA,IAChC;AACA,UAAM,SAAS;AACf,SAAK,SAAS,OAAO,KAAK,GAAG,KAAK;AAAA,EACpC;AAAA,EAEA,YAAY,OAAwB;AAClC,UAAM,MAAM,KAAK,SAAS,QAAQ,KAAK;AACvC,QAAI,QAAQ,GAAI;AAChB,SAAK,SAAS,OAAO,KAAK,CAAC;AAC3B,UAAM,SAAS;AAAA,EACjB;AAAA,EAEA,aAAa,UAAqB,UAA2B;AAC3D,UAAM,MAAM,KAAK,SAAS,QAAQ,QAAQ;AAC1C,QAAI,QAAQ,IAAI;AACd,YAAM,IAAI,MAAM,8DAA8D;AAAA,IAChF;AACA,QAAI,SAAS,WAAW,MAAM;AAC5B,eAAS,OAAO,YAAY,QAAQ;AAAA,IACtC;AACA,aAAS,SAAS;AAClB,aAAS,SAAS;AAClB,SAAK,SAAS,OAAO,KAAK,GAAG,QAAQ;AAAA,EACvC;AAAA;AAAA,EAIA,QAAQ,KAAa,OAAwB;AAC3C,SAAK,QAAQ,EAAE,GAAG,KAAK,OAAO,CAAC,GAAG,GAAG,MAAM;AAAA,EAC7C;AAAA,EAEA,QAAyC,KAA4B;AACnE,WAAO,KAAK,MAAM,GAAG;AAAA,EACvB;AAAA;AAAA,EAIA,SAAS,YAAmC;AAC1C,SAAK,OAAO,KAAK,UAAU;AAAA,EAC7B;AAAA,EAEA,YAAY,MAAoB;AAC9B,SAAK,SAAS,KAAK,OAAO,OAAO,OAAK,EAAE,SAAS,IAAI;AAAA,EACvD;AAAA;AAAA,EAIA,IAAI,SAAkB;AACpB,WAAO,KAAK,SAAS,WAAW;AAAA,EAClC;AAAA,EAEA,IAAI,QAAgB;AAClB,QAAI,IAAI;AACR,QAAI,OAAyB,KAAK;AAClC,WAAO,SAAS,MAAM;AACpB;AACA,aAAO,KAAK;AAAA,IACd;AACA,WAAO;AAAA,EACT;AAAA,EAEA,IAAI,OAAkB;AAEpB,QAAI,OAAkB;AACtB,WAAO,KAAK,WAAW,MAAM;AAC3B,aAAO,KAAK;AAAA,IACd;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,eAA0B;AACxB,UAAM,OAAyF;AAAA,MAC7F,OAAO,EAAE,GAAG,KAAK,MAAM;AAAA,MACvB,QAAQ,CAAC,GAAG,KAAK,MAAM;AAAA,MACvB,WAAW,CAAC,GAAG,KAAK,SAAS;AAAA,IAC/B;AACA,QAAI,KAAK,QAAQ,OAAW,MAAK,MAAM,KAAK;AAC5C,WAAO,IAAI,WAAU,KAAK,MAAM,IAAI;AAAA,EACtC;AACF;;;AC9KA,SAAsB,2BAA2B;AAY1C,IAAM,mBAAN,MAAuB;AAAA,EACnB;AAAA,EACA;AAAA,EACA;AAAA,EACQ,aAAqC,oBAAI,IAAI;AAAA;AAAA,EAErD,WAAmC,oBAAI,IAAI;AAAA,EAEpD,YAAY,SAAkC;AAC5C,SAAK,OAAO,QAAQ;AACpB,SAAK,UAAU,QAAQ,WAAW;AAClC,SAAK,OAAO,IAAI,UAAU,eAAe,EAAE,OAAO,EAAE,MAAM,QAAQ,KAAK,EAAE,CAAC;AAC1E,SAAK,WAAW,IAAI,KAAK,KAAK,IAAI,KAAK,IAAI;AAAA,EAC7C;AAAA;AAAA,EAIA,WACE,MACA,UAA+D,CAAC,GACrD;AACX,UAAM,WAA4C,CAAC;AACnD,QAAI,QAAQ,QAAQ,OAAW,UAAS,MAAM,QAAQ;AACtD,QAAI,QAAQ,UAAU,OAAW,UAAS,QAAQ,QAAQ;AAC1D,UAAM,OAAO,IAAI,UAAU,MAAM,QAAQ;AACzC,SAAK,WAAW,IAAI,KAAK,IAAI,IAAI;AACjC,QAAI,QAAQ,WAAW,QAAW;AAChC,cAAQ,OAAO,YAAY,IAAI;AAAA,IACjC;AACA,WAAO;AAAA,EACT;AAAA,EAEA,WAAW,MAAiB,QAAyB;AACnD,SAAK,WAAW,IAAI,KAAK,IAAI,IAAI;AACjC,WAAO,YAAY,IAAI;AAAA,EACzB;AAAA,EAEA,WAAW,MAAuB;AAChC,QAAI,KAAK,WAAW,MAAM;AACxB,WAAK,OAAO,YAAY,IAAI;AAAA,IAC9B;AACA,SAAK,iBAAiB,IAAI;AAAA,EAC5B;AAAA,EAEQ,iBAAiB,MAAuB;AAC9C,SAAK,WAAW,OAAO,KAAK,EAAE;AAC9B,SAAK,wBAAwB,IAAI;AACjC,eAAW,SAAS,KAAK,UAAU;AACjC,WAAK,iBAAiB,KAAK;AAAA,IAC7B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYQ,wBAAwB,MAAuB;AACrD,eAAW,SAAS,KAAK,QAAQ;AAC/B,WAAK,SAAS,OAAO,MAAM,UAAU;AAAA,IACvC;AACA,eAAW,OAAO,KAAK,WAAW;AAChC,WAAK,SAAS,OAAO,aAAa,IAAI,QAAQ,EAAE;AAAA,IAClD;AACA,SAAK,SAAS,OAAO,gBAAgB,KAAK,EAAE,EAAE;AAAA,EAChD;AAAA;AAAA,EAIA,gBAAgB,KAAa,IAAqB;AAChD,SAAK,SAAS,IAAI,KAAK,EAAE;AAAA,EAC3B;AAAA,EAEA,WAAW,KAAoC;AAC7C,WAAO,KAAK,SAAS,IAAI,GAAG;AAAA,EAC9B;AAAA;AAAA,EAGA,WAAW,KAAsB;AAC/B,WAAO,KAAK,SAAS,IAAI,GAAG;AAAA,EAC9B;AAAA;AAAA,EAGA,IAAI,eAAuB;AACzB,WAAO,KAAK,SAAS;AAAA,EACvB;AAAA;AAAA,EAIA,SAAS,IAAmC;AAC1C,WAAO,KAAK,WAAW,IAAI,EAAE;AAAA,EAC/B;AAAA,EAEA,QAAQ,WAAsD;AAC5D,UAAM,UAAuB,CAAC;AAC9B,SAAK,MAAM,KAAK,MAAM,UAAQ;AAC5B,UAAI,UAAU,IAAI,EAAG,SAAQ,KAAK,IAAI;AAAA,IACxC,CAAC;AACD,WAAO;AAAA,EACT;AAAA,EAEA,WAAW,MAAsC;AAC/C,WAAO,KAAK,QAAQ,OAAK,EAAE,SAAS,IAAI;AAAA,EAC1C;AAAA;AAAA,EAIA,KAAK,SAAyD;AAC5D,SAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAAA,EAClC;AAAA,EAEQ,MACN,MACA,SACA,QAAgB,GACV;AACN,YAAQ,MAAM,KAAK;AACnB,eAAW,SAAS,KAAK,UAAU;AACjC,WAAK,MAAM,OAAO,SAAS,QAAQ,CAAC;AAAA,IACtC;AAAA,EACF;AAAA,EAEA,IAAI,YAAoB;AACtB,WAAO,KAAK,WAAW;AAAA,EACzB;AAAA;AAAA,EAIA,WAAgC;AAC9B,UAAM,KAAK,IAAI,oBAAoB;AAEnC,SAAK,KAAK,CAAC,SAAS;AAElB,iBAAW,SAAS,KAAK,QAAQ;AAC/B,YAAI,CAAC,KAAK,SAAS,IAAI,MAAM,UAAU,GAAG;AACxC,aAAG;AAAA,YACD;AAAA,YACA,SAAS,KAAK,EAAE,yBAAyB,MAAM,UAAU;AAAA,YACzD,EAAE,QAAQ,KAAK,GAAG;AAAA,UACpB;AAAA,QACF;AAAA,MACF;AAGA,UAAI,KAAK,SAAS,UAAU,KAAK,QAAQ,SAAS,eAAe;AAC/D,WAAG;AAAA,UACD;AAAA,UACA,cAAc,KAAK,EAAE;AAAA,UACrB,EAAE,QAAQ,KAAK,GAAG;AAAA,QACpB;AAAA,MACF;AAAA,IACF,CAAC;AAED,WAAO;AAAA,EACT;AAAA;AAAA,EAIA,YAA6B;AAC3B,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX,SAAS,KAAK;AAAA,MACd,MAAM,KAAK,eAAe,KAAK,IAAI;AAAA,IACrC;AAAA,EACF;AAAA,EAEQ,eAAe,MAAiC;AACtD,UAAM,SAAyB;AAAA,MAC7B,IAAI,KAAK;AAAA,MACT,MAAM,KAAK;AAAA,MACX,KAAK,KAAK;AAAA,MACV,OAAO,KAAK;AAAA,MACZ,QAAQ,KAAK;AAAA,MACb,WAAW,KAAK;AAAA,MAChB,UAAU,KAAK,SAAS,IAAI,OAAK,KAAK,eAAe,CAAC,CAAC;AAAA,IACzD;AACA,WAAO;AAAA,EACT;AACF;","names":[]}

package/package.json

@@ -0,0 +1,45 @@
+{
+  "name": "@streetui/graph",
+  "version": "1.0.0",
+  "description": "StreetUI Semantic Application Graph — nodes, relationships, traversal, validation",
+  "type": "module",
+  "main": "./dist/index.cjs",
+  "module": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "exports": {
+    ".": {
+      "import": {
+        "types": "./dist/index.d.ts",
+        "default": "./dist/index.js"
+      },
+      "require": {
+        "types": "./dist/index.d.cts",
+        "default": "./dist/index.cjs"
+      }
+    }
+  },
+  "scripts": {
+    "build": "tsup",
+    "typecheck": "tsc --noEmit",
+    "test": "vitest run",
+    "clean": "rm -rf dist"
+  },
+  "dependencies": {
+    "@streetui/core": "1.0.0"
+  },
+  "devDependencies": {
+    "typescript": "*",
+    "tsup": "*",
+    "vitest": "*"
+  },
+  "license": "MIT",
+  "sideEffects": false,
+  "publishConfig": {
+    "access": "public"
+  },
+  "files": [
+    "dist",
+    "README.md",
+    "LICENSE"
+  ]
+}