@glissade/svg 0.6.0-pre.1

package/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/dist/index.d.ts

@@ -0,0 +1,58 @@
+import { Group, PathSeg, SceneModule } from "@glissade/scene";
+
+//#region src/parser.d.ts
+
+/**
+ * Parse an SVG path `d` string into `PathSeg[]`. Unknown/degenerate inputs are
+ * skipped gracefully rather than throwing.
+ */
+declare function parseSvgPath(d: string): PathSeg[];
+//#endregion
+//#region src/xml.d.ts
+/**
+ * A tiny XML reader for the SVG subset — elements, attributes (either quote
+ * style), nesting, self-closing tags. Comments / declarations / doctype are
+ * stripped; text content is ignored (glissade SVG import is shape-only). Not a
+ * general XML parser; just enough to walk an SVG's element tree.
+ */
+interface XmlNode {
+  tag: string;
+  attrs: Record<string, string>;
+  children: XmlNode[];
+}
+/** Parse SVG source into its root element tree, or null if there's no element. */
+declare function parseXml(src: string): XmlNode | null;
+//#endregion
+//#region src/convert.d.ts
+interface ConvertResult {
+  size: {
+    w: number;
+    h: number;
+  };
+  root: Group;
+  warnings: string[];
+}
+/** Convert a parsed SVG root element into a scene-ready Group + size. */
+declare function convertSvg(svg: XmlNode): ConvertResult;
+//#endregion
+//#region src/index.d.ts
+declare class SvgImportError extends Error {
+  constructor(message: string);
+}
+interface SvgImportResult {
+  /** Intrinsic size from width/height or viewBox (falls back to 100×100). */
+  size: {
+    w: number;
+    h: number;
+  };
+  /** The imported tree as a single Group node (positioned in SVG user units). */
+  root: Group;
+  /** Non-fatal feature gaps (dropped elements, unsupported paint/transform). */
+  warnings: string[];
+  /** Wrap the import as a static, renderable SceneModule. */
+  toSceneModule(): SceneModule;
+}
+/** Parse an SVG string and convert it to a glissade scene. Throws on no `<svg>`. */
+declare function importSvg(svg: string): SvgImportResult;
+//#endregion
+export { type ConvertResult, SvgImportError, SvgImportResult, type XmlNode, convertSvg, importSvg, parseSvgPath, parseXml };

package/dist/index.js

@@ -0,0 +1,606 @@
+import { timeline } from "@glissade/core";
+import { Circle, Group, Path, Rect, createScene, pathFromSegs } from "@glissade/scene";
+//#region src/parser.ts
+const TOKEN = /([MmLlHhVvCcSsQqTtAaZz])|(-?(?:\d*\.\d+|\d+\.?)(?:[eE][+-]?\d+)?)/g;
+function tokenize(d) {
+	const out = [];
+	let m;
+	TOKEN.lastIndex = 0;
+	while ((m = TOKEN.exec(d)) !== null) if (m[1] !== void 0) out.push({ cmd: m[1] });
+	else out.push({ num: parseFloat(m[2]) });
+	return out;
+}
+/** SVG endpoint-arc → glissade 'E' segment (center parameterization). */
+function arcToE(x1, y1, rx, ry, phiDeg, large, sweep, x2, y2) {
+	if (rx === 0 || ry === 0) return null;
+	rx = Math.abs(rx);
+	ry = Math.abs(ry);
+	const phi = phiDeg * Math.PI / 180;
+	const cosP = Math.cos(phi);
+	const sinP = Math.sin(phi);
+	const dx = (x1 - x2) / 2;
+	const dy = (y1 - y2) / 2;
+	const x1p = cosP * dx + sinP * dy;
+	const y1p = -sinP * dx + cosP * dy;
+	const lambda = x1p * x1p / (rx * rx) + y1p * y1p / (ry * ry);
+	if (lambda > 1) {
+		const s = Math.sqrt(lambda);
+		rx *= s;
+		ry *= s;
+	}
+	const sign = large !== sweep ? 1 : -1;
+	const num = rx * rx * ry * ry - rx * rx * y1p * y1p - ry * ry * x1p * x1p;
+	const den = rx * rx * y1p * y1p + ry * ry * x1p * x1p;
+	const co = sign * Math.sqrt(Math.max(0, num / den));
+	const cxp = co * (rx * y1p) / ry;
+	const cyp = co * -(ry * x1p) / rx;
+	const cx = cosP * cxp - sinP * cyp + (x1 + x2) / 2;
+	const cy = sinP * cxp + cosP * cyp + (y1 + y2) / 2;
+	const ang = (ux, uy, vx, vy) => {
+		const dot = ux * vx + uy * vy;
+		const len = Math.hypot(ux, uy) * Math.hypot(vx, vy);
+		let a = Math.acos(Math.min(1, Math.max(-1, dot / len)));
+		if (ux * vy - uy * vx < 0) a = -a;
+		return a;
+	};
+	const theta1 = ang(1, 0, (x1p - cxp) / rx, (y1p - cyp) / ry);
+	let dTheta = ang((x1p - cxp) / rx, (y1p - cyp) / ry, (-x1p - cxp) / rx, (-y1p - cyp) / ry);
+	if (sweep === 0 && dTheta > 0) dTheta -= 2 * Math.PI;
+	else if (sweep === 1 && dTheta < 0) dTheta += 2 * Math.PI;
+	return [
+		"E",
+		cx,
+		cy,
+		rx,
+		ry,
+		phi,
+		theta1,
+		theta1 + dTheta
+	];
+}
+/**
+* Parse an SVG path `d` string into `PathSeg[]`. Unknown/degenerate inputs are
+* skipped gracefully rather than throwing.
+*/
+function parseSvgPath(d) {
+	const toks = tokenize(d);
+	const segs = [];
+	let i = 0;
+	let cx = 0;
+	let cy = 0;
+	let sx = 0;
+	let sy = 0;
+	let lastCtrlX = 0;
+	let lastCtrlY = 0;
+	let prevCmd = "";
+	const num = () => {
+		const t = toks[i++];
+		return t && "num" in t ? t.num : NaN;
+	};
+	const hasNum = () => {
+		const t = toks[i];
+		return !!t && "num" in t;
+	};
+	while (i < toks.length) {
+		const t = toks[i];
+		let cmd;
+		if (t && "cmd" in t) {
+			cmd = t.cmd;
+			i++;
+		} else {
+			cmd = prevCmd === "M" ? "L" : prevCmd === "m" ? "l" : prevCmd;
+			if (!cmd) break;
+		}
+		const rel = cmd === cmd.toLowerCase();
+		const C = cmd.toUpperCase();
+		switch (C) {
+			case "M": {
+				const x = num() + (rel ? cx : 0);
+				const y = num() + (rel ? cy : 0);
+				cx = x;
+				cy = y;
+				sx = x;
+				sy = y;
+				segs.push([
+					"M",
+					x,
+					y
+				]);
+				break;
+			}
+			case "L": {
+				const x = num() + (rel ? cx : 0);
+				const y = num() + (rel ? cy : 0);
+				cx = x;
+				cy = y;
+				segs.push([
+					"L",
+					x,
+					y
+				]);
+				break;
+			}
+			case "H": {
+				const x = num() + (rel ? cx : 0);
+				cx = x;
+				segs.push([
+					"L",
+					x,
+					cy
+				]);
+				break;
+			}
+			case "V": {
+				const y = num() + (rel ? cy : 0);
+				cy = y;
+				segs.push([
+					"L",
+					cx,
+					y
+				]);
+				break;
+			}
+			case "C": {
+				const x1 = num() + (rel ? cx : 0);
+				const y1 = num() + (rel ? cy : 0);
+				const x2 = num() + (rel ? cx : 0);
+				const y2 = num() + (rel ? cy : 0);
+				const x = num() + (rel ? cx : 0);
+				const y = num() + (rel ? cy : 0);
+				segs.push([
+					"C",
+					x1,
+					y1,
+					x2,
+					y2,
+					x,
+					y
+				]);
+				lastCtrlX = x2;
+				lastCtrlY = y2;
+				cx = x;
+				cy = y;
+				break;
+			}
+			case "S": {
+				const reflect = prevCmd.toUpperCase() === "C" || prevCmd.toUpperCase() === "S";
+				const x1 = reflect ? 2 * cx - lastCtrlX : cx;
+				const y1 = reflect ? 2 * cy - lastCtrlY : cy;
+				const x2 = num() + (rel ? cx : 0);
+				const y2 = num() + (rel ? cy : 0);
+				const x = num() + (rel ? cx : 0);
+				const y = num() + (rel ? cy : 0);
+				segs.push([
+					"C",
+					x1,
+					y1,
+					x2,
+					y2,
+					x,
+					y
+				]);
+				lastCtrlX = x2;
+				lastCtrlY = y2;
+				cx = x;
+				cy = y;
+				break;
+			}
+			case "Q": {
+				const x1 = num() + (rel ? cx : 0);
+				const y1 = num() + (rel ? cy : 0);
+				const x = num() + (rel ? cx : 0);
+				const y = num() + (rel ? cy : 0);
+				segs.push([
+					"Q",
+					x1,
+					y1,
+					x,
+					y
+				]);
+				lastCtrlX = x1;
+				lastCtrlY = y1;
+				cx = x;
+				cy = y;
+				break;
+			}
+			case "T": {
+				const reflect = prevCmd.toUpperCase() === "Q" || prevCmd.toUpperCase() === "T";
+				const x1 = reflect ? 2 * cx - lastCtrlX : cx;
+				const y1 = reflect ? 2 * cy - lastCtrlY : cy;
+				const x = num() + (rel ? cx : 0);
+				const y = num() + (rel ? cy : 0);
+				segs.push([
+					"Q",
+					x1,
+					y1,
+					x,
+					y
+				]);
+				lastCtrlX = x1;
+				lastCtrlY = y1;
+				cx = x;
+				cy = y;
+				break;
+			}
+			case "A": {
+				const rx = num();
+				const ry = num();
+				const rot = num();
+				const large = num();
+				const sweep = num();
+				const x = num() + (rel ? cx : 0);
+				const y = num() + (rel ? cy : 0);
+				const e = arcToE(cx, cy, rx, ry, rot, large, sweep, x, y);
+				segs.push(e ?? [
+					"L",
+					x,
+					y
+				]);
+				cx = x;
+				cy = y;
+				break;
+			}
+			case "Z":
+				segs.push(["Z"]);
+				cx = sx;
+				cy = sy;
+				break;
+			default:
+				i++;
+				break;
+		}
+		prevCmd = cmd;
+		if (C !== "Z" && !hasNum() && toks[i] && "cmd" in toks[i] === false) break;
+	}
+	return segs;
+}
+//#endregion
+//#region src/convert.ts
+const num = (v, d = 0) => {
+	const n = parseFloat(v ?? "");
+	return Number.isFinite(n) ? n : d;
+};
+function color(v, warnings) {
+	if (v === void 0) return void 0;
+	const c = v.trim();
+	if (c === "" || c === "none") return void 0;
+	if (c.startsWith("url(")) {
+		warnings.push(`gradient/pattern paint not supported (${c}); dropped`);
+		return;
+	}
+	return c;
+}
+/** Resolve this element's paint, inheriting from the parent (SVG presentation). */
+function resolvePaint(attrs, inh, warnings) {
+	const fill = "fill" in attrs ? color(attrs["fill"], warnings) : inh.fill;
+	const stroke = "stroke" in attrs ? color(attrs["stroke"], warnings) : inh.stroke;
+	const strokeWidth = "stroke-width" in attrs ? num(attrs["stroke-width"], 1) : inh.strokeWidth;
+	return {
+		...fill !== void 0 ? { fill } : {},
+		...stroke !== void 0 ? { stroke } : {},
+		...strokeWidth !== void 0 ? { strokeWidth } : {}
+	};
+}
+const shapeProps = (p) => ({
+	...p.fill !== void 0 ? { fill: p.fill } : {},
+	...p.stroke !== void 0 ? { stroke: p.stroke } : {},
+	...p.strokeWidth !== void 0 ? { strokeWidth: p.strokeWidth } : {}
+});
+/** Compose an SVG transform list into a node TRS (skew is dropped + warned). */
+function parseTransform(s, warnings) {
+	if (!s) return null;
+	let M = [
+		1,
+		0,
+		0,
+		1,
+		0,
+		0
+	];
+	const mul = (m) => {
+		const [a, b, c, d, e, f] = M;
+		const [A, B, C, D, E, F] = m;
+		M = [
+			a * A + c * B,
+			b * A + d * B,
+			a * C + c * D,
+			b * C + d * D,
+			a * E + c * F + e,
+			b * E + d * F + f
+		];
+	};
+	const re = /(translate|scale|rotate|matrix|skewX|skewY)\s*\(([^)]*)\)/g;
+	let m;
+	let any = false;
+	while ((m = re.exec(s)) !== null) {
+		any = true;
+		const args = m[2].split(/[\s,]+/).filter(Boolean).map(parseFloat);
+		switch (m[1]) {
+			case "translate":
+				mul([
+					1,
+					0,
+					0,
+					1,
+					args[0] ?? 0,
+					args[1] ?? 0
+				]);
+				break;
+			case "scale":
+				mul([
+					args[0] ?? 1,
+					0,
+					0,
+					args[1] ?? args[0] ?? 1,
+					0,
+					0
+				]);
+				break;
+			case "rotate": {
+				const r = (args[0] ?? 0) * Math.PI / 180;
+				const rot = [
+					Math.cos(r),
+					Math.sin(r),
+					-Math.sin(r),
+					Math.cos(r),
+					0,
+					0
+				];
+				if (args.length >= 3) {
+					mul([
+						1,
+						0,
+						0,
+						1,
+						args[1],
+						args[2]
+					]);
+					mul(rot);
+					mul([
+						1,
+						0,
+						0,
+						1,
+						-args[1],
+						-args[2]
+					]);
+				} else mul(rot);
+				break;
+			}
+			case "matrix":
+				if (args.length === 6) mul(args);
+				break;
+			default: warnings.push(`transform ${m[1]}() (skew) not supported; dropped`);
+		}
+	}
+	if (!any) return null;
+	const [a, b, c, d, e, f] = M;
+	const sx = Math.hypot(a, b);
+	const det = a * d - b * c;
+	const sy = sx === 0 ? 0 : det / sx;
+	return {
+		position: [e, f],
+		rotation: Math.atan2(b, a) * 180 / Math.PI,
+		scale: [sx, sy]
+	};
+}
+const ellipsePath = (cx, cy, rx, ry) => pathFromSegs([
+	[
+		"M",
+		cx + rx,
+		cy
+	],
+	[
+		"E",
+		cx,
+		cy,
+		rx,
+		ry,
+		0,
+		0,
+		Math.PI * 2
+	],
+	["Z"]
+]);
+const pointsToSegs = (pts, close) => {
+	const n = pts.split(/[\s,]+/).filter(Boolean).map(parseFloat);
+	const segs = [];
+	for (let i = 0; i + 1 < n.length; i += 2) segs.push([
+		i === 0 ? "M" : "L",
+		n[i],
+		n[i + 1]
+	]);
+	if (close) segs.push(["Z"]);
+	return segs;
+};
+/** Convert one element (and its subtree) to a node, or null if it produces none. */
+function convertElement(el, inh, warnings) {
+	const tag = el.tag.replace(/^.*:/, "");
+	const a = el.attrs;
+	const paint = resolvePaint(a, inh, warnings);
+	const wrap = (node) => {
+		const t = parseTransform(a["transform"], warnings);
+		return t ? new Group({
+			position: t.position,
+			rotation: t.rotation,
+			scale: t.scale,
+			children: [node]
+		}) : node;
+	};
+	switch (tag) {
+		case "g":
+		case "svg": {
+			const children = el.children.map((c) => convertElement(c, paint, warnings)).filter((n) => n !== null);
+			const t = parseTransform(a["transform"], warnings);
+			return new Group({
+				...t ? {
+					position: t.position,
+					rotation: t.rotation,
+					scale: t.scale
+				} : {},
+				children
+			});
+		}
+		case "path":
+			if (!a["d"]) return null;
+			return wrap(new Path({
+				data: pathFromSegs(parseSvgPath(a["d"])),
+				...shapeProps(paint)
+			}));
+		case "rect": {
+			const x = num(a["x"]);
+			const y = num(a["y"]);
+			const w = num(a["width"]);
+			const h = num(a["height"]);
+			const r = num(a["rx"] ?? a["ry"]);
+			return wrap(new Rect({
+				position: [x + w / 2, y + h / 2],
+				width: w,
+				height: h,
+				...r ? { cornerRadius: r } : {},
+				...shapeProps(paint)
+			}));
+		}
+		case "circle": return wrap(new Circle({
+			position: [num(a["cx"]), num(a["cy"])],
+			radius: num(a["r"]),
+			...shapeProps(paint)
+		}));
+		case "ellipse": return wrap(new Path({
+			data: ellipsePath(num(a["cx"]), num(a["cy"]), num(a["rx"]), num(a["ry"])),
+			...shapeProps(paint)
+		}));
+		case "line": return wrap(new Path({
+			data: pathFromSegs([[
+				"M",
+				num(a["x1"]),
+				num(a["y1"])
+			], [
+				"L",
+				num(a["x2"]),
+				num(a["y2"])
+			]]),
+			...shapeProps(paint)
+		}));
+		case "polyline": return wrap(new Path({
+			data: pathFromSegs(pointsToSegs(a["points"] ?? "", false)),
+			...shapeProps(paint)
+		}));
+		case "polygon": return wrap(new Path({
+			data: pathFromSegs(pointsToSegs(a["points"] ?? "", true)),
+			...shapeProps(paint)
+		}));
+		case "defs":
+		case "title":
+		case "desc":
+		case "metadata":
+		case "style": return null;
+		case "text":
+		case "image":
+		case "use":
+		case "linearGradient":
+		case "radialGradient":
+		case "filter":
+		case "mask":
+		case "clipPath":
+		case "pattern":
+			warnings.push(`<${tag}> not supported; dropped`);
+			return null;
+		default: return null;
+	}
+}
+/** Convert a parsed SVG root element into a scene-ready Group + size. */
+function convertSvg(svg) {
+	const warnings = [];
+	const a = svg.attrs;
+	let w = num(a["width"]);
+	let h = num(a["height"]);
+	if ((!w || !h) && a["viewBox"]) {
+		const vb = a["viewBox"].split(/[\s,]+/).filter(Boolean).map(parseFloat);
+		if (vb.length === 4) {
+			w = w || vb[2];
+			h = h || vb[3];
+		}
+	}
+	const root = convertElement(svg, {
+		fill: "black",
+		strokeWidth: 1
+	}, warnings);
+	return {
+		size: {
+			w: w || 100,
+			h: h || 100
+		},
+		root,
+		warnings
+	};
+}
+//#endregion
+//#region src/xml.ts
+const TAG = /<(\/?)([a-zA-Z][\w:.-]*)((?:\s+[\w:.-]+\s*=\s*(?:"[^"]*"|'[^']*'))*)\s*(\/?)>/g;
+const ATTR = /([\w:.-]+)\s*=\s*(?:"([^"]*)"|'([^']*)')/g;
+/** Parse SVG source into its root element tree, or null if there's no element. */
+function parseXml(src) {
+	const clean = src.replace(/<!--[\s\S]*?-->/g, "").replace(/<\?[\s\S]*?\?>/g, "").replace(/<!DOCTYPE[\s\S]*?>/gi, "");
+	const root = {
+		tag: "#root",
+		attrs: {},
+		children: []
+	};
+	const stack = [root];
+	let m;
+	TAG.lastIndex = 0;
+	while ((m = TAG.exec(clean)) !== null) {
+		const [, close, tag, attrStr, selfClose] = m;
+		if (close) {
+			if (stack.length > 1) stack.pop();
+			continue;
+		}
+		const attrs = {};
+		let a;
+		ATTR.lastIndex = 0;
+		while ((a = ATTR.exec(attrStr)) !== null) attrs[a[1]] = a[2] ?? a[3] ?? "";
+		const node = {
+			tag,
+			attrs,
+			children: []
+		};
+		stack[stack.length - 1].children.push(node);
+		if (!selfClose) stack.push(node);
+	}
+	return root.children[0] ?? null;
+}
+//#endregion
+//#region src/index.ts
+var SvgImportError = class extends Error {
+	constructor(message) {
+		super(message);
+		this.name = "SvgImportError";
+	}
+};
+/** Parse an SVG string and convert it to a glissade scene. Throws on no `<svg>`. */
+function importSvg(svg) {
+	const root = parseXml(svg);
+	if (root === null || root.tag.replace(/^.*:/, "") !== "svg") throw new SvgImportError("[invalid-document] no root <svg> element found");
+	const { size, root: group, warnings } = convertSvg(root);
+	return {
+		size,
+		root: group,
+		warnings,
+		toSceneModule() {
+			return {
+				createScene: () => createScene({
+					size,
+					children: [group]
+				}),
+				timeline: timeline({
+					fps: 60,
+					duration: 1,
+					tracks: []
+				})
+			};
+		}
+	};
+}
+//#endregion
+export { SvgImportError, convertSvg, importSvg, parseSvgPath, parseXml };

package/package.json

@@ -0,0 +1,33 @@
+{
+  "name": "@glissade/svg",
+  "version": "0.6.0-pre.1",
+  "description": "glissade SVG import: parse an SVG into a deterministic scene module — <path d> and the basic shapes become Path/Rect/Circle nodes with fills, strokes, and transforms.",
+  "license": "Apache-2.0",
+  "type": "module",
+  "sideEffects": false,
+  "publishConfig": {
+    "access": "public"
+  },
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "default": "./dist/index.js"
+    }
+  },
+  "files": [
+    "dist"
+  ],
+  "dependencies": {
+    "@glissade/core": "0.6.0-pre.1",
+    "@glissade/scene": "0.6.0-pre.1"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/tyevco/glissade.git",
+    "directory": "packages/svg"
+  },
+  "scripts": {
+    "build": "tsdown",
+    "typecheck": "tsc --noEmit"
+  }
+}