@prose-reader/cfi 1.209.0 → 1.210.0

package/dist/index.js

@@ -1,46 +1,46 @@
-function G(e) {
+function Z(e) {
   const t = [e];
   let n = e;
   for (; n.parentNode; )
     t.push(n.parentNode), n = n.parentNode;
   return t;
 }
-function J(e, t) {
+function ee(e, t) {
   if (e === t) return e;
-  const n = G(e), r = new Set(n);
-  let s = t;
-  for (; s; ) {
-    if (r.has(s))
-      return s;
-    s = s.parentNode;
+  const n = Z(e), i = new Set(n);
+  let r = t;
+  for (; r; ) {
+    if (i.has(r))
+      return r;
+    r = r.parentNode;
   }
   return null;
 }
-const K = /[\[\]\^,();]/g;
-function N(e) {
-  return e.replace(K, "^$&");
+const ne = /[\[\]\^,();]/g;
+function g(e) {
+  return e.replace(ne, "^$&");
 }
-const Q = /^epubcfi\((.*)\)$/, R = (e) => e.nodeType === Node.ELEMENT_NODE, M = (e) => typeof e == "object" && e !== null && "nodeType" in e && (e.nodeType === Node.ELEMENT_NODE || e.nodeType === Node.TEXT_NODE), _ = (e) => e.nodeType === Node.TEXT_NODE;
-function V(e) {
-  const t = e.match(Q);
+const te = /^epubcfi\((.*)\)$/, b = (e) => e.nodeType === Node.ELEMENT_NODE, I = (e) => typeof e == "object" && e !== null && "nodeType" in e && (e.nodeType === Node.ELEMENT_NODE || e.nodeType === Node.TEXT_NODE), re = (e) => e.nodeType === Node.TEXT_NODE;
+function ie(e) {
+  const t = e.match(te);
   return t && t[1] || e;
 }
-function Z(e) {
+function se(e) {
   const t = [];
-  let n = null, r = !1, s = "";
+  let n = null, i = !1, r = "";
   const o = (c) => {
-    t.push(c), n = null, s = "";
+    t.push(c), n = null, r = "";
   }, l = (c) => {
-    s += c, r = !1;
-  }, a = V(e).trim(), h = Array.from(a).concat("");
-  for (let c = 0; c < h.length; c++) {
-    const f = h[c];
-    if (!f) {
-      n === "/" || n === ":" ? o([n, parseInt(s, 10)]) : n === "~" ? o(["~", parseFloat(s)]) : n === "@" ? o(["@", parseFloat(s)]) : n === "[" ? o(["[", s]) : (n === ";" || n != null && n.startsWith(";")) && o([n, s]);
+    r += c, i = !1;
+  }, f = ie(e).trim(), d = Array.from(f).concat("");
+  for (let c = 0; c < d.length; c++) {
+    const s = d[c];
+    if (!s) {
+      n === "/" || n === ":" ? o([n, parseInt(r, 10)]) : n === "~" ? o(["~", parseFloat(r)]) : n === "@" ? o(["@", parseFloat(r)]) : n === "[" ? o(["[", r]) : (n === ";" || n != null && n.startsWith(";")) && o([n, r]);
       break;
     }
-    if (f === "^" && !r) {
-      r = !0;
+    if (s === "^" && !i) {
+      i = !0;
       continue;
     }
     if (n === "!")
@@ -48,190 +48,186 @@ function Z(e) {
     else if (n === ",")
       o([",", 0]);
     else if (n === "/" || n === ":") {
-      if (/^\d$/.test(f)) {
-        l(f);
+      if (/^\d$/.test(s)) {
+        l(s);
         continue;
       }
-      o([n, parseInt(s, 10)]);
+      o([n, parseInt(r, 10)]);
     } else if (n === "~") {
-      if (/^\d$/.test(f) || f === ".") {
-        l(f);
+      if (/^\d$/.test(s) || s === ".") {
+        l(s);
         continue;
       }
-      o(["~", parseFloat(s)]);
+      o(["~", parseFloat(r)]);
     } else if (n === "@") {
-      if (f === ":") {
-        o(["@", parseFloat(s)]), n = "@";
+      if (s === ":") {
+        o(["@", parseFloat(r)]), n = "@";
         continue;
       }
-      if (/^\d$/.test(f) || f === ".") {
-        l(f);
+      if (/^\d$/.test(s) || s === ".") {
+        l(s);
         continue;
       }
-      o(["@", parseFloat(s)]);
+      o(["@", parseFloat(r)]);
     } else if (n === "[")
-      if (f === ";" && !r)
-        o(["[", s]), n = ";";
-      else if (f === "]" && !r)
-        o(["[", s]);
+      if (s === ";" && !i)
+        o(["[", r]), n = ";";
+      else if (s === "]" && !i)
+        o(["[", r]);
       else {
-        l(f);
+        l(s);
         continue;
       }
     else if (n === ";")
-      if (f === "=" && !r)
-        n = `;${s}`, s = "";
-      else if (f === ";" && !r)
-        o([n, s]), n = ";";
-      else if (f === "]" && !r)
-        o([n, s]);
+      if (s === "=" && !i)
+        n = `;${r}`, r = "";
+      else if (s === ";" && !i)
+        o([n, r]), n = ";";
+      else if (s === "]" && !i)
+        o([n, r]);
       else {
-        l(f);
+        l(s);
         continue;
       }
     else if (n != null && n.startsWith(";"))
-      if (f === ";" && !r)
-        o([n, s]), n = ";";
-      else if (f === "]" && !r)
-        o([n, s]);
+      if (s === ";" && !i)
+        o([n, r]), n = ";";
+      else if (s === "]" && !i)
+        o([n, r]);
       else {
-        l(f);
+        l(s);
         continue;
       }
-    else n === null && f === ";" && (n = ";");
-    (f === "/" || f === ":" || f === "~" || f === "@" || f === "[" || f === "!" || f === ",") && (n = f);
+    else n === null && s === ";" && (n = ";");
+    (s === "/" || s === ":" || s === "~" || s === "@" || s === "[" || s === "!" || s === ",") && (n = s);
   }
   return t;
 }
-function z(e, t) {
-  return e ? e.map((n, r) => n[0] === t ? r : null).filter((n) => n !== null) : [];
+function H(e, t) {
+  return e ? e.map((n, i) => n[0] === t ? i : null).filter((n) => n !== null) : [];
 }
-function Y(e, t) {
+function U(e, t) {
   const n = [];
-  let r = 0;
-  for (const s of t)
-    n.push(e.slice(r, s)), r = s;
-  return n.push(e.slice(r)), n;
+  let i = 0;
+  for (const r of t)
+    n.push(e.slice(i, r)), i = r;
+  return n.push(e.slice(i)), n;
 }
-function P(e) {
-  var s;
+function oe(e) {
+  var r;
   const t = [], n = {};
-  let r = -1;
+  let i = -1;
   for (let o = 0; o < e.length; o++) {
     const l = e[o];
     if (!l) continue;
-    const [a, h] = l;
-    a === "/" ? (r++, t[r] = { index: h }, n[r] = []) : r >= 0 && ((s = n[r]) == null || s.push(l));
+    const [f, d] = l;
+    f === "/" ? (i++, t[i] = { index: d }, n[i] = []) : i >= 0 && ((r = n[i]) == null || r.push(l));
   }
   for (let o = 0; o < t.length; o++) {
     const l = t[o];
     if (!l) continue;
-    const a = n[o] || [];
-    for (let h = 0; h < a.length; h++) {
-      const c = a[h];
+    const f = n[o] || [];
+    for (let d = 0; d < f.length; d++) {
+      const c = f[d];
       if (!c) continue;
-      const [f, d] = c;
-      if (f === ":")
-        l.offset = d;
-      else if (f === "~")
-        l.temporal = d;
-      else if (f === "@")
-        l.spatial = (l.spatial || []).concat(d);
-      else if (f === ";s")
-        l.side = d;
-      else if (f.startsWith(";") && f !== ";s") {
-        const g = f.substring(1);
-        l.extensions || (l.extensions = {}), l.extensions[g] = d;
-      } else if (f === "[") {
-        const g = typeof d == "string" && !d.includes(" ") && d.length < 50;
-        if (h === 0 && g && !l.id)
-          l.id = d;
-        else if (d !== "") {
-          const i = d.split(",").map((u) => u.trim());
-          l.text = i;
+      const [s, a] = c;
+      if (s === ":")
+        l.offset = a;
+      else if (s === "~")
+        l.temporal = a;
+      else if (s === "@")
+        l.spatial = (l.spatial || []).concat(a);
+      else if (s === ";s")
+        l.side = a;
+      else if (s.startsWith(";") && s !== ";s") {
+        const u = s.substring(1);
+        l.extensions || (l.extensions = {}), l.extensions[u] = a;
+      } else if (s === "[") {
+        const u = typeof a == "string" && !a.includes(" ") && a.length < 50;
+        if (d === 0 && u && !l.id)
+          l.id = a;
+        else if (a !== "") {
+          const h = a.split(",").map((x) => x.trim());
+          l.text = h;
         }
       }
     }
   }
   return t;
 }
-function b(e) {
-  const t = z(e, "!");
-  return Y(e, t).map(P);
+function T(e) {
+  const t = H(e, "!");
+  return U(e, t).map(oe);
 }
-function A(e) {
+function p(e) {
   if (!e)
     throw new Error("CFI string cannot be empty");
-  const t = Z(e);
+  const t = se(e);
   if (!t || t.length === 0)
     throw new Error("Failed to tokenize CFI string");
-  const n = z(t, ",");
+  const n = H(t, ",");
   if (n.length === 0)
-    return b(t);
-  const [r, s, o] = Y(t, n);
+    return T(t);
+  const [i, r, o] = U(t, n);
   return {
-    parent: b(r || []),
-    start: b(s || []),
-    end: b(o || [])
+    parent: T(i || []),
+    start: T(r || []),
+    end: T(o || [])
   };
 }
-function O(e) {
+function M(e) {
   return e !== null && typeof e == "object" && "parent" in e && "start" in e && "end" in e;
 }
-function se(e, t, n = {}) {
+function ue(e, t, n = {}) {
   try {
     if (typeof e != "string")
       return D(e, t, n);
-    const r = A(e);
-    return n.asRange && O(r) ? U(r, t) : D(r, t, n);
-  } catch (r) {
+    const i = p(e);
+    return n.asRange && M(i) ? V(i, t) : D(i, t, n);
+  } catch (i) {
     if (n.throwOnError)
-      throw r;
+      throw i;
     return { node: null, isRange: !1 };
   }
 }
 function D(e, t, n = { asRange: !1 }) {
-  const { asRange: r = !1 } = n;
-  if (O(e)) {
-    if (r)
-      return U(e, t);
-    const s = e.start[0] || [];
-    return v(s, t, n);
+  const { asRange: i = !1 } = n;
+  if (M(e)) {
+    if (i)
+      return V(e, t);
+    const r = e.start[0] || [];
+    return E(r, t, n);
   }
   if (e[0])
-    return v(e[0], t, n);
+    return E(e[0], t, n);
   throw new Error("Invalid CFI structure");
 }
-function U(e, t) {
-  const n = e.parent[0] || [], r = e.start[0] || [], s = e.end[0] || [];
+function V(e, t) {
+  const n = e.parent[0] || [], i = e.start[0] || [], r = e.end[0] || [];
   let o = t.documentElement;
   if (n.length > 0) {
-    const d = v(n, t);
-    M(d.node) && (o = d.node);
+    const a = E(n, t);
+    I(a.node) && (o = a.node);
   }
   if (!o)
     throw new Error("Failed to resolve parent node in CFI range");
-  const l = v(r, t), a = v(s, t);
-  if (!M(l.node) || !M(a.node))
+  const l = E(i, t), f = E(r, t);
+  if (!I(l.node) || !I(f.node))
     throw new Error("Failed to resolve start or end node in CFI range");
-  const h = l.node, c = a.node, f = t.createRange();
-  return f.setStart(
-    h,
+  const d = l.node, c = f.node, s = t.createRange();
+  return s.setStart(
+    d,
     (Array.isArray(l.offset) ? l.offset[0] : l.offset) ?? 0
-  ), f.setEnd(
+  ), s.setEnd(
     c,
-    (Array.isArray(a.offset) ? a.offset[0] : a.offset) ?? 0
+    (Array.isArray(f.offset) ? f.offset[0] : f.offset) ?? 0
   ), {
-    node: f,
-    isRange: !0,
-    offset: l.offset,
-    temporal: l.temporal,
-    spatial: l.spatial,
-    side: l.side,
-    extensions: l.extensions
+    ...l,
+    node: s,
+    isRange: !0
   };
 }
-function y(e) {
+function le(e) {
   if (e != null && e.side) return e.side;
   if (e != null && e.text && e.text.length > 0) {
     const t = e.text[0];
@@ -242,431 +238,378 @@ function y(e) {
     }
   }
 }
-function w(e) {
+function k(e) {
   return e.index % 2 !== 0;
 }
-function ie(e) {
-  const n = (O(e) ? e.end : e).at(-1), r = n == null ? void 0 : n.at(-1);
-  return r == null ? void 0 : r.extensions;
+function he(e) {
+  const n = (M(e) ? e.end : e).at(-1), i = n == null ? void 0 : n.at(-1);
+  return i == null ? void 0 : i.extensions;
+}
+function G(e) {
+  const t = le(e), n = e == null ? void 0 : e.extensions;
+  return {
+    offset: e == null ? void 0 : e.offset,
+    temporal: e == null ? void 0 : e.temporal,
+    spatial: e == null ? void 0 : e.spatial,
+    side: t,
+    extensions: n
+  };
+}
+function $(e, t) {
+  return {
+    node: e,
+    isRange: !1,
+    ...G(t)
+  };
+}
+function v(e, t) {
+  return {
+    node: e,
+    isRange: !0,
+    ...G(t)
+  };
+}
+function W(e, t, n) {
+  const i = e.createRange();
+  if (i.selectNodeContents(t), n !== void 0) {
+    const r = Array.isArray(n) ? n[0] : n;
+    re(t) && i.setStart(t, r || 0);
+  }
+  return i;
+}
+function X(e, t, n, i) {
+  let r = e;
+  for (let o = n; o < t.length; o++) {
+    const l = t[o];
+    if (!r || !l) break;
+    if (k(l)) {
+      const f = l.index - 1;
+      if (f >= 0 && f < r.childNodes.length)
+        r = r.childNodes[f];
+      else {
+        if (i)
+          throw new Error(`Invalid text node index: ${l.index}`);
+        r = null;
+        break;
+      }
+    } else {
+      const f = Array.from(r.childNodes).filter(
+        (c) => c.nodeType === Node.ELEMENT_NODE
+      ), d = Math.floor(l.index / 2) - 1;
+      if (d >= 0 && d < f.length) {
+        const c = f[d];
+        c && (r = c);
+      } else {
+        if (i)
+          throw new Error(`Invalid element step index: ${l.index}`);
+        r = null;
+        break;
+      }
+    }
+  }
+  return r;
 }
-function v(e, t, n = {}) {
-  const { throwOnError: r = !1, asRange: s = !1 } = n;
+function E(e, t, n = {}) {
+  const { throwOnError: i = !1, asRange: r = !1 } = n;
   if (!t) {
-    if (r)
+    if (i)
       throw new Error("Document is not available");
-    return { node: null, isRange: !1 };
+    return $(null);
   }
-  const { node: o, remainingPathIndex: l } = ee(t, e);
+  const { node: o, remainingPathIndex: l } = fe(t, e);
   if (o && l >= e.length) {
-    const i = e.at(-1);
-    if (i && w(i)) {
-      const $ = i.index - 1;
-      if ($ >= 0 && $ < o.childNodes.length) {
-        const m = o.childNodes[$], p = y(i), E = i == null ? void 0 : i.extensions;
-        return {
-          node: m,
-          isRange: !1,
-          offset: i == null ? void 0 : i.offset,
-          temporal: i == null ? void 0 : i.temporal,
-          spatial: i == null ? void 0 : i.spatial,
-          side: p,
-          extensions: E
-        };
+    const s = e.at(-1);
+    if (s && k(s)) {
+      const a = s.index - 1;
+      if (a >= 0 && a < o.childNodes.length) {
+        const u = o.childNodes[a];
+        return $(u, s);
       }
     }
-    const u = y(i), x = i == null ? void 0 : i.extensions;
-    if (s) {
-      const $ = t.createRange();
-      if ($.selectNodeContents(o), (i == null ? void 0 : i.offset) !== void 0) {
-        const m = Array.isArray(i.offset) ? i.offset[0] : i.offset;
-        _(o) && $.setStart(o, m || 0);
-      }
-      return $.setEnd(o, (i == null ? void 0 : i.offset) || 0), {
-        node: $,
-        isRange: !0,
-        offset: i == null ? void 0 : i.offset,
-        temporal: i == null ? void 0 : i.temporal,
-        spatial: i == null ? void 0 : i.spatial,
-        side: u,
-        extensions: x
-      };
+    if (r) {
+      const a = W(t, o, s == null ? void 0 : s.offset);
+      return v(a, s);
     }
-    return {
-      node: o,
-      isRange: !1,
-      offset: i == null ? void 0 : i.offset,
-      temporal: i == null ? void 0 : i.temporal,
-      spatial: i == null ? void 0 : i.spatial,
-      side: u,
-      extensions: x
-    };
+    return $(o, s);
   }
-  let a = o || t.documentElement;
-  const h = o ? l : 0;
-  if (s && e.length > 0) {
-    const i = e[e.length - 1];
-    if (i && !w(i)) {
-      if (i.index === 0 && a) {
-        const x = t.createRange();
-        return x.setStart(a, 0), x.setEnd(a, 0), {
-          node: x,
-          isRange: !0,
-          offset: i.offset,
-          temporal: i.temporal,
-          spatial: i.spatial,
-          side: y(i),
-          extensions: i.extensions
-        };
+  let f = o || t.documentElement;
+  const d = o ? l : 0;
+  if (r && e.length > 0) {
+    const s = e[e.length - 1];
+    if (s && !k(s)) {
+      if (s.index === 0 && f) {
+        const u = t.createRange();
+        return u.setStart(f, 0), u.setEnd(f, 0), v(u, s);
       }
-      let u = a;
-      for (let x = h; x < e.length - 1; x++) {
-        const $ = e[x];
-        if (!u || !$) break;
-        if (w($)) {
-          const m = $.index - 1;
-          if (m >= 0 && m < u.childNodes.length)
-            u = u.childNodes[m];
-          else {
-            u = null;
-            break;
-          }
-        } else {
-          const m = Array.from(
-            u.childNodes
-          ).filter((E) => E.nodeType === Node.ELEMENT_NODE), p = Math.floor($.index / 2) - 1;
-          if (p >= 0 && p < m.length) {
-            const E = m[p];
-            if (E)
-              u = E;
-            else {
-              u = null;
-              break;
-            }
-          } else {
-            u = null;
-            break;
-          }
-        }
-      }
-      if (u) {
-        const x = Array.from(u.childNodes).filter(
-          (m) => m.nodeType === Node.ELEMENT_NODE
+      const a = X(
+        f,
+        e.slice(0, -1),
+        d,
+        i
+      );
+      if (a) {
+        const u = Array.from(a.childNodes).filter(
+          (x) => x.nodeType === Node.ELEMENT_NODE
         );
-        if (Math.floor(i.index / 2) - 1 === x.length) {
-          const m = t.createRange();
-          return m.selectNodeContents(u), m.collapse(!1), {
-            node: m,
-            isRange: !0,
-            offset: i.offset,
-            temporal: i.temporal,
-            spatial: i.spatial,
-            side: y(i),
-            extensions: i.extensions
-          };
+        if (Math.floor(s.index / 2) - 1 === u.length) {
+          const x = t.createRange();
+          return x.selectNodeContents(a), x.collapse(!1), v(x, s);
         }
       }
     }
   }
-  for (let i = h; i < e.length; i++) {
-    const u = e[i];
-    if (!a || !u) break;
-    if (w(u)) {
-      const x = u.index - 1;
-      if (x >= 0 && x < a.childNodes.length)
-        a = a.childNodes[x];
-      else {
-        if (r)
-          throw new Error(`Invalid text node index: ${u.index}`);
-        a = null;
-        break;
-      }
-    } else {
-      const x = Array.from(a.childNodes).filter(
-        (m) => m.nodeType === Node.ELEMENT_NODE
-      ), $ = Math.floor(u.index / 2) - 1;
-      if ($ >= 0 && $ < x.length) {
-        const m = x[$];
-        m && (a = m);
-      } else {
-        if (r)
-          throw new Error(`Invalid element step index: ${u.index}`);
-        a = null;
-        break;
-      }
-    }
-  }
-  if (!a) {
-    if (r)
+  if (f = X(f, e, d, i), !f) {
+    if (i)
       throw new Error("Failed to resolve CFI path");
-    return { node: null, isRange: !1 };
+    return $(null);
   }
-  const c = e.at(-1), f = y(c), d = c == null ? void 0 : c.extensions, g = {
-    node: a,
-    isRange: !1,
-    offset: c == null ? void 0 : c.offset,
-    temporal: c == null ? void 0 : c.temporal,
-    spatial: c == null ? void 0 : c.spatial,
-    side: f,
-    extensions: d
-  };
-  if (s) {
-    const i = t.createRange();
-    if (i.selectNodeContents(a), (c == null ? void 0 : c.offset) !== void 0) {
-      const u = Array.isArray(c.offset) ? c.offset[0] : c.offset;
-      _(a) && i.setStart(a, u || 0);
-    }
-    return {
-      ...g,
-      node: i,
-      isRange: !0
-    };
+  const c = e.at(-1);
+  if (r) {
+    const s = W(t, f, c == null ? void 0 : c.offset);
+    return v(s, c);
   }
-  return g;
+  return $(f, c);
 }
-function ee(e, t) {
+function fe(e, t) {
   for (let n = t.length - 1; n >= 0; n--) {
-    const r = t[n];
-    if (r != null && r.id) {
-      const s = e.getElementById(r.id);
-      if (s) return { node: s, remainingPathIndex: n + 1 };
+    const i = t[n];
+    if (i != null && i.id) {
+      const r = e.getElementById(i.id);
+      if (r) return { node: r, remainingPathIndex: n + 1 };
     }
   }
   return { node: null, remainingPathIndex: 0 };
 }
-function q(e, t, n = {}) {
+function J(e, t, n = {}) {
   if (!e.textContent || e.textContent.trim() === "")
     return null;
-  const r = e.textContent, s = n.textAssertionLength || 10;
-  if (t !== void 0 && t <= r.length) {
-    const o = Math.floor(s / 2), l = Math.max(0, t - o), a = Math.min(r.length, t + o);
-    return r.substring(l, a);
+  const i = e.textContent, r = n.textAssertionLength || 10;
+  if (t !== void 0 && t <= i.length) {
+    const o = Math.floor(r / 2), l = Math.max(0, t - o), f = Math.min(i.length, t + o);
+    return i.substring(l, f);
   }
-  return r.substring(0, Math.min(r.length, s));
+  return i.substring(0, Math.min(i.length, r));
 }
-function H(e, t) {
-  if (!t || Object.keys(t).length === 0)
-    return e;
-  const n = Object.entries(t).map(
-    ([r, s]) => `${r}=${encodeURIComponent(N(s))}`
-  );
-  return e.endsWith("]") ? `${e.substring(0, e.length - 1)}[;${n.join(";")}]` : `${e}[;${n.join(";")}]`;
+function ce(e) {
+  const [t, n] = e, i = Math.max(0, Math.min(100, t)), r = Math.max(0, Math.min(100, n));
+  return `@${i}:${r}`;
+}
+function S(e, t, n) {
+  let i = e;
+  return t !== void 0 && (i += `~${t}`), n !== void 0 && (i += ce(n)), i;
 }
-function C(e, t, n = {}, r) {
-  var f;
-  let s = "", o = e, l = null;
+function K(e, t, n) {
+  let i = e;
+  if (t && (i += `[${g(t)}]`), n) {
+    const r = n === "before" ? "b" : "a";
+    t ? i = `${i.substring(0, i.length - 1)};s=${r}]` : i += `[;s=${r}]`;
+  }
+  return i;
+}
+function j(e, t, n = {}, i) {
+  var d;
+  let r = "", o = e, l = null;
   if (e.nodeType === Node.TEXT_NODE) {
     l = e;
-    const d = e.parentNode;
-    if (!d)
+    const c = e.parentNode;
+    if (!c)
       throw new Error("Text node doesn't have a parent");
-    const i = Array.from(d.childNodes).indexOf(e);
-    if (i === -1)
+    const a = Array.from(c.childNodes).indexOf(e);
+    if (a === -1)
       throw new Error("Node not found in parent's children");
-    if (s = `/${i + 1}`, R(d) && d.id) {
-      const u = d.id, x = Array.from(((f = d.parentNode) == null ? void 0 : f.childNodes) || []);
-      s = `/${x.slice(0, x.indexOf(d) + 1).filter((p) => p.nodeType === Node.ELEMENT_NODE).length * 2}[${N(u)}]${s}`, o = d.parentNode;
+    if (r = `/${a + 1}`, b(c) && c.id) {
+      const u = c.id, h = Array.from(((d = c.parentNode) == null ? void 0 : d.childNodes) || []);
+      r = `/${h.slice(0, h.indexOf(c) + 1).filter((y) => y.nodeType === Node.ELEMENT_NODE).length * 2}[${g(u)}]${r}`, o = c.parentNode;
     } else
-      o = d;
+      o = c;
   }
-  let a = null;
-  for (l && n.includeTextAssertions && (a = q(l, t, n)); o != null && o.parentNode; ) {
-    if (!(l && o === l.parentNode && s.includes(`[${R(o) ? o.id : ""}]`))) {
-      const d = o.parentNode, g = Array.from(d.childNodes), i = g.indexOf(o);
-      if (i === -1)
+  let f = null;
+  for (l && n.includeTextAssertions && (f = J(l, t, n)); o != null && o.parentNode; ) {
+    if (!(l && o === l.parentNode && r.includes(`[${b(o) ? o.id : ""}]`))) {
+      const c = o.parentNode, s = Array.from(c.childNodes), a = s.indexOf(o);
+      if (a === -1)
         throw new Error("Node not found in parent's children");
-      const u = g.slice(0, i + 1).filter((m) => m.nodeType === Node.ELEMENT_NODE);
-      let x;
-      o.nodeType, Node.ELEMENT_NODE, x = u.length;
-      const $ = x * 2;
-      R(o) && o.id ? s = `/${$}[${N(o.id)}]${s}` : s = `/${$}${s}`;
+      const u = s.slice(0, a + 1).filter((N) => N.nodeType === Node.ELEMENT_NODE);
+      let h;
+      o.nodeType, Node.ELEMENT_NODE, h = u.length;
+      const x = h * 2;
+      b(o) && o.id ? r = `/${x}[${g(o.id)}]${r}` : r = `/${x}${r}`;
     }
     if (o.parentNode.nodeName.toLowerCase() === "html")
       break;
     o = o.parentNode;
   }
-  t !== void 0 && (s += `:${t}`);
-  const h = r == null ? void 0 : r.temporal;
-  h !== void 0 && (s += `~${h}`);
-  const c = (r == null ? void 0 : r.spatial) || n.spatialOffset;
-  if (c !== void 0) {
-    const [d, g] = c, i = Math.max(0, Math.min(100, d)), u = Math.max(0, Math.min(100, g));
-    s += `@${i}:${u}`;
-  }
-  if (a && (s += `[${N(a)}]`), n.includeSideBias) {
-    const d = n.includeSideBias === "before" ? "b" : "a";
-    a ? s = `${s.substring(0, s.length - 1)};s=${d}]` : s += `[;s=${d}]`;
-  }
-  return s = H(s, n.extensions), s;
+  return t !== void 0 && (r += `:${t}`), r = S(
+    r,
+    i == null ? void 0 : i.temporal,
+    (i == null ? void 0 : i.spatial) || n.spatialOffset
+  ), r = K(r, f, n.includeSideBias), r = Q(r, n.extensions), r;
 }
-function L(e, t, n, r = {}, s) {
+function z(e, t, n, i = {}, r) {
   if (e === t) {
-    let h = n !== void 0 ? `:${n}` : "";
-    if ((s == null ? void 0 : s.temporal) !== void 0 && (h += `~${s.temporal}`), s != null && s.spatial) {
-      const [c, f] = s.spatial, d = Math.max(0, Math.min(100, c)), g = Math.max(0, Math.min(100, f));
-      s.temporal !== void 0 ? h += `@${d}:${g}` : h += `@${d}:${g}`;
-    }
-    return h;
+    let d = n !== void 0 ? `:${n}` : "";
+    return d = S(d, r == null ? void 0 : r.temporal, r == null ? void 0 : r.spatial), d;
   }
   const o = [];
   let l = t;
   for (; l && l !== e; ) {
-    const h = l.parentNode;
-    if (!h) break;
-    const c = h.childNodes;
-    let f = -1;
-    for (let g = 0; g < c.length; g++)
-      if (c[g] === l) {
-        f = g;
+    const d = l.parentNode;
+    if (!d) break;
+    const c = d.childNodes;
+    let s = -1;
+    for (let u = 0; u < c.length; u++)
+      if (c[u] === l) {
+        s = u;
         break;
       }
-    if (f === -1)
+    if (s === -1)
       throw new Error("Node not found in parent's children");
-    const d = f + 1;
-    R(l) && l.id ? o.unshift(`/${d}[${N(l.id)}]`) : o.unshift(`/${d}`), l = h;
-  }
-  let a = o.join("");
-  if (n !== void 0 && (a += `:${n}`), (s == null ? void 0 : s.temporal) !== void 0 && (a += `~${s.temporal}`), s != null && s.spatial) {
-    const [h, c] = s.spatial, f = Math.max(0, Math.min(100, h)), d = Math.max(0, Math.min(100, c));
-    a += `@${f}:${d}`;
-  }
-  if (r.includeTextAssertions && t.nodeType === Node.TEXT_NODE) {
-    const h = q(t, n, r);
-    h && (a += `[${N(h)}]`);
+    const a = s + 1;
+    b(l) && l.id ? o.unshift(`/${a}[${g(l.id)}]`) : o.unshift(`/${a}`), l = d;
   }
-  if (r.includeSideBias) {
-    const h = r.includeSideBias === "before" ? "b" : "a";
-    r.includeTextAssertions && t.nodeType === Node.TEXT_NODE ? a = a.replace(/\]$/, `;s=${h}]`) : a += `[;s=${h}]`;
+  let f = o.join("");
+  if (n !== void 0 && (f += `:${n}`), f = S(f, r == null ? void 0 : r.temporal, r == null ? void 0 : r.spatial), i.includeTextAssertions && t.nodeType === Node.TEXT_NODE) {
+    const d = J(t, n, i);
+    f = K(
+      f,
+      d,
+      i.includeSideBias
+    );
   }
-  return a = H(a, r.extensions), a;
+  return f = Q(f, i.extensions), f;
 }
-function ne(e, t, n, r, s = {}, o, l) {
-  const a = J(e, n);
-  if (!a)
+const P = (e) => Object.entries(e).map(([t, n]) => `${t}=${encodeURIComponent(g(n))}`).join(";");
+function Q(e, t) {
+  return !t || Object.keys(t).length === 0 ? e : e.endsWith("]") ? `${e.substring(0, e.length - 1)}[;${P(t)}]` : `${e}[;${P(t)}]`;
+}
+function ae(e, t, n, i, r = {}, o, l) {
+  const f = ee(e, n);
+  if (!f)
     throw new Error("No common ancestor found");
-  const h = C(a, void 0, s), c = L(
-    a,
+  const d = j(f, void 0, r), c = z(
+    f,
     e,
     t,
-    s,
+    r,
     o
-  ), f = L(
-    a,
+  ), s = z(
+    f,
     n,
+    i,
     r,
-    s,
     l
   );
-  if (s.extensions && Object.keys(s.extensions).length > 0) {
-    const d = Object.entries(s.extensions).map(([u, x]) => `${u}=${encodeURIComponent(N(x))}`).join(";"), g = c.includes("[") ? c.replace(/\]$/, `;${d}]`) : `${c}[;${d}]`, i = f.includes("[") ? f.replace(/\]$/, `;${d}]`) : `${f}[;${d}]`;
-    return `${h},${g},${i}`;
+  if (r.extensions && Object.keys(r.extensions).length > 0) {
+    const a = P(r.extensions), u = c.includes("[") ? c.replace(/\]$/, `;${a}]`) : `${c}[;${a}]`, h = s.includes("[") ? s.replace(/\]$/, `;${a}]`) : `${s}[;${a}]`;
+    return `${d},${u},${h}`;
   }
-  return `${h},${c},${f}`;
+  return `${d},${c},${s}`;
 }
-function re(e, t = {}) {
-  if (M(e))
-    return `epubcfi(${C(e, void 0, t)})`;
+function xe(e, t = {}) {
+  if (I(e))
+    return `epubcfi(${j(e, void 0, t)})`;
   if ("node" in e && !("start" in e))
-    return `epubcfi(${C(
+    return `epubcfi(${j(
       e.node,
       e.offset,
       t,
       e
     )})`;
   if ("start" in e && "end" in e) {
-    const { start: n, end: r } = e;
-    return `epubcfi(${ne(
+    const { start: n, end: i } = e;
+    return `epubcfi(${ae(
       n.node,
       n.offset ?? 0,
-      r.node,
-      r.offset ?? 0,
+      i.node,
+      i.offset ?? 0,
       t,
       n,
-      r
+      i
     )})`;
   }
   throw new Error(
     "Invalid argument: expected Node, CfiPosition, or {start, end} object"
   );
 }
-function T(e, t = !1) {
-  return typeof e == "string" ? T(A(e), t) : "parent" in e ? t ? e.parent.concat(e.end) : e.parent.concat(e.start) : e;
+function m(e, t = !1) {
+  return typeof e == "string" ? m(p(e), t) : "parent" in e ? t ? e.parent.concat(e.end) : e.parent.concat(e.start) : e;
 }
-function X(e) {
+function Y(e) {
   return e.offset !== void 0 ? 1 : e.index !== void 0 ? 2 : e.temporal !== void 0 || e.spatial !== void 0 ? 3 : 4;
 }
-function W(e, t) {
-  var s, o, l, a;
-  const n = typeof e == "string" ? A(e) : e, r = typeof t == "string" ? A(t) : t;
-  if ("parent" in n || "parent" in r)
-    return W(T(n), T(r)) || W(T(n, !0), T(r, !0));
-  for (let h = 0; h < Math.max(n.length, r.length); h++) {
-    const c = n[h] || [], f = r[h] || [], d = Math.max(c.length, f.length) - 1;
-    for (let g = 0; g <= d; g++) {
-      const i = c[g], u = f[g];
-      if (!i) return -1;
-      if (!u) return 1;
-      const x = X(i), $ = X(u);
-      if (x !== $)
-        return x - $;
-      if (i.index > u.index) return 1;
-      if (i.index < u.index) return -1;
-      const m = i.temporal !== void 0, p = u.temporal !== void 0;
-      if (m && !p) return 1;
-      if (!m && p) return -1;
-      if (m && p) {
-        if ((i.temporal ?? 0) > (u.temporal ?? 0)) return 1;
-        if ((i.temporal ?? 0) < (u.temporal ?? 0)) return -1;
+function q(e, t) {
+  var r, o, l, f;
+  const n = typeof e == "string" ? p(e) : e, i = typeof t == "string" ? p(t) : t;
+  if ("parent" in n || "parent" in i)
+    return q(m(n), m(i)) || q(m(n, !0), m(i, !0));
+  for (let d = 0; d < Math.max(n.length, i.length); d++) {
+    const c = n[d] || [], s = i[d] || [], a = Math.max(c.length, s.length) - 1;
+    for (let u = 0; u <= a; u++) {
+      const h = c[u], x = s[u];
+      if (!h) return -1;
+      if (!x) return 1;
+      const N = Y(h), y = Y(x);
+      if (N !== y)
+        return N - y;
+      if (h.index > x.index) return 1;
+      if (h.index < x.index) return -1;
+      const R = h.temporal !== void 0, O = x.temporal !== void 0;
+      if (R && !O) return 1;
+      if (!R && O) return -1;
+      if (R && O) {
+        if ((h.temporal ?? 0) > (x.temporal ?? 0)) return 1;
+        if ((h.temporal ?? 0) < (x.temporal ?? 0)) return -1;
       }
-      const E = i.spatial !== void 0, k = u.spatial !== void 0;
-      if (E && !k) return 1;
-      if (!E && k) return -1;
-      if (E && k) {
-        const S = ((s = i.spatial) == null ? void 0 : s[1]) ?? 0, j = ((o = u.spatial) == null ? void 0 : o[1]) ?? 0;
-        if (S > j) return 1;
-        if (S < j) return -1;
-        const B = ((l = i.spatial) == null ? void 0 : l[0]) ?? 0, F = ((a = u.spatial) == null ? void 0 : a[0]) ?? 0;
-        if (B > F) return 1;
-        if (B < F) return -1;
+      const A = h.spatial !== void 0, C = x.spatial !== void 0;
+      if (A && !C) return 1;
+      if (!A && C) return -1;
+      if (A && C) {
+        const F = ((r = h.spatial) == null ? void 0 : r[1]) ?? 0, _ = ((o = x.spatial) == null ? void 0 : o[1]) ?? 0;
+        if (F > _) return 1;
+        if (F < _) return -1;
+        const B = ((l = h.spatial) == null ? void 0 : l[0]) ?? 0, L = ((f = x.spatial) == null ? void 0 : f[0]) ?? 0;
+        if (B > L) return 1;
+        if (B < L) return -1;
       }
-      if (g === d) {
-        if ((i.offset ?? 0) > (u.offset ?? 0)) return 1;
-        if ((i.offset ?? 0) < (u.offset ?? 0)) return -1;
+      if (u === a) {
+        if ((h.offset ?? 0) > (x.offset ?? 0)) return 1;
+        if ((h.offset ?? 0) < (x.offset ?? 0)) return -1;
       }
     }
   }
   return 0;
 }
-function te(e) {
+function de(e) {
   let t = `/${e.index}`;
   if (e.id) {
-    if (t += `[${N(e.id)}`, e.extensions)
-      for (const [r, s] of Object.entries(e.extensions))
-        t += `;${r}=${N(s)}`;
+    if (t += `[${g(e.id)}`, e.extensions)
+      for (const [i, r] of Object.entries(e.extensions))
+        t += `;${i}=${g(r)}`;
     t += "]";
   }
   e.offset !== void 0 && (t += `:${e.offset}`), e.temporal !== void 0 && (t += `~${e.temporal}`), e.spatial && e.spatial.length > 0 && (t += `@${e.spatial.join(":")}`);
   const n = [];
-  if (console.log(e.text), e.text && e.text.length > 0 && n.push(e.text.map(N).join(",")), (e.side || e.extensions && !e.id) && (e.side && n.push(`;s=${e.side}`), e.extensions && !e.id))
-    for (const [r, s] of Object.entries(e.extensions))
-      n.push(`;${r}=${N(s)}`);
+  if (e.text && e.text.length > 0 && n.push(e.text.map(g).join(",")), (e.side || e.extensions && !e.id) && (e.side && n.push(`;s=${e.side}`), e.extensions && !e.id))
+    for (const [i, r] of Object.entries(e.extensions))
+      n.push(`;${i}=${g(r)}`);
   return n.length > 0 && (t += `[${n.join("")}]`), t;
 }
-function I(e) {
-  return e.map((t) => te(t)).join("");
+function w(e) {
+  return e.map((t) => de(t)).join("");
 }
-function oe(e) {
+function ge(e) {
   if (Array.isArray(e))
-    return `epubcfi(${e.map(I).join("!")})`;
-  const t = e.parent.map(I).join("!"), n = e.start.map(I).join("!"), r = e.end.map(I).join("!");
-  return `epubcfi(${t},${n},${r})`;
+    return `epubcfi(${e.map(w).join("!")})`;
+  const t = e.parent.map(w).join("!"), n = e.start.map(w).join("!"), i = e.end.map(w).join("!");
+  return `epubcfi(${t},${n},${i})`;
 }
 export {
-  W as compare,
-  re as generate,
-  O as isParsedCfiRange,
-  A as parse,
-  se as resolve,
-  ie as resolveExtensions,
-  oe as serialize
+  q as compare,
+  xe as generate,
+  M as isParsedCfiRange,
+  p as parse,
+  ue as resolve,
+  he as resolveExtensions,
+  ge as serialize
 };
 //# sourceMappingURL=index.js.map