@pristy/pristy-libvue 2.5.3 → 2.6.0

package/README.md

@@ -1,35 +1,98 @@
 # Pristy Libvue
 
-Code factoring for Pristy
+Shared Vue 3 component library for the [Pristy](https://pristy.fr/) ECM suite. Provides reusable components, services, stores, composables, and plugins used across all Pristy frontend applications.
 
-## Developing with Pristy-libvue
+## Installation
 
-Add `@pristy/pristy-libvue` package.
+```bash
+npm install @pristy/pristy-libvue
+```
+
+## Usage
 
-Then call the available classes where necessary. Be careful, there is no default class, you must use {} in the import.
+All exports use named imports:
 
-```vue
-import { AlfrescoFileService } from "@pristy/pristy-libvue"
+```js
+import { alfrescoFileService, useUserStore, TreeExplorer } from "@pristy/pristy-libvue"
 ```
 
-## Dev locally
+### What's included
+
+| Category | Examples | Count |
+|---|---|---|
+| **Components** | `TreeExplorer`, `PDFComponent`, `DynamicContentView`, `CopyOrMovePopup`, `AdvancedSearchPanel`, `ChatPanel` | ~45 |
+| **Services** | `alfrescoFileService`, `alfrescoNodeService`, `configService`, `workspaceService`, `errorService` | ~20 |
+| **Stores** (Pinia) | `useUserStore`, `useConfigStore`, `useNavigationStore`, `useFavoritesStore`, `useSearchStore` | ~15 |
+| **Composables** | `useCodeMirror`, `useMarkdownPreview`, `useCollabEditor`, `useCollabWebSocket` | 5 |
+| **Pages** | `LoginPage`, `NotFoundPages`, `ErrorPage` | 3 |
+| **Plugins** | `vueKeyCloak` | 1 |
+
+See [`src/index.js`](src/index.js) for the full list of exports.
+
+## Peer Dependencies
+
+These must be installed by the consuming application:
 
-1. In prity-libvue
+| Package | Version |
+|---|---|
+| `vue` | ^3.5 |
+| `vue-i18n` | ^11.3 |
+| `vue-router` | ^4.6 |
+| `@codemirror/*` | ^6.x (14 packages) |
+| `codemirror` | 6.0.2 |
 
+## Local Development
+
+### Build the library
+
+```bash
+npm install
+npm run build:library
 ```
+
+### Link locally to another Pristy app
+
+```bash
+# In pristy-libvue
 npm link
+
+# In the consuming app (e.g. pristy-espaces)
+npm link ../pristy-libvue
+npm run dev.link      # Uses vite.config.link.js
 ```
 
-2. In another pristy application
+After any change to pristy-libvue, rebuild with `npm run build:library` (or use `npm run build:dev` for watch mode with source maps).
 
-```
-npm link <local directory off pristy-libvue>
-```
+### Available scripts
 
-The library needs to be built by vite to be usable locally.
+| Script | Description |
+|---|---|
+| `npm run build:library` | Production build (ESM + UMD + CSS + .d.ts) |
+| `npm run build:dev` | Watch mode build with source maps |
+| `npm run analyze` | Bundle size analysis (opens stats.html) |
+| `npm run lint` | Lint and auto-fix with ESLint |
+| `npm run check` | Lint without fixing (CI mode) |
+| `npm run format` | Format with Prettier |
+| `npm run test` | Run tests with Vitest |
+| `npm run coverage` | Generate test coverage report |
 
-```
-npm run build:library
-```
+## Architecture
+
+The library follows a **Services -> Stores -> Components** pattern:
+
+- **Services** (`src/services/`): Stateless modules handling API calls and business logic
+- **Stores** (`src/stores/`): Pinia stores managing session state
+- **Components** (`src/components/`): UI presentation consuming stores
+- **Composables** (`src/composables/`): Reusable composition functions (CodeMirror, Markdown, WebSocket)
+
+## Conventions
+
+- **Icons**: Remixicon only (`ri-*` classes). No PrimeIcons.
+- **i18n**: All user-facing strings must use `$t('key')`. No hardcoded text.
+- **Imports**: Use `@/` alias for all internal imports. Never import from `@/index.js` internally.
+- **License**: Every `.vue` and `.js` file must include the AGPL-3.0 header.
+- **Comments**: English only.
+
+## License
 
-The pristy-libvue package of the package.json will be overloaded by the local library.
+[AGPL-3.0](https://www.gnu.org/licenses/agpl-3.0.html) - Copyright (C) 2022 [Jeci SARL](https://jeci.fr)

package/dist/{jszip.min-BrgORSfj.js → jszip.min-BrmBkVmG.js}

@@ -1,29 +1,32 @@
-import { c as vt, g as Bt } from "./index-DYatiWG2.js";
-function Rt(ct, wt) {
+function Bt(ut, wt) {
   for (var _ = 0; _ < wt.length; _++) {
     const N = wt[_];
     if (typeof N != "string" && !Array.isArray(N)) {
       for (const w in N)
-        if (w !== "default" && !(w in ct)) {
+        if (w !== "default" && !(w in ut)) {
           const u = Object.getOwnPropertyDescriptor(N, w);
-          u && Object.defineProperty(ct, w, u.get ? u : {
+          u && Object.defineProperty(ut, w, u.get ? u : {
             enumerable: !0,
             get: () => N[w]
           });
         }
     }
   }
-  return Object.freeze(Object.defineProperty(ct, Symbol.toStringTag, { value: "Module" }));
+  return Object.freeze(Object.defineProperty(ut, Symbol.toStringTag, { value: "Module" }));
 }
-function yt(ct) {
-  throw new Error('Could not dynamically require "' + ct + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
+var vt = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
+function Rt(ut) {
+  return ut && ut.__esModule && Object.prototype.hasOwnProperty.call(ut, "default") ? ut.default : ut;
+}
+function yt(ut) {
+  throw new Error('Could not dynamically require "' + ut + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
 }
 var xt = { exports: {} };
 var Ct;
 function Tt() {
-  return Ct || (Ct = 1, (function(ct, wt) {
+  return Ct || (Ct = 1, (function(ut, wt) {
     (function(_) {
-      ct.exports = _();
+      ut.exports = _();
     })(function() {
       return (function _(N, w, u) {
         function o(g, y) {
@@ -1465,19 +1468,19 @@ function Tt() {
           var R;
           return t && t.state ? (t.total_in = t.total_out = 0, t.data_type = a, (R = t.state).pending = 0, R.pending_out = 0, R.wrap < 0 && (R.wrap = -R.wrap), R.status = R.wrap ? m : B, t.adler = R.wrap === 2 ? 0 : 1, R.last_flush = p, n._tr_init(R), i) : $(t, d);
         }
-        function lt(t) {
+        function ft(t) {
           var R = it(t);
           return R === i && (function(A) {
             A.window_size = 2 * A.w_size, V(A.head), A.max_lazy_match = u[A.level].max_lazy, A.good_match = u[A.level].good_length, A.nice_match = u[A.level].nice_length, A.max_chain_length = u[A.level].max_chain, A.strstart = 0, A.block_start = 0, A.lookahead = 0, A.insert = 0, A.match_length = A.prev_length = I - 1, A.match_available = 0, A.ins_h = 0;
           })(t.state), R;
         }
-        function ht(t, R, A, f, s, k) {
+        function lt(t, R, A, f, s, k) {
           if (!t) return d;
           var F = 1;
           if (R === r && (R = 6), f < 0 ? (F = 0, f = -f) : 15 < f && (F = 2, f -= 16), s < 1 || v < s || A !== c || f < 8 || 15 < f || R < 0 || 9 < R || k < 0 || l < k) return $(t, d);
           f === 8 && (f = 9);
           var P = new st();
-          return (t.state = P).strm = t, P.wrap = F, P.gzhead = null, P.w_bits = f, P.w_size = 1 << P.w_bits, P.w_mask = P.w_size - 1, P.hash_bits = s + 7, P.hash_size = 1 << P.hash_bits, P.hash_mask = P.hash_size - 1, P.hash_shift = ~~((P.hash_bits + I - 1) / I), P.window = new o.Buf8(2 * P.w_size), P.head = new o.Buf16(P.hash_size), P.prev = new o.Buf16(P.w_size), P.lit_bufsize = 1 << s + 6, P.pending_buf_size = 4 * P.lit_bufsize, P.pending_buf = new o.Buf8(P.pending_buf_size), P.d_buf = 1 * P.lit_bufsize, P.l_buf = 3 * P.lit_bufsize, P.level = R, P.strategy = k, P.method = A, lt(t);
+          return (t.state = P).strm = t, P.wrap = F, P.gzhead = null, P.w_bits = f, P.w_size = 1 << P.w_bits, P.w_mask = P.w_size - 1, P.hash_bits = s + 7, P.hash_size = 1 << P.hash_bits, P.hash_mask = P.hash_size - 1, P.hash_shift = ~~((P.hash_bits + I - 1) / I), P.window = new o.Buf8(2 * P.w_size), P.head = new o.Buf16(P.hash_size), P.prev = new o.Buf16(P.w_size), P.lit_bufsize = 1 << s + 6, P.pending_buf_size = 4 * P.lit_bufsize, P.pending_buf = new o.Buf8(P.pending_buf_size), P.d_buf = 1 * P.lit_bufsize, P.l_buf = 3 * P.lit_bufsize, P.level = R, P.strategy = k, P.method = A, ft(t);
         }
         u = [new et(0, 0, 0, 0, function(t, R) {
           var A = 65535;
@@ -1492,8 +1495,8 @@ function Tt() {
           }
           return t.insert = 0, R === b ? (C(t, !0), t.strm.avail_out === 0 ? J : U) : (t.strstart > t.block_start && (C(t, !1), t.strm.avail_out), e);
         }), new et(4, 4, 8, 4, ot), new et(4, 5, 16, 8, ot), new et(4, 6, 32, 32, ot), new et(4, 4, 16, 16, Q), new et(8, 16, 32, 32, Q), new et(8, 16, 128, 128, Q), new et(8, 32, 128, 256, Q), new et(32, 128, 258, 1024, Q), new et(32, 258, 258, 4096, Q)], w.deflateInit = function(t, R) {
-          return ht(t, R, c, 15, 8, 0);
-        }, w.deflateInit2 = ht, w.deflateReset = lt, w.deflateResetKeep = it, w.deflateSetHeader = function(t, R) {
+          return lt(t, R, c, 15, 8, 0);
+        }, w.deflateInit2 = lt, w.deflateReset = ft, w.deflateResetKeep = it, w.deflateSetHeader = function(t, R) {
           return t && t.state ? t.state.wrap !== 2 ? d : (t.state.gzhead = R, i) : d;
         }, w.deflate = function(t, R) {
           var A, f, s, k;
@@ -1696,7 +1699,7 @@ function Tt() {
         w.inflateReset = S, w.inflateReset2 = x, w.inflateResetKeep = v, w.inflateInit = function(m) {
           return D(m, 15);
         }, w.inflateInit2 = D, w.inflate = function(m, B) {
-          var e, T, J, U, $, L, V, E, C, X, G, H, nt, ot, Q, et, st, it, lt, ht, t, R, A, f, s = 0, k = new u.Buf8(4), F = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
+          var e, T, J, U, $, L, V, E, C, X, G, H, nt, ot, Q, et, st, it, ft, lt, t, R, A, f, s = 0, k = new u.Buf8(4), F = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
           if (!m || !m.state || !m.output || !m.input && m.avail_in !== 0) return i;
           (e = m.state).mode === 12 && (e.mode = 13), $ = m.next_out, J = m.output, V = m.avail_out, U = m.next_in, T = m.input, L = m.avail_in, E = e.hold, C = e.bits, X = L, G = V, R = b;
           t: for (; ; ) switch (e.mode) {
@@ -1938,7 +1941,7 @@ function Tt() {
                 L--, E += T[U++] << C, C += 8;
               }
               if (et && (240 & et) == 0) {
-                for (it = Q, lt = et, ht = st; et = (s = e.lencode[ht + ((E & (1 << it + lt) - 1) >> it)]) >>> 16 & 255, st = 65535 & s, !(it + (Q = s >>> 24) <= C); ) {
+                for (it = Q, ft = et, lt = st; et = (s = e.lencode[lt + ((E & (1 << it + ft) - 1) >> it)]) >>> 16 & 255, st = 65535 & s, !(it + (Q = s >>> 24) <= C); ) {
                   if (L === 0) break t;
                   L--, E += T[U++] << C, C += 8;
                 }
@@ -1972,7 +1975,7 @@ function Tt() {
                 L--, E += T[U++] << C, C += 8;
               }
               if ((240 & et) == 0) {
-                for (it = Q, lt = et, ht = st; et = (s = e.distcode[ht + ((E & (1 << it + lt) - 1) >> it)]) >>> 16 & 255, st = 65535 & s, !(it + (Q = s >>> 24) <= C); ) {
+                for (it = Q, ft = et, lt = st; et = (s = e.distcode[lt + ((E & (1 << it + ft) - 1) >> it)]) >>> 16 & 255, st = 65535 & s, !(it + (Q = s >>> 24) <= C); ) {
                   if (L === 0) break t;
                   L--, E += T[U++] << C, C += 8;
                 }
@@ -2156,27 +2159,27 @@ function Tt() {
           for (var P = s.heap[F], z = F << 1; z <= s.heap_len && (z < s.heap_len && st(k, s.heap[z + 1], s.heap[z], s.depth) && z++, !st(k, P, s.heap[z], s.depth)); ) s.heap[F] = s.heap[z], F = z, z <<= 1;
           s.heap[F] = P;
         }
-        function lt(s, k, F) {
+        function ft(s, k, F) {
           var P, z, Z, K, M = 0;
           if (s.last_lit !== 0) for (; P = s.pending_buf[s.d_buf + 2 * M] << 8 | s.pending_buf[s.d_buf + 2 * M + 1], z = s.pending_buf[s.l_buf + M], M++, P === 0 ? H(s, z, k) : (H(s, (Z = e[z]) + p + 1, k), (K = O[Z]) !== 0 && G(s, z -= T[Z], K), H(s, Z = C(--P), F), (K = j[Z]) !== 0 && G(s, P -= L[Z], K)), M < s.last_lit; ) ;
           H(s, v, k);
         }
-        function ht(s, k) {
+        function lt(s, k) {
           var F, P, z, Z = k.dyn_tree, K = k.stat_desc.static_tree, M = k.stat_desc.has_stree, Y = k.stat_desc.elems, rt = -1;
           for (s.heap_len = 0, s.heap_max = r, F = 0; F < Y; F++) Z[2 * F] !== 0 ? (s.heap[++s.heap_len] = rt = F, s.depth[F] = 0) : Z[2 * F + 1] = 0;
           for (; s.heap_len < 2; ) Z[2 * (z = s.heap[++s.heap_len] = rt < 2 ? ++rt : 0)] = 1, s.depth[z] = 0, s.opt_len--, M && (s.static_len -= K[2 * z + 1]);
           for (k.max_code = rt, F = s.heap_len >> 1; 1 <= F; F--) it(s, Z, F);
           for (z = Y; F = s.heap[1], s.heap[1] = s.heap[s.heap_len--], it(s, Z, 1), P = s.heap[1], s.heap[--s.heap_max] = F, s.heap[--s.heap_max] = P, Z[2 * z] = Z[2 * F] + Z[2 * P], s.depth[z] = (s.depth[F] >= s.depth[P] ? s.depth[F] : s.depth[P]) + 1, Z[2 * F + 1] = Z[2 * P + 1] = z, s.heap[1] = z++, it(s, Z, 1), 2 <= s.heap_len; ) ;
-          s.heap[--s.heap_max] = s.heap[1], (function(tt, ut) {
-            var pt, ft, mt, at, gt, kt, dt = ut.dyn_tree, St = ut.max_code, At = ut.stat_desc.static_tree, It = ut.stat_desc.has_stree, Ot = ut.stat_desc.extra_bits, zt = ut.stat_desc.extra_base, _t = ut.stat_desc.max_length, bt = 0;
+          s.heap[--s.heap_max] = s.heap[1], (function(tt, ht) {
+            var pt, dt, mt, at, gt, kt, ct = ht.dyn_tree, St = ht.max_code, At = ht.stat_desc.static_tree, It = ht.stat_desc.has_stree, Ot = ht.stat_desc.extra_bits, zt = ht.stat_desc.extra_base, _t = ht.stat_desc.max_length, bt = 0;
             for (at = 0; at <= l; at++) tt.bl_count[at] = 0;
-            for (dt[2 * tt.heap[tt.heap_max] + 1] = 0, pt = tt.heap_max + 1; pt < r; pt++) _t < (at = dt[2 * dt[2 * (ft = tt.heap[pt]) + 1] + 1] + 1) && (at = _t, bt++), dt[2 * ft + 1] = at, St < ft || (tt.bl_count[at]++, gt = 0, zt <= ft && (gt = Ot[ft - zt]), kt = dt[2 * ft], tt.opt_len += kt * (at + gt), It && (tt.static_len += kt * (At[2 * ft + 1] + gt)));
+            for (ct[2 * tt.heap[tt.heap_max] + 1] = 0, pt = tt.heap_max + 1; pt < r; pt++) _t < (at = ct[2 * ct[2 * (dt = tt.heap[pt]) + 1] + 1] + 1) && (at = _t, bt++), ct[2 * dt + 1] = at, St < dt || (tt.bl_count[at]++, gt = 0, zt <= dt && (gt = Ot[dt - zt]), kt = ct[2 * dt], tt.opt_len += kt * (at + gt), It && (tt.static_len += kt * (At[2 * dt + 1] + gt)));
             if (bt !== 0) {
               do {
                 for (at = _t - 1; tt.bl_count[at] === 0; ) at--;
                 tt.bl_count[at]--, tt.bl_count[at + 1] += 2, tt.bl_count[_t]--, bt -= 2;
               } while (0 < bt);
-              for (at = _t; at !== 0; at--) for (ft = tt.bl_count[at]; ft !== 0; ) St < (mt = tt.heap[--pt]) || (dt[2 * mt + 1] !== at && (tt.opt_len += (at - dt[2 * mt + 1]) * dt[2 * mt], dt[2 * mt + 1] = at), ft--);
+              for (at = _t; at !== 0; at--) for (dt = tt.bl_count[at]; dt !== 0; ) St < (mt = tt.heap[--pt]) || (ct[2 * mt + 1] !== at && (tt.opt_len += (at - ct[2 * mt + 1]) * ct[2 * mt], ct[2 * mt + 1] = at), dt--);
             }
           })(s, k), ot(Z, rt, s.bl_count);
         }
@@ -2221,15 +2224,15 @@ function Tt() {
             if (M.dyn_ltree[18] !== 0 || M.dyn_ltree[20] !== 0 || M.dyn_ltree[26] !== 0) return n;
             for (Y = 32; Y < p; Y++) if (M.dyn_ltree[2 * Y] !== 0) return n;
             return o;
-          })(s)), ht(s, s.l_desc), ht(s, s.d_desc), K = (function(M) {
+          })(s)), lt(s, s.l_desc), lt(s, s.d_desc), K = (function(M) {
             var Y;
-            for (t(M, M.dyn_ltree, M.l_desc.max_code), t(M, M.dyn_dtree, M.d_desc.max_code), ht(M, M.bl_desc), Y = d - 1; 3 <= Y && M.bl_tree[2 * W[Y] + 1] === 0; Y--) ;
+            for (t(M, M.dyn_ltree, M.l_desc.max_code), t(M, M.dyn_dtree, M.d_desc.max_code), lt(M, M.bl_desc), Y = d - 1; 3 <= Y && M.bl_tree[2 * W[Y] + 1] === 0; Y--) ;
             return M.opt_len += 3 * (Y + 1) + 5 + 5 + 4, Y;
-          })(s), z = s.opt_len + 3 + 7 >>> 3, (Z = s.static_len + 3 + 7 >>> 3) <= z && (z = Z)) : z = Z = F + 5, F + 4 <= z && k !== -1 ? f(s, k, F, P) : s.strategy === 4 || Z === z ? (G(s, 2 + (P ? 1 : 0), 3), lt(s, q, m)) : (G(s, 4 + (P ? 1 : 0), 3), (function(M, Y, rt, tt) {
-            var ut;
-            for (G(M, Y - 257, 5), G(M, rt - 1, 5), G(M, tt - 4, 4), ut = 0; ut < tt; ut++) G(M, M.bl_tree[2 * W[ut] + 1], 3);
+          })(s), z = s.opt_len + 3 + 7 >>> 3, (Z = s.static_len + 3 + 7 >>> 3) <= z && (z = Z)) : z = Z = F + 5, F + 4 <= z && k !== -1 ? f(s, k, F, P) : s.strategy === 4 || Z === z ? (G(s, 2 + (P ? 1 : 0), 3), ft(s, q, m)) : (G(s, 4 + (P ? 1 : 0), 3), (function(M, Y, rt, tt) {
+            var ht;
+            for (G(M, Y - 257, 5), G(M, rt - 1, 5), G(M, tt - 4, 4), ht = 0; ht < tt; ht++) G(M, M.bl_tree[2 * W[ht] + 1], 3);
             R(M, M.dyn_ltree, Y - 1), R(M, M.dyn_dtree, rt - 1);
-          })(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, K + 1), lt(s, s.dyn_ltree, s.dyn_dtree)), Q(s), P && et(s);
+          })(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, K + 1), ft(s, s.dyn_ltree, s.dyn_dtree)), Q(s), P && et(s);
         }, w._tr_tally = function(s, k, F) {
           return s.pending_buf[s.d_buf + 2 * s.last_lit] = k >>> 8 & 255, s.pending_buf[s.d_buf + 2 * s.last_lit + 1] = 255 & k, s.pending_buf[s.l_buf + s.last_lit] = 255 & F, s.last_lit++, k === 0 ? s.dyn_ltree[2 * F]++ : (s.matches++, k--, s.dyn_ltree[2 * (e[F] + p + 1)]++, s.dyn_dtree[2 * C(k)]++), s.last_lit === s.lit_bufsize - 1;
         }, w._tr_align = function(s) {
@@ -2322,11 +2325,11 @@ function Tt() {
   })(xt)), xt.exports;
 }
 var Et = Tt();
-const Dt = /* @__PURE__ */ Bt(Et), Nt = /* @__PURE__ */ Rt({
+const Dt = /* @__PURE__ */ Rt(Et), Ft = /* @__PURE__ */ Bt({
   __proto__: null,
   default: Dt
 }, [Et]);
 export {
-  Nt as j
+  Ft as j
 };
-//# sourceMappingURL=jszip.min-BrgORSfj.js.map
+//# sourceMappingURL=jszip.min-BrmBkVmG.js.map