@p-buddy/parkdown 0.0.4 → 0.0.6

package/dist/index.js

@@ -1,163 +1,198 @@
-import { writeFileSync as q, readFileSync as te } from "node:fs";
-import { basename as ne, dirname as _, join as C, resolve as U } from "node:path";
-import { URLSearchParams as oe } from "node:url";
-import { unified as se } from "unified";
-import re from "remark-parse";
-import { visit as ie } from "unist-util-visit";
-import ce from "stable-hash";
-import { dedent as k } from "ts-dedent";
-import le from "extract-comments";
-const g = (e, n) => e.position.start.offset - n.position.start.offset;
-g.reverse = (e, n) => g(n, e);
-const T = (e) => e.position !== void 0 && e.position.start.offset !== void 0 && e.position.end.offset !== void 0, ae = se().use(re), I = {
-  md: (e) => ae.parse(e)
-}, y = (e, n) => {
-  const t = [];
-  return ie(e, (s, o, r) => {
-    if (s.type !== "root") {
-      if (n && s.type !== n) return;
-      if (T(s)) {
-        const i = ce(r), c = ((r == null ? void 0 : r.children.length) ?? 0) - 1;
-        t.push({ ...s, parentID: i, siblingIndex: o, siblingCount: c });
+var ue = Object.defineProperty;
+var me = (e, t, n) => t in e ? ue(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
+var q = (e, t, n) => me(e, typeof t != "symbol" ? t + "" : t, n);
+import { writeFileSync as J, readFileSync as he } from "node:fs";
+import { basename as fe, dirname as O, join as x, resolve as V } from "node:path";
+import { URLSearchParams as ge } from "node:url";
+import { unified as de } from "unified";
+import ve from "remark-parse";
+import { visit as we } from "unist-util-visit";
+import $e from "stable-hash";
+import { dedent as D } from "ts-dedent";
+import Ce from "extract-comments";
+const f = (e, t) => e.position.start.offset - t.position.start.offset;
+f.reverse = (e, t) => f(t, e);
+const I = (e) => e.position !== void 0 && e.position.start.offset !== void 0 && e.position.end.offset !== void 0, ye = de().use(ve), j = {
+  md: (e) => ye.parse(e)
+}, S = (e, t) => {
+  const n = [];
+  return we(e, (o, s, r) => {
+    if (o.type !== "root") {
+      if (t && o.type !== t) return;
+      if (I(o)) {
+        const i = $e(r), c = ((r == null ? void 0 : r.children.length) ?? 0) - 1;
+        n.push({ ...o, parentID: i, siblingIndex: s, siblingCount: c });
       }
     }
-  }), t;
-}, pe = (e) => e.children.length === 0, G = (e, n, ...t) => {
-  if (t.length === 0) throw new Error("No nodes to replace content from");
-  t.sort(g);
-  const s = t.at(0), o = t.at(-1);
-  return e.slice(0, s.position.start.offset) + n + e.slice(o.position.end.offset);
-}, me = (e, n, t) => {
-  const s = Math.min(n.position.end.offset, t.position.end.offset), o = Math.max(n.position.start.offset, t.position.start.offset);
-  return e.slice(s, o);
-}, L = (...e) => e.join(" "), ue = (...e) => e.join(`
-`), he = (e) => {
-  const n = e.split("?");
-  return n.length > 1 ? [n.slice(0, -1).join("?"), n.at(-1)] : [e, ""];
-}, ge = (e) => he(e)[0];
+  }), n;
+}, Ee = (e) => e.children.length === 0, Z = (e, t, ...n) => {
+  if (n.length === 0) throw new Error("No nodes to replace content from");
+  n.sort(f);
+  const o = n.at(0), s = n.at(-1);
+  return e.slice(0, o.position.start.offset) + t + e.slice(s.position.end.offset);
+}, xe = (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);
+}, E = (...e) => e.join(" "), Se = (...e) => e.join(`
+`), be = (e) => {
+  const t = e.split("?");
+  return t.length > 1 ? [t.slice(0, -1).join("?"), t.at(-1)] : [e, ""];
+}, ke = (e) => be(e)[0];
 class d {
   constructor() {
-    this.intervals = [];
+    q(this, "intervals", []);
   }
-  push(n, t) {
-    this.intervals.push([Math.min(n, t), Math.max(n, t)]);
+  push(t, n) {
+    this.intervals.push([Math.min(t, n), Math.max(t, n)]);
   }
-  combine(n) {
-    this.intervals.push(...n.intervals);
+  combine(t) {
+    this.intervals.push(...t.intervals);
   }
   collapse() {
-    const { intervals: n } = this;
-    if (!n.length) return this.intervals = [];
-    n.sort((r, i) => r[0] - i[0]);
-    const t = [];
-    let [s, o] = n[0];
-    for (let r = 1; r < n.length; r++) {
-      const [i, c] = n[r];
-      i <= o ? o = Math.max(o, c) : (t.push([s, o]), s = i, o = c);
+    const { intervals: t } = this;
+    if (!t.length) return this.intervals = [];
+    t.sort((r, i) => r[0] - i[0]);
+    const n = [];
+    let [o, s] = t[0];
+    for (let r = 1; r < t.length; r++) {
+      const [i, c] = t[r];
+      i <= s ? s = Math.max(s, c) : (n.push([o, s]), o = i, s = c);
     }
-    return t.push([s, o]), this.intervals = t;
+    return n.push([o, s]), this.intervals = n;
   }
-  subtract(n) {
-    const { intervals: t } = this, { intervals: s } = n;
-    if (!t.length || !s.length) return t;
-    let o = [...t];
-    for (const [r, i] of s) {
+  subtract(t) {
+    const { intervals: n } = this, { intervals: o } = t;
+    if (!n.length || !o.length) return n;
+    let s = [...n];
+    for (const [r, i] of o) {
       const c = [];
-      for (const [l, a] of o) {
+      for (const [l, a] of s) {
         if (i <= l || r >= a) {
           c.push([l, a]);
           continue;
         }
         r > l && c.push([l, r]), i < a && c.push([i, a]);
       }
-      o = c;
+      s = c;
     }
-    return this.intervals = o;
+    return this.intervals = s;
   }
 }
-const P = /,\s*(?![^()]*\))/, fe = [
-  [/'''/g, '"'],
-  [/''/g, "'"],
-  [/parkdown:\s+/g, ""],
-  [/p▼:\s+/g, ""]
-], de = (e, n = "-") => {
-  const t = fe.reduce((s, [o, r]) => s.replaceAll(o, r), e);
-  return n ? t.replaceAll(n, " ") : t;
-}, we = ["string", "number", "boolean"], ve = (e) => we.includes(e), $e = /^([a-zA-Z0-9_-]+)(?:\(([^)]*)\))?$/, Ce = (e) => {
-  const n = e.match($e);
-  if (!n) throw new Error(`Invalid invocation: ${e}`);
-  const [, t, s = ""] = n;
-  if (!s.trim()) return { name: t, parameters: [] };
-  const o = Ee(s);
-  return { name: t, parameters: o };
-}, ye = (e, n) => {
-  for (let t = n + 1; t < e.length; t++)
-    if (e[t] !== void 0) return !1;
+const W = /,\s*(?![^()]*\))/, B = {
+  reserved: {
+    semi: ";",
+    slash: "/",
+    question: "?",
+    colon: ":",
+    at: "@",
+    equal: "=",
+    and: "&"
+  },
+  unsafe: {
+    quote: '"',
+    angle: "<",
+    unangle: ">",
+    hash: "#",
+    percent: "%",
+    curly: "{",
+    uncurly: "}",
+    pipe: "|",
+    back: "\\",
+    carrot: "^",
+    tilde: "~",
+    square: "[",
+    unsquare: "]",
+    tick: "`"
+  }
+}, Ne = "-", F = {
+  static: [
+    ["'''", '"'],
+    ["''", "'"],
+    [/parkdown:\s+/g, ""],
+    [/p↓:\s+/g, ""]
+  ],
+  url: [
+    ...Object.entries(B.unsafe),
+    ...Object.entries(B.reserved)
+  ]
+}, U = (e, [t, n]) => e.replaceAll(t, n), K = (e, t = Ne) => {
+  const n = F.static.reduce(U, e);
+  return F.url.map(([o, s]) => [t + o + t, s]).reduce(U, n).replaceAll(t, " ");
+}, Me = ["string", "number", "boolean"], _e = (e) => Me.includes(e), Te = /^([a-zA-Z0-9_-]+)(?:\(([^)]*)\))?$/, Oe = (e) => {
+  const t = e.match(Te);
+  if (!t) throw new Error(`Invalid invocation: ${e}`);
+  const [, n, o = ""] = t;
+  if (!o.trim()) return { name: n, parameters: [] };
+  const s = Ie(o);
+  return { name: n, parameters: s };
+}, De = (e, t) => {
+  for (let n = t + 1; n < e.length; n++)
+    if (e[n] !== void 0) return !1;
   return !0;
-}, Ee = (e) => {
-  const n = [];
-  let t = "", 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, t += c ? "'''" : "''", o += c ? 2 : 1;
-    } else i ? (s = !s, t += r) : r === "," && !s ? (n.push(t.trim()), t = "") : t += r;
+}, Ie = (e) => {
+  const t = [];
+  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 c = e.at(s + 2) === "'";
+      o = !o, n += c ? "'''" : "''", s += c ? 2 : 1;
+    } else i ? (o = !o, n += r) : r === "," && !o ? (t.push(n.trim()), n = "") : n += r;
   }
-  return n.push(t.trim()), n.map((o) => o === "" ? void 0 : o ? Se(o) : void 0).filter((o, r, i) => o !== void 0 || !ye(i, r));
-}, Se = (e) => {
-  const n = e.length >= 2 && e[0] === "'" && e.at(-1) === "'", t = n && e.length >= 4 && e[1] === "'" && e.at(-2) === "'";
-  return !n || t ? e : e.slice(1, -1);
-}, Ne = (e) => {
-  const n = /^(\w+)(?:\(([^)]*)\))?/, t = e.match(n);
-  if (!t) return { name: e };
-  const [, s, o] = t;
-  if (!o) return { name: s };
+  return t.push(n.trim()), t.map((s) => s === "" ? void 0 : s ? je(s) : void 0).filter((s, r, i) => s !== void 0 || !De(i, r));
+}, je = (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);
+}, Le = (e) => {
+  const t = /^(\w+)(?:\(([^)]*)\))?/, n = e.match(t);
+  if (!n) return { name: e };
+  const [, o, s] = n;
+  if (!s) return { name: o };
   const r = /(\w+)(\?)?:\s*([^,]+)/g, i = [];
   let c;
-  for (; (c = r.exec(o)) !== null; ) {
-    const [, l, a, p] = c, m = p.trim();
-    if (!ve(m)) throw new Error(`Unsupported type: ${m}`);
-    i.push({ name: l, optional: a === "?", type: m });
+  for (; (c = r.exec(s)) !== null; ) {
+    const [, l, a, p] = c, u = p.trim();
+    if (!_e(u)) throw new Error(`Unsupported type: ${u}`);
+    i.push({ name: l, optional: a === "?", type: u });
   }
-  return { name: s, parameters: i };
-}, H = (e) => {
-  const n = e.map(Ne).reduce(
-    (t, { name: s, parameters: o }) => t.set(s, o),
+  return { name: o, parameters: i };
+}, Y = (e) => {
+  const t = e.map(Le).reduce(
+    (n, { name: o, parameters: s }) => n.set(o, s),
     /* @__PURE__ */ new Map()
   );
-  return (t) => {
-    const { name: s, parameters: o } = Ce(t);
-    if (!n.has(s))
-      throw new Error(`Unknown method: ${s}`);
-    const r = n.get(s);
+  return (n) => {
+    const { name: o, parameters: s } = Oe(n);
+    if (!t.has(o))
+      throw new Error(`Unknown method: ${o}`);
+    const r = t.get(o);
     if (r === void 0)
-      return { name: s };
-    if (o.length > r.length) {
+      return { name: o };
+    if (s.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})`);
+      throw new Error(`Too many parameters: ${s.length} for method '${o}' (expected: ${c})`);
     }
     return r.reduce((i, { name: c, optional: l, type: a }, p) => {
-      const m = o[p];
-      if (m === void 0) {
+      const u = s[p];
+      if (u === void 0) {
         if (l) return i;
-        throw new Error(`Missing required parameter: ${c} for method '${s}'`);
+        throw new Error(`Missing required parameter: ${c} for method '${o}'`);
       }
       switch (a) {
         case "string":
-          i[c] = m;
+          i[c] = u;
           break;
         case "number":
         case "boolean":
-          i[c] = JSON.parse(m);
+          i[c] = JSON.parse(u);
           break;
       }
       if (typeof i[c] !== a)
-        throw new Error(`Invalid type: ${c} must be ${a}, got ${typeof i[c]} for method '${s}'`);
+        throw new Error(`Invalid type: ${c} must be ${a}, got ${typeof i[c]} for method '${o}'`);
       return i;
-    }, { name: s });
+    }, { name: o });
   };
-}, R = (e) => Object.entries(e).filter(([n]) => n !== "name" && !isNaN(Number(n))).map(([n, t]) => t), xe = [
+}, G = (e) => Object.entries(e).filter(([t]) => t !== "name" && !isNaN(Number(t))).map(([t, n]) => n), Ae = [
   /**
    * Wraps the content in a markdown-formatted code block.
    * @param lang The language of the code block (defaults to the file extension).
@@ -187,210 +222,264 @@ const P = /,\s*(?![^()]*\))/, fe = [
    * @example [](<url>?wrap=dropdown(hello_world,,_)) 
    */
   "dropdown(summary: string, open?: boolean, space?: string)"
-], Me = "-", be = H(xe), W = (e, n, t) => {
-  const s = be(n), o = (t == null ? void 0 : t.inline) && !e.includes(`
-
-`);
-  switch (s.name) {
+], Pe = Y(Ae), g = (e, t = 1) => `
+`.repeat(t) + e + `
+`.repeat(t), T = (e, t, n) => `<${t}${n ? ` ${n}` : ""}>${g(e)}</${t}>`, H = (e, t, n) => {
+  const o = Pe(t);
+  switch (o.name) {
     case "code":
-      const r = s.lang ?? (t == null ? void 0 : t.extension) ?? "", i = s.meta ? ` ${s.meta}` : "";
-      return `\`\`\`${r}${i}
-${e}
-\`\`\``;
+      if (!o.lang && !o.meta && (n == null ? void 0 : n.inline) && !e.includes(`
+`)) return `\`${e}\``;
+      const r = o.lang ?? (n == null ? void 0 : n.extension) ?? "", i = o.meta ? ` ${o.meta}` : "";
+      return g(`\`\`\`${r}${i}${g(e)}\`\`\``);
     case "quote":
-      return o ? `> ${e}` : `<blockquote>
+      return n != null && n.inline && !e.includes(`
 
-${e}
-
-</blockquote>
-`;
+`) ? `> ${e}` : g(T(g(e), "blockquote"));
     case "dropdown":
-      const c = `<details${s.open ? " open" : ""}>`, l = `<summary>${s.summary.split(s.space ?? Me).join(" ")}</summary>`;
-      return ["", c, l, "", e, "</details>", ""].join(`
-`);
+      const c = T(K(o.summary), "summary");
+      return g(T([c, e].join(`
+`), "details", o.open ? "open" : void 0));
   }
-}, _e = [
+}, Re = [
+  /**
+   * Extract regions from the retrieved content between comments that INCLUDE the specified ids.
+   * @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.
+   * @example [](<url>?region=extract(specifier))
+   * @example [](<url>?region=extract(specifier,other-specifier,some-other-specifier))
+   */
   "extract(id: string, 0?: string, 1?: string, 2?: string)",
+  /**
+   * Remove regions from the retrieved content between comments that INCLUDE the specified ids.
+   * @param id The id of the comment to remove.
+   * @param 0 An optional additional id to remove.
+   * @param 1 An optional additional id to remove.
+   * @param 2 An optional additional id to remove.
+   * @example [](<url>?region=remove(specifier))
+   * @example [](<url>?region=remove(specifier,other-specifier,some-other-specifier))
+   */
   "remove(id: string, 0?: string, 1?: string, 2?: string)",
+  /**
+   * Replace regions from the retrieved content between comments that INCLUDE the specified ids.
+   * @param id The id of the comment to replace.
+   * @param with The replacement content (if ommitted, the content of the detected comment will be used).
+   * @param space The space character to use between words in the replacement content (defaults to `-`).
+   * @example [](<url>?region=replace(specifier))
+   * @example [](<url>?region=replace(specifier,new-content))
+   * @example [](<url>?region=replace(specifier,new_content,_)
+   */
   "replace(id: string, with?: string, space?: string)"
-], ke = H(_e), D = (e) => le(e), B = (e, n) => D(e).filter(({ value: t }) => t.includes(n)).sort((t, s) => t.range[0] - s.range[0]), Te = (e, ...n) => {
-  if (n.length === 0) return e;
-  const t = ([i, c]) => e.slice(i, c), s = D(e), o = new d(), r = new d();
-  for (const i of n) {
-    const c = s.filter(({ value: l }) => l.includes(i)).sort((l, a) => l.range[0] - a.range[0]);
+], qe = Y(Re), L = (e) => Ce(e), b = (e, t) => L(e).filter(({ value: n }) => n.includes(t)).sort((n, o) => n.range[0] - o.range[0]), We = (e, ...t) => {
+  if (t.length === 0) return e;
+  const n = ([i, c]) => e.slice(i, c), o = L(e), s = new d(), r = new d();
+  for (const i of t) {
+    const c = o.filter(({ value: l }) => l.includes(i)).sort((l, a) => l.range[0] - a.range[0]);
     for (let l = 0; l < c.length - 1; l += 2) {
       const a = c[l], p = c[l + 1];
-      o.push(a.range[1], p.range[0]);
-      const [m, ...f] = t([a.range[1], p.range[0]]), S = f[f.length - 1];
-      r.push(a.range[0], a.range[1] + (m.trim() ? 0 : 1)), r.push(p.range[0], p.range[1] + (S.trim() ? 0 : 1));
+      s.push(a.range[1], p.range[0]);
+      const [u, ...y] = n([a.range[1], p.range[0]]), v = y[y.length - 1];
+      r.push(a.range[0], a.range[1] + (u.trim() ? 0 : 1)), r.push(p.range[0], p.range[1] + (v.trim() ? 0 : 1));
     }
   }
-  return o.collapse(), r.collapse(), k(
-    o.subtract(r).map(t).filter(Boolean).join("")
+  return s.collapse(), r.collapse(), D(
+    s.subtract(r).map(n).filter(Boolean).join("")
   ).trim();
-}, Ie = (e, ...n) => {
-  if (n.length === 0) return e;
-  const t = ([i, c]) => e.slice(i, c), s = D(e), o = new d();
-  for (const i of n) {
-    const c = s.filter(({ value: l }) => l.includes(i)).sort((l, a) => l.range[0] - a.range[0]);
+}, Be = (e, ...t) => {
+  if (t.length === 0) return e;
+  const n = ([i, c]) => e.slice(i, c), o = L(e), s = new d();
+  for (const i of t) {
+    const c = o.filter(({ value: l }) => l.includes(i)).sort((l, a) => l.range[0] - a.range[0]);
     for (let l = 0; l < c.length - 1; l += 2) {
-      const a = c[l], p = c[l + 1], m = t([p.range[1], p.range[1] + 1]).at(-1);
-      o.push(a.range[0], m === `
+      const a = c[l], p = c[l + 1], u = n([p.range[1], p.range[1] + 1]).at(-1);
+      s.push(a.range[0], u === `
 ` ? p.range[1] + 1 : p.range[1]);
     }
   }
-  o.collapse();
+  s.collapse();
   const r = new d();
-  return r.push(0, e.length), r.subtract(o), k(
-    r.collapse().map(t).filter(Boolean).join("")
+  return r.push(0, e.length), r.subtract(s), D(
+    r.collapse().map(n).filter(Boolean).join("")
   ).trim();
-}, De = (e, n, t, s) => {
-  if (!n) return e;
-  const o = B(e, n);
-  if (o.length < 2) return e;
+}, Fe = (e, t, n, o) => {
+  if (!t) return e;
+  const s = b(e, t);
+  if (s.length < 2) return e;
   let r = "", i = 0;
-  for (let l = 0; l < o.length - 1; l += 2) {
-    const a = o[l], p = o[l + 1];
-    r += e.slice(i, a.range[1]), r += de(t ?? a.value, s), i = p.range[0];
+  for (let l = 0; l < s.length - 1; l += 2) {
+    const a = s[l], p = s[l + 1];
+    r += e.slice(i, a.range[1]), r += K(n ?? a.value, o), i = p.range[0];
   }
   r += e.slice(i);
   const c = new d();
   return c.push(0, r.length), c.subtract(
-    B(r, n).reduce((l, { range: a }) => (l.push(...a), l), new d())
-  ), k(
+    b(r, t).reduce((l, { range: a }) => (l.push(...a), l), new d())
+  ), D(
     c.collapse().map(([l, a]) => r.slice(l, a)).filter(Boolean).join("")
   ).trim();
-}, je = (e, n) => {
-  const t = ke(n);
-  switch (t.name) {
+}, Q = (e) => ({ space: e === " ", newline: e === `
+` }), z = (e) => [
+  ...b(e, "p↓:"),
+  ...b(e, "parkdown:")
+].sort((t, n) => t.range[0] - n.range[0]).reverse().reduce((t, { range: [n, o], loc: { start: { column: s } } }) => {
+  const r = (l, a) => t.slice(0, l) + t.slice(a), i = {
+    prev: Q(t[n - 1]),
+    next: Q(t[o]),
+    startLine: s === 0,
+    final: o === t.length
+  };
+  return i.startLine && (i.next.newline || i.final) ? r(n - (i.final ? 1 : 0), o + 1) : i.startLine ? r(n, o + (i.next.space ? 1 : 0)) : r(n - (i.prev.space ? 1 : 0), o);
+}, e), Ue = (e, t) => {
+  if (!t) return z(e);
+  const n = qe(t);
+  switch (n.name) {
     case "extract":
-      return Te(e, t.id, ...R(t));
+      e = We(e, n.id, ...G(n));
+      break;
     case "remove":
-      return Ie(e, t.id, ...R(t));
+      e = Be(e, n.id, ...G(n));
+      break;
     case "replace":
-      return De(e, t.id, t.with, t.space);
+      e = Fe(e, n.id, n.with, n.space);
+      break;
   }
-}, Oe = ["http", "./", "../"], Ae = ({ url: e }) => Oe.some((n) => e.startsWith(n)), Le = (e) => T(e) && pe(e) && Ae(e), b = ({ url: e }, n) => `[](${n ? C(n, e) : e})`, h = {
+  return z(e);
+}, Ge = ["http", "./", "../"], He = ({ url: e }) => Ge.some((t) => e.startsWith(t)), Qe = (e) => I(e) && Ee(e) && He(e), ee = ({ url: e }, t) => `[](${t ? x(t, e) : e})`, m = {
   _open: "<!--",
   _close: "-->",
-  _flag: "p▼",
+  _flag: "p↓",
   get begin() {
-    return L(h._open, h._flag, "BEGIN", h._close);
+    return E(m._open, m._flag, "BEGIN", m._close);
   },
   get end() {
-    return L(h._open, h._flag, "END", h._close);
+    return E(m._open, m._flag, "END", m._close);
+  },
+  lengthOf(e) {
+    const t = `lines: ${e.split(`
+`).length}`, n = `chars: ${e.length}`;
+    return E(m._open, m._flag, "length", t, n, m._close);
   }
-}, F = (e) => (n) => T(n) && n.value === h[e], Pe = ({ position: e, url: n, siblingCount: t }, s) => ({ position: e, url: n, headingDepth: s, inline: t >= 1 }), Re = ({ position: { start: e }, url: n, siblingCount: t }, { position: { end: s } }, o) => ({ position: { start: e, end: s }, url: n, headingDepth: o, inline: t >= 1 }), We = (e, n, t) => e.inline ? `${b(e, t)} ${h.begin} ${n} ${h.end}` : ue(b(e, t), h.begin, n, h.end), Be = (e) => {
-  const n = y(e, "heading").reduce((t, { position: s, depth: o }) => t.set(s.start.line, o), /* @__PURE__ */ new Map());
-  return (t) => {
-    for (let s = t.position.start.line; s >= 1; s--) {
-      const o = n.get(s);
-      if (o) return o;
+}, X = (e) => (t) => I(t) && t.value === m[e], ze = ({ position: e, url: t, siblingCount: n }, o) => ({ position: e, url: t, headingDepth: o, inline: n >= 1 }), Xe = ({ position: { start: e }, url: t, siblingCount: n }, { position: { end: o } }, s) => ({ position: { start: e, end: o }, url: t, headingDepth: s, inline: n >= 1 }), Je = (e, t, n) => (e.inline ? E : Se)(
+  ee(e, n),
+  m.begin,
+  m.lengthOf(t),
+  t,
+  m.end
+), Ve = (e) => {
+  const t = S(e, "heading").reduce((n, { position: o, depth: s }) => n.set(o.start.line, s), /* @__PURE__ */ new Map());
+  return (n) => {
+    for (let o = n.position.start.line; o >= 1; o--) {
+      const s = t.get(o);
+      if (s) return s;
     }
     return 0;
   };
-}, E = {
+}, k = {
   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`)
-}, Fe = (e, n) => {
-  const t = [], s = [
+}, Ze = (e, t) => {
+  const n = [], o = [
     ...e.map((r) => ({ node: r, type: "open" })),
-    ...n.map((r) => ({ node: r, type: "close" }))
-  ].sort((r, i) => g(r.node, i.node)), o = [];
-  for (const r of s)
-    if (r.type === "open") o.push(r);
+    ...t.map((r) => ({ node: r, type: "close" }))
+  ].sort((r, i) => f(r.node, i.node)), s = [];
+  for (const r of o)
+    if (r.type === "open") s.push(r);
     else {
       const i = r.node;
-      if (o.length === 0)
-        throw E.closingCommentNotMatchedToOpening(i);
-      const c = o.pop().node;
-      if (o.length > 0) continue;
-      t.push({ open: c, close: i });
+      if (s.length === 0)
+        throw k.closingCommentNotMatchedToOpening(i);
+      const c = s.pop().node;
+      if (s.length > 0) continue;
+      n.push({ open: c, close: i });
     }
-  if (o.length > 0)
-    throw E.openingCommentNotClosed(o[0].node);
-  return t;
-}, qe = (e, n, t) => {
-  const s = [...n].sort(g), o = [];
-  return [...t].sort((r, i) => g.reverse(r.open, i.open)).forEach((r) => {
-    for (; s.length > 0; ) {
-      const i = s.pop();
+  if (s.length > 0)
+    throw k.openingCommentNotClosed(s[0].node);
+  return n;
+}, Ke = (e, t, n) => {
+  const o = [...t].sort(f), s = [];
+  return [...n].sort((r, i) => f.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 (me(e, i, r.open).trim() !== "")
-          throw E.openingCommentDoesNotFollowLink(r.open);
-        return o.push([i, r]);
+        if (xe(e, i, r.open).trim() !== "")
+          throw k.openingCommentDoesNotFollowLink(r.open);
+        return s.push([i, r]);
       }
-      o.push(i);
+      s.push(i);
     }
-    throw E.openingCommentDoesNotFollowLink(r.open);
-  }), o.push(...s.reverse()), o.reverse();
-}, Q = (e, n) => {
-  n ?? (n = I.md(e));
-  const t = Be(n), s = y(n, "link").filter(Le), o = y(n, "html").sort(g), r = o.filter(F("begin")), i = o.filter(F("end")), c = Fe(r, i);
-  return qe(e, s, c).map((a) => Array.isArray(a) ? Re(a[0], a[1].close, t(a[0])) : Pe(a, t(a)));
-}, Ue = (e, { url: n }) => (t) => e(C(_(n), t)), z = (...e) => {
-  const n = e.reduce((t, s) => t + s, 0);
-  return Math.min(Math.max(n, 1), 6);
-}, Ge = (e, n, t) => {
-  if (n === 0) return e;
-  t ?? (t = I.md(e));
-  const s = y(t, "heading"), o = e.split(`
+    throw k.openingCommentDoesNotFollowLink(r.open);
+  }), s.push(...o.reverse()), s.reverse();
+}, te = (e, t) => {
+  t ?? (t = j.md(e));
+  const n = Ve(t), o = S(t, "link").filter(Qe), s = S(t, "html").sort(f), r = s.filter(X("begin")), i = s.filter(X("end")), c = Ze(r, i);
+  return Ke(e, o, c).map((a) => Array.isArray(a) ? Xe(a[0], a[1].close, n(a[0])) : ze(a, n(a)));
+}, Ye = (e, { url: t }) => (n) => e(x(O(t), n)), ne = (...e) => {
+  const t = e.reduce((n, o) => n + o, 0);
+  return Math.min(Math.max(t, 1), 6);
+}, et = (e, t, n) => {
+  if (t === 0) return e;
+  n ?? (n = j.md(e));
+  const o = S(n, "heading"), s = e.split(`
 `);
-  for (const r of s) {
-    const { depth: i, position: { start: c, end: l } } = r, a = z(i, n), p = o[c.line - 1].slice(i, l.column), m = "#".repeat(a) + p;
-    o[c.line - 1] = m, r.depth = a;
+  for (const r of o) {
+    const { depth: i, position: { start: c, end: l } } = r, a = ne(i, t), p = s[c.line - 1].slice(i, l.column), u = "#".repeat(a) + p;
+    s[c.line - 1] = u, r.depth = a;
   }
-  return o.join(`
+  return s.join(`
 `);
-}, X = (e) => Q(e).reverse().sort(g.reverse).reduce((n, t) => G(n, b(t), t), e), J = (e, n, t, s) => {
-  e = X(e), e = Ge(e, n);
-  const o = I.md(e);
-  return Q(e, o).sort(g).reverse().map((r) => {
-    var O, A;
-    const { url: i, headingDepth: c } = r, [l, ...a] = ne(i).split("?"), p = l.split(".").pop() ?? "", m = a.join("?"), f = _(i), S = C(f, l);
-    if (i.startsWith("./") || i.startsWith("../")) {
-      let u = t(S);
-      const w = new oe(m), N = (O = w.get("region")) == null ? void 0 : O.split(P);
-      u = (N == null ? void 0 : N.reduce((v, $) => je(v, $), u)) ?? u;
-      const Z = w.has("skip"), K = w.get("heading") ?? 0, Y = w.has("inline");
-      let { inline: x } = r;
-      if (Y && (x = !0), !Z)
-        if (p === "md") {
-          const v = Ue(t, r), $ = s ? C(s, f) : f, ee = z(c, Number(K));
-          u = J(
-            u,
-            /** p▼: ... */
-            ee,
-            v,
-            $
-            /** p▼: ... */
-          );
-        } else /^(js|ts)x?|svelte$/i.test(p) && (u = W(
-          u,
-          "code",
-          /** p▼: ... */
-          { extension: p, inline: x }
-          /** p▼: ... */
-        ));
-      const M = (A = w.get("wrap")) == null ? void 0 : A.split(P);
-      return u = (M == null ? void 0 : M.reduce((v, $) => W(v, $, { extension: p, inline: x }), u)) ?? u, { target: r, content: We(r, u, s) };
-    } else throw i.startsWith("http") ? new Error("External web links are not implemented yet") : new Error(`Unsupported link type: ${i}`);
-  }).reduce((r, { target: i, content: c }) => G(r, c, i), e);
-}, V = (e) => te(e, "utf-8"), j = (e) => {
-  const n = U(e), t = _(n);
-  return { markdown: V(n), dir: t, path: n };
-}, et = (e, n = !0) => {
-  const { dir: t, path: s, markdown: o } = j(e), i = J(o, 0, (c) => V(U(t, ge(c))));
-  return n && q(s, i), i;
-}, tt = (e, n = !0) => {
-  const { path: t, markdown: s } = j(e), o = X(s);
-  return n && q(t, o), o;
-}, nt = (e, n = !0) => {
-  j(e);
+}, oe = (e) => te(e).reverse().sort(f.reverse).reduce((t, n) => Z(t, ee(n), n), e), se = (e, t, n, o, s) => {
+  try {
+    e = oe(e), e = et(e, t);
+    const r = j.md(e);
+    return te(e, r).sort(f).reverse().map((i) => {
+      var P, R;
+      const { url: c, headingDepth: l } = i, [a, ...p] = fe(c).split("?"), u = a.split(".").pop() ?? "", y = p.join("?"), v = O(c), A = x(v, a);
+      if (c.startsWith("./") || c.startsWith("../")) {
+        let h = n(A);
+        const w = new ge(y), N = (P = w.get("region")) == null ? void 0 : P.split(W);
+        h = (N == null ? void 0 : N.reduce(($, C) => Ue($, C), h)) ?? h;
+        const ce = w.has("skip"), le = w.get("heading") ?? 0, ae = w.has("inline");
+        let { inline: M } = i;
+        if (ae && (M = !0), !ce)
+          if (u === "md") {
+            const $ = Ye(n, i), C = s ? x(s, v) : v, pe = ne(l, Number(le));
+            h = se(
+              h,
+              /** p↓: ... */
+              pe,
+              $,
+              A,
+              C
+              /** p↓: ... */
+            );
+          } else /^(js|ts)x?|svelte$/i.test(u) && (h = H(
+            h,
+            "code",
+            /** p↓: ... */
+            { extension: u, inline: M }
+            /** p↓: ... */
+          ));
+        const _ = (R = w.get("wrap")) == null ? void 0 : R.split(W);
+        return h = (_ == null ? void 0 : _.reduce(($, C) => H($, C, { extension: u, inline: M }), h)) ?? h, { target: i, content: Je(i, h, s) };
+      } 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 }) => Z(i, l, c), e);
+  } catch (r) {
+    throw new Error(`Error populating inclusions in file ${o}: ${r}`);
+  }
+}, re = (e) => he(e, "utf-8"), ie = (e) => {
+  const t = V(e), n = O(t);
+  return { markdown: re(t), dir: n, path: t };
+}, ut = (e, t = !0) => {
+  const { dir: n, path: o, markdown: s } = ie(e), i = se(s, 0, (c) => re(V(n, ke(c))), o);
+  return t && J(o, i), i;
+}, mt = (e, t = !0) => {
+  const { path: n, markdown: o } = ie(e), s = oe(o);
+  return t && J(n, s), s;
 };
 export {
-  tt as depopulateMarkdownInclusions,
-  et as populateMarkdownInclusions,
-  nt as remapImportSpecifiers
+  mt as depopulateMarkdownInclusions,
+  ut as populateMarkdownInclusions
 };