@prose-reader/cfi 1.303.0 → 1.305.0

package/dist/index.js

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