@p-buddy/parkdown 0.0.12 → 0.0.14

package/dist/index.js

@@ -1,84 +1,41 @@
-var fe = Object.defineProperty;
-var de = (e, t, n) => t in e ? fe(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
-var F = (e, t, n) => de(e, typeof t != "symbol" ? t + "" : t, n);
-import { writeFileSync as K, readFileSync as we } from "node:fs";
-import { basename as ve, dirname as A, join as y, resolve as Y } from "node:path";
-import { URLSearchParams as $e } from "node:url";
-import { unified as Ce } from "unified";
-import Ee from "remark-parse";
-import { visit as ye } from "unist-util-visit";
-import { dedent as j } from "ts-dedent";
-const h = (e, t) => e.position.start.offset - t.position.start.offset;
-h.reverse = (e, t) => h(t, e);
-const D = (e) => e.position !== void 0 && e.position.start.offset !== void 0 && e.position.end.offset !== void 0, Se = Ce().use(Ee), I = {
-  md: (e) => Se.parse(e)
-}, S = (e, t) => {
+var ye = Object.defineProperty;
+var Ce = (e, t, n) => t in e ? ye(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
+var _ = (e, t, n) => Ce(e, typeof t != "symbol" ? t + "" : t, n);
+import { writeFileSync as le, readFileSync as Ee } from "node:fs";
+import { basename as Se, dirname as z, join as T, resolve as ae } from "node:path";
+import { URLSearchParams as Z } from "node:url";
+import { unified as xe } from "unified";
+import ke from "remark-parse";
+import { visit as _e } from "unist-util-visit";
+import { dedent as Ne } from "ts-dedent";
+const f = (e, t) => e.position.start.offset - t.position.start.offset;
+f.reverse = (e, t) => f(t, e);
+const X = (e) => e.position !== void 0 && e.position.start.offset !== void 0 && e.position.end.offset !== void 0, Re = xe().use(ke), V = {
+  md: (e) => Re.parse(e)
+}, I = (e, t) => {
   const n = [];
-  return ye(e, (s, o, r) => {
+  return _e(e, (s, r, o) => {
     if (s.type !== "root") {
       if (t && s.type !== t) return;
-      if (D(s)) {
-        const i = ((r == null ? void 0 : r.children.length) ?? 0) - 1;
-        n.push({ ...s, siblingIndex: o, siblingCount: i });
+      if (X(s)) {
+        const i = ((o == null ? void 0 : o.children.length) ?? 0) - 1;
+        n.push({ ...s, siblingIndex: r, siblingCount: i });
       }
     }
   }), n;
-}, xe = (e) => e.children.length === 0, ee = (e, t, ...n) => {
+}, Me = (e) => e.children.length === 0, ce = (e, t, ...n) => {
   if (n.length === 0) throw new Error("No nodes to replace content from");
-  n.sort(h);
-  const s = n.at(0), o = n.at(-1);
-  return e.slice(0, s.position.start.offset) + t + e.slice(o.position.end.offset);
-}, Ne = (e, t, n) => {
-  const s = Math.min(t.position.end.offset, n.position.end.offset), o = Math.max(t.position.start.offset, n.position.start.offset);
-  return e.slice(s, o);
-}, E = (...e) => e.join(" "), be = (...e) => e.join(`
-`), ke = (e) => {
+  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);
+}, Ae = (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);
+}, O = (...e) => e.join(" "), Oe = (...e) => e.join(`
+`), Te = (e) => {
   const t = e.split("?");
   return t.length > 1 ? [t.slice(0, -1).join("?"), t.at(-1)] : [e, ""];
-}, Me = (e) => ke(e)[0];
-class d {
-  constructor(...t) {
-    F(this, "intervals", []);
-    for (const [n, s] of t)
-      this.push(n, s);
-  }
-  push(t, n) {
-    this.intervals.push([Math.min(t, n), Math.max(t, n)]);
-  }
-  combine(t) {
-    this.intervals.push(...t.intervals);
-  }
-  collapse() {
-    const { intervals: t } = this;
-    if (!t.length) return this.intervals = [];
-    t.sort((r, i) => r[0] - i[0]);
-    const n = [];
-    let [s, o] = t[0];
-    for (let r = 1; r < t.length; r++) {
-      const [i, c] = t[r];
-      i <= o ? o = Math.max(o, c) : (n.push([s, o]), s = i, o = c);
-    }
-    return n.push([s, o]), this.intervals = n;
-  }
-  subtract(t) {
-    const { intervals: n } = this, { intervals: s } = t;
-    if (!n.length || !s.length) return n;
-    let o = [...n];
-    for (const [r, i] of s) {
-      const c = [];
-      for (const [l, a] of o) {
-        if (i <= l || r >= a) {
-          c.push([l, a]);
-          continue;
-        }
-        r > l && c.push([l, r]), i < a && c.push([i, a]);
-      }
-      o = c;
-    }
-    return this.intervals = o;
-  }
-}
-const U = /,\s*(?![^()]*\))/, H = {
+}, Ie = (e) => Te(e)[0], F = /,\s*(?![^()]*\))/, K = {
   reserved: {
     semi: ";",
     slash: "/",
@@ -106,7 +63,7 @@ const U = /,\s*(?![^()]*\))/, H = {
     line: `
 `
   }
-}, _e = "-", G = {
+}, je = "-", Y = {
   static: [
     ["'''", '"'],
     ["''", "'"],
@@ -114,87 +71,87 @@ const U = /,\s*(?![^()]*\))/, H = {
     [/p↓:\s+/g, ""]
   ],
   url: [
-    ...Object.entries(H.unsafe),
-    ...Object.entries(H.reserved)
+    ...Object.entries(K.unsafe),
+    ...Object.entries(K.reserved)
   ]
-}, Q = (e, [t, n]) => e.replaceAll(t, n), N = (e, t = _e) => {
-  const n = G.static.reduce(Q, e);
-  return G.url.map(([s, o]) => [t + s + t, o]).reduce(Q, n).replaceAll(t, " ");
-}, Oe = (e) => e.replace(/[.*+?^${}()|[\]\\]/g, "\\$&"), Re = ["string", "number", "boolean"], Te = (e) => Re.includes(e), Ae = /^([a-zA-Z0-9_-]+)(?:\(([^)]*)\))?$/, je = (e) => {
-  const t = e.match(Ae);
+}, ee = (e, [t, n]) => e.replaceAll(t, n), W = (e, t = je) => {
+  const n = Y.static.reduce(ee, e);
+  return Y.url.map(([s, r]) => [t + s + t, r]).reduce(ee, n).replaceAll(t, " ");
+}, We = ["string", "number", "boolean"], De = (e) => We.includes(e), Pe = /^([a-zA-Z0-9_-]+)(?:\(([^)]*)\))?$/, Le = (e) => {
+  const t = e.match(Pe);
   if (!t) throw new Error(`Invalid invocation: ${e}`);
   const [, n, s = ""] = t;
   if (!s.trim()) return { name: n, parameters: [] };
-  const o = Ie(s);
-  return { name: n, parameters: o };
-}, De = (e, t) => {
+  const r = qe(s);
+  return { name: n, parameters: r };
+}, Ue = (e, t) => {
   for (let n = t + 1; n < e.length; n++)
     if (e[n] !== void 0) return !1;
   return !0;
-}, Ie = (e) => {
+}, qe = (e) => {
   const t = [];
   let n = "", s = !1;
-  for (let o = 0; o < e.length; o++) {
-    const r = e[o], i = r === "'";
-    if (i && e.at(o + 1) === "'") {
-      const c = e.at(o + 2) === "'";
-      s = !s, n += c ? "'''" : "''", o += c ? 2 : 1;
-    } else i ? (s = !s, n += r) : r === "," && !s ? (t.push(n.trim()), n = "") : n += r;
+  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;
   }
-  return t.push(n.trim()), t.map((o) => o === "" ? void 0 : o ? Pe(o) : void 0).filter((o, r, i) => o !== void 0 || !De(i, r));
-}, Pe = (e) => {
+  return t.push(n.trim()), t.map((r) => r === "" ? void 0 : r ? Be(r) : void 0).filter((r, o, i) => r !== void 0 || !Ue(i, o));
+}, Be = (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);
-}, We = (e) => {
+}, Fe = (e) => {
   const t = /^(\w+)(?:\(([^)]*)\))?/, n = e.match(t);
   if (!n) return { name: e };
-  const [, s, o] = n;
-  if (!o) return { name: s };
-  const r = /(\w+)(\?)?:\s*([^,]+)/g, i = [];
-  let c;
-  for (; (c = r.exec(o)) !== null; ) {
-    const [, l, a, u] = c, p = u.trim();
-    if (!Te(p)) throw new Error(`Unsupported type: ${p}`);
-    i.push({ name: l, optional: a === "?", type: p });
+  const [, s, r] = n;
+  if (!r) return { name: s };
+  const o = /(\w+)(\?)?:\s*([^,]+)/g, i = [];
+  let l;
+  for (; (l = o.exec(r)) !== null; ) {
+    const [, a, c, u] = l, p = u.trim();
+    if (!De(p)) throw new Error(`Unsupported type: ${p}`);
+    i.push({ name: a, optional: c === "?", type: p });
   }
   return { name: s, parameters: i };
-}, P = (e) => {
-  const t = e.map(We).reduce(
-    (n, { name: s, parameters: o }) => n.set(s, o),
+}, R = (e) => {
+  const t = e.map(Fe).reduce(
+    (n, { name: s, parameters: r }) => n.set(s, r),
     /* @__PURE__ */ new Map()
   );
   return (n) => {
-    const { name: s, parameters: o } = je(n);
+    const { name: s, parameters: r } = Le(n);
     if (!t.has(s))
       throw new Error(`Unknown method: ${s}`);
-    const r = t.get(s);
-    if (r === void 0)
+    const o = t.get(s);
+    if (o === void 0)
       return { name: s };
-    if (o.length > r.length) {
-      const i = r.filter(({ optional: l }) => !l).length, c = i === r.length ? i.toString() : `${i} - ${r.length}`;
-      throw new Error(`Too many parameters: ${o.length} for method '${s}' (expected: ${c})`);
+    if (r.length > o.length) {
+      const i = o.filter(({ optional: a }) => !a).length, l = i === o.length ? i.toString() : `${i} - ${o.length}`;
+      throw new Error(`Too many parameters: ${r.length} for method '${s}' (expected: ${l})`);
     }
-    return r.reduce((i, { name: c, optional: l, type: a }, u) => {
-      const p = o[u];
+    return o.reduce((i, { name: l, optional: a, type: c }, u) => {
+      const p = r[u];
       if (p === void 0) {
-        if (l) return i;
-        throw new Error(`Missing required parameter: ${c} for method '${s}'`);
+        if (a) return i;
+        throw new Error(`Missing required parameter: ${l} for method '${s}'`);
       }
-      switch (a) {
+      switch (c) {
         case "string":
-          i[c] = p;
+          i[l] = p;
           break;
         case "number":
         case "boolean":
-          i[c] = JSON.parse(p);
+          i[l] = JSON.parse(p);
           break;
       }
-      if (typeof i[c] !== a)
-        throw new Error(`Invalid type: ${c} must be ${a}, got ${typeof i[c]} for method '${s}'`);
+      if (typeof i[l] !== c)
+        throw new Error(`Invalid type: ${l} must be ${c}, got ${typeof i[l]} for method '${s}'`);
       return i;
     }, { name: s });
   };
-}, z = (e) => Object.entries(e).filter(([t]) => t !== "name" && !isNaN(Number(t))).map(([t, n]) => n), Le = [
+}, Q = (e) => Object.entries(e).filter(([t]) => t !== "name" && !isNaN(Number(t))).map(([t, n]) => n), He = [
   /**
    * Wraps the content in a markdown-formatted code block.
    * @param lang The language of the code block (defaults to the file extension).
@@ -224,55 +181,131 @@ const U = /,\s*(?![^()]*\))/, H = {
    * @example [](<url>?wrap=dropdown(hello_world,,_)) 
    */
   "dropdown(summary: string, open?: boolean, space?: string)"
-], qe = P(Le), f = (e, t = 1) => `
+], Qe = R(He), S = (e, t = 1) => `
 `.repeat(t) + e + `
-`.repeat(t), T = (e, t, n) => `<${t}${n ? ` ${n}` : ""}>${f(e)}</${t}>`, X = (e, t, n) => {
-  const s = qe(t);
+`.repeat(t), H = (e, t, n) => `<${t}${n ? ` ${n}` : ""}>${S(e)}</${t}>`, te = (e, t, n) => {
+  const s = Qe(t);
   switch (s.name) {
     case "code":
       if (!s.lang && !s.meta && (n == null ? void 0 : n.inline) && !e.includes(`
 `)) return `\`${e}\``;
-      const r = s.lang ?? (n == null ? void 0 : n.extension) ?? "", i = s.meta ? ` ${s.meta}` : "";
-      return f(`\`\`\`${r}${i}${f(e)}\`\`\``);
+      const o = s.lang ?? (n == null ? void 0 : n.extension) ?? "", i = s.meta ? ` ${s.meta}` : "";
+      return S(`\`\`\`${o}${i}${S(e)}\`\`\``);
     case "quote":
       return n != null && n.inline && !e.includes(`
 
-`) ? `> ${e}` : f(T(f(e), "blockquote"));
+`) ? `> ${e}` : S(H(S(e), "blockquote"));
     case "dropdown":
-      const c = T(N(s.summary), "summary");
-      return f(T([c, e].join(`
+      const l = H(W(s.summary), "summary");
+      return S(H([l, e].join(`
 `), "details", s.open ? "open" : void 0));
   }
-}, W = (e) => {
+};
+class d {
+  constructor(...t) {
+    _(this, "_intervals", []);
+    _(this, "collapsed", !0);
+    for (const [n, s] of t)
+      this.push(n, s);
+  }
+  get intervals() {
+    return this._intervals;
+  }
+  push(t, n) {
+    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);
+    return this;
+  }
+  collapse(t = !1) {
+    const { _intervals: n, collapsed: s } = this;
+    if (s && !t || !n.length) return this;
+    n.sort((l, a) => l[0] - a[0]);
+    const r = [];
+    let [o, i] = n[0];
+    for (let l = 1; l < n.length; l++) {
+      const [a, c] = n[l];
+      a <= i ? i = Math.max(i, c) : (r.push([o, i]), o = a, i = c);
+    }
+    return r.push([o, i]), this._intervals = r, 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 l = [];
+      for (const [a, c] of r) {
+        if (i <= a || o >= c) {
+          l.push([a, c]);
+          continue;
+        }
+        o > a && l.push([a, o]), i < c && l.push([i, c]);
+      }
+      r = l;
+    }
+    return this._intervals = r, this.collapse(!0), this;
+  }
+  test(t, n = "head") {
+    const { _intervals: s } = this;
+    switch (n) {
+      case "head":
+        return s.some(([r, o]) => t >= r && t < o);
+      case "tail":
+        return s.some(([r, o]) => t > r && t <= o);
+      case "both":
+        return s.some(([r, o]) => t >= r && t <= o);
+      case "none":
+        return s.some(([r, o]) => t > r && t < o);
+    }
+  }
+  slice(t) {
+    this.collapse();
+    const n = [];
+    for (const [s, r] of this._intervals)
+      n.push(t.slice(s, r));
+    return n.filter(Boolean).join("");
+  }
+  offset(t) {
+    for (const n of this._intervals)
+      n[0] += t, n[1] += t;
+    return this;
+  }
+}
+const D = (e) => {
   const t = /(\/\/[^\n]*|\/\*[\s\S]*?\*\/|<!--[\s\S]*?-->)/gm, n = [];
   let s;
   for (; (s = t.exec(e)) !== null; ) {
-    const o = [s.index, s.index + s[0].length], r = Be(s[0]).trim();
-    n.push({ range: o, value: r });
+    const r = [s.index, s.index + s[0].length], o = Ge(s[0]).trim();
+    n.push({ range: r, value: o });
   }
   return n;
-}, Be = (e) => e.startsWith("//") ? e.slice(2) : e.startsWith("/*") ? e.slice(2, -2) : e.startsWith("<!--") ? e.slice(4, -3) : e, te = [
+}, Ge = (e) => e.startsWith("//") ? e.slice(2) : e.startsWith("/*") ? e.slice(2, -2) : e.startsWith("<!--") ? e.slice(4, -3) : e, ze = [
   "p↓:",
   "pd:",
   "parkdown:"
-], Fe = [
+], Xe = [
   "splice(delete?: number, insert?: string)"
 ];
-P(Fe);
-const ne = (e, t) => e.range[0] - t.range[0], se = (e, t, n) => (n ?? W(e)).filter(({ value: s }) => s.includes(t)).sort(ne), V = (e) => ({
+R(Xe);
+const pe = (e, t) => e.range[0] - t.range[0], J = (e, t, n) => (n ?? D(e)).filter(({ value: s }) => s.split(" ").includes(t)).sort(pe), ne = (e) => ({
   isSpace: e === " ",
   isNewline: e === `
 ` || e === void 0
-}), J = (e) => te.flatMap((t) => se(e, t)).sort((t, n) => t.range[0] - n.range[0]).reverse().reduce((t, { range: [n, s], value: o }) => {
-  const r = (p, b) => t.slice(0, p) + t.slice(b), i = V(t[n - 1]), c = V(t[s]), l = s === t.length;
-  let a = n;
-  for (; a > 0 && t[a - 1] !== `
-`; ) a--;
-  const u = t.slice(a, n).trim() === "";
-  return i.isNewline && c.isNewline ? r(n - (l ? 1 : 0), s + 1) : i.isNewline || u ? r(a, s + (c.isSpace || c.isNewline ? 1 : 0)) : r(n - (i.isSpace ? 1 : 0), s);
-}, e);
-te.map((e) => new RegExp(`^${Oe(e)}(\\?[^\\s]+)`));
-const Ue = [
+}), se = (e) => ze.flatMap((t) => J(e, t)).sort((t, n) => t.range[0] - n.range[0]).reverse().reduce((t, { range: [n, s], value: r }) => {
+  const o = (w, $) => t.slice(0, w) + t.slice($), i = ne(t[n - 1]), l = ne(t[s]), a = s === t.length;
+  let c = n;
+  for (; c > 0 && t[c - 1] !== `
+`; ) c--;
+  let u = s;
+  for (; u < t.length && t[u] !== `
+`; ) u++;
+  const p = t.slice(c, n).trim() === "" && t.slice(s, u).trim() === "";
+  return i.isNewline && l.isNewline ? o(n - (a ? 1 : 0), s + 1) : i.isNewline || p ? o(c, s + (l.isSpace || l.isNewline ? 1 : 0)) : o(n - (i.isSpace ? 1 : 0), s);
+}, e), Ve = [
   /**
    * Extract regions from the retrieved content between comments that INCLUDE the specified ids.
    * @param id The id of the comment to extract.
@@ -304,25 +337,7 @@ const Ue = [
    */
   "replace(id: string, with?: string, space?: string)",
   /**
-   * Splice the retrieved content at the boundary of a comment region (which must INCLUDE the specified id).
-   * 
-   * **NOTE:** Unlike `extract`, `remove`, and `replace`, `splice` does remove the comment from the content after processing.
-   * @param id The id of the comment regions to act on.
-   * @param deleteCount The number of characters to delete at either the beginning or end of the comment region.
-   * Specifying a number greater than or equal to 0 indicates the action should be taken at the end of the comment region.
-   * Specifying undefined or a number less than 0 indicates the action should be taken at the beginning of the comment region.
-   * @param insert The content to insert.
-   * @param space The space character to use between words in the content to insert (defaults to `-`).
-   * @example [](<url>?region=splice(specifier,-1)) // Delete one character at the beginning of the comment region.
-   * @example [](<url>?region=splice(specifier,undefined,new-content)) // Insert at the beginning of the comment region.
-   * @example [](<url>?region=splice(specifier,0,new-content)) // Insert at the end of the comment region.
-   * @example [](<url>?region=splice(specifier,1,new-content)) // Delete one character at the end of the comment region and insert.
-   */
-  "splice(id: string, deleteCount?: number, insert?: string, space?: string)",
-  /**
-   * Remap the content within a comment region (which must INCLUDE the specified id).
-   * 
-   * **NOTE:** Unlike `extract`, `remove`, and `replace`, `remap` does not remove the comment from the content after processing.
+   * Remap the content (similiar to `string.replaceAll`) within a specified comment region.
    * @param id The id of the comment regions to act on.
    * @param from The content to replace.
    * @param to The content to replace with.
@@ -330,223 +345,388 @@ const Ue = [
    * @example [](<url>?region=remap(specifier,hello-world,hello-universe))
    * @example [](<url>?region=remap(specifier,hello_world,hello_universe,_)
    */
-  "remap(id: string, from: string, to: string, space?: string)"
-], He = P(Ue), w = (e, t, n) => {
-  const s = se(e, t, n), o = [];
-  for (let r = 0; r < s.length - 1; r += 2)
-    o.push([s[r], s[r + 1]]);
-  return o;
-}, Ge = (e, ...t) => {
+  "remap(id: string, from: string, to?: string, space?: string)",
+  /**
+   * Make the content of the region a single line (where all whitespace characters, including newlines, are converted to a single space).
+   * @param id The id of the comment regions to act on.
+   * @example [](<url>?region=single-line(specifier))
+   */
+  "single-line(id: string, includeBoundaries?: boolean)",
+  /**
+   * Trim the whitespace surrounding the comment boundaries of the region.
+   * @param id The id of the comment region to act on.
+   * @param inside Whether to trim the whitespace within the comment region. Defaults to `true`.
+   * @param outside Whether to trim the whitespace outside the comment region. Defaults to `true`.
+   * @example [](<url>?region=trim(specifier))
+   * @example [](<url>?region=trim(specifier,false))
+   * @example [](<url>?region=trim(specifier,,false))
+   * @example [](<url>?region=trim(specifier,false,false))
+   */
+  "trim(id: string, inside?: boolean, outside?: boolean)",
+  /**
+   * Trim the whitespace surrounding the starting comment boundary of the specified region.
+   * @param id The id of the comment region to act on.
+   * @param left Whether to trim the whitespace to the left of the comment region. Defaults to `true`.
+   * @param right Whether to trim the whitespace to the right of the comment region. Defaults to `true`.
+   * @example [](<url>?region=trim-start(specifier))
+   * @example [](<url>?region=trim-start(specifier,false))
+   */
+  "trim-start(id: string, left?: boolean, right?: boolean)",
+  /**
+   * Trim the whitespace surrounding the ending comment boundary of the specified region.
+   * @param id The id of the comment region to act on.
+   * @param left Whether to trim the whitespace to the left of the comment region. Defaults to `true`.
+   * @param right Whether to trim the whitespace to the right of the comment region. Defaults to `true`.
+   * @example [](<url>?region=trim-end(specifier))
+   * @example [](<url>?region=trim-end(specifier,false))
+   */
+  "trim-end(id: string, left?: boolean, right?: boolean)",
+  /**
+   * Splice the retrieved content at the starting comment boundary of the specified region.
+   * @param id The id of the comment region to act on.
+   * @param deleteCount The number of characters to delete at either the beginning or end of the comment boundary.
+   * Specifying a number greater than or equal to 0 indicates the action should be taken at the end of the comment boundary (i.e to the right of the comment).
+   * 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)",
+  /**
+   * Splice the retrieved content at the ending comment boundary of the specified region.
+   * @param id The id of the comment region to act on.
+   * @param deleteCount The number of characters to delete at either the beginning or end of the comment boundary.
+   * Specifying a number greater than or equal to 0 indicates the action should be taken at the end of the comment boundary (i.e to the right of the comment).
+   * 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. 
+   * Helpful when trying to determine fine-grained edits (e.g. trimming, splicing, etc.).
+   */
+  "debug()"
+], Je = R(Ve), C = (e, t, n) => {
+  const s = J(e, t, n), r = [];
+  for (let o = 0; o < s.length - 1; o += 2)
+    r.push([s[o], s[o + 1]]);
+  return r;
+}, Ze = (e, t, n) => new d(...J(e, t, n).map(({ range: s }) => s)), P = (e) => Ne(e).trim(), Ke = (e, ...t) => {
   if (t.length === 0) return e;
-  const n = W(e), s = ([i, c]) => e.slice(i, c), o = new d(), r = new d();
-  for (const i of t)
-    for (const [c, l] of w(e, i, n)) {
-      o.push(c.range[1], l.range[0]);
-      const [a, ...u] = s([c.range[1], l.range[0]]), p = u[u.length - 1];
-      r.push(c.range[0], c.range[1] + (a.trim() ? 0 : 1)), r.push(l.range[0], l.range[1] + (p.trim() ? 0 : 1));
+  const n = D(e), s = new d(), r = new d();
+  for (const o of t)
+    for (const [i, l] of C(e, o, n)) {
+      s.push(i.range[1], l.range[0]);
+      const [a, ...c] = e.slice(i.range[1], l.range[0]), u = c[c.length - 1];
+      r.push(i.range[0], i.range[1] + (a.trim() ? 0 : 1)), r.push(l.range[0], l.range[1] + (u.trim() ? 0 : 1));
     }
-  return o.collapse(), r.collapse(), j(
-    o.subtract(r).map(s).filter(Boolean).join("")
-  ).trim();
-}, Qe = (e, ...t) => {
+  return P(s.subtract(r).slice(e));
+}, Ye = (e, ...t) => {
   if (t.length === 0) return e;
-  const n = W(e), s = ([i, c]) => e.slice(i, c), o = new d();
-  for (const i of t)
-    for (const [c, l] of w(e, i, n)) {
+  const n = D(e), s = ([o, i]) => e.slice(o, i), r = new d();
+  for (const o of t)
+    for (const [i, l] of C(e, o, n)) {
       const a = s([l.range[1], l.range[1] + 1]).at(-1);
-      o.push(c.range[0], a === `
+      r.push(i.range[0], a === `
 ` ? l.range[1] + 1 : l.range[1]);
     }
-  o.collapse();
-  const r = new d([0, e.length]);
-  return r.subtract(o), j(
-    r.collapse().map(s).filter(Boolean).join("")
-  ).trim();
-}, ze = (e, t, n, s) => {
+  return P(new d([0, e.length]).subtract(r).slice(e));
+}, et = (e, t, n, s) => {
   if (!t) return e;
-  let o = "", r = 0;
-  for (const [c, l] of w(e, t))
-    o += e.slice(r, c.range[1]), o += N(n ?? c.value, s), r = l.range[0];
-  o += e.slice(r);
-  const i = new d([0, o.length]);
-  return i.subtract(new d(
-    ...w(o, t).flatMap(([c, l]) => [c.range, l.range])
-  )), j(
-    i.collapse().map(([c, l]) => o.slice(c, l)).filter(Boolean).join("")
-  ).trim();
-}, Xe = (e, t, n, s, o) => {
-  if (!t) return e;
-  const r = n === void 0 ? !1 : n >= 0, i = s ? N(s, o) : "", c = n ?? 0;
-  return w(e, t).map((l) => l[r ? 1 : 0]).sort(ne).reverse().reduce(
-    (l, { range: a }) => r ? l.slice(0, a[1]) + i + l.slice(Math.min(a[1] + c, l.length)) : l.slice(0, Math.max(a[0] + c, 0)) + i + l.slice(a[0]),
-    e
+  let r = "", o = 0;
+  for (const [i, l] of C(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(Ze(r, t)).slice(r)
   );
-}, Ve = (e, t, n, s, o) => {
+}, tt = (e, t, n, s, r, o) => {
+  if (!t) return e;
+  const i = !(s === void 0 || s < 0), l = r ? W(r, o) : "", a = s ?? 0, c = D(e), u = new d(...c.map(({ range: p }) => p));
+  return C(e, t, c).map((p) => p[n === "start" ? 0 : 1]).sort(pe).reverse().reduce((p, { range: w }) => {
+    const $ = new d(), M = i ? 1 : -1;
+    let x = Math.abs(a), m = i ? w[1] : w[0];
+    for (; x > 0 && m < p.length && m >= 0; )
+      u.test(m) || ($.push(m), x--), m += M;
+    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($.offset(i ? 0 : l.length)).slice(p);
+  }, e);
+}, nt = (e, t, n, s, r) => {
+  if (!t) return e;
+  let o = "", i = 0;
+  [n, s] = [n, s ?? ""].map((l) => W(l, r));
+  for (const [l, a] of C(e, t))
+    o += e.slice(i, l.range[1]), o += e.slice(l.range[1], a.range[0]).replaceAll(n, s), i = a.range[0];
+  return o += e.slice(i), o;
+}, st = (e, t) => {
   if (!t) return e;
-  let r = "", i = 0;
-  const c = [n, s].map((l) => N(l, o));
-  console.log(c);
-  for (const [l, a] of w(e, t))
-    r += e.slice(i, l.range[1]), r += e.slice(l.range[1], a.range[0]).replaceAll(c[0], c[1]), i = a.range[0];
-  return r += e.slice(i), r;
-}, Je = (e, t, n) => {
-  if (!t) return J(e);
-  const s = He(t);
+  let n = "", s = 0;
+  for (const [r, o] of C(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;
+}, re = (e, t, n) => {
+  var o, i, l, a;
+  if (!t) return e;
+  const s = (c) => /\s/.test(e[c]), r = new d();
+  for (const [c, u] of C(e, t)) {
+    if ((o = n.start) != null && o.left) {
+      let p = c.range[0] - 1;
+      for (; s(p); ) r.push(p--);
+    }
+    if ((i = n.start) != null && i.right) {
+      let p = c.range[1];
+      for (; s(p); ) r.push(p++);
+    }
+    if ((l = n.end) != null && l.left) {
+      let p = u.range[0] - 1;
+      for (; s(p); ) r.push(p--);
+    }
+    if ((a = n.end) != null && a.right) {
+      let p = u.range[1];
+      for (; s(p); ) r.push(p++);
+    }
+  }
+  return new d([0, e.length]).subtract(r).slice(e);
+}, rt = (e, t, n) => {
+  if (!t) return se(e);
+  const s = Je(t);
   switch (s.name) {
     case "extract":
-      e = Ge(e, s.id, ...z(s));
+      e = Ke(e, s.id, ...Q(s));
       break;
     case "remove":
-      e = Qe(e, s.id, ...z(s));
+      e = Ye(e, s.id, ...Q(s));
       break;
     case "replace":
-      e = ze(e, s.id, s.with, s.space);
+      e = et(e, s.id, s.with, s.space);
       break;
-    case "splice":
-      e = Xe(e, s.id, s.deleteCount, s.insert, s.space);
+    case "splice-start":
+    case "splice-end": {
+      const { deleteCount: r, insert: o, space: i, id: l } = s, a = s.name === "splice-start" ? "start" : "end";
+      e = tt(e, l, a, r, o, i);
+      break;
+    }
+    case "trim-start":
+    case "trim-end": {
+      const { left: r, right: o, id: i } = s, l = s.name === "trim-start" ? "start" : "end";
+      e = re(e, i, { [l]: { left: r ?? !0, right: o ?? !0 } });
+      break;
+    }
+    case "trim": {
+      const { inside: r, outside: o, id: i } = s;
+      e = re(e, i, { start: { left: o ?? !0, right: r ?? !0 }, end: { left: r ?? !0, right: o ?? !0 } });
+      break;
+    }
+    case "single-line":
+      e = st(e, s.id);
       break;
     case "remap":
-      e = Ve(e, s.id, s.from, s.to, s.space);
+      e = nt(e, s.id, s.from, s.to, s.space);
       break;
   }
-  return n ? J(e) : e;
-}, Ze = ["http", "./", "../"], Ke = ({ url: e }) => Ze.some((t) => e.startsWith(t)), Ye = (e) => D(e) && xe(e) && Ke(e), oe = ({ url: e }, t) => `[](${t ? y(t, e) : e})`, m = {
+  return e = n && s.name !== "debug" ? se(e) : e, n ? P(e) : e;
+}, ot = [
+  "recipe(id: string)"
+], it = [
+  "recipe(id: string, 0?: string, 1?: string, 2?: string)"
+], oe = {
+  register: R(ot),
+  apply: R(it)
+}, N = class N {
+  constructor() {
+    _(this, "recipes", /* @__PURE__ */ new Map());
+  }
+  tryRegister(t) {
+    const n = N.Entries(t);
+    for (let s = 0; s < n.length; s++) {
+      const [r, o] = n[s];
+      if (r !== "register") continue;
+      const i = oe.register(o);
+      switch (i.name) {
+        case "recipe":
+          const l = n.slice(s + 1).filter(([a]) => a !== "register").map(([a, c]) => `${a}=${c}`).join("&");
+          this.recipes.set(i.id, l);
+          break;
+        default:
+          throw new Error(`Unknown registration: ${i.name}`);
+      }
+    }
+  }
+  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}`);
+        continue;
+      }
+      const l = oe.apply(i);
+      switch (l.name) {
+        case "recipe":
+          s.push(this.recipes.get(l.id)), s.push(...Q(l).map((a) => this.recipes.get(a)));
+          break;
+        default:
+          throw new Error(`Unknown registration: ${l.name}`);
+      }
+    }
+    return s.join("&");
+  }
+};
+_(N, "Entries", (t) => Array.from(new URLSearchParams(t).entries()));
+let G = N;
+const lt = ["http", "./", "../", "?"], at = ({ url: e }) => lt.some((t) => e.startsWith(t)), ct = (e) => X(e) && Me(e) && at(e), ue = ({ url: e }, t) => `[](${t ? T(t, e) : e})`, g = {
   _open: "<!--",
   _close: "-->",
   _flag: "p↓",
   get begin() {
-    return E(m._open, m._flag, "BEGIN", m._close);
+    return O(g._open, g._flag, "BEGIN", g._close);
   },
   get end() {
-    return E(m._open, m._flag, "END", m._close);
+    return O(g._open, g._flag, "END", g._close);
   },
   lengthOf(e) {
     const t = `lines: ${e.split(`
 `).length}`, n = `chars: ${e.length}`;
-    return E(m._open, m._flag, "length", t, n, m._close);
+    return O(g._open, g._flag, "length", t, n, g._close);
   }
-}, Z = (e) => (t) => D(t) && t.value === m[e], et = ({ position: e, url: t, siblingCount: n }, s) => ({ position: e, url: t, headingDepth: s, inline: n >= 1 }), tt = ({ position: { start: e }, url: t, siblingCount: n }, { position: { end: s } }, o) => ({ position: { start: e, end: s }, url: t, headingDepth: o, inline: n >= 1 }), nt = (e, t, n) => (e.inline ? E : be)(
-  oe(e, n),
-  m.begin,
-  m.lengthOf(t),
+}, ie = (e) => (t) => X(t) && t.value === g[e], pt = ({ position: e, url: t, siblingCount: n }, s) => ({ position: e, url: t, headingDepth: s, inline: n >= 1 }), ut = ({ position: { start: e }, url: t, siblingCount: n }, { position: { end: s } }, r) => ({ position: { start: e, end: s }, url: t, headingDepth: r, inline: n >= 1 }), mt = (e, t, n) => (e.inline ? O : Oe)(
+  ue(e, n),
+  g.begin,
+  g.lengthOf(t),
   t,
-  m.end
-), st = (e) => {
-  const t = S(e, "heading").reduce((n, { position: s, depth: o }) => n.set(s.start.line, o), /* @__PURE__ */ new Map());
+  g.end
+), gt = (e) => {
+  const t = I(e, "heading").reduce((n, { position: s, depth: r }) => n.set(s.start.line, r), /* @__PURE__ */ new Map());
   return (n) => {
     for (let s = n.position.start.line; s >= 1; s--) {
-      const o = t.get(s);
-      if (o) return o;
+      const r = t.get(s);
+      if (r) return r;
     }
     return 0;
   };
-}, x = {
+}, j = {
   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`)
-}, ot = (e, t) => {
+}, ht = (e, t) => {
   const n = [], s = [
-    ...e.map((r) => ({ node: r, type: "open" })),
-    ...t.map((r) => ({ node: r, type: "close" }))
-  ].sort((r, i) => h(r.node, i.node)), o = [];
-  for (const r of s)
-    if (r.type === "open") o.push(r);
+    ...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);
     else {
-      const i = r.node;
-      if (o.length === 0)
-        throw x.closingCommentNotMatchedToOpening(i);
-      const c = o.pop().node;
-      if (o.length > 0) continue;
-      n.push({ open: c, close: i });
+      const i = o.node;
+      if (r.length === 0)
+        throw j.closingCommentNotMatchedToOpening(i);
+      const l = r.pop().node;
+      if (r.length > 0) continue;
+      n.push({ open: l, close: i });
     }
-  if (o.length > 0)
-    throw x.openingCommentNotClosed(o[0].node);
+  if (r.length > 0)
+    throw j.openingCommentNotClosed(r[0].node);
   return n;
-}, rt = (e, t, n) => {
-  const s = [...t].sort(h), o = [];
-  return [...n].sort((r, i) => h.reverse(r.open, i.open)).forEach((r) => {
+}, dt = (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 < r.open.position.start.offset) {
-        if (Ne(e, i, r.open).trim() !== "")
-          throw x.openingCommentDoesNotFollowLink(r.open);
-        return o.push([i, r]);
+      if (i.position.start.offset < o.open.position.start.offset) {
+        if (Ae(e, i, o.open).trim() !== "")
+          throw j.openingCommentDoesNotFollowLink(o.open);
+        return r.push([i, o]);
       }
-      o.push(i);
+      r.push(i);
     }
-    throw x.openingCommentDoesNotFollowLink(r.open);
-  }), o.push(...s.reverse()), o.reverse();
-}, re = (e, t) => {
-  t ?? (t = I.md(e));
-  const n = st(t), s = S(t, "link").filter(Ye), o = S(t, "html").sort(h), r = o.filter(Z("begin")), i = o.filter(Z("end")), c = ot(r, i);
-  return rt(e, s, c).map((a) => Array.isArray(a) ? tt(a[0], a[1].close, n(a[0])) : et(a, n(a)));
-}, it = (e, { url: t }) => (n) => e(y(A(t), n)), ie = (...e) => {
+    throw j.openingCommentDoesNotFollowLink(o.open);
+  }), r.push(...s.reverse()), r.reverse();
+}, me = (e, t) => {
+  t ?? (t = V.md(e));
+  const n = gt(t), s = I(t, "link").filter(ct), r = I(t, "html").sort(f), o = r.filter(ie("begin")), i = r.filter(ie("end")), l = ht(o, i);
+  return dt(e, s, l).map((c) => Array.isArray(c) ? ut(c[0], c[1].close, n(c[0])) : pt(c, n(c)));
+}, ft = (e, { url: t }) => (n) => e(T(z(t), n)), ge = (...e) => {
   const t = e.reduce((n, s) => n + s, 0);
   return Math.min(Math.max(t, 1), 6);
-}, ct = (e, t, n) => {
+}, vt = (e, t, n) => {
   if (t === 0) return e;
-  n ?? (n = I.md(e));
-  const s = S(n, "heading"), o = e.split(`
+  n ?? (n = V.md(e));
+  const s = I(n, "heading"), r = e.split(`
 `);
-  for (const r of s) {
-    const { depth: i, position: { start: c, end: l } } = r, a = ie(i, t), u = o[c.line - 1].slice(i, l.column), p = "#".repeat(a) + u;
-    o[c.line - 1] = p, r.depth = a;
+  for (const o of s) {
+    const { depth: i, position: { start: l, end: a } } = o, c = ge(i, t), u = r[l.line - 1].slice(i, a.column), p = "#".repeat(c) + u;
+    r[l.line - 1] = p, o.depth = c;
   }
-  return o.join(`
+  return r.join(`
 `);
-}, ce = (e) => re(e).reverse().sort(h.reverse).reduce((t, n) => ee(t, oe(n), n), e), le = (e, t, n, s, o) => {
+}, he = (e) => me(e).reverse().sort(f.reverse).reduce((t, n) => ce(t, ue(n), n), e), de = (e, t, n, s, r) => {
   try {
-    e = ce(e), e = ct(e, t);
-    const r = I.md(e);
-    return re(e, r).sort(h).reverse().map((i) => {
-      var q, B;
-      const { url: c, headingDepth: l } = i, [a, ...u] = ve(c).split("?"), p = a.split(".").pop() ?? "", b = u.join("?"), k = A(c), L = y(k, a);
-      if (c.startsWith("./") || c.startsWith("../")) {
-        let g = n(L);
-        const v = new $e(b), M = (q = v.get("region")) == null ? void 0 : q.split(U);
-        g = (M == null ? void 0 : M.reduce(
-          ($, C, R, { length: he }) => Je($, C, R === he - 1),
-          g
-        )) ?? g;
-        const me = v.has("skip"), ue = v.get("heading") ?? 0, ge = v.has("inline");
-        let { inline: _ } = i;
-        if (ge && (_ = !0), !me)
-          if (p === "md") {
-            const $ = it(n, i), C = o ? y(o, k) : k, R = ie(l, Number(ue));
-            g = le(
-              g,
+    e = he(e), e = vt(e, t);
+    const o = V.md(e), i = new G();
+    return me(e, o).sort(f).reverse().map((l) => {
+      var $, M, x;
+      const { url: a, headingDepth: c } = l, [u, ...p] = Se(a).split("?"), w = i.apply(p.join("?"));
+      if (a.startsWith("?")) {
+        const b = ($ = new Z(w).get("register")) == null ? void 0 : $.split(F);
+        b == null || b.forEach((A) => i.tryRegister(A));
+      } else if (a.startsWith("./") || a.startsWith("../")) {
+        const m = u.split(".").pop() ?? "", b = z(a), A = T(b, u);
+        let h = n(A);
+        const k = new Z(w), L = (M = ((y) => {
+          const v = Array.from(k.entries()).filter(([E]) => E === y).map(([E, B]) => B);
+          return v.length >= 1 ? v.join(",") : void 0;
+        })("region")) == null ? void 0 : M.split(F);
+        h = (L == null ? void 0 : L.reduce(
+          (y, v, E, { length: B }) => rt(y, v, E === B - 1),
+          h
+        )) ?? h;
+        const we = k.has("skip"), $e = k.get("heading") ?? 0, be = k.has("inline");
+        let { inline: U } = l;
+        if (be && (U = !0), !we)
+          if (m === "md") {
+            const y = ft(n, l), v = r ? T(r, b) : b, E = ge(c, Number($e));
+            h = de(
+              h,
               /** p↓: ... */
-              R,
-              $,
-              L,
-              C
+              E,
+              y,
+              A,
+              v
               /** p↓: ... */
             );
-          } else /^(js|ts)x?|svelte$/i.test(p) && (g = X(
-            g,
+          } else /^(js|ts)x?|svelte$/i.test(m) && (h = te(
+            h,
             "code",
             /** p↓: ... */
-            { extension: p, inline: _ }
+            { extension: m, inline: U }
             /** p↓: ... */
           ));
-        const O = (B = v.get("wrap")) == null ? void 0 : B.split(U);
-        return g = (O == null ? void 0 : O.reduce(($, C) => X($, C, { extension: p, inline: _ }), g)) ?? g, { target: i, content: nt(i, g, o) };
-      } else throw c.startsWith("http") ? new Error("External web links are not implemented yet") : new Error(`Unsupported link type: ${c}`);
-    }).reduce((i, { target: c, content: l }) => ee(i, l, c), e);
-  } catch (r) {
-    throw new Error(`Error populating inclusions in file ${s ?? "(unknown)"}: ${r}`);
+        const q = (x = k.get("wrap")) == null ? void 0 : x.split(F);
+        return h = (q == null ? void 0 : q.reduce((y, v) => te(y, v, { extension: m, inline: U }), h)) ?? h, { target: l, content: mt(l, h, r) };
+      } else throw a.startsWith("http") ? new Error("External web links are not implemented yet") : new Error(`Unsupported link type: ${a}`);
+    }).filter(Boolean).reduce((l, { target: a, content: c }) => ce(l, c, a), e);
+  } catch (o) {
+    throw new Error(`Error populating inclusions in file ${s ?? "(unknown)"}: ${o}`);
   }
-}, ae = (e) => we(e, "utf-8"), pe = (e) => {
-  const t = Y(e), n = A(t);
-  return { markdown: ae(t), dir: n, path: t };
-}, dt = (e, t = !0) => {
-  const { dir: n, path: s, markdown: o } = pe(e), i = le(o, 0, (c) => ae(Y(n, Me(c))), s);
-  return t && K(s, i), i;
-}, wt = (e, t = !0) => {
-  const { path: n, markdown: s } = pe(e), o = ce(s);
-  return t && K(n, o), o;
+}, fe = (e) => Ee(e, "utf-8"), ve = (e) => {
+  const t = ae(e), n = z(t);
+  return { content: fe(t), dir: n, path: t };
+}, wt = (e, t = !0, n) => {
+  const { dir: s, path: r, content: o } = ve(e);
+  n == null || n.unwatch(r), n == null || n.once("change", (a, c) => {
+    console.log(`Change detected in "${a}". Regenerating "${r}"...`), wt(e, t, n);
+  });
+  const l = de(o, 0, (a) => {
+    const c = ae(s, Ie(a));
+    return n == null || n.add(c), fe(c);
+  }, r);
+  return t && le(r, l), n == null || n.add(r), l;
+}, Nt = (e, t = !0, n) => {
+  const { path: s, content: r } = ve(e), o = he(r);
+  return t && le(s, o), o;
 };
 export {
-  wt as depopulateMarkdownInclusions,
-  dt as populateMarkdownInclusions
+  Nt as depopulateMarkdownInclusions,
+  wt as populateMarkdownInclusions
 };