@faicad/sheetmetal 0.13.0

package/dist/featureTreeFns.d.ts

@@ -0,0 +1,76 @@
+import { type Result } from '@faicad/faijs/brepjs-compat';
+import type { BendFeature, FlangeFeature, SheetMetalPart, SheetMetalWarning } from './types.js';
+/** Id of the root flat — the part's base flat, present as the root of every graph. */
+export declare const ROOT_FLAT_ID = "root";
+/** A flat region in the feature graph (the part's base plus every flange face). */
+export interface FlatNode {
+    id: string;
+    isRoot: boolean;
+    flange?: FlangeFeature | undefined;
+}
+/** A bend connecting two flats. `parent`/`child` are flat ids; `bend` is the recorded feature. */
+export interface BendEdge {
+    bend: BendFeature;
+    parent: string;
+    child: string;
+}
+/** Graph view of an authored part: flats = nodes, bends = edges. */
+export interface FeatureGraph {
+    nodes: Map<string, FlatNode>;
+    edges: BendEdge[];
+}
+/** A bend that survives in the spanning tree, paired with its source/target flat. */
+export interface TreeBend {
+    bend: BendFeature;
+    parent: string;
+    child: string;
+}
+/** A non-tree edge that must be cut to flatten a closed profile. */
+export interface SeamCut {
+    bend: BendFeature;
+    between: [string, string];
+}
+/** Result of a spanning-tree build over a feature graph: BFS-ordered tree bends, seam cuts, and the flat nodes. */
+export interface FeatureTree {
+    rootId: string;
+    /** Tree edges in breadth-first order (parents precede their children). */
+    bends: TreeBend[];
+    seams: SeamCut[];
+    nodes: Map<string, FlatNode>;
+    warnings: SheetMetalWarning[];
+}
+/**
+ * Build the feature graph for an authored part. Each flange contributes a flat
+ * node `flange.id`; bends connect a parent flat to a child flat. A bend whose id
+ * matches a flange id (the flange's own fold) is wired parent→flange; any other
+ * bend is matched to a flange by id suffix `<flange>::<n>` or defaults to a
+ * root-anchored edge so authored parts always produce a connected graph.
+ *
+ * @param part - the authored sheet-metal part to graph.
+ * @returns a `Result<FeatureGraph>` — `ok` with `{ nodes, edges }` on success,
+ * or `err` with a `validationError` for a non-positive thickness, duplicate
+ * flange/bend ids, or bends that resolve to no flange flat.
+ */
+export declare function buildFeatureGraph(part: SheetMetalPart): Result<FeatureGraph>;
+/**
+ * Spanning tree over the feature graph, rooted at the base flat. Tree edges are
+ * returned BFS-ordered (every parent appears before its children); edges that
+ * would close a cycle (box/closed profiles) become seam cuts with a warning.
+ *
+ * @param graph - the feature graph built by {@link buildFeatureGraph}.
+ * @param rootId - the flat id to root the tree at; defaults to {@link ROOT_FLAT_ID}.
+ * @returns a `Result<FeatureTree>` — `ok` with the BFS-ordered tree bends, seam
+ * cuts, flat nodes, and warnings, or `err` with a `validationError` when the
+ * root is unknown or some flat is unreachable from the root.
+ */
+export declare function buildFeatureTree(graph: FeatureGraph, rootId?: string): Result<FeatureTree>;
+/**
+ * Convenience: graph + spanning tree in one call.
+ *
+ * @param part - the authored sheet-metal part to graph and tree.
+ * @param rootId - the flat id to root the tree at; defaults to {@link ROOT_FLAT_ID}.
+ * @returns a `Result<FeatureTree>` — `ok` with the feature tree, or the first
+ * `err` produced by {@link buildFeatureGraph} or {@link buildFeatureTree}.
+ */
+export declare function featureTree(part: SheetMetalPart, rootId?: string): Result<FeatureTree>;
+//# sourceMappingURL=featureTreeFns.d.ts.map

package/dist/featureTreeFns.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"featureTreeFns.d.ts","sourceRoot":"","sources":["../src/featureTreeFns.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,MAAM,EAA4B,MAAM,6BAA6B,CAAC;AACpF,OAAO,KAAK,EAAE,WAAW,EAAE,aAAa,EAAE,cAAc,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAEhG,sFAAsF;AACtF,eAAO,MAAM,YAAY,SAAS,CAAC;AAEnC,mFAAmF;AACnF,MAAM,WAAW,QAAQ;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,OAAO,CAAC;IAChB,MAAM,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC;CACpC;AAED,kGAAkG;AAClG,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,WAAW,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;CACf;AAED,oEAAoE;AACpE,MAAM,WAAW,YAAY;IAC3B,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IAC7B,KAAK,EAAE,QAAQ,EAAE,CAAC;CACnB;AAED,qFAAqF;AACrF,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,WAAW,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;CACf;AAED,oEAAoE;AACpE,MAAM,WAAW,OAAO;IACtB,IAAI,EAAE,WAAW,CAAC;IAClB,OAAO,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC3B;AAED,mHAAmH;AACnH,MAAM,WAAW,WAAW;IAC1B,MAAM,EAAE,MAAM,CAAC;IACf,0EAA0E;IAC1E,KAAK,EAAE,QAAQ,EAAE,CAAC;IAClB,KAAK,EAAE,OAAO,EAAE,CAAC;IACjB,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IAC7B,QAAQ,EAAE,iBAAiB,EAAE,CAAC;CAC/B;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,cAAc,GAAG,MAAM,CAAC,YAAY,CAAC,CAoE5E;AAsBD;;;;;;;;;;GAUG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,YAAY,EAAE,MAAM,GAAE,MAAqB,GAAG,MAAM,CAAC,WAAW,CAAC,CAqExG;AAED;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,cAAc,EAAE,MAAM,GAAE,MAAqB,GAAG,MAAM,CAAC,WAAW,CAAC,CAIpG"}

package/dist/featureTreeFns.js

@@ -0,0 +1,190 @@
+import { ok, err, validationError } from '@faicad/faijs/brepjs-compat';
+/** Id of the root flat — the part's base flat, present as the root of every graph. */
+export const ROOT_FLAT_ID = 'root';
+/**
+ * Build the feature graph for an authored part. Each flange contributes a flat
+ * node `flange.id`; bends connect a parent flat to a child flat. A bend whose id
+ * matches a flange id (the flange's own fold) is wired parent→flange; any other
+ * bend is matched to a flange by id suffix `<flange>::<n>` or defaults to a
+ * root-anchored edge so authored parts always produce a connected graph.
+ *
+ * @param part - the authored sheet-metal part to graph.
+ * @returns a `Result<FeatureGraph>` — `ok` with `{ nodes, edges }` on success,
+ * or `err` with a `validationError` for a non-positive thickness, duplicate
+ * flange/bend ids, or bends that resolve to no flange flat.
+ */
+export function buildFeatureGraph(part) {
+    if (!Number.isFinite(part.thickness) || part.thickness <= 0) {
+        return err(validationError('INVALID_THICKNESS', `part.thickness must be positive, got ${part.thickness}`));
+    }
+    const nodes = new Map();
+    nodes.set(ROOT_FLAT_ID, { id: ROOT_FLAT_ID, isRoot: true });
+    const flangeById = new Map();
+    for (const flange of part.flanges) {
+        if (nodes.has(flange.id)) {
+            return err(validationError('DUPLICATE_FLAT', `duplicate flange/flat id '${flange.id}'`));
+        }
+        nodes.set(flange.id, { id: flange.id, isRoot: false, flange });
+        flangeById.set(flange.id, flange);
+    }
+    const edges = [];
+    const seenBendIds = new Set();
+    for (const bend of part.bends) {
+        if (seenBendIds.has(bend.id)) {
+            return err(validationError('DUPLICATE_BEND', `duplicate bend id '${bend.id}'`));
+        }
+        seenBendIds.add(bend.id);
+        // A contour-flange bend (`contour::<flange>::<n>`) is one arc of a multi-bend
+        // contour flange. The contour flange records its own developed strip in
+        // `part.contourFlanges` and lays out independently of the bend spanning tree
+        // (its development is non-rectilinear, like a miter), so its bends never enter
+        // the graph — they would resolve to no flange flat and break the tree.
+        if (bend.id.startsWith('contour::'))
+            continue;
+        // Hem and jog sub-bends (`hem::<id>::<n>` / `jog::<id>::<n>`) are the curl/step
+        // arcs of a recorded hem or jog. Like contour bends they record their own
+        // developed strip (in `part.hems` / `part.jogs`) and lay out non-rectilinearly,
+        // so they never enter the spanning tree.
+        if (bend.id.startsWith('hem::') || bend.id.startsWith('jog::'))
+            continue;
+        // A seam bend (`seam::<parent>::<child>`) is an explicit edge between two
+        // already-authored flats — the cycle-closing edge of a tube/box profile.
+        if (bend.id.startsWith('seam::')) {
+            // Format is `seam::<parent>::<child>`; flange ids are validated to exclude
+            // `::`, so the last delimiter splits parent from child unambiguously.
+            const withoutPrefix = bend.id.slice('seam::'.length);
+            const sep = withoutPrefix.lastIndexOf('::');
+            const parent = sep >= 0 ? withoutPrefix.slice(0, sep) : undefined;
+            const child = sep >= 0 ? withoutPrefix.slice(sep + 2) : undefined;
+            if (parent === undefined || child === undefined || !nodes.has(parent) || !nodes.has(child)) {
+                return err(validationError('UNRESOLVED_SEAM', `seam bend '${bend.id}' references an unknown flat`));
+            }
+            edges.push({ bend, parent, child });
+            continue;
+        }
+        const child = resolveChildFlat(bend.id, nodes);
+        if (child === undefined) {
+            return err(validationError('UNRESOLVED_BEND', `bend '${bend.id}' does not correspond to any flange flat`));
+        }
+        const flange = flangeById.get(child);
+        const parent = resolveParentFlat(flange, nodes);
+        edges.push({ bend, parent, child });
+    }
+    return ok({ nodes, edges });
+}
+function resolveChildFlat(bendId, nodes) {
+    if (nodes.has(bendId))
+        return bendId;
+    const sep = bendId.indexOf('::');
+    if (sep > 0) {
+        const base = bendId.slice(0, sep);
+        if (nodes.has(base))
+            return base;
+    }
+    return undefined;
+}
+function resolveParentFlat(flange, nodes) {
+    if (flange === undefined)
+        return ROOT_FLAT_ID;
+    const ref = flange.baseEdge;
+    // Chained flanges name their parent flat directly; `face-0` is the base flat.
+    if (ref.parentId !== undefined && ref.parentId !== 'face-0' && nodes.has(ref.parentId)) {
+        return ref.parentId;
+    }
+    return nodes.has(`face-${ref.faceIndex}`) ? `face-${ref.faceIndex}` : ROOT_FLAT_ID;
+}
+/**
+ * Spanning tree over the feature graph, rooted at the base flat. Tree edges are
+ * returned BFS-ordered (every parent appears before its children); edges that
+ * would close a cycle (box/closed profiles) become seam cuts with a warning.
+ *
+ * @param graph - the feature graph built by {@link buildFeatureGraph}.
+ * @param rootId - the flat id to root the tree at; defaults to {@link ROOT_FLAT_ID}.
+ * @returns a `Result<FeatureTree>` — `ok` with the BFS-ordered tree bends, seam
+ * cuts, flat nodes, and warnings, or `err` with a `validationError` when the
+ * root is unknown or some flat is unreachable from the root.
+ */
+export function buildFeatureTree(graph, rootId = ROOT_FLAT_ID) {
+    if (!graph.nodes.has(rootId)) {
+        return err(validationError('UNKNOWN_ROOT', `root flat '${rootId}' not present in graph`));
+    }
+    // Authored seam bends (`seam::…`) are explicitly the cycle-closing edges of a
+    // closed profile. They must never enter the spanning tree, or the BFS can grab a
+    // seam as a tree edge and demote a real authored bend to the seam cut — placing
+    // its child flat off the wrong frame. Exclude them from BFS and record them as
+    // seam cuts directly, so authored seams are always the non-tree edges.
+    const seamEdges = [];
+    const treeCandidates = [];
+    for (const edge of graph.edges) {
+        if (edge.bend.id.startsWith('seam::'))
+            seamEdges.push(edge);
+        else
+            treeCandidates.push(edge);
+    }
+    const adjacency = new Map();
+    for (const id of graph.nodes.keys())
+        adjacency.set(id, []);
+    for (const edge of treeCandidates) {
+        adjacency.get(edge.parent)?.push(edge);
+        adjacency.get(edge.child)?.push(edge);
+    }
+    const visited = new Set([rootId]);
+    const treeEdges = new Set();
+    const bends = [];
+    const queue = [rootId];
+    while (queue.length > 0) {
+        const current = queue.shift();
+        if (current === undefined)
+            break;
+        for (const edge of adjacency.get(current) ?? []) {
+            if (treeEdges.has(edge))
+                continue;
+            const next = edge.parent === current ? edge.child : edge.parent;
+            if (visited.has(next))
+                continue;
+            visited.add(next);
+            treeEdges.add(edge);
+            bends.push({ bend: edge.bend, parent: current, child: next });
+            queue.push(next);
+        }
+    }
+    const warnings = [];
+    const seams = [];
+    const recordSeam = (edge) => {
+        seams.push({ bend: edge.bend, between: [edge.parent, edge.child] });
+        warnings.push({
+            code: 'SEAM_CUT',
+            message: `closed profile: bend '${edge.bend.id}' (${edge.parent}↔${edge.child}) becomes a seam cut`,
+            featureId: edge.bend.id,
+        });
+    };
+    for (const edge of seamEdges)
+        recordSeam(edge);
+    // A non-seam edge left out of the tree closes a cycle authored without a seam.
+    for (const edge of treeCandidates) {
+        if (treeEdges.has(edge))
+            continue;
+        recordSeam(edge);
+    }
+    for (const node of graph.nodes.values()) {
+        if (!visited.has(node.id)) {
+            return err(validationError('DISCONNECTED_FLAT', `flat '${node.id}' is not reachable from root '${rootId}'`));
+        }
+    }
+    return ok({ rootId, bends, seams, nodes: graph.nodes, warnings });
+}
+/**
+ * Convenience: graph + spanning tree in one call.
+ *
+ * @param part - the authored sheet-metal part to graph and tree.
+ * @param rootId - the flat id to root the tree at; defaults to {@link ROOT_FLAT_ID}.
+ * @returns a `Result<FeatureTree>` — `ok` with the feature tree, or the first
+ * `err` produced by {@link buildFeatureGraph} or {@link buildFeatureTree}.
+ */
+export function featureTree(part, rootId = ROOT_FLAT_ID) {
+    const graph = buildFeatureGraph(part);
+    if (!graph.ok)
+        return graph;
+    return buildFeatureTree(graph.value, rootId);
+}
+//# sourceMappingURL=featureTreeFns.js.map

package/dist/featureTreeFns.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"featureTreeFns.js","sourceRoot":"","sources":["../src/featureTreeFns.ts"],"names":[],"mappings":"AAAA,OAAO,EAAe,EAAE,EAAE,GAAG,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAGpF,sFAAsF;AACtF,MAAM,CAAC,MAAM,YAAY,GAAG,MAAM,CAAC;AA6CnC;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAoB;IACpD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,SAAS,IAAI,CAAC,EAAE,CAAC;QAC5D,OAAO,GAAG,CAAC,eAAe,CAAC,mBAAmB,EAAE,wCAAwC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IAC7G,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC1C,KAAK,CAAC,GAAG,CAAC,YAAY,EAAE,EAAE,EAAE,EAAE,YAAY,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;IAE5D,MAAM,UAAU,GAAG,IAAI,GAAG,EAAyB,CAAC;IACpD,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;QAClC,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;YACzB,OAAO,GAAG,CAAC,eAAe,CAAC,gBAAgB,EAAE,6BAA6B,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3F,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;QAC/D,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IACpC,CAAC;IAED,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAC7B,OAAO,GAAG,CAAC,eAAe,CAAC,gBAAgB,EAAE,sBAAsB,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QAClF,CAAC;QACD,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEzB,8EAA8E;QAC9E,wEAAwE;QACxE,6EAA6E;QAC7E,+EAA+E;QAC/E,uEAAuE;QACvE,IAAI,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,WAAW,CAAC;YAAE,SAAS;QAE9C,gFAAgF;QAChF,0EAA0E;QAC1E,gFAAgF;QAChF,yCAAyC;QACzC,IAAI,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC;YAAE,SAAS;QAEzE,0EAA0E;QAC1E,yEAAyE;QACzE,IAAI,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;YACjC,2EAA2E;YAC3E,sEAAsE;YACtE,MAAM,aAAa,GAAG,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACrD,MAAM,GAAG,GAAG,aAAa,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YAC5C,MAAM,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAClE,MAAM,KAAK,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAClE,IAAI,MAAM,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3F,OAAO,GAAG,CACR,eAAe,CAAC,iBAAiB,EAAE,cAAc,IAAI,CAAC,EAAE,8BAA8B,CAAC,CACxF,CAAC;YACJ,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;YACpC,SAAS;QACX,CAAC;QAED,MAAM,KAAK,GAAG,gBAAgB,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC/C,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,OAAO,GAAG,CACR,eAAe,CAAC,iBAAiB,EAAE,SAAS,IAAI,CAAC,EAAE,0CAA0C,CAAC,CAC/F,CAAC;QACJ,CAAC;QACD,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACrC,MAAM,MAAM,GAAG,iBAAiB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAChD,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;IACtC,CAAC;IAED,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;AAC9B,CAAC;AAED,SAAS,gBAAgB,CAAC,MAAc,EAAE,KAA4B;IACpE,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC;QAAE,OAAO,MAAM,CAAC;IACrC,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACjC,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;QACZ,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAClC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;IACnC,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,iBAAiB,CAAC,MAAiC,EAAE,KAA4B;IACxF,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,YAAY,CAAC;IAC9C,MAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC;IAC5B,8EAA8E;IAC9E,IAAI,GAAG,CAAC,QAAQ,KAAK,SAAS,IAAI,GAAG,CAAC,QAAQ,KAAK,QAAQ,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;QACvF,OAAO,GAAG,CAAC,QAAQ,CAAC;IACtB,CAAC;IACD,OAAO,KAAK,CAAC,GAAG,CAAC,QAAQ,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC;AACrF,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAmB,EAAE,SAAiB,YAAY;IACjF,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;QAC7B,OAAO,GAAG,CAAC,eAAe,CAAC,cAAc,EAAE,cAAc,MAAM,wBAAwB,CAAC,CAAC,CAAC;IAC5F,CAAC;IAED,8EAA8E;IAC9E,iFAAiF;IACjF,gFAAgF;IAChF,+EAA+E;IAC/E,uEAAuE;IACvE,MAAM,SAAS,GAAe,EAAE,CAAC;IACjC,MAAM,cAAc,GAAe,EAAE,CAAC;IACtC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC;YAAE,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YACvD,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,GAAG,EAAsB,CAAC;IAChD,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE;QAAE,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC3D,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;QAClC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,MAAM,CAAC,CAAC,CAAC;IAC1C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAY,CAAC;IACtC,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,MAAM,KAAK,GAAa,CAAC,MAAM,CAAC,CAAC;IAEjC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,OAAO,KAAK,SAAS;YAAE,MAAM;QACjC,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;YAChD,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YAClC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;YAChE,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YAChC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACpB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;YAC9D,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAwB,EAAE,CAAC;IACzC,MAAM,KAAK,GAAc,EAAE,CAAC;IAC5B,MAAM,UAAU,GAAG,CAAC,IAAc,EAAQ,EAAE;QAC1C,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACpE,QAAQ,CAAC,IAAI,CAAC;YACZ,IAAI,EAAE,UAAU;YAChB,OAAO,EAAE,yBAAyB,IAAI,CAAC,IAAI,CAAC,EAAE,MAAM,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,sBAAsB;YACnG,SAAS,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE;SACxB,CAAC,CAAC;IACL,CAAC,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,SAAS;QAAE,UAAU,CAAC,IAAI,CAAC,CAAC;IAC/C,+EAA+E;IAC/E,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;QAClC,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAClC,UAAU,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;QACxC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAC1B,OAAO,GAAG,CACR,eAAe,CAAC,mBAAmB,EAAE,SAAS,IAAI,CAAC,EAAE,iCAAiC,MAAM,GAAG,CAAC,CACjG,CAAC;QACJ,CAAC;IACH,CAAC;IAED,OAAO,EAAE,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;AACpE,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,WAAW,CAAC,IAAoB,EAAE,SAAiB,YAAY;IAC7E,MAAM,KAAK,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACtC,IAAI,CAAC,KAAK,CAAC,EAAE;QAAE,OAAO,KAAK,CAAC;IAC5B,OAAO,gBAAgB,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;AAC/C,CAAC","sourcesContent":["import { type Result, ok, err, validationError } from '@faicad/faijs/brepjs-compat';\nimport type { BendFeature, FlangeFeature, SheetMetalPart, SheetMetalWarning } from './types.js';\n\n/** Id of the root flat — the part's base flat, present as the root of every graph. */\nexport const ROOT_FLAT_ID = 'root';\n\n/** A flat region in the feature graph (the part's base plus every flange face). */\nexport interface FlatNode {\n  id: string;\n  isRoot: boolean;\n  flange?: FlangeFeature | undefined;\n}\n\n/** A bend connecting two flats. `parent`/`child` are flat ids; `bend` is the recorded feature. */\nexport interface BendEdge {\n  bend: BendFeature;\n  parent: string;\n  child: string;\n}\n\n/** Graph view of an authored part: flats = nodes, bends = edges. */\nexport interface FeatureGraph {\n  nodes: Map<string, FlatNode>;\n  edges: BendEdge[];\n}\n\n/** A bend that survives in the spanning tree, paired with its source/target flat. */\nexport interface TreeBend {\n  bend: BendFeature;\n  parent: string;\n  child: string;\n}\n\n/** A non-tree edge that must be cut to flatten a closed profile. */\nexport interface SeamCut {\n  bend: BendFeature;\n  between: [string, string];\n}\n\n/** Result of a spanning-tree build over a feature graph: BFS-ordered tree bends, seam cuts, and the flat nodes. */\nexport interface FeatureTree {\n  rootId: string;\n  /** Tree edges in breadth-first order (parents precede their children). */\n  bends: TreeBend[];\n  seams: SeamCut[];\n  nodes: Map<string, FlatNode>;\n  warnings: SheetMetalWarning[];\n}\n\n/**\n * Build the feature graph for an authored part. Each flange contributes a flat\n * node `flange.id`; bends connect a parent flat to a child flat. A bend whose id\n * matches a flange id (the flange's own fold) is wired parent→flange; any other\n * bend is matched to a flange by id suffix `<flange>::<n>` or defaults to a\n * root-anchored edge so authored parts always produce a connected graph.\n *\n * @param part - the authored sheet-metal part to graph.\n * @returns a `Result<FeatureGraph>` — `ok` with `{ nodes, edges }` on success,\n * or `err` with a `validationError` for a non-positive thickness, duplicate\n * flange/bend ids, or bends that resolve to no flange flat.\n */\nexport function buildFeatureGraph(part: SheetMetalPart): Result<FeatureGraph> {\n  if (!Number.isFinite(part.thickness) || part.thickness <= 0) {\n    return err(validationError('INVALID_THICKNESS', `part.thickness must be positive, got ${part.thickness}`));\n  }\n\n  const nodes = new Map<string, FlatNode>();\n  nodes.set(ROOT_FLAT_ID, { id: ROOT_FLAT_ID, isRoot: true });\n\n  const flangeById = new Map<string, FlangeFeature>();\n  for (const flange of part.flanges) {\n    if (nodes.has(flange.id)) {\n      return err(validationError('DUPLICATE_FLAT', `duplicate flange/flat id '${flange.id}'`));\n    }\n    nodes.set(flange.id, { id: flange.id, isRoot: false, flange });\n    flangeById.set(flange.id, flange);\n  }\n\n  const edges: BendEdge[] = [];\n  const seenBendIds = new Set<string>();\n  for (const bend of part.bends) {\n    if (seenBendIds.has(bend.id)) {\n      return err(validationError('DUPLICATE_BEND', `duplicate bend id '${bend.id}'`));\n    }\n    seenBendIds.add(bend.id);\n\n    // A contour-flange bend (`contour::<flange>::<n>`) is one arc of a multi-bend\n    // contour flange. The contour flange records its own developed strip in\n    // `part.contourFlanges` and lays out independently of the bend spanning tree\n    // (its development is non-rectilinear, like a miter), so its bends never enter\n    // the graph — they would resolve to no flange flat and break the tree.\n    if (bend.id.startsWith('contour::')) continue;\n\n    // Hem and jog sub-bends (`hem::<id>::<n>` / `jog::<id>::<n>`) are the curl/step\n    // arcs of a recorded hem or jog. Like contour bends they record their own\n    // developed strip (in `part.hems` / `part.jogs`) and lay out non-rectilinearly,\n    // so they never enter the spanning tree.\n    if (bend.id.startsWith('hem::') || bend.id.startsWith('jog::')) continue;\n\n    // A seam bend (`seam::<parent>::<child>`) is an explicit edge between two\n    // already-authored flats — the cycle-closing edge of a tube/box profile.\n    if (bend.id.startsWith('seam::')) {\n      // Format is `seam::<parent>::<child>`; flange ids are validated to exclude\n      // `::`, so the last delimiter splits parent from child unambiguously.\n      const withoutPrefix = bend.id.slice('seam::'.length);\n      const sep = withoutPrefix.lastIndexOf('::');\n      const parent = sep >= 0 ? withoutPrefix.slice(0, sep) : undefined;\n      const child = sep >= 0 ? withoutPrefix.slice(sep + 2) : undefined;\n      if (parent === undefined || child === undefined || !nodes.has(parent) || !nodes.has(child)) {\n        return err(\n          validationError('UNRESOLVED_SEAM', `seam bend '${bend.id}' references an unknown flat`)\n        );\n      }\n      edges.push({ bend, parent, child });\n      continue;\n    }\n\n    const child = resolveChildFlat(bend.id, nodes);\n    if (child === undefined) {\n      return err(\n        validationError('UNRESOLVED_BEND', `bend '${bend.id}' does not correspond to any flange flat`)\n      );\n    }\n    const flange = flangeById.get(child);\n    const parent = resolveParentFlat(flange, nodes);\n    edges.push({ bend, parent, child });\n  }\n\n  return ok({ nodes, edges });\n}\n\nfunction resolveChildFlat(bendId: string, nodes: Map<string, FlatNode>): string | undefined {\n  if (nodes.has(bendId)) return bendId;\n  const sep = bendId.indexOf('::');\n  if (sep > 0) {\n    const base = bendId.slice(0, sep);\n    if (nodes.has(base)) return base;\n  }\n  return undefined;\n}\n\nfunction resolveParentFlat(flange: FlangeFeature | undefined, nodes: Map<string, FlatNode>): string {\n  if (flange === undefined) return ROOT_FLAT_ID;\n  const ref = flange.baseEdge;\n  // Chained flanges name their parent flat directly; `face-0` is the base flat.\n  if (ref.parentId !== undefined && ref.parentId !== 'face-0' && nodes.has(ref.parentId)) {\n    return ref.parentId;\n  }\n  return nodes.has(`face-${ref.faceIndex}`) ? `face-${ref.faceIndex}` : ROOT_FLAT_ID;\n}\n\n/**\n * Spanning tree over the feature graph, rooted at the base flat. Tree edges are\n * returned BFS-ordered (every parent appears before its children); edges that\n * would close a cycle (box/closed profiles) become seam cuts with a warning.\n *\n * @param graph - the feature graph built by {@link buildFeatureGraph}.\n * @param rootId - the flat id to root the tree at; defaults to {@link ROOT_FLAT_ID}.\n * @returns a `Result<FeatureTree>` — `ok` with the BFS-ordered tree bends, seam\n * cuts, flat nodes, and warnings, or `err` with a `validationError` when the\n * root is unknown or some flat is unreachable from the root.\n */\nexport function buildFeatureTree(graph: FeatureGraph, rootId: string = ROOT_FLAT_ID): Result<FeatureTree> {\n  if (!graph.nodes.has(rootId)) {\n    return err(validationError('UNKNOWN_ROOT', `root flat '${rootId}' not present in graph`));\n  }\n\n  // Authored seam bends (`seam::…`) are explicitly the cycle-closing edges of a\n  // closed profile. They must never enter the spanning tree, or the BFS can grab a\n  // seam as a tree edge and demote a real authored bend to the seam cut — placing\n  // its child flat off the wrong frame. Exclude them from BFS and record them as\n  // seam cuts directly, so authored seams are always the non-tree edges.\n  const seamEdges: BendEdge[] = [];\n  const treeCandidates: BendEdge[] = [];\n  for (const edge of graph.edges) {\n    if (edge.bend.id.startsWith('seam::')) seamEdges.push(edge);\n    else treeCandidates.push(edge);\n  }\n\n  const adjacency = new Map<string, BendEdge[]>();\n  for (const id of graph.nodes.keys()) adjacency.set(id, []);\n  for (const edge of treeCandidates) {\n    adjacency.get(edge.parent)?.push(edge);\n    adjacency.get(edge.child)?.push(edge);\n  }\n\n  const visited = new Set<string>([rootId]);\n  const treeEdges = new Set<BendEdge>();\n  const bends: TreeBend[] = [];\n  const queue: string[] = [rootId];\n\n  while (queue.length > 0) {\n    const current = queue.shift();\n    if (current === undefined) break;\n    for (const edge of adjacency.get(current) ?? []) {\n      if (treeEdges.has(edge)) continue;\n      const next = edge.parent === current ? edge.child : edge.parent;\n      if (visited.has(next)) continue;\n      visited.add(next);\n      treeEdges.add(edge);\n      bends.push({ bend: edge.bend, parent: current, child: next });\n      queue.push(next);\n    }\n  }\n\n  const warnings: SheetMetalWarning[] = [];\n  const seams: SeamCut[] = [];\n  const recordSeam = (edge: BendEdge): void => {\n    seams.push({ bend: edge.bend, between: [edge.parent, edge.child] });\n    warnings.push({\n      code: 'SEAM_CUT',\n      message: `closed profile: bend '${edge.bend.id}' (${edge.parent}↔${edge.child}) becomes a seam cut`,\n      featureId: edge.bend.id,\n    });\n  };\n  for (const edge of seamEdges) recordSeam(edge);\n  // A non-seam edge left out of the tree closes a cycle authored without a seam.\n  for (const edge of treeCandidates) {\n    if (treeEdges.has(edge)) continue;\n    recordSeam(edge);\n  }\n\n  for (const node of graph.nodes.values()) {\n    if (!visited.has(node.id)) {\n      return err(\n        validationError('DISCONNECTED_FLAT', `flat '${node.id}' is not reachable from root '${rootId}'`)\n      );\n    }\n  }\n\n  return ok({ rootId, bends, seams, nodes: graph.nodes, warnings });\n}\n\n/**\n * Convenience: graph + spanning tree in one call.\n *\n * @param part - the authored sheet-metal part to graph and tree.\n * @param rootId - the flat id to root the tree at; defaults to {@link ROOT_FLAT_ID}.\n * @returns a `Result<FeatureTree>` — `ok` with the feature tree, or the first\n * `err` produced by {@link buildFeatureGraph} or {@link buildFeatureTree}.\n */\nexport function featureTree(part: SheetMetalPart, rootId: string = ROOT_FLAT_ID): Result<FeatureTree> {\n  const graph = buildFeatureGraph(part);\n  if (!graph.ok) return graph;\n  return buildFeatureTree(graph.value, rootId);\n}\n"]}

package/dist/foldFns.d.ts

@@ -0,0 +1,83 @@
+import { type Result } from '@faicad/faijs/brepjs-compat';
+import type { BendRule, FlatInput, FlatPattern, MaterialSpec, SheetMetalPart, SheetMetalWarning } from './types.js';
+/** A folded part plus the warnings raised while folding (e.g. SEAM_CUT, MIN_RADIUS). */
+export interface FoldResult {
+    part: SheetMetalPart;
+    warnings: SheetMetalWarning[];
+}
+/**
+ * Fold a flat pattern up into a 3D part. Each {@link FoldRegion} folds about its
+ * fold line off its parent region, exactly inverting {@link unfold}: folding by an
+ * angle is the same rigid construction the forward authoring path performs, so this
+ * reuses {@link authorPart}'s bend geometry wholesale rather than re-deriving it.
+ *
+ * The result carries a fully-populated {@link SheetMetalPart} (valid solid + the
+ * BendFeature/FlangeFeature tree consistent with `authorPart`), so
+ * `unfold(fold(input))` round-trips. SEAM_CUT-style and min-radius warnings ride
+ * inside the Ok payload.
+ *
+ * @param input - the flat pattern input to fold.
+ * @returns the folded sheet metal part, or an error.
+ */
+export declare function fold(input: FlatInput): Result<SheetMetalPart>;
+/**
+ * {@link fold} that also surfaces the fold warnings alongside the part.
+ * @param input - the flat pattern input to fold.
+ * @returns the fold result with warnings, or an error.
+ */
+export declare function foldWithWarnings(input: FlatInput): Result<FoldResult>;
+/** How to resolve the bend rule for a bend line read out of a 2D flat pattern. */
+export interface PatternToFlatInputOptions {
+    thickness: number;
+    /**
+     * Rule for bend line `i` (0-based, in {@link FlatPattern.bendLines} order). A flat
+     * pattern is pure geometry and cannot encode K-factor/inner-radius, so the rule is
+     * a required *input*; only the regions/sides/offsets/spans/lengths/angles are
+     * recovered from the 2D geometry.
+     */
+    ruleFor: (bendIndex: number) => BendRule;
+    material?: MaterialSpec | undefined;
+}
+/**
+ * Reconstruct a {@link FlatInput} region-tree from the *2D flat-pattern geometry*
+ * alone — `pattern.outline` (a closed 2D wire) and `pattern.bendLines` (each a 2D
+ * segment + fold angle/direction). Nothing is read from a feature tree or a 3D
+ * solid: the regions, sides, offsets, spans and flat lengths are all recovered by
+ * reading real 2D coordinates back out of the wire/edges via the public morph
+ * geometry readers (`getEdges`, `curveStartPoint`, `curveEndPoint`).
+ *
+ * This is the non-circular round-trip bridge: feeding `unfold(part).pattern` through
+ * here and into {@link fold} exercises unfold's 2D placement, this parser, and the
+ * forward fold geometry — a bug in any of them breaks the round-trip.
+ *
+ * Algorithm (rectilinear families — PR1 develops only axis-aligned rectangles):
+ * every bend line is an axis-aligned segment lying on the shared edge between a
+ * parent region and a child's developed strip. The developed strip width is
+ * `developedLength(angle, thickness, ruleFor(i))` (the supplied rule). BFS outward
+ * from the base region (the one anchored at the origin): a bend line on a known
+ * region's edge spawns a child region whose far edge is the next outward bend line
+ * (a grandchild) or the outline boundary; `length = far-extent − dev`, `span` =
+ * bend-line length, `offset`/`side` are the bend line's position on the parent edge.
+ *
+ * @param pattern - the flat pattern to convert.
+ * @param opts - options (thickness, ruleFor, material).
+ * @returns the flat input, or an error.
+ */
+export declare function patternToFlatInput(pattern: FlatPattern, opts: PatternToFlatInputOptions): Result<FlatInput>;
+/**
+ * Convert an authored {@link SheetMetalPart} into the {@link FlatInput} that folds
+ * back into it, going strictly through the 2D flat pattern: `unfold(part)` produces
+ * the developed wire + bend lines, and {@link patternToFlatInput} recovers the
+ * region tree from that 2D geometry. Only the bend *rule* is read off the part (by
+ * matching bend id), which a flat pattern legitimately cannot encode; every
+ * geometric attribute is parsed from the wire/edges. This makes the round-trip
+ * oracle non-circular — a bug in unfold's 2D placement or in the parser breaks it.
+ *
+ * Seam bends (closed profiles) are left unfolded by `unfold`, so the recovered part
+ * is the open spanning-tree shape, not the re-closed box.
+ *
+ * @param part - the sheet metal part to recover a flat input from.
+ * @returns the flat input, or an error.
+ */
+export declare function partToFlatInput(part: SheetMetalPart): Result<FlatInput>;
+//# sourceMappingURL=foldFns.d.ts.map

package/dist/foldFns.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"foldFns.d.ts","sourceRoot":"","sources":["../src/foldFns.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,KAAK,MAAM,EAQZ,MAAM,6BAA6B,CAAC;AACrC,OAAO,KAAK,EACV,QAAQ,EAER,SAAS,EACT,WAAW,EAIX,YAAY,EACZ,cAAc,EACd,iBAAiB,EAElB,MAAM,YAAY,CAAC;AAWpB,wFAAwF;AACxF,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,cAAc,CAAC;IACrB,QAAQ,EAAE,iBAAiB,EAAE,CAAC;CAC/B;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,IAAI,CAAC,KAAK,EAAE,SAAS,GAAG,MAAM,CAAC,cAAc,CAAC,CAI7D;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,SAAS,GAAG,MAAM,CAAC,UAAU,CAAC,CAyErE;AAiBD,kFAAkF;AAClF,MAAM,WAAW,yBAAyB;IACxC,SAAS,EAAE,MAAM,CAAC;IAClB;;;;;OAKG;IACH,OAAO,EAAE,CAAC,SAAS,EAAE,MAAM,KAAK,QAAQ,CAAC;IACzC,QAAQ,CAAC,EAAE,YAAY,GAAG,SAAS,CAAC;CACrC;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,wBAAgB,kBAAkB,CAChC,OAAO,EAAE,WAAW,EACpB,IAAI,EAAE,yBAAyB,GAC9B,MAAM,CAAC,SAAS,CAAC,CA4BnB;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,cAAc,GAAG,MAAM,CAAC,SAAS,CAAC,CAwBvE"}