@prose-reader/cfi 1.222.0 → 1.224.0

package/dist/index.js

@@ -17,17 +17,17 @@ function Q(e, t) {
   return null;
 }
 const Z = /[\[\]\^,();]/g;
-function g(e) {
+function y(e) {
   return e.replace(Z, "^$&");
 }
-const ee = /^epubcfi\((.*)\)$/, b = (e) => e.nodeType === Node.ELEMENT_NODE, w = (e) => typeof e == "object" && e !== null && "nodeType" in e && (e.nodeType === Node.ELEMENT_NODE || e.nodeType === Node.TEXT_NODE), ne = (e) => e.nodeType === Node.TEXT_NODE;
+const ee = /^epubcfi\((.*)\)$/, O = (e) => e.nodeType === Node.ELEMENT_NODE, p = (e) => typeof e == "object" && e !== null && "nodeType" in e && (e.nodeType === Node.ELEMENT_NODE || e.nodeType === Node.TEXT_NODE), ne = (e) => e.nodeType === Node.TEXT_NODE;
 function te(e) {
-  if (M(e))
+  if (P(e))
     return !1;
   const t = e[e.length - 1];
   return e.length > 1 && (t === void 0 || t.length === 0);
 }
-function M(e) {
+function P(e) {
   return e !== null && typeof e == "object" && "parent" in e && "start" in e && "end" in e;
 }
 function re(e) {
@@ -37,85 +37,85 @@ function re(e) {
 function ie(e) {
   const t = [];
   let n = null, i = !1, r = "";
-  const o = (c) => {
+  const s = (c) => {
     t.push(c), n = null, r = "";
-  }, l = (c) => {
+  }, f = (c) => {
     r += c, i = !1;
-  }, f = re(e).trim(), a = Array.from(f).concat("");
-  for (let c = 0; c < a.length; c++) {
-    const s = a[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]) : n === "!" && o(["!", 0]);
+  }, l = re(e).trim(), d = Array.from(l).concat("");
+  for (let c = 0; c < d.length; c++) {
+    const o = d[c];
+    if (!o) {
+      n === "/" || n === ":" ? s([n, parseInt(r, 10)]) : n === "~" ? s(["~", parseFloat(r)]) : n === "@" ? s(["@", parseFloat(r)]) : n === "[" ? s(["[", r]) : n === ";" || n != null && n.startsWith(";") ? s([n, r]) : n === "!" && s(["!", 0]);
       break;
     }
-    if (s === "^" && !i) {
+    if (o === "^" && !i) {
       i = !0;
       continue;
     }
     if (n === "!")
-      o(["!", 0]);
+      s(["!", 0]);
     else if (n === ",")
-      o([",", 0]);
+      s([",", 0]);
     else if (n === "/" || n === ":") {
-      if (/^\d$/.test(s)) {
-        l(s);
+      if (/^\d$/.test(o)) {
+        f(o);
         continue;
       }
-      o([n, parseInt(r, 10)]);
+      s([n, parseInt(r, 10)]);
     } else if (n === "~") {
-      if (/^\d$/.test(s) || s === ".") {
-        l(s);
+      if (/^\d$/.test(o) || o === ".") {
+        f(o);
         continue;
       }
-      o(["~", parseFloat(r)]);
+      s(["~", parseFloat(r)]);
     } else if (n === "@") {
-      if (s === ":") {
-        o(["@", parseFloat(r)]), n = "@";
+      if (o === ":") {
+        s(["@", parseFloat(r)]), n = "@";
         continue;
       }
-      if (/^\d$/.test(s) || s === ".") {
-        l(s);
+      if (/^\d$/.test(o) || o === ".") {
+        f(o);
         continue;
       }
-      o(["@", parseFloat(r)]);
+      s(["@", parseFloat(r)]);
     } else if (n === "[")
-      if (s === ";" && !i)
-        o(["[", r]), n = ";";
-      else if (s === "]" && !i)
-        o(["[", r]);
+      if (o === ";" && !i)
+        s(["[", r]), n = ";";
+      else if (o === "]" && !i)
+        s(["[", r]);
       else {
-        l(s);
+        f(o);
         continue;
       }
     else if (n === ";")
-      if (s === "=" && !i)
+      if (o === "=" && !i)
         n = `;${r}`, r = "";
-      else if (s === ";" && !i)
-        o([n, r]), n = ";";
-      else if (s === "]" && !i)
-        o([n, r]);
+      else if (o === ";" && !i)
+        s([n, r]), n = ";";
+      else if (o === "]" && !i)
+        s([n, r]);
       else {
-        l(s);
+        f(o);
         continue;
       }
     else if (n != null && n.startsWith(";"))
-      if (s === ";" && !i)
-        o([n, r]), n = ";";
-      else if (s === "]" && !i)
-        o([n, r]);
+      if (o === ";" && !i)
+        s([n, r]), n = ";";
+      else if (o === "]" && !i)
+        s([n, r]);
       else {
-        l(s);
+        f(o);
         continue;
       }
-    else n === null && s === ";" && (n = ";");
-    (s === "/" || s === ":" || s === "~" || s === "@" || s === "[" || s === "!" || s === ",") && (n = s);
+    else n === null && o === ";" && (n = ";");
+    (o === "/" || o === ":" || o === "~" || o === "@" || o === "[" || o === "!" || o === ",") && (n = o);
   }
   return t;
 }
-function q(e, t) {
+function H(e, t) {
   return e ? e.map((n, i) => n[0] === t ? i : null).filter((n) => n !== null) : [];
 }
-function H(e, t) {
+function U(e, t) {
   const n = [];
   let i = 0;
   for (const r of t)
@@ -126,67 +126,81 @@ function se(e) {
   var r;
   const t = [], n = {};
   let i = -1;
-  for (let o = 0; o < e.length; o++) {
-    const l = e[o];
-    if (!l) continue;
-    const [f, a] = l;
-    f === "/" ? (i++, t[i] = { index: a }, n[i] = []) : i >= 0 && ((r = n[i]) == null || r.push(l));
+  for (let s = 0; s < e.length; s++) {
+    const f = e[s];
+    if (!f) continue;
+    const [l, d] = f;
+    l === "/" ? (i++, t[i] = { index: d }, n[i] = []) : i >= 0 && ((r = n[i]) == null || r.push(f));
   }
-  for (let o = 0; o < t.length; o++) {
-    const l = t[o];
-    if (!l) continue;
-    const f = n[o] || [];
-    for (let a = 0; a < f.length; a++) {
-      const c = f[a];
+  for (let s = 0; s < t.length; s++) {
+    const f = t[s];
+    if (!f) continue;
+    const l = n[s] || [];
+    for (let d = 0; d < l.length; d++) {
+      const c = l[d];
       if (!c) continue;
-      const [s, d] = c;
-      if (s === ":")
-        l.offset = d;
-      else if (s === "~")
-        l.temporal = d;
-      else if (s === "@")
-        l.spatial = (l.spatial || []).concat(d);
-      else if (s === ";s")
-        l.side = d;
-      else if (s.startsWith(";") && s !== ";s") {
-        const u = s.substring(1);
-        l.extensions || (l.extensions = {}), l.extensions[u] = d;
-      } else if (s === "[") {
-        const u = typeof d == "string" && !d.includes(" ") && d.length < 50;
-        if (a === 0 && u && !l.id)
-          l.id = d;
-        else if (d !== "") {
-          const h = d.split(",").map((x) => x.trim());
-          l.text = h;
+      const [o, a] = c;
+      if (o === ":")
+        f.offset = a;
+      else if (o === "~")
+        f.temporal = a;
+      else if (o === "@")
+        f.spatial = (f.spatial || []).concat(a);
+      else if (o === ";s")
+        f.side = a;
+      else if (o.startsWith(";") && o !== ";s") {
+        const h = o.substring(1);
+        f.extensions || (f.extensions = {}), f.extensions[h] = a;
+      } else if (o === "[") {
+        const h = typeof a == "string" && !a.includes(" ") && a.length < 50;
+        if (d === 0 && h && !f.id)
+          f.id = a;
+        else if (a !== "") {
+          const u = a.split(",").map((g) => g.trim());
+          f.text = u;
         }
       }
     }
   }
   return t;
 }
-function I(e) {
-  const t = q(e, "!");
-  return H(e, t).map(se);
+function k(e) {
+  const t = H(e, "!");
+  return U(e, t).map(se);
 }
-function O(e) {
+function C(e) {
   if (!e)
     throw new Error("CFI string cannot be empty");
   const t = ie(e);
   if (!t || t.length === 0)
     throw new Error("Failed to tokenize CFI string");
-  const n = q(t, ",");
+  const n = H(t, ",");
   if (n.length === 0)
-    return I(t);
-  const [i, r, o] = H(t, n);
+    return k(t);
+  const [i, r, s] = U(t, n);
+  function f(o, a) {
+    if (!a || a.length === 0) return [[]];
+    const h = a.filter((u) => u[0] !== ",");
+    if (h.length === 1 && h[0] && h[0][0] === ":") {
+      const u = o.length > 0 ? o[o.length - 1] : void 0, g = h[0];
+      if (u && u.length > 0 && g) {
+        const E = u.map((x) => ({ ...x })), N = E[E.length - 1];
+        return N && (N.offset = g[1]), [E];
+      }
+      return [[]];
+    }
+    return k(a);
+  }
+  const l = k(i || []), d = f(l, r || []), c = f(l, s || []);
   return {
-    parent: I(i || []),
-    start: I(r || []),
-    end: I(o || [])
+    parent: l,
+    start: d,
+    end: c
   };
 }
-function xe(e, t, n = {}) {
+function ge(e, t, n = {}) {
   try {
-    const i = typeof e != "string" ? e : O(e);
+    const i = typeof e != "string" ? e : C(e);
     return oe(i, t, n);
   } catch (i) {
     if (n.throwOnError)
@@ -195,41 +209,82 @@ function xe(e, t, n = {}) {
   }
 }
 function oe(e, t, n = { asRange: !1 }) {
-  if (M(e))
-    return le(e, t);
+  if (P(e))
+    return fe(e, t);
   if (te(e))
-    return N(null);
+    return I(null);
   const i = e.at(-1);
   if (i)
-    return p(i, t, n);
+    return A(i, t, n);
   throw new Error("Invalid CFI structure");
 }
-function le(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 = p(n, t);
-    w(d.node) && (o = d.node);
-  }
-  if (!o)
+function fe(e, t) {
+  var h, u, g, E;
+  const n = e.parent, i = e.start[0] || [], r = e.end[0] || [];
+  let s = t.documentElement;
+  if (n.length > 0)
+    if (n.length > 1) {
+      const N = n[0];
+      if (N) {
+        const x = A(N, t);
+        p(x.node) && (s = x.node);
+      }
+      if (n.length > 1 && s) {
+        const x = n[1];
+        if (x) {
+          const $ = A(x, t);
+          p($.node) && (s = $.node);
+        }
+      }
+    } else {
+      const N = n[0];
+      if (N) {
+        const x = A(N, t);
+        p(x.node) && (s = x.node);
+      }
+    }
+  if (!s)
     throw new Error("Failed to resolve parent node in CFI range");
-  const l = p(i, t), f = p(r, t);
-  if (!w(l.node) || !w(f.node))
-    throw new Error("Failed to resolve start or end node in CFI range");
-  const a = l.node, c = f.node, s = t.createRange();
-  return s.setStart(
-    a,
-    (Array.isArray(l.offset) ? l.offset[0] : l.offset) ?? 0
-  ), s.setEnd(
-    c,
-    (Array.isArray(f.offset) ? f.offset[0] : f.offset) ?? 0
-  ), {
-    ...l,
-    node: s,
+  const f = s.nodeType === Node.TEXT_NODE;
+  let l, d, c = 0, o = 0;
+  if (f) {
+    l = s, d = s;
+    const N = i[i.length - 1], x = r[r.length - 1];
+    c = (Array.isArray(N == null ? void 0 : N.offset) ? N.offset[0] : N == null ? void 0 : N.offset) ?? 0, o = (Array.isArray(x == null ? void 0 : x.offset) ? x.offset[0] : x == null ? void 0 : x.offset) ?? 0;
+  } else {
+    const N = i.length === 0 || i.length === 1 && typeof ((h = i[0]) == null ? void 0 : h.offset) == "number", x = r.length === 0 || r.length === 1 && typeof ((u = r[0]) == null ? void 0 : u.offset) == "number";
+    if (N) {
+      if (!s)
+        throw new Error("Failed to resolve parent node in CFI range (start)");
+      l = s, c = ((g = i[0]) == null ? void 0 : g.offset) ?? 0;
+    } else {
+      const $ = R(s, i, 0, !0);
+      if (!$)
+        throw new Error("Failed to resolve start node in CFI range");
+      l = $;
+      const m = i[i.length - 1];
+      c = (Array.isArray(m == null ? void 0 : m.offset) ? m.offset[0] : m == null ? void 0 : m.offset) ?? 0;
+    }
+    if (x) {
+      if (!s)
+        throw new Error("Failed to resolve parent node in CFI range (end)");
+      d = s, o = ((E = r[0]) == null ? void 0 : E.offset) ?? 0;
+    } else {
+      const $ = R(s, r, 0, !0);
+      if (!$) throw new Error("Failed to resolve end node in CFI range");
+      d = $;
+      const m = r[r.length - 1];
+      o = (Array.isArray(m == null ? void 0 : m.offset) ? m.offset[0] : m == null ? void 0 : m.offset) ?? 0;
+    }
+  }
+  const a = t.createRange();
+  return a.setStart(l, c), a.setEnd(d, o), {
+    ..._(i[i.length - 1]),
+    node: a,
     isRange: !0
   };
 }
-function fe(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];
@@ -240,15 +295,15 @@ function fe(e) {
     }
   }
 }
-function S(e) {
+function M(e) {
   return e.index % 2 !== 0;
 }
-function ge(e) {
-  const n = (M(e) ? e.end : e).at(-1), i = n == null ? void 0 : n.at(-1);
+function xe(e) {
+  const n = (P(e) ? e.end : e).at(-1), i = n == null ? void 0 : n.at(-1);
   return i == null ? void 0 : i.extensions;
 }
-function U(e) {
-  const t = fe(e), n = e == null ? void 0 : e.extensions;
+function _(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,
@@ -257,21 +312,21 @@ function U(e) {
     extensions: n
   };
 }
-function N(e, t) {
+function I(e, t) {
   return {
     node: e,
     isRange: !1,
-    ...U(t)
+    ..._(t)
   };
 }
-function T(e, t) {
+function w(e, t) {
   return {
     node: e,
     isRange: !0,
-    ...U(t)
+    ..._(t)
   };
 }
-function D(e, t, n) {
+function X(e, t, n) {
   const i = e.createRange();
   if (i.selectNodeContents(t), n !== void 0) {
     const r = Array.isArray(n) ? n[0] : n;
@@ -279,31 +334,31 @@ function D(e, t, n) {
   }
   return i;
 }
-function W(e, t, n, i) {
+function R(e, t, n, i) {
   let r = e;
-  for (let o = n; o < t.length; o++) {
-    const l = t[o];
-    if (!r || !l) break;
-    if (S(l)) {
-      const f = l.index - 1;
-      if (f >= 0 && f < r.childNodes.length)
-        r = r.childNodes[f];
+  for (let s = n; s < t.length; s++) {
+    const f = t[s];
+    if (!r || !f) break;
+    if (M(f)) {
+      const l = f.index - 1;
+      if (l >= 0 && l < r.childNodes.length)
+        r = r.childNodes[l];
       else {
         if (i)
-          throw new Error(`Invalid text node index: ${l.index}`);
+          throw new Error(`Invalid text node index: ${f.index}`);
         r = null;
         break;
       }
     } else {
-      const f = Array.from(r.childNodes).filter(
+      const l = Array.from(r.childNodes).filter(
         (c) => c.nodeType === Node.ELEMENT_NODE
-      ), a = Math.floor(l.index / 2) - 1;
-      if (a >= 0 && a < f.length) {
-        const c = f[a];
+      ), d = Math.floor(f.index / 2) - 1;
+      if (d >= 0 && d < l.length) {
+        const c = l[d];
         c && (r = c);
       } else {
         if (i)
-          throw new Error(`Invalid element step index: ${l.index}`);
+          throw new Error(`Invalid element step index: ${f.index}`);
         r = null;
         break;
       }
@@ -311,66 +366,66 @@ function W(e, t, n, i) {
   }
   return r;
 }
-function p(e, t, n = {}) {
+function A(e, t, n = {}) {
   const { throwOnError: i = !1, asRange: r = !1 } = n;
   if (!t) {
     if (i)
       throw new Error("Document is not available");
-    return N(null);
+    return I(null);
   }
-  const { node: o, remainingPathIndex: l } = ce(t, e);
-  if (o && l >= e.length) {
-    const s = e.at(-1);
-    if (s && S(s)) {
-      const d = s.index - 1;
-      if (d >= 0 && d < o.childNodes.length) {
-        const u = o.childNodes[d];
-        return N(u, s);
+  const { node: s, remainingPathIndex: f } = ce(t, e);
+  if (s && f >= e.length) {
+    const o = e.at(-1);
+    if (o && M(o)) {
+      const a = o.index - 1;
+      if (a >= 0 && a < s.childNodes.length) {
+        const h = s.childNodes[a];
+        return I(h, o);
       }
     }
     if (r) {
-      const d = D(t, o, s == null ? void 0 : s.offset);
-      return T(d, s);
+      const a = X(t, s, o == null ? void 0 : o.offset);
+      return w(a, o);
     }
-    return N(o, s);
+    return I(s, o);
   }
-  let f = o || t.documentElement;
-  const a = o ? l : 0;
+  let l = s || t.documentElement;
+  const d = s ? f : 0;
   if (r && e.length > 0) {
-    const s = e[e.length - 1];
-    if (s && !S(s)) {
-      if (s.index === 0 && f) {
-        const u = t.createRange();
-        return u.setStart(f, 0), u.setEnd(f, 0), T(u, s);
+    const o = e[e.length - 1];
+    if (o && !M(o)) {
+      if (o.index === 0 && l) {
+        const h = t.createRange();
+        return h.setStart(l, 0), h.setEnd(l, 0), w(h, o);
       }
-      const d = W(
-        f,
+      const a = R(
+        l,
         e.slice(0, -1),
-        a,
+        d,
         i
       );
-      if (d) {
-        const u = Array.from(d.childNodes).filter(
-          (x) => x.nodeType === Node.ELEMENT_NODE
+      if (a) {
+        const h = Array.from(a.childNodes).filter(
+          (g) => g.nodeType === Node.ELEMENT_NODE
         );
-        if (Math.floor(s.index / 2) - 1 === u.length) {
-          const x = t.createRange();
-          return x.selectNodeContents(d), x.collapse(!1), T(x, s);
+        if (Math.floor(o.index / 2) - 1 === h.length) {
+          const g = t.createRange();
+          return g.selectNodeContents(a), g.collapse(!1), w(g, o);
         }
       }
     }
   }
-  if (f = W(f, e, a, i), !f) {
+  if (l = R(l, e, d, i), !l) {
     if (i)
       throw new Error("Failed to resolve CFI path");
-    return N(null);
+    return I(null);
   }
   const c = e.at(-1);
   if (r) {
-    const s = D(t, f, c == null ? void 0 : c.offset);
-    return T(s, c);
+    const o = X(t, l, c == null ? void 0 : c.offset);
+    return w(o, c);
   }
-  return N(f, c);
+  return I(l, c);
 }
 function ce(e, t) {
   for (let n = t.length - 1; n >= 0; n--) {
@@ -387,8 +442,8 @@ function G(e, t, n = {}) {
     return null;
   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);
+    const s = Math.floor(r / 2), f = Math.max(0, t - s), l = Math.min(i.length, t + s);
+    return i.substring(f, l);
   }
   return i.substring(0, Math.min(i.length, r));
 }
@@ -396,95 +451,91 @@ function ae(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 P(e, t, n) {
+function j(e, t, n) {
   let i = e;
   return t !== void 0 && (i += `~${t}`), n !== void 0 && (i += ae(n)), i;
 }
 function J(e, t, n) {
   let i = e;
-  if (t && (i += `[${g(t)}]`), n) {
+  if (t && (i += `[${y(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 a;
-  let r = "", o = e, l = null;
+function S(e, t, n = {}, i) {
+  var d;
+  let r = "", s = e, f = null;
   if ((e == null ? void 0 : e.nodeType) === Node.TEXT_NODE) {
-    l = e;
+    f = e;
     const c = e.parentNode;
     if (!c)
       throw new Error("Text node doesn't have a parent");
-    const d = Array.from(c.childNodes).indexOf(e);
-    if (d === -1)
+    const a = Array.from(c.childNodes).indexOf(e);
+    if (a === -1)
       throw new Error("Node not found in parent's children");
-    if (r = `/${d + 1}`, b(c) && c.id) {
-      const u = c.id, h = Array.from(((a = c.parentNode) == null ? void 0 : a.childNodes) || []);
-      r = `/${h.slice(0, h.indexOf(c) + 1).filter((y) => y.nodeType === Node.ELEMENT_NODE).length * 2}[${g(u)}]${r}`, o = c.parentNode;
+    if (r = `/${a + 1}`, O(c) && c.id) {
+      const h = c.id, u = Array.from(((d = c.parentNode) == null ? void 0 : d.childNodes) || []);
+      r = `/${u.slice(0, u.indexOf(c) + 1).filter((N) => N.nodeType === Node.ELEMENT_NODE).length * 2}[${y(h)}]${r}`, s = c.parentNode;
     } else
-      o = c;
+      s = c;
   }
-  let f = null;
-  for (l && n.includeTextAssertions && (f = G(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), d = s.indexOf(o);
-      if (d === -1)
+  let l = null;
+  for (f && n.includeTextAssertions && (l = G(f, t, n)); s != null && s.parentNode; ) {
+    if (!(f && s === f.parentNode && r.includes(`[${O(s) ? s.id : ""}]`))) {
+      const c = s.parentNode, o = Array.from(c.childNodes), a = o.indexOf(s);
+      if (a === -1)
         throw new Error("Node not found in parent's children");
-      const u = s.slice(0, d + 1).filter(($) => $.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}`;
+      const h = o.slice(0, a + 1).filter((E) => E.nodeType === Node.ELEMENT_NODE);
+      let u;
+      s.nodeType, Node.ELEMENT_NODE, u = h.length;
+      const g = u * 2;
+      O(s) && s.id ? r = `/${g}[${y(s.id)}]${r}` : r = `/${g}${r}`;
     }
-    if (o.parentNode.nodeName.toLowerCase() === "html")
+    if (s.parentNode.nodeName.toLowerCase() === "html")
       break;
-    o = o.parentNode;
+    s = s.parentNode;
   }
-  return t !== void 0 && (r += `:${t}`), r = P(
+  return t !== void 0 && (r += `:${t}`), r = j(
     r,
     i == null ? void 0 : i.temporal,
     (i == null ? void 0 : i.spatial) || n.spatialOffset
-  ), r = J(r, f, n.includeSideBias), r = m(r, n.extensions), r;
+  ), r = J(r, l, n.includeSideBias), r = T(r, n.extensions), r;
 }
-function X(e, t, n, i = {}, r) {
+function z(e, t, n, i = {}, r) {
   if (e === t) {
-    let a = n !== void 0 ? `:${n}` : "";
-    return a = P(a, r == null ? void 0 : r.temporal, r == null ? void 0 : r.spatial), a;
+    let d = n !== void 0 ? `:${n}` : "";
+    return d = j(d, r == null ? void 0 : r.temporal, r == null ? void 0 : r.spatial), d;
   }
-  const o = [];
-  let l = t;
-  for (; l && l !== e; ) {
-    const a = l.parentNode;
-    if (!a) break;
-    const c = a.childNodes;
-    let s = -1;
-    for (let u = 0; u < c.length; u++)
-      if (c[u] === l) {
-        s = u;
-        break;
-      }
-    if (s === -1)
+  const s = [];
+  let f = t;
+  for (; f && f !== e; ) {
+    const d = f.parentNode;
+    if (!d) break;
+    const c = Array.from(d.childNodes), o = c.indexOf(f);
+    if (o === -1)
       throw new Error("Node not found in parent's children");
-    const d = s + 1;
-    b(l) && l.id ? o.unshift(`/${d}[${g(l.id)}]`) : o.unshift(`/${d}`), l = a;
+    let a;
+    f.nodeType === Node.ELEMENT_NODE ? a = (c.filter(
+      (g) => g.nodeType === Node.ELEMENT_NODE
+    ).indexOf(f) + 1) * 2 : a = o + 1, O(f) && f.id ? s.unshift(`/${a}[${y(f.id)}]`) : s.unshift(`/${a}`), f = d;
   }
-  let f = o.join("");
-  if (n !== void 0 && (f += `:${n}`), f = P(f, r == null ? void 0 : r.temporal, r == null ? void 0 : r.spatial), i.includeTextAssertions && t.nodeType === Node.TEXT_NODE) {
-    const a = G(t, n, i);
-    f = J(
-      f,
-      a,
+  let l = s.join("");
+  if (n !== void 0 && (l += `:${n}`), l = j(l, r == null ? void 0 : r.temporal, r == null ? void 0 : r.spatial), i.includeTextAssertions && t.nodeType === Node.TEXT_NODE) {
+    const d = G(t, n, i);
+    l = J(
+      l,
+      d,
       i.includeSideBias
     );
   }
-  return f = m(f, i.extensions), f;
+  return l = T(l, i.extensions), l;
 }
 const de = (e) => Object.entries(e).map(([t, n]) => {
-  const i = g(n);
+  const i = y(n);
   return `${t}=${encodeURIComponent(i)}`;
 }).join(";");
-function m(e, t) {
+function T(e, t) {
   if (!t || Object.keys(t).length === 0)
     return e;
   const n = de(t);
@@ -494,52 +545,52 @@ function m(e, t) {
   }
   return e.endsWith("!") ? e : `${e}[;${n}]`;
 }
-function ue(e, t, n, i, r = {}, o, l) {
-  const f = Q(e, n);
-  if (!f)
+function ue(e, t, n, i, r = {}, s, f) {
+  const l = Q(e, n);
+  if (!l)
     throw new Error("No common ancestor found");
-  const a = j(f, void 0, r), c = X(
-    f,
+  const d = S(l, void 0, r), c = z(
+    l,
     e,
     t,
     r,
-    o
-  ), s = X(
-    f,
+    s
+  ), o = z(
+    l,
     n,
     i,
     r,
-    l
+    f
   );
   if (r.extensions && Object.keys(r.extensions).length > 0) {
-    const d = m(a, r.extensions), u = m(c, r.extensions), h = m(s, r.extensions);
-    return `${d},${u},${h}`;
+    const a = T(d, r.extensions), h = T(c, r.extensions), u = T(o, r.extensions);
+    return `${a},${h},${u}`;
   }
-  return `${a},${c},${s}`;
+  return `${d},${c},${o}`;
 }
-const z = (e, t, n = {}, i) => {
+const Y = (e, t, n = {}, i) => {
   const r = "";
-  let l = `/6/${(e + 1) * 2}`;
-  return t && (l += `[${g(t)}]`), l = i ? m(l, n.extensions) : l, `${l}${r}!`;
+  let f = `/6/${(e + 1) * 2}`;
+  return t && (f += `[${y(t)}]`), f = i ? T(f, n.extensions) : f, `${f}${r}!`;
 };
 function Ne(e, t = {}) {
-  if (w(e))
-    return `epubcfi(${j(e, void 0, t)})`;
+  if (p(e))
+    return `epubcfi(${S(e, void 0, t)})`;
   let n = "";
   if (!("start" in e))
-    return e.spineIndex !== void 0 && (n = z(
+    return e.spineIndex !== void 0 && (n = Y(
       e.spineIndex,
       e.spineId,
       t,
       !e.node
-    ), !e.node) ? `epubcfi(${n})` : (n += j(
+    ), !e.node) ? `epubcfi(${n})` : (n += S(
       e.node ?? null,
       e.offset,
       t,
       e
     ), `epubcfi(${n})`);
   const { start: i, end: r } = e;
-  return i.spineIndex !== void 0 && (n = z(
+  return i.spineIndex !== void 0 && (n = Y(
     i.spineIndex,
     i.spineId,
     t,
@@ -554,49 +605,49 @@ function Ne(e, t = {}) {
     r
   )), `epubcfi(${n})`;
 }
-function E(e, t = !1) {
-  return typeof e == "string" ? E(O(e), t) : "parent" in e ? t ? e.parent.concat(e.end) : e.parent.concat(e.start) : e;
+function v(e, t = !1) {
+  return typeof e == "string" ? v(C(e), t) : "parent" in e ? t ? e.parent.concat(e.end) : e.parent.concat(e.start) : e;
 }
-function Y(e) {
+function V(e) {
   return e.offset !== void 0 ? 1 : e.index !== void 0 ? 2 : e.temporal !== void 0 || e.spatial !== void 0 ? 3 : 4;
 }
-function V(e, t) {
-  var r, o, l, f;
-  const n = typeof e == "string" ? O(e) : e, i = typeof t == "string" ? O(t) : t;
+function q(e, t) {
+  var r, s, f, l;
+  const n = typeof e == "string" ? C(e) : e, i = typeof t == "string" ? C(t) : t;
   if ("parent" in n || "parent" in i)
-    return V(E(n), E(i)) || V(E(n, !0), E(i, !0));
-  for (let a = 0; a < Math.max(n.length, i.length); a++) {
-    const c = n[a] || [], s = i[a] || [], d = Math.max(c.length, s.length) - 1;
-    for (let u = 0; u <= d; u++) {
-      const h = c[u], x = s[u];
-      if (!h) return -1;
-      if (!x) return 1;
-      const $ = Y(h), y = Y(x);
-      if ($ !== y)
-        return $ - y;
-      if (h.index > x.index) return 1;
-      if (h.index < x.index) return -1;
-      const k = h.temporal !== void 0, R = x.temporal !== void 0;
-      if (k && !R) return 1;
-      if (!k && R) return -1;
-      if (k && R) {
-        if ((h.temporal ?? 0) > (x.temporal ?? 0)) return 1;
-        if ((h.temporal ?? 0) < (x.temporal ?? 0)) return -1;
+    return q(v(n), v(i)) || q(v(n, !0), v(i, !0));
+  for (let d = 0; d < Math.max(n.length, i.length); d++) {
+    const c = n[d] || [], o = i[d] || [], a = Math.max(c.length, o.length) - 1;
+    for (let h = 0; h <= a; h++) {
+      const u = c[h], g = o[h];
+      if (!u) return -1;
+      if (!g) return 1;
+      const E = V(u), N = V(g);
+      if (E !== N)
+        return E - N;
+      if (u.index > g.index) return 1;
+      if (u.index < g.index) return -1;
+      const x = u.temporal !== void 0, $ = g.temporal !== void 0;
+      if (x && !$) return 1;
+      if (!x && $) return -1;
+      if (x && $) {
+        if ((u.temporal ?? 0) > (g.temporal ?? 0)) return 1;
+        if ((u.temporal ?? 0) < (g.temporal ?? 0)) 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, B = ((o = x.spatial) == null ? void 0 : o[1]) ?? 0;
-        if (F > B) return 1;
-        if (F < B) return -1;
-        const _ = ((l = h.spatial) == null ? void 0 : l[0]) ?? 0, L = ((f = x.spatial) == null ? void 0 : f[0]) ?? 0;
-        if (_ > L) return 1;
-        if (_ < L) return -1;
+      const m = u.spatial !== void 0, F = g.spatial !== void 0;
+      if (m && !F) return 1;
+      if (!m && F) return -1;
+      if (m && F) {
+        const D = ((r = u.spatial) == null ? void 0 : r[1]) ?? 0, L = ((s = g.spatial) == null ? void 0 : s[1]) ?? 0;
+        if (D > L) return 1;
+        if (D < L) return -1;
+        const B = ((f = u.spatial) == null ? void 0 : f[0]) ?? 0, W = ((l = g.spatial) == null ? void 0 : l[0]) ?? 0;
+        if (B > W) return 1;
+        if (B < W) return -1;
       }
-      if (u === d) {
-        if ((h.offset ?? 0) > (x.offset ?? 0)) return 1;
-        if ((h.offset ?? 0) < (x.offset ?? 0)) return -1;
+      if (h === a) {
+        if ((u.offset ?? 0) > (g.offset ?? 0)) return 1;
+        if ((u.offset ?? 0) < (g.offset ?? 0)) return -1;
       }
     }
   }
@@ -605,35 +656,35 @@ function V(e, t) {
 function he(e) {
   let t = `/${e.index}`;
   if (e.id) {
-    if (t += `[${g(e.id)}`, e.extensions)
+    if (t += `[${y(e.id)}`, e.extensions)
       for (const [i, r] of Object.entries(e.extensions))
-        t += `;${i}=${g(r)}`;
+        t += `;${i}=${y(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 (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))
+  if (e.text && e.text.length > 0 && n.push(e.text.map(y).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)}`);
+      n.push(`;${i}=${y(r)}`);
   return n.length > 0 && (t += `[${n.join("")}]`), t;
 }
-function v(e) {
+function b(e) {
   return e.map((t) => he(t)).join("");
 }
 function me(e) {
   if (Array.isArray(e))
-    return `epubcfi(${e.map(v).join("!")})`;
-  const t = e.parent.map(v).join("!"), n = e.start.map(v).join("!"), i = e.end.map(v).join("!");
+    return `epubcfi(${e.map(b).join("!")})`;
+  const t = e.parent.map(b).join("!"), n = e.start.map(b).join("!"), i = e.end.map(b).join("!");
   return `epubcfi(${t},${n},${i})`;
 }
 export {
-  V as compare,
+  q as compare,
   Ne as generate,
   te as isIndirectionOnly,
-  M as isParsedCfiRange,
-  O as parse,
-  xe as resolve,
-  ge as resolveExtensions,
+  P as isParsedCfiRange,
+  C as parse,
+  ge as resolve,
+  xe as resolveExtensions,
   me as serialize
 };
 //# sourceMappingURL=index.js.map