@prose-reader/cfi 1.234.0 → 1.236.0

package/dist/index.js

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