@paroicms/list-field-plugin 0.1.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +9 -0
- package/backend/dist/plugin.js +15 -0
- package/bo-front/dist/bo-plugin.mjs +594 -0
- package/bo-front/dist/style.css +1 -0
- package/package.json +54 -0
- package/site-schema-lib/field-lib.site-schema.json +13 -0
- package/site-schema-lib/field-lib.site-schema.l10n.en.json +7 -0
- package/site-schema-lib/field-lib.site-schema.l10n.fr.json +7 -0
package/README.md
ADDED
|
@@ -0,0 +1,9 @@
|
|
|
1
|
+
# @paroicms/list-field-plugin
|
|
2
|
+
|
|
3
|
+
List field plugin for ParoiCMS.
|
|
4
|
+
|
|
5
|
+
This package is part of [ParoiCMS](https://www.npmjs.com/package/@paroicms/server).
|
|
6
|
+
|
|
7
|
+
## License
|
|
8
|
+
|
|
9
|
+
Released under the [MIT license](https://gitlab.com/paroi/opensource/paroicms/-/blob/main/LICENSE.md).
|
|
@@ -0,0 +1,15 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.plugin = void 0;
|
|
4
|
+
const data_formatters_lib_1 = require("@paroi/data-formatters-lib");
|
|
5
|
+
const node_path_1 = require("node:path");
|
|
6
|
+
const projectDir = (0, node_path_1.dirname)(__dirname);
|
|
7
|
+
const packageDir = (0, node_path_1.dirname)(projectDir);
|
|
8
|
+
const version = (0, data_formatters_lib_1.strVal)(require((0, node_path_1.join)(packageDir, "package.json")).version);
|
|
9
|
+
exports.plugin = {
|
|
10
|
+
version,
|
|
11
|
+
siteInit(api) {
|
|
12
|
+
api.registerSiteSchemaLibrary((0, node_path_1.join)(packageDir, "site-schema-lib"));
|
|
13
|
+
api.setBoAssetsDirectory((0, node_path_1.join)(packageDir, "bo-front", "dist"));
|
|
14
|
+
},
|
|
15
|
+
};
|
|
@@ -0,0 +1,594 @@
|
|
|
1
|
+
const re = (e, n) => e === n, oe = Symbol("solid-track"), C = {
|
|
2
|
+
equals: re
|
|
3
|
+
};
|
|
4
|
+
let Q = Z;
|
|
5
|
+
const y = 1, F = 2, W = {
|
|
6
|
+
owned: null,
|
|
7
|
+
cleanups: null,
|
|
8
|
+
context: null,
|
|
9
|
+
owner: null
|
|
10
|
+
};
|
|
11
|
+
var p = null;
|
|
12
|
+
let j = null, ue = null, a = null, d = null, g = null, k = 0;
|
|
13
|
+
function N(e, n) {
|
|
14
|
+
const t = a, s = p, l = e.length === 0, i = s, o = l ? W : {
|
|
15
|
+
owned: null,
|
|
16
|
+
cleanups: null,
|
|
17
|
+
context: i ? i.context : null,
|
|
18
|
+
owner: i
|
|
19
|
+
}, r = l ? e : () => e(() => m(() => B(o)));
|
|
20
|
+
p = o, a = null;
|
|
21
|
+
try {
|
|
22
|
+
return A(r, !0);
|
|
23
|
+
} finally {
|
|
24
|
+
a = t, p = s;
|
|
25
|
+
}
|
|
26
|
+
}
|
|
27
|
+
function S(e, n) {
|
|
28
|
+
n = n ? Object.assign({}, C, n) : C;
|
|
29
|
+
const t = {
|
|
30
|
+
value: e,
|
|
31
|
+
observers: null,
|
|
32
|
+
observerSlots: null,
|
|
33
|
+
comparator: n.equals || void 0
|
|
34
|
+
}, s = (l) => (typeof l == "function" && (l = l(t.value)), Y(t, l));
|
|
35
|
+
return [J.bind(t), s];
|
|
36
|
+
}
|
|
37
|
+
function $(e, n, t) {
|
|
38
|
+
const s = U(e, n, !1, y);
|
|
39
|
+
v(s);
|
|
40
|
+
}
|
|
41
|
+
function fe(e, n, t) {
|
|
42
|
+
Q = de;
|
|
43
|
+
const s = U(e, n, !1, y);
|
|
44
|
+
s.user = !0, g ? g.push(s) : v(s);
|
|
45
|
+
}
|
|
46
|
+
function X(e, n, t) {
|
|
47
|
+
t = t ? Object.assign({}, C, t) : C;
|
|
48
|
+
const s = U(e, n, !0, 0);
|
|
49
|
+
return s.observers = null, s.observerSlots = null, s.comparator = t.equals || void 0, v(s), J.bind(s);
|
|
50
|
+
}
|
|
51
|
+
function m(e) {
|
|
52
|
+
if (a === null) return e();
|
|
53
|
+
const n = a;
|
|
54
|
+
a = null;
|
|
55
|
+
try {
|
|
56
|
+
return e();
|
|
57
|
+
} finally {
|
|
58
|
+
a = n;
|
|
59
|
+
}
|
|
60
|
+
}
|
|
61
|
+
function ce(e) {
|
|
62
|
+
fe(() => m(e));
|
|
63
|
+
}
|
|
64
|
+
function ae(e) {
|
|
65
|
+
return p === null || (p.cleanups === null ? p.cleanups = [e] : p.cleanups.push(e)), e;
|
|
66
|
+
}
|
|
67
|
+
function J() {
|
|
68
|
+
if (this.sources && this.state)
|
|
69
|
+
if (this.state === y) v(this);
|
|
70
|
+
else {
|
|
71
|
+
const e = d;
|
|
72
|
+
d = null, A(() => T(this), !1), d = e;
|
|
73
|
+
}
|
|
74
|
+
if (a) {
|
|
75
|
+
const e = this.observers ? this.observers.length : 0;
|
|
76
|
+
a.sources ? (a.sources.push(this), a.sourceSlots.push(e)) : (a.sources = [this], a.sourceSlots = [e]), this.observers ? (this.observers.push(a), this.observerSlots.push(a.sources.length - 1)) : (this.observers = [a], this.observerSlots = [a.sources.length - 1]);
|
|
77
|
+
}
|
|
78
|
+
return this.value;
|
|
79
|
+
}
|
|
80
|
+
function Y(e, n, t) {
|
|
81
|
+
let s = e.value;
|
|
82
|
+
return (!e.comparator || !e.comparator(s, n)) && (e.value = n, e.observers && e.observers.length && A(() => {
|
|
83
|
+
for (let l = 0; l < e.observers.length; l += 1) {
|
|
84
|
+
const i = e.observers[l], o = j && j.running;
|
|
85
|
+
o && j.disposed.has(i), (o ? !i.tState : !i.state) && (i.pure ? d.push(i) : g.push(i), i.observers && z(i)), o || (i.state = y);
|
|
86
|
+
}
|
|
87
|
+
if (d.length > 1e6)
|
|
88
|
+
throw d = [], new Error();
|
|
89
|
+
}, !1)), n;
|
|
90
|
+
}
|
|
91
|
+
function v(e) {
|
|
92
|
+
if (!e.fn) return;
|
|
93
|
+
B(e);
|
|
94
|
+
const n = k;
|
|
95
|
+
he(
|
|
96
|
+
e,
|
|
97
|
+
e.value,
|
|
98
|
+
n
|
|
99
|
+
);
|
|
100
|
+
}
|
|
101
|
+
function he(e, n, t) {
|
|
102
|
+
let s;
|
|
103
|
+
const l = p, i = a;
|
|
104
|
+
a = p = e;
|
|
105
|
+
try {
|
|
106
|
+
s = e.fn(n);
|
|
107
|
+
} catch (o) {
|
|
108
|
+
return e.pure && (e.state = y, e.owned && e.owned.forEach(B), e.owned = null), e.updatedAt = t + 1, ee(o);
|
|
109
|
+
} finally {
|
|
110
|
+
a = i, p = l;
|
|
111
|
+
}
|
|
112
|
+
(!e.updatedAt || e.updatedAt <= t) && (e.updatedAt != null && "observers" in e ? Y(e, s) : e.value = s, e.updatedAt = t);
|
|
113
|
+
}
|
|
114
|
+
function U(e, n, t, s = y, l) {
|
|
115
|
+
const i = {
|
|
116
|
+
fn: e,
|
|
117
|
+
state: s,
|
|
118
|
+
updatedAt: null,
|
|
119
|
+
owned: null,
|
|
120
|
+
sources: null,
|
|
121
|
+
sourceSlots: null,
|
|
122
|
+
cleanups: null,
|
|
123
|
+
value: n,
|
|
124
|
+
owner: p,
|
|
125
|
+
context: p ? p.context : null,
|
|
126
|
+
pure: t
|
|
127
|
+
};
|
|
128
|
+
return p === null || p !== W && (p.owned ? p.owned.push(i) : p.owned = [i]), i;
|
|
129
|
+
}
|
|
130
|
+
function I(e) {
|
|
131
|
+
if (e.state === 0) return;
|
|
132
|
+
if (e.state === F) return T(e);
|
|
133
|
+
if (e.suspense && m(e.suspense.inFallback)) return e.suspense.effects.push(e);
|
|
134
|
+
const n = [e];
|
|
135
|
+
for (; (e = e.owner) && (!e.updatedAt || e.updatedAt < k); )
|
|
136
|
+
e.state && n.push(e);
|
|
137
|
+
for (let t = n.length - 1; t >= 0; t--)
|
|
138
|
+
if (e = n[t], e.state === y)
|
|
139
|
+
v(e);
|
|
140
|
+
else if (e.state === F) {
|
|
141
|
+
const s = d;
|
|
142
|
+
d = null, A(() => T(e, n[0]), !1), d = s;
|
|
143
|
+
}
|
|
144
|
+
}
|
|
145
|
+
function A(e, n) {
|
|
146
|
+
if (d) return e();
|
|
147
|
+
let t = !1;
|
|
148
|
+
n || (d = []), g ? t = !0 : g = [], k++;
|
|
149
|
+
try {
|
|
150
|
+
const s = e();
|
|
151
|
+
return pe(t), s;
|
|
152
|
+
} catch (s) {
|
|
153
|
+
t || (g = null), d = null, ee(s);
|
|
154
|
+
}
|
|
155
|
+
}
|
|
156
|
+
function pe(e) {
|
|
157
|
+
if (d && (Z(d), d = null), e) return;
|
|
158
|
+
const n = g;
|
|
159
|
+
g = null, n.length && A(() => Q(n), !1);
|
|
160
|
+
}
|
|
161
|
+
function Z(e) {
|
|
162
|
+
for (let n = 0; n < e.length; n++) I(e[n]);
|
|
163
|
+
}
|
|
164
|
+
function de(e) {
|
|
165
|
+
let n, t = 0;
|
|
166
|
+
for (n = 0; n < e.length; n++) {
|
|
167
|
+
const s = e[n];
|
|
168
|
+
s.user ? e[t++] = s : I(s);
|
|
169
|
+
}
|
|
170
|
+
for (n = 0; n < t; n++) I(e[n]);
|
|
171
|
+
}
|
|
172
|
+
function T(e, n) {
|
|
173
|
+
e.state = 0;
|
|
174
|
+
for (let t = 0; t < e.sources.length; t += 1) {
|
|
175
|
+
const s = e.sources[t];
|
|
176
|
+
if (s.sources) {
|
|
177
|
+
const l = s.state;
|
|
178
|
+
l === y ? s !== n && (!s.updatedAt || s.updatedAt < k) && I(s) : l === F && T(s, n);
|
|
179
|
+
}
|
|
180
|
+
}
|
|
181
|
+
}
|
|
182
|
+
function z(e) {
|
|
183
|
+
for (let n = 0; n < e.observers.length; n += 1) {
|
|
184
|
+
const t = e.observers[n];
|
|
185
|
+
t.state || (t.state = F, t.pure ? d.push(t) : g.push(t), t.observers && z(t));
|
|
186
|
+
}
|
|
187
|
+
}
|
|
188
|
+
function B(e) {
|
|
189
|
+
let n;
|
|
190
|
+
if (e.sources)
|
|
191
|
+
for (; e.sources.length; ) {
|
|
192
|
+
const t = e.sources.pop(), s = e.sourceSlots.pop(), l = t.observers;
|
|
193
|
+
if (l && l.length) {
|
|
194
|
+
const i = l.pop(), o = t.observerSlots.pop();
|
|
195
|
+
s < l.length && (i.sourceSlots[o] = s, l[s] = i, t.observerSlots[s] = o);
|
|
196
|
+
}
|
|
197
|
+
}
|
|
198
|
+
if (e.owned) {
|
|
199
|
+
for (n = e.owned.length - 1; n >= 0; n--) B(e.owned[n]);
|
|
200
|
+
e.owned = null;
|
|
201
|
+
}
|
|
202
|
+
if (e.cleanups) {
|
|
203
|
+
for (n = e.cleanups.length - 1; n >= 0; n--) e.cleanups[n]();
|
|
204
|
+
e.cleanups = null;
|
|
205
|
+
}
|
|
206
|
+
e.state = 0;
|
|
207
|
+
}
|
|
208
|
+
function ge(e) {
|
|
209
|
+
return e instanceof Error ? e : new Error(typeof e == "string" ? e : "Unknown error", {
|
|
210
|
+
cause: e
|
|
211
|
+
});
|
|
212
|
+
}
|
|
213
|
+
function ee(e, n = p) {
|
|
214
|
+
throw ge(e);
|
|
215
|
+
}
|
|
216
|
+
const P = Symbol("fallback");
|
|
217
|
+
function R(e) {
|
|
218
|
+
for (let n = 0; n < e.length; n++) e[n]();
|
|
219
|
+
}
|
|
220
|
+
function ye(e, n, t = {}) {
|
|
221
|
+
let s = [], l = [], i = [], o = [], r = 0, u;
|
|
222
|
+
return ae(() => R(i)), () => {
|
|
223
|
+
const f = e() || [], c = f.length;
|
|
224
|
+
return f[oe], m(() => {
|
|
225
|
+
if (c === 0)
|
|
226
|
+
return r !== 0 && (R(i), i = [], s = [], l = [], r = 0, o = []), t.fallback && (s = [P], l[0] = N((b) => (i[0] = b, t.fallback())), r = 1), l;
|
|
227
|
+
for (s[0] === P && (i[0](), i = [], s = [], l = [], r = 0), u = 0; u < c; u++)
|
|
228
|
+
u < s.length && s[u] !== f[u] ? o[u](() => f[u]) : u >= s.length && (l[u] = N(h));
|
|
229
|
+
for (; u < s.length; u++)
|
|
230
|
+
i[u]();
|
|
231
|
+
return r = o.length = i.length = c, s = f.slice(0), l = l.slice(0, r);
|
|
232
|
+
});
|
|
233
|
+
function h(b) {
|
|
234
|
+
i[u] = b;
|
|
235
|
+
const [E, D] = S(f[u]);
|
|
236
|
+
return o[u] = D, n(E, u);
|
|
237
|
+
}
|
|
238
|
+
};
|
|
239
|
+
}
|
|
240
|
+
function _(e, n) {
|
|
241
|
+
return m(() => e(n || {}));
|
|
242
|
+
}
|
|
243
|
+
function be(e) {
|
|
244
|
+
const n = "fallback" in e && {
|
|
245
|
+
fallback: () => e.fallback
|
|
246
|
+
};
|
|
247
|
+
return X(ye(() => e.each, e.children, n || void 0));
|
|
248
|
+
}
|
|
249
|
+
function we(e, n, t) {
|
|
250
|
+
let s = t.length, l = n.length, i = s, o = 0, r = 0, u = n[l - 1].nextSibling, f = null;
|
|
251
|
+
for (; o < l || r < i; ) {
|
|
252
|
+
if (n[o] === t[r]) {
|
|
253
|
+
o++, r++;
|
|
254
|
+
continue;
|
|
255
|
+
}
|
|
256
|
+
for (; n[l - 1] === t[i - 1]; )
|
|
257
|
+
l--, i--;
|
|
258
|
+
if (l === o) {
|
|
259
|
+
const c = i < s ? r ? t[r - 1].nextSibling : t[i - r] : u;
|
|
260
|
+
for (; r < i; ) e.insertBefore(t[r++], c);
|
|
261
|
+
} else if (i === r)
|
|
262
|
+
for (; o < l; )
|
|
263
|
+
(!f || !f.has(n[o])) && n[o].remove(), o++;
|
|
264
|
+
else if (n[o] === t[i - 1] && t[r] === n[l - 1]) {
|
|
265
|
+
const c = n[--l].nextSibling;
|
|
266
|
+
e.insertBefore(t[r++], n[o++].nextSibling), e.insertBefore(t[--i], c), n[l] = t[i];
|
|
267
|
+
} else {
|
|
268
|
+
if (!f) {
|
|
269
|
+
f = /* @__PURE__ */ new Map();
|
|
270
|
+
let h = r;
|
|
271
|
+
for (; h < i; ) f.set(t[h], h++);
|
|
272
|
+
}
|
|
273
|
+
const c = f.get(n[o]);
|
|
274
|
+
if (c != null)
|
|
275
|
+
if (r < c && c < i) {
|
|
276
|
+
let h = o, b = 1, E;
|
|
277
|
+
for (; ++h < l && h < i && !((E = f.get(n[h])) == null || E !== c + b); )
|
|
278
|
+
b++;
|
|
279
|
+
if (b > c - r) {
|
|
280
|
+
const D = n[o];
|
|
281
|
+
for (; r < c; ) e.insertBefore(t[r++], D);
|
|
282
|
+
} else e.replaceChild(t[r++], n[o++]);
|
|
283
|
+
} else o++;
|
|
284
|
+
else n[o++].remove();
|
|
285
|
+
}
|
|
286
|
+
}
|
|
287
|
+
}
|
|
288
|
+
const M = "_$DX_DELEGATE";
|
|
289
|
+
function L(e, n, t) {
|
|
290
|
+
let s;
|
|
291
|
+
const l = () => {
|
|
292
|
+
const o = document.createElement("template");
|
|
293
|
+
return o.innerHTML = e, o.content.firstChild;
|
|
294
|
+
}, i = () => (s || (s = l())).cloneNode(!0);
|
|
295
|
+
return i.cloneNode = i, i;
|
|
296
|
+
}
|
|
297
|
+
function te(e, n = window.document) {
|
|
298
|
+
const t = n[M] || (n[M] = /* @__PURE__ */ new Set());
|
|
299
|
+
for (let s = 0, l = e.length; s < l; s++) {
|
|
300
|
+
const i = e[s];
|
|
301
|
+
t.has(i) || (t.add(i), n.addEventListener(i, ve));
|
|
302
|
+
}
|
|
303
|
+
}
|
|
304
|
+
function me(e, n, t) {
|
|
305
|
+
t == null ? e.removeAttribute(n) : e.setAttribute(n, t);
|
|
306
|
+
}
|
|
307
|
+
function $e(e, n, t, s) {
|
|
308
|
+
Array.isArray(t) ? (e[`$$${n}`] = t[0], e[`$$${n}Data`] = t[1]) : e[`$$${n}`] = t;
|
|
309
|
+
}
|
|
310
|
+
function ne(e, n, t) {
|
|
311
|
+
return m(() => e(n, t));
|
|
312
|
+
}
|
|
313
|
+
function x(e, n, t, s) {
|
|
314
|
+
if (t !== void 0 && !s && (s = []), typeof n != "function") return O(e, n, s, t);
|
|
315
|
+
$((l) => O(e, n(), l, t), s);
|
|
316
|
+
}
|
|
317
|
+
function ve(e) {
|
|
318
|
+
const n = `$$${e.type}`;
|
|
319
|
+
let t = e.composedPath && e.composedPath()[0] || e.target;
|
|
320
|
+
for (e.target !== t && Object.defineProperty(e, "target", {
|
|
321
|
+
configurable: !0,
|
|
322
|
+
value: t
|
|
323
|
+
}), Object.defineProperty(e, "currentTarget", {
|
|
324
|
+
configurable: !0,
|
|
325
|
+
get() {
|
|
326
|
+
return t || document;
|
|
327
|
+
}
|
|
328
|
+
}); t; ) {
|
|
329
|
+
const s = t[n];
|
|
330
|
+
if (s && !t.disabled) {
|
|
331
|
+
const l = t[`${n}Data`];
|
|
332
|
+
if (l !== void 0 ? s.call(t, l, e) : s.call(t, e), e.cancelBubble) return;
|
|
333
|
+
}
|
|
334
|
+
t = t._$host || t.parentNode || t.host;
|
|
335
|
+
}
|
|
336
|
+
}
|
|
337
|
+
function O(e, n, t, s, l) {
|
|
338
|
+
for (; typeof t == "function"; ) t = t();
|
|
339
|
+
if (n === t) return t;
|
|
340
|
+
const i = typeof n, o = s !== void 0;
|
|
341
|
+
if (e = o && t[0] && t[0].parentNode || e, i === "string" || i === "number") {
|
|
342
|
+
if (i === "number" && (n = n.toString(), n === t))
|
|
343
|
+
return t;
|
|
344
|
+
if (o) {
|
|
345
|
+
let r = t[0];
|
|
346
|
+
r && r.nodeType === 3 ? r.data !== n && (r.data = n) : r = document.createTextNode(n), t = w(e, t, s, r);
|
|
347
|
+
} else
|
|
348
|
+
t !== "" && typeof t == "string" ? t = e.firstChild.data = n : t = e.textContent = n;
|
|
349
|
+
} else if (n == null || i === "boolean")
|
|
350
|
+
t = w(e, t, s);
|
|
351
|
+
else {
|
|
352
|
+
if (i === "function")
|
|
353
|
+
return $(() => {
|
|
354
|
+
let r = n();
|
|
355
|
+
for (; typeof r == "function"; ) r = r();
|
|
356
|
+
t = O(e, r, t, s);
|
|
357
|
+
}), () => t;
|
|
358
|
+
if (Array.isArray(n)) {
|
|
359
|
+
const r = [], u = t && Array.isArray(t);
|
|
360
|
+
if (V(r, n, t, l))
|
|
361
|
+
return $(() => t = O(e, r, t, s, !0)), () => t;
|
|
362
|
+
if (r.length === 0) {
|
|
363
|
+
if (t = w(e, t, s), o) return t;
|
|
364
|
+
} else u ? t.length === 0 ? G(e, r, s) : we(e, t, r) : (t && w(e), G(e, r));
|
|
365
|
+
t = r;
|
|
366
|
+
} else if (n.nodeType) {
|
|
367
|
+
if (Array.isArray(t)) {
|
|
368
|
+
if (o) return t = w(e, t, s, n);
|
|
369
|
+
w(e, t, null, n);
|
|
370
|
+
} else t == null || t === "" || !e.firstChild ? e.appendChild(n) : e.replaceChild(n, e.firstChild);
|
|
371
|
+
t = n;
|
|
372
|
+
}
|
|
373
|
+
}
|
|
374
|
+
return t;
|
|
375
|
+
}
|
|
376
|
+
function V(e, n, t, s) {
|
|
377
|
+
let l = !1;
|
|
378
|
+
for (let i = 0, o = n.length; i < o; i++) {
|
|
379
|
+
let r = n[i], u = t && t[e.length], f;
|
|
380
|
+
if (!(r == null || r === !0 || r === !1)) if ((f = typeof r) == "object" && r.nodeType)
|
|
381
|
+
e.push(r);
|
|
382
|
+
else if (Array.isArray(r))
|
|
383
|
+
l = V(e, r, u) || l;
|
|
384
|
+
else if (f === "function")
|
|
385
|
+
if (s) {
|
|
386
|
+
for (; typeof r == "function"; ) r = r();
|
|
387
|
+
l = V(
|
|
388
|
+
e,
|
|
389
|
+
Array.isArray(r) ? r : [r],
|
|
390
|
+
Array.isArray(u) ? u : [u]
|
|
391
|
+
) || l;
|
|
392
|
+
} else
|
|
393
|
+
e.push(r), l = !0;
|
|
394
|
+
else {
|
|
395
|
+
const c = String(r);
|
|
396
|
+
u && u.nodeType === 3 && u.data === c ? e.push(u) : e.push(document.createTextNode(c));
|
|
397
|
+
}
|
|
398
|
+
}
|
|
399
|
+
return l;
|
|
400
|
+
}
|
|
401
|
+
function G(e, n, t = null) {
|
|
402
|
+
for (let s = 0, l = n.length; s < l; s++) e.insertBefore(n[s], t);
|
|
403
|
+
}
|
|
404
|
+
function w(e, n, t, s) {
|
|
405
|
+
if (t === void 0) return e.textContent = "";
|
|
406
|
+
const l = s || document.createTextNode("");
|
|
407
|
+
if (n.length) {
|
|
408
|
+
let i = !1;
|
|
409
|
+
for (let o = n.length - 1; o >= 0; o--) {
|
|
410
|
+
const r = n[o];
|
|
411
|
+
if (l !== r) {
|
|
412
|
+
const u = r.parentNode === e;
|
|
413
|
+
!i && !o ? u ? e.replaceChild(l, r) : e.insertBefore(l, t) : u && r.remove();
|
|
414
|
+
} else i = !0;
|
|
415
|
+
}
|
|
416
|
+
} else e.insertBefore(l, t);
|
|
417
|
+
return [l];
|
|
418
|
+
}
|
|
419
|
+
var se = (e) => e != null && (e = Object.getPrototypeOf(e), e === Array.prototype || e === Object.prototype);
|
|
420
|
+
function le(e, n, t) {
|
|
421
|
+
for (const [s, l] of Object.entries(n)) {
|
|
422
|
+
const i = `${t}.${s}`;
|
|
423
|
+
e[i] = l, se(l) && le(e, l, i);
|
|
424
|
+
}
|
|
425
|
+
}
|
|
426
|
+
function Ae(e) {
|
|
427
|
+
const n = { ...e };
|
|
428
|
+
for (const [t, s] of Object.entries(e))
|
|
429
|
+
se(s) && le(n, s, t);
|
|
430
|
+
return n;
|
|
431
|
+
}
|
|
432
|
+
var Le = (e) => e;
|
|
433
|
+
function Ee(e, n = Le) {
|
|
434
|
+
return (t, ...s) => {
|
|
435
|
+
t[0] === "." && (t = t.slice(1));
|
|
436
|
+
const l = e()?.[t];
|
|
437
|
+
switch (typeof l) {
|
|
438
|
+
case "function":
|
|
439
|
+
return l(...s);
|
|
440
|
+
case "string":
|
|
441
|
+
return n(l, s[0]);
|
|
442
|
+
default:
|
|
443
|
+
return l;
|
|
444
|
+
}
|
|
445
|
+
};
|
|
446
|
+
}
|
|
447
|
+
const Se = {
|
|
448
|
+
placeholder: "Edit...",
|
|
449
|
+
emptyList: "No items found"
|
|
450
|
+
}, xe = {
|
|
451
|
+
ListField: Se
|
|
452
|
+
}, Ce = {
|
|
453
|
+
placeholder: "Éditer...",
|
|
454
|
+
emptyList: "Liste vide"
|
|
455
|
+
}, Fe = {
|
|
456
|
+
ListField: Ce
|
|
457
|
+
}, H = { en: xe, fr: Fe };
|
|
458
|
+
function ie(e) {
|
|
459
|
+
const n = X(() => {
|
|
460
|
+
const s = e(), l = s in H ? s : "en";
|
|
461
|
+
return Ae(H[l]);
|
|
462
|
+
});
|
|
463
|
+
return { t: Ee(n) };
|
|
464
|
+
}
|
|
465
|
+
var Ie = /* @__PURE__ */ L('<div class=LFInputField><input class=LFInputField-input type=text><button type=button class="pi pi-trash LFInputField-delete LFIconBtn">');
|
|
466
|
+
function Te({
|
|
467
|
+
language: e,
|
|
468
|
+
value: n,
|
|
469
|
+
handleDelete: t,
|
|
470
|
+
onChange: s
|
|
471
|
+
}) {
|
|
472
|
+
const {
|
|
473
|
+
t: l
|
|
474
|
+
} = ie(e);
|
|
475
|
+
let i;
|
|
476
|
+
return ce(() => {
|
|
477
|
+
i?.focus();
|
|
478
|
+
}), (() => {
|
|
479
|
+
var o = Ie(), r = o.firstChild, u = r.nextSibling;
|
|
480
|
+
r.$$input = (c) => s(c.currentTarget.value);
|
|
481
|
+
var f = i;
|
|
482
|
+
return typeof f == "function" ? ne(f, r) : i = r, $e(u, "click", t), $(() => me(r, "placeholder", l("ListField.placeholder"))), $(() => r.value = n()), o;
|
|
483
|
+
})();
|
|
484
|
+
}
|
|
485
|
+
te(["input", "click"]);
|
|
486
|
+
var _e = /* @__PURE__ */ L("<ul class=LFList>"), Oe = /* @__PURE__ */ L("<div class=LFList-empty>"), ke = /* @__PURE__ */ L("<li class=LFListItem>");
|
|
487
|
+
function Be(e) {
|
|
488
|
+
const {
|
|
489
|
+
t: n
|
|
490
|
+
} = ie(e.language);
|
|
491
|
+
let t;
|
|
492
|
+
return (() => {
|
|
493
|
+
var s = _e(), l = t;
|
|
494
|
+
return typeof l == "function" ? ne(l, s) : t = s, x(s, _(be, {
|
|
495
|
+
get each() {
|
|
496
|
+
return e.values();
|
|
497
|
+
},
|
|
498
|
+
get fallback() {
|
|
499
|
+
return (() => {
|
|
500
|
+
var i = Oe();
|
|
501
|
+
return x(i, () => n("ListField.emptyList")), i;
|
|
502
|
+
})();
|
|
503
|
+
},
|
|
504
|
+
children: (i, o) => (() => {
|
|
505
|
+
var r = ke();
|
|
506
|
+
return x(r, _(Te, {
|
|
507
|
+
onChange: (u) => {
|
|
508
|
+
e.updateValue(o, u);
|
|
509
|
+
},
|
|
510
|
+
value: i,
|
|
511
|
+
get language() {
|
|
512
|
+
return e.language;
|
|
513
|
+
},
|
|
514
|
+
handleDelete: () => e.handleDelete(o)
|
|
515
|
+
})), r;
|
|
516
|
+
})()
|
|
517
|
+
})), s;
|
|
518
|
+
})();
|
|
519
|
+
}
|
|
520
|
+
var De = /* @__PURE__ */ L('<div class=LFApp><button type=button class="pi pi-plus LFIconBtn LFApp-addItemBtn">');
|
|
521
|
+
function je(e) {
|
|
522
|
+
const {
|
|
523
|
+
language: n,
|
|
524
|
+
list: t,
|
|
525
|
+
setList: s,
|
|
526
|
+
itemIndexes: l
|
|
527
|
+
} = e, i = () => {
|
|
528
|
+
s([...t(), ""], [...l(), l().length]);
|
|
529
|
+
}, o = (f) => {
|
|
530
|
+
const c = [...t()];
|
|
531
|
+
c.splice(f, 1);
|
|
532
|
+
const h = [...l()];
|
|
533
|
+
h.splice(f, 1), s(c, h);
|
|
534
|
+
}, r = (f, c) => {
|
|
535
|
+
const h = [...t()];
|
|
536
|
+
h[f] = c, s(h, l());
|
|
537
|
+
}, u = (f, c) => {
|
|
538
|
+
const h = [...l()];
|
|
539
|
+
h.splice(c, 0, h.splice(f, 1)[0]), s(t(), h);
|
|
540
|
+
};
|
|
541
|
+
return (() => {
|
|
542
|
+
var f = De(), c = f.firstChild;
|
|
543
|
+
return x(f, _(Be, {
|
|
544
|
+
changeOrder: u,
|
|
545
|
+
updateValue: r,
|
|
546
|
+
handleDelete: o,
|
|
547
|
+
language: n,
|
|
548
|
+
values: t
|
|
549
|
+
}), c), c.$$click = i, f;
|
|
550
|
+
})();
|
|
551
|
+
}
|
|
552
|
+
te(["click"]);
|
|
553
|
+
const Ue = {
|
|
554
|
+
create: Ve,
|
|
555
|
+
init: Ne
|
|
556
|
+
};
|
|
557
|
+
function Ne({
|
|
558
|
+
pluginBaseUrl: e
|
|
559
|
+
}) {
|
|
560
|
+
const n = `${e}/style.css`, t = document.createElement("link");
|
|
561
|
+
t.rel = "stylesheet", t.href = n, document.head.appendChild(t);
|
|
562
|
+
}
|
|
563
|
+
function Ve(e) {
|
|
564
|
+
if (e.fieldType.dataType !== "json")
|
|
565
|
+
throw new Error(`data type '${e.fieldType.dataType}' is incompatible, should be 'json'`);
|
|
566
|
+
return N((n) => {
|
|
567
|
+
const [t, s] = S(e.value ?? []), [l, i] = S(q(e.value ?? [])), [o, r] = S(e.language);
|
|
568
|
+
return {
|
|
569
|
+
element: _(je, {
|
|
570
|
+
language: o,
|
|
571
|
+
list: t,
|
|
572
|
+
setList: (u, f) => {
|
|
573
|
+
s(u), i(f), e.onChange(K(u, f));
|
|
574
|
+
},
|
|
575
|
+
itemIndexes: l
|
|
576
|
+
}),
|
|
577
|
+
setLanguage: r,
|
|
578
|
+
setValue: (u = []) => {
|
|
579
|
+
s(u), i(q(u));
|
|
580
|
+
},
|
|
581
|
+
getValue: () => K(t(), l()),
|
|
582
|
+
dispose: n
|
|
583
|
+
};
|
|
584
|
+
});
|
|
585
|
+
}
|
|
586
|
+
function K(e, n) {
|
|
587
|
+
return n.map((t) => e[t]);
|
|
588
|
+
}
|
|
589
|
+
function q(e) {
|
|
590
|
+
return e.map((n, t) => t);
|
|
591
|
+
}
|
|
592
|
+
export {
|
|
593
|
+
Ue as default
|
|
594
|
+
};
|