@agile-team/mach-report 2.21.1 → 2.23.0

package/dist/template-serialization-Cc3h-miv.js

@@ -1,247 +0,0 @@
-import { e as x, c as v } from "./computed-C8NRZQss.js";
-class V extends Error {
-  constructor(e) {
-    super(`树节点超出行数预算 ${e}`), this.limit = e, this.code = "tree-row-limit", this.name = "TreeRowLimitError";
-  }
-}
-function p(r, e, n, i) {
-  const t = r ?? e;
-  if (!Number.isInteger(t) || t < 1 || t > n) throw new Error(`${i}应为 1–${n} 的整数`);
-  return t;
-}
-function y(r) {
-  return { rows: p(r.maxRows, 1e5, 1e6, "树行数预算"), depth: p(r.maxDepth, 64, 256, "树深度预算"), visits: p(r.maxAggregationVisits, 1e6, 1e7, "树聚合访问预算") };
-}
-function A(r) {
-  return typeof r == "string" && !!r.trim();
-}
-function h(r) {
-  return A(r) && !["__proto__", "prototype", "constructor"].includes(r);
-}
-function M(r) {
-  if (A(r) || typeof r == "number" && Number.isFinite(r)) return r;
-  throw new Error("树节点业务键应为非空字符串或有限数字");
-}
-function N(r) {
-  return JSON.stringify([typeof r, r]);
-}
-function k(r) {
-  return [r.idField, ...r.input === "flat" ? [r.parentField ?? ""] : [r.childrenField ?? "children"]];
-}
-function O(r, e) {
-  const n = k(r);
-  if (e?.some((i) => i.scope && i.scope !== "row" || n.includes(i.field))) throw new Error("树形布局仅支持不覆盖结构键的当前行计算");
-}
-function w(r) {
-  if (!r?.aborted) return;
-  const e = new Error("树报表处理已取消");
-  throw e.name = "AbortError", e;
-}
-function $(r) {
-  const e = r.aggregates ?? [];
-  if (!Array.isArray(e) || e.length > 32) throw new Error("树聚合最多 32 项");
-  if (r.parentValues !== "leaf-aggregate" && e.length) throw new Error("树聚合需显式选择 leaf-aggregate 父级取值策略");
-  if (r.parentValues === "leaf-aggregate" && !e.length) throw new Error("叶子聚合策略至少需要一个聚合字段");
-  const n = /* @__PURE__ */ new Set();
-  for (const i of e) {
-    if (!i || !h(i.field) || n.has(i.field)) throw new Error("树聚合输出字段应安全、非空且唯一");
-    for (const t of [i.valueField, i.weightField]) if (t !== void 0 && !h(t)) throw new Error("树聚合来源字段应安全且非空");
-    if ([...k(r), r.labelField].includes(i.field)) throw new Error("树聚合不能覆盖结构键或标签字段");
-    n.add(i.field), v({ ...i, field: i.valueField ?? i.field });
-  }
-}
-function R(r) {
-  if (!h(r.idField) || !h(r.labelField)) throw new Error("树需要安全的业务键和标签字段");
-  if (r.input === "flat" && (!h(r.parentField) || r.parentField === r.idField)) throw new Error("扁平树需要独立的父键字段");
-  if (r.childrenField !== void 0 && !h(r.childrenField)) throw new Error("子节点字段应安全且非空");
-  if (r.input === "nested" && [r.idField, r.labelField].includes(r.childrenField ?? "children")) throw new Error("子节点字段不能覆盖业务键或标签字段");
-}
-function I(r) {
-  if (!r || typeof r != "object" || !["flat", "nested"].includes(r.input)) throw new Error("树输入应为 flat 或 nested");
-  if (R(r), r.orphan !== void 0 && !["error", "root"].includes(r.orphan)) throw new Error("树孤儿策略应为 error 或 root");
-  if (r.parentValues !== void 0 && !["source", "leaf-aggregate"].includes(r.parentValues)) throw new Error("未知树父级取值策略");
-  if (r.indentMm !== void 0 && (!Number.isFinite(r.indentMm) || r.indentMm < 0 || r.indentMm > 20)) throw new Error("树每级缩进应为 0–20 mm");
-  y(r), $(r);
-}
-function C(r, e, n, i) {
-  if (!r || typeof r != "object" || Array.isArray(r)) throw new Error("树节点应为对象");
-  if (n.size >= i.rows) throw new V(i.rows);
-  const t = M(r[e.idField]), f = N(t);
-  if (n.has(f)) throw new Error(`树节点业务键重复：${String(t)}`);
-  const o = { original: r, row: r, key: t, depth: 0, children: [] };
-  return n.set(f, o), o;
-}
-function _(r, e, n, i, t) {
-  for (const o of r)
-    w(t), C(o, e, n, i);
-  const f = [];
-  for (const o of n.values()) {
-    w(t);
-    const a = o.row[e.parentField];
-    if (a == null) {
-      f.push(o);
-      continue;
-    }
-    const l = n.get(N(M(a)));
-    if (!l) {
-      if (e.orphan !== "root") throw new Error(`树节点 ${String(o.key)} 的父节点不存在`);
-      f.push(o);
-      continue;
-    }
-    if (l === o) throw new Error("树节点不能以自身为父节点");
-    o.parent = l, l.children.push(o);
-  }
-  return f;
-}
-function j(r, e, n, i, t) {
-  const f = [], o = [{ rows: r, next: 0 }];
-  for (; o.length; ) {
-    w(t);
-    const a = o[o.length - 1];
-    if (a.next >= a.rows.length) {
-      o.pop();
-      continue;
-    }
-    const l = C(a.rows[a.next++], e, n, i);
-    if (l.parent = a.parent, l.depth = o.length - 1, o.length > i.depth) throw new Error(`树节点超出深度预算 ${i.depth}`);
-    (a.parent?.children ?? f).push(l);
-    const s = l.row[e.childrenField ?? "children"];
-    if (s != null) {
-      if (!Array.isArray(s)) throw new Error("嵌套树 children 字段应为数组");
-      s.length && o.push({ rows: s, next: 0, parent: l });
-    }
-  }
-  return f;
-}
-function J(r, e, n, i) {
-  const t = [], f = [{ nodes: r, next: 0 }];
-  for (; f.length; ) {
-    w(i);
-    const o = f[f.length - 1];
-    if (o.next >= o.nodes.length) {
-      f.pop();
-      continue;
-    }
-    if (f.length > n.depth) throw new Error(`树节点超出深度预算 ${n.depth}`);
-    const a = o.nodes[o.next++];
-    a.depth = f.length - 1, t.push(a), a.children.length && f.push({ nodes: a.children, next: 0 });
-  }
-  if (t.length !== e) throw new Error("树父子关系存在循环");
-  return t;
-}
-function L(r, e, n, i) {
-  if (e.parentValues !== "leaf-aggregate") return;
-  const t = e.aggregates, f = /* @__PURE__ */ new Map();
-  for (const a of r) a.children.length && f.set(a, t.map((l) => v({ ...l, field: l.valueField ?? l.field })));
-  let o = 0;
-  for (const a of r)
-    if (!a.children.length)
-      for (let l = a.parent; l; l = l.parent) {
-        if (w(i), o += t.length, o > n.visits) throw new Error(`树聚合超出访问预算 ${n.visits}`);
-        for (const s of f.get(l)) s.add(a.row);
-      }
-  for (const [a, l] of f)
-    a.row = { ...a.row }, t.forEach((s, c) => {
-      a.row[s.field] = l[c].value();
-    });
-}
-function T(r, e, n) {
-  if (I(e), w(n), !Array.isArray(r)) throw new Error("树数据应为节点数组");
-  const i = y(e), t = /* @__PURE__ */ new Map(), f = e.input === "flat" ? _(r, e, t, i, n) : j(r, e, t, i, n);
-  return J(f, t.size, i, n);
-}
-function X(r, e, n) {
-  return T(r, e, n).map((i) => i.original);
-}
-function q(r, e, n = {}) {
-  const i = T(r, e, n.signal);
-  if (O(e, n.computed?.fields), n.computed?.fields.length) {
-    const t = x(i.map((f) => f.row), { ...n.computed, signal: n.signal }).rows;
-    i.forEach((f, o) => {
-      f.row = t[o];
-    });
-  }
-  return L(i, e, y(e), n.signal), { rows: i.map((t) => t.row), entries: i.map((t) => ({ row: t.row, original: t.original, key: t.key, depth: t.depth, hasChildren: !!t.children.length })), leaves: i.filter((t) => !t.children.length).map((t) => t.row) };
-}
-const B = /^#[0-9a-f]{6}$/i;
-function D(r) {
-  if (!r || typeof r != "object" || Array.isArray(r)) return !1;
-  const e = r;
-  return e.kind !== "colorScale" && e.kind !== "dataBar" || e.field !== void 0 && (typeof e.field != "string" || !e.field.trim()) || e.numeric !== void 0 && !["number", "decimal"].includes(e.numeric) || [e.min, e.max].some((n) => n !== void 0 && (typeof n != "number" || !Number.isFinite(n))) || e.min !== void 0 && e.max !== void 0 && e.min > e.max ? !1 : Object.entries(e).every(([n, i]) => !["color", "negativeColor", "lowColor", "highColor"].includes(n) || typeof i == "string" && B.test(i));
-}
-function S(r, e) {
-  if (typeof r == "number") return Number.isFinite(r) ? r : void 0;
-  if (e !== "decimal" || typeof r != "string" || r.length > 1024 || !/^[+-]?(?:\d+(?:\.\d*)?|\.\d+)(?:[eE][+-]?\d+)?$/.test(r)) return;
-  const n = Number(r);
-  return Number.isFinite(n) ? n : void 0;
-}
-function z(r, e, n) {
-  let i = "#";
-  for (const t of [1, 3, 5]) {
-    const f = parseInt(r.slice(t, t + 2), 16), o = parseInt(e.slice(t, t + 2), 16);
-    i += Math.round(f + (o - f) * n).toString(16).padStart(2, "0");
-  }
-  return i;
-}
-function E(r, e, n) {
-  if (e === n) return r < e ? 0 : r > n ? 1 : 0.5;
-  if (r <= e) return 0;
-  if (r >= n) return 1;
-  const i = n - e;
-  return Number.isFinite(i) ? (r - e) / i : (r / 2 - e / 2) / (n / 2 - e / 2);
-}
-function H(r, e, n, i) {
-  const t = /* @__PURE__ */ new WeakMap();
-  return { apply(f, o) {
-    const a = S(o[e], r.numeric);
-    if (a === void 0) return;
-    if (r.kind === "dataBar") {
-      const d = Math.min(n, 0), g = Math.max(i, 0), m = E(0, d, g), b = d === g ? m : E(a, d, g);
-      f.dataBar = { start: Math.min(m, b), end: Math.max(m, b), color: a < 0 ? r.negativeColor ?? "#f3bcc3" : r.color ?? "#bad8fa" };
-      return;
-    }
-    const l = z(r.lowColor ?? "#f0f7ff", r.highColor ?? "#8bbcf1", E(a, n, i)), s = f.style ?? {}, c = t.get(s) ?? /* @__PURE__ */ new Map();
-    t.set(s, c);
-    let u = c.get(l);
-    u || (u = { ...s, backgroundColor: l }, c.set(l, u)), f.style = u;
-  } };
-}
-function G(r, e, n) {
-  return r.map((i) => {
-    F(n);
-    const t = i.visual;
-    if (!t) return;
-    if (!D(t)) throw new TypeError("Invalid column visual rule");
-    const f = t.field ?? i.field;
-    let o = 1 / 0, a = -1 / 0, l = 0;
-    if (t.min === void 0 || t.max === void 0) for (const u of e) {
-      (l++ & 1023) === 0 && F(n);
-      const d = S(u[f], t.numeric);
-      d !== void 0 && (o = Math.min(o, d), a = Math.max(a, d));
-    }
-    let s = t.min ?? o, c = t.max ?? a;
-    if (!(!Number.isFinite(s) || !Number.isFinite(c)))
-      return s > c && (t.min !== void 0 ? c = s : s = c), H(t, f, s, c);
-  });
-}
-function F(r) {
-  if (r?.aborted) throw r.reason ?? new DOMException("Aborted", "AbortError");
-}
-const P = 1e7;
-function K(r) {
-  const e = JSON.stringify(r, null, 2);
-  if (e.length > P)
-    throw new RangeError("模板 JSON 超过 1000 万字符的导出/导入上限");
-  return e;
-}
-export {
-  P as M,
-  V as T,
-  I as a,
-  O as b,
-  q as c,
-  G as d,
-  X as f,
-  K as s,
-  D as v
-};

package/dist/template-serialization-D1R5oAqh.cjs

@@ -1 +0,0 @@
-"use strict";const y=require("./computed-4TnxzgIh.cjs");class A extends Error{constructor(r){super(`树节点超出行数预算 ${r}`),this.limit=r,this.code="tree-row-limit",this.name="TreeRowLimitError"}}function p(e,r,n,i){const t=e??r;if(!Number.isInteger(t)||t<1||t>n)throw new Error(`${i}应为 1–${n} 的整数`);return t}function b(e){return{rows:p(e.maxRows,1e5,1e6,"树行数预算"),depth:p(e.maxDepth,64,256,"树深度预算"),visits:p(e.maxAggregationVisits,1e6,1e7,"树聚合访问预算")}}function T(e){return typeof e=="string"&&!!e.trim()}function h(e){return T(e)&&!["__proto__","prototype","constructor"].includes(e)}function M(e){if(T(e)||typeof e=="number"&&Number.isFinite(e))return e;throw new Error("树节点业务键应为非空字符串或有限数字")}function C(e){return JSON.stringify([typeof e,e])}function N(e){return[e.idField,...e.input==="flat"?[e.parentField??""]:[e.childrenField??"children"]]}function k(e,r){const n=N(e);if(r?.some(i=>i.scope&&i.scope!=="row"||n.includes(i.field)))throw new Error("树形布局仅支持不覆盖结构键的当前行计算")}function w(e){if(!e?.aborted)return;const r=new Error("树报表处理已取消");throw r.name="AbortError",r}function $(e){const r=e.aggregates??[];if(!Array.isArray(r)||r.length>32)throw new Error("树聚合最多 32 项");if(e.parentValues!=="leaf-aggregate"&&r.length)throw new Error("树聚合需显式选择 leaf-aggregate 父级取值策略");if(e.parentValues==="leaf-aggregate"&&!r.length)throw new Error("叶子聚合策略至少需要一个聚合字段");const n=new Set;for(const i of r){if(!i||!h(i.field)||n.has(i.field))throw new Error("树聚合输出字段应安全、非空且唯一");for(const t of[i.valueField,i.weightField])if(t!==void 0&&!h(t))throw new Error("树聚合来源字段应安全且非空");if([...N(e),e.labelField].includes(i.field))throw new Error("树聚合不能覆盖结构键或标签字段");n.add(i.field),y.createAggregateAccumulator({...i,field:i.valueField??i.field})}}function I(e){if(!h(e.idField)||!h(e.labelField))throw new Error("树需要安全的业务键和标签字段");if(e.input==="flat"&&(!h(e.parentField)||e.parentField===e.idField))throw new Error("扁平树需要独立的父键字段");if(e.childrenField!==void 0&&!h(e.childrenField))throw new Error("子节点字段应安全且非空");if(e.input==="nested"&&[e.idField,e.labelField].includes(e.childrenField??"children"))throw new Error("子节点字段不能覆盖业务键或标签字段")}function S(e){if(!e||typeof e!="object"||!["flat","nested"].includes(e.input))throw new Error("树输入应为 flat 或 nested");if(I(e),e.orphan!==void 0&&!["error","root"].includes(e.orphan))throw new Error("树孤儿策略应为 error 或 root");if(e.parentValues!==void 0&&!["source","leaf-aggregate"].includes(e.parentValues))throw new Error("未知树父级取值策略");if(e.indentMm!==void 0&&(!Number.isFinite(e.indentMm)||e.indentMm<0||e.indentMm>20))throw new Error("树每级缩进应为 0–20 mm");b(e),$(e)}function V(e,r,n,i){if(!e||typeof e!="object"||Array.isArray(e))throw new Error("树节点应为对象");if(n.size>=i.rows)throw new A(i.rows);const t=M(e[r.idField]),l=C(t);if(n.has(l))throw new Error(`树节点业务键重复：${String(t)}`);const o={original:e,row:e,key:t,depth:0,children:[]};return n.set(l,o),o}function L(e,r,n,i,t){for(const o of e)w(t),V(o,r,n,i);const l=[];for(const o of n.values()){w(t);const a=o.row[r.parentField];if(a==null){l.push(o);continue}const f=n.get(C(M(a)));if(!f){if(r.orphan!=="root")throw new Error(`树节点 ${String(o.key)} 的父节点不存在`);l.push(o);continue}if(f===o)throw new Error("树节点不能以自身为父节点");o.parent=f,f.children.push(o)}return l}function j(e,r,n,i,t){const l=[],o=[{rows:e,next:0}];for(;o.length;){w(t);const a=o[o.length-1];if(a.next>=a.rows.length){o.pop();continue}const f=V(a.rows[a.next++],r,n,i);if(f.parent=a.parent,f.depth=o.length-1,o.length>i.depth)throw new Error(`树节点超出深度预算 ${i.depth}`);(a.parent?.children??l).push(f);const c=f.row[r.childrenField??"children"];if(c!=null){if(!Array.isArray(c))throw new Error("嵌套树 children 字段应为数组");c.length&&o.push({rows:c,next:0,parent:f})}}return l}function J(e,r,n,i){const t=[],l=[{nodes:e,next:0}];for(;l.length;){w(i);const o=l[l.length-1];if(o.next>=o.nodes.length){l.pop();continue}if(l.length>n.depth)throw new Error(`树节点超出深度预算 ${n.depth}`);const a=o.nodes[o.next++];a.depth=l.length-1,t.push(a),a.children.length&&l.push({nodes:a.children,next:0})}if(t.length!==r)throw new Error("树父子关系存在循环");return t}function B(e,r,n,i){if(r.parentValues!=="leaf-aggregate")return;const t=r.aggregates,l=new Map;for(const a of e)a.children.length&&l.set(a,t.map(f=>y.createAggregateAccumulator({...f,field:f.valueField??f.field})));let o=0;for(const a of e)if(!a.children.length)for(let f=a.parent;f;f=f.parent){if(w(i),o+=t.length,o>n.visits)throw new Error(`树聚合超出访问预算 ${n.visits}`);for(const c of l.get(f))c.add(a.row)}for(const[a,f]of l)a.row={...a.row},t.forEach((c,d)=>{a.row[c.field]=f[d].value()})}function O(e,r,n){if(S(r),w(n),!Array.isArray(e))throw new Error("树数据应为节点数组");const i=b(r),t=new Map,l=r.input==="flat"?L(e,r,t,i,n):j(e,r,t,i,n);return J(l,t.size,i,n)}function D(e,r,n){return O(e,r,n).map(i=>i.original)}function z(e,r,n={}){const i=O(e,r,n.signal);if(k(r,n.computed?.fields),n.computed?.fields.length){const t=y.computeDataset(i.map(l=>l.row),{...n.computed,signal:n.signal}).rows;i.forEach((l,o)=>{l.row=t[o]})}return B(i,r,b(r),n.signal),{rows:i.map(t=>t.row),entries:i.map(t=>({row:t.row,original:t.original,key:t.key,depth:t.depth,hasChildren:!!t.children.length})),leaves:i.filter(t=>!t.children.length).map(t=>t.row)}}const H=/^#[0-9a-f]{6}$/i;function R(e){if(!e||typeof e!="object"||Array.isArray(e))return!1;const r=e;return r.kind!=="colorScale"&&r.kind!=="dataBar"||r.field!==void 0&&(typeof r.field!="string"||!r.field.trim())||r.numeric!==void 0&&!["number","decimal"].includes(r.numeric)||[r.min,r.max].some(n=>n!==void 0&&(typeof n!="number"||!Number.isFinite(n)))||r.min!==void 0&&r.max!==void 0&&r.min>r.max?!1:Object.entries(r).every(([n,i])=>!["color","negativeColor","lowColor","highColor"].includes(n)||typeof i=="string"&&H.test(i))}function x(e,r){if(typeof e=="number")return Number.isFinite(e)?e:void 0;if(r!=="decimal"||typeof e!="string"||e.length>1024||!/^[+-]?(?:\d+(?:\.\d*)?|\.\d+)(?:[eE][+-]?\d+)?$/.test(e))return;const n=Number(e);return Number.isFinite(n)?n:void 0}function P(e,r,n){let i="#";for(const t of[1,3,5]){const l=parseInt(e.slice(t,t+2),16),o=parseInt(r.slice(t,t+2),16);i+=Math.round(l+(o-l)*n).toString(16).padStart(2,"0")}return i}function E(e,r,n){if(r===n)return e<r?0:e>n?1:.5;if(e<=r)return 0;if(e>=n)return 1;const i=n-r;return Number.isFinite(i)?(e-r)/i:(e/2-r/2)/(n/2-r/2)}function X(e,r,n,i){const t=new WeakMap;return{apply(l,o){const a=x(o[r],e.numeric);if(a===void 0)return;if(e.kind==="dataBar"){const s=Math.min(n,0),g=Math.max(i,0),m=E(0,s,g),F=s===g?m:E(a,s,g);l.dataBar={start:Math.min(m,F),end:Math.max(m,F),color:a<0?e.negativeColor??"#f3bcc3":e.color??"#bad8fa"};return}const f=P(e.lowColor??"#f0f7ff",e.highColor??"#8bbcf1",E(a,n,i)),c=l.style??{},d=t.get(c)??new Map;t.set(c,d);let u=d.get(f);u||(u={...c,backgroundColor:f},d.set(f,u)),l.style=u}}}function q(e,r,n){return e.map(i=>{v(n);const t=i.visual;if(!t)return;if(!R(t))throw new TypeError("Invalid column visual rule");const l=t.field??i.field;let o=1/0,a=-1/0,f=0;if(t.min===void 0||t.max===void 0)for(const u of r){(f++&1023)===0&&v(n);const s=x(u[l],t.numeric);s!==void 0&&(o=Math.min(o,s),a=Math.max(a,s))}let c=t.min??o,d=t.max??a;if(!(!Number.isFinite(c)||!Number.isFinite(d)))return c>d&&(t.min!==void 0?d=c:c=d),X(t,l,c,d)})}function v(e){if(e?.aborted)throw e.reason??new DOMException("Aborted","AbortError")}const _=1e7;function W(e){const r=JSON.stringify(e,null,2);if(r.length>_)throw new RangeError("模板 JSON 超过 1000 万字符的导出/导入上限");return r}exports.MAX_TEMPLATE_JSON_CHARACTERS=_;exports.TreeRowLimitError=A;exports.createColumnVisualResolvers=q;exports.createTreeTable=z;exports.flattenTreeInput=D;exports.stringifyValidatedTemplate=W;exports.validColumnVisual=R;exports.validateTreeComputed=k;exports.validateTreeOptions=S;

package/dist/textwrap-OTOUMr4f.cjs

@@ -1,4 +0,0 @@
-"use strict";const g=require("./grid-geometry-D8ReblRV.cjs"),M=/[\u3000-\u9fff\uff00-\uffef]/,s=new Uint8Array(128);{for(const t of"iljtf.,:;'`|!()[]")s[t.charCodeAt(0)]=1;for(const t of"mwMW@")s[t.charCodeAt(0)]=2;for(let t=48;t<=57;t++)s[t]=3;for(let t=65;t<=90;t++)s[t]=4;s[32]=5}const w=[.54,.26,.95,.59,.67,.3];function d(t){const e=t.charCodeAt(0);return e<128?w[s[e]]:M.test(t)?1:/[A-Z]/.test(t)?.67:.54}const o={measureMm(t,e){const{fontSizePt:i,bold:c=!1,letterSpacingPt:u=0}=e,r=25.4/72;let n=0;for(const h of t)n+=d(h);return c&&(n*=1.04),(n*i+u*Math.max(0,Array.from(t).length-1))*r}};function p(){return o}function A(t,e){return o.measureMm(t,e)}function x(t){let e;return{measureMm(i,c){if(e===void 0&&(e=t()),!e)return o.measureMm(i,c);const u=c.fontSizePt*96/72;e.font=`${c.italic?"italic ":""}${c.bold?"bold ":""}${u}px ${c.fontFamily??g.DEFAULT_FONT_FAMILY}`,"letterSpacing"in e&&(e.letterSpacing="0px");const r=(c.letterSpacingPt??0)*Math.max(0,Array.from(i).length-1);return e.measureText(i).width*25.4/96+r*25.4/72}}}function T(t,e,i){const c=[];let u="";const r=()=>{u&&(c.push({text:u,widthMm:i.measureMm(u,e),cjk:!1}),u="")};for(const n of t){if(n===`
-`){r(),c.push({text:`
-`,widthMm:0,cjk:!1,br:!0});continue}if(n===" "){r(),c.push({text:n,widthMm:i.measureMm(n,e),cjk:!1,space:!0});continue}if(M.test(n)){r(),c.push({text:n,widthMm:i.measureMm(n,e),cjk:!0});continue}u+=n}return r(),c}function S(t,e,i,c=o){if(!t)return[""];t=t.replace(/\r\n?/g,`
-`);const u=[];let r="",n=0;const h=(i.letterSpacingPt??0)*25.4/72,a=()=>{u.push(r),r="",n=0};for(const f of T(t,i,c)){if(f.br){a();continue}const m=r.length>0?h:0;if(n+m+f.widthMm<=e){r+=f.text,n+=m+f.widthMm;continue}if(f.space){a();continue}if(f.cjk){r.length>0&&a(),r=f.text,n=f.widthMm;continue}if(r.length>0&&a(),f.widthMm<=e){r=f.text,n=f.widthMm;continue}for(const l of f.text)c.measureMm(r+l,i)>e&&r.length>0&&a(),r+=l,n=c.measureMm(r,i)}return a(),u}exports.charWidthEm=d;exports.createCanvasMeasurer=x;exports.createHeuristicMeasurer=p;exports.heuristicMeasurer=o;exports.measureTextMm=A;exports.wrapText=S;