@p-buddy/parkdown 0.0.27 → 0.0.32

package/dist/index.js

@@ -1,41 +1,41 @@
-var Ce = Object.defineProperty;
-var Ee = (e, t, n) => t in e ? Ce(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
-var _ = (e, t, n) => Ee(e, typeof t != "symbol" ? t + "" : t, n);
-import { writeFileSync as ae, readFileSync as Se } from "node:fs";
-import { basename as xe, dirname as Q, join as A, resolve as ce } from "node:path";
-import { URLSearchParams as _e } from "node:url";
-import { unified as Ne } from "unified";
-import ke from "remark-parse";
-import { visit as Me } from "unist-util-visit";
-import { dedent as Ae } from "ts-dedent";
-const f = (e, t) => e.position.start.offset - t.position.start.offset;
-f.reverse = (e, t) => f(t, e);
-const G = (e) => e.position !== void 0 && e.position.start.offset !== void 0 && e.position.end.offset !== void 0, Oe = Ne().use(ke), z = {
-  md: (e) => Oe.parse(e)
+var Se = Object.defineProperty;
+var xe = (e, t, n) => t in e ? Se(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
+var _ = (e, t, n) => xe(e, typeof t != "symbol" ? t + "" : t, n);
+import { writeFileSync as pe, readFileSync as _e } from "node:fs";
+import { basename as ke, dirname as Q, join as A, resolve as me } from "node:path";
+import { URLSearchParams as Ne } from "node:url";
+import { unified as Me } from "unified";
+import Te from "remark-parse";
+import { visit as Ae } from "unist-util-visit";
+import { dedent as Oe } from "ts-dedent";
+const d = (e, t) => e.position.start.offset - t.position.start.offset;
+d.reverse = (e, t) => d(t, e);
+const G = (e) => e.position !== void 0 && e.position.start.offset !== void 0 && e.position.end.offset !== void 0, Re = Me().use(Te), z = {
+  md: (e) => Re.parse(e)
 }, O = (e, t) => {
   const n = [];
-  return Me(e, (s, r, o) => {
-    if (s.type !== "root") {
-      if (t && s.type !== t) return;
-      if (G(s)) {
-        const i = ((o == null ? void 0 : o.children.length) ?? 0) - 1;
-        n.push({ ...s, siblingIndex: r, siblingCount: i });
+  return Ae(e, (o, s, r) => {
+    if (o.type !== "root") {
+      if (t && o.type !== t) return;
+      if (G(o)) {
+        const i = ((r == null ? void 0 : r.children.length) ?? 0) - 1;
+        n.push({ ...o, siblingIndex: s, siblingCount: i });
       }
     }
   }), n;
-}, Re = (e) => e.children.length === 0, pe = (e, t, ...n) => {
+}, We = (e) => e.children.length === 0, ge = (e, t, ...n) => {
   if (n.length === 0) throw new Error("No nodes to replace content from");
-  n.sort(f);
-  const s = n.at(0), r = n.at(-1);
-  return e.slice(0, s.position.start.offset) + t + e.slice(r.position.end.offset);
-}, Te = (e, t, n) => {
-  const s = Math.min(t.position.end.offset, n.position.end.offset), r = Math.max(t.position.start.offset, n.position.start.offset);
-  return e.slice(s, r);
-}, M = (...e) => e.join(" "), We = (...e) => e.join(`
-`), Ie = (e) => {
+  n.sort(d);
+  const o = n.at(0), s = n.at(-1);
+  return e.slice(0, o.position.start.offset) + t + e.slice(s.position.end.offset);
+}, Ie = (e, t, n) => {
+  const o = Math.min(t.position.end.offset, n.position.end.offset), s = Math.max(t.position.start.offset, n.position.start.offset);
+  return e.slice(o, s);
+}, M = (...e) => e.join(" "), Pe = (...e) => e.join(`
+`), je = (e) => {
   const t = e.split("?");
   return t.length > 1 ? [t.slice(0, -1).join("?"), t.at(-1)] : [e, ""];
-}, Pe = (e) => Ie(e)[0], J = /,\s*(?![^()]*\))/, Z = {
+}, De = (e) => je(e)[0], Z = /,\s*(?![^()]*\))/, K = {
   reserved: {
     semi: ";",
     slash: "/",
@@ -63,7 +63,7 @@ const G = (e) => e.position !== void 0 && e.position.start.offset !== void 0 &&
     line: `
 `
   }
-}, je = "-", K = {
+}, Le = "-", Y = {
   static: [
     ["'''", '"'],
     ["''", "'"],
@@ -71,71 +71,71 @@ const G = (e) => e.position !== void 0 && e.position.start.offset !== void 0 &&
     [/p↓:\s+/g, ""]
   ],
   url: [
-    ...Object.entries(Z.unsafe),
-    ...Object.entries(Z.reserved)
+    ...Object.entries(K.unsafe),
+    ...Object.entries(K.reserved)
   ]
-}, Y = (e, [t, n]) => e.replaceAll(t, n), W = (e, t = je) => {
-  const n = K.static.reduce(Y, e);
-  return K.url.map(([s, r]) => [t + s + t, r]).reduce(Y, n).replaceAll(t, " ");
-}, De = ["string", "number", "boolean"], Le = (e) => De.includes(e), Ue = /^([a-zA-Z0-9_-]+)(?:\(([^)]*)\))?$/, qe = (e) => {
-  const t = e.match(Ue);
+}, ee = (e, [t, n]) => e.replaceAll(t, n), I = (e, t = Le) => {
+  const n = Y.static.reduce(ee, e);
+  return Y.url.map(([o, s]) => [t + o + t, s]).reduce(ee, n).replaceAll(t, " ");
+}, Ue = ["string", "number", "boolean"], qe = (e) => Ue.includes(e), Be = /^([a-zA-Z0-9_-]+)(?:\(([^)]*)\))?$/, Fe = (e) => {
+  const t = e.match(Be);
   if (!t) throw new Error(`Invalid invocation: ${e}`);
-  const [, n, s = ""] = t;
-  if (!s.trim()) return { name: n, parameters: [] };
-  const r = Fe(s);
-  return { name: n, parameters: r };
-}, Be = (e, t) => {
+  const [, n, o = ""] = t;
+  if (!o.trim()) return { name: n, parameters: [] };
+  const s = Qe(o);
+  return { name: n, parameters: s };
+}, He = (e, t) => {
   for (let n = t + 1; n < e.length; n++)
     if (e[n] !== void 0) return !1;
   return !0;
-}, Fe = (e) => {
+}, Qe = (e) => {
   const t = [];
-  let n = "", s = !1;
-  for (let r = 0; r < e.length; r++) {
-    const o = e[r], i = o === "'";
-    if (i && e.at(r + 1) === "'") {
-      const l = e.at(r + 2) === "'";
-      s = !s, n += l ? "'''" : "''", r += l ? 2 : 1;
-    } else i ? (s = !s, n += o) : o === "," && !s ? (t.push(n.trim()), n = "") : n += o;
+  let n = "", o = !1;
+  for (let s = 0; s < e.length; s++) {
+    const r = e[s], i = r === "'";
+    if (i && e.at(s + 1) === "'") {
+      const l = e.at(s + 2) === "'";
+      o = !o, n += l ? "'''" : "''", s += l ? 2 : 1;
+    } else i ? (o = !o, n += r) : r === "," && !o ? (t.push(n.trim()), n = "") : n += r;
   }
-  return t.push(n.trim()), t.map((r) => r === "" ? void 0 : r ? He(r) : void 0).filter((r, o, i) => r !== void 0 || !Be(i, o));
-}, He = (e) => {
+  return t.push(n.trim()), t.map((s) => s === "" ? void 0 : s ? Ge(s) : void 0).filter((s, r, i) => s !== void 0 || !He(i, r));
+}, Ge = (e) => {
   const t = e.length >= 2 && e[0] === "'" && e.at(-1) === "'", n = t && e.length >= 4 && e[1] === "'" && e.at(-2) === "'";
   return !t || n ? e : e.slice(1, -1);
-}, Qe = (e) => {
+}, ze = (e) => {
   const t = /^([\w-_]+)(?:\(([^)]*)\))?/, n = e.match(t);
   if (!n) return { name: e };
-  const [, s, r] = n;
-  if (!r) return { name: s };
-  const o = /([\w-_]+)(\?)?:\s*([^,]+)/g, i = [];
+  const [, o, s] = n;
+  if (!s) return { name: o };
+  const r = /([\w-_]+)(\?)?:\s*([^,]+)/g, i = [];
   let l;
-  for (; (l = o.exec(r)) !== null; ) {
-    const [, c, a, u] = l, p = u.trim();
-    if (!Le(p)) throw new Error(`Unsupported type: ${p}`);
+  for (; (l = r.exec(s)) !== null; ) {
+    const [, c, a, m] = l, p = m.trim();
+    if (!qe(p)) throw new Error(`Unsupported type: ${p}`);
     i.push({ name: c, optional: a === "?", type: p });
   }
-  return { name: s, parameters: i };
+  return { name: o, parameters: i };
 }, R = (e) => {
-  const t = e.map(Qe).reduce(
-    (n, { name: s, parameters: r }) => n.set(s, r),
+  const t = e.map(ze).reduce(
+    (n, { name: o, parameters: s }) => n.set(o, s),
     /* @__PURE__ */ new Map()
   );
   return (n) => {
-    const { name: s, parameters: r } = qe(n);
-    if (!t.has(s))
-      throw new Error(`Unknown method: ${s}`);
-    const o = t.get(s);
-    if (o === void 0)
-      return { name: s };
-    if (r.length > o.length) {
-      const i = o.filter(({ optional: c }) => !c).length, l = i === o.length ? i.toString() : `${i} - ${o.length}`;
-      throw new Error(`Too many parameters: ${r.length} for method '${s}' (expected: ${l})`);
+    const { name: o, parameters: s } = Fe(n);
+    if (!t.has(o))
+      throw new Error(`Unknown method: ${o}`);
+    const r = t.get(o);
+    if (r === void 0)
+      return { name: o };
+    if (s.length > r.length) {
+      const i = r.filter(({ optional: c }) => !c).length, l = i === r.length ? i.toString() : `${i} - ${r.length}`;
+      throw new Error(`Too many parameters: ${s.length} for method '${o}' (expected: ${l})`);
     }
-    return o.reduce((i, { name: l, optional: c, type: a }, u) => {
-      const p = r[u];
+    return r.reduce((i, { name: l, optional: c, type: a }, m) => {
+      const p = s[m];
       if (p === void 0) {
         if (c) return i;
-        throw new Error(`Missing required parameter: ${l} for method '${s}'`);
+        throw new Error(`Missing required parameter: ${l} for method '${o}'`);
       }
       switch (a) {
         case "string":
@@ -147,11 +147,11 @@ const G = (e) => e.position !== void 0 && e.position.start.offset !== void 0 &&
           break;
       }
       if (typeof i[l] !== a)
-        throw new Error(`Invalid type: ${l} must be ${a}, got ${typeof i[l]} for method '${s}'`);
+        throw new Error(`Invalid type: ${l} must be ${a}, got ${typeof i[l]} for method '${o}'`);
       return i;
-    }, { name: s });
+    }, { name: o });
   };
-}, F = (e) => Object.entries(e).filter(([t]) => t !== "name" && !isNaN(Number(t))).map(([t, n]) => n), Ge = [
+}, T = (e) => Object.entries(e).filter(([t]) => t !== "name" && !isNaN(Number(t))).map(([t, n]) => n), Xe = [
   /**
    * Wraps the content in a markdown-formatted code block.
    * @param lang The language of the code block (defaults to the file extension).
@@ -181,32 +181,32 @@ const G = (e) => e.position !== void 0 && e.position.start.offset !== void 0 &&
    * @example [](<url>?wrap=dropdown(hello_world,,_)) 
    */
   "dropdown(summary: string, open?: boolean, space?: string)"
-], ze = R(Ge), E = (e, t = 1) => `
+], Ve = R(Xe), E = (e, t = 1) => `
 `.repeat(t) + e + `
-`.repeat(t), B = (e, t, n) => `<${t}${n ? ` ${n}` : ""}>${E(e)}</${t}>`, ee = (e, t, n) => {
-  const s = ze(t);
-  switch (s.name) {
+`.repeat(t), F = (e, t, n) => `<${t}${n ? ` ${n}` : ""}>${E(e)}</${t}>`, te = (e, t, n) => {
+  const o = Ve(t);
+  switch (o.name) {
     case "code":
-      if (!s.lang && !s.meta && (n == null ? void 0 : n.inline) && !e.includes(`
+      if (!o.lang && !o.meta && (n == null ? void 0 : n.inline) && !e.includes(`
 `)) return `\`${e}\``;
-      const o = s.lang ?? (n == null ? void 0 : n.extension) ?? "", i = s.meta ? ` ${s.meta}` : "";
-      return E(`\`\`\`${o}${i}${E(e)}\`\`\``);
+      const r = o.lang ?? (n == null ? void 0 : n.extension) ?? "", i = o.meta ? ` ${o.meta}` : "";
+      return E(`\`\`\`${r}${i}${E(e)}\`\`\``);
     case "quote":
       return n != null && n.inline && !e.includes(`
 
-`) ? `> ${e}` : E(B(E(e), "blockquote"));
+`) ? `> ${e}` : E(F(E(e), "blockquote"));
     case "dropdown":
-      const l = B(W(s.summary), "summary");
-      return E(B([l, e].join(`
-`), "details", s.open ? "open" : void 0));
+      const l = F(I(o.summary), "summary");
+      return E(F([l, e].join(`
+`), "details", o.open ? "open" : void 0));
   }
 };
-class d {
+class u {
   constructor(...t) {
     _(this, "_intervals", []);
     _(this, "collapsed", !0);
-    for (const [n, s] of t)
-      this.push(n, s);
+    for (const [n, o] of t)
+      this.push(n, o);
   }
   get intervals() {
     return this._intervals;
@@ -215,58 +215,58 @@ class d {
     return n ?? (n = t + 1), this._intervals.push([Math.min(t, n), Math.max(t, n)]), this.collapsed = !1, this;
   }
   combine(t) {
-    for (const [n, s] of t.intervals)
-      this.push(n, s);
+    for (const [n, o] of t.intervals)
+      this.push(n, o);
     return this;
   }
   collapse(t = !1) {
-    const { _intervals: n, collapsed: s } = this;
-    if (s && !t || !n.length) return this;
+    const { _intervals: n, collapsed: o } = this;
+    if (o && !t || !n.length) return this;
     n.sort((l, c) => l[0] - c[0]);
-    const r = [];
-    let [o, i] = n[0];
+    const s = [];
+    let [r, i] = n[0];
     for (let l = 1; l < n.length; l++) {
       const [c, a] = n[l];
-      c <= i ? i = Math.max(i, a) : (r.push([o, i]), o = c, i = a);
+      c <= i ? i = Math.max(i, a) : (s.push([r, i]), r = c, i = a);
     }
-    return r.push([o, i]), this._intervals = r, this.collapsed = !0, this;
+    return s.push([r, i]), this._intervals = s, this.collapsed = !0, this;
   }
   subtract(t) {
     this.collapse(), t.collapse();
-    const { _intervals: n } = this, { _intervals: s } = t;
-    if (!n.length || !s.length) return this;
-    let r = [...n];
-    for (const [o, i] of s) {
+    const { _intervals: n } = this, { _intervals: o } = t;
+    if (!n.length || !o.length) return this;
+    let s = [...n];
+    for (const [r, i] of o) {
       const l = [];
-      for (const [c, a] of r) {
-        if (i <= c || o >= a) {
+      for (const [c, a] of s) {
+        if (i <= c || r >= a) {
           l.push([c, a]);
           continue;
         }
-        o > c && l.push([c, o]), i < a && l.push([i, a]);
+        r > c && l.push([c, r]), i < a && l.push([i, a]);
       }
-      r = l;
+      s = l;
     }
-    return this._intervals = r, this.collapse(!0), this;
+    return this._intervals = s, this.collapse(!0), this;
   }
   test(t, n = "head") {
-    const { _intervals: s } = this;
+    const { _intervals: o } = this;
     switch (n) {
       case "head":
-        return s.some(([r, o]) => t >= r && t < o);
+        return o.some(([s, r]) => t >= s && t < r);
       case "tail":
-        return s.some(([r, o]) => t > r && t <= o);
+        return o.some(([s, r]) => t > s && t <= r);
       case "both":
-        return s.some(([r, o]) => t >= r && t <= o);
+        return o.some(([s, r]) => t >= s && t <= r);
       case "none":
-        return s.some(([r, o]) => t > r && t < o);
+        return o.some(([s, r]) => t > s && t < r);
     }
   }
   slice(t) {
     this.collapse();
     const n = [];
-    for (const [s, r] of this._intervals)
-      n.push(t.slice(s, r));
+    for (const [o, s] of this._intervals)
+      n.push(t.slice(o, s));
     return n.filter(Boolean).join("");
   }
   offset(t) {
@@ -275,42 +275,78 @@ class d {
     return this;
   }
 }
-const I = (e) => {
+const P = (e) => {
   const t = /(\/\/[^\n]*|\/\*[\s\S]*?\*\/|<!--[\s\S]*?-->)/gm, n = [];
-  let s;
-  for (; (s = t.exec(e)) !== null; ) {
-    const r = [s.index, s.index + s[0].length], o = Xe(s[0]).trim();
-    n.push({ range: r, value: o });
+  let o;
+  for (; (o = t.exec(e)) !== null; ) {
+    const s = [o.index, o.index + o[0].length], r = Je(o[0]).trim();
+    n.push({ range: s, value: r });
   }
   return n;
-}, Xe = (e) => e.startsWith("//") ? e.slice(2) : e.startsWith("/*") ? e.slice(2, -2) : e.startsWith("<!--") ? e.slice(4, -3) : e, Ve = [
+}, Je = (e) => e.startsWith("//") ? e.slice(2) : e.startsWith("/*") ? e.slice(2, -2) : e.startsWith("<!--") ? e.slice(4, -3) : e, Ze = [
   "(pd)",
   "(p↓)",
   "(parkdown)",
   "pd:",
   "p↓:",
   "parkdown:"
-], ue = (e, t) => e.range[0] - t.range[0], X = (e, t, n) => (n ?? I(e)).filter(({ value: s }) => s.split(" ").includes(t)).sort(ue), te = (e) => ({
+], he = (e, t) => e.range[0] - t.range[0], X = (e, t, n) => (n ?? P(e)).filter(({ value: o }) => o.split(" ").includes(t)).sort(he), ne = (e) => ({
   isSpace: e === " ",
   isNewline: e === `
 ` || e === void 0
-}), ne = (e) => Ve.flatMap((t) => X(e, t)).sort((t, n) => t.range[0] - n.range[0]).reverse().reduce((t, { range: [n, s], value: r }) => {
-  const o = (b, y) => t.slice(0, b) + t.slice(y), i = te(t[n - 1]), l = te(t[s]), c = s === t.length;
+}), se = (e) => Ze.flatMap((t) => X(e, t)).sort((t, n) => t.range[0] - n.range[0]).reverse().reduce((t, { range: [n, o], value: s }) => {
+  const r = (b, y) => t.slice(0, b) + t.slice(y), i = ne(t[n - 1]), l = ne(t[o]), c = o === t.length;
   let a = n;
   for (; a > 0 && t[a - 1] !== `
 `; ) a--;
-  let u = s;
-  for (; u < t.length && t[u] !== `
-`; ) u++;
-  const p = t.slice(a, n).trim() === "" && t.slice(s, u).trim() === "";
-  return i.isNewline && l.isNewline ? o(n - (c ? 1 : 0), s + 1) : i.isNewline || p ? o(a, s + (l.isSpace || l.isNewline ? 1 : 0)) : o(n - (i.isSpace ? 1 : 0), s);
-}, e), Je = [
+  let m = o;
+  for (; m < t.length && t[m] !== `
+`; ) m++;
+  const p = t.slice(a, n).trim() === "" && t.slice(o, m).trim() === "";
+  return i.isNewline && l.isNewline ? r(n - (c ? 1 : 0), o + 1) : i.isNewline || p ? r(a, o + (l.isSpace || l.isNewline ? 1 : 0)) : r(n - (i.isSpace ? 1 : 0), o);
+}, e), Ke = [
+  /**
+   * Include all content between comments that INCLUDE the specified ids.
+   *
+   * This is similar to `extract`, but instead of removing all other content, it appends the specified regions.
+   *
+   * @param id The id of the comment to include.
+   * @param 0 An optional additional id to include.
+   * @param 1 An optional additional id to include.
+   * @param 2 An optional additional id to include.
+   * @param 3 An optional additional id to include.
+   * @param 4 An optional additional id to include.
+   * @param 5 An optional additional id to include.
+   * @param 6 An optional additional id to include.
+   * @param 7 An optional additional id to include.
+   * @param 8 An optional additional id to include.
+   * @param 9 An optional additional id to include.
+   * @param 10 An optional additional id to include.
+   * @example [](<url>?region=include(specifier))
+   * @example [](<url>?region=include(specifier,other-specifier,some-other-specifier))
+   */
+  "include(id: string, 0?: string, 1?: string, 2?: string, 3?: string, 4?: string, 5?: string, 6?: string, 7?: string, 8?: string, 9?: string, 10?: string)",
   /**
    * Extract regions from the retrieved content between comments that INCLUDE the specified ids.
+   *
+   * NOTE: This method is deprecated in favor of `include`, which has more intuitive behavior.
+   * `extract` effectively behaves destructively, removing all content outside of the specified regions,
+   * thus you can't chain multiple `extract` calls to build up content from different regions
+   * (like you can with `include`).
+   *
+   * @deprecated Use `include` instead (usage is more intuitive).
    * @param id The id of the comment to extract.
-   * @param 0 An optional additional id to extract.
-   * @param 1 An optional additional id to extract.
-   * @param 2 An optional additional id to extract.
+   * @param 0 An optional additional id to include.
+   * @param 1 An optional additional id to include.
+   * @param 2 An optional additional id to include.
+   * @param 3 An optional additional id to include.
+   * @param 4 An optional additional id to include.
+   * @param 5 An optional additional id to include.
+   * @param 6 An optional additional id to include.
+   * @param 7 An optional additional id to include.
+   * @param 8 An optional additional id to include.
+   * @param 9 An optional additional id to include.
+   * @param 10 An optional additional id to include.
    * @example [](<url>?region=extract(specifier))
    * @example [](<url>?region=extract(specifier,other-specifier,some-other-specifier))
    */
@@ -388,7 +424,7 @@ const I = (e) => {
    * Specifying undefined or a number less than 0 indicates the action should be taken at the beginning of the comment boundary (i.e to the left of the comment).
    * @param insert The content to insert.
    * @param space The space character to use between words in the content to insert (defaults to `-`).
-   * 
+   *
    * **NOTE:** Content within comments will not be acted upon.
    */
   "splice-start(id: string, deleteCount?: number, insert?: string, space?: string)",
@@ -400,154 +436,219 @@ const I = (e) => {
    * Specifying undefined or a number less than 0 indicates the action should be taken at the beginning of the comment boundary (i.e to the left of the comment).
    * @param insert The content to insert.
    * @param space The space character to use between words in the content to insert (defaults to `-`).
-   * 
+   *
    * **NOTE:** Content within comments will not be acted upon.
    */
   "splice-end(id: string, deleteCount?: number, insert?: string, space?: string)",
   /**
-   * If included at the end of a query, parkdown comments will not be removed from the content after processing. 
+   * If included at the end of a query, parkdown comments will not be removed from the content after processing.
    * Helpful when trying to determine fine-grained edits (e.g. trimming, splicing, etc.).
    */
   "debug()"
-], Ze = R(Je), $ = (e, t, n) => {
-  const s = X(e, t, n), r = [];
-  for (let o = 0; o < s.length - 1; o += 2)
-    r.push([s[o], s[o + 1]]);
-  return r;
-}, Ke = (e, t, n) => new d(...X(e, t, n).map(({ range: s }) => s)), P = (e) => Ae(e).trim(), se = (e, t) => e[t] !== void 0 && /[^\S\r\n]/.test(e[t]), re = (e, t) => Math.max(0, Math.min(e.length, t)), Ye = (e, ...t) => {
+], Ye = R(Ke), $ = (e, t, n) => {
+  const o = X(e, t, n), s = [];
+  for (let r = 0; r < o.length - 1; r += 2)
+    s.push([o[r], o[r + 1]]);
+  return s;
+}, et = (e, t, n) => new u(
+  ...X(e, t, n).map(
+    ({ range: o }) => o
+  )
+), j = (e) => Oe(e).trim(), oe = (e, t) => e[t] !== void 0 && /[^\S\r\n]/.test(e[t]), re = (e, t) => Math.max(0, Math.min(e.length, t)), ie = (e, ...t) => {
   if (t.length === 0) return e;
-  const n = I(e);
-  return P(
-    new d(...t.flatMap(
-      (s) => $(e, s, n).map(([{ range: [r] }, { range: [, o] }]) => {
-        for (; se(e, r); ) r--;
-        for (; se(e, o); ) o++;
-        return [re(e, r), re(e, o)];
-      })
-    )).slice(e)
+  const n = P(e);
+  return j(
+    new u(
+      ...t.flatMap(
+        (o) => $(e, o, n).map(
+          ([
+            {
+              range: [s]
+            },
+            {
+              range: [, r]
+            }
+          ]) => {
+            for (; oe(e, s); ) s--;
+            for (; oe(e, r); ) r++;
+            return [re(e, s), re(e, r)];
+          }
+        )
+      )
+    ).slice(e)
   );
-}, et = (e, ...t) => {
+}, tt = (e, ...t) => {
   if (t.length === 0) return e;
-  const n = I(e);
-  return P(
-    new d([0, e.length]).subtract(
-      new d(...t.flatMap(
-        (s) => $(e, s, n).map(([{ range: [, r] }, { range: [o] }]) => [r, o])
-      ))
+  const n = P(e);
+  return j(
+    new u([0, e.length]).subtract(
+      new u(
+        ...t.flatMap(
+          (o) => $(e, o, n).map(
+            ([
+              {
+                range: [, s]
+              },
+              {
+                range: [r]
+              }
+            ]) => [s, r]
+          )
+        )
+      )
     ).slice(e)
   );
-}, tt = (e, t, n, s) => {
+}, nt = (e, t, n, o) => {
   if (!t) return e;
-  let r = "", o = 0;
+  let s = "", r = 0;
   for (const [i, l] of $(e, t))
-    r += e.slice(o, i.range[1]), r += W(n ?? i.value, s), o = l.range[0];
-  return r += e.slice(o), P(
-    new d([0, r.length]).subtract(Ke(r, t)).slice(r)
+    s += e.slice(r, i.range[1]), s += I(n ?? i.value, o), r = l.range[0];
+  return s += e.slice(r), j(
+    new u([0, s.length]).subtract(et(s, t)).slice(s)
   );
-}, nt = (e, t, n, s, r, o) => {
+}, st = (e, t, n, o, s, r) => {
   if (!t) return e;
-  const i = !(s === void 0 || s < 0), l = r ? W(r, o) : "", c = s ?? 0, a = I(e), u = new d(...a.map(({ range: p }) => p));
-  return $(e, t, a).map((p) => p[n === "start" ? 0 : 1]).sort(ue).reverse().reduce((p, { range: b }) => {
-    const y = new d(), k = i ? 1 : -1;
-    let S = Math.abs(c), m = i ? b[1] : b[0];
-    for (; S > 0 && m < p.length && m >= 0; )
-      u.test(m) || (y.push(m), S--), m += k;
-    return m = Math.min(Math.max(0, m), p.length), p = p.slice(0, m) + l + p.slice(m), new d([0, p.length]).subtract(y.offset(i ? 0 : l.length)).slice(p);
+  const i = !(o === void 0 || o < 0), l = s ? I(s, r) : "", c = o ?? 0, a = P(e), m = new u(...a.map(({ range: p }) => p));
+  return $(e, t, a).map((p) => p[n === "start" ? 0 : 1]).sort(he).reverse().reduce((p, { range: b }) => {
+    const y = new u(), N = i ? 1 : -1;
+    let S = Math.abs(c), g = i ? b[1] : b[0];
+    for (; S > 0 && g < p.length && g >= 0; )
+      m.test(g) || (y.push(g), S--), g += N;
+    return g = Math.min(Math.max(0, g), p.length), p = p.slice(0, g) + l + p.slice(g), new u([0, p.length]).subtract(y.offset(i ? 0 : l.length)).slice(p);
   }, e);
-}, st = (e, t, n, s, r) => {
-  let o = "", i = 0;
-  [n, s] = [n, s ?? ""].map((c) => W(c, r));
-  const l = t ? $(e, t) : [[{ range: [0, 0] }, { range: [e.length, e.length] }]];
+}, ot = (e, t, n, o, s) => {
+  let r = "", i = 0;
+  [n, o] = [n, o ?? ""].map((c) => I(c, s));
+  const l = t ? $(e, t) : [
+    [{ range: [0, 0] }, { range: [e.length, e.length] }]
+  ];
   for (const [c, a] of l)
-    o += e.slice(i, c.range[1]), o += e.slice(c.range[1], a.range[0]).replaceAll(n, s), i = a.range[0];
-  return o += e.slice(i), o;
+    r += e.slice(i, c.range[1]), r += e.slice(c.range[1], a.range[0]).replaceAll(n, o), i = a.range[0];
+  return r += e.slice(i), r;
 }, rt = (e, t) => {
   if (!t) return e;
-  let n = "", s = 0;
-  for (const [r, o] of $(e, t))
-    n += e.slice(s, r.range[1]), n += e.slice(r.range[1], o.range[0]).replaceAll(/[\s\n]+/g, " "), s = o.range[0];
-  return n += e.slice(s), n;
-}, oe = (e, t, n) => {
-  var o, i, l, c;
+  let n = "", o = 0;
+  for (const [s, r] of $(e, t))
+    n += e.slice(o, s.range[1]), n += e.slice(s.range[1], r.range[0]).replaceAll(/[\s\n]+/g, " "), o = r.range[0];
+  return n += e.slice(o), n;
+}, le = (e, t, n) => {
+  var r, i, l, c;
   if (!t) return e;
-  const s = (a) => /\s/.test(e[a]), r = new d();
-  for (const [a, u] of $(e, t)) {
-    if ((o = n.start) != null && o.left) {
+  const o = (a) => /\s/.test(e[a]), s = new u();
+  for (const [a, m] of $(e, t)) {
+    if ((r = n.start) != null && r.left) {
       let p = a.range[0] - 1;
-      for (; s(p); ) r.push(p--);
+      for (; o(p); ) s.push(p--);
     }
     if ((i = n.start) != null && i.right) {
       let p = a.range[1];
-      for (; s(p); ) r.push(p++);
+      for (; o(p); ) s.push(p++);
     }
     if ((l = n.end) != null && l.left) {
-      let p = u.range[0] - 1;
-      for (; s(p); ) r.push(p--);
+      let p = m.range[0] - 1;
+      for (; o(p); ) s.push(p--);
     }
     if ((c = n.end) != null && c.right) {
-      let p = u.range[1];
-      for (; s(p); ) r.push(p++);
+      let p = m.range[1];
+      for (; o(p); ) s.push(p++);
     }
   }
-  return new d([0, e.length]).subtract(r).slice(e);
-}, ot = (e, t, n) => {
-  if (!t) return ne(e);
-  const s = Ze(t);
+  return new u([0, e.length]).subtract(s).slice(e);
+}, it = (e, t, n, o) => {
+  if (!n) return se(e);
+  const s = Ye(n);
   switch (s.name) {
+    case "include":
+      for (const r of [s.id, ...T(s)])
+        e += ie(t, r);
+      break;
     case "extract":
-      e = Ye(e, s.id, ...F(s));
+      e = ie(
+        e || t,
+        s.id,
+        ...T(s)
+      );
       break;
     case "remove":
-      e = et(e, s.id, ...F(s));
+      e = tt(
+        e,
+        s.id,
+        ...T(s)
+      );
       break;
     case "replace":
-      e = tt(e, s.id, s.with, s.space);
+      e = nt(
+        e,
+        s.id,
+        s.with,
+        s.space
+      );
       break;
     case "splice-start":
     case "splice-end": {
-      const { deleteCount: r, insert: o, space: i, id: l } = s, c = s.name === "splice-start" ? "start" : "end";
-      e = nt(e, l, c, r, o, i);
+      const { deleteCount: r, insert: i, space: l, id: c } = s, a = s.name === "splice-start" ? "start" : "end";
+      e = st(
+        e,
+        c,
+        a,
+        r,
+        i,
+        l
+      );
       break;
     }
     case "trim-start":
     case "trim-end": {
-      const { left: r, right: o, id: i } = s, l = s.name === "trim-start" ? "start" : "end";
-      e = oe(e, i, { [l]: { left: r ?? !0, right: o ?? !0 } });
+      s.left ?? (s.left = !0), s.right ?? (s.right = !0);
+      const r = s.name === "trim-start" ? "start" : "end", { length: i } = e;
+      e = le(e, s.id, {
+        [r]: s
+      }), console.log(
+        `Trimmed ${i - e.length} characters from ${r} of "${s.id}" region`
+      );
       break;
     }
     case "trim": {
-      const { inside: r, outside: o, id: i } = s;
-      e = oe(e, i, { start: { left: o ?? !0, right: r ?? !0 }, end: { left: r ?? !0, right: o ?? !0 } });
+      const { inside: r, outside: i, id: l } = s, c = { left: i ?? !0, right: r ?? !0 }, a = { left: r ?? !0, right: i ?? !0 }, { length: m } = e;
+      e = le(e, l, { start: c, end: a }), console.log(
+        `Trimmed ${m - e.length} characters around "${s.id}" region`
+      );
       break;
     }
     case "single-line":
       e = rt(e, s.id);
       break;
     case "remap":
-      e = st(e, s.id, s.from, s.to, s.space);
+      e = ot(
+        e,
+        s.id,
+        s.from,
+        s.to,
+        s.space
+      );
       break;
   }
-  return s.name === "debug" && console.log("debug!!!", s), e = n && s.name !== "debug" ? ne(e) : e, n ? P(e) : e;
-}, it = [
+  return s.name === "debug" && console.log("debug!!!", s), e = o && s.name !== "debug" ? se(e) : e, o ? j(e) : e;
+}, lt = [
   "recipe(id: string)"
-], lt = [
+], at = [
   "recipe(id: string, 0?: string, 1?: string, 2?: string)"
-], ie = {
-  register: R(it),
-  apply: R(lt)
-}, N = class N {
+], ae = {
+  register: R(lt),
+  apply: R(at)
+}, k = class k {
   constructor() {
     _(this, "recipes", /* @__PURE__ */ new Map());
   }
   tryStore(t) {
-    const n = N.Entries(this.apply(t));
-    for (let s = 0; s < n.length; s++) {
-      const [r, o] = n[s];
-      if (r !== "register") continue;
-      const i = ie.register(o);
+    const n = k.Entries(this.apply(t));
+    for (let o = 0; o < n.length; o++) {
+      const [s, r] = n[o];
+      if (s !== "register") continue;
+      const i = ae.register(r);
       switch (i.name) {
         case "recipe":
-          const l = n.slice(s + 1).filter(([c]) => c !== "register").map(([c, a]) => `${c}=${a}`).join("&");
+          const l = n.slice(o + 1).filter(([c]) => c !== "register").map(([c, a]) => `${c}=${a}`).join("&");
           this.recipes.set(i.id, l);
           break;
         default:
@@ -556,137 +657,190 @@ const I = (e) => {
     }
   }
   apply(t) {
-    const n = N.Entries(t), s = [];
-    for (let r = 0; r < n.length; r++) {
-      const [o, i] = n[r];
-      if (o !== "apply") {
-        s.push(`${o}=${i}`);
+    const n = k.Entries(t), o = [];
+    for (let s = 0; s < n.length; s++) {
+      const [r, i] = n[s];
+      if (r !== "apply") {
+        o.push(`${r}=${i}`);
         continue;
       }
-      const l = ie.apply(i);
+      const l = ae.apply(i);
       switch (l.name) {
         case "recipe":
-          s.push(this.recipes.get(l.id)), s.push(...F(l).map((c) => this.recipes.get(c)));
+          o.push(this.recipes.get(l.id)), o.push(...T(l).map((c) => this.recipes.get(c)));
           break;
         default:
           throw new Error(`Unknown registration: ${l.name}`);
       }
     }
-    return s.join("&");
+    return o.join("&");
   }
 };
-_(N, "Entries", (t) => Array.from(new URLSearchParams(t).entries()));
-let H = N;
-const at = ["http", "./", "../", "?"], ct = ({ url: e }) => at.some((t) => e.startsWith(t)), pt = (e) => G(e) && Re(e) && ct(e), me = ({ url: e }, t) => `[](${t ? A(t, e) : e})`, h = {
+_(k, "Entries", (t) => Array.from(new URLSearchParams(t).entries()));
+let H = k;
+const ct = ["http", "./", "../", "?"], pt = ({ url: e }) => ct.some((t) => e.startsWith(t)), mt = (e) => G(e) && We(e) && pt(e), ue = ({ url: e }, t) => `[](${t ? A(t, e) : e})`, h = {
   _open: "<!--",
   _close: "-->",
   _flag: "p↓",
   get begin() {
-    return M(h._open, h._flag, "BEGIN", h._close);
+    return M(
+      h._open,
+      h._flag,
+      "BEGIN",
+      h._close
+    );
   },
   get end() {
-    return M(h._open, h._flag, "END", h._close);
+    return M(
+      h._open,
+      h._flag,
+      "END",
+      h._close
+    );
   },
   lengthOf(e) {
     const t = `lines: ${e.split(`
 `).length}`, n = `chars: ${e.length}`;
-    return M(h._open, h._flag, "length", t, n, h._close);
+    return M(
+      h._open,
+      h._flag,
+      "length",
+      t,
+      n,
+      h._close
+    );
   }
-}, le = (e) => (t) => G(t) && t.value === h[e], ut = ({ position: e, url: t, siblingCount: n }, s) => ({ position: e, url: t, headingDepth: s, inline: n >= 1 }), mt = ({ position: { start: e }, url: t, siblingCount: n }, { position: { end: s } }, r) => ({ position: { start: e, end: s }, url: t, headingDepth: r, inline: n >= 1 }), ht = (e, t, n) => (e.inline ? M : We)(
-  me(e, n),
+}, ce = (e) => (t) => G(t) && t.value === h[e], gt = ({ position: e, url: t, siblingCount: n }, o) => ({
+  position: e,
+  url: t,
+  headingDepth: o,
+  inline: n >= 1
+}), ht = ({ position: { start: e }, url: t, siblingCount: n }, { position: { end: o } }, s) => ({
+  position: { start: e, end: o },
+  url: t,
+  headingDepth: s,
+  inline: n >= 1
+}), ut = (e, t, n) => (e.inline ? M : Pe)(
+  ue(e, n),
   h.begin,
   h.lengthOf(t),
   t,
   h.end
-), gt = (e) => {
-  const t = O(e, "heading").reduce((n, { position: s, depth: r }) => n.set(s.start.line, r), /* @__PURE__ */ new Map());
+), dt = (e) => {
+  const t = O(e, "heading").reduce(
+    (n, { position: o, depth: s }) => n.set(o.start.line, s),
+    /* @__PURE__ */ new Map()
+  );
   return (n) => {
-    for (let s = n.position.start.line; s >= 1; s--) {
-      const r = t.get(s);
-      if (r) return r;
+    for (let o = n.position.start.line; o >= 1; o--) {
+      const s = t.get(o);
+      if (s) return s;
     }
     return 0;
   };
-}, T = {
-  openingCommentDoesNotFollowLink: ({ position: { start: e } }) => new Error(`Opening comment (@${e.line}:${e.column}) does not follow link`),
-  closingCommentNotMatchedToOpening: ({ position: { start: e } }) => new Error(`Closing comment (@${e.line}:${e.column}) does not match to opening comment`),
-  openingCommentNotClosed: ({ position: { start: e } }) => new Error(`Opening comment (@${e.line}:${e.column}) is not followed by a closing comment`)
-}, dt = (e, t) => {
-  const n = [], s = [
-    ...e.map((o) => ({ node: o, type: "open" })),
-    ...t.map((o) => ({ node: o, type: "close" }))
-  ].sort((o, i) => f(o.node, i.node)), r = [];
-  for (const o of s)
-    if (o.type === "open") r.push(o);
+}, W = {
+  openingCommentDoesNotFollowLink: ({
+    position: { start: e }
+  }) => new Error(
+    `Opening comment (@${e.line}:${e.column}) does not follow link`
+  ),
+  closingCommentNotMatchedToOpening: ({
+    position: { start: e }
+  }) => new Error(
+    `Closing comment (@${e.line}:${e.column}) does not match to opening comment`
+  ),
+  openingCommentNotClosed: ({ position: { start: e } }) => new Error(
+    `Opening comment (@${e.line}:${e.column}) is not followed by a closing comment`
+  )
+}, ft = (e, t) => {
+  const n = [], o = [
+    ...e.map((r) => ({ node: r, type: "open" })),
+    ...t.map((r) => ({ node: r, type: "close" }))
+  ].sort((r, i) => d(r.node, i.node)), s = [];
+  for (const r of o)
+    if (r.type === "open") s.push(r);
     else {
-      const i = o.node;
-      if (r.length === 0)
-        throw T.closingCommentNotMatchedToOpening(i);
-      const l = r.pop().node;
-      if (r.length > 0) continue;
+      const i = r.node;
+      if (s.length === 0)
+        throw W.closingCommentNotMatchedToOpening(i);
+      const l = s.pop().node;
+      if (s.length > 0) continue;
       n.push({ open: l, close: i });
     }
-  if (r.length > 0)
-    throw T.openingCommentNotClosed(r[0].node);
+  if (s.length > 0) throw W.openingCommentNotClosed(s[0].node);
   return n;
-}, ft = (e, t, n) => {
-  const s = [...t].sort(f), r = [];
-  return [...n].sort((o, i) => f.reverse(o.open, i.open)).forEach((o) => {
-    for (; s.length > 0; ) {
-      const i = s.pop();
-      if (i.position.start.offset < o.open.position.start.offset) {
-        if (Te(e, i, o.open).trim() !== "")
-          throw T.openingCommentDoesNotFollowLink(o.open);
-        return r.push([i, o]);
+}, vt = (e, t, n) => {
+  const o = [...t].sort(d), s = [];
+  return [...n].sort((r, i) => d.reverse(r.open, i.open)).forEach((r) => {
+    for (; o.length > 0; ) {
+      const i = o.pop();
+      if (i.position.start.offset < r.open.position.start.offset) {
+        if (Ie(e, i, r.open).trim() !== "")
+          throw W.openingCommentDoesNotFollowLink(r.open);
+        return s.push([i, r]);
       }
-      r.push(i);
+      s.push(i);
     }
-    throw T.openingCommentDoesNotFollowLink(o.open);
-  }), r.push(...s.reverse()), r.reverse();
-}, he = (e, t) => {
+    throw W.openingCommentDoesNotFollowLink(r.open);
+  }), s.push(...o.reverse()), s.reverse();
+}, de = (e, t) => {
   t ?? (t = z.md(e));
-  const n = gt(t), s = O(t, "link").filter(pt), r = O(t, "html").sort(f), o = r.filter(le("begin")), i = r.filter(le("end")), l = dt(o, i);
-  return ft(e, s, l).map((a) => Array.isArray(a) ? mt(a[0], a[1].close, n(a[0])) : ut(a, n(a)));
-}, vt = (e, { url: t }) => (n) => e(A(Q(t), n)), ge = (...e) => {
-  const t = e.reduce((n, s) => n + s, 0);
+  const n = dt(t), o = O(t, "link").filter(mt), s = O(t, "html").sort(d), r = s.filter(ce("begin")), i = s.filter(ce("end")), l = ft(r, i);
+  return vt(e, o, l).map(
+    (a) => Array.isArray(a) ? ht(a[0], a[1].close, n(a[0])) : gt(a, n(a))
+  );
+}, wt = (e, { url: t }) => ((n) => e(
+  A(Q(t), n)
+)), fe = (...e) => {
+  const t = e.reduce((n, o) => n + o, 0);
   return Math.min(Math.max(t, 1), 6);
-}, wt = (e, t, n) => {
+}, $t = (e, t, n) => {
   if (t === 0) return e;
   n ?? (n = z.md(e));
-  const s = O(n, "heading"), r = e.split(`
+  const o = O(n, "heading"), s = e.split(`
 `);
-  for (const o of s) {
-    const { depth: i, position: { start: l, end: c } } = o, a = ge(i, t), u = r[l.line - 1].slice(i, c.column), p = "#".repeat(a) + u;
-    r[l.line - 1] = p, o.depth = a;
+  for (const r of o) {
+    const {
+      depth: i,
+      position: { start: l, end: c }
+    } = r, a = fe(i, t), m = s[l.line - 1].slice(i, c.column), p = "#".repeat(a) + m;
+    s[l.line - 1] = p, r.depth = a;
   }
-  return r.join(`
+  return s.join(`
 `);
-}, de = (e) => he(e).reverse().sort(f.reverse).reduce((t, n) => pe(t, me(n), n), e), fe = (e, t, n, s, r) => {
+}, ve = (e) => de(e).reverse().sort(d.reverse).reduce(
+  (t, n) => ge(t, ue(n), n),
+  e
+), we = (e, t, n, o, s) => {
   try {
-    e = de(e), e = wt(e, t);
-    const o = z.md(e), i = new H(), l = he(e, o).sort(f);
+    e = ve(e), e = $t(e, t);
+    const r = z.md(e), i = new H(), l = de(e, r).sort(d);
     return l.filter(({ url: c }) => c.startsWith("?")).forEach(({ url: c }) => i.tryStore(c)), l.reverse().map((c) => {
-      var k, S;
-      const { url: a, headingDepth: u } = c, [p, ...b] = xe(a).split("?"), y = i.apply(b.join("?"));
+      var N, S;
+      const { url: a, headingDepth: m } = c, [p, ...b] = ke(a).split("?"), y = i.apply(b.join("?"));
       if (!a.startsWith("?"))
         if (a.startsWith("./") || a.startsWith("../")) {
-          const m = p.split(".").pop() ?? "", j = Q(a), V = A(j, p);
-          let g = n(V);
-          const x = new _e(y), D = (k = ((w) => {
-            const v = Array.from(x.entries()).filter(([C]) => C === w).map(([C, q]) => q);
+          const g = p.split(".").pop() ?? "", D = Q(a), V = A(D, p), J = n(V), x = new Ne(y), L = (N = ((w) => {
+            const v = Array.from(x.entries()).filter(([C]) => C === w).map(([C, B]) => B);
             return v.length >= 1 ? v.join(",") : void 0;
-          })("region")) == null ? void 0 : k.split(J);
-          g = (D == null ? void 0 : D.reduce(
-            (w, v, C, { length: q }) => ot(w, v, C === q - 1),
-            g
-          )) ?? g;
-          const $e = x.has("skip"), be = x.get("heading") ?? 0, ye = x.has("inline");
-          let { inline: L } = c;
-          if (ye && (L = !0), !$e)
-            if (m === "md") {
-              const w = vt(n, c), v = r ? A(r, j) : j, C = ge(u, Number(be));
-              g = fe(
-                g,
+          })("region")) == null ? void 0 : N.split(Z);
+          let f = (L == null ? void 0 : L.reduce(
+            (w, v, C, { length: B }) => it(w, J, v, C === B - 1),
+            ""
+          )) ?? J;
+          const ye = x.has("skip"), Ce = x.get("heading") ?? 0, Ee = x.has("inline");
+          let { inline: U } = c;
+          if (Ee && (U = !0), !ye)
+            if (g === "md") {
+              const w = wt(
+                n,
+                c
+              ), v = s ? A(s, D) : D, C = fe(
+                m,
+                Number(Ce)
+              );
+              f = we(
+                f,
                 /** p↓: ... */
                 C,
                 w,
@@ -694,38 +848,49 @@ const at = ["http", "./", "../", "?"], ct = ({ url: e }) => at.some((t) => e.sta
                 v
                 /** p↓: ... */
               );
-            } else /^(js|ts)x?|svelte$/i.test(m) && (g = ee(
-              g,
+            } else /^(js|ts)x?|svelte$/i.test(g) && (f = te(
+              f,
               "code",
               /** p↓: ... */
-              { extension: m, inline: L }
+              { extension: g, inline: U }
               /** p↓: ... */
             ));
-          const U = (S = x.get("wrap")) == null ? void 0 : S.split(J);
-          return g = (U == null ? void 0 : U.reduce((w, v) => ee(w, v, { extension: m, inline: L }), g)) ?? g, { target: c, content: ht(c, g, r) };
+          const q = (S = x.get("wrap")) == null ? void 0 : S.split(Z);
+          return f = (q == null ? void 0 : q.reduce(
+            (w, v) => te(w, v, { extension: g, inline: U }),
+            f
+          )) ?? f, {
+            target: c,
+            content: ut(c, f, s)
+          };
         } else throw a.startsWith("http") ? new Error("External web links are not implemented yet") : new Error(`Unsupported link type: ${a}`);
-    }).filter(Boolean).reduce((c, { target: a, content: u }) => pe(c, u, a), e);
-  } catch (o) {
-    throw new Error(`Error populating inclusions in file ${s ?? "(unknown)"}: ${o}`);
+    }).filter(Boolean).reduce(
+      (c, { target: a, content: m }) => ge(c, m, a),
+      e
+    );
+  } catch (r) {
+    throw new Error(
+      `Error populating inclusions in file ${o ?? "(unknown)"}: ${r}`
+    );
   }
-}, ve = (e) => Se(e, "utf-8"), we = (e) => {
-  const t = ce(e), n = Q(t);
-  return { content: ve(t), dir: n, path: t };
-}, $t = (e, t = !0, n) => {
-  const { dir: s, path: r, content: o } = we(e);
-  n == null || n.unwatch(r), n == null || n.once("change", (c, a) => {
-    console.log(`Change detected in "${c}". Regenerating "${r}"...`), $t(e, t, n);
+}, $e = (e) => _e(e, "utf-8"), be = (e) => {
+  const t = me(e), n = Q(t);
+  return { content: $e(t), dir: n, path: t };
+}, bt = (e, t = !0, n) => {
+  const { dir: o, path: s, content: r } = be(e);
+  n == null || n.unwatch(s), n == null || n.once("change", (c, a) => {
+    console.log(`Change detected in "${c}". Regenerating "${s}"...`), bt(e, t, n);
   });
-  const l = fe(o, 0, (c) => {
-    const a = ce(s, Pe(c));
-    return n == null || n.add(a), ve(a);
-  }, r);
-  return t && ae(r, l), n == null || n.add(r), l;
-}, Mt = (e, t = !0, n) => {
-  const { path: s, content: r } = we(e), o = de(r);
-  return t && ae(s, o), o;
+  const l = we(r, 0, (c) => {
+    const a = me(o, De(c));
+    return n == null || n.add(a), $e(a);
+  }, s);
+  return t && pe(s, l), n == null || n.add(s), l;
+}, Tt = (e, t = !0, n) => {
+  const { path: o, content: s } = be(e), r = ve(s);
+  return t && pe(o, r), r;
 };
 export {
-  Mt as depopulateMarkdownInclusions,
-  $t as populateMarkdownInclusions
+  Tt as depopulateMarkdownInclusions,
+  bt as populateMarkdownInclusions
 };