@prose-reader/cfi 1.214.0 → 1.216.0

package/dist/generate.range.test.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/index.d.ts

@@ -1,6 +1,7 @@
-export { parse } from './parse';
+export { parse, type ParsedCfi, type CfiPart } from './parse';
 export { resolve } from './resolve';
 export { generate } from './generate';
 export { compare } from './compare';
-export { isParsedCfiRange, resolveExtensions } from './resolve';
+export { resolveExtensions } from './resolve';
 export { serialize } from './serialize';
+export { isIndirectionOnly, isParsedCfiRange } from './utils';

package/dist/index.js

@@ -1,13 +1,13 @@
-function Z(e) {
+function K(e) {
   const t = [e];
   let n = e;
   for (; n.parentNode; )
     t.push(n.parentNode), n = n.parentNode;
   return t;
 }
-function ee(e, t) {
+function Q(e, t) {
   if (e === t) return e;
-  const n = Z(e), i = new Set(n);
+  const n = K(e), i = new Set(n);
   let r = t;
   for (; r; ) {
     if (i.has(r))
@@ -16,27 +16,36 @@ function ee(e, t) {
   }
   return null;
 }
-const ne = /[\[\]\^,();]/g;
+const Z = /[\[\]\^,();]/g;
 function g(e) {
-  return e.replace(ne, "^$&");
+  return e.replace(Z, "^$&");
 }
-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);
+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;
+function te(e) {
+  if (M(e))
+    return !1;
+  const t = e[e.length - 1];
+  return e.length > 1 && (t === void 0 || t.length === 0);
+}
+function M(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 se(e) {
+function ie(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 = ie(e).trim(), a = Array.from(f).concat("");
+  }, 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 === "/" || 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]);
       break;
     }
     if (s === "^" && !i) {
@@ -103,17 +112,17 @@ function se(e) {
   }
   return t;
 }
-function H(e, t) {
+function q(e, t) {
   return e ? e.map((n, i) => n[0] === t ? i : null).filter((n) => n !== null) : [];
 }
-function U(e, t) {
+function H(e, t) {
   const 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 oe(e) {
+function se(e) {
   var r;
   const t = [], n = {};
   let i = -1;
@@ -155,64 +164,57 @@ function oe(e) {
   }
   return t;
 }
-function T(e) {
-  const t = H(e, "!");
-  return U(e, t).map(oe);
+function I(e) {
+  const t = q(e, "!");
+  return H(e, t).map(se);
 }
 function O(e) {
   if (!e)
     throw new Error("CFI string cannot be empty");
-  const t = se(e);
+  const t = ie(e);
   if (!t || t.length === 0)
     throw new Error("Failed to tokenize CFI string");
-  const n = H(t, ",");
+  const n = q(t, ",");
   if (n.length === 0)
-    return T(t);
-  const [i, r, o] = U(t, n);
+    return I(t);
+  const [i, r, o] = H(t, n);
   return {
-    parent: T(i || []),
-    start: T(r || []),
-    end: T(o || [])
+    parent: I(i || []),
+    start: I(r || []),
+    end: I(o || [])
   };
 }
-function P(e) {
-  return e !== null && typeof e == "object" && "parent" in e && "start" in e && "end" in e;
-}
-function he(e, t, n = {}) {
+function xe(e, t, n = {}) {
   try {
-    if (typeof e != "string")
-      return D(e, t, n);
-    const i = O(e);
-    return n.asRange && P(i) ? G(i, t) : D(i, t, n);
+    const i = typeof e != "string" ? e : O(e);
+    return oe(i, t, n);
   } catch (i) {
     if (n.throwOnError)
       throw i;
     return { node: null, isRange: !1 };
   }
 }
-function D(e, t, n = { asRange: !1 }) {
-  const { asRange: i = !1 } = n;
-  if (P(e)) {
-    if (i)
-      return G(e, t);
-    const r = e.start[0] || [];
-    return y(r, t, n);
-  }
-  if (e[0])
-    return y(e[0], t, n);
+function oe(e, t, n = { asRange: !1 }) {
+  if (M(e))
+    return le(e, t);
+  if (te(e))
+    return N(null);
+  const i = e.at(-1);
+  if (i)
+    return p(i, t, n);
   throw new Error("Invalid CFI structure");
 }
-function G(e, t) {
+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 = y(n, t);
-    p(d.node) && (o = d.node);
+    const d = p(n, t);
+    w(d.node) && (o = d.node);
   }
   if (!o)
     throw new Error("Failed to resolve parent node in CFI range");
-  const l = y(i, t), f = y(r, t);
-  if (!p(l.node) || !p(f.node))
+  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(
@@ -227,7 +229,7 @@ function G(e, t) {
     isRange: !0
   };
 }
-function le(e) {
+function fe(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 +243,12 @@ function le(e) {
 function S(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);
+function ge(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 J(e) {
-  const t = le(e), n = e == null ? void 0 : e.extensions;
+function U(e) {
+  const t = fe(e), n = e == null ? void 0 : e.extensions;
   return {
     offset: e == null ? void 0 : e.offset,
     temporal: e == null ? void 0 : e.temporal,
@@ -255,29 +257,29 @@ function J(e) {
     extensions: n
   };
 }
-function E(e, t) {
+function N(e, t) {
   return {
     node: e,
     isRange: !1,
-    ...J(t)
+    ...U(t)
   };
 }
-function v(e, t) {
+function T(e, t) {
   return {
     node: e,
     isRange: !0,
-    ...J(t)
+    ...U(t)
   };
 }
-function W(e, t, n) {
+function D(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);
+    ne(t) && i.setStart(t, r || 0);
   }
   return i;
 }
-function X(e, t, n, i) {
+function W(e, t, n, i) {
   let r = e;
   for (let o = n; o < t.length; o++) {
     const l = t[o];
@@ -309,28 +311,28 @@ function X(e, t, n, i) {
   }
   return r;
 }
-function y(e, t, n = {}) {
+function p(e, t, n = {}) {
   const { throwOnError: i = !1, asRange: r = !1 } = n;
   if (!t) {
     if (i)
       throw new Error("Document is not available");
-    return E(null);
+    return N(null);
   }
-  const { node: o, remainingPathIndex: l } = fe(t, e);
+  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 E(u, s);
+        return N(u, s);
       }
     }
     if (r) {
-      const d = W(t, o, s == null ? void 0 : s.offset);
-      return v(d, s);
+      const d = D(t, o, s == null ? void 0 : s.offset);
+      return T(d, s);
     }
-    return E(o, s);
+    return N(o, s);
   }
   let f = o || t.documentElement;
   const a = o ? l : 0;
@@ -339,9 +341,9 @@ function y(e, t, n = {}) {
     if (s && !S(s)) {
       if (s.index === 0 && f) {
         const u = t.createRange();
-        return u.setStart(f, 0), u.setEnd(f, 0), v(u, s);
+        return u.setStart(f, 0), u.setEnd(f, 0), T(u, s);
       }
-      const d = X(
+      const d = W(
         f,
         e.slice(0, -1),
         a,
@@ -353,24 +355,24 @@ function y(e, t, n = {}) {
         );
         if (Math.floor(s.index / 2) - 1 === u.length) {
           const x = t.createRange();
-          return x.selectNodeContents(d), x.collapse(!1), v(x, s);
+          return x.selectNodeContents(d), x.collapse(!1), T(x, s);
         }
       }
     }
   }
-  if (f = X(f, e, a, i), !f) {
+  if (f = W(f, e, a, i), !f) {
     if (i)
       throw new Error("Failed to resolve CFI path");
-    return E(null);
+    return N(null);
   }
   const c = e.at(-1);
   if (r) {
-    const s = W(t, f, c == null ? void 0 : c.offset);
-    return v(s, c);
+    const s = D(t, f, c == null ? void 0 : c.offset);
+    return T(s, c);
   }
-  return E(f, c);
+  return N(f, c);
 }
-function fe(e, t) {
+function ce(e, t) {
   for (let n = t.length - 1; n >= 0; n--) {
     const i = t[n];
     if (i != null && i.id) {
@@ -380,7 +382,7 @@ function fe(e, t) {
   }
   return { node: null, remainingPathIndex: 0 };
 }
-function K(e, t, n = {}) {
+function G(e, t, n = {}) {
   if (!e.textContent || e.textContent.trim() === "")
     return null;
   const i = e.textContent, r = n.textAssertionLength || 10;
@@ -390,15 +392,15 @@ function K(e, t, n = {}) {
   }
   return i.substring(0, Math.min(i.length, r));
 }
-function ce(e) {
+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 j(e, t, n) {
+function P(e, t, n) {
   let i = e;
-  return t !== void 0 && (i += `~${t}`), n !== void 0 && (i += ce(n)), i;
+  return t !== void 0 && (i += `~${t}`), n !== void 0 && (i += ae(n)), i;
 }
-function Q(e, t, n) {
+function J(e, t, n) {
   let i = e;
   if (t && (i += `[${g(t)}]`), n) {
     const r = n === "before" ? "b" : "a";
@@ -406,7 +408,7 @@ function Q(e, t, n) {
   }
   return i;
 }
-function M(e, t, n = {}, i) {
+function j(e, t, n = {}, i) {
   var a;
   let r = "", o = e, l = null;
   if ((e == null ? void 0 : e.nodeType) === Node.TEXT_NODE) {
@@ -417,15 +419,15 @@ function M(e, t, n = {}, i) {
     const d = Array.from(c.childNodes).indexOf(e);
     if (d === -1)
       throw new Error("Node not found in parent's children");
-    if (r = `/${d + 1}`, w(c) && c.id) {
+    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((I) => I.nodeType === Node.ELEMENT_NODE).length * 2}[${g(u)}]${r}`, o = c.parentNode;
+      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 = c;
   }
   let f = null;
-  for (l && n.includeTextAssertions && (f = K(l, t, n)); o != null && o.parentNode; ) {
-    if (!(l && o === l.parentNode && r.includes(`[${w(o) ? o.id : ""}]`))) {
+  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)
         throw new Error("Node not found in parent's children");
@@ -433,22 +435,22 @@ function M(e, t, n = {}, i) {
       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}`;
+      b(o) && o.id ? r = `/${x}[${g(o.id)}]${r}` : r = `/${x}${r}`;
     }
     if (o.parentNode.nodeName.toLowerCase() === "html")
       break;
     o = o.parentNode;
   }
-  return t !== void 0 && (r += `:${t}`), r = j(
+  return t !== void 0 && (r += `:${t}`), r = P(
     r,
     i == null ? void 0 : i.temporal,
     (i == null ? void 0 : i.spatial) || n.spatialOffset
-  ), r = Q(r, f, n.includeSideBias), r = N(r, n.extensions), r;
+  ), r = J(r, f, n.includeSideBias), r = m(r, n.extensions), r;
 }
-function z(e, t, n, i = {}, r) {
+function X(e, t, n, i = {}, r) {
   if (e === t) {
     let a = n !== void 0 ? `:${n}` : "";
-    return a = j(a, r == null ? void 0 : r.temporal, r == null ? void 0 : r.spatial), a;
+    return a = P(a, r == null ? void 0 : r.temporal, r == null ? void 0 : r.spatial), a;
   }
   const o = [];
   let l = t;
@@ -465,44 +467,44 @@ function z(e, t, n, i = {}, r) {
     if (s === -1)
       throw new Error("Node not found in parent's children");
     const d = s + 1;
-    w(l) && l.id ? o.unshift(`/${d}[${g(l.id)}]`) : o.unshift(`/${d}`), l = a;
+    b(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 a = K(t, n, i);
-    f = Q(
+  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,
       i.includeSideBias
     );
   }
-  return f = N(f, i.extensions), f;
+  return f = m(f, i.extensions), f;
 }
-const ae = (e) => Object.entries(e).map(([t, n]) => {
+const de = (e) => Object.entries(e).map(([t, n]) => {
   const i = g(n);
   return `${t}=${encodeURIComponent(i)}`;
 }).join(";");
-function N(e, t) {
+function m(e, t) {
   if (!t || Object.keys(t).length === 0)
     return e;
-  const n = ae(t);
+  const n = de(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 de(e, t, n, i, r = {}, o, l) {
-  const f = ee(e, n);
+function ue(e, t, n, i, r = {}, o, l) {
+  const f = Q(e, n);
   if (!f)
     throw new Error("No common ancestor found");
-  const a = M(f, void 0, r), c = z(
+  const a = j(f, void 0, r), c = X(
     f,
     e,
     t,
     r,
     o
-  ), s = z(
+  ), s = X(
     f,
     n,
     i,
@@ -510,39 +512,39 @@ function de(e, t, n, i, r = {}, o, l) {
     l
   );
   if (r.extensions && Object.keys(r.extensions).length > 0) {
-    const d = N(a, r.extensions), u = N(c, r.extensions), h = N(s, r.extensions);
+    const d = m(a, r.extensions), u = m(c, r.extensions), h = m(s, r.extensions);
     return `${d},${u},${h}`;
   }
   return `${a},${c},${s}`;
 }
-const Y = (e, t, n = {}, i) => {
+const z = (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}!`;
+  return t && (l += `[${g(t)}]`), l = i ? m(l, n.extensions) : l, `${l}${r}!`;
 };
-function ge(e, t = {}) {
-  if (p(e))
-    return `epubcfi(${M(e, void 0, t)})`;
+function Ne(e, t = {}) {
+  if (w(e))
+    return `epubcfi(${j(e, void 0, t)})`;
   let n = "";
   if (!("start" in e))
-    return e.spineIndex !== void 0 && (n = Y(
+    return e.spineIndex !== void 0 && (n = z(
       e.spineIndex,
       e.spineId,
       t,
       !e.node
-    ), !e.node) ? `epubcfi(${n})` : (n += M(
+    ), !e.node) ? `epubcfi(${n})` : (n += j(
       e.node ?? null,
       e.offset,
       t,
       e
     ), `epubcfi(${n})`);
   const { start: i, end: r } = e;
-  return i.spineIndex !== void 0 && (n = Y(
+  return i.spineIndex !== void 0 && (n = z(
     i.spineIndex,
     i.spineId,
     t,
     !i.node
-  )), i.node && r.node && (n += de(
+  )), i.node && r.node && (n += ue(
     i.node,
     i.offset ?? 0,
     r.node,
@@ -552,32 +554,32 @@ function ge(e, t = {}) {
     r
   )), `epubcfi(${n})`;
 }
-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 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) {
+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 q(e, t) {
+function V(e, t) {
   var r, o, l, f;
   const n = typeof e == "string" ? O(e) : e, i = typeof t == "string" ? O(t) : t;
   if ("parent" in n || "parent" in i)
-    return q(m(n), m(i)) || q(m(n, !0), m(i, !0));
+    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 $ = V(h), I = V(x);
-      if ($ !== I)
-        return $ - I;
+      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 R = h.temporal !== void 0, k = x.temporal !== void 0;
-      if (R && !k) return 1;
-      if (!R && k) return -1;
-      if (R && k) {
+      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;
       }
@@ -600,7 +602,7 @@ function q(e, t) {
   }
   return 0;
 }
-function ue(e) {
+function he(e) {
   let t = `/${e.index}`;
   if (e.id) {
     if (t += `[${g(e.id)}`, e.extensions)
@@ -615,22 +617,23 @@ function ue(e) {
       n.push(`;${i}=${g(r)}`);
   return n.length > 0 && (t += `[${n.join("")}]`), t;
 }
-function b(e) {
-  return e.map((t) => ue(t)).join("");
+function v(e) {
+  return e.map((t) => he(t)).join("");
 }
-function Ne(e) {
+function me(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(${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(${t},${n},${i})`;
 }
 export {
-  q as compare,
-  ge as generate,
-  P as isParsedCfiRange,
+  V as compare,
+  Ne as generate,
+  te as isIndirectionOnly,
+  M as isParsedCfiRange,
   O as parse,
-  he as resolve,
-  xe as resolveExtensions,
-  Ne as serialize
+  xe as resolve,
+  ge as resolveExtensions,
+  me as serialize
 };
 //# sourceMappingURL=index.js.map