@tricoteuses/assemblee 2.2.0 → 2.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.
package/lib/cleaners.js CHANGED
@@ -1,16 +1,16 @@
1
1
  import t from "node:assert";
2
- import { c as f, a as b, b as _ } from "./amendements-DcffXOt8.js";
3
- import { d as Y } from "./amendements-DcffXOt8.js";
4
- function $(e) {
2
+ import { c as f, a as b, b as w } from "./amendements-DcffXOt8.js";
3
+ import { d as Z } from "./amendements-DcffXOt8.js";
4
+ function B(e) {
5
5
  f(e), t.strictEqual(e.uid["@xsi:type"], "IdActeur_type"), e.uid = e.uid["#text"], t(e.uid);
6
- const n = e.etatCivil;
6
+ const s = e.etatCivil;
7
7
  {
8
- f(n);
9
- const o = n.ident;
8
+ f(s);
9
+ const o = s.ident;
10
10
  {
11
11
  f(o);
12
- const s = n.infoNaissance;
13
- f(s);
12
+ const r = s.infoNaissance;
13
+ f(r);
14
14
  }
15
15
  }
16
16
  const d = e.profession;
@@ -19,107 +19,107 @@ function $(e) {
19
19
  const o = d.socProcINSEE;
20
20
  t(o), f(o), delete d.socProcINSEE, d.socProcInsee = o;
21
21
  }
22
- const r = e.uri_hatvp;
23
- r !== void 0 && (e.uriHatvp = r, delete e.uri_hatvp);
24
- let c = e.adresses;
25
- if (c !== void 0 && (c = c.adresse, c === void 0 ? (delete e.adresses, c = void 0) : Array.isArray(c) ? e.adresses = c : (t.notStrictEqual(c, null), t.strictEqual(typeof c, "object"), e.adresses = c = [c]), c !== void 0))
26
- for (const o of c) {
22
+ const n = e.uri_hatvp;
23
+ n !== void 0 && (e.uriHatvp = n, delete e.uri_hatvp);
24
+ let u = e.adresses;
25
+ if (u !== void 0 && (u = u.adresse, u === void 0 ? (delete e.adresses, u = void 0) : Array.isArray(u) ? e.adresses = u : (t.notStrictEqual(u, null), t.strictEqual(typeof u, "object"), e.adresses = u = [u]), u !== void 0))
26
+ for (const o of u) {
27
27
  f(o);
28
- const s = o["@xsi:type"];
28
+ const r = o["@xsi:type"];
29
29
  t(
30
30
  [
31
31
  "AdresseMail_Type",
32
32
  "AdressePostale_Type",
33
33
  "AdresseSiteWeb_Type",
34
34
  "AdresseTelephonique_Type"
35
- ].includes(s),
36
- `Unexpected "@xsi:type": ${s}`
37
- ), o.xsiType = s, delete o["@xsi:type"], t.notStrictEqual(o.uid, void 0), t.notStrictEqual(o.type, void 0), t.notStrictEqual(o.typeLibelle, void 0), s === "AdressePostale_Type" && t.strictEqual(o.adresseDeRattachement, void 0);
35
+ ].includes(r),
36
+ `Unexpected "@xsi:type": ${r}`
37
+ ), o.xsiType = r, delete o["@xsi:type"], t.notStrictEqual(o.uid, void 0), t.notStrictEqual(o.type, void 0), t.notStrictEqual(o.typeLibelle, void 0), r === "AdressePostale_Type" && t.strictEqual(o.adresseDeRattachement, void 0);
38
38
  }
39
39
  let l = e.mandats;
40
40
  if (l !== void 0) {
41
41
  let o = l.mandat;
42
42
  Array.isArray(o) ? l = e.mandats = o : typeof o == "object" && (l = e.mandats = [o]);
43
- for (const s of l) {
44
- f(s);
45
- const u = s["@xsi:type"];
46
- u !== void 0 && (s.xsiType = u, delete s["@xsi:type"]);
47
- const m = s.infosQualite;
48
- f(m);
49
- const i = s.organes;
50
- delete s.organes;
43
+ for (const r of l) {
44
+ f(r);
45
+ const c = r["@xsi:type"];
46
+ c !== void 0 && (r.xsiType = c, delete r["@xsi:type"]);
47
+ const A = r.infosQualite;
48
+ f(A);
49
+ const i = r.organes;
50
+ delete r.organes;
51
51
  let a = i.organeRef;
52
- t(a), Array.isArray(a) || (a = [a]), s.organesRefs = a;
53
- let v = s.suppleants;
54
- delete s.suppleants, v && (v = v.suppleant, t(v), s.suppleant = v, f(v));
55
- const R = s.election;
52
+ t(a), Array.isArray(a) || (a = [a]), r.organesRefs = a;
53
+ let p = r.suppleants;
54
+ delete r.suppleants, p && (p = p.suppleant, t(p), r.suppleant = p, f(p));
55
+ const R = r.election;
56
56
  if (R !== void 0) {
57
57
  f(R);
58
58
  const D = R.lieu;
59
59
  f(D);
60
60
  }
61
- const O = s.mandature;
62
- O !== void 0 && f(O), t.strictEqual(s.chambre, void 0);
63
- let y = s.collaborateurs;
61
+ const q = r.mandature;
62
+ q !== void 0 && f(q), t.strictEqual(r.chambre, void 0);
63
+ let y = r.collaborateurs;
64
64
  if (y !== void 0) {
65
- const D = Array.isArray(y) ? y.filter((A) => A !== null) : [y];
66
- y = [], D.map(({ collaborateur: A }) => {
67
- if (Array.isArray(A))
68
- for (const q of A)
69
- q !== null && y.push(q);
70
- else A && y.push(A);
71
- }), y.length === 0 ? (delete s.collaborateurs, y = void 0) : s.collaborateurs = y;
72
- for (const A of y || [])
73
- f(A), t.strictEqual(A.dateDebut, void 0), t.strictEqual(A.dateFin, void 0);
65
+ const D = Array.isArray(y) ? y.filter((m) => m !== null) : [y];
66
+ y = [], D.map(({ collaborateur: m }) => {
67
+ if (Array.isArray(m))
68
+ for (const x of m)
69
+ x !== null && y.push(x);
70
+ else m && y.push(m);
71
+ }), y.length === 0 ? (delete r.collaborateurs, y = void 0) : r.collaborateurs = y;
72
+ for (const m of y || [])
73
+ f(m), t.strictEqual(m.dateDebut, void 0), t.strictEqual(m.dateFin, void 0);
74
74
  }
75
- const x = s.InfosHorsSIAN;
76
- x !== void 0 && (f(x), t.strictEqual(x.HATVP_URI, void 0), t.strictEqual(Object.keys(x).length, 0), delete s.InfosHorsSIAN);
75
+ const E = r.InfosHorsSIAN;
76
+ E !== void 0 && (f(E), t.strictEqual(E.HATVP_URI, void 0), t.strictEqual(Object.keys(E).length, 0), delete r.InfosHorsSIAN);
77
77
  }
78
78
  l.sort(
79
- (s, u) => s.uid.length === u.uid.length ? s.uid.localeCompare(u.uid) : s.uid.length - u.uid.length
79
+ (r, c) => r.uid.length === c.uid.length ? r.uid.localeCompare(c.uid) : r.uid.length - c.uid.length
80
80
  );
81
81
  }
82
- let p = e.deports;
83
- if (p !== void 0) {
84
- let o = p.deport;
85
- Array.isArray(o) ? p = e.deports = o : typeof o == "object" && (p = e.deports = [o]);
86
- for (const s of p) {
87
- f(s);
88
- const u = s.cible;
89
- f(u), t.strictEqual(u.references, void 0);
82
+ let v = e.deports;
83
+ if (v !== void 0) {
84
+ let o = v.deport;
85
+ Array.isArray(o) ? v = e.deports = o : typeof o == "object" && (v = e.deports = [o]);
86
+ for (const r of v) {
87
+ f(r);
88
+ const c = r.cible;
89
+ f(c), t.strictEqual(c.references, void 0);
90
90
  }
91
- p.sort(
92
- (s, u) => s.uid.length === u.uid.length ? s.uid.localeCompare(u.uid) : s.uid.length - u.uid.length
91
+ v.sort(
92
+ (r, c) => r.uid.length === c.uid.length ? r.uid.localeCompare(c.uid) : r.uid.length - c.uid.length
93
93
  );
94
94
  }
95
95
  }
96
- function C(e) {
97
- const n = e.etudePLFRef;
98
- e.etudePLFRef !== void 0 && (delete e.etudePLFRef, e.etudePlfRef = n);
96
+ function j(e) {
97
+ const s = e.etudePLFRef;
98
+ e.etudePLFRef !== void 0 && (delete e.etudePLFRef, e.etudePlfRef = s);
99
99
  }
100
- function w(e) {
100
+ function H(e) {
101
101
  if (f(e), e.metadatas?.dateSuppression !== void 0) {
102
102
  for (const i of Object.getOwnPropertyNames(e))
103
103
  delete e[i];
104
104
  return;
105
105
  }
106
- const n = e["@xsi:type"];
107
- n !== void 0 && (e.xsiType = n, delete e["@xsi:type"]);
106
+ const s = e["@xsi:type"];
107
+ s !== void 0 && (e.xsiType = s, delete e["@xsi:type"]);
108
108
  const d = e.cycleDeVie;
109
109
  t(d);
110
110
  {
111
111
  const i = d.chrono;
112
112
  t(i), f(i);
113
113
  }
114
- let r = e.divisions;
115
- if (r !== void 0) {
116
- r = r.division, Array.isArray(r) || (t(r), r = [r]), e.divisions = r;
117
- for (const i of r)
118
- w(i);
114
+ let n = e.divisions;
115
+ if (n !== void 0) {
116
+ n = n.division, Array.isArray(n) || (t(n), n = [n]), e.divisions = n;
117
+ for (const i of n)
118
+ H(i);
119
119
  }
120
120
  t.strictEqual(e.redacteur, void 0);
121
- const c = e.classification;
122
- t(c), f(c);
121
+ const u = e.classification;
122
+ t(u), f(u);
123
123
  let l = e.auteurs;
124
124
  if (l !== void 0) {
125
125
  l = l.auteur, Array.isArray(l) || (t(l), l = [l]), e.auteurs = l;
@@ -128,8 +128,8 @@ function w(e) {
128
128
  a !== void 0 && (i.organeRef = a.organeRef, delete i.organe);
129
129
  }
130
130
  }
131
- const p = e.notice;
132
- b(p, "adoptionConforme");
131
+ const v = e.notice;
132
+ b(v, "adoptionConforme");
133
133
  let o = e.coSignataires;
134
134
  if (o !== void 0) {
135
135
  o = o.coSignataire, Array.isArray(o) || (t(o), o = [o]), e.coSignataires = o;
@@ -137,185 +137,185 @@ function w(e) {
137
137
  f(i), b(i, "edite");
138
138
  let a = i.acteur;
139
139
  a !== void 0 && (a = a.acteurRef, t(a), delete i.acteur, i.acteurRef = a);
140
- const v = i.organe;
141
- v !== void 0 && b(v, "etApparentes");
140
+ const p = i.organe;
141
+ p !== void 0 && b(p, "etApparentes");
142
142
  }
143
143
  }
144
- const s = e.depotAmendements;
145
- if (s !== void 0) {
146
- f(s);
147
- const i = s.amendementsSeance;
144
+ const r = e.depotAmendements;
145
+ if (r !== void 0) {
146
+ f(r);
147
+ const i = r.amendementsSeance;
148
148
  f(i), b(i, "amendable");
149
- let a = s.amendementsCommission;
149
+ let a = r.amendementsCommission;
150
150
  if (a !== void 0) {
151
- a = a.commission, Array.isArray(a) || (t(a), a = [a]), s.amendementsCommission = a;
152
- for (const v of a)
153
- f(v), b(v, "amendable"), t.strictEqual(v.dateLimiteDepot, void 0);
151
+ a = a.commission, Array.isArray(a) || (t(a), a = [a]), r.amendementsCommission = a;
152
+ for (const p of a)
153
+ f(p), b(p, "amendable"), t.strictEqual(p.dateLimiteDepot, void 0);
154
154
  }
155
155
  }
156
- const u = e.imprimerie;
157
- if (u !== void 0) {
158
- f(u);
159
- const i = u.DIAN;
160
- i !== void 0 && (delete u.DIAN, u.dian = i);
161
- const a = u.ISBN;
162
- a !== void 0 && (delete u.ISBN, u.isbn = a);
163
- const v = u.ISSN;
164
- v !== void 0 && (delete u.ISSN, u.issn = v);
156
+ const c = e.imprimerie;
157
+ if (c !== void 0) {
158
+ f(c);
159
+ const i = c.DIAN;
160
+ i !== void 0 && (delete c.DIAN, c.dian = i);
161
+ const a = c.ISBN;
162
+ a !== void 0 && (delete c.ISBN, c.isbn = a);
163
+ const p = c.ISSN;
164
+ p !== void 0 && (delete c.ISSN, c.issn = p);
165
165
  }
166
166
  b(e, "rapportPublie");
167
- let m = e.organesReferents;
168
- m !== void 0 && (m = m.organeRef, Array.isArray(m) || (t(m), m = [m]), e.organesReferents = m);
167
+ let A = e.organesReferents;
168
+ A !== void 0 && (A = A.organeRef, Array.isArray(A) || (t(A), A = [A]), e.organesReferents = A);
169
169
  }
170
- function j(e) {
170
+ function F(e) {
171
171
  f(e);
172
- const n = e["@xsi:type"];
173
- n !== void 0 && (e.xsiType = n, delete e["@xsi:type"]);
172
+ const s = e["@xsi:type"];
173
+ s !== void 0 && (e.xsiType = s, delete e["@xsi:type"]);
174
174
  let d = e.auteurs;
175
175
  d !== void 0 && (d = d.acteurRef, Array.isArray(d) || (t(d), d = [d]), e.auteursRefs = d, delete e.auteurs);
176
- const r = e.casSaisine;
177
- r !== void 0 && V(r);
178
- const c = e.contributionInternaute;
179
- c !== void 0 && f(c), t.strictEqual(e.dateRetrait, void 0);
176
+ const n = e.casSaisine;
177
+ n !== void 0 && h(n);
178
+ const u = e.contributionInternaute;
179
+ u !== void 0 && f(u), t.strictEqual(e.dateRetrait, void 0);
180
180
  const l = e.decision;
181
- l !== void 0 && V(l);
182
- const p = e.infoJO;
183
- p !== void 0 && (P(p), e.infoJo = p, delete e.infoJO);
181
+ l !== void 0 && h(l);
182
+ const v = e.infoJO;
183
+ v !== void 0 && (V(v), e.infoJo = v, delete e.infoJO);
184
184
  const o = e.infoJOCE;
185
185
  if (o !== void 0) {
186
186
  e.infoJoce = o, delete e.infoJOCE;
187
187
  const S = o.refJOCE;
188
188
  S !== void 0 && (o.refJoce = S, delete o.refJOCE);
189
- const h = o.dateJOCE;
190
- h !== void 0 && (o.dateJoce = h, delete o.dateJOCE);
189
+ const I = o.dateJOCE;
190
+ I !== void 0 && (o.dateJoce = I, delete o.dateJOCE);
191
191
  }
192
- let s = e.infoJORect;
193
- if (s !== void 0) {
194
- Array.isArray(s) || (s = [s]), e.infoJoRect = s, delete e.infoJORect;
195
- for (const S of s)
196
- P(S);
197
- }
198
- F(e);
199
- let u = e.initiateurs;
200
- u !== void 0 && (t.strictEqual(e.initiateur, void 0), u.acteurRef === void 0 ? t.notStrictEqual(u.organeRef, void 0) : (Array.isArray(u) || (t(u), u = [u]), u = {
201
- acteurs: u
202
- }), e.initiateur = u, delete e.initiateurs), t.strictEqual(e.odSeancejRef, void 0);
203
- const m = e.provenance;
204
- m !== void 0 && (delete e.provenance, e.provenanceRef = m);
192
+ let r = e.infoJORect;
193
+ if (r !== void 0) {
194
+ Array.isArray(r) || (r = [r]), e.infoJoRect = r, delete e.infoJORect;
195
+ for (const S of r)
196
+ V(S);
197
+ }
198
+ M(e);
199
+ let c = e.initiateurs;
200
+ c !== void 0 && (t.strictEqual(e.initiateur, void 0), c.acteurRef === void 0 ? t.notStrictEqual(c.organeRef, void 0) : (Array.isArray(c) || (t(c), c = [c]), c = {
201
+ acteurs: c
202
+ }), e.initiateur = c, delete e.initiateurs), t.strictEqual(e.odSeancejRef, void 0);
203
+ const A = e.provenance;
204
+ A !== void 0 && (delete e.provenance, e.provenanceRef = A);
205
205
  let i = e.rapporteurs;
206
206
  if (i !== void 0) {
207
207
  i = i.rapporteur, Array.isArray(i) || (t(i), i = [i]), e.rapporteurs = i;
208
208
  for (const S of i)
209
- C(S);
209
+ j(S);
210
210
  }
211
211
  const a = e.referenceNOR;
212
212
  a !== void 0 && (e.referenceNor = a, delete e.referenceNOR), t.strictEqual(e.reunion, void 0);
213
- const v = e.statutAdoption;
214
- v !== void 0 && V(v);
213
+ const p = e.statutAdoption;
214
+ p !== void 0 && h(p);
215
215
  const R = e.statutConclusion;
216
- R !== void 0 && (V(R), R.famCode === "TSORTFnull" && delete e.statutConclusion);
217
- const O = e.texteAdopte;
218
- O !== void 0 && (delete e.texteAdopte, e.texteAdopteRef = O);
216
+ R !== void 0 && (h(R), R.famCode === "TSORTFnull" && delete e.statutConclusion);
217
+ const q = e.texteAdopte;
218
+ q !== void 0 && (delete e.texteAdopte, e.texteAdopteRef = q);
219
219
  const y = e.texteAssocie;
220
220
  y !== void 0 && (delete e.texteAssocie, e.texteAssocieRef = y);
221
- let x = e.textesAssocies;
222
- if (x !== void 0) {
223
- x = x.texteAssocie, Array.isArray(x) || (t(x), x = [x]), e.textesAssocies = x;
224
- for (const S of x) {
225
- const h = S.refTexteAssocie;
226
- h !== void 0 && (delete S.refTexteAssocie, S.texteAssocieRef = h);
221
+ let E = e.textesAssocies;
222
+ if (E !== void 0) {
223
+ E = E.texteAssocie, Array.isArray(E) || (t(E), E = [E]), e.textesAssocies = E;
224
+ for (const S of E) {
225
+ const I = S.refTexteAssocie;
226
+ I !== void 0 && (delete S.refTexteAssocie, S.texteAssocieRef = I);
227
227
  }
228
228
  }
229
229
  const D = e.typeDeclaration;
230
- D !== void 0 && V(D);
231
- const A = e.typeMotion;
232
- A !== void 0 && V(A);
233
- const q = e.typeMotionCensure;
234
- q !== void 0 && V(q);
235
- let E = e.voteRefs;
236
- E !== void 0 && (E = E.voteRef, Array.isArray(E) || (t(E), E = [E]), e.voteRefs = E);
230
+ D !== void 0 && h(D);
231
+ const m = e.typeMotion;
232
+ m !== void 0 && h(m);
233
+ const x = e.typeMotionCensure;
234
+ x !== void 0 && h(x);
235
+ let O = e.voteRefs;
236
+ O !== void 0 && (O = O.voteRef, Array.isArray(O) || (t(O), O = [O]), e.voteRefs = O);
237
237
  let J = e.actesLegislatifs;
238
238
  if (J !== void 0) {
239
239
  J = J.acteLegislatif, Array.isArray(J) || (t(J), J = [J]), e.actesLegislatifs = J;
240
240
  for (const S of J)
241
- j(S);
241
+ F(S);
242
242
  }
243
243
  }
244
- function F(e) {
245
- const n = e.initiateur;
246
- if (n !== void 0) {
247
- let d = n.acteurs;
248
- d !== void 0 && (d = d.acteur, Array.isArray(d) || (t(d), d = [d]), d.length > 0 ? n.acteurs = d : delete n.acteurs);
249
- let r = n.organes;
250
- r !== void 0 && (r = r.organe.organeRef.uid, t.notStrictEqual(r, void 0), n.organeRef = r, delete n.organes), n.acteurs === void 0 && n.organeRef === void 0 && delete e.initiateur;
244
+ function M(e) {
245
+ const s = e.initiateur;
246
+ if (s !== void 0) {
247
+ let d = s.acteurs;
248
+ d !== void 0 && (d = d.acteur, Array.isArray(d) || (t(d), d = [d]), d.length > 0 ? s.acteurs = d : delete s.acteurs);
249
+ let n = s.organes;
250
+ n !== void 0 && (n = n.organe.organeRef.uid, t.notStrictEqual(n, void 0), s.organeRef = n, delete s.organes), s.acteurs === void 0 && s.organeRef === void 0 && delete e.initiateur;
251
251
  }
252
252
  }
253
- function V(e) {
253
+ function h(e) {
254
254
  e.famCode = e.fam_code, delete e.fam_code, t(e.famCode), e.libelle || (e.libelle = e.famCode);
255
255
  }
256
- function P(e) {
256
+ function V(e) {
257
257
  f(e);
258
- const n = e.typeJO;
259
- n !== void 0 && (e.typeJo = n, delete e.typeJO);
258
+ const s = e.typeJO;
259
+ s !== void 0 && (e.typeJo = s, delete e.typeJO);
260
260
  const d = e.dateJO;
261
261
  d !== void 0 && (e.dateJo = d, delete e.dateJO), t.strictEqual(e.pageJO, void 0);
262
- const r = e.numJO;
263
- r !== void 0 && (e.numJo = r, delete e.numJO);
264
- const c = e.referenceNOR;
265
- c !== void 0 && (e.referenceNor = c, delete e.referenceNOR);
262
+ const n = e.numJO;
263
+ n !== void 0 && (e.numJo = n, delete e.numJO);
264
+ const u = e.referenceNOR;
265
+ u !== void 0 && (e.referenceNor = u, delete e.referenceNOR);
266
266
  }
267
- function B(e) {
267
+ function k(e) {
268
268
  f(e);
269
- const n = e["@xsi:type"];
270
- n !== void 0 && (e.xsiType = n, delete e["@xsi:type"]);
269
+ const s = e["@xsi:type"];
270
+ s !== void 0 && (e.xsiType = s, delete e["@xsi:type"]);
271
271
  const d = e.titreDossier;
272
- f(d), F(e);
273
- let r = e.actesLegislatifs;
274
- if (r !== void 0) {
275
- r = r.acteLegislatif, Array.isArray(r) || (t(r), r = [r]), e.actesLegislatifs = r;
276
- for (const l of r)
277
- j(l);
272
+ f(d), M(e);
273
+ let n = e.actesLegislatifs;
274
+ if (n !== void 0) {
275
+ n = n.acteLegislatif, Array.isArray(n) || (t(n), n = [n]), e.actesLegislatifs = n;
276
+ for (const l of n)
277
+ F(l);
278
278
  }
279
- let c = e.PLF;
280
- if (c !== void 0) {
281
- c = c.EtudePLF, t(Array.isArray(c)), delete e.PLF, e.plf = c;
282
- for (const l of c) {
283
- let p = l.rapporteur;
284
- if (p !== void 0) {
285
- Array.isArray(p) || (t(p), p = [p]), delete l.rapporteur, l.rapporteurs = p;
286
- for (const s of p)
287
- C(s);
279
+ let u = e.PLF;
280
+ if (u !== void 0) {
281
+ u = u.EtudePLF, t(Array.isArray(u)), delete e.PLF, e.plf = u;
282
+ for (const l of u) {
283
+ let v = l.rapporteur;
284
+ if (v !== void 0) {
285
+ Array.isArray(v) || (t(v), v = [v]), delete l.rapporteur, l.rapporteurs = v;
286
+ for (const r of v)
287
+ j(r);
288
288
  }
289
289
  let o = l.missionMinefi;
290
- o !== void 0 && M(o), l.ordreDiqs = l.ordreDIQS, delete l.ordreDIQS, t(l.ordreDiqs);
290
+ o !== void 0 && _(o), l.ordreDiqs = l.ordreDIQS, delete l.ordreDIQS, t(l.ordreDiqs);
291
291
  }
292
292
  }
293
293
  }
294
- function M(e) {
295
- let n = e.missions;
296
- if (n !== void 0) {
297
- n = n.mission, Array.isArray(n) || (t(n), n = [n]), e.missions = n;
298
- for (const d of n)
299
- M(d);
294
+ function _(e) {
295
+ let s = e.missions;
296
+ if (s !== void 0) {
297
+ s = s.mission, Array.isArray(s) || (t(s), s = [s]), e.missions = s;
298
+ for (const d of s)
299
+ _(d);
300
300
  }
301
301
  }
302
- function k(e) {
302
+ function U(e) {
303
303
  f(e);
304
- const n = e["@xsi:type"];
305
- n !== void 0 && (e.xsiType = n, delete e["@xsi:type"]);
304
+ const s = e["@xsi:type"];
305
+ s !== void 0 && (e.xsiType = s, delete e["@xsi:type"]);
306
306
  const d = e.viMoDe;
307
307
  f(d);
308
- const r = e.organeParent;
309
- r !== void 0 && (delete e.organeParent, e.organeParentRef = r), t.strictEqual(e.chambre, void 0);
310
- const c = e.secretariat;
311
- c !== void 0 && f(c);
308
+ const n = e.organeParent;
309
+ n !== void 0 && (delete e.organeParent, e.organeParentRef = n), t.strictEqual(e.chambre, void 0);
310
+ const u = e.secretariat;
311
+ u !== void 0 && f(u);
312
312
  const l = e.lieu;
313
313
  if (l !== void 0) {
314
314
  f(l);
315
- const s = l.region;
316
- s !== void 0 && f(s);
317
- const u = l.departement;
318
- u !== void 0 && f(u);
315
+ const r = l.region;
316
+ r !== void 0 && f(r);
317
+ const c = l.departement;
318
+ c !== void 0 && f(c);
319
319
  }
320
320
  e.couleurAssociee === null && delete e.couleurAssociee;
321
321
  let o = e.listePays;
@@ -323,37 +323,37 @@ function k(e) {
323
323
  }
324
324
  function g(e) {
325
325
  f(e);
326
- const n = e.chrono;
327
- t(n);
326
+ const s = e.chrono;
327
+ t(s);
328
328
  {
329
- f(n);
330
- let d = n.creation;
331
- t.strictEqual(typeof d, "string"), d = new Date(d), n.creation = d;
332
- let r = n.cloture;
333
- r !== void 0 && (t.strictEqual(typeof r, "string"), r = new Date(r), n.cloture = r);
329
+ f(s);
330
+ let d = s.creation;
331
+ t.strictEqual(typeof d, "string"), d = new Date(d), s.creation = d;
332
+ let n = s.cloture;
333
+ n !== void 0 && (t.strictEqual(typeof n, "string"), n = new Date(n), s.cloture = n);
334
334
  }
335
335
  }
336
- function U(e) {
336
+ function W(e) {
337
337
  f(e), b(e, "captationVideo"), b(e, "comiteSecret"), b(e, "ouverturePresse");
338
- const n = e["@xsi:type"];
339
- n !== void 0 && (e.xsiType = n, delete e["@xsi:type"]);
338
+ const s = e["@xsi:type"];
339
+ s !== void 0 && (e.xsiType = s, delete e["@xsi:type"]);
340
340
  const d = e.timeStampDebut;
341
341
  t.notStrictEqual(d, void 0), e.timestampDebut = d, delete e.timeStampDebut;
342
- let r = e.timeStampFin;
343
- r !== void 0 && (t.strictEqual(typeof r, "string"), r = new Date(r), e.timestampFin = r, delete e.timeStampFin);
344
- const c = e.lieu;
345
- c !== void 0 && f(c);
342
+ let n = e.timeStampFin;
343
+ n !== void 0 && (t.strictEqual(typeof n, "string"), n = new Date(n), e.timestampFin = n, delete e.timeStampFin);
344
+ const u = e.lieu;
345
+ u !== void 0 && f(u);
346
346
  const l = e.cycleDeVie;
347
347
  t.notStrictEqual(l, void 0), g(l);
348
- const p = e.demandeurs;
349
- if (p !== void 0) {
350
- let i = p.acteur;
348
+ const v = e.demandeurs;
349
+ if (v !== void 0) {
350
+ let i = v.acteur;
351
351
  if (i !== void 0) {
352
- Array.isArray(i) || (t.notStrictEqual(i, null), t.strictEqual(typeof i, "object"), i = [i]), p.acteurs = i, delete p.acteur;
353
- for (const v of i)
354
- f(v);
352
+ Array.isArray(i) || (t.notStrictEqual(i, null), t.strictEqual(typeof i, "object"), i = [i]), v.acteurs = i, delete v.acteur;
353
+ for (const p of i)
354
+ f(p);
355
355
  }
356
- const a = p.organe;
356
+ const a = v.organe;
357
357
  a !== void 0 && f(a);
358
358
  }
359
359
  const o = e.demandeur;
@@ -362,33 +362,33 @@ function U(e) {
362
362
  let i = o.acteur;
363
363
  if (i !== void 0) {
364
364
  t.notStrictEqual(i, null), t.strictEqual(typeof i, "object");
365
- const v = [i];
366
- o.acteurs = v, delete o.acteur, e.demandeurs = o;
367
- for (const R of v)
365
+ const p = [i];
366
+ o.acteurs = p, delete o.acteur, e.demandeurs = o;
367
+ for (const R of p)
368
368
  f(R);
369
369
  }
370
370
  const a = o.organe;
371
371
  a !== void 0 && f(a);
372
372
  }
373
- const s = e.participants;
374
- if (s !== void 0) {
375
- f(s);
376
- let i = s.participantsInternes;
377
- i !== void 0 && (i = i.participantInterne, Array.isArray(i) || (t.notStrictEqual(i, null), t.strictEqual(typeof i, "object"), i = [i]), s.participantsInternes = i);
378
- let a = s.personnesAuditionnees;
373
+ const r = e.participants;
374
+ if (r !== void 0) {
375
+ f(r);
376
+ let i = r.participantsInternes;
377
+ i !== void 0 && (i = i.participantInterne, Array.isArray(i) || (t.notStrictEqual(i, null), t.strictEqual(typeof i, "object"), i = [i]), r.participantsInternes = i);
378
+ let a = r.personnesAuditionnees;
379
379
  if (a !== void 0)
380
380
  if (a = a.personneAuditionnee, a === null)
381
- delete s.personnesAuditionnees;
381
+ delete r.personnesAuditionnees;
382
382
  else {
383
383
  Array.isArray(a) || (t.strictEqual(typeof a, "object"), a = [a]), a = a.filter(
384
- (v) => v !== null
385
- ), a.length > 0 ? s.personnesAuditionnees = a : delete s.personnesAuditionnees;
386
- for (const v of a) {
387
- const R = v.uid["@xsi:type"];
388
- t(R), v.xsiType = R;
389
- const O = v.uid["#text"];
390
- t(O), v.uid = O;
391
- const y = v.ident;
384
+ (p) => p !== null
385
+ ), a.length > 0 ? r.personnesAuditionnees = a : delete r.personnesAuditionnees;
386
+ for (const p of a) {
387
+ const R = p.uid["@xsi:type"];
388
+ t(R), p.xsiType = R;
389
+ const q = p.uid["#text"];
390
+ t(q), p.uid = q;
391
+ const y = p.ident;
392
392
  t(y), f(y);
393
393
  }
394
394
  }
@@ -400,64 +400,64 @@ function U(e) {
400
400
  f(i);
401
401
  let a = i.convocationODJ;
402
402
  a !== void 0 && (Array.isArray(a.item) ? a = a.item : (t(a.item), a = [a.item]), i.convocationOdj = a, delete i.convocationODJ);
403
- let v = i.resumeODJ;
404
- v !== void 0 && (Array.isArray(v.item) ? v = v.item : (t(v.item), v = [v.item]), i.resumeOdj = v, delete i.resumeODJ);
403
+ let p = i.resumeODJ;
404
+ p !== void 0 && (Array.isArray(p.item) ? p = p.item : (t(p.item), p = [p.item]), i.resumeOdj = p, delete i.resumeODJ);
405
405
  let R = i.pointsODJ;
406
406
  if (R !== void 0) {
407
- let O = R.pointODJ;
408
- Array.isArray(O) ? R = O : (t(O), R = [O]), i.pointsOdj = R;
407
+ let q = R.pointODJ;
408
+ Array.isArray(q) ? R = q : (t(q), R = [q]), i.pointsOdj = R;
409
409
  for (const y of R) {
410
410
  f(y), b(y, "comiteSecret");
411
- const x = y["@xsi:type"];
412
- x !== void 0 && (y.xsiType = x, delete y["@xsi:type"]);
411
+ const E = y["@xsi:type"];
412
+ E !== void 0 && (y.xsiType = E, delete y["@xsi:type"]);
413
413
  const D = y.cycleDeVie;
414
414
  t.notStrictEqual(D, void 0), g(D), t.strictEqual(y.demandeurPoint, void 0);
415
- let A = y.dossiersLegislatifsRefs;
416
- A !== void 0 && (Array.isArray(A.dossierRef) ? A = A.dossierRef : (t(A.dossierRef), A = [A.dossierRef]), y.dossiersLegislatifsRefs = A), y.typePointOdj = y.typePointODJ, delete y.typePointODJ, t.strictEqual(y.textesAssocies, void 0), y.natureTravauxOdj = y.natureTravauxODJ, delete y.natureTravauxODJ;
417
- let q = y.dateConfPres;
418
- q !== void 0 && (t.strictEqual(typeof q, "string"), t(/^\d{4}-\d{2}-\d{2}\+\d{2}:00$/.test(q)), q = new Date(q.split("+")[0]), y.dateConfPres = q);
419
- let E = y.dateLettreMinistre;
420
- E !== void 0 && (t.strictEqual(typeof E, "string"), t(/^\d{4}-\d{2}-\d{2}\+\d{2}:00$/.test(E)), E = new Date(E.split("+")[0]), y.dateLettreMinistre = E);
415
+ let m = y.dossiersLegislatifsRefs;
416
+ m !== void 0 && (Array.isArray(m.dossierRef) ? m = m.dossierRef : (t(m.dossierRef), m = [m.dossierRef]), y.dossiersLegislatifsRefs = m), y.typePointOdj = y.typePointODJ, delete y.typePointODJ, t.strictEqual(y.textesAssocies, void 0), y.natureTravauxOdj = y.natureTravauxODJ, delete y.natureTravauxODJ;
417
+ let x = y.dateConfPres;
418
+ x !== void 0 && (t.strictEqual(typeof x, "string"), t(/^\d{4}-\d{2}-\d{2}\+\d{2}:00$/.test(x)), x = new Date(x.split("+")[0]), y.dateConfPres = x);
419
+ let O = y.dateLettreMinistre;
420
+ O !== void 0 && (t.strictEqual(typeof O, "string"), t(/^\d{4}-\d{2}-\d{2}\+\d{2}:00$/.test(O)), O = new Date(O.split("+")[0]), y.dateLettreMinistre = O);
421
421
  }
422
422
  delete i.pointsODJ;
423
423
  }
424
424
  }
425
425
  }
426
- const u = e.identifiants;
427
- if (u !== void 0) {
428
- f(u);
429
- const i = u.numSeanceJO;
430
- i !== void 0 && (u.numSeanceJo = i, delete u.numSeanceJO);
431
- const a = u.idJO;
432
- a !== void 0 && (u.idJo = a, delete u.idJO);
433
- let v = u.DateSeance;
434
- t.strictEqual(typeof v, "string"), t(/^\d{4}-\d{2}-\d{2}\+\d{2}:00$/.test(v)), v = new Date(v.split("+")[0]), u.dateSeance = v, delete u.DateSeance;
435
- }
436
- const m = e.infosReunionsInternationale;
437
- if (m !== void 0) {
438
- f(m), b(
439
- m,
426
+ const c = e.identifiants;
427
+ if (c !== void 0) {
428
+ f(c);
429
+ const i = c.numSeanceJO;
430
+ i !== void 0 && (c.numSeanceJo = i, delete c.numSeanceJO);
431
+ const a = c.idJO;
432
+ a !== void 0 && (c.idJo = a, delete c.idJO);
433
+ let p = c.DateSeance;
434
+ t.strictEqual(typeof p, "string"), t(/^\d{4}-\d{2}-\d{2}\+\d{2}:00$/.test(p)), p = new Date(p.split("+")[0]), c.dateSeance = p, delete c.DateSeance;
435
+ }
436
+ const A = e.infosReunionsInternationale;
437
+ if (A !== void 0) {
438
+ f(A), b(
439
+ A,
440
440
  "estReunionInternationale"
441
441
  );
442
- let i = m.listePays;
443
- i !== void 0 && (i = i.paysRef, Array.isArray(i) || (t.strictEqual(typeof i, "string"), i = [i]), m.listePays = i);
442
+ let i = A.listePays;
443
+ i !== void 0 && (i = i.paysRef, Array.isArray(i) || (t.strictEqual(typeof i, "string"), i = [i]), A.listePays = i);
444
444
  }
445
445
  }
446
- function T(e) {
446
+ function P(e) {
447
447
  f(e);
448
- let n = e.nonVotants;
449
- if (n === void 0 ? (n = e.nonVotant, delete e.nonVotant) : t.strictEqual(e.nonVotant, void 0), n !== void 0) {
450
- typeof n == "string" ? (t.strictEqual(n, "0"), n = []) : Array.isArray(n) || (t(n), n = [n]);
451
- const p = n;
452
- n = [];
453
- for (let o of p)
454
- o !== null && (o = o.votant, Array.isArray(o) ? n.push(...o) : (t(o), n.push(o)));
455
- if (n.length === 0)
448
+ let s = e.nonVotants;
449
+ if (s === void 0 ? (s = e.nonVotant, delete e.nonVotant) : t.strictEqual(e.nonVotant, void 0), s !== void 0) {
450
+ typeof s == "string" ? (t.strictEqual(s, "0"), s = []) : Array.isArray(s) || (t(s), s = [s]);
451
+ const v = s;
452
+ s = [];
453
+ for (let o of v)
454
+ o !== null && (o = o.votant, Array.isArray(o) ? s.push(...o) : (t(o), s.push(o)));
455
+ if (s.length === 0)
456
456
  delete e.nonVotants;
457
457
  else {
458
- e.nonVotants = n;
459
- for (const o of n)
460
- I(o);
458
+ e.nonVotants = s;
459
+ for (const o of s)
460
+ T(o);
461
461
  }
462
462
  }
463
463
  let d = e.pour;
@@ -466,101 +466,110 @@ function T(e) {
466
466
  delete e.pour;
467
467
  else {
468
468
  e.pour = d;
469
- for (const p of d)
470
- I(p);
469
+ for (const v of d)
470
+ T(v);
471
471
  }
472
- let r = e.contre;
473
- if (r === void 0 ? (r = e.contres, delete e.contres) : t.strictEqual(e.contres, void 0), r !== void 0)
474
- if (r = r.votant, Array.isArray(r) || (t(r), r = [r]), r.length === 0)
472
+ let n = e.contre;
473
+ if (n === void 0 ? (n = e.contres, delete e.contres) : t.strictEqual(e.contres, void 0), n !== void 0)
474
+ if (n = n.votant, Array.isArray(n) || (t(n), n = [n]), n.length === 0)
475
475
  delete e.contre;
476
476
  else {
477
- e.contre = r;
478
- for (const p of r)
479
- I(p);
477
+ e.contre = n;
478
+ for (const v of n)
479
+ T(v);
480
480
  }
481
- let c = e.abstentions;
482
- if (c === void 0 ? (c = e.abstention, delete e.abstention) : t.strictEqual(e.abstention, void 0), c !== void 0) {
483
- Array.isArray(c) || (t(c), c = [c]);
484
- const p = c;
485
- c = [];
486
- for (let o of p)
487
- o !== null && (o = o.votant, Array.isArray(o) ? c.push(...o) : (t(o), c.push(o)));
488
- if (c.length === 0)
481
+ let u = e.abstentions;
482
+ if (u === void 0 ? (u = e.abstention, delete e.abstention) : t.strictEqual(e.abstention, void 0), u !== void 0) {
483
+ Array.isArray(u) || (t(u), u = [u]);
484
+ const v = u;
485
+ u = [];
486
+ for (let o of v)
487
+ o !== null && (o = o.votant, Array.isArray(o) ? u.push(...o) : (t(o), u.push(o)));
488
+ if (u.length === 0)
489
489
  delete e.abstentions;
490
490
  else {
491
- e.abstentions = c;
492
- for (const o of c)
493
- I(o);
491
+ e.abstentions = u;
492
+ for (const o of u)
493
+ T(o);
494
494
  }
495
495
  }
496
496
  let l = e.nonVotantsVolontaires;
497
497
  if (l !== void 0) {
498
498
  Array.isArray(l) || (l = [l]);
499
- const p = l;
499
+ const v = l;
500
500
  l = [];
501
- for (let o of p)
501
+ for (let o of v)
502
502
  o !== null && (o = o.votant, Array.isArray(o) ? l.push(...o) : (t(o), l.push(o)));
503
503
  if (l.length === 0)
504
504
  delete e.nonVotantsVolontaires;
505
505
  else {
506
506
  e.nonVotantsVolontaires = l;
507
507
  for (const o of l)
508
- I(o);
508
+ T(o);
509
509
  }
510
510
  }
511
511
  }
512
- function W(e) {
512
+ function C(e) {
513
+ f(e), e.abstention !== void 0 && (t.strictEqual(e.abstentions, void 0), e.abstentions = e.abstention, delete e.abstention), e.nonVotant !== void 0 && (t.strictEqual(e.nonVotants, void 0), e.nonVotants = e.nonVotant, delete e.nonVotant);
514
+ }
515
+ function X(e) {
513
516
  f(e);
514
- const n = e.demandeur;
515
- t(n), f(n), t.strictEqual(n.referenceLegislative, void 0);
517
+ const s = e.demandeur;
518
+ t(s), f(s), t.strictEqual(s.referenceLegislative, void 0);
516
519
  const d = e.objet;
517
520
  t(d), f(d), t.strictEqual(d.referenceLegislative, void 0);
518
- let r = e.ventilationVotes;
519
- t(r);
521
+ const n = e.miseAuPoint;
522
+ if (n !== void 0) {
523
+ P(n);
524
+ let v = n.dysfonctionnement;
525
+ v !== void 0 && (P(v), Object.values(v).filter((o) => o !== void 0).length === 0 && delete n.dysfonctionnement), Object.values(n).filter((o) => o !== void 0).length === 0 && delete e.miseAuPoint;
526
+ }
527
+ let u = e.syntheseVote;
528
+ t(u);
529
+ {
530
+ let v = u.decompte;
531
+ t(v), C(v);
532
+ }
533
+ let l = e.ventilationVotes;
534
+ t(l);
520
535
  {
521
- r = r.organe, t(r);
522
- let l = r.groupes;
523
- t(l);
536
+ l = l.organe, t(l);
537
+ let v = l.groupes;
538
+ t(v);
524
539
  {
525
- l = l.groupe, t(Array.isArray(l));
526
- for (const p of l) {
527
- const o = p.vote;
528
- t(o);
540
+ v = v.groupe, t(Array.isArray(v));
541
+ for (const o of v) {
542
+ const r = o.vote;
543
+ t(r);
529
544
  {
530
- const s = o.decompteVoix;
531
- t(s), s.abstention !== void 0 && (t.strictEqual(s.abstentions, void 0), s.abstentions = s.abstention, delete s.abstention), s.nonVotant !== void 0 && (t.strictEqual(s.nonVotants, void 0), s.nonVotants = s.nonVotant, delete s.nonVotant);
532
- const u = o.decompteNominatif;
533
- t(u), T(u);
545
+ const c = r.decompteVoix;
546
+ t(c), C(c);
547
+ const A = r.decompteNominatif;
548
+ t(A), P(A);
534
549
  }
535
550
  }
536
- r.groupes = l;
551
+ l.groupes = v;
537
552
  }
538
- e.ventilationVotes = r;
539
- }
540
- const c = e.miseAuPoint;
541
- if (c !== void 0) {
542
- T(c);
543
- let l = c.dysfonctionnement;
544
- l !== void 0 && (T(l), Object.values(l).filter((p) => p !== void 0).length === 0 && delete c.dysfonctionnement), Object.values(c).filter((p) => p !== void 0).length === 0 && delete e.miseAuPoint;
553
+ e.ventilationVotes = l;
545
554
  }
546
555
  }
547
- function I(e) {
548
- b(e, "parDelegation"), _(e, "numPlace");
556
+ function T(e) {
557
+ b(e, "parDelegation"), w(e, "numPlace");
549
558
  }
550
- function X(e) {
559
+ function z(e) {
551
560
  f(e);
552
561
  }
553
- function z(e) {
562
+ function G(e) {
554
563
  f(e);
555
564
  }
556
565
  export {
557
- $ as cleanActeur,
558
- Y as cleanAmendement,
559
- z as cleanCompteRendu,
560
- w as cleanDocumentOrDivision,
561
- B as cleanDossierParlementaire,
562
- k as cleanOrgane,
563
- X as cleanQuestion,
564
- U as cleanReunion,
565
- W as cleanScrutin
566
+ B as cleanActeur,
567
+ Z as cleanAmendement,
568
+ G as cleanCompteRendu,
569
+ H as cleanDocumentOrDivision,
570
+ k as cleanDossierParlementaire,
571
+ U as cleanOrgane,
572
+ z as cleanQuestion,
573
+ W as cleanReunion,
574
+ X as cleanScrutin
566
575
  };