agentlas 1.0.42 → 1.0.43

package/CHANGELOG.md

@@ -1,5 +1,20 @@
 # Changelog
 
+## 1.0.43 — 2026-08-11
+
+Zero runtime dependencies. The renderer now lives in this repository.
+
+- The terminal shell's renderer and diagram sources are vendored into
+  `engine/vendor/` and `package.json` declares no runtime dependencies at all.
+  An exact version pin already prevented drift and tampering, but a package
+  removed from the registry would still have broken installs; that last failure
+  mode is now gone, and the code is ours to fix.
+- Upstream copyright notices are preserved beside each vendored tree, as the
+  MIT and Apache-2.0 terms require. The vendoring script refuses to run if a
+  notice is missing.
+- New release gate `vendor-tui-sync` fails when the vendored tree and its
+  upstream differ, so the copy cannot rot silently.
+
 ## 1.0.42 — 2026-08-11
 
 Projects, automations and firms reach the interactive shell; the shell is

package/engine/agentlas-workforce.cjs

@@ -1979,7 +1979,7 @@ function create(deps = {}) {
   const D = deps;
 
   /*
-   * pi-tui 이행 정지작업 (D3 Phase 1-2, 2026-08-11): ctx가 준 Ui가 있으면 그것을
+   * 셸 이행 정지작업 (D3 Phase 1-2, 2026-08-11): ctx가 준 Ui가 있으면 그것을
    * 쓴다. 자체 생성 Ui는 렌더러 교체 시 구 코드가 stdout에 직접 써 프레임을
    * 찢는 병렬 경로였다. 생성은 주입이 없을 때의 폴백으로만 남긴다.
    */

package/engine/hephaestus/runtime.cjs

@@ -195,7 +195,7 @@ function create(ctx, deps = {}) {
   const lang = () => (ctx && ctx.lang) || "en";
 
   /*
-   * pi-tui 이행 정지작업 (D3 Phase 1-2, 2026-08-11): ctx가 준 Ui가 있으면 그것을
+   * 셸 이행 정지작업 (D3 Phase 1-2, 2026-08-11): ctx가 준 Ui가 있으면 그것을
    * 쓴다. 자체 생성 Ui는 렌더러 교체 시 구 코드가 stdout에 직접 써 프레임을
    * 찢는 병렬 경로였다. 생성은 주입이 없을 때의 폴백으로만 남긴다.
    */

package/engine/storm/storm.cjs

@@ -37,7 +37,7 @@ function create(deps) {
   const { swarmRun } = require("./swarm.cjs").create(D);
 
   /*
-   * pi-tui 이행 정지작업 (D3 Phase 1-2, 2026-08-11): ctx가 준 Ui가 있으면 그것을
+   * 셸 이행 정지작업 (D3 Phase 1-2, 2026-08-11): ctx가 준 Ui가 있으면 그것을
    * 쓴다. 자체 생성 Ui는 렌더러 교체 시 구 코드가 stdout에 직접 써 프레임을
    * 찢는 병렬 경로였다. 생성은 주입이 없을 때의 폴백으로만 남긴다.
    */

package/engine/storm/swarm.cjs

@@ -128,7 +128,7 @@ function create(deps) {
   const D = deps;
 
   /*
-   * pi-tui 이행 정지작업 (D3 Phase 1-2, 2026-08-11): ctx가 준 Ui가 있으면 그것을
+   * 셸 이행 정지작업 (D3 Phase 1-2, 2026-08-11): ctx가 준 Ui가 있으면 그것을
    * 쓴다. 자체 생성 Ui는 렌더러 교체 시 구 코드가 stdout에 직접 써 프레임을
    * 찢는 병렬 경로였다. 생성은 주입이 없을 때의 폴백으로만 남긴다.
    */

package/engine/ui/shell.cjs

@@ -29,8 +29,14 @@ const { resolveProjectController, withProjectControllerContext } = require("../p
 
 function loadRenderer() {
   try {
-    // ESM 패키지 — Node >=20.19 의 require(esm). engines 가 이 최소선을 선언한다.
-    return require("@earendil-works/pi-tui");
+    /*
+     * 렌더러는 engine/vendor/tui 에 내재화돼 있다 — npm 의존성이 아니다.
+     * 이유: 정확 핀+무결성 해시는 버전 드리프트·변조를 막지만 레지스트리에서
+     * 그 버전이 삭제되면 설치가 실패한다. 소스가 저장소에 있으면 그 위험이 없고
+     * 우리가 직접 고칠 수 있다. 갱신은 scripts/vendor-tui.mjs.
+     * ESM 이므로 require(esm) 이 필요하다 — engines 가 Node >=20.19 를 선언한다.
+     */
+    return require("../vendor/tui/index.js");
   } catch (cause) {
     throw Object.assign(
       new Error("The Agentlas shell needs Node >=20.19. Run without AGENTLAS_TUI=1, or upgrade Node."),
@@ -272,7 +278,7 @@ async function startShell(ctx, opts = {}) {
             const lbl = e.sourceHandle === "true" ? "|참|" : e.sourceHandle === "false" ? "|거짓|" : "";
             lines.push(`  ${e.source} -->${lbl} ${e.target}`);
           }
-          const { render, toAnsi } = require("grok-mermaid");
+          const { render, toAnsi } = require("../vendor/mermaid/index.js");
           const art = toAnsi(render(lines.join("\n")));
           ui.ensureNl();
           ui.line(ui.c.bold(row.name));

package/engine/vendor/mermaid/LICENSE

@@ -0,0 +1,205 @@
+Copyright 2023-2026 SpaceXAI
+Copyright 2026 Alexey Zaytsev
+
+
+                                 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/engine/vendor/mermaid/ansi.js

@@ -0,0 +1,23 @@
+const ESC = String.fromCharCode(27);
+/** Dim frame, plain labels, cyan connectors. Readable on light and dark. */
+export const DEFAULT_THEME = {
+    border: '2',
+    edge: '36',
+    edgeLabel: '2;36',
+    title: '1',
+};
+/**
+ * Render art to ANSI-coloured lines.
+ *
+ * A convenience over mapping `art.styled` yourself — reach for that directly
+ * when your TUI has its own styling model.
+ */
+export function toAnsi(art, theme = DEFAULT_THEME) {
+    return art.styled.map((row) => row
+        .map((span) => {
+        const sgr = theme[span.cls];
+        return sgr === undefined ? span.text : `${ESC}[${sgr}m${span.text}${ESC}[0m`;
+    })
+        .join(''));
+}
+//# sourceMappingURL=ansi.js.map

package/engine/vendor/mermaid/canvas.js

@@ -0,0 +1,366 @@
+import { measured } from './width.js';
+/**
+ * Sentinel occupying the trailing column of a wide glyph. Never emitted: the
+ * line builder skips it so a CJK character claims two cells of layout but
+ * contributes one character of output.
+ */
+export const CONT = String.fromCharCode(0);
+/** Connection direction bits, combined into a box-drawing glyph by `maskChar`. */
+export const U = 1;
+export const D = 2;
+export const L = 4;
+export const R = 8;
+/** Line styles, tracked per cell so crossing edges keep their own stroke. */
+export const STY_DOT = 1;
+export const STY_THICK = 2;
+export const STY_SOLID = 4;
+/**
+ * A grid of cells. Edges accumulate as direction bits rather than glyphs so
+ * that crossings and junctions resolve correctly whatever order they are drawn
+ * in; `finalizeMask` turns the accumulated bits into characters at the end.
+ *
+ * `occupied` marks cells claimed by a box, which edge bits must not overwrite.
+ */
+export class Canvas {
+    w;
+    h;
+    ch;
+    cls;
+    mask;
+    style;
+    occupied;
+    curStyle = STY_SOLID;
+    constructor(w, h) {
+        const n = w * h;
+        this.w = w;
+        this.h = h;
+        this.ch = new Array(n).fill(' ');
+        this.cls = new Array(n).fill('none');
+        this.mask = new Uint8Array(n);
+        this.style = new Uint8Array(n);
+        this.occupied = new Uint8Array(n);
+    }
+    idx(x, y) {
+        return y * this.w + x;
+    }
+    set(x, y, c, cls) {
+        if (x >= this.w || y >= this.h)
+            return;
+        const i = this.idx(x, y);
+        this.ch[i] = c;
+        this.cls[i] = cls;
+    }
+    /**
+     * Accumulate direction bits on a free cell.
+     *
+     * `cls` is the class to claim the cell for; `border` cells are never
+     * reclassified, so a connector meeting a box keeps the box's styling.
+     */
+    addBits(x, y, bits, cls = 'edge') {
+        if (x >= this.w || y >= this.h)
+            return;
+        const i = this.idx(x, y);
+        if (this.occupied[i])
+            return;
+        this.mask[i] |= bits;
+        this.style[i] |= this.curStyle;
+        if (this.cls[i] !== 'border')
+            this.cls[i] = cls;
+    }
+    /** Stamp a finished sub-canvas (a subgraph frame's contents) at an offset. */
+    blit(sub, ox, oy) {
+        for (let sy = 0; sy < sub.h; sy++) {
+            for (let sx = 0; sx < sub.w; sx++) {
+                const x = ox + sx;
+                const y = oy + sy;
+                if (x >= this.w || y >= this.h)
+                    continue;
+                const si = sub.idx(sx, sy);
+                const di = this.idx(x, y);
+                this.ch[di] = sub.ch[si];
+                this.cls[di] = sub.cls[si];
+                this.style[di] = sub.style[si];
+                this.occupied[di] = 1;
+            }
+        }
+    }
+    /** Add direction bits even to an occupied cell, so an edge can meet a border. */
+    junction(x, y, bits) {
+        if (x >= this.w || y >= this.h)
+            return;
+        const i = this.idx(x, y);
+        this.mask[i] |= bits;
+        if (this.cls[i] !== 'border')
+            this.cls[i] = 'edge';
+    }
+    segV(x, y0, y1) {
+        const a = Math.min(y0, y1);
+        const b = Math.max(y0, y1);
+        for (let y = a; y <= b; y++) {
+            let bits = 0;
+            if (y > a)
+                bits |= U;
+            if (y < b)
+                bits |= D;
+            this.addBits(x, y, bits);
+        }
+    }
+    segH(y, x0, x1) {
+        const a = Math.min(x0, x1);
+        const b = Math.max(x0, x1);
+        for (let x = a; x <= b; x++) {
+            let bits = 0;
+            if (x > a)
+                bits |= L;
+            if (x < b)
+                bits |= R;
+            this.addBits(x, y, bits);
+        }
+    }
+    /** Resolve accumulated direction bits into glyphs, honouring line style. */
+    finalizeMask() {
+        for (let i = 0; i < this.ch.length; i++) {
+            if (this.mask[i] !== 0 && this.ch[i] === ' ') {
+                const c = maskChar(this.mask[i]);
+                this.ch[i] =
+                    this.style[i] === STY_DOT ? dottedChar(c) : this.style[i] === STY_THICK ? thickChar(c) : c;
+            }
+        }
+    }
+    /**
+     * Mirror top-to-bottom for `BT`. Rows reorder but within-row text does not,
+     * so labels stay readable; box-drawing glyphs flip to match.
+     */
+    flipVertical() {
+        for (let y = 0; y < Math.floor(this.h / 2); y++) {
+            const y2 = this.h - 1 - y;
+            for (let x = 0; x < this.w; x++) {
+                const i = this.idx(x, y);
+                const j = this.idx(x, y2);
+                [this.ch[i], this.ch[j]] = [this.ch[j], this.ch[i]];
+                [this.cls[i], this.cls[j]] = [this.cls[j], this.cls[i]];
+            }
+        }
+        for (let i = 0; i < this.ch.length; i++)
+            this.ch[i] = flipGlyphV(this.ch[i]);
+    }
+    /**
+     * Mirror left-to-right for `RL`. Mirroring reverses each row, so after
+     * flipping glyphs each text/label run is reversed back to reading order.
+     */
+    flipHorizontal() {
+        for (let y = 0; y < this.h; y++) {
+            for (let x = 0; x < Math.floor(this.w / 2); x++) {
+                const x2 = this.w - 1 - x;
+                const i = this.idx(x, y);
+                const j = this.idx(x2, y);
+                [this.ch[i], this.ch[j]] = [this.ch[j], this.ch[i]];
+                [this.cls[i], this.cls[j]] = [this.cls[j], this.cls[i]];
+            }
+        }
+        for (let i = 0; i < this.ch.length; i++)
+            this.ch[i] = flipGlyphH(this.ch[i]);
+        for (let y = 0; y < this.h; y++) {
+            let x = 0;
+            while (x < this.w) {
+                const cls = this.cls[this.idx(x, y)];
+                if (cls === 'text' || cls === 'edgeLabel') {
+                    const start = this.idx(x, y);
+                    while (x < this.w && this.cls[this.idx(x, y)] === cls)
+                        x++;
+                    const end = this.idx(x, y);
+                    reverseSlice(this.ch, start, end);
+                }
+                else {
+                    x++;
+                }
+            }
+        }
+    }
+    /** Group each row into runs of one class, dropping wide-glyph continuations. */
+    toLines() {
+        const plain = [];
+        const styled = [];
+        let width = 0;
+        for (let y = 0; y < this.h; y++) {
+            // A trailing CONT counts as painted: it is the second cell of a wide
+            // glyph, so the row really does reach that column.
+            let last = 0;
+            for (let x = this.w - 1; x >= 0; x--) {
+                if (this.ch[this.idx(x, y)] !== ' ') {
+                    last = x + 1;
+                    break;
+                }
+            }
+            width = Math.max(width, last);
+            const spans = [];
+            let plainRow = '';
+            let run = '';
+            let runCls = 'none';
+            for (let x = 0; x < last; x++) {
+                const i = this.idx(x, y);
+                const c = this.ch[i];
+                if (c === CONT)
+                    continue;
+                const cls = this.cls[i];
+                plainRow += c;
+                if (cls !== runCls && run !== '') {
+                    spans.push({ text: run, cls: runCls });
+                    run = '';
+                }
+                runCls = cls;
+                run += c;
+            }
+            if (run !== '')
+                spans.push({ text: run, cls: runCls });
+            styled.push(spans);
+            // Only ASCII spaces, which is all a blank cell ever holds. Trimming `\s`
+            // would eat a trailing NBSP that `styled` keeps, desyncing the two.
+            plain.push(plainRow.replace(/ +$/, ''));
+        }
+        let first = 0;
+        while (first < plain.length && plain[first] === '')
+            first++;
+        let end = plain.length;
+        while (end > first && plain[end - 1] === '')
+            end--;
+        return { plain: plain.slice(first, end), styled: styled.slice(first, end), width };
+    }
+}
+function reverseSlice(arr, start, end) {
+    for (let i = start, j = end - 1; i < j; i++, j--) {
+        ;
+        [arr[i], arr[j]] = [arr[j], arr[i]];
+    }
+}
+/**
+ * Paint `text` at `x, y`, one grapheme cluster per cell.
+ *
+ * A wide cluster claims a second cell, marked with `CONT` so the line builder
+ * emits one character for it rather than a stray space.
+ */
+export function drawText(canvas, text, x, y, cls) {
+    let cur = x;
+    for (const [cluster, cw] of measured(text)) {
+        if (cw === 0)
+            continue;
+        canvas.set(cur, y, cluster, cls);
+        for (let k = 1; k < cw; k++)
+            canvas.set(cur + k, y, CONT, cls);
+        cur += cw;
+    }
+}
+/**
+ * Paint `text` at `x, y`, clearing any edge bits underneath first.
+ *
+ * Used where text sits on top of a drawn line (sequence messages, dividers,
+ * compartment rows) and must win over it.
+ */
+export function drawTextOverEdges(canvas, text, x, y, cls) {
+    let cur = x;
+    for (const [cluster, cw] of measured(text)) {
+        if (cw === 0)
+            continue;
+        for (let k = 0; k < cw; k++) {
+            if (cur + k < canvas.w && y < canvas.h)
+                canvas.mask[canvas.idx(cur + k, y)] = 0;
+            canvas.set(cur + k, y, k === 0 ? cluster : CONT, cls);
+        }
+        cur += cw;
+    }
+}
+export function maskChar(mask) {
+    switch (mask) {
+        case 0:
+            return ' ';
+        case U:
+        case D:
+        case U | D:
+            return '│';
+        case L:
+        case R:
+        case L | R:
+            return '─';
+        case D | R:
+            return '┌';
+        case D | L:
+            return '┐';
+        case U | R:
+            return '└';
+        case U | L:
+            return '┘';
+        case U | D | R:
+            return '├';
+        case U | D | L:
+            return '┤';
+        case D | L | R:
+            return '┬';
+        case U | L | R:
+            return '┴';
+        default:
+            return '┼';
+    }
+}
+const DOTTED = { '─': '╌', '│': '╎' };
+const THICK = {
+    '─': '━',
+    '│': '┃',
+    '┌': '┏',
+    '┐': '┓',
+    '└': '┗',
+    '┘': '┛',
+    '├': '┣',
+    '┤': '┫',
+    '┬': '┳',
+    '┴': '┻',
+    '┼': '╋',
+};
+const FLIP_V = {
+    '┌': '└',
+    '└': '┌',
+    '┐': '┘',
+    '┘': '┐',
+    '┏': '┗',
+    '┗': '┏',
+    '┓': '┛',
+    '┛': '┓',
+    '╭': '╰',
+    '╰': '╭',
+    '╮': '╯',
+    '╯': '╮',
+    '┬': '┴',
+    '┴': '┬',
+    '┳': '┻',
+    '┻': '┳',
+    '▼': '▲',
+    '▲': '▼',
+    '▽': '△',
+    '△': '▽',
+};
+const FLIP_H = {
+    '┌': '┐',
+    '┐': '┌',
+    '└': '┘',
+    '┘': '└',
+    '┏': '┓',
+    '┓': '┏',
+    '┗': '┛',
+    '┛': '┗',
+    '╭': '╮',
+    '╮': '╭',
+    '╰': '╯',
+    '╯': '╰',
+    '├': '┤',
+    '┤': '├',
+    '┣': '┫',
+    '┫': '┣',
+    '▶': '◄',
+    '◄': '▶',
+    '▷': '◁',
+    '◁': '▷',
+};
+export const dottedChar = (c) => DOTTED[c] ?? c;
+export const thickChar = (c) => THICK[c] ?? c;
+export const flipGlyphV = (c) => FLIP_V[c] ?? c;
+export const flipGlyphH = (c) => FLIP_H[c] ?? c;
+//# sourceMappingURL=canvas.js.map