@paroicms/list-field-plugin 0.1.0 → 0.3.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.
@@ -1,15 +1,15 @@
1
1
  "use strict";
2
2
  Object.defineProperty(exports, "__esModule", { value: true });
3
- exports.plugin = void 0;
4
3
  const data_formatters_lib_1 = require("@paroi/data-formatters-lib");
5
4
  const node_path_1 = require("node:path");
6
5
  const projectDir = (0, node_path_1.dirname)(__dirname);
7
6
  const packageDir = (0, node_path_1.dirname)(projectDir);
8
7
  const version = (0, data_formatters_lib_1.strVal)(require((0, node_path_1.join)(packageDir, "package.json")).version);
9
- exports.plugin = {
8
+ const plugin = {
10
9
  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"));
10
+ siteInit(service) {
11
+ service.registerSiteSchemaLibrary((0, node_path_1.join)(packageDir, "site-schema-lib"));
12
+ service.setBoAssetsDirectory((0, node_path_1.join)(packageDir, "bo-front", "dist"));
14
13
  },
15
14
  };
15
+ exports.default = plugin;
@@ -1,5 +1,5 @@
1
- const re = (e, n) => e === n, oe = Symbol("solid-track"), C = {
2
- equals: re
1
+ const oe = (e, n) => e === n, re = Symbol("solid-track"), C = {
2
+ equals: oe
3
3
  };
4
4
  let Q = Z;
5
5
  const y = 1, F = 2, W = {
@@ -8,20 +8,20 @@ const y = 1, F = 2, W = {
8
8
  context: null,
9
9
  owner: null
10
10
  };
11
- var p = null;
11
+ var h = null;
12
12
  let j = null, ue = null, a = null, d = null, g = null, k = 0;
13
13
  function N(e, n) {
14
- const t = a, s = p, l = e.length === 0, i = s, o = l ? W : {
14
+ const t = a, s = h, l = e.length === 0, i = s, r = l ? W : {
15
15
  owned: null,
16
16
  cleanups: null,
17
17
  context: i ? i.context : null,
18
18
  owner: i
19
- }, r = l ? e : () => e(() => m(() => B(o)));
20
- p = o, a = null;
19
+ }, o = l ? e : () => e(() => m(() => B(r)));
20
+ h = r, a = null;
21
21
  try {
22
- return A(r, !0);
22
+ return L(o, !0);
23
23
  } finally {
24
- a = t, p = s;
24
+ a = t, h = s;
25
25
  }
26
26
  }
27
27
  function S(e, n) {
@@ -36,17 +36,17 @@ function S(e, n) {
36
36
  }
37
37
  function $(e, n, t) {
38
38
  const s = U(e, n, !1, y);
39
- v(s);
39
+ A(s);
40
40
  }
41
41
  function fe(e, n, t) {
42
42
  Q = de;
43
43
  const s = U(e, n, !1, y);
44
- s.user = !0, g ? g.push(s) : v(s);
44
+ s.user = !0, g ? g.push(s) : A(s);
45
45
  }
46
46
  function X(e, n, t) {
47
47
  t = t ? Object.assign({}, C, t) : C;
48
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);
49
+ return s.observers = null, s.observerSlots = null, s.comparator = t.equals || void 0, A(s), J.bind(s);
50
50
  }
51
51
  function m(e) {
52
52
  if (a === null) return e();
@@ -62,14 +62,14 @@ function ce(e) {
62
62
  fe(() => m(e));
63
63
  }
64
64
  function ae(e) {
65
- return p === null || (p.cleanups === null ? p.cleanups = [e] : p.cleanups.push(e)), e;
65
+ return h === null || (h.cleanups === null ? h.cleanups = [e] : h.cleanups.push(e)), e;
66
66
  }
67
67
  function J() {
68
68
  if (this.sources && this.state)
69
- if (this.state === y) v(this);
69
+ if (this.state === y) A(this);
70
70
  else {
71
71
  const e = d;
72
- d = null, A(() => T(this), !1), d = e;
72
+ d = null, L(() => T(this), !1), d = e;
73
73
  }
74
74
  if (a) {
75
75
  const e = this.observers ? this.observers.length : 0;
@@ -79,35 +79,35 @@ function J() {
79
79
  }
80
80
  function Y(e, n, t) {
81
81
  let s = e.value;
82
- return (!e.comparator || !e.comparator(s, n)) && (e.value = n, e.observers && e.observers.length && A(() => {
82
+ return (!e.comparator || !e.comparator(s, n)) && (e.value = n, e.observers && e.observers.length && L(() => {
83
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);
84
+ const i = e.observers[l], r = j && j.running;
85
+ r && j.disposed.has(i), (r ? !i.tState : !i.state) && (i.pure ? d.push(i) : g.push(i), i.observers && z(i)), r || (i.state = y);
86
86
  }
87
87
  if (d.length > 1e6)
88
88
  throw d = [], new Error();
89
89
  }, !1)), n;
90
90
  }
91
- function v(e) {
91
+ function A(e) {
92
92
  if (!e.fn) return;
93
93
  B(e);
94
94
  const n = k;
95
- he(
95
+ pe(
96
96
  e,
97
97
  e.value,
98
98
  n
99
99
  );
100
100
  }
101
- function he(e, n, t) {
101
+ function pe(e, n, t) {
102
102
  let s;
103
- const l = p, i = a;
104
- a = p = e;
103
+ const l = h, i = a;
104
+ a = h = e;
105
105
  try {
106
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);
107
+ } catch (r) {
108
+ return e.pure && (e.state = y, e.owned && e.owned.forEach(B), e.owned = null), e.updatedAt = t + 1, ee(r);
109
109
  } finally {
110
- a = i, p = l;
110
+ a = i, h = l;
111
111
  }
112
112
  (!e.updatedAt || e.updatedAt <= t) && (e.updatedAt != null && "observers" in e ? Y(e, s) : e.value = s, e.updatedAt = t);
113
113
  }
@@ -121,11 +121,11 @@ function U(e, n, t, s = y, l) {
121
121
  sourceSlots: null,
122
122
  cleanups: null,
123
123
  value: n,
124
- owner: p,
125
- context: p ? p.context : null,
124
+ owner: h,
125
+ context: h ? h.context : null,
126
126
  pure: t
127
127
  };
128
- return p === null || p !== W && (p.owned ? p.owned.push(i) : p.owned = [i]), i;
128
+ return h === null || h !== W && (h.owned ? h.owned.push(i) : h.owned = [i]), i;
129
129
  }
130
130
  function I(e) {
131
131
  if (e.state === 0) return;
@@ -136,27 +136,27 @@ function I(e) {
136
136
  e.state && n.push(e);
137
137
  for (let t = n.length - 1; t >= 0; t--)
138
138
  if (e = n[t], e.state === y)
139
- v(e);
139
+ A(e);
140
140
  else if (e.state === F) {
141
141
  const s = d;
142
- d = null, A(() => T(e, n[0]), !1), d = s;
142
+ d = null, L(() => T(e, n[0]), !1), d = s;
143
143
  }
144
144
  }
145
- function A(e, n) {
145
+ function L(e, n) {
146
146
  if (d) return e();
147
147
  let t = !1;
148
148
  n || (d = []), g ? t = !0 : g = [], k++;
149
149
  try {
150
150
  const s = e();
151
- return pe(t), s;
151
+ return he(t), s;
152
152
  } catch (s) {
153
153
  t || (g = null), d = null, ee(s);
154
154
  }
155
155
  }
156
- function pe(e) {
156
+ function he(e) {
157
157
  if (d && (Z(d), d = null), e) return;
158
158
  const n = g;
159
- g = null, n.length && A(() => Q(n), !1);
159
+ g = null, n.length && L(() => Q(n), !1);
160
160
  }
161
161
  function Z(e) {
162
162
  for (let n = 0; n < e.length; n++) I(e[n]);
@@ -191,8 +191,8 @@ function B(e) {
191
191
  for (; e.sources.length; ) {
192
192
  const t = e.sources.pop(), s = e.sourceSlots.pop(), l = t.observers;
193
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);
194
+ const i = l.pop(), r = t.observerSlots.pop();
195
+ s < l.length && (i.sourceSlots[r] = s, l[s] = i, t.observerSlots[s] = r);
196
196
  }
197
197
  }
198
198
  if (e.owned) {
@@ -210,7 +210,7 @@ function ge(e) {
210
210
  cause: e
211
211
  });
212
212
  }
213
- function ee(e, n = p) {
213
+ function ee(e, n = h) {
214
214
  throw ge(e);
215
215
  }
216
216
  const P = Symbol("fallback");
@@ -218,22 +218,22 @@ function R(e) {
218
218
  for (let n = 0; n < e.length; n++) e[n]();
219
219
  }
220
220
  function ye(e, n, t = {}) {
221
- let s = [], l = [], i = [], o = [], r = 0, u;
221
+ let s = [], l = [], i = [], r = [], o = 0, u;
222
222
  return ae(() => R(i)), () => {
223
223
  const f = e() || [], c = f.length;
224
- return f[oe], m(() => {
224
+ return f[re], m(() => {
225
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));
226
+ return o !== 0 && (R(i), i = [], s = [], l = [], o = 0, r = []), t.fallback && (s = [P], l[0] = N((b) => (i[0] = b, t.fallback())), o = 1), l;
227
+ for (s[0] === P && (i[0](), i = [], s = [], l = [], o = 0), u = 0; u < c; u++)
228
+ u < s.length && s[u] !== f[u] ? r[u](() => f[u]) : u >= s.length && (l[u] = N(p));
229
229
  for (; u < s.length; u++)
230
230
  i[u]();
231
- return r = o.length = i.length = c, s = f.slice(0), l = l.slice(0, r);
231
+ return o = r.length = i.length = c, s = f.slice(0), l = l.slice(0, o);
232
232
  });
233
- function h(b) {
233
+ function p(b) {
234
234
  i[u] = b;
235
235
  const [E, D] = S(f[u]);
236
- return o[u] = D, n(E, u);
236
+ return r[u] = D, n(E, u);
237
237
  }
238
238
  };
239
239
  }
@@ -247,50 +247,50 @@ function be(e) {
247
247
  return X(ye(() => e.each, e.children, n || void 0));
248
248
  }
249
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++;
250
+ let s = t.length, l = n.length, i = s, r = 0, o = 0, u = n[l - 1].nextSibling, f = null;
251
+ for (; r < l || o < i; ) {
252
+ if (n[r] === t[o]) {
253
+ r++, o++;
254
254
  continue;
255
255
  }
256
256
  for (; n[l - 1] === t[i - 1]; )
257
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]) {
258
+ if (l === r) {
259
+ const c = i < s ? o ? t[o - 1].nextSibling : t[i - o] : u;
260
+ for (; o < i; ) e.insertBefore(t[o++], c);
261
+ } else if (i === o)
262
+ for (; r < l; )
263
+ (!f || !f.has(n[r])) && n[r].remove(), r++;
264
+ else if (n[r] === t[i - 1] && t[o] === n[l - 1]) {
265
265
  const c = n[--l].nextSibling;
266
- e.insertBefore(t[r++], n[o++].nextSibling), e.insertBefore(t[--i], c), n[l] = t[i];
266
+ e.insertBefore(t[o++], n[r++].nextSibling), e.insertBefore(t[--i], c), n[l] = t[i];
267
267
  } else {
268
268
  if (!f) {
269
269
  f = /* @__PURE__ */ new Map();
270
- let h = r;
271
- for (; h < i; ) f.set(t[h], h++);
270
+ let p = o;
271
+ for (; p < i; ) f.set(t[p], p++);
272
272
  }
273
- const c = f.get(n[o]);
273
+ const c = f.get(n[r]);
274
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); )
275
+ if (o < c && c < i) {
276
+ let p = r, b = 1, E;
277
+ for (; ++p < l && p < i && !((E = f.get(n[p])) == null || E !== c + b); )
278
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();
279
+ if (b > c - o) {
280
+ const D = n[r];
281
+ for (; o < c; ) e.insertBefore(t[o++], D);
282
+ } else e.replaceChild(t[o++], n[r++]);
283
+ } else r++;
284
+ else n[r++].remove();
285
285
  }
286
286
  }
287
287
  }
288
288
  const M = "_$DX_DELEGATE";
289
- function L(e, n, t) {
289
+ function v(e, n, t) {
290
290
  let s;
291
291
  const l = () => {
292
- const o = document.createElement("template");
293
- return o.innerHTML = e, o.content.firstChild;
292
+ const r = document.createElement("template");
293
+ return r.innerHTML = e, r.content.firstChild;
294
294
  }, i = () => (s || (s = l())).cloneNode(!0);
295
295
  return i.cloneNode = i, i;
296
296
  }
@@ -298,7 +298,7 @@ function te(e, n = window.document) {
298
298
  const t = n[M] || (n[M] = /* @__PURE__ */ new Set());
299
299
  for (let s = 0, l = e.length; s < l; s++) {
300
300
  const i = e[s];
301
- t.has(i) || (t.add(i), n.addEventListener(i, ve));
301
+ t.has(i) || (t.add(i), n.addEventListener(i, Ae));
302
302
  }
303
303
  }
304
304
  function me(e, n, t) {
@@ -314,7 +314,7 @@ function x(e, n, t, s) {
314
314
  if (t !== void 0 && !s && (s = []), typeof n != "function") return O(e, n, s, t);
315
315
  $((l) => O(e, n(), l, t), s);
316
316
  }
317
- function ve(e) {
317
+ function Ae(e) {
318
318
  const n = `$$${e.type}`;
319
319
  let t = e.composedPath && e.composedPath()[0] || e.target;
320
320
  for (e.target !== t && Object.defineProperty(e, "target", {
@@ -337,13 +337,13 @@ function ve(e) {
337
337
  function O(e, n, t, s, l) {
338
338
  for (; typeof t == "function"; ) t = t();
339
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") {
340
+ const i = typeof n, r = s !== void 0;
341
+ if (e = r && t[0] && t[0].parentNode || e, i === "string" || i === "number") {
342
342
  if (i === "number" && (n = n.toString(), n === t))
343
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);
344
+ if (r) {
345
+ let o = t[0];
346
+ o && o.nodeType === 3 ? o.data !== n && (o.data = n) : o = document.createTextNode(n), t = w(e, t, s, o);
347
347
  } else
348
348
  t !== "" && typeof t == "string" ? t = e.firstChild.data = n : t = e.textContent = n;
349
349
  } else if (n == null || i === "boolean")
@@ -351,21 +351,21 @@ function O(e, n, t, s, l) {
351
351
  else {
352
352
  if (i === "function")
353
353
  return $(() => {
354
- let r = n();
355
- for (; typeof r == "function"; ) r = r();
356
- t = O(e, r, t, s);
354
+ let o = n();
355
+ for (; typeof o == "function"; ) o = o();
356
+ t = O(e, o, t, s);
357
357
  }), () => t;
358
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;
359
+ const o = [], u = t && Array.isArray(t);
360
+ if (V(o, n, t, l))
361
+ return $(() => t = O(e, o, t, s, !0)), () => t;
362
+ if (o.length === 0) {
363
+ if (t = w(e, t, s), r) return t;
364
+ } else u ? t.length === 0 ? G(e, o, s) : we(e, t, o) : (t && w(e), G(e, o));
365
+ t = o;
366
366
  } else if (n.nodeType) {
367
367
  if (Array.isArray(t)) {
368
- if (o) return t = w(e, t, s, n);
368
+ if (r) return t = w(e, t, s, n);
369
369
  w(e, t, null, n);
370
370
  } else t == null || t === "" || !e.firstChild ? e.appendChild(n) : e.replaceChild(n, e.firstChild);
371
371
  t = n;
@@ -375,24 +375,24 @@ function O(e, n, t, s, l) {
375
375
  }
376
376
  function V(e, n, t, s) {
377
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;
378
+ for (let i = 0, r = n.length; i < r; i++) {
379
+ let o = n[i], u = t && t[e.length], f;
380
+ if (!(o == null || o === !0 || o === !1)) if ((f = typeof o) == "object" && o.nodeType)
381
+ e.push(o);
382
+ else if (Array.isArray(o))
383
+ l = V(e, o, u) || l;
384
384
  else if (f === "function")
385
385
  if (s) {
386
- for (; typeof r == "function"; ) r = r();
386
+ for (; typeof o == "function"; ) o = o();
387
387
  l = V(
388
388
  e,
389
- Array.isArray(r) ? r : [r],
389
+ Array.isArray(o) ? o : [o],
390
390
  Array.isArray(u) ? u : [u]
391
391
  ) || l;
392
392
  } else
393
- e.push(r), l = !0;
393
+ e.push(o), l = !0;
394
394
  else {
395
- const c = String(r);
395
+ const c = String(o);
396
396
  u && u.nodeType === 3 && u.data === c ? e.push(u) : e.push(document.createTextNode(c));
397
397
  }
398
398
  }
@@ -406,11 +406,11 @@ function w(e, n, t, s) {
406
406
  const l = s || document.createTextNode("");
407
407
  if (n.length) {
408
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();
409
+ for (let r = n.length - 1; r >= 0; r--) {
410
+ const o = n[r];
411
+ if (l !== o) {
412
+ const u = o.parentNode === e;
413
+ !i && !r ? u ? e.replaceChild(l, o) : e.insertBefore(l, t) : u && o.remove();
414
414
  } else i = !0;
415
415
  }
416
416
  } else e.insertBefore(l, t);
@@ -423,14 +423,14 @@ function le(e, n, t) {
423
423
  e[i] = l, se(l) && le(e, l, i);
424
424
  }
425
425
  }
426
- function Ae(e) {
426
+ function Le(e) {
427
427
  const n = { ...e };
428
428
  for (const [t, s] of Object.entries(e))
429
429
  se(s) && le(n, s, t);
430
430
  return n;
431
431
  }
432
- var Le = (e) => e;
433
- function Ee(e, n = Le) {
432
+ var ve = (e) => e;
433
+ function Ee(e, n = ve) {
434
434
  return (t, ...s) => {
435
435
  t[0] === "." && (t = t.slice(1));
436
436
  const l = e()?.[t];
@@ -458,11 +458,11 @@ const Se = {
458
458
  function ie(e) {
459
459
  const n = X(() => {
460
460
  const s = e(), l = s in H ? s : "en";
461
- return Ae(H[l]);
461
+ return Le(H[l]);
462
462
  });
463
463
  return { t: Ee(n) };
464
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">');
465
+ var Ie = /* @__PURE__ */ v('<div class=LFInputField><input class=LFInputField-input type=text><button type=button class="pi pi-trash LFInputField-delete LFIconBtn">');
466
466
  function Te({
467
467
  language: e,
468
468
  value: n,
@@ -476,14 +476,14 @@ function Te({
476
476
  return ce(() => {
477
477
  i?.focus();
478
478
  }), (() => {
479
- var o = Ie(), r = o.firstChild, u = r.nextSibling;
480
- r.$$input = (c) => s(c.currentTarget.value);
479
+ var r = Ie(), o = r.firstChild, u = o.nextSibling;
480
+ o.$$input = (c) => s(c.currentTarget.value);
481
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;
482
+ return typeof f == "function" ? ne(f, o) : i = o, $e(u, "click", t), $(() => me(o, "placeholder", l("ListField.placeholder"))), $(() => o.value = n()), r;
483
483
  })();
484
484
  }
485
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>");
486
+ var _e = /* @__PURE__ */ v("<ul class=LFList>"), Oe = /* @__PURE__ */ v("<div class=LFList-empty>"), ke = /* @__PURE__ */ v("<li class=LFListItem>");
487
487
  function Be(e) {
488
488
  const {
489
489
  t: n
@@ -501,23 +501,23 @@ function Be(e) {
501
501
  return x(i, () => n("ListField.emptyList")), i;
502
502
  })();
503
503
  },
504
- children: (i, o) => (() => {
505
- var r = ke();
506
- return x(r, _(Te, {
504
+ children: (i, r) => (() => {
505
+ var o = ke();
506
+ return x(o, _(Te, {
507
507
  onChange: (u) => {
508
- e.updateValue(o, u);
508
+ e.updateValue(r, u);
509
509
  },
510
510
  value: i,
511
511
  get language() {
512
512
  return e.language;
513
513
  },
514
- handleDelete: () => e.handleDelete(o)
515
- })), r;
514
+ handleDelete: () => e.handleDelete(r)
515
+ })), o;
516
516
  })()
517
517
  })), s;
518
518
  })();
519
519
  }
520
- var De = /* @__PURE__ */ L('<div class=LFApp><button type=button class="pi pi-plus LFIconBtn LFApp-addItemBtn">');
520
+ var De = /* @__PURE__ */ v('<div class=LFApp><button type=button class="pi pi-plus LFIconBtn LFApp-addItemBtn">');
521
521
  function je(e) {
522
522
  const {
523
523
  language: n,
@@ -526,24 +526,24 @@ function je(e) {
526
526
  itemIndexes: l
527
527
  } = e, i = () => {
528
528
  s([...t(), ""], [...l(), l().length]);
529
- }, o = (f) => {
529
+ }, r = (f) => {
530
530
  const c = [...t()];
531
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());
532
+ const p = [...l()];
533
+ p.splice(f, 1), s(c, p);
534
+ }, o = (f, c) => {
535
+ const p = [...t()];
536
+ p[f] = c, s(p, l());
537
537
  }, u = (f, c) => {
538
- const h = [...l()];
539
- h.splice(c, 0, h.splice(f, 1)[0]), s(t(), h);
538
+ const p = [...l()];
539
+ p.splice(c, 0, p.splice(f, 1)[0]), s(t(), p);
540
540
  };
541
541
  return (() => {
542
542
  var f = De(), c = f.firstChild;
543
543
  return x(f, _(Be, {
544
544
  changeOrder: u,
545
- updateValue: r,
546
- handleDelete: o,
545
+ updateValue: o,
546
+ handleDelete: r,
547
547
  language: n,
548
548
  values: t
549
549
  }), c), c.$$click = i, f;
@@ -564,17 +564,17 @@ function Ve(e) {
564
564
  if (e.fieldType.dataType !== "json")
565
565
  throw new Error(`data type '${e.fieldType.dataType}' is incompatible, should be 'json'`);
566
566
  return N((n) => {
567
- const [t, s] = S(e.value ?? []), [l, i] = S(q(e.value ?? [])), [o, r] = S(e.language);
567
+ const [t, s] = S(e.value ?? []), [l, i] = S(q(e.value ?? [])), [r, o] = S(e.language);
568
568
  return {
569
569
  element: _(je, {
570
- language: o,
570
+ language: r,
571
571
  list: t,
572
572
  setList: (u, f) => {
573
573
  s(u), i(f), e.onChange(K(u, f));
574
574
  },
575
575
  itemIndexes: l
576
576
  }),
577
- setLanguage: r,
577
+ setLanguage: o,
578
578
  setValue: (u = []) => {
579
579
  s(u), i(q(u));
580
580
  },
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@paroicms/list-field-plugin",
3
- "version": "0.1.0",
3
+ "version": "0.3.0",
4
4
  "description": "List field plugin for ParoiCMS",
5
5
  "keywords": [
6
6
  "paroicms",
@@ -30,9 +30,9 @@
30
30
  "@paroicms/public-server-lib": "0"
31
31
  },
32
32
  "devDependencies": {
33
- "@paroicms/public-anywhere-lib": "0.6.0",
34
- "@paroicms/public-front-lib": "0.10.0",
35
- "@paroicms/public-server-lib": "0.12.3",
33
+ "@paroicms/public-anywhere-lib": "0.7.0",
34
+ "@paroicms/public-front-lib": "0.11.0",
35
+ "@paroicms/public-server-lib": "0.13.0",
36
36
  "@solid-primitives/i18n": "~2.1.1",
37
37
  "@types/node": "~20.14.8",
38
38
  "primeicons": "^7.0.0",