@treinetic/treinetic-epub-reader 2.0.0 → 2.0.1

package/dist/treinetic-epub-reader.es.js

@@ -1,6 +1,6 @@
 var Zt = Object.defineProperty;
-var Mt = (G, l, e) => l in G ? Zt(G, l, { enumerable: !0, configurable: !0, writable: !0, value: e }) : G[l] = e;
-var $ = (G, l, e) => Mt(G, typeof l != "symbol" ? l + "" : l, e);
+var Mt = (H, l, e) => l in H ? Zt(H, l, { enumerable: !0, configurable: !0, writable: !0, value: e }) : H[l] = e;
+var $ = (H, l, e) => Mt(H, typeof l != "symbol" ? l + "" : l, e);
 const zt = () => {
   try {
     return window.localStorage ? (localStorage.setItem("_isLocalStorageEnabled", "?"), localStorage.removeItem("_isLocalStorageEnabled"), !0) : !1;
@@ -8,32 +8,32 @@ const zt = () => {
     return !1;
   }
 }, Ct = {
-  put: (G, l, e) => {
+  put: (H, l, e) => {
     if (!zt()) {
       e && e();
       return;
     }
     const p = JSON.stringify(l);
-    localStorage.setItem(G, p), e && e();
+    localStorage.setItem(H, p), e && e();
   },
-  clear: (G, l) => {
+  clear: (H, l) => {
     if (!zt()) {
       l && l();
       return;
     }
-    localStorage.removeItem(G), l && l();
+    localStorage.removeItem(H), l && l();
   },
-  get: (G, l) => {
+  get: (H, l) => {
     if (!zt())
       return l && l(null), null;
-    const e = localStorage.getItem(G), p = e ? JSON.parse(e) : null;
+    const e = localStorage.getItem(H), p = e ? JSON.parse(e) : null;
     return l && l(p), p;
   },
-  getMultiple: (G, l) => {
+  getMultiple: (H, l) => {
     if (!zt())
       return l && l({}), {};
     const e = {};
-    for (const p of G) {
+    for (const p of H) {
       const u = localStorage.getItem(p);
       u && (e[p] = u);
     }
@@ -122,20 +122,20 @@ const zt = () => {
 $(kt, "instance");
 let Pt = kt;
 const wt = {
-  updateReader: (G, l) => {
-    if (G) {
-      if (G.updateSettings(l), l.theme) {
+  updateReader: (H, l) => {
+    if (H) {
+      if (H.updateSettings(l), l.theme) {
         document.documentElement.setAttribute("data-theme", l.theme);
         const e = wt.getBookStyles(l.theme);
-        G.setBookStyles(e);
+        H.setBookStyles(e);
         const p = document.querySelector("#reader-wrapper");
         p && e[0].declarations.backgroundColor && (p.style.backgroundColor = e[0].declarations.backgroundColor);
       }
       Ct.put("reader", l);
     }
   },
-  getBookStyles: (G) => {
-    const l = G === "author-theme", e = wt.getPropertyFromThemeClass(G, "background-color"), p = wt.getPropertyFromThemeClass(G, "color"), u = wt.getPropertyFromThemeClass(G, "font-family");
+  getBookStyles: (H) => {
+    const l = H === "author-theme", e = wt.getPropertyFromThemeClass(H, "background-color"), p = wt.getPropertyFromThemeClass(H, "color"), u = wt.getPropertyFromThemeClass(H, "font-family");
     return [{
       selector: ":not(a):not(hypothesis-highlight)",
       declarations: {
@@ -151,8 +151,8 @@ const wt = {
       }
     }];
   },
-  getPropertyFromThemeClass: (G, l) => {
-    const e = Pt.getInstance().getTheme(G);
+  getPropertyFromThemeClass: (H, l) => {
+    const e = Pt.getInstance().getTheme(H);
     return e ? e.properties[l] : null;
   }
 }, vt = class vt {
@@ -256,32 +256,32 @@ const ft = {
   init: () => {
     document.addEventListener("keydown", ft.handleKey);
   },
-  on: (G, l, e) => {
-    const p = `${l}:${G} `;
+  on: (H, l, e) => {
+    const p = `${l}:${H} `;
     ft.handlers[p] || (ft.handlers[p] = []), ft.handlers[p].push(e);
   },
-  handleKey: (G) => {
+  handleKey: (H) => {
     let l = "";
-    G.key === "ArrowRight" && (l = "PageNext"), G.key === "ArrowLeft" && (l = "PagePrevious"), l && ft.dispatch(l);
+    H.key === "ArrowRight" && (l = "PageNext"), H.key === "ArrowLeft" && (l = "PagePrevious"), l && ft.dispatch(l);
   },
-  dispatch: (G) => {
-    const l = `${ft.scope}:${G} `;
+  dispatch: (H) => {
+    const l = `${ft.scope}:${H} `;
     ft.handlers[l] && ft.handlers[l].forEach((e) => e());
   },
   // Constants matching legacy
   PagePrevious: "PagePrevious",
   PageNext: "PageNext",
   NightTheme: "NightTheme",
-  applySettings: (G) => {
+  applySettings: (H) => {
   }
 };
 ft.init();
 var Ot = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
-function Ht(G) {
-  return G && G.__esModule && Object.prototype.hasOwnProperty.call(G, "default") ? G.default : G;
+function Ht(H) {
+  return H && H.__esModule && Object.prototype.hasOwnProperty.call(H, "default") ? H.default : H;
 }
-function Tt(G) {
-  throw new Error('Could not dynamically require "' + G + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
+function Tt(H) {
+  throw new Error('Could not dynamically require "' + H + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
 }
 var Nt = { exports: {} };
 /*!
@@ -295,9 +295,9 @@ Dual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/js
 JSZip uses the library pako released under the MIT license :
 https://github.com/nodeca/pako/blob/main/LICENSE
 */
-(function(G, l) {
+(function(H, l) {
   (function(e) {
-    G.exports = e();
+    H.exports = e();
   })(function() {
     return function e(p, u, s) {
       function o(w, b) {
@@ -1671,7 +1671,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         t.pending_buf[t.pending++] = F >>> 8 & 255, t.pending_buf[t.pending++] = 255 & F;
       }
       function q(t, F) {
-        var O, m, d = t.max_chain_length, S = t.strstart, L = t.prev_length, N = t.nice_match, A = t.strstart > t.w_size - X ? t.strstart - (t.w_size - X) : 0, Z = t.window, K = t.w_mask, H = t.prev, Y = t.strstart + M, st = Z[S + L - 1], nt = Z[S + L];
+        var O, m, d = t.max_chain_length, S = t.strstart, L = t.prev_length, N = t.nice_match, A = t.strstart > t.w_size - X ? t.strstart - (t.w_size - X) : 0, Z = t.window, K = t.w_mask, G = t.prev, Y = t.strstart + M, st = Z[S + L - 1], nt = Z[S + L];
         t.prev_length >= t.good_match && (d >>= 2), N > t.lookahead && (N = t.lookahead);
         do
           if (Z[(O = F) + L] === nt && Z[O + L - 1] === st && Z[O] === Z[S] && Z[++O] === Z[S + 1]) {
@@ -1684,16 +1684,16 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               st = Z[S + L - 1], nt = Z[S + L];
             }
           }
-        while ((F = H[F & K]) > A && --d != 0);
+        while ((F = G[F & K]) > A && --d != 0);
         return L <= t.lookahead ? L : t.lookahead;
       }
       function at(t) {
-        var F, O, m, d, S, L, N, A, Z, K, H = t.w_size;
+        var F, O, m, d, S, L, N, A, Z, K, G = t.w_size;
         do {
-          if (d = t.window_size - t.lookahead - t.strstart, t.strstart >= H + (H - X)) {
-            for (o.arraySet(t.window, t.window, H, H, 0), t.match_start -= H, t.strstart -= H, t.block_start -= H, F = O = t.hash_size; m = t.head[--F], t.head[F] = H <= m ? m - H : 0, --O; ) ;
-            for (F = O = H; m = t.prev[--F], t.prev[F] = H <= m ? m - H : 0, --O; ) ;
-            d += H;
+          if (d = t.window_size - t.lookahead - t.strstart, t.strstart >= G + (G - X)) {
+            for (o.arraySet(t.window, t.window, G, G, 0), t.match_start -= G, t.strstart -= G, t.block_start -= G, F = O = t.hash_size; m = t.head[--F], t.head[F] = G <= m ? m - G : 0, --O; ) ;
+            for (F = O = G; m = t.prev[--F], t.prev[F] = G <= m ? m - G : 0, --O; ) ;
+            d += G;
           }
           if (t.strm.avail_in === 0) break;
           if (L = t.strm, N = t.window, A = t.strstart + t.lookahead, Z = d, K = void 0, K = L.avail_in, Z < K && (K = Z), O = K === 0 ? 0 : (L.avail_in -= K, o.arraySet(N, L.input, L.next_in, K, A), L.state.wrap === 1 ? L.adler = h(L.adler, N, K, A) : L.state.wrap === 2 && (L.adler = w(L.adler, N, K, A)), L.next_in += K, L.total_in += K, K), t.lookahead += O, t.lookahead + t.insert >= T) for (S = t.strstart - t.insert, t.ins_h = t.window[S], t.ins_h = (t.ins_h << t.hash_shift ^ t.window[S + 1]) & t.hash_mask; t.insert && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[S + T - 1]) & t.hash_mask, t.prev[S & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = S, S++, t.insert--, !(t.lookahead + t.insert < T)); ) ;
@@ -1819,16 +1819,16 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             }
             return A.insert = 0, Z === v ? (I(A, !0), A.strm.avail_out === 0 ? tt : W) : A.last_lit && (I(A, !1), A.strm.avail_out === 0) ? r : B;
           }(m, F) : m.strategy === 3 ? function(A, Z) {
-            for (var K, H, Y, st, nt = A.window; ; ) {
+            for (var K, G, Y, st, nt = A.window; ; ) {
               if (A.lookahead <= M) {
                 if (at(A), A.lookahead <= M && Z === _) return r;
                 if (A.lookahead === 0) break;
               }
-              if (A.match_length = 0, A.lookahead >= T && 0 < A.strstart && (H = nt[Y = A.strstart - 1]) === nt[++Y] && H === nt[++Y] && H === nt[++Y]) {
+              if (A.match_length = 0, A.lookahead >= T && 0 < A.strstart && (G = nt[Y = A.strstart - 1]) === nt[++Y] && G === nt[++Y] && G === nt[++Y]) {
                 st = A.strstart + M;
                 do
                   ;
-                while (H === nt[++Y] && H === nt[++Y] && H === nt[++Y] && H === nt[++Y] && H === nt[++Y] && H === nt[++Y] && H === nt[++Y] && H === nt[++Y] && Y < st);
+                while (G === nt[++Y] && G === nt[++Y] && G === nt[++Y] && G === nt[++Y] && G === nt[++Y] && G === nt[++Y] && G === nt[++Y] && G === nt[++Y] && Y < st);
                 A.match_length = M - (st - Y), A.match_length > A.lookahead && (A.match_length = A.lookahead);
               }
               if (A.match_length >= T ? (K = n._tr_tally(A, 1, A.match_length - T), A.lookahead -= A.match_length, A.strstart += A.match_length, A.match_length = 0) : (K = n._tr_tally(A, 0, A.window[A.strstart]), A.lookahead--, A.strstart++), K && (I(A, !1), A.strm.avail_out === 0)) return r;
@@ -2409,8 +2409,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         var N, A, Z = new Array(f + 1), K = 0;
         for (N = 1; N <= f; N++) Z[N] = K = K + L[N - 1] << 1;
         for (A = 0; A <= S; A++) {
-          var H = d[2 * A + 1];
-          H !== 0 && (d[2 * A] = at(Z[H]++, H));
+          var G = d[2 * A + 1];
+          G !== 0 && (d[2 * A] = at(Z[G]++, G));
         }
       }
       function rt(d) {
@@ -2432,14 +2432,14 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         d.heap[L] = N;
       }
       function _t(d, S, L) {
-        var N, A, Z, K, H = 0;
-        if (d.last_lit !== 0) for (; N = d.pending_buf[d.d_buf + 2 * H] << 8 | d.pending_buf[d.d_buf + 2 * H + 1], A = d.pending_buf[d.l_buf + H], H++, N === 0 ? q(d, A, S) : (q(d, (Z = r[A]) + _ + 1, S), (K = P[Z]) !== 0 && V(d, A -= B[Z], K), q(d, Z = I(--N), L), (K = U[Z]) !== 0 && V(d, N -= j[Z], K)), H < d.last_lit; ) ;
+        var N, A, Z, K, G = 0;
+        if (d.last_lit !== 0) for (; N = d.pending_buf[d.d_buf + 2 * G] << 8 | d.pending_buf[d.d_buf + 2 * G + 1], A = d.pending_buf[d.l_buf + G], G++, N === 0 ? q(d, A, S) : (q(d, (Z = r[A]) + _ + 1, S), (K = P[Z]) !== 0 && V(d, A -= B[Z], K), q(d, Z = I(--N), L), (K = U[Z]) !== 0 && V(d, N -= j[Z], K)), G < d.last_lit; ) ;
         q(d, x, S);
       }
       function gt(d, S) {
-        var L, N, A, Z = S.dyn_tree, K = S.stat_desc.static_tree, H = S.stat_desc.has_stree, Y = S.stat_desc.elems, st = -1;
+        var L, N, A, Z = S.dyn_tree, K = S.stat_desc.static_tree, G = S.stat_desc.has_stree, Y = S.stat_desc.elems, st = -1;
         for (d.heap_len = 0, d.heap_max = i, L = 0; L < Y; L++) Z[2 * L] !== 0 ? (d.heap[++d.heap_len] = st = L, d.depth[L] = 0) : Z[2 * L + 1] = 0;
-        for (; d.heap_len < 2; ) Z[2 * (A = d.heap[++d.heap_len] = st < 2 ? ++st : 0)] = 1, d.depth[A] = 0, d.opt_len--, H && (d.static_len -= K[2 * A + 1]);
+        for (; d.heap_len < 2; ) Z[2 * (A = d.heap[++d.heap_len] = st < 2 ? ++st : 0)] = 1, d.depth[A] = 0, d.opt_len--, G && (d.static_len -= K[2 * A + 1]);
         for (S.max_code = st, L = d.heap_len >> 1; 1 <= L; L--) ot(d, Z, L);
         for (A = Y; L = d.heap[1], d.heap[1] = d.heap[d.heap_len--], ot(d, Z, 1), N = d.heap[1], d.heap[--d.heap_max] = L, d.heap[--d.heap_max] = N, Z[2 * A] = Z[2 * L] + Z[2 * N], d.depth[A] = (d.depth[L] >= d.depth[N] ? d.depth[L] : d.depth[N]) + 1, Z[2 * L + 1] = Z[2 * N + 1] = A, d.heap[1] = A++, ot(d, Z, 1), 2 <= d.heap_len; ) ;
         d.heap[--d.heap_max] = d.heap[1], function(nt, mt) {
@@ -2456,21 +2456,21 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         }(d, S), dt(Z, st, d.bl_count);
       }
       function t(d, S, L) {
-        var N, A, Z = -1, K = S[1], H = 0, Y = 7, st = 4;
-        for (K === 0 && (Y = 138, st = 3), S[2 * (L + 1) + 1] = 65535, N = 0; N <= L; N++) A = K, K = S[2 * (N + 1) + 1], ++H < Y && A === K || (H < st ? d.bl_tree[2 * A] += H : A !== 0 ? (A !== Z && d.bl_tree[2 * A]++, d.bl_tree[2 * C]++) : H <= 10 ? d.bl_tree[2 * E]++ : d.bl_tree[2 * D]++, Z = A, st = (H = 0) === K ? (Y = 138, 3) : A === K ? (Y = 6, 3) : (Y = 7, 4));
+        var N, A, Z = -1, K = S[1], G = 0, Y = 7, st = 4;
+        for (K === 0 && (Y = 138, st = 3), S[2 * (L + 1) + 1] = 65535, N = 0; N <= L; N++) A = K, K = S[2 * (N + 1) + 1], ++G < Y && A === K || (G < st ? d.bl_tree[2 * A] += G : A !== 0 ? (A !== Z && d.bl_tree[2 * A]++, d.bl_tree[2 * C]++) : G <= 10 ? d.bl_tree[2 * E]++ : d.bl_tree[2 * D]++, Z = A, st = (G = 0) === K ? (Y = 138, 3) : A === K ? (Y = 6, 3) : (Y = 7, 4));
       }
       function F(d, S, L) {
-        var N, A, Z = -1, K = S[1], H = 0, Y = 7, st = 4;
-        for (K === 0 && (Y = 138, st = 3), N = 0; N <= L; N++) if (A = K, K = S[2 * (N + 1) + 1], !(++H < Y && A === K)) {
-          if (H < st) for (; q(d, A, d.bl_tree), --H != 0; ) ;
-          else A !== 0 ? (A !== Z && (q(d, A, d.bl_tree), H--), q(d, C, d.bl_tree), V(d, H - 3, 2)) : H <= 10 ? (q(d, E, d.bl_tree), V(d, H - 3, 3)) : (q(d, D, d.bl_tree), V(d, H - 11, 7));
-          Z = A, st = (H = 0) === K ? (Y = 138, 3) : A === K ? (Y = 6, 3) : (Y = 7, 4);
+        var N, A, Z = -1, K = S[1], G = 0, Y = 7, st = 4;
+        for (K === 0 && (Y = 138, st = 3), N = 0; N <= L; N++) if (A = K, K = S[2 * (N + 1) + 1], !(++G < Y && A === K)) {
+          if (G < st) for (; q(d, A, d.bl_tree), --G != 0; ) ;
+          else A !== 0 ? (A !== Z && (q(d, A, d.bl_tree), G--), q(d, C, d.bl_tree), V(d, G - 3, 2)) : G <= 10 ? (q(d, E, d.bl_tree), V(d, G - 3, 3)) : (q(d, D, d.bl_tree), V(d, G - 11, 7));
+          Z = A, st = (G = 0) === K ? (Y = 138, 3) : A === K ? (Y = 6, 3) : (Y = 7, 4);
         }
       }
       h(j);
       var O = !1;
       function m(d, S, L, N) {
-        V(d, (w << 1) + (N ? 1 : 0), 3), function(A, Z, K, H) {
+        V(d, (w << 1) + (N ? 1 : 0), 3), function(A, Z, K, G) {
           it(A), J(A, K), J(A, ~K), s.arraySet(A.pending_buf, A.window, Z, K, A.pending), A.pending += K;
         }(d, S, L);
       }
@@ -2490,20 +2490,20 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         }(), O = !0), d.l_desc = new z(d.dyn_ltree, tt), d.d_desc = new z(d.dyn_dtree, W), d.bl_desc = new z(d.bl_tree, et), d.bi_buf = 0, d.bi_valid = 0, rt(d);
       }, u._tr_stored_block = m, u._tr_flush_block = function(d, S, L, N) {
         var A, Z, K = 0;
-        0 < d.level ? (d.strm.data_type === 2 && (d.strm.data_type = function(H) {
+        0 < d.level ? (d.strm.data_type === 2 && (d.strm.data_type = function(G) {
           var Y, st = 4093624447;
-          for (Y = 0; Y <= 31; Y++, st >>>= 1) if (1 & st && H.dyn_ltree[2 * Y] !== 0) return o;
-          if (H.dyn_ltree[18] !== 0 || H.dyn_ltree[20] !== 0 || H.dyn_ltree[26] !== 0) return n;
-          for (Y = 32; Y < _; Y++) if (H.dyn_ltree[2 * Y] !== 0) return n;
+          for (Y = 0; Y <= 31; Y++, st >>>= 1) if (1 & st && G.dyn_ltree[2 * Y] !== 0) return o;
+          if (G.dyn_ltree[18] !== 0 || G.dyn_ltree[20] !== 0 || G.dyn_ltree[26] !== 0) return n;
+          for (Y = 32; Y < _; Y++) if (G.dyn_ltree[2 * Y] !== 0) return n;
           return o;
-        }(d)), gt(d, d.l_desc), gt(d, d.d_desc), K = function(H) {
+        }(d)), gt(d, d.l_desc), gt(d, d.d_desc), K = function(G) {
           var Y;
-          for (t(H, H.dyn_ltree, H.l_desc.max_code), t(H, H.dyn_dtree, H.d_desc.max_code), gt(H, H.bl_desc), Y = g - 1; 3 <= Y && H.bl_tree[2 * M[Y] + 1] === 0; Y--) ;
-          return H.opt_len += 3 * (Y + 1) + 5 + 5 + 4, Y;
-        }(d), A = d.opt_len + 3 + 7 >>> 3, (Z = d.static_len + 3 + 7 >>> 3) <= A && (A = Z)) : A = Z = L + 5, L + 4 <= A && S !== -1 ? m(d, S, L, N) : d.strategy === 4 || Z === A ? (V(d, 2 + (N ? 1 : 0), 3), _t(d, X, k)) : (V(d, 4 + (N ? 1 : 0), 3), function(H, Y, st, nt) {
+          for (t(G, G.dyn_ltree, G.l_desc.max_code), t(G, G.dyn_dtree, G.d_desc.max_code), gt(G, G.bl_desc), Y = g - 1; 3 <= Y && G.bl_tree[2 * M[Y] + 1] === 0; Y--) ;
+          return G.opt_len += 3 * (Y + 1) + 5 + 5 + 4, Y;
+        }(d), A = d.opt_len + 3 + 7 >>> 3, (Z = d.static_len + 3 + 7 >>> 3) <= A && (A = Z)) : A = Z = L + 5, L + 4 <= A && S !== -1 ? m(d, S, L, N) : d.strategy === 4 || Z === A ? (V(d, 2 + (N ? 1 : 0), 3), _t(d, X, k)) : (V(d, 4 + (N ? 1 : 0), 3), function(G, Y, st, nt) {
           var mt;
-          for (V(H, Y - 257, 5), V(H, st - 1, 5), V(H, nt - 4, 4), mt = 0; mt < nt; mt++) V(H, H.bl_tree[2 * M[mt] + 1], 3);
-          F(H, H.dyn_ltree, Y - 1), F(H, H.dyn_dtree, st - 1);
+          for (V(G, Y - 257, 5), V(G, st - 1, 5), V(G, nt - 4, 4), mt = 0; mt < nt; mt++) V(G, G.bl_tree[2 * M[mt] + 1], 3);
+          F(G, G.dyn_ltree, Y - 1), F(G, G.dyn_dtree, st - 1);
         }(d, d.l_desc.max_code + 1, d.d_desc.max_code + 1, K + 1), _t(d, d.dyn_ltree, d.dyn_dtree)), rt(d), N && it(d);
       }, u._tr_tally = function(d, S, L) {
         return d.pending_buf[d.d_buf + 2 * d.last_lit] = S >>> 8 & 255, d.pending_buf[d.d_buf + 2 * d.last_lit + 1] = 255 & S, d.pending_buf[d.l_buf + d.last_lit] = 255 & L, d.last_lit++, S === 0 ? d.dyn_ltree[2 * L]++ : (d.matches++, S--, d.dyn_ltree[2 * (r[L] + _ + 1)]++, d.dyn_dtree[2 * I(S)]++), d.last_lit === d.lit_bufsize - 1;
@@ -2771,7 +2771,7 @@ class Rt {
     };
     if (l.toLowerCase().endsWith(".epub"))
       try {
-        const v = await (await fetch(l)).blob();
+        const v = await (await fetch(l)).arrayBuffer();
         e = await qt.loadAsync(v), p = async (g) => {
           const i = e == null ? void 0 : e.file(g);
           return i ? await i.async("string") : null;
@@ -3205,43 +3205,43 @@ const ct = {
   currentPackageDocument: null,
   ebookURL_filepath: null,
   embeded: !0,
-  init: (G) => {
+  init: (H) => {
     console.log("Initializing Modern TreineticEpubReader..."), ft.init();
-    const l = document.querySelector(G);
-    if (!l) {
-      console.error(`Element ${G} not found`);
-      return;
-    }
-    return ct.initReader(l), pt.getInstance();
+    let l;
+    return typeof H == "string" ? l = document.querySelector(H) : l = H, l ? (ct.initReader(l), pt.getInstance()) : (console.error("TreineticEpubReader: Element not found", H), null);
   },
-  open: (G) => {
-    console.log("Opening: ", G);
+  /**
+   * Alias for init() to align with standard library patterns.
+   */
+  create: (H) => ct.init(H),
+  open: (H) => {
+    console.log("Opening: ", H);
     const l = ct.setReaderPreferences();
-    ct.ebookURL_filepath = G;
-    const e = ct.getOpenPageRequest(l, G);
+    ct.ebookURL_filepath = H;
+    const e = ct.getOpenPageRequest(l, H);
     let p = { syntheticSpread: "auto", scroll: "auto" };
-    ct.embeded && l && l.reader && (p = l.reader), ct.loadEpub(p, G, e);
+    ct.embeded && l && l.reader && (p = l.reader), ct.loadEpub(p, H, e);
   },
-  initReader: (G) => {
-    G.classList.add("tr-epub-reader-element");
+  initReader: (H) => {
+    H.classList.add("tr-epub-reader-element");
     const l = ct.setReaderPreferences();
-    ct.readerView = new Yt(G), ft.init(), ft.on(ft.PageNext, "reader", () => ct.nextPage()), ft.on(ft.PagePrevious, "reader", () => ct.prevPage());
+    ct.readerView = new Yt(H), ft.init(), ft.on(ft.PageNext, "reader", () => ct.nextPage()), ft.on(ft.PagePrevious, "reader", () => ct.prevPage());
     let e = { syntheticSpread: "auto", scroll: "auto" };
     ct.embeded && l && l.reader && (e = l.reader), wt.updateReader(ct.readerView, e);
   },
   handleReaderEvents: () => {
     var u, s, o;
     if (!ct.readium) return;
-    const G = ct.readium.reader, l = ((u = ReadiumSDK == null ? void 0 : ReadiumSDK.Events) == null ? void 0 : u.CONTENT_DOCUMENT_LOAD_START) || "CONTENT_DOCUMENT_LOAD_START", e = ((s = ReadiumSDK == null ? void 0 : ReadiumSDK.Events) == null ? void 0 : s.CONTENT_DOCUMENT_LOADED) || "CONTENT_DOCUMENT_LOADED", p = ((o = ReadiumSDK == null ? void 0 : ReadiumSDK.Events) == null ? void 0 : o.PAGINATION_CHANGED) || "PAGINATION_CHANGED";
-    G.on(l, (n, h) => {
+    const H = ct.readium.reader, l = ((u = ReadiumSDK == null ? void 0 : ReadiumSDK.Events) == null ? void 0 : u.CONTENT_DOCUMENT_LOAD_START) || "CONTENT_DOCUMENT_LOAD_START", e = ((s = ReadiumSDK == null ? void 0 : ReadiumSDK.Events) == null ? void 0 : s.CONTENT_DOCUMENT_LOADED) || "CONTENT_DOCUMENT_LOADED", p = ((o = ReadiumSDK == null ? void 0 : ReadiumSDK.Events) == null ? void 0 : o.PAGINATION_CHANGED) || "PAGINATION_CHANGED";
+    H.on(l, (n, h) => {
       console.log("Event: Load Start");
-    }), G.on(e, (n, h) => {
+    }), H.on(e, (n, h) => {
       console.log("Event: Loaded");
-    }), G.on(p, (n) => {
+    }), H.on(p, (n) => {
       console.log("Event: Pagination Changed"), pt.getInstance().isAutoBookmark() && ct.savePlace();
     });
   },
-  loadEpub: async (G, l, e) => {
+  loadEpub: async (H, l, e) => {
     try {
       console.log("Loading epub via modern parser:", l);
       const p = await Rt.load(l);
@@ -3255,27 +3255,27 @@ const ct = {
     }
   },
   setReaderPreferences: () => {
-    let G = Ct.get("reader") || { fontSize: 100, theme: "default-theme", scroll: "auto" };
-    return G.scroll === "scroll-continuous" && (G.scroll = "auto"), Ct.put("reader", G), { reader: G };
+    let H = Ct.get("reader") || { fontSize: 100, theme: "default-theme", scroll: "auto" };
+    return H.scroll === "scroll-continuous" && (H.scroll = "auto"), Ct.put("reader", H), { reader: H };
   },
-  getOpenPageRequest: (G, l) => null,
+  getOpenPageRequest: (H, l) => null,
   savePlace: () => {
   },
   // Public API Methods (proxied to handler/helpers)
   nextPage: () => pt.getInstance().nextPage(),
   prevPage: () => pt.getInstance().prevPage(),
-  goToPage: (G) => pt.getInstance().goToPage(G),
-  setTheme: (G) => {
-    pt.getInstance().setTheme(G);
+  goToPage: (H) => pt.getInstance().goToPage(H),
+  setTheme: (H) => {
+    pt.getInstance().setTheme(H);
   },
-  registerTheme: (G) => {
-    Pt.getInstance().registerTheme(G);
+  registerTheme: (H) => {
+    Pt.getInstance().registerTheme(H);
   },
-  setFontSize: (G) => {
-    pt.getInstance().changeFontSize(G);
+  setFontSize: (H) => {
+    pt.getInstance().changeFontSize(H);
   },
-  setScrollOption: (G) => {
-    pt.getInstance().setScrollOption(G);
+  setScrollOption: (H) => {
+    pt.getInstance().setScrollOption(H);
   },
   clearSettings: () => {
     Ct.clear("reader"), console.log("Reader settings cleared.");