@prose-reader/cfi 1.213.0 → 1.214.0

package/dist/index.js

@@ -1,13 +1,13 @@
-function Q(e) {
+function Z(e) {
   const t = [e];
   let n = e;
   for (; n.parentNode; )
     t.push(n.parentNode), n = n.parentNode;
   return t;
 }
-function Z(e, t) {
+function ee(e, t) {
   if (e === t) return e;
-  const n = Q(e), i = new Set(n);
+  const n = Z(e), i = new Set(n);
   let r = t;
   for (; r; ) {
     if (i.has(r))
@@ -16,25 +16,25 @@ function Z(e, t) {
   }
   return null;
 }
-const ee = /[\[\]\^,();]/g;
+const ne = /[\[\]\^,();]/g;
 function g(e) {
-  return e.replace(ee, "^$&");
+  return e.replace(ne, "^$&");
 }
-const ne = /^epubcfi\((.*)\)$/, w = (e) => e.nodeType === Node.ELEMENT_NODE, b = (e) => typeof e == "object" && e !== null && "nodeType" in e && (e.nodeType === Node.ELEMENT_NODE || e.nodeType === Node.TEXT_NODE), te = (e) => e.nodeType === Node.TEXT_NODE;
-function re(e) {
-  const t = e.match(ne);
+const te = /^epubcfi\((.*)\)$/, w = (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), re = (e) => e.nodeType === Node.TEXT_NODE;
+function ie(e) {
+  const t = e.match(te);
   return t && t[1] || e;
 }
-function ie(e) {
+function se(e) {
   const t = [];
   let n = null, i = !1, r = "";
   const o = (c) => {
     t.push(c), n = null, r = "";
   }, l = (c) => {
     r += c, i = !1;
-  }, f = re(e).trim(), d = Array.from(f).concat("");
-  for (let c = 0; c < d.length; c++) {
-    const s = d[c];
+  }, f = ie(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]);
       break;
@@ -113,77 +113,77 @@ function U(e, t) {
     n.push(e.slice(i, r)), i = r;
   return n.push(e.slice(i)), n;
 }
-function se(e) {
+function oe(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, d] = l;
-    f === "/" ? (i++, t[i] = { index: d }, n[i] = []) : i >= 0 && ((r = n[i]) == null || r.push(l));
+    const [f, a] = l;
+    f === "/" ? (i++, t[i] = { index: a }, 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 f = n[o] || [];
-    for (let d = 0; d < f.length; d++) {
-      const c = f[d];
+    for (let a = 0; a < f.length; a++) {
+      const c = f[a];
       if (!c) continue;
-      const [s, a] = c;
+      const [s, d] = c;
       if (s === ":")
-        l.offset = a;
+        l.offset = d;
       else if (s === "~")
-        l.temporal = a;
+        l.temporal = d;
       else if (s === "@")
-        l.spatial = (l.spatial || []).concat(a);
+        l.spatial = (l.spatial || []).concat(d);
       else if (s === ";s")
-        l.side = a;
+        l.side = d;
       else if (s.startsWith(";") && s !== ";s") {
         const u = s.substring(1);
-        l.extensions || (l.extensions = {}), l.extensions[u] = a;
+        l.extensions || (l.extensions = {}), l.extensions[u] = d;
       } 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 x = a.split(",").map((h) => h.trim());
-          l.text = x;
+        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;
         }
       }
     }
   }
   return t;
 }
-function I(e) {
+function T(e) {
   const t = H(e, "!");
-  return U(e, t).map(se);
+  return U(e, t).map(oe);
 }
-function p(e) {
+function O(e) {
   if (!e)
     throw new Error("CFI string cannot be empty");
-  const t = ie(e);
+  const t = se(e);
   if (!t || t.length === 0)
     throw new Error("Failed to tokenize CFI string");
   const n = H(t, ",");
   if (n.length === 0)
-    return I(t);
+    return T(t);
   const [i, r, o] = U(t, n);
   return {
-    parent: I(i || []),
-    start: I(r || []),
-    end: I(o || [])
+    parent: T(i || []),
+    start: T(r || []),
+    end: T(o || [])
   };
 }
-function M(e) {
+function P(e) {
   return e !== null && typeof e == "object" && "parent" in e && "start" in e && "end" in e;
 }
-function ue(e, t, n = {}) {
+function he(e, t, n = {}) {
   try {
     if (typeof e != "string")
       return D(e, t, n);
-    const i = p(e);
-    return n.asRange && M(i) ? V(i, t) : D(i, t, n);
+    const i = O(e);
+    return n.asRange && P(i) ? G(i, t) : D(i, t, n);
   } catch (i) {
     if (n.throwOnError)
       throw i;
@@ -192,31 +192,31 @@ function ue(e, t, n = {}) {
 }
 function D(e, t, n = { asRange: !1 }) {
   const { asRange: i = !1 } = n;
-  if (M(e)) {
+  if (P(e)) {
     if (i)
-      return V(e, t);
+      return G(e, t);
     const r = e.start[0] || [];
-    return m(r, t, n);
+    return y(r, t, n);
   }
   if (e[0])
-    return m(e[0], t, n);
+    return y(e[0], t, n);
   throw new Error("Invalid CFI structure");
 }
-function V(e, t) {
+function G(e, t) {
   const n = e.parent[0] || [], i = e.start[0] || [], r = e.end[0] || [];
   let o = t.documentElement;
   if (n.length > 0) {
-    const a = m(n, t);
-    b(a.node) && (o = a.node);
+    const d = y(n, t);
+    p(d.node) && (o = d.node);
   }
   if (!o)
     throw new Error("Failed to resolve parent node in CFI range");
-  const l = m(i, t), f = m(r, t);
-  if (!b(l.node) || !b(f.node))
+  const l = y(i, t), f = y(r, t);
+  if (!p(l.node) || !p(f.node))
     throw new Error("Failed to resolve start or end node in CFI range");
-  const d = l.node, c = f.node, s = t.createRange();
+  const a = l.node, c = f.node, s = t.createRange();
   return s.setStart(
-    d,
+    a,
     (Array.isArray(l.offset) ? l.offset[0] : l.offset) ?? 0
   ), s.setEnd(
     c,
@@ -227,7 +227,7 @@ function V(e, t) {
     isRange: !0
   };
 }
-function oe(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];
@@ -241,12 +241,12 @@ function oe(e) {
 function S(e) {
   return e.index % 2 !== 0;
 }
-function he(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 G(e) {
-  const t = oe(e), n = e == null ? void 0 : e.extensions;
+function J(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,
@@ -255,25 +255,25 @@ function G(e) {
     extensions: n
   };
 }
-function N(e, t) {
+function E(e, t) {
   return {
     node: e,
     isRange: !1,
-    ...G(t)
+    ...J(t)
   };
 }
-function T(e, t) {
+function v(e, t) {
   return {
     node: e,
     isRange: !0,
-    ...G(t)
+    ...J(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;
-    te(t) && i.setStart(t, r || 0);
+    re(t) && i.setStart(t, r || 0);
   }
   return i;
 }
@@ -295,9 +295,9 @@ function X(e, t, n, i) {
     } 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];
+      ), a = Math.floor(l.index / 2) - 1;
+      if (a >= 0 && a < f.length) {
+        const c = f[a];
         c && (r = c);
       } else {
         if (i)
@@ -309,68 +309,68 @@ function X(e, t, n, i) {
   }
   return r;
 }
-function m(e, t, n = {}) {
+function y(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 E(null);
   }
-  const { node: o, remainingPathIndex: l } = le(t, e);
+  const { node: o, remainingPathIndex: l } = fe(t, e);
   if (o && l >= e.length) {
     const s = e.at(-1);
     if (s && S(s)) {
-      const a = s.index - 1;
-      if (a >= 0 && a < o.childNodes.length) {
-        const u = o.childNodes[a];
-        return N(u, s);
+      const d = s.index - 1;
+      if (d >= 0 && d < o.childNodes.length) {
+        const u = o.childNodes[d];
+        return E(u, s);
       }
     }
     if (r) {
-      const a = W(t, o, s == null ? void 0 : s.offset);
-      return T(a, s);
+      const d = W(t, o, s == null ? void 0 : s.offset);
+      return v(d, s);
     }
-    return N(o, s);
+    return E(o, s);
   }
   let f = o || t.documentElement;
-  const d = o ? l : 0;
+  const a = o ? l : 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);
+        return u.setStart(f, 0), u.setEnd(f, 0), v(u, s);
       }
-      const a = X(
+      const d = X(
         f,
         e.slice(0, -1),
-        d,
+        a,
         i
       );
-      if (a) {
-        const u = Array.from(a.childNodes).filter(
-          (h) => h.nodeType === Node.ELEMENT_NODE
+      if (d) {
+        const u = Array.from(d.childNodes).filter(
+          (x) => x.nodeType === Node.ELEMENT_NODE
         );
         if (Math.floor(s.index / 2) - 1 === u.length) {
-          const h = t.createRange();
-          return h.selectNodeContents(a), h.collapse(!1), T(h, s);
+          const x = t.createRange();
+          return x.selectNodeContents(d), x.collapse(!1), v(x, s);
         }
       }
     }
   }
-  if (f = X(f, e, d, i), !f) {
+  if (f = X(f, e, a, i), !f) {
     if (i)
       throw new Error("Failed to resolve CFI path");
-    return N(null);
+    return E(null);
   }
   const c = e.at(-1);
   if (r) {
     const s = W(t, f, c == null ? void 0 : c.offset);
-    return T(s, c);
+    return v(s, c);
   }
-  return N(f, c);
+  return E(f, c);
 }
-function le(e, t) {
+function fe(e, t) {
   for (let n = t.length - 1; n >= 0; n--) {
     const i = t[n];
     if (i != null && i.id) {
@@ -380,7 +380,7 @@ function le(e, t) {
   }
   return { node: null, remainingPathIndex: 0 };
 }
-function J(e, t, n = {}) {
+function K(e, t, n = {}) {
   if (!e.textContent || e.textContent.trim() === "")
     return null;
   const i = e.textContent, r = n.textAssertionLength || 10;
@@ -390,15 +390,15 @@ function J(e, t, n = {}) {
   }
   return i.substring(0, Math.min(i.length, r));
 }
-function fe(e) {
+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 j(e, t, n) {
   let i = e;
-  return t !== void 0 && (i += `~${t}`), n !== void 0 && (i += fe(n)), i;
+  return t !== void 0 && (i += `~${t}`), n !== void 0 && (i += ce(n)), i;
 }
-function K(e, t, n) {
+function Q(e, t, n) {
   let i = e;
   if (t && (i += `[${g(t)}]`), n) {
     const r = n === "before" ? "b" : "a";
@@ -406,60 +406,56 @@ function K(e, t, n) {
   }
   return i;
 }
-function P(e, t, n = {}, i) {
-  var d;
+function M(e, t, n = {}, i) {
+  var a;
   let r = "", o = e, l = null;
-  if (e.nodeType === Node.TEXT_NODE) {
+  if ((e == null ? void 0 : 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 d = Array.from(c.childNodes).indexOf(e);
+    if (d === -1)
       throw new Error("Node not found in parent's children");
-    if (r = `/${a + 1}`, w(c) && c.id) {
-      const u = c.id, x = Array.from(((d = c.parentNode) == null ? void 0 : d.childNodes) || []);
-      r = `/${x.slice(0, x.indexOf(c) + 1).filter((y) => y.nodeType === Node.ELEMENT_NODE).length * 2}[${g(u)}]${r}`, o = c.parentNode;
+    if (r = `/${d + 1}`, w(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((I) => I.nodeType === Node.ELEMENT_NODE).length * 2}[${g(u)}]${r}`, o = c.parentNode;
     } else
       o = c;
   }
   let f = null;
-  for (l && n.includeTextAssertions && (f = J(l, t, n)); o != null && o.parentNode; ) {
+  for (l && n.includeTextAssertions && (f = K(l, t, n)); o != null && o.parentNode; ) {
     if (!(l && o === l.parentNode && r.includes(`[${w(o) ? o.id : ""}]`))) {
-      const c = o.parentNode, s = Array.from(c.childNodes), a = s.indexOf(o);
-      if (a === -1)
+      const c = o.parentNode, s = Array.from(c.childNodes), d = s.indexOf(o);
+      if (d === -1)
         throw new Error("Node not found in parent's children");
-      const u = s.slice(0, a + 1).filter(($) => $.nodeType === Node.ELEMENT_NODE);
-      let x;
-      o.nodeType, Node.ELEMENT_NODE, x = u.length;
-      const h = x * 2;
-      w(o) && o.id ? r = `/${h}[${g(o.id)}]${r}` : r = `/${h}${r}`;
+      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;
+      w(o) && o.id ? r = `/${x}[${g(o.id)}]${r}` : r = `/${x}${r}`;
     }
     if (o.parentNode.nodeName.toLowerCase() === "html")
       break;
     o = o.parentNode;
   }
-  if (t !== void 0 && (r += `:${t}`), r = j(
+  return t !== void 0 && (r += `:${t}`), r = j(
     r,
     i == null ? void 0 : i.temporal,
     (i == null ? void 0 : i.spatial) || n.spatialOffset
-  ), r = K(r, f, n.includeSideBias), n.extensions && Object.keys(n.extensions).length > 0) {
-    const c = O(n.extensions);
-    r.includes("[") ? r = r.replace(/\]$/, `;${c}]`) : r = `${r}[;${c}]`;
-  }
-  return r;
+  ), r = Q(r, f, n.includeSideBias), r = N(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;
+    let a = n !== void 0 ? `:${n}` : "";
+    return a = j(a, r == null ? void 0 : r.temporal, r == null ? void 0 : r.spatial), a;
   }
   const o = [];
   let l = t;
   for (; l && l !== e; ) {
-    const d = l.parentNode;
-    if (!d) break;
-    const c = d.childNodes;
+    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) {
@@ -468,29 +464,39 @@ function z(e, t, n, i = {}, r) {
       }
     if (s === -1)
       throw new Error("Node not found in parent's children");
-    const a = s + 1;
-    w(l) && l.id ? o.unshift(`/${a}[${g(l.id)}]`) : o.unshift(`/${a}`), l = d;
+    const d = s + 1;
+    w(l) && l.id ? o.unshift(`/${d}[${g(l.id)}]`) : o.unshift(`/${d}`), l = a;
   }
   let f = o.join("");
   if (n !== void 0 && (f += `:${n}`), f = j(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(
+    const a = K(t, n, i);
+    f = Q(
       f,
-      d,
+      a,
       i.includeSideBias
     );
   }
-  return f = ce(f, i.extensions), f;
+  return f = N(f, i.extensions), f;
 }
-const O = (e) => Object.entries(e).map(([t, n]) => `${t}=${encodeURIComponent(g(n))}`).join(";");
-function ce(e, t) {
-  return !t || Object.keys(t).length === 0 ? e : e.endsWith("]") ? `${e.substring(0, e.length - 1)}[;${O(t)}]` : `${e}[;${O(t)}]`;
+const ae = (e) => Object.entries(e).map(([t, n]) => {
+  const i = g(n);
+  return `${t}=${encodeURIComponent(i)}`;
+}).join(";");
+function N(e, t) {
+  if (!t || Object.keys(t).length === 0)
+    return e;
+  const n = ae(t);
+  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 e.endsWith("!") ? e : `${e}[;${n}]`;
 }
-function ae(e, t, n, i, r = {}, o, l) {
-  const f = Z(e, n);
+function de(e, t, n, i, r = {}, o, l) {
+  const f = ee(e, n);
   if (!f)
     throw new Error("No common ancestor found");
-  const d = P(f, void 0, r), c = z(
+  const a = M(f, void 0, r), c = z(
     f,
     e,
     t,
@@ -504,84 +510,97 @@ function ae(e, t, n, i, r = {}, o, l) {
     l
   );
   if (r.extensions && Object.keys(r.extensions).length > 0) {
-    const a = O(r.extensions), u = d.includes(`;${a}`) ? d : d.includes("[") ? d.replace(/\]$/, `;${a}]`) : `${d}[;${a}]`, x = c.includes(`;${a}`) ? c : c.includes("[") ? c.replace(/\]$/, `;${a}]`) : `${c}[;${a}]`, h = s.includes(`;${a}`) ? s : s.includes("[") ? s.replace(/\]$/, `;${a}]`) : `${s}[;${a}]`;
-    return `${u},${x},${h}`;
-  }
-  return `${d},${c},${s}`;
-}
-function xe(e, t = {}) {
-  if (b(e))
-    return `epubcfi(${P(e, void 0, t)})`;
-  if ("node" in e && !("start" in e)) {
-    let n = "";
-    return e.spineIndex !== void 0 && (n = `/6/${(e.spineIndex + 1) * 2}`, e.spineId && (n += `[${g(e.spineId)}]`), n += "!"), n += P(e.node, e.offset, t, e), `epubcfi(${n})`;
+    const d = N(a, r.extensions), u = N(c, r.extensions), h = N(s, r.extensions);
+    return `${d},${u},${h}`;
   }
-  if ("start" in e && "end" in e) {
-    const { start: n, end: i } = e;
-    let r = "";
-    return n.spineIndex !== void 0 && (r = `/6/${(n.spineIndex + 1) * 2}`, n.spineId && (r += `[${g(n.spineId)}]`), r += "!"), r += ae(
-      n.node,
-      n.offset ?? 0,
-      i.node,
-      i.offset ?? 0,
+  return `${a},${c},${s}`;
+}
+const Y = (e, t, n = {}, i) => {
+  const r = "";
+  let l = `/6/${(e + 1) * 2}`;
+  return t && (l += `[${g(t)}]`), l = i ? N(l, n.extensions) : l, `${l}${r}!`;
+};
+function ge(e, t = {}) {
+  if (p(e))
+    return `epubcfi(${M(e, void 0, t)})`;
+  let n = "";
+  if (!("start" in e))
+    return e.spineIndex !== void 0 && (n = Y(
+      e.spineIndex,
+      e.spineId,
       t,
-      n,
-      i
-    ), `epubcfi(${r})`;
-  }
-  throw new Error(
-    "Invalid argument: expected Node, CfiPosition, or {start, end} object"
-  );
+      !e.node
+    ), !e.node) ? `epubcfi(${n})` : (n += M(
+      e.node ?? null,
+      e.offset,
+      t,
+      e
+    ), `epubcfi(${n})`);
+  const { start: i, end: r } = e;
+  return i.spineIndex !== void 0 && (n = Y(
+    i.spineIndex,
+    i.spineId,
+    t,
+    !i.node
+  )), i.node && r.node && (n += de(
+    i.node,
+    i.offset ?? 0,
+    r.node,
+    r.offset ?? 0,
+    t,
+    i,
+    r
+  )), `epubcfi(${n})`;
 }
-function E(e, t = !1) {
-  return typeof e == "string" ? E(p(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(O(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 q(e, t) {
   var r, o, l, f;
-  const n = typeof e == "string" ? p(e) : e, i = typeof t == "string" ? p(t) : t;
+  const n = typeof e == "string" ? O(e) : e, i = typeof t == "string" ? O(t) : t;
   if ("parent" in n || "parent" in i)
-    return q(E(n), E(i)) || q(E(n, !0), E(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 x = c[u], h = s[u];
-      if (!x) return -1;
-      if (!h) return 1;
-      const $ = Y(x), y = Y(h);
-      if ($ !== y)
-        return $ - y;
-      if (x.index > h.index) return 1;
-      if (x.index < h.index) return -1;
-      const R = x.temporal !== void 0, k = h.temporal !== void 0;
+    return q(m(n), m(i)) || q(m(n, !0), m(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 $ = V(h), I = V(x);
+      if ($ !== I)
+        return $ - I;
+      if (h.index > x.index) return 1;
+      if (h.index < x.index) return -1;
+      const R = h.temporal !== void 0, k = x.temporal !== void 0;
       if (R && !k) return 1;
       if (!R && k) return -1;
       if (R && k) {
-        if ((x.temporal ?? 0) > (h.temporal ?? 0)) return 1;
-        if ((x.temporal ?? 0) < (h.temporal ?? 0)) return -1;
+        if ((h.temporal ?? 0) > (x.temporal ?? 0)) return 1;
+        if ((h.temporal ?? 0) < (x.temporal ?? 0)) return -1;
       }
-      const A = x.spatial !== void 0, C = h.spatial !== void 0;
+      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 = x.spatial) == null ? void 0 : r[1]) ?? 0, _ = ((o = h.spatial) == null ? void 0 : o[1]) ?? 0;
-        if (F > _) return 1;
-        if (F < _) return -1;
-        const B = ((l = x.spatial) == null ? void 0 : l[0]) ?? 0, L = ((f = h.spatial) == null ? void 0 : f[0]) ?? 0;
-        if (B > L) return 1;
-        if (B < L) return -1;
+        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;
       }
-      if (u === a) {
-        if ((x.offset ?? 0) > (h.offset ?? 0)) return 1;
-        if ((x.offset ?? 0) < (h.offset ?? 0)) return -1;
+      if (u === d) {
+        if ((h.offset ?? 0) > (x.offset ?? 0)) return 1;
+        if ((h.offset ?? 0) < (x.offset ?? 0)) return -1;
       }
     }
   }
   return 0;
 }
-function de(e) {
+function ue(e) {
   let t = `/${e.index}`;
   if (e.id) {
     if (t += `[${g(e.id)}`, e.extensions)
@@ -596,22 +615,22 @@ function de(e) {
       n.push(`;${i}=${g(r)}`);
   return n.length > 0 && (t += `[${n.join("")}]`), t;
 }
-function v(e) {
-  return e.map((t) => de(t)).join("");
+function b(e) {
+  return e.map((t) => ue(t)).join("");
 }
-function ge(e) {
+function Ne(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 {
   q as compare,
-  xe as generate,
-  M as isParsedCfiRange,
-  p as parse,
-  ue as resolve,
-  he as resolveExtensions,
-  ge as serialize
+  ge as generate,
+  P as isParsedCfiRange,
+  O as parse,
+  he as resolve,
+  xe as resolveExtensions,
+  Ne as serialize
 };
 //# sourceMappingURL=index.js.map