@hexpro/qr-code-studio 0.0.0-stage → 0.1.1

package/dist/geometry/path.js

@@ -0,0 +1,401 @@
+/**
+ * Paths: the one vector shape everything in this package is drawn with.
+ *
+ * Module shapes, finder rings, logo plates, frames and caption glyphs all end
+ * up as a `Path`, and every writer (SVG, the rasteriser, later PDF and EPS)
+ * reads the same commands. So the writers agree about a shape because there is
+ * only one description of it, rather than because four of them were kept in
+ * step by hand.
+ *
+ * Paths are filled with the nonzero rule and every subpath is closed for
+ * filling, as SVG and PDF fill them. There are no strokes: an outline that
+ * must look the same in a scan check and in a print shop is a filled shape.
+ *
+ * Coordinates are float64 and must be finite. NaN or an infinity throws a
+ * TypeError where it enters, because a NaN that reaches a writer comes out as
+ * the text `NaN` in an SVG attribute, or as a pixel nobody can explain.
+ */
+import { checkMatrix, identity, isIdentity } from './matrix.js';
+export const PATH_MOVE = 0, PATH_LINE = 1, PATH_QUAD = 2, PATH_CUBIC = 3, PATH_CLOSE = 4;
+/** Points each command carries, indexed by command. */
+const POINTS_PER = [1, 1, 2, 3, 0];
+/**
+ * The control point distance for a quarter circle drawn as one cubic.
+ *
+ * 4/3 (sqrt 2 - 1), the value that puts the midpoint of the arc exactly on the
+ * circle. The radius elsewhere is at most 0.027 percent long, which is a
+ * thousandth of a pixel on a module 4 pixels across.
+ */
+export const KAPPA = 0.5522847498307936;
+function isNumberList(value) {
+    // Any typed array is an honest list of numbers, and a path that arrives
+    // from somewhere else may have been built with a different one.
+    return Array.isArray(value) || (ArrayBuffer.isView(value) && !(value instanceof DataView));
+}
+/**
+ * Check that a value is a path this package can draw, and throw a TypeError if
+ * not.
+ *
+ * Paths reach the writers from registry entries and from structured clones out
+ * of a worker, so the type system's word for it is not enough: the commands
+ * have to be known ones, the points have to be the right number, and every
+ * coordinate has to be finite.
+ */
+export function checkPath(path, where) {
+    if (typeof path !== 'object' || path === null) {
+        throw new TypeError(`${where}: a path is an object with commands and points.`);
+    }
+    const { commands, points } = path;
+    if (!isNumberList(commands) || !isNumberList(points)) {
+        throw new TypeError(`${where}: a path's commands and points must both be number arrays.`);
+    }
+    let expected = 0;
+    for (let i = 0; i < commands.length; i += 1) {
+        const command = commands[i];
+        if (!Number.isInteger(command) || command < PATH_MOVE || command > PATH_CLOSE) {
+            throw new TypeError(`${where}: command ${i} is not one of the five path commands.`);
+        }
+        expected += POINTS_PER[command] * 2;
+    }
+    if (points.length !== expected) {
+        throw new TypeError(`${where}: the commands need ${expected} coordinates and the path has ${points.length}.`);
+    }
+    for (let i = 0; i < points.length; i += 1) {
+        if (!Number.isFinite(points[i])) {
+            throw new TypeError(`${where}: coordinate ${i} is not a finite number.`);
+        }
+    }
+}
+/**
+ * Report a path's commands to `visitor`, normalised (see `PathVisitor`).
+ *
+ * Validates first, so a visitor never sees half a path before a TypeError.
+ *
+ * A segment with no current point starts a subpath at its own first point, as
+ * a canvas does: a line becomes a move to its end, and a curve moves to its
+ * first control point and draws from there. After a close, the next segment
+ * starts from the closed subpath's first point, as in SVG.
+ */
+export function walkPath(path, visitor, where = 'walkPath') {
+    checkPath(path, where);
+    const { commands, points } = path;
+    let at = 0;
+    let startX = 0;
+    let startY = 0;
+    let hasCurrent = false;
+    // The move that began this subpath is held back until something is drawn
+    // from it, which is how a run of moves collapses to the last one.
+    let pending = false;
+    let drawn = false;
+    const begin = (x, y) => {
+        startX = x;
+        startY = y;
+        hasCurrent = true;
+        pending = true;
+        drawn = false;
+    };
+    const flush = () => {
+        if (pending)
+            visitor.move(startX, startY);
+        pending = false;
+        drawn = true;
+    };
+    for (let i = 0; i < commands.length; i += 1) {
+        const command = commands[i];
+        if (command === PATH_CLOSE) {
+            if (drawn)
+                visitor.close();
+            if (hasCurrent)
+                begin(startX, startY);
+            continue;
+        }
+        const x0 = points[at];
+        const y0 = points[at + 1];
+        if (command === PATH_MOVE || (command === PATH_LINE && !hasCurrent)) {
+            begin(x0, y0);
+            at += 2;
+            continue;
+        }
+        if (!hasCurrent)
+            begin(x0, y0);
+        flush();
+        if (command === PATH_LINE) {
+            visitor.line(x0, y0);
+            at += 2;
+        }
+        else if (command === PATH_QUAD) {
+            visitor.quad(x0, y0, points[at + 2], points[at + 3]);
+            at += 4;
+        }
+        else {
+            visitor.cubic(x0, y0, points[at + 2], points[at + 3], points[at + 4], points[at + 5]);
+            at += 6;
+        }
+    }
+}
+function finite(value, method, name) {
+    if (!Number.isFinite(value)) {
+        throw new TypeError(`PathBuilder.${method}: ${name} is not a finite number.`);
+    }
+}
+/**
+ * Builds a `Path`.
+ *
+ * Every method that adds points runs them through the current transform, so a
+ * module shape can be drawn in its own unit cell and placed by whoever calls
+ * it. `transform` replaces the matrix rather than composing with it, which is
+ * what makes placing one shape after another safe: setting the next cell's
+ * translation cannot inherit the last one's. Compose with `multiply` first when
+ * that is what is wanted.
+ *
+ * The output is normalised as it is built: every subpath begins with a move, a
+ * run of moves keeps only the last, and a move with nothing drawn from it is
+ * dropped.
+ */
+export class PathBuilder {
+    commands = [];
+    points = [];
+    matrix = identity();
+    plain = true;
+    /** The subpath's first point, already transformed, for whatever follows a close. */
+    startX = 0;
+    startY = 0;
+    hasCurrent = false;
+    /** True while the last command is a move nothing has been drawn from yet. */
+    pending = false;
+    segments = 0;
+    /** True until something that draws has been added. */
+    get empty() {
+        return this.segments === 0;
+    }
+    moveTo(x, y) {
+        finite(x, 'moveTo', 'x');
+        finite(y, 'moveTo', 'y');
+        const [tx, ty] = this.apply(x, y);
+        this.begin(tx, ty);
+        return this;
+    }
+    lineTo(x, y) {
+        finite(x, 'lineTo', 'x');
+        finite(y, 'lineTo', 'y');
+        if (!this.hasCurrent)
+            return this.moveTo(x, y);
+        this.segment(PATH_LINE, x, y);
+        return this;
+    }
+    quadTo(cx, cy, x, y) {
+        finite(cx, 'quadTo', 'cx');
+        finite(cy, 'quadTo', 'cy');
+        finite(x, 'quadTo', 'x');
+        finite(y, 'quadTo', 'y');
+        if (!this.hasCurrent)
+            this.moveTo(cx, cy);
+        this.segment(PATH_QUAD, cx, cy, x, y);
+        return this;
+    }
+    cubicTo(c1x, c1y, c2x, c2y, x, y) {
+        finite(c1x, 'cubicTo', 'c1x');
+        finite(c1y, 'cubicTo', 'c1y');
+        finite(c2x, 'cubicTo', 'c2x');
+        finite(c2y, 'cubicTo', 'c2y');
+        finite(x, 'cubicTo', 'x');
+        finite(y, 'cubicTo', 'y');
+        if (!this.hasCurrent)
+            this.moveTo(c1x, c1y);
+        this.segment(PATH_CUBIC, c1x, c1y, c2x, c2y, x, y);
+        return this;
+    }
+    close() {
+        if (!this.hasCurrent)
+            return this;
+        // A subpath that drew nothing has nothing to close; its held move stays
+        // where it is and is replaced or dropped like any other.
+        if (!this.pending)
+            this.commands.push(PATH_CLOSE);
+        this.begin(this.startX, this.startY);
+        return this;
+    }
+    /** Four corners, clockwise as seen (y down) when w and h are positive. */
+    rect(x, y, w, h) {
+        finite(x, 'rect', 'x');
+        finite(y, 'rect', 'y');
+        finite(w, 'rect', 'w');
+        finite(h, 'rect', 'h');
+        return this.moveTo(x, y)
+            .lineTo(x + w, y)
+            .lineTo(x + w, y + h)
+            .lineTo(x, y + h)
+            .close();
+    }
+    /**
+     * A rectangle with rounded corners, wound the same way as `rect`.
+     *
+     * `radii` is one radius or four, for the corners at (x, y), (x + w, y),
+     * (x + w, y + h) and (x, y + h): top left, top right, bottom right and
+     * bottom left when w and h are positive. Each is clamped to between zero and
+     * half the shorter side, so a radius that would make neighbouring corners
+     * overlap gives a stadium or a circle rather than a bow tie.
+     */
+    roundedRect(x, y, w, h, radii) {
+        finite(x, 'roundedRect', 'x');
+        finite(y, 'roundedRect', 'y');
+        finite(w, 'roundedRect', 'w');
+        finite(h, 'roundedRect', 'h');
+        const list = typeof radii === 'number' ? [radii, radii, radii, radii] : radii;
+        if (!Array.isArray(list) || list.length !== 4) {
+            throw new TypeError('PathBuilder.roundedRect: radii is one number or four.');
+        }
+        const limit = Math.min(Math.abs(w), Math.abs(h)) / 2;
+        const r = list.map((value, i) => {
+            finite(value, 'roundedRect', `radius ${i}`);
+            return Math.min(Math.max(value, 0), limit);
+        });
+        // The signs carry the direction of travel, so negative sizes mirror the
+        // shape the way they mirror `rect`.
+        const sx = w < 0 ? -1 : 1;
+        const sy = h < 0 ? -1 : 1;
+        const right = x + w;
+        const bottom = y + h;
+        let atX = x + sx * r[0];
+        let atY = y;
+        this.moveTo(atX, atY);
+        const lineTo = (px, py) => {
+            if (px === atX && py === atY)
+                return;
+            this.lineTo(px, py);
+            atX = px;
+            atY = py;
+        };
+        // A quarter arc into the corner (cx, cy): `in` is the direction travelled
+        // into it and `out` the direction out, both unit and axis aligned. With
+        // no radius it is the corner itself.
+        const arc = (cx, cy, inX, inY, outX, outY, radius) => {
+            if (radius === 0) {
+                lineTo(cx, cy);
+                return;
+            }
+            const ax = cx - inX * radius;
+            const ay = cy - inY * radius;
+            const bx = cx + outX * radius;
+            const by = cy + outY * radius;
+            const k = KAPPA * radius;
+            lineTo(ax, ay);
+            this.cubicTo(ax + inX * k, ay + inY * k, bx - outX * k, by - outY * k, bx, by);
+            atX = bx;
+            atY = by;
+        };
+        arc(right, y, sx, 0, 0, sy, r[1]);
+        arc(right, bottom, 0, sy, -sx, 0, r[2]);
+        arc(x, bottom, -sx, 0, 0, -sy, r[3]);
+        // A square last corner is where the walk began, and the close draws the
+        // side that leads to it.
+        if (r[0] > 0)
+            arc(x, y, 0, -sy, sx, 0, r[0]);
+        return this.close();
+    }
+    /** A circle as four cubic arcs, wound the same way as `rect`. */
+    circle(cx, cy, r) {
+        finite(cx, 'circle', 'cx');
+        finite(cy, 'circle', 'cy');
+        finite(r, 'circle', 'r');
+        const k = KAPPA * r;
+        return this.moveTo(cx + r, cy)
+            .cubicTo(cx + r, cy + k, cx + k, cy + r, cx, cy + r)
+            .cubicTo(cx - k, cy + r, cx - r, cy + k, cx - r, cy)
+            .cubicTo(cx - r, cy - k, cx - k, cy - r, cx, cy - r)
+            .cubicTo(cx + k, cy - r, cx + r, cy - k, cx + r, cy)
+            .close();
+    }
+    /** A closed polygon through `points`, given as x, y pairs. */
+    polygon(points) {
+        if (!Array.isArray(points) || points.length % 2 !== 0) {
+            throw new TypeError('PathBuilder.polygon: points is a list of x, y pairs.');
+        }
+        for (let i = 0; i < points.length; i += 1) {
+            finite(points[i], 'polygon', `coordinate ${i}`);
+        }
+        if (points.length === 0)
+            return this;
+        this.moveTo(points[0], points[1]);
+        for (let i = 2; i < points.length; i += 2) {
+            this.lineTo(points[i], points[i + 1]);
+        }
+        return this.close();
+    }
+    /**
+     * Set the matrix applied to every point added from here on.
+     *
+     * Replaces the current one; see the class comment for why it does not
+     * compose. Points already added stay where they are.
+     */
+    transform(m) {
+        checkMatrix(m, 'PathBuilder.transform');
+        this.matrix = [m[0], m[1], m[2], m[3], m[4], m[5]];
+        this.plain = isIdentity(this.matrix);
+        return this;
+    }
+    /** Add another path's commands, through the current transform. */
+    append(path) {
+        walkPath(path, {
+            move: (x, y) => this.moveTo(x, y),
+            line: (x, y) => this.lineTo(x, y),
+            quad: (cx, cy, x, y) => this.quadTo(cx, cy, x, y),
+            cubic: (c1x, c1y, c2x, c2y, x, y) => this.cubicTo(c1x, c1y, c2x, c2y, x, y),
+            close: () => this.close(),
+        }, 'PathBuilder.append');
+        return this;
+    }
+    /** A fresh path holding everything added so far. The builder can carry on. */
+    build() {
+        let count = this.commands.length;
+        let pointCount = this.points.length;
+        // A trailing move with nothing drawn from it is not part of any shape.
+        if (this.pending) {
+            count -= 1;
+            pointCount -= 2;
+        }
+        return {
+            commands: Uint8Array.from(this.commands.slice(0, count)),
+            points: Float64Array.from(this.points.slice(0, pointCount)),
+        };
+    }
+    apply(x, y) {
+        if (this.plain)
+            return [x, y];
+        const m = this.matrix;
+        const tx = m[0] * x + m[2] * y + m[4];
+        const ty = m[1] * x + m[3] * y + m[5];
+        // Finite numbers can still overflow through a large matrix.
+        if (!Number.isFinite(tx) || !Number.isFinite(ty)) {
+            throw new TypeError('PathBuilder: a point overflowed to infinity through the transform.');
+        }
+        return [tx, ty];
+    }
+    /** Start a subpath at a point already in output space. */
+    begin(tx, ty) {
+        if (this.pending) {
+            // A move with nothing drawn from it is replaced by this one.
+            this.commands.pop();
+            this.points.length -= 2;
+        }
+        this.commands.push(PATH_MOVE);
+        this.points.push(tx, ty);
+        this.startX = tx;
+        this.startY = ty;
+        this.hasCurrent = true;
+        this.pending = true;
+    }
+    segment(command, ...coordinates) {
+        // Transform everything before writing anything, so an overflow leaves
+        // the builder as it was.
+        const out = [];
+        for (let i = 0; i < coordinates.length; i += 2) {
+            out.push(...this.apply(coordinates[i], coordinates[i + 1]));
+        }
+        this.commands.push(command);
+        this.points.push(...out);
+        this.pending = false;
+        this.segments += 1;
+    }
+}
+//# sourceMappingURL=path.js.map

package/dist/geometry/path.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"path.js","sourceRoot":"","sources":["../../src/geometry/path.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAWhE,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,EACzB,SAAS,GAAG,CAAC,EACb,SAAS,GAAG,CAAC,EACb,UAAU,GAAG,CAAC,EACd,UAAU,GAAG,CAAC,CAAC;AAEhB,uDAAuD;AACvD,MAAM,UAAU,GAAsB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAEtD;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,kBAAkB,CAAC;AAmBxC,SAAS,YAAY,CAAC,KAAc;IACnC,wEAAwE;IACxE,gEAAgE;IAChE,OAAO,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,YAAY,QAAQ,CAAC,CAAC,CAAC;AAC5F,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,SAAS,CAAC,IAAU,EAAE,KAAa;IAClD,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;QAC/C,MAAM,IAAI,SAAS,CAAC,GAAG,KAAK,iDAAiD,CAAC,CAAC;IAChF,CAAC;IACD,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;IAClC,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC;QACtD,MAAM,IAAI,SAAS,CAAC,GAAG,KAAK,4DAA4D,CAAC,CAAC;IAC3F,CAAC;IACD,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC7C,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAW,CAAC;QACtC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,OAAO,GAAG,SAAS,IAAI,OAAO,GAAG,UAAU,EAAE,CAAC;YAC/E,MAAM,IAAI,SAAS,CAAC,GAAG,KAAK,aAAa,CAAC,wCAAwC,CAAC,CAAC;QACrF,CAAC;QACD,QAAQ,IAAK,UAAU,CAAC,OAAO,CAAY,GAAG,CAAC,CAAC;IACjD,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;QAChC,MAAM,IAAI,SAAS,CAClB,GAAG,KAAK,uBAAuB,QAAQ,iCAAiC,MAAM,CAAC,MAAM,GAAG,CACxF,CAAC;IACH,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACjC,MAAM,IAAI,SAAS,CAAC,GAAG,KAAK,gBAAgB,CAAC,0BAA0B,CAAC,CAAC;QAC1E,CAAC;IACF,CAAC;AACF,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAU,EAAE,OAAoB,EAAE,KAAK,GAAG,UAAU;IAC5E,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACvB,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;IAClC,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,UAAU,GAAG,KAAK,CAAC;IACvB,yEAAyE;IACzE,kEAAkE;IAClE,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,IAAI,KAAK,GAAG,KAAK,CAAC;IAElB,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,CAAS,EAAQ,EAAE;QAC5C,MAAM,GAAG,CAAC,CAAC;QACX,MAAM,GAAG,CAAC,CAAC;QACX,UAAU,GAAG,IAAI,CAAC;QAClB,OAAO,GAAG,IAAI,CAAC;QACf,KAAK,GAAG,KAAK,CAAC;IACf,CAAC,CAAC;IACF,MAAM,KAAK,GAAG,GAAS,EAAE;QACxB,IAAI,OAAO;YAAE,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC1C,OAAO,GAAG,KAAK,CAAC;QAChB,KAAK,GAAG,IAAI,CAAC;IACd,CAAC,CAAC;IAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC7C,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAW,CAAC;QACtC,IAAI,OAAO,KAAK,UAAU,EAAE,CAAC;YAC5B,IAAI,KAAK;gBAAE,OAAO,CAAC,KAAK,EAAE,CAAC;YAC3B,IAAI,UAAU;gBAAE,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YACtC,SAAS;QACV,CAAC;QACD,MAAM,EAAE,GAAG,MAAM,CAAC,EAAE,CAAW,CAAC;QAChC,MAAM,EAAE,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAW,CAAC;QACpC,IAAI,OAAO,KAAK,SAAS,IAAI,CAAC,OAAO,KAAK,SAAS,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YACrE,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACd,EAAE,IAAI,CAAC,CAAC;YACR,SAAS;QACV,CAAC;QACD,IAAI,CAAC,UAAU;YAAE,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC/B,KAAK,EAAE,CAAC;QACR,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC3B,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACrB,EAAE,IAAI,CAAC,CAAC;QACT,CAAC;aAAM,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAClC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAW,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAW,CAAC,CAAC;YACzE,EAAE,IAAI,CAAC,CAAC;QACT,CAAC;aAAM,CAAC;YACP,OAAO,CAAC,KAAK,CACZ,EAAE,EACF,EAAE,EACF,MAAM,CAAC,EAAE,GAAG,CAAC,CAAW,EACxB,MAAM,CAAC,EAAE,GAAG,CAAC,CAAW,EACxB,MAAM,CAAC,EAAE,GAAG,CAAC,CAAW,EACxB,MAAM,CAAC,EAAE,GAAG,CAAC,CAAW,CACxB,CAAC;YACF,EAAE,IAAI,CAAC,CAAC;QACT,CAAC;IACF,CAAC;AACF,CAAC;AAED,SAAS,MAAM,CAAC,KAAa,EAAE,MAAc,EAAE,IAAY;IAC1D,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QAC7B,MAAM,IAAI,SAAS,CAAC,eAAe,MAAM,KAAK,IAAI,0BAA0B,CAAC,CAAC;IAC/E,CAAC;AACF,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,OAAO,WAAW;IACN,QAAQ,GAAa,EAAE,CAAC;IACxB,MAAM,GAAa,EAAE,CAAC;IAC/B,MAAM,GAAW,QAAQ,EAAE,CAAC;IAC5B,KAAK,GAAG,IAAI,CAAC;IACrB,oFAAoF;IAC5E,MAAM,GAAG,CAAC,CAAC;IACX,MAAM,GAAG,CAAC,CAAC;IACX,UAAU,GAAG,KAAK,CAAC;IAC3B,6EAA6E;IACrE,OAAO,GAAG,KAAK,CAAC;IAChB,QAAQ,GAAG,CAAC,CAAC;IAErB,sDAAsD;IACtD,IAAI,KAAK;QACR,OAAO,IAAI,CAAC,QAAQ,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED,MAAM,CAAC,CAAS,EAAE,CAAS;QAC1B,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACnB,OAAO,IAAI,CAAC;IACb,CAAC;IAED,MAAM,CAAC,CAAS,EAAE,CAAS;QAC1B,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,UAAU;YAAE,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/C,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9B,OAAO,IAAI,CAAC;IACb,CAAC;IAED,MAAM,CAAC,EAAU,EAAE,EAAU,EAAE,CAAS,EAAE,CAAS;QAClD,MAAM,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;QAC3B,MAAM,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;QAC3B,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,UAAU;YAAE,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1C,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACtC,OAAO,IAAI,CAAC;IACb,CAAC;IAED,OAAO,CAAC,GAAW,EAAE,GAAW,EAAE,GAAW,EAAE,GAAW,EAAE,CAAS,EAAE,CAAS;QAC/E,MAAM,CAAC,GAAG,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;QAC9B,MAAM,CAAC,GAAG,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;QAC9B,MAAM,CAAC,GAAG,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;QAC9B,MAAM,CAAC,GAAG,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;QAC9B,MAAM,CAAC,CAAC,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;QAC1B,MAAM,CAAC,CAAC,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,IAAI,CAAC,UAAU;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC5C,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,OAAO,IAAI,CAAC;IACb,CAAC;IAED,KAAK;QACJ,IAAI,CAAC,IAAI,CAAC,UAAU;YAAE,OAAO,IAAI,CAAC;QAClC,wEAAwE;QACxE,yDAAyD;QACzD,IAAI,CAAC,IAAI,CAAC,OAAO;YAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAClD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,OAAO,IAAI,CAAC;IACb,CAAC;IAED,0EAA0E;IAC1E,IAAI,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS;QAC9C,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;QACvB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;QACvB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;QACvB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;QACvB,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;aACtB,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;aAChB,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;aACpB,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;aAChB,KAAK,EAAE,CAAC;IACX,CAAC;IAED;;;;;;;;OAQG;IACH,WAAW,CACV,CAAS,EACT,CAAS,EACT,CAAS,EACT,CAAS,EACT,KAAyD;QAEzD,MAAM,CAAC,CAAC,EAAE,aAAa,EAAE,GAAG,CAAC,CAAC;QAC9B,MAAM,CAAC,CAAC,EAAE,aAAa,EAAE,GAAG,CAAC,CAAC;QAC9B,MAAM,CAAC,CAAC,EAAE,aAAa,EAAE,GAAG,CAAC,CAAC;QAC9B,MAAM,CAAC,CAAC,EAAE,aAAa,EAAE,GAAG,CAAC,CAAC;QAC9B,MAAM,IAAI,GACT,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAClE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/C,MAAM,IAAI,SAAS,CAAC,uDAAuD,CAAC,CAAC;QAC9E,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACrD,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE;YAC/B,MAAM,CAAC,KAAK,EAAE,aAAa,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC;YAC5C,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAC5C,CAAC,CAAqC,CAAC;QAEvC,wEAAwE;QACxE,oCAAoC;QACpC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;QACpB,MAAM,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC;QACrB,IAAI,GAAG,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEtB,MAAM,MAAM,GAAG,CAAC,EAAU,EAAE,EAAU,EAAQ,EAAE;YAC/C,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG;gBAAE,OAAO;YACrC,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACpB,GAAG,GAAG,EAAE,CAAC;YACT,GAAG,GAAG,EAAE,CAAC;QACV,CAAC,CAAC;QACF,0EAA0E;QAC1E,wEAAwE;QACxE,qCAAqC;QACrC,MAAM,GAAG,GAAG,CACX,EAAU,EACV,EAAU,EACV,GAAW,EACX,GAAW,EACX,IAAY,EACZ,IAAY,EACZ,MAAc,EACP,EAAE;YACT,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;gBAClB,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;gBACf,OAAO;YACR,CAAC;YACD,MAAM,EAAE,GAAG,EAAE,GAAG,GAAG,GAAG,MAAM,CAAC;YAC7B,MAAM,EAAE,GAAG,EAAE,GAAG,GAAG,GAAG,MAAM,CAAC;YAC7B,MAAM,EAAE,GAAG,EAAE,GAAG,IAAI,GAAG,MAAM,CAAC;YAC9B,MAAM,EAAE,GAAG,EAAE,GAAG,IAAI,GAAG,MAAM,CAAC;YAC9B,MAAM,CAAC,GAAG,KAAK,GAAG,MAAM,CAAC;YACzB,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACf,IAAI,CAAC,OAAO,CAAC,EAAE,GAAG,GAAG,GAAG,CAAC,EAAE,EAAE,GAAG,GAAG,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;YAC/E,GAAG,GAAG,EAAE,CAAC;YACT,GAAG,GAAG,EAAE,CAAC;QACV,CAAC,CAAC;QAEF,GAAG,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,wEAAwE;QACxE,yBAAyB;QACzB,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;YAAE,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC;IAED,iEAAiE;IACjE,MAAM,CAAC,EAAU,EAAE,EAAU,EAAE,CAAS;QACvC,MAAM,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;QAC3B,MAAM,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;QAC3B,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;QACpB,OAAO,IAAI,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC;aAC5B,OAAO,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;aACnD,OAAO,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC;aACnD,OAAO,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;aACnD,OAAO,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC;aACnD,KAAK,EAAE,CAAC;IACX,CAAC;IAED,8DAA8D;IAC9D,OAAO,CAAC,MAAyB;QAChC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACvD,MAAM,IAAI,SAAS,CAAC,sDAAsD,CAAC,CAAC;QAC7E,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3C,MAAM,CAAC,MAAM,CAAC,CAAC,CAAW,EAAE,SAAS,EAAE,cAAc,CAAC,EAAE,CAAC,CAAC;QAC3D,CAAC;QACD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACrC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAW,EAAE,MAAM,CAAC,CAAC,CAAW,CAAC,CAAC;QACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3C,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAW,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAW,CAAC,CAAC;QAC3D,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC;IAED;;;;;OAKG;IACH,SAAS,CAAC,CAAS;QAClB,WAAW,CAAC,CAAC,EAAE,uBAAuB,CAAC,CAAC;QACxC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,OAAO,IAAI,CAAC;IACb,CAAC;IAED,kEAAkE;IAClE,MAAM,CAAC,IAAU;QAChB,QAAQ,CACP,IAAI,EACJ;YACC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;YACjC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;YACjC,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;YACjD,KAAK,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;YAC3E,KAAK,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE;SACzB,EACD,oBAAoB,CACpB,CAAC;QACF,OAAO,IAAI,CAAC;IACb,CAAC;IAED,8EAA8E;IAC9E,KAAK;QACJ,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QACjC,IAAI,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QACpC,uEAAuE;QACvE,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAClB,KAAK,IAAI,CAAC,CAAC;YACX,UAAU,IAAI,CAAC,CAAC;QACjB,CAAC;QACD,OAAO;YACN,QAAQ,EAAE,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YACxD,MAAM,EAAE,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;SAC3D,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,CAAS,EAAE,CAAS;QACjC,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,4DAA4D;QAC5D,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;YAClD,MAAM,IAAI,SAAS,CAAC,oEAAoE,CAAC,CAAC;QAC3F,CAAC;QACD,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACjB,CAAC;IAED,0DAA0D;IAClD,KAAK,CAAC,EAAU,EAAE,EAAU;QACnC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAClB,6DAA6D;YAC7D,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;YACpB,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC;QACzB,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC9B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACzB,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACjB,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACjB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACvB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;IACrB,CAAC;IAEO,OAAO,CAAC,OAAe,EAAE,GAAG,WAAqB;QACxD,sEAAsE;QACtE,yBAAyB;QACzB,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAChD,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAW,EAAE,WAAW,CAAC,CAAC,GAAG,CAAC,CAAW,CAAC,CAAC,CAAC;QACjF,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC5B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC;QACrB,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;IACpB,CAAC;CACD"}

package/dist/geometry/trace.d.ts

@@ -0,0 +1,29 @@
+/**
+ * The outline of a grid of dark cells, as few closed shapes as possible.
+ *
+ * A QR symbol drawn one square per module is thousands of subpaths, every
+ * shared edge between two neighbours is drawn twice, and an SVG renderer that
+ * anti-aliases each square on its own leaves a faint seam along every one of
+ * them. Tracing the boundary instead gives one outline per connected shape,
+ * with nothing to seam, and a file a fraction of the size.
+ *
+ * Every edge of the outline runs along a cell boundary with the dark cell on
+ * its right as seen with y down, so outer edges go clockwise and the edges of
+ * holes go anticlockwise, and the nonzero rule fills exactly the dark cells.
+ * Corners are integers, so the outline is exact: at any integer scale it
+ * covers whole pixels and nothing else.
+ *
+ * The one choice in tracing is at a vertex where two dark cells meet only
+ * diagonally. The boundary passes through it twice, and the two passes can be
+ * joined either way: each cell keeps its own corner, or the boundary crosses
+ * over to the other cell. Either fills the same cells. Which one gives fewer
+ * outlines depends on the grid, so this traces once keeping corners, then
+ * crosses over at each such vertex where that joins two different outlines.
+ * Joining two cycles of a permutation by swapping two successors always gives
+ * one cycle, so every crossing removes an outline, and an outline is never
+ * split. The result is the fewest the grid allows.
+ */
+import type { Path } from './path.js';
+/** Merge a grid of dark cells into the fewest closed outlines (holes wound the other way). */
+export declare function traceGrid(width: number, height: number, dark: (x: number, y: number) => boolean): Path;
+//# sourceMappingURL=trace.d.ts.map

package/dist/geometry/trace.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"trace.d.ts","sourceRoot":"","sources":["../../src/geometry/trace.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAGH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAMtC,8FAA8F;AAC9F,wBAAgB,SAAS,CACxB,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,KAAK,OAAO,GACrC,IAAI,CAoIN"}

package/dist/geometry/trace.js

@@ -0,0 +1,166 @@
+/**
+ * The outline of a grid of dark cells, as few closed shapes as possible.
+ *
+ * A QR symbol drawn one square per module is thousands of subpaths, every
+ * shared edge between two neighbours is drawn twice, and an SVG renderer that
+ * anti-aliases each square on its own leaves a faint seam along every one of
+ * them. Tracing the boundary instead gives one outline per connected shape,
+ * with nothing to seam, and a file a fraction of the size.
+ *
+ * Every edge of the outline runs along a cell boundary with the dark cell on
+ * its right as seen with y down, so outer edges go clockwise and the edges of
+ * holes go anticlockwise, and the nonzero rule fills exactly the dark cells.
+ * Corners are integers, so the outline is exact: at any integer scale it
+ * covers whole pixels and nothing else.
+ *
+ * The one choice in tracing is at a vertex where two dark cells meet only
+ * diagonally. The boundary passes through it twice, and the two passes can be
+ * joined either way: each cell keeps its own corner, or the boundary crosses
+ * over to the other cell. Either fills the same cells. Which one gives fewer
+ * outlines depends on the grid, so this traces once keeping corners, then
+ * crosses over at each such vertex where that joins two different outlines.
+ * Joining two cycles of a permutation by swapping two successors always gives
+ * one cycle, so every crossing removes an outline, and an outline is never
+ * split. The result is the fewest the grid allows.
+ */
+import { PATH_CLOSE, PATH_LINE, PATH_MOVE } from './path.js';
+/** Right, down, left, up: the order a turn to the right walks them in. */
+const DX = [1, 0, -1, 0];
+const DY = [0, 1, 0, -1];
+/** Merge a grid of dark cells into the fewest closed outlines (holes wound the other way). */
+export function traceGrid(width, height, dark) {
+    if (!Number.isInteger(width) || width < 0 || !Number.isInteger(height) || height < 0) {
+        throw new TypeError('traceGrid: width and height are whole numbers, zero or more.');
+    }
+    if (typeof dark !== 'function') {
+        throw new TypeError('traceGrid: dark is a function of x and y.');
+    }
+    // Asked once per cell, so a caller's function is never asked twice and
+    // can be as slow as it likes.
+    const cells = new Uint8Array(width * height);
+    for (let y = 0; y < height; y += 1) {
+        for (let x = 0; x < width; x += 1) {
+            if (dark(x, y))
+                cells[y * width + x] = 1;
+        }
+    }
+    const isDark = (x, y) => x >= 0 && y >= 0 && x < width && y < height && cells[y * width + x] === 1;
+    const stride = width + 1;
+    const vertices = stride * (height + 1);
+    // Outgoing boundary edges at each vertex, one bit per direction.
+    const out = new Uint8Array(vertices);
+    for (let y = 0; y <= height; y += 1) {
+        for (let x = 0; x < width; x += 1) {
+            const above = isDark(x, y - 1);
+            const below = isDark(x, y);
+            if (below && !above)
+                out[y * stride + x] |= 1 << 0;
+            else if (above && !below)
+                out[y * stride + x + 1] |= 1 << 2;
+        }
+    }
+    for (let x = 0; x <= width; x += 1) {
+        for (let y = 0; y < height; y += 1) {
+            const left = isDark(x - 1, y);
+            const right = isDark(x, y);
+            if (left && !right)
+                out[y * stride + x] |= 1 << 1;
+            else if (right && !left)
+                out[(y + 1) * stride + x] |= 1 << 3;
+        }
+    }
+    // At a vertex with two ways out, whether to turn left (cross to the other
+    // diagonal cell) rather than right (keep this cell's corner).
+    const cross = new Uint8Array(vertices);
+    const next = (vertex, direction) => {
+        const mask = out[vertex];
+        if ((mask & (mask - 1)) === 0)
+            return 31 - Math.clz32(mask);
+        return cross[vertex] === 1 ? (direction + 3) % 4 : (direction + 1) % 4;
+    };
+    const step = (vertex, direction) => vertex + DX[direction] + DY[direction] * stride;
+    // First pass: label every edge with the outline it belongs to when every
+    // diagonal vertex keeps its corners.
+    const label = new Int32Array(vertices * 4).fill(-1);
+    let outlines = 0;
+    for (let v = 0; v < vertices; v += 1) {
+        const mask = out[v];
+        for (let d = 0; d < 4; d += 1) {
+            if ((mask & (1 << d)) === 0 || label[v * 4 + d] !== -1)
+                continue;
+            let vertex = v;
+            let direction = d;
+            do {
+                label[vertex * 4 + direction] = outlines;
+                vertex = step(vertex, direction);
+                direction = next(vertex, direction);
+            } while (vertex !== v || direction !== d);
+            outlines += 1;
+        }
+    }
+    // Second pass: cross over wherever that joins two outlines that are still
+    // separate, tracked with a union-find over the first pass's labels.
+    const parent = Int32Array.from({ length: outlines }, (_, i) => i);
+    const root = (i) => {
+        let at = i;
+        while (parent[at] !== at) {
+            parent[at] = parent[parent[at]];
+            at = parent[at];
+        }
+        return at;
+    };
+    for (let v = 0; v < vertices; v += 1) {
+        const mask = out[v];
+        if ((mask & (mask - 1)) === 0)
+            continue;
+        const first = 31 - Math.clz32(mask & -mask);
+        const second = 31 - Math.clz32(mask);
+        const a = root(label[v * 4 + first]);
+        const b = root(label[v * 4 + second]);
+        if (a === b)
+            continue;
+        cross[v] = 1;
+        parent[a] = b;
+    }
+    // Final pass: walk each outline once more and keep only its corners.
+    const commands = [];
+    const points = [];
+    const visited = new Uint8Array(vertices * 4);
+    const loopVertices = [];
+    const loopDirections = [];
+    for (let v = 0; v < vertices; v += 1) {
+        const mask = out[v];
+        for (let d = 0; d < 4; d += 1) {
+            if ((mask & (1 << d)) === 0 || visited[v * 4 + d] === 1)
+                continue;
+            loopVertices.length = 0;
+            loopDirections.length = 0;
+            let vertex = v;
+            let direction = d;
+            do {
+                visited[vertex * 4 + direction] = 1;
+                loopVertices.push(vertex);
+                loopDirections.push(direction);
+                vertex = step(vertex, direction);
+                direction = next(vertex, direction);
+            } while (vertex !== v || direction !== d);
+            // A corner is where the direction changes. The first vertex found in
+            // raster order is always one (nothing of its outline lies above it or
+            // to its left), but the walk does not rely on that.
+            const n = loopVertices.length;
+            let started = false;
+            for (let k = 0; k < n; k += 1) {
+                const before = loopDirections[(k + n - 1) % n];
+                if (loopDirections[k] === before)
+                    continue;
+                const at = loopVertices[k];
+                commands.push(started ? PATH_LINE : PATH_MOVE);
+                points.push(at % stride, Math.floor(at / stride));
+                started = true;
+            }
+            commands.push(PATH_CLOSE);
+        }
+    }
+    return { commands: Uint8Array.from(commands), points: Float64Array.from(points) };
+}
+//# sourceMappingURL=trace.js.map

package/dist/geometry/trace.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"trace.js","sourceRoot":"","sources":["../../src/geometry/trace.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAG7D,0EAA0E;AAC1E,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAU,CAAC;AAClC,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAU,CAAC;AAElC,8FAA8F;AAC9F,MAAM,UAAU,SAAS,CACxB,KAAa,EACb,MAAc,EACd,IAAuC;IAEvC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;QACtF,MAAM,IAAI,SAAS,CAAC,8DAA8D,CAAC,CAAC;IACrF,CAAC;IACD,IAAI,OAAO,IAAI,KAAK,UAAU,EAAE,CAAC;QAChC,MAAM,IAAI,SAAS,CAAC,2CAA2C,CAAC,CAAC;IAClE,CAAC;IAED,uEAAuE;IACvE,8BAA8B;IAC9B,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC;IAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;gBAAE,KAAK,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1C,CAAC;IACF,CAAC;IACD,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,CAAS,EAAW,EAAE,CAChD,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,MAAM,IAAI,KAAK,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAE3E,MAAM,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC;IACzB,MAAM,QAAQ,GAAG,MAAM,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACvC,iEAAiE;IACjE,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC;IACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YAC/B,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3B,IAAI,KAAK,IAAI,CAAC,KAAK;gBAAE,GAAG,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;iBAC9C,IAAI,KAAK,IAAI,CAAC,KAAK;gBAAE,GAAG,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7D,CAAC;IACF,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACpC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9B,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3B,IAAI,IAAI,IAAI,CAAC,KAAK;gBAAE,GAAG,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;iBAC7C,IAAI,KAAK,IAAI,CAAC,IAAI;gBAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9D,CAAC;IACF,CAAC;IAED,0EAA0E;IAC1E,8DAA8D;IAC9D,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC;IACvC,MAAM,IAAI,GAAG,CAAC,MAAc,EAAE,SAAiB,EAAU,EAAE;QAC1D,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAW,CAAC;QACnC,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;YAAE,OAAO,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC5D,OAAO,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACxE,CAAC,CAAC;IACF,MAAM,IAAI,GAAG,CAAC,MAAc,EAAE,SAAiB,EAAU,EAAE,CAC1D,MAAM,GAAI,EAAE,CAAC,SAAS,CAAY,GAAI,EAAE,CAAC,SAAS,CAAY,GAAG,MAAM,CAAC;IAEzE,yEAAyE;IACzE,qCAAqC;IACrC,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACpD,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAW,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;gBAAE,SAAS;YACjE,IAAI,MAAM,GAAG,CAAC,CAAC;YACf,IAAI,SAAS,GAAG,CAAC,CAAC;YAClB,GAAG,CAAC;gBACH,KAAK,CAAC,MAAM,GAAG,CAAC,GAAG,SAAS,CAAC,GAAG,QAAQ,CAAC;gBACzC,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;gBACjC,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;YACrC,CAAC,QAAQ,MAAM,KAAK,CAAC,IAAI,SAAS,KAAK,CAAC,EAAE;YAC1C,QAAQ,IAAI,CAAC,CAAC;QACf,CAAC;IACF,CAAC;IAED,0EAA0E;IAC1E,oEAAoE;IACpE,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAClE,MAAM,IAAI,GAAG,CAAC,CAAS,EAAU,EAAE;QAClC,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,OAAO,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC;YAC1B,MAAM,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,CAAW,CAAW,CAAC;YACpD,EAAE,GAAG,MAAM,CAAC,EAAE,CAAW,CAAC;QAC3B,CAAC;QACD,OAAO,EAAE,CAAC;IACX,CAAC,CAAC;IACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAW,CAAC;QAC9B,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;YAAE,SAAS;QACxC,MAAM,KAAK,GAAG,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAW,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAW,CAAC,CAAC;QAChD,IAAI,CAAC,KAAK,CAAC;YAAE,SAAS;QACtB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACb,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;IAED,qEAAqE;IACrE,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;IAC7C,MAAM,YAAY,GAAa,EAAE,CAAC;IAClC,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAW,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;gBAAE,SAAS;YAClE,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC;YACxB,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC;YAC1B,IAAI,MAAM,GAAG,CAAC,CAAC;YACf,IAAI,SAAS,GAAG,CAAC,CAAC;YAClB,GAAG,CAAC;gBACH,OAAO,CAAC,MAAM,GAAG,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;gBACpC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC1B,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAC/B,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;gBACjC,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;YACrC,CAAC,QAAQ,MAAM,KAAK,CAAC,IAAI,SAAS,KAAK,CAAC,EAAE;YAE1C,qEAAqE;YACrE,sEAAsE;YACtE,oDAAoD;YACpD,MAAM,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC;YAC9B,IAAI,OAAO,GAAG,KAAK,CAAC;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC/B,MAAM,MAAM,GAAG,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC/C,IAAI,cAAc,CAAC,CAAC,CAAC,KAAK,MAAM;oBAAE,SAAS;gBAC3C,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,CAAW,CAAC;gBACrC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;gBAC/C,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;gBAClD,OAAO,GAAG,IAAI,CAAC;YAChB,CAAC;YACD,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC3B,CAAC;IACF,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;AACnF,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,20 @@
+/**
+ * The everyday surface: make a code, design it, draw it.
+ *
+ * Kept small on purpose. The reader, the print writers and the fonts are each
+ * tens of kilobytes that most callers never need, so they are subpaths of
+ * their own (`./decode`, `./render`, `./text`) and nothing here imports them;
+ * tests/studio/root.test.ts bundles this file and fails if one creeps in.
+ */
+export * from './core/index.js';
+export { encode, encodeStructuredAppend } from './encode/index.js';
+export type { EncodeOptions } from './encode/index.js';
+export { createRegistries } from './registries.js';
+export type { Registries } from './registries.js';
+export { applyConstraints, decodeDesignLink, defaultDesign, designLink, encodeDesignLink, migrateDesign, validateDesign, } from './design/index.js';
+export { buildScene } from './design/scene.js';
+export type { BuiltScene, DesignRegistries, QrDesignV1 } from './design/index.js';
+export { sceneToSvg } from './render/svg.js';
+export type { Scene } from './render/types.js';
+export type { BuiltSymbol } from './symbology/types.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,cAAc,iBAAiB,CAAC;AAChC,OAAO,EAAE,MAAM,EAAE,sBAAsB,EAAE,MAAM,mBAAmB,CAAC;AACnE,YAAY,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AACvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AACnD,YAAY,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAClD,OAAO,EACN,gBAAgB,EAChB,gBAAgB,EAChB,aAAa,EACb,UAAU,EACV,gBAAgB,EAChB,aAAa,EACb,cAAc,GACd,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,YAAY,EAAE,UAAU,EAAE,gBAAgB,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAClF,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,YAAY,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAC/C,YAAY,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC"}