@stuly/anode 0.1.0

package/dist/core/layout.js

@@ -0,0 +1,157 @@
+import { LinkKind, Vec2 } from "./elements.js";
+
+//#region src/core/layout.ts
+function getLinkPoints(ctx, link) {
+	const fromSocket = ctx.sockets.get(link.from);
+	const toSocket = ctx.sockets.get(link.to);
+	if (!fromSocket || !toSocket) return null;
+	const fromEntity = ctx.entities.get(fromSocket.entityId);
+	const toEntity = ctx.entities.get(toSocket.entityId);
+	if (!fromEntity || !toEntity) return null;
+	const fromWorldPos = ctx.getWorldPosition(fromEntity.id);
+	const toWorldPos = ctx.getWorldPosition(toEntity.id);
+	return {
+		from: new Vec2(fromWorldPos.x + fromSocket.offset.x, fromWorldPos.y + fromSocket.offset.y),
+		to: new Vec2(toWorldPos.x + toSocket.offset.x, toWorldPos.y + toSocket.offset.y)
+	};
+}
+function getLinkCenter(ctx, link) {
+	const pts = getLinkPoints(ctx, link);
+	if (!pts) return null;
+	const points = [
+		pts.from,
+		...link.waypoints,
+		pts.to
+	];
+	if (points.length < 2) return null;
+	const midIndex = Math.floor((points.length - 1) / 2);
+	const p1 = points[midIndex];
+	const p2 = points[midIndex + 1];
+	return new Vec2((p1.x + p2.x) / 2, (p1.y + p2.y) / 2);
+}
+function getLinkPath(ctx, link) {
+	const pts = getLinkPoints(ctx, link);
+	if (!pts) return null;
+	const { from: fromPos, to: toPos } = pts;
+	const points = [
+		fromPos,
+		...link.waypoints,
+		toPos
+	];
+	if (link.kind === LinkKind.LINE) return points.map((p, i) => `${i === 0 ? "M" : "L"} ${p.x} ${p.y}`).join(" ");
+	if (link.kind === LinkKind.BEZIER) {
+		if (points.length === 2) {
+			const p1 = points[0];
+			const p2 = points[1];
+			const dx = Math.abs(p1.x - p2.x);
+			const offset = Math.max(dx / 2, 50);
+			return `M ${p1.x} ${p1.y} C ${p1.x + offset} ${p1.y}, ${p2.x - offset} ${p2.y}, ${p2.x} ${p2.y}`;
+		}
+		let path = `M ${points[0].x} ${points[0].y}`;
+		for (let i = 0; i < points.length - 1; i++) {
+			const p1 = points[i];
+			const p2 = points[i + 1];
+			const dx = Math.abs(p1.x - p2.x);
+			const offset = Math.max(dx / 2, 20);
+			path += ` C ${p1.x + offset} ${p1.y}, ${p2.x - offset} ${p2.y}, ${p2.x} ${p2.y}`;
+		}
+		return path;
+	}
+	if (link.kind === LinkKind.STEP || link.kind === LinkKind.SMOOTH_STEP) {
+		let path = `M ${points[0].x} ${points[0].y}`;
+		const isSmooth = link.kind === LinkKind.SMOOTH_STEP;
+		const borderRadius = 10;
+		for (let i = 0; i < points.length - 1; i++) {
+			const p1 = points[i];
+			const p2 = points[i + 1];
+			const midX = (p1.x + p2.x) / 2;
+			if (!isSmooth) path += ` L ${midX} ${p1.y} L ${midX} ${p2.y} L ${p2.x} ${p2.y}`;
+			else {
+				const signX = p2.x > p1.x ? 1 : -1;
+				const signY = p2.y > p1.y ? 1 : -1;
+				const actualBorder = Math.min(borderRadius, Math.abs(p1.x - p2.x) / 2, Math.abs(p1.y - p2.y) / 2);
+				if (actualBorder < 1) path += ` L ${p2.x} ${p2.y}`;
+				else path += ` L ${midX - actualBorder * signX} ${p1.y} 
+                    Q ${midX} ${p1.y} ${midX} ${p1.y + actualBorder * signY}
+                    L ${midX} ${p2.y - actualBorder * signY}
+                    Q ${midX} ${p2.y} ${midX + actualBorder * signX} ${p2.y}
+                    L ${p2.x} ${p2.y}`;
+			}
+		}
+		return path;
+	}
+	return null;
+}
+var Rect = class {
+	constructor(x, y, w, h) {
+		this.x = x;
+		this.y = y;
+		this.w = w;
+		this.h = h;
+	}
+	contains(point) {
+		return point.x >= this.x && point.x <= this.x + this.w && point.y >= this.y && point.y <= this.y + this.h;
+	}
+	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);
+	}
+};
+var QuadTree = class QuadTree {
+	capacity = 4;
+	points = [];
+	divided = false;
+	northwest = null;
+	northeast = null;
+	southwest = null;
+	southeast = null;
+	constructor(boundary) {
+		this.boundary = boundary;
+	}
+	subdivide() {
+		const { x, y, w, h } = this.boundary;
+		const nw = new Rect(x, y, w / 2, h / 2);
+		const ne = new Rect(x + w / 2, y, w / 2, h / 2);
+		const sw = new Rect(x, y + h / 2, w / 2, h / 2);
+		const se = new Rect(x + w / 2, y + h / 2, w / 2, h / 2);
+		this.northwest = new QuadTree(nw);
+		this.northeast = new QuadTree(ne);
+		this.southwest = new QuadTree(sw);
+		this.southeast = new QuadTree(se);
+		this.divided = true;
+	}
+	insert(pos, data) {
+		if (!this.boundary.contains(pos)) return false;
+		if (this.points.length < this.capacity) {
+			this.points.push({
+				pos,
+				data
+			});
+			return true;
+		}
+		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);
+	}
+	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);
+		if (this.divided) {
+			this.northwest.query(range, found);
+			this.northeast.query(range, found);
+			this.southwest.query(range, found);
+			this.southeast.query(range, found);
+		}
+		return found;
+	}
+	clear() {
+		this.points = [];
+		this.divided = false;
+		this.northwest = null;
+		this.northeast = null;
+		this.southwest = null;
+		this.southeast = null;
+	}
+};
+
+//#endregion
+export { QuadTree, Rect, getLinkCenter, getLinkPath, getLinkPoints };
+//# sourceMappingURL=layout.js.map

package/dist/core/layout.js.map

@@ -0,0 +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"}

package/package.json

@@ -0,0 +1,37 @@
+{
+  "name": "@stuly/anode",
+  "version": "0.1.0",
+  "main": "dist/anode.js",
+  "module": "dist/anode.js",
+  "types": "dist/anode.d.ts",
+  "description": "A simple node library",
+  "publishConfig": {
+    "access": "public"
+  },
+  "files": [
+    "dist"
+  ],
+  "exports": {
+    ".": {
+      "types": "./dist/anode.d.ts",
+      "import": "./dist/anode.js",
+      "default": "./dist/anode.js"
+    }
+  },
+  "keywords": [],
+  "author": "",
+  "license": "MIT",
+  "type": "module",
+  "devDependencies": {
+    "tsdown": "^0.20.3",
+    "typescript": "^5.9.3",
+    "vitest": "^4.0.18"
+  },
+  "scripts": {
+    "build": "tsdown",
+    "dev": "tsdown --watch",
+    "format": "prettier --write .",
+    "test": "vitest run",
+    "lint": "tsc"
+  }
+}