@stuly/anode 0.1.0 → 0.1.2

package/dist/core/history.d.ts

@@ -1,6 +1,11 @@
 import { LinkKind, SocketKind } from "./elements.js";
 
 //#region src/core/history.d.ts
+/**
+ * Defines all possible atomic mutations that can be recorded in history.
+ * Each action includes the data necessary to both execute ('do')
+ * and revert ('undo') the change.
+ */
 type HistoryAction = {
   type: 'MOVE_ENTITY';
   id: number;
@@ -110,21 +115,41 @@ type HistoryAction = {
   type: 'FROM_JSON';
   data: any;
 };
+/**
+ * A single transaction in the history stack, potentially containing
+ * multiple atomic actions (if recorded via a batch).
+ */
 interface Command {
+  /** Array of actions to perform during 'redo'. */
   do: HistoryAction[];
+  /** Array of actions to perform during 'undo'. */
   undo: HistoryAction[];
+  /** A human-readable label for the transaction. */
   label?: string;
+  /** ISO timestamp of when the command was recorded. */
   timestamp: number;
 }
+/**
+ * Manages the undo/redo stacks for the Anode Context.
+ * Tracks discrete mutations and provides serialization for session persistence.
+ */
 declare class HistoryManager {
+  /** The stack of commands that can be undone. */
   undoStack: Command[];
+  /** The stack of commands that can be reapplied (cleared on new mutation). */
   redoStack: Command[];
   private maxHistory;
+  /**
+   * Pushes a new command to the undo stack.
+   * Clears the redo stack to prevent branch divergence.
+   */
   push(command: Command): void;
+  /** Serializes the history stack for persistence. */
   toJSON(): {
     undoStack: Command[];
     redoStack: Command[];
   };
+  /** Restores the history stack from a serialized object. */
   fromJSON(data: any): void;
 }
 //#endregion

package/dist/core/history.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"history.d.ts","names":[],"sources":["../../src/core/history.ts"],"mappings":";;;KAEY,aAAA;EAEN,IAAA;EACA,EAAA;EACA,IAAA;IAAQ,CAAA;IAAW,CAAA;EAAA;EACnB,EAAA;IAAM,CAAA;IAAW,CAAA;EAAA;AAAA;EAEjB,IAAA;EAAoB,EAAA;EAAY,IAAA;IAAQ,CAAA;IAAW,CAAA;EAAA;EAAa,EAAA;IAAM,CAAA;IAAW,CAAA;EAAA;AAAA;EAEjF,IAAA;EACA,EAAA;EACA,KAAA;EACA,QAAA;IAAY,CAAA;IAAW,CAAA;EAAA;EACvB,QAAA;AAAA;EAGA,IAAA;EACA,EAAA;EACA,KAAA;EACA,QAAA;IAAY,CAAA;IAAW,CAAA;EAAA;EACvB,QAAA;AAAA;EAGA,IAAA;EACA,EAAA;EACA,IAAA;EACA,EAAA;EACA,IAAA,EAAM,QAAA;EACN,KAAA;AAAA;EAGA,IAAA;EACA,EAAA;EACA,IAAA;EACA,EAAA;EACA,IAAA,EAAM,QAAA;EACN,KAAA;AAAA;EAGA,IAAA;EACA,EAAA;EACA,IAAA;IAAQ,GAAA;IAAa,GAAA;EAAA;EACrB,EAAA;IAAM,GAAA;IAAa,GAAA;EAAA;EACnB,SAAA;IAAc,GAAA;MAAO,CAAA;MAAW,CAAA;IAAA;IAAe,GAAA;MAAO,CAAA;MAAW,CAAA;IAAA;EAAA;AAAA;EAEjE,IAAA;EAAsB,OAAA;EAAiB,QAAA;EAAkB,WAAA;AAAA;EACzD,IAAA;EAA2B,OAAA;EAAiB,QAAA;EAAkB,WAAA;AAAA;EAE9D,IAAA;EACA,EAAA;EACA,QAAA;EACA,IAAA,EAAM,UAAA;EACN,IAAA;EACA,MAAA;IAAU,CAAA;IAAW,CAAA;EAAA;AAAA;EAGrB,IAAA;EACA,EAAA;EACA,QAAA;EACA,IAAA,EAAM,UAAA;EACN,IAAA;EACA,MAAA;IAAU,CAAA;IAAW,CAAA;EAAA;AAAA;EAErB,IAAA;EAAmB,IAAA;AAAA;AAAA,UAER,OAAA;EACf,EAAA,EAAI,aAAA;EACJ,IAAA,EAAM,aAAA;EACN,KAAA;EACA,SAAA;AAAA;AAAA,cAGW,cAAA;EACX,SAAA,EAAW,OAAA;EACX,SAAA,EAAW,OAAA;EAAA,QACH,UAAA;EAER,IAAA,CAAK,OAAA,EAAS,OAAA;EAQd,MAAA,CAAA;;;;EAOA,QAAA,CAAS,IAAA;AAAA"}
+{"version":3,"file":"history.d.ts","names":[],"sources":["../../src/core/history.ts"],"mappings":";;;;;AAOA;;;KAAY,aAAA;EAEN,IAAA;EACA,EAAA;EACA,IAAA;IAAQ,CAAA;IAAW,CAAA;EAAA;EACnB,EAAA;IAAM,CAAA;IAAW,CAAA;EAAA;AAAA;EAEjB,IAAA;EAAoB,EAAA;EAAY,IAAA;IAAQ,CAAA;IAAW,CAAA;EAAA;EAAa,EAAA;IAAM,CAAA;IAAW,CAAA;EAAA;AAAA;EAEjF,IAAA;EACA,EAAA;EACA,KAAA;EACA,QAAA;IAAY,CAAA;IAAW,CAAA;EAAA;EACvB,QAAA;AAAA;EAGA,IAAA;EACA,EAAA;EACA,KAAA;EACA,QAAA;IAAY,CAAA;IAAW,CAAA;EAAA;EACvB,QAAA;AAAA;EAGA,IAAA;EACA,EAAA;EACA,IAAA;EACA,EAAA;EACA,IAAA,EAAM,QAAA;EACN,KAAA;AAAA;EAGA,IAAA;EACA,EAAA;EACA,IAAA;EACA,EAAA;EACA,IAAA,EAAM,QAAA;EACN,KAAA;AAAA;EAGA,IAAA;EACA,EAAA;EACA,IAAA;IAAQ,GAAA;IAAa,GAAA;EAAA;EACrB,EAAA;IAAM,GAAA;IAAa,GAAA;EAAA;EACnB,SAAA;IAAc,GAAA;MAAO,CAAA;MAAW,CAAA;IAAA;IAAe,GAAA;MAAO,CAAA;MAAW,CAAA;IAAA;EAAA;AAAA;EAEjE,IAAA;EAAsB,OAAA;EAAiB,QAAA;EAAkB,WAAA;AAAA;EACzD,IAAA;EAA2B,OAAA;EAAiB,QAAA;EAAkB,WAAA;AAAA;EAE9D,IAAA;EACA,EAAA;EACA,QAAA;EACA,IAAA,EAAM,UAAA;EACN,IAAA;EACA,MAAA;IAAU,CAAA;IAAW,CAAA;EAAA;AAAA;EAGrB,IAAA;EACA,EAAA;EACA,QAAA;EACA,IAAA,EAAM,UAAA;EACN,IAAA;EACA,MAAA;IAAU,CAAA;IAAW,CAAA;EAAA;AAAA;EAErB,IAAA;EAAmB,IAAA;AAAA;;;;;UAMR,OAAA;;EAEf,EAAA,EAAI,aAAA;;EAEJ,IAAA,EAAM,aAAA;EAaK;EAXX,KAAA;EAaW;EAXX,SAAA;AAAA;;;;;cAOW,cAAA;;EAEX,SAAA,EAAW,OAAA;EA0BX;EAxBA,SAAA,EAAW,OAAA;EAAA,QACH,UAAA;EAuBU;;;;EAjBlB,IAAA,CAAK,OAAA,EAAS,OAAA;;EASd,MAAA,CAAA;;;;;EAQA,QAAA,CAAS,IAAA;AAAA"}

package/dist/core/history.js

@@ -1,19 +1,31 @@
 //#region src/core/history.ts
+/**
+* Manages the undo/redo stacks for the Anode Context.
+* Tracks discrete mutations and provides serialization for session persistence.
+*/
 var HistoryManager = class {
+	/** The stack of commands that can be undone. */
 	undoStack = [];
+	/** The stack of commands that can be reapplied (cleared on new mutation). */
 	redoStack = [];
 	maxHistory = 100;
+	/**
+	* Pushes a new command to the undo stack.
+	* Clears the redo stack to prevent branch divergence.
+	*/
 	push(command) {
 		this.undoStack.push(command);
 		this.redoStack = [];
 		if (this.undoStack.length > this.maxHistory) this.undoStack.shift();
 	}
+	/** Serializes the history stack for persistence. */
 	toJSON() {
 		return {
 			undoStack: this.undoStack,
 			redoStack: this.redoStack
 		};
 	}
+	/** Restores the history stack from a serialized object. */
 	fromJSON(data) {
 		this.undoStack = data.undoStack || [];
 		this.redoStack = data.redoStack || [];

package/dist/core/history.js.map

@@ -1 +1 @@
-{"version":3,"file":"history.js","names":[],"sources":["../../src/core/history.ts"],"sourcesContent":["import { LinkKind, SocketKind } from './elements';\n\nexport type HistoryAction =\n  | {\n      type: 'MOVE_ENTITY';\n      id: number;\n      from: { x: number; y: number };\n      to: { x: number; y: number };\n    }\n  | { type: 'MOVE_GROUP'; id: number; from: { x: number; y: number }; to: { x: number; y: number } }\n  | {\n      type: 'CREATE_ENTITY';\n      id: number;\n      inner: any;\n      position: { x: number; y: number };\n      parentId: number | null;\n    }\n  | {\n      type: 'DROP_ENTITY';\n      id: number;\n      inner: any;\n      position: { x: number; y: number };\n      parentId: number | null;\n    }\n  | {\n      type: 'CREATE_LINK';\n      id: number;\n      from: number;\n      to: number;\n      kind: LinkKind;\n      inner?: any;\n    }\n  | {\n      type: 'DROP_LINK';\n      id: number;\n      from: number;\n      to: number;\n      kind: LinkKind;\n      inner?: any;\n    }\n  | {\n      type: 'UPDATE_LINK';\n      id: number;\n      from: { old: number; new: number };\n      to: { old: number; new: number };\n      waypoints?: { old: { x: number; y: number }[]; new: { x: number; y: number }[] };\n    }\n  | { type: 'ADD_TO_GROUP'; groupId: number; entityId: number; oldParentId: number | null }\n  | { type: 'REMOVE_FROM_GROUP'; groupId: number; entityId: number; oldParentId: number | null }\n  | {\n      type: 'CREATE_SOCKET';\n      id: number;\n      entityId: number;\n      kind: SocketKind;\n      name: string;\n      offset: { x: number; y: number };\n    }\n  | {\n      type: 'DROP_SOCKET';\n      id: number;\n      entityId: number;\n      kind: SocketKind;\n      name: string;\n      offset: { x: number; y: number };\n    }\n  | { type: 'FROM_JSON'; data: any };\n\nexport interface Command {\n  do: HistoryAction[];\n  undo: HistoryAction[];\n  label?: string;\n  timestamp: number;\n}\n\nexport class HistoryManager {\n  undoStack: Command[] = [];\n  redoStack: Command[] = [];\n  private maxHistory: number = 100;\n\n  push(command: Command) {\n    this.undoStack.push(command);\n    this.redoStack = [];\n    if (this.undoStack.length > this.maxHistory) {\n      this.undoStack.shift();\n    }\n  }\n\n  toJSON() {\n    return {\n      undoStack: this.undoStack,\n      redoStack: this.redoStack\n    };\n  }\n\n  fromJSON(data: any) {\n    this.undoStack = data.undoStack || [];\n    this.redoStack = data.redoStack || [];\n  }\n}\n"],"mappings":";AA0EA,IAAa,iBAAb,MAA4B;CAC1B,YAAuB,EAAE;CACzB,YAAuB,EAAE;CACzB,AAAQ,aAAqB;CAE7B,KAAK,SAAkB;AACrB,OAAK,UAAU,KAAK,QAAQ;AAC5B,OAAK,YAAY,EAAE;AACnB,MAAI,KAAK,UAAU,SAAS,KAAK,WAC/B,MAAK,UAAU,OAAO;;CAI1B,SAAS;AACP,SAAO;GACL,WAAW,KAAK;GAChB,WAAW,KAAK;GACjB;;CAGH,SAAS,MAAW;AAClB,OAAK,YAAY,KAAK,aAAa,EAAE;AACrC,OAAK,YAAY,KAAK,aAAa,EAAE"}
+{"version":3,"file":"history.js","names":[],"sources":["../../src/core/history.ts"],"sourcesContent":["import { LinkKind, SocketKind } from './elements';\n\n/**\n * Defines all possible atomic mutations that can be recorded in history.\n * Each action includes the data necessary to both execute ('do')\n * and revert ('undo') the change.\n */\nexport type HistoryAction =\n  | {\n      type: 'MOVE_ENTITY';\n      id: number;\n      from: { x: number; y: number };\n      to: { x: number; y: number };\n    }\n  | { type: 'MOVE_GROUP'; id: number; from: { x: number; y: number }; to: { x: number; y: number } }\n  | {\n      type: 'CREATE_ENTITY';\n      id: number;\n      inner: any;\n      position: { x: number; y: number };\n      parentId: number | null;\n    }\n  | {\n      type: 'DROP_ENTITY';\n      id: number;\n      inner: any;\n      position: { x: number; y: number };\n      parentId: number | null;\n    }\n  | {\n      type: 'CREATE_LINK';\n      id: number;\n      from: number;\n      to: number;\n      kind: LinkKind;\n      inner?: any;\n    }\n  | {\n      type: 'DROP_LINK';\n      id: number;\n      from: number;\n      to: number;\n      kind: LinkKind;\n      inner?: any;\n    }\n  | {\n      type: 'UPDATE_LINK';\n      id: number;\n      from: { old: number; new: number };\n      to: { old: number; new: number };\n      waypoints?: { old: { x: number; y: number }[]; new: { x: number; y: number }[] };\n    }\n  | { type: 'ADD_TO_GROUP'; groupId: number; entityId: number; oldParentId: number | null }\n  | { type: 'REMOVE_FROM_GROUP'; groupId: number; entityId: number; oldParentId: number | null }\n  | {\n      type: 'CREATE_SOCKET';\n      id: number;\n      entityId: number;\n      kind: SocketKind;\n      name: string;\n      offset: { x: number; y: number };\n    }\n  | {\n      type: 'DROP_SOCKET';\n      id: number;\n      entityId: number;\n      kind: SocketKind;\n      name: string;\n      offset: { x: number; y: number };\n    }\n  | { type: 'FROM_JSON'; data: any };\n\n/**\n * A single transaction in the history stack, potentially containing\n * multiple atomic actions (if recorded via a batch).\n */\nexport interface Command {\n  /** Array of actions to perform during 'redo'. */\n  do: HistoryAction[];\n  /** Array of actions to perform during 'undo'. */\n  undo: HistoryAction[];\n  /** A human-readable label for the transaction. */\n  label?: string;\n  /** ISO timestamp of when the command was recorded. */\n  timestamp: number;\n}\n\n/**\n * Manages the undo/redo stacks for the Anode Context.\n * Tracks discrete mutations and provides serialization for session persistence.\n */\nexport class HistoryManager {\n  /** The stack of commands that can be undone. */\n  undoStack: Command[] = [];\n  /** The stack of commands that can be reapplied (cleared on new mutation). */\n  redoStack: Command[] = [];\n  private maxHistory: number = 100;\n\n  /**\n   * Pushes a new command to the undo stack.\n   * Clears the redo stack to prevent branch divergence.\n   */\n  push(command: Command) {\n    this.undoStack.push(command);\n    this.redoStack = [];\n    if (this.undoStack.length > this.maxHistory) {\n      this.undoStack.shift();\n    }\n  }\n\n  /** Serializes the history stack for persistence. */\n  toJSON() {\n    return {\n      undoStack: this.undoStack,\n      redoStack: this.redoStack\n    };\n  }\n\n  /** Restores the history stack from a serialized object. */\n  fromJSON(data: any) {\n    this.undoStack = data.undoStack || [];\n    this.redoStack = data.redoStack || [];\n  }\n}\n"],"mappings":";;;;;AA2FA,IAAa,iBAAb,MAA4B;;CAE1B,YAAuB,EAAE;;CAEzB,YAAuB,EAAE;CACzB,AAAQ,aAAqB;;;;;CAM7B,KAAK,SAAkB;AACrB,OAAK,UAAU,KAAK,QAAQ;AAC5B,OAAK,YAAY,EAAE;AACnB,MAAI,KAAK,UAAU,SAAS,KAAK,WAC/B,MAAK,UAAU,OAAO;;;CAK1B,SAAS;AACP,SAAO;GACL,WAAW,KAAK;GAChB,WAAW,KAAK;GACjB;;;CAIH,SAAS,MAAW;AAClB,OAAK,YAAY,KAAK,aAAa,EAAE;AACrC,OAAK,YAAY,KAAK,aAAa,EAAE"}

package/dist/core/layout.d.ts

@@ -2,21 +2,41 @@ import { Link, Vec2 } from "./elements.js";
 import { Context } from "./context.js";
 
 //#region src/core/layout.d.ts
+/**
+ * Calculates the start and end world coordinates for a link's path.
+ * Resolves entity and parent group positions to get absolute coordinates.
+ */
 declare function getLinkPoints(ctx: Context, link: Link): {
   from: Vec2;
   to: Vec2;
 } | null;
+/**
+ * Calculates the visual center point of a link.
+ * Used for positioning labels or custom UI overlays.
+ */
 declare function getLinkCenter(ctx: Context, link: Link): Vec2 | null;
+/**
+ * Generates an SVG path string for a link based on its `kind` and `waypoints`.
+ */
 declare function getLinkPath(ctx: Context, link: Link): string | null;
+/**
+ * Represents a rectangular boundary for spatial indexing and queries.
+ */
 declare class Rect {
   x: number;
   y: number;
   w: number;
   h: number;
   constructor(x: number, y: number, w: number, h: number);
+  /** Returns true if the given point is inside the rectangle. */
   contains(point: Vec2): boolean;
+  /** Returns true if this rectangle intersects with another rectangle. */
   intersects(range: Rect): boolean;
 }
+/**
+ * A QuadTree implementation for high-performance spatial indexing.
+ * Used by Anode to perform spatial culling and optimized entity selection.
+ */
 declare class QuadTree<T> {
   boundary: Rect;
   private capacity;
@@ -27,9 +47,17 @@ declare class QuadTree<T> {
   private southwest;
   private southeast;
   constructor(boundary: Rect);
+  /** Internal: Subdivides the node into four quadrants. */
   subdivide(): void;
+  /** Inserts a data point at a specific coordinate into the tree. */
   insert(pos: Vec2, data: T): boolean;
+  /**
+   * Recursively queries the tree for all data points within the given range.
+   * @param range The Rect boundary to search within.
+   * @param found Optional array to collect results.
+   */
   query(range: Rect, found?: T[]): T[];
+  /** Clears all points and children from the tree. */
   clear(): void;
 }
 //#endregion

package/dist/core/layout.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"layout.d.ts","names":[],"sources":["../../src/core/layout.ts"],"mappings":";;;;iBAGgB,aAAA,CAAc,GAAA,EAAK,OAAA,EAAS,IAAA,EAAM,IAAA;EAAS,IAAA,EAAM,IAAA;EAAM,EAAA,EAAI,IAAA;AAAA;AAAA,iBAsB3D,aAAA,CAAc,GAAA,EAAK,OAAA,EAAS,IAAA,EAAM,IAAA,GAAO,IAAA;AAAA,iBAczC,WAAA,CAAY,GAAA,EAAK,OAAA,EAAS,IAAA,EAAM,IAAA;AAAA,cAsEnC,IAAA;EAEF,CAAA;EACA,CAAA;EACA,CAAA;EACA,CAAA;cAHA,CAAA,UACA,CAAA,UACA,CAAA,UACA,CAAA;EAGT,QAAA,CAAS,KAAA,EAAO,IAAA;EAShB,UAAA,CAAW,KAAA,EAAO,IAAA;AAAA;AAAA,cAUP,QAAA;EAUQ,QAAA,EAAU,IAAA;EAAA,QATrB,QAAA;EAAA,QACA,MAAA;EAAA,QACA,OAAA;EAAA,QAEA,SAAA;EAAA,QACA,SAAA;EAAA,QACA,SAAA;EAAA,QACA,SAAA;cAEW,QAAA,EAAU,IAAA;EAE7B,SAAA,CAAA;EAeA,MAAA,CAAO,GAAA,EAAK,IAAA,EAAM,IAAA,EAAM,CAAA;EAsBxB,KAAA,CAAM,KAAA,EAAO,IAAA,EAAM,KAAA,GAAO,CAAA,KAAW,CAAA;EAqBrC,KAAA,CAAA;AAAA"}
+{"version":3,"file":"layout.d.ts","names":[],"sources":["../../src/core/layout.ts"],"mappings":";;;;;;AAOA;;iBAAgB,aAAA,CAAc,GAAA,EAAK,OAAA,EAAS,IAAA,EAAM,IAAA;EAAS,IAAA,EAAM,IAAA;EAAM,EAAA,EAAI,IAAA;AAAA;;;;;iBA0B3D,aAAA,CAAc,GAAA,EAAK,OAAA,EAAS,IAAA,EAAM,IAAA,GAAO,IAAA;;;;iBAiBzC,WAAA,CAAY,GAAA,EAAK,OAAA,EAAS,IAAA,EAAM,IAAA;;;;cAwEnC,IAAA;EAEF,CAAA;EACA,CAAA;EACA,CAAA;EACA,CAAA;cAHA,CAAA,UACA,CAAA,UACA,CAAA,UACA,CAAA;EA9F8C;EAkGvD,QAAA,CAAS,KAAA,EAAO,IAAA;EAlG2C;EA4G3D,UAAA,CAAW,KAAA,EAAO,IAAA;AAAA;;;;;cAcP,QAAA;EAUQ,QAAA,EAAU,IAAA;EAAA,QATrB,QAAA;EAAA,QACA,MAAA;EAAA,QACA,OAAA;EAAA,QAEA,SAAA;EAAA,QACA,SAAA;EAAA,QACA,SAAA;EAAA,QACA,SAAA;cAEW,QAAA,EAAU,IAAA;EAnHqB;EAsHlD,SAAA,CAAA;EA9Ce;EA8Df,MAAA,CAAO,GAAA,EAAK,IAAA,EAAM,IAAA,EAAM,CAAA;EA3CF;;;;;EAsEtB,KAAA,CAAM,KAAA,EAAO,IAAA,EAAM,KAAA,GAAO,CAAA,KAAW,CAAA;EAvF5B;EA6GT,KAAA,CAAA;AAAA"}

package/dist/core/layout.js

@@ -1,6 +1,10 @@
 import { LinkKind, Vec2 } from "./elements.js";
 
 //#region src/core/layout.ts
+/**
+* Calculates the start and end world coordinates for a link's path.
+* Resolves entity and parent group positions to get absolute coordinates.
+*/
 function getLinkPoints(ctx, link) {
 	const fromSocket = ctx.sockets.get(link.from);
 	const toSocket = ctx.sockets.get(link.to);
@@ -15,6 +19,10 @@ function getLinkPoints(ctx, link) {
 		to: new Vec2(toWorldPos.x + toSocket.offset.x, toWorldPos.y + toSocket.offset.y)
 	};
 }
+/**
+* Calculates the visual center point of a link.
+* Used for positioning labels or custom UI overlays.
+*/
 function getLinkCenter(ctx, link) {
 	const pts = getLinkPoints(ctx, link);
 	if (!pts) return null;
@@ -29,6 +37,9 @@ function getLinkCenter(ctx, link) {
 	const p2 = points[midIndex + 1];
 	return new Vec2((p1.x + p2.x) / 2, (p1.y + p2.y) / 2);
 }
+/**
+* Generates an SVG path string for a link based on its `kind` and `waypoints`.
+*/
 function getLinkPath(ctx, link) {
 	const pts = getLinkPoints(ctx, link);
 	if (!pts) return null;
@@ -82,6 +93,9 @@ function getLinkPath(ctx, link) {
 	}
 	return null;
 }
+/**
+* Represents a rectangular boundary for spatial indexing and queries.
+*/
 var Rect = class {
 	constructor(x, y, w, h) {
 		this.x = x;
@@ -89,13 +103,19 @@ var Rect = class {
 		this.w = w;
 		this.h = h;
 	}
+	/** Returns true if the given point is inside the rectangle. */
 	contains(point) {
 		return point.x >= this.x && point.x <= this.x + this.w && point.y >= this.y && point.y <= this.y + this.h;
 	}
+	/** Returns true if this rectangle intersects with another rectangle. */
 	intersects(range) {
 		return !(range.x > this.x + this.w || range.x + range.w < this.x || range.y > this.y + this.h || range.y + range.h < this.y);
 	}
 };
+/**
+* A QuadTree implementation for high-performance spatial indexing.
+* Used by Anode to perform spatial culling and optimized entity selection.
+*/
 var QuadTree = class QuadTree {
 	capacity = 4;
 	points = [];
@@ -107,6 +127,7 @@ var QuadTree = class QuadTree {
 	constructor(boundary) {
 		this.boundary = boundary;
 	}
+	/** Internal: Subdivides the node into four quadrants. */
 	subdivide() {
 		const { x, y, w, h } = this.boundary;
 		const nw = new Rect(x, y, w / 2, h / 2);
@@ -119,6 +140,7 @@ var QuadTree = class QuadTree {
 		this.southeast = new QuadTree(se);
 		this.divided = true;
 	}
+	/** Inserts a data point at a specific coordinate into the tree. */
 	insert(pos, data) {
 		if (!this.boundary.contains(pos)) return false;
 		if (this.points.length < this.capacity) {
@@ -131,6 +153,11 @@ var QuadTree = class QuadTree {
 		if (!this.divided) this.subdivide();
 		return this.northwest.insert(pos, data) || this.northeast.insert(pos, data) || this.southwest.insert(pos, data) || this.southeast.insert(pos, data);
 	}
+	/**
+	* Recursively queries the tree for all data points within the given range.
+	* @param range The Rect boundary to search within.
+	* @param found Optional array to collect results.
+	*/
 	query(range, found = []) {
 		if (!this.boundary.intersects(range)) return found;
 		for (const p of this.points) if (range.contains(p.pos)) found.push(p.data);
@@ -142,6 +169,7 @@ var QuadTree = class QuadTree {
 		}
 		return found;
 	}
+	/** Clears all points and children from the tree. */
 	clear() {
 		this.points = [];
 		this.divided = false;

package/dist/core/layout.js.map

@@ -1 +1 @@
-{"version":3,"file":"layout.js","names":[],"sources":["../../src/core/layout.ts"],"sourcesContent":["import { Context } from './context';\nimport { Link, Vec2, LinkKind } from './elements';\n\nexport function getLinkPoints(ctx: Context, link: Link): { from: Vec2; to: Vec2 } | null {\n  const fromSocket = ctx.sockets.get(link.from);\n  const toSocket = ctx.sockets.get(link.to);\n\n  if (!fromSocket || !toSocket) {\n    return null;\n  }\n\n  const fromEntity = ctx.entities.get(fromSocket.entityId);\n  const toEntity = ctx.entities.get(toSocket.entityId);\n\n  if (!fromEntity || !toEntity) return null;\n\n  const fromWorldPos = ctx.getWorldPosition(fromEntity.id);\n  const toWorldPos = ctx.getWorldPosition(toEntity.id);\n\n  return {\n    from: new Vec2(fromWorldPos.x + fromSocket.offset.x, fromWorldPos.y + fromSocket.offset.y),\n    to: new Vec2(toWorldPos.x + toSocket.offset.x, toWorldPos.y + toSocket.offset.y)\n  };\n}\n\nexport function getLinkCenter(ctx: Context, link: Link): Vec2 | null {\n  const pts = getLinkPoints(ctx, link);\n  if (!pts) return null;\n\n  const points = [pts.from, ...link.waypoints, pts.to];\n  if (points.length < 2) return null;\n\n  const midIndex = Math.floor((points.length - 1) / 2);\n  const p1 = points[midIndex]!;\n  const p2 = points[midIndex + 1]!;\n\n  return new Vec2((p1.x + p2.x) / 2, (p1.y + p2.y) / 2);\n}\n\nexport function getLinkPath(ctx: Context, link: Link): string | null {\n  const pts = getLinkPoints(ctx, link);\n  if (!pts) return null;\n\n  const { from: fromPos, to: toPos } = pts;\n  const points = [fromPos, ...link.waypoints, toPos];\n\n  if (link.kind === LinkKind.LINE) {\n    return points.map((p, i) => `${i === 0 ? 'M' : 'L'} ${p.x} ${p.y}`).join(' ');\n  }\n\n  if (link.kind === LinkKind.BEZIER) {\n    if (points.length === 2) {\n      const p1 = points[0]!;\n      const p2 = points[1]!;\n      const dx = Math.abs(p1.x - p2.x);\n      const offset = Math.max(dx / 2, 50);\n      return `M ${p1.x} ${p1.y} C ${p1.x + offset} ${p1.y}, ${p2.x - offset} ${p2.y}, ${p2.x} ${p2.y}`;\n    }\n\n    let path = `M ${points[0]!.x} ${points[0]!.y}`;\n    for (let i = 0; i < points.length - 1; i++) {\n      const p1 = points[i]!;\n      const p2 = points[i + 1]!;\n      const dx = Math.abs(p1.x - p2.x);\n      const offset = Math.max(dx / 2, 20);\n      path += ` C ${p1.x + offset} ${p1.y}, ${p2.x - offset} ${p2.y}, ${p2.x} ${p2.y}`;\n    }\n    return path;\n  }\n\n  if (link.kind === LinkKind.STEP || link.kind === LinkKind.SMOOTH_STEP) {\n    let path = `M ${points[0]!.x} ${points[0]!.y}`;\n    const isSmooth = link.kind === LinkKind.SMOOTH_STEP;\n    const borderRadius = 10;\n\n    for (let i = 0; i < points.length - 1; i++) {\n      const p1 = points[i]!;\n      const p2 = points[i + 1]!;\n      const midX = (p1.x + p2.x) / 2;\n\n      if (!isSmooth) {\n        path += ` L ${midX} ${p1.y} L ${midX} ${p2.y} L ${p2.x} ${p2.y}`;\n      } else {\n        const signX = p2.x > p1.x ? 1 : -1;\n        const signY = p2.y > p1.y ? 1 : -1;\n        const actualBorder = Math.min(\n          borderRadius,\n          Math.abs(p1.x - p2.x) / 2,\n          Math.abs(p1.y - p2.y) / 2\n        );\n\n        if (actualBorder < 1) {\n          // Points are aligned, draw a straight line for this segment\n          path += ` L ${p2.x} ${p2.y}`;\n        } else {\n          path += ` L ${midX - actualBorder * signX} ${p1.y} \n                    Q ${midX} ${p1.y} ${midX} ${p1.y + actualBorder * signY}\n                    L ${midX} ${p2.y - actualBorder * signY}\n                    Q ${midX} ${p2.y} ${midX + actualBorder * signX} ${p2.y}\n                    L ${p2.x} ${p2.y}`;\n        }\n      }\n    }\n    return path;\n  }\n\n  return null;\n}\n\nexport class Rect {\n  constructor(\n    public x: number,\n    public y: number,\n    public w: number,\n    public h: number\n  ) {}\n\n  contains(point: Vec2) {\n    return (\n      point.x >= this.x &&\n      point.x <= this.x + this.w &&\n      point.y >= this.y &&\n      point.y <= this.y + this.h\n    );\n  }\n\n  intersects(range: Rect) {\n    return !(\n      range.x > this.x + this.w ||\n      range.x + range.w < this.x ||\n      range.y > this.y + this.h ||\n      range.y + range.h < this.y\n    );\n  }\n}\n\nexport class QuadTree<T> {\n  private capacity: number = 4;\n  private points: { pos: Vec2; data: T }[] = [];\n  private divided: boolean = false;\n\n  private northwest: QuadTree<T> | null = null;\n  private northeast: QuadTree<T> | null = null;\n  private southwest: QuadTree<T> | null = null;\n  private southeast: QuadTree<T> | null = null;\n\n  constructor(public boundary: Rect) {}\n\n  subdivide() {\n    const { x, y, w, h } = this.boundary;\n    const nw = new Rect(x, y, w / 2, h / 2);\n    const ne = new Rect(x + w / 2, y, w / 2, h / 2);\n    const sw = new Rect(x, y + h / 2, w / 2, h / 2);\n    const se = new Rect(x + w / 2, y + h / 2, w / 2, h / 2);\n\n    this.northwest = new QuadTree<T>(nw);\n    this.northeast = new QuadTree<T>(ne);\n    this.southwest = new QuadTree<T>(sw);\n    this.southeast = new QuadTree<T>(se);\n\n    this.divided = true;\n  }\n\n  insert(pos: Vec2, data: T): boolean {\n    if (!this.boundary.contains(pos)) {\n      return false;\n    }\n\n    if (this.points.length < this.capacity) {\n      this.points.push({ pos, data });\n      return true;\n    }\n\n    if (!this.divided) {\n      this.subdivide();\n    }\n\n    return (\n      this.northwest!.insert(pos, data) ||\n      this.northeast!.insert(pos, data) ||\n      this.southwest!.insert(pos, data) ||\n      this.southeast!.insert(pos, data)\n    );\n  }\n\n  query(range: Rect, found: T[] = []): T[] {\n    if (!this.boundary.intersects(range)) {\n      return found;\n    }\n\n    for (const p of this.points) {\n      if (range.contains(p.pos)) {\n        found.push(p.data);\n      }\n    }\n\n    if (this.divided) {\n      this.northwest!.query(range, found);\n      this.northeast!.query(range, found);\n      this.southwest!.query(range, found);\n      this.southeast!.query(range, found);\n    }\n\n    return found;\n  }\n\n  clear() {\n    this.points = [];\n    this.divided = false;\n    this.northwest = null;\n    this.northeast = null;\n    this.southwest = null;\n    this.southeast = null;\n  }\n}\n"],"mappings":";;;AAGA,SAAgB,cAAc,KAAc,MAA6C;CACvF,MAAM,aAAa,IAAI,QAAQ,IAAI,KAAK,KAAK;CAC7C,MAAM,WAAW,IAAI,QAAQ,IAAI,KAAK,GAAG;AAEzC,KAAI,CAAC,cAAc,CAAC,SAClB,QAAO;CAGT,MAAM,aAAa,IAAI,SAAS,IAAI,WAAW,SAAS;CACxD,MAAM,WAAW,IAAI,SAAS,IAAI,SAAS,SAAS;AAEpD,KAAI,CAAC,cAAc,CAAC,SAAU,QAAO;CAErC,MAAM,eAAe,IAAI,iBAAiB,WAAW,GAAG;CACxD,MAAM,aAAa,IAAI,iBAAiB,SAAS,GAAG;AAEpD,QAAO;EACL,MAAM,IAAI,KAAK,aAAa,IAAI,WAAW,OAAO,GAAG,aAAa,IAAI,WAAW,OAAO,EAAE;EAC1F,IAAI,IAAI,KAAK,WAAW,IAAI,SAAS,OAAO,GAAG,WAAW,IAAI,SAAS,OAAO,EAAE;EACjF;;AAGH,SAAgB,cAAc,KAAc,MAAyB;CACnE,MAAM,MAAM,cAAc,KAAK,KAAK;AACpC,KAAI,CAAC,IAAK,QAAO;CAEjB,MAAM,SAAS;EAAC,IAAI;EAAM,GAAG,KAAK;EAAW,IAAI;EAAG;AACpD,KAAI,OAAO,SAAS,EAAG,QAAO;CAE9B,MAAM,WAAW,KAAK,OAAO,OAAO,SAAS,KAAK,EAAE;CACpD,MAAM,KAAK,OAAO;CAClB,MAAM,KAAK,OAAO,WAAW;AAE7B,QAAO,IAAI,MAAM,GAAG,IAAI,GAAG,KAAK,IAAI,GAAG,IAAI,GAAG,KAAK,EAAE;;AAGvD,SAAgB,YAAY,KAAc,MAA2B;CACnE,MAAM,MAAM,cAAc,KAAK,KAAK;AACpC,KAAI,CAAC,IAAK,QAAO;CAEjB,MAAM,EAAE,MAAM,SAAS,IAAI,UAAU;CACrC,MAAM,SAAS;EAAC;EAAS,GAAG,KAAK;EAAW;EAAM;AAElD,KAAI,KAAK,SAAS,SAAS,KACzB,QAAO,OAAO,KAAK,GAAG,MAAM,GAAG,MAAM,IAAI,MAAM,IAAI,GAAG,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,KAAK,IAAI;AAG/E,KAAI,KAAK,SAAS,SAAS,QAAQ;AACjC,MAAI,OAAO,WAAW,GAAG;GACvB,MAAM,KAAK,OAAO;GAClB,MAAM,KAAK,OAAO;GAClB,MAAM,KAAK,KAAK,IAAI,GAAG,IAAI,GAAG,EAAE;GAChC,MAAM,SAAS,KAAK,IAAI,KAAK,GAAG,GAAG;AACnC,UAAO,KAAK,GAAG,EAAE,GAAG,GAAG,EAAE,KAAK,GAAG,IAAI,OAAO,GAAG,GAAG,EAAE,IAAI,GAAG,IAAI,OAAO,GAAG,GAAG,EAAE,IAAI,GAAG,EAAE,GAAG,GAAG;;EAG/F,IAAI,OAAO,KAAK,OAAO,GAAI,EAAE,GAAG,OAAO,GAAI;AAC3C,OAAK,IAAI,IAAI,GAAG,IAAI,OAAO,SAAS,GAAG,KAAK;GAC1C,MAAM,KAAK,OAAO;GAClB,MAAM,KAAK,OAAO,IAAI;GACtB,MAAM,KAAK,KAAK,IAAI,GAAG,IAAI,GAAG,EAAE;GAChC,MAAM,SAAS,KAAK,IAAI,KAAK,GAAG,GAAG;AACnC,WAAQ,MAAM,GAAG,IAAI,OAAO,GAAG,GAAG,EAAE,IAAI,GAAG,IAAI,OAAO,GAAG,GAAG,EAAE,IAAI,GAAG,EAAE,GAAG,GAAG;;AAE/E,SAAO;;AAGT,KAAI,KAAK,SAAS,SAAS,QAAQ,KAAK,SAAS,SAAS,aAAa;EACrE,IAAI,OAAO,KAAK,OAAO,GAAI,EAAE,GAAG,OAAO,GAAI;EAC3C,MAAM,WAAW,KAAK,SAAS,SAAS;EACxC,MAAM,eAAe;AAErB,OAAK,IAAI,IAAI,GAAG,IAAI,OAAO,SAAS,GAAG,KAAK;GAC1C,MAAM,KAAK,OAAO;GAClB,MAAM,KAAK,OAAO,IAAI;GACtB,MAAM,QAAQ,GAAG,IAAI,GAAG,KAAK;AAE7B,OAAI,CAAC,SACH,SAAQ,MAAM,KAAK,GAAG,GAAG,EAAE,KAAK,KAAK,GAAG,GAAG,EAAE,KAAK,GAAG,EAAE,GAAG,GAAG;QACxD;IACL,MAAM,QAAQ,GAAG,IAAI,GAAG,IAAI,IAAI;IAChC,MAAM,QAAQ,GAAG,IAAI,GAAG,IAAI,IAAI;IAChC,MAAM,eAAe,KAAK,IACxB,cACA,KAAK,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG,GACxB,KAAK,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG,EACzB;AAED,QAAI,eAAe,EAEjB,SAAQ,MAAM,GAAG,EAAE,GAAG,GAAG;QAEzB,SAAQ,MAAM,OAAO,eAAe,MAAM,GAAG,GAAG,EAAE;wBACpC,KAAK,GAAG,GAAG,EAAE,GAAG,KAAK,GAAG,GAAG,IAAI,eAAe,MAAM;wBACpD,KAAK,GAAG,GAAG,IAAI,eAAe,MAAM;wBACpC,KAAK,GAAG,GAAG,EAAE,GAAG,OAAO,eAAe,MAAM,GAAG,GAAG,EAAE;wBACpD,GAAG,EAAE,GAAG,GAAG;;;AAI/B,SAAO;;AAGT,QAAO;;AAGT,IAAa,OAAb,MAAkB;CAChB,YACE,AAAO,GACP,AAAO,GACP,AAAO,GACP,AAAO,GACP;EAJO;EACA;EACA;EACA;;CAGT,SAAS,OAAa;AACpB,SACE,MAAM,KAAK,KAAK,KAChB,MAAM,KAAK,KAAK,IAAI,KAAK,KACzB,MAAM,KAAK,KAAK,KAChB,MAAM,KAAK,KAAK,IAAI,KAAK;;CAI7B,WAAW,OAAa;AACtB,SAAO,EACL,MAAM,IAAI,KAAK,IAAI,KAAK,KACxB,MAAM,IAAI,MAAM,IAAI,KAAK,KACzB,MAAM,IAAI,KAAK,IAAI,KAAK,KACxB,MAAM,IAAI,MAAM,IAAI,KAAK;;;AAK/B,IAAa,WAAb,MAAa,SAAY;CACvB,AAAQ,WAAmB;CAC3B,AAAQ,SAAmC,EAAE;CAC7C,AAAQ,UAAmB;CAE3B,AAAQ,YAAgC;CACxC,AAAQ,YAAgC;CACxC,AAAQ,YAAgC;CACxC,AAAQ,YAAgC;CAExC,YAAY,AAAO,UAAgB;EAAhB;;CAEnB,YAAY;EACV,MAAM,EAAE,GAAG,GAAG,GAAG,MAAM,KAAK;EAC5B,MAAM,KAAK,IAAI,KAAK,GAAG,GAAG,IAAI,GAAG,IAAI,EAAE;EACvC,MAAM,KAAK,IAAI,KAAK,IAAI,IAAI,GAAG,GAAG,IAAI,GAAG,IAAI,EAAE;EAC/C,MAAM,KAAK,IAAI,KAAK,GAAG,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,EAAE;EAC/C,MAAM,KAAK,IAAI,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,EAAE;AAEvD,OAAK,YAAY,IAAI,SAAY,GAAG;AACpC,OAAK,YAAY,IAAI,SAAY,GAAG;AACpC,OAAK,YAAY,IAAI,SAAY,GAAG;AACpC,OAAK,YAAY,IAAI,SAAY,GAAG;AAEpC,OAAK,UAAU;;CAGjB,OAAO,KAAW,MAAkB;AAClC,MAAI,CAAC,KAAK,SAAS,SAAS,IAAI,CAC9B,QAAO;AAGT,MAAI,KAAK,OAAO,SAAS,KAAK,UAAU;AACtC,QAAK,OAAO,KAAK;IAAE;IAAK;IAAM,CAAC;AAC/B,UAAO;;AAGT,MAAI,CAAC,KAAK,QACR,MAAK,WAAW;AAGlB,SACE,KAAK,UAAW,OAAO,KAAK,KAAK,IACjC,KAAK,UAAW,OAAO,KAAK,KAAK,IACjC,KAAK,UAAW,OAAO,KAAK,KAAK,IACjC,KAAK,UAAW,OAAO,KAAK,KAAK;;CAIrC,MAAM,OAAa,QAAa,EAAE,EAAO;AACvC,MAAI,CAAC,KAAK,SAAS,WAAW,MAAM,CAClC,QAAO;AAGT,OAAK,MAAM,KAAK,KAAK,OACnB,KAAI,MAAM,SAAS,EAAE,IAAI,CACvB,OAAM,KAAK,EAAE,KAAK;AAItB,MAAI,KAAK,SAAS;AAChB,QAAK,UAAW,MAAM,OAAO,MAAM;AACnC,QAAK,UAAW,MAAM,OAAO,MAAM;AACnC,QAAK,UAAW,MAAM,OAAO,MAAM;AACnC,QAAK,UAAW,MAAM,OAAO,MAAM;;AAGrC,SAAO;;CAGT,QAAQ;AACN,OAAK,SAAS,EAAE;AAChB,OAAK,UAAU;AACf,OAAK,YAAY;AACjB,OAAK,YAAY;AACjB,OAAK,YAAY;AACjB,OAAK,YAAY"}
+{"version":3,"file":"layout.js","names":[],"sources":["../../src/core/layout.ts"],"sourcesContent":["import { Context } from './context';\nimport { Link, Vec2, LinkKind } from './elements';\n\n/**\n * Calculates the start and end world coordinates for a link's path.\n * Resolves entity and parent group positions to get absolute coordinates.\n */\nexport function getLinkPoints(ctx: Context, link: Link): { from: Vec2; to: Vec2 } | null {\n  const fromSocket = ctx.sockets.get(link.from);\n  const toSocket = ctx.sockets.get(link.to);\n\n  if (!fromSocket || !toSocket) {\n    return null;\n  }\n\n  const fromEntity = ctx.entities.get(fromSocket.entityId);\n  const toEntity = ctx.entities.get(toSocket.entityId);\n\n  if (!fromEntity || !toEntity) return null;\n\n  const fromWorldPos = ctx.getWorldPosition(fromEntity.id);\n  const toWorldPos = ctx.getWorldPosition(toEntity.id);\n\n  return {\n    from: new Vec2(fromWorldPos.x + fromSocket.offset.x, fromWorldPos.y + fromSocket.offset.y),\n    to: new Vec2(toWorldPos.x + toSocket.offset.x, toWorldPos.y + toSocket.offset.y)\n  };\n}\n\n/**\n * Calculates the visual center point of a link.\n * Used for positioning labels or custom UI overlays.\n */\nexport function getLinkCenter(ctx: Context, link: Link): Vec2 | null {\n  const pts = getLinkPoints(ctx, link);\n  if (!pts) return null;\n\n  const points = [pts.from, ...link.waypoints, pts.to];\n  if (points.length < 2) return null;\n\n  const midIndex = Math.floor((points.length - 1) / 2);\n  const p1 = points[midIndex]!;\n  const p2 = points[midIndex + 1]!;\n\n  return new Vec2((p1.x + p2.x) / 2, (p1.y + p2.y) / 2);\n}\n\n/**\n * Generates an SVG path string for a link based on its `kind` and `waypoints`.\n */\nexport function getLinkPath(ctx: Context, link: Link): string | null {\n  const pts = getLinkPoints(ctx, link);\n  if (!pts) return null;\n\n  const { from: fromPos, to: toPos } = pts;\n  const points = [fromPos, ...link.waypoints, toPos];\n\n  if (link.kind === LinkKind.LINE) {\n    return points.map((p, i) => `${i === 0 ? 'M' : 'L'} ${p.x} ${p.y}`).join(' ');\n  }\n\n  if (link.kind === LinkKind.BEZIER) {\n    if (points.length === 2) {\n      const p1 = points[0]!;\n      const p2 = points[1]!;\n      const dx = Math.abs(p1.x - p2.x);\n      const offset = Math.max(dx / 2, 50);\n      return `M ${p1.x} ${p1.y} C ${p1.x + offset} ${p1.y}, ${p2.x - offset} ${p2.y}, ${p2.x} ${p2.y}`;\n    }\n\n    let path = `M ${points[0]!.x} ${points[0]!.y}`;\n    for (let i = 0; i < points.length - 1; i++) {\n      const p1 = points[i]!;\n      const p2 = points[i + 1]!;\n      const dx = Math.abs(p1.x - p2.x);\n      const offset = Math.max(dx / 2, 20);\n      path += ` C ${p1.x + offset} ${p1.y}, ${p2.x - offset} ${p2.y}, ${p2.x} ${p2.y}`;\n    }\n    return path;\n  }\n\n  if (link.kind === LinkKind.STEP || link.kind === LinkKind.SMOOTH_STEP) {\n    let path = `M ${points[0]!.x} ${points[0]!.y}`;\n    const isSmooth = link.kind === LinkKind.SMOOTH_STEP;\n    const borderRadius = 10;\n\n    for (let i = 0; i < points.length - 1; i++) {\n      const p1 = points[i]!;\n      const p2 = points[i + 1]!;\n      const midX = (p1.x + p2.x) / 2;\n\n      if (!isSmooth) {\n        path += ` L ${midX} ${p1.y} L ${midX} ${p2.y} L ${p2.x} ${p2.y}`;\n      } else {\n        const signX = p2.x > p1.x ? 1 : -1;\n        const signY = p2.y > p1.y ? 1 : -1;\n        const actualBorder = Math.min(\n          borderRadius,\n          Math.abs(p1.x - p2.x) / 2,\n          Math.abs(p1.y - p2.y) / 2\n        );\n\n        if (actualBorder < 1) {\n          path += ` L ${p2.x} ${p2.y}`;\n        } else {\n          path += ` L ${midX - actualBorder * signX} ${p1.y} \n                    Q ${midX} ${p1.y} ${midX} ${p1.y + actualBorder * signY}\n                    L ${midX} ${p2.y - actualBorder * signY}\n                    Q ${midX} ${p2.y} ${midX + actualBorder * signX} ${p2.y}\n                    L ${p2.x} ${p2.y}`;\n        }\n      }\n    }\n    return path;\n  }\n\n  return null;\n}\n\n/**\n * Represents a rectangular boundary for spatial indexing and queries.\n */\nexport class Rect {\n  constructor(\n    public x: number,\n    public y: number,\n    public w: number,\n    public h: number\n  ) {}\n\n  /** Returns true if the given point is inside the rectangle. */\n  contains(point: Vec2) {\n    return (\n      point.x >= this.x &&\n      point.x <= this.x + this.w &&\n      point.y >= this.y &&\n      point.y <= this.y + this.h\n    );\n  }\n\n  /** Returns true if this rectangle intersects with another rectangle. */\n  intersects(range: Rect) {\n    return !(\n      range.x > this.x + this.w ||\n      range.x + range.w < this.x ||\n      range.y > this.y + this.h ||\n      range.y + range.h < this.y\n    );\n  }\n}\n\n/**\n * A QuadTree implementation for high-performance spatial indexing.\n * Used by Anode to perform spatial culling and optimized entity selection.\n */\nexport class QuadTree<T> {\n  private capacity: number = 4;\n  private points: { pos: Vec2; data: T }[] = [];\n  private divided: boolean = false;\n\n  private northwest: QuadTree<T> | null = null;\n  private northeast: QuadTree<T> | null = null;\n  private southwest: QuadTree<T> | null = null;\n  private southeast: QuadTree<T> | null = null;\n\n  constructor(public boundary: Rect) {}\n\n  /** Internal: Subdivides the node into four quadrants. */\n  subdivide() {\n    const { x, y, w, h } = this.boundary;\n    const nw = new Rect(x, y, w / 2, h / 2);\n    const ne = new Rect(x + w / 2, y, w / 2, h / 2);\n    const sw = new Rect(x, y + h / 2, w / 2, h / 2);\n    const se = new Rect(x + w / 2, y + h / 2, w / 2, h / 2);\n\n    this.northwest = new QuadTree<T>(nw);\n    this.northeast = new QuadTree<T>(ne);\n    this.southwest = new QuadTree<T>(sw);\n    this.southeast = new QuadTree<T>(se);\n\n    this.divided = true;\n  }\n\n  /** Inserts a data point at a specific coordinate into the tree. */\n  insert(pos: Vec2, data: T): boolean {\n    if (!this.boundary.contains(pos)) {\n      return false;\n    }\n\n    if (this.points.length < this.capacity) {\n      this.points.push({ pos, data });\n      return true;\n    }\n\n    if (!this.divided) {\n      this.subdivide();\n    }\n\n    return (\n      this.northwest!.insert(pos, data) ||\n      this.northeast!.insert(pos, data) ||\n      this.southwest!.insert(pos, data) ||\n      this.southeast!.insert(pos, data)\n    );\n  }\n\n  /**\n   * Recursively queries the tree for all data points within the given range.\n   * @param range The Rect boundary to search within.\n   * @param found Optional array to collect results.\n   */\n  query(range: Rect, found: T[] = []): T[] {\n    if (!this.boundary.intersects(range)) {\n      return found;\n    }\n\n    for (const p of this.points) {\n      if (range.contains(p.pos)) {\n        found.push(p.data);\n      }\n    }\n\n    if (this.divided) {\n      this.northwest!.query(range, found);\n      this.northeast!.query(range, found);\n      this.southwest!.query(range, found);\n      this.southeast!.query(range, found);\n    }\n\n    return found;\n  }\n\n  /** Clears all points and children from the tree. */\n  clear() {\n    this.points = [];\n    this.divided = false;\n    this.northwest = null;\n    this.northeast = null;\n    this.southwest = null;\n    this.southeast = null;\n  }\n}\n"],"mappings":";;;;;;;AAOA,SAAgB,cAAc,KAAc,MAA6C;CACvF,MAAM,aAAa,IAAI,QAAQ,IAAI,KAAK,KAAK;CAC7C,MAAM,WAAW,IAAI,QAAQ,IAAI,KAAK,GAAG;AAEzC,KAAI,CAAC,cAAc,CAAC,SAClB,QAAO;CAGT,MAAM,aAAa,IAAI,SAAS,IAAI,WAAW,SAAS;CACxD,MAAM,WAAW,IAAI,SAAS,IAAI,SAAS,SAAS;AAEpD,KAAI,CAAC,cAAc,CAAC,SAAU,QAAO;CAErC,MAAM,eAAe,IAAI,iBAAiB,WAAW,GAAG;CACxD,MAAM,aAAa,IAAI,iBAAiB,SAAS,GAAG;AAEpD,QAAO;EACL,MAAM,IAAI,KAAK,aAAa,IAAI,WAAW,OAAO,GAAG,aAAa,IAAI,WAAW,OAAO,EAAE;EAC1F,IAAI,IAAI,KAAK,WAAW,IAAI,SAAS,OAAO,GAAG,WAAW,IAAI,SAAS,OAAO,EAAE;EACjF;;;;;;AAOH,SAAgB,cAAc,KAAc,MAAyB;CACnE,MAAM,MAAM,cAAc,KAAK,KAAK;AACpC,KAAI,CAAC,IAAK,QAAO;CAEjB,MAAM,SAAS;EAAC,IAAI;EAAM,GAAG,KAAK;EAAW,IAAI;EAAG;AACpD,KAAI,OAAO,SAAS,EAAG,QAAO;CAE9B,MAAM,WAAW,KAAK,OAAO,OAAO,SAAS,KAAK,EAAE;CACpD,MAAM,KAAK,OAAO;CAClB,MAAM,KAAK,OAAO,WAAW;AAE7B,QAAO,IAAI,MAAM,GAAG,IAAI,GAAG,KAAK,IAAI,GAAG,IAAI,GAAG,KAAK,EAAE;;;;;AAMvD,SAAgB,YAAY,KAAc,MAA2B;CACnE,MAAM,MAAM,cAAc,KAAK,KAAK;AACpC,KAAI,CAAC,IAAK,QAAO;CAEjB,MAAM,EAAE,MAAM,SAAS,IAAI,UAAU;CACrC,MAAM,SAAS;EAAC;EAAS,GAAG,KAAK;EAAW;EAAM;AAElD,KAAI,KAAK,SAAS,SAAS,KACzB,QAAO,OAAO,KAAK,GAAG,MAAM,GAAG,MAAM,IAAI,MAAM,IAAI,GAAG,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,KAAK,IAAI;AAG/E,KAAI,KAAK,SAAS,SAAS,QAAQ;AACjC,MAAI,OAAO,WAAW,GAAG;GACvB,MAAM,KAAK,OAAO;GAClB,MAAM,KAAK,OAAO;GAClB,MAAM,KAAK,KAAK,IAAI,GAAG,IAAI,GAAG,EAAE;GAChC,MAAM,SAAS,KAAK,IAAI,KAAK,GAAG,GAAG;AACnC,UAAO,KAAK,GAAG,EAAE,GAAG,GAAG,EAAE,KAAK,GAAG,IAAI,OAAO,GAAG,GAAG,EAAE,IAAI,GAAG,IAAI,OAAO,GAAG,GAAG,EAAE,IAAI,GAAG,EAAE,GAAG,GAAG;;EAG/F,IAAI,OAAO,KAAK,OAAO,GAAI,EAAE,GAAG,OAAO,GAAI;AAC3C,OAAK,IAAI,IAAI,GAAG,IAAI,OAAO,SAAS,GAAG,KAAK;GAC1C,MAAM,KAAK,OAAO;GAClB,MAAM,KAAK,OAAO,IAAI;GACtB,MAAM,KAAK,KAAK,IAAI,GAAG,IAAI,GAAG,EAAE;GAChC,MAAM,SAAS,KAAK,IAAI,KAAK,GAAG,GAAG;AACnC,WAAQ,MAAM,GAAG,IAAI,OAAO,GAAG,GAAG,EAAE,IAAI,GAAG,IAAI,OAAO,GAAG,GAAG,EAAE,IAAI,GAAG,EAAE,GAAG,GAAG;;AAE/E,SAAO;;AAGT,KAAI,KAAK,SAAS,SAAS,QAAQ,KAAK,SAAS,SAAS,aAAa;EACrE,IAAI,OAAO,KAAK,OAAO,GAAI,EAAE,GAAG,OAAO,GAAI;EAC3C,MAAM,WAAW,KAAK,SAAS,SAAS;EACxC,MAAM,eAAe;AAErB,OAAK,IAAI,IAAI,GAAG,IAAI,OAAO,SAAS,GAAG,KAAK;GAC1C,MAAM,KAAK,OAAO;GAClB,MAAM,KAAK,OAAO,IAAI;GACtB,MAAM,QAAQ,GAAG,IAAI,GAAG,KAAK;AAE7B,OAAI,CAAC,SACH,SAAQ,MAAM,KAAK,GAAG,GAAG,EAAE,KAAK,KAAK,GAAG,GAAG,EAAE,KAAK,GAAG,EAAE,GAAG,GAAG;QACxD;IACL,MAAM,QAAQ,GAAG,IAAI,GAAG,IAAI,IAAI;IAChC,MAAM,QAAQ,GAAG,IAAI,GAAG,IAAI,IAAI;IAChC,MAAM,eAAe,KAAK,IACxB,cACA,KAAK,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG,GACxB,KAAK,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG,EACzB;AAED,QAAI,eAAe,EACjB,SAAQ,MAAM,GAAG,EAAE,GAAG,GAAG;QAEzB,SAAQ,MAAM,OAAO,eAAe,MAAM,GAAG,GAAG,EAAE;wBACpC,KAAK,GAAG,GAAG,EAAE,GAAG,KAAK,GAAG,GAAG,IAAI,eAAe,MAAM;wBACpD,KAAK,GAAG,GAAG,IAAI,eAAe,MAAM;wBACpC,KAAK,GAAG,GAAG,EAAE,GAAG,OAAO,eAAe,MAAM,GAAG,GAAG,EAAE;wBACpD,GAAG,EAAE,GAAG,GAAG;;;AAI/B,SAAO;;AAGT,QAAO;;;;;AAMT,IAAa,OAAb,MAAkB;CAChB,YACE,AAAO,GACP,AAAO,GACP,AAAO,GACP,AAAO,GACP;EAJO;EACA;EACA;EACA;;;CAIT,SAAS,OAAa;AACpB,SACE,MAAM,KAAK,KAAK,KAChB,MAAM,KAAK,KAAK,IAAI,KAAK,KACzB,MAAM,KAAK,KAAK,KAChB,MAAM,KAAK,KAAK,IAAI,KAAK;;;CAK7B,WAAW,OAAa;AACtB,SAAO,EACL,MAAM,IAAI,KAAK,IAAI,KAAK,KACxB,MAAM,IAAI,MAAM,IAAI,KAAK,KACzB,MAAM,IAAI,KAAK,IAAI,KAAK,KACxB,MAAM,IAAI,MAAM,IAAI,KAAK;;;;;;;AAS/B,IAAa,WAAb,MAAa,SAAY;CACvB,AAAQ,WAAmB;CAC3B,AAAQ,SAAmC,EAAE;CAC7C,AAAQ,UAAmB;CAE3B,AAAQ,YAAgC;CACxC,AAAQ,YAAgC;CACxC,AAAQ,YAAgC;CACxC,AAAQ,YAAgC;CAExC,YAAY,AAAO,UAAgB;EAAhB;;;CAGnB,YAAY;EACV,MAAM,EAAE,GAAG,GAAG,GAAG,MAAM,KAAK;EAC5B,MAAM,KAAK,IAAI,KAAK,GAAG,GAAG,IAAI,GAAG,IAAI,EAAE;EACvC,MAAM,KAAK,IAAI,KAAK,IAAI,IAAI,GAAG,GAAG,IAAI,GAAG,IAAI,EAAE;EAC/C,MAAM,KAAK,IAAI,KAAK,GAAG,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,EAAE;EAC/C,MAAM,KAAK,IAAI,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,EAAE;AAEvD,OAAK,YAAY,IAAI,SAAY,GAAG;AACpC,OAAK,YAAY,IAAI,SAAY,GAAG;AACpC,OAAK,YAAY,IAAI,SAAY,GAAG;AACpC,OAAK,YAAY,IAAI,SAAY,GAAG;AAEpC,OAAK,UAAU;;;CAIjB,OAAO,KAAW,MAAkB;AAClC,MAAI,CAAC,KAAK,SAAS,SAAS,IAAI,CAC9B,QAAO;AAGT,MAAI,KAAK,OAAO,SAAS,KAAK,UAAU;AACtC,QAAK,OAAO,KAAK;IAAE;IAAK;IAAM,CAAC;AAC/B,UAAO;;AAGT,MAAI,CAAC,KAAK,QACR,MAAK,WAAW;AAGlB,SACE,KAAK,UAAW,OAAO,KAAK,KAAK,IACjC,KAAK,UAAW,OAAO,KAAK,KAAK,IACjC,KAAK,UAAW,OAAO,KAAK,KAAK,IACjC,KAAK,UAAW,OAAO,KAAK,KAAK;;;;;;;CASrC,MAAM,OAAa,QAAa,EAAE,EAAO;AACvC,MAAI,CAAC,KAAK,SAAS,WAAW,MAAM,CAClC,QAAO;AAGT,OAAK,MAAM,KAAK,KAAK,OACnB,KAAI,MAAM,SAAS,EAAE,IAAI,CACvB,OAAM,KAAK,EAAE,KAAK;AAItB,MAAI,KAAK,SAAS;AAChB,QAAK,UAAW,MAAM,OAAO,MAAM;AACnC,QAAK,UAAW,MAAM,OAAO,MAAM;AACnC,QAAK,UAAW,MAAM,OAAO,MAAM;AACnC,QAAK,UAAW,MAAM,OAAO,MAAM;;AAGrC,SAAO;;;CAIT,QAAQ;AACN,OAAK,SAAS,EAAE;AAChB,OAAK,UAAU;AACf,OAAK,YAAY;AACjB,OAAK,YAAY;AACjB,OAAK,YAAY;AACjB,OAAK,YAAY"}

package/package.json

@@ -1,13 +1,21 @@
 {
   "name": "@stuly/anode",
-  "version": "0.1.0",
+  "version": "0.1.2",
   "main": "dist/anode.js",
   "module": "dist/anode.js",
   "types": "dist/anode.d.ts",
-  "description": "A simple node library",
+  "description": "The high-performance, headless core engine for Anode.",
   "publishConfig": {
     "access": "public"
   },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/stulyproject/anode.git"
+  },
+  "bugs": {
+    "url": "https://github.com/stulyproject/anode/issues"
+  },
+  "homepage": "https://github.com/stulyproject/anode#readme",
   "files": [
     "dist"
   ],
@@ -18,7 +26,13 @@
       "default": "./dist/anode.js"
     }
   },
-  "keywords": [],
+  "keywords": [
+    "node-graph",
+    "graph-engine",
+    "headless",
+    "spatial-indexing",
+    "quadtree"
+  ],
   "author": "",
   "license": "MIT",
   "type": "module",