@tricoteuses/assemblee 3.0.18 → 3.1.1

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.
Files changed (40) hide show
  1. package/README.md +2 -2
  2. package/lib/{amendements-Bab1iUCY.js → amendements-Blw6Aa6-.js} +3 -3
  3. package/lib/amendements-DiMsxlUL.js +178 -0
  4. package/lib/cleaners/actes_legislatifs.d.ts +2 -2
  5. package/lib/cleaners/acteurs.d.ts +7 -2
  6. package/lib/cleaners/amendements.d.ts +2 -2
  7. package/lib/cleaners/documents.d.ts +1 -1
  8. package/lib/cleaners/dossiers_legislatifs.d.ts +1 -1
  9. package/lib/cleaners/organes.d.ts +1 -1
  10. package/lib/cleaners/reunions.d.ts +1 -1
  11. package/lib/cleaners/scrutins.d.ts +10 -2
  12. package/lib/cleaners.js +576 -485
  13. package/lib/datasets.d.ts +2 -6
  14. package/lib/git.js +54 -51
  15. package/lib/index.js +263 -257
  16. package/lib/inserters.d.ts +22 -2
  17. package/lib/loaders.js +495 -544
  18. package/lib/logger.d.ts +1 -1
  19. package/lib/parsers.js +5 -5
  20. package/lib/{questions-BiakXZ6q.js → questions-XokaUGcy.js} +4 -1
  21. package/lib/registries.d.ts +4 -4
  22. package/lib/schemas/clean/acteurs_et_organes.d.ts +37 -37
  23. package/lib/schemas/clean/amendements.d.ts +38 -25
  24. package/lib/schemas/clean/dossiers_legislatifs.d.ts +16 -16
  25. package/lib/schemas/clean/scrutins.d.ts +2 -2
  26. package/lib/schemas/enriched/acteurs_et_organes.d.ts +2 -2
  27. package/lib/schemas/enriched/amendements.d.ts +135 -15
  28. package/lib/schemas/enriched/dossiers_legislatifs.d.ts +12 -12
  29. package/lib/schemas/enriched/scrutins.d.ts +2 -2
  30. package/lib/schemas/raw/acteurs_et_organes.d.ts +99 -99
  31. package/lib/schemas/raw/agendas.d.ts +11 -11
  32. package/lib/schemas/raw/amendements.d.ts +49 -37
  33. package/lib/schemas/raw/dossiers_legislatifs.d.ts +146 -63
  34. package/lib/schemas/raw/questions.d.ts +44 -44
  35. package/lib/schemas/raw/scrutins.d.ts +4 -4
  36. package/lib/scripts/retrieve_documents.d.ts +5 -1
  37. package/lib/scripts/retrieve_open_data.d.ts +4 -0
  38. package/lib/scripts/shared/cli_helpers.d.ts +8 -0
  39. package/package.json +26 -26
  40. package/lib/amendements-BKGwufEi.js +0 -170
@@ -1,170 +0,0 @@
1
- import f from "node:assert";
2
- import { u as m } from "./amendements-Bab1iUCY.js";
3
- const b = {
4
- false: !1,
5
- true: !0
6
- }, y = "http://schemas.assemblee-nationale.fr/referentiel", x = "http://www.w3.org/2001/XMLSchema-instance";
7
- function v(e, i) {
8
- const t = e[i];
9
- if (t == null) {
10
- delete e[i];
11
- return;
12
- }
13
- const r = b[t];
14
- return f.notStrictEqual(
15
- r,
16
- void 0,
17
- `Invalid boolean value: ${i} = ${t}`
18
- ), e[i] = r, r;
19
- }
20
- function O(e, i) {
21
- const t = e[i];
22
- if (t == null) {
23
- delete e[i];
24
- return;
25
- }
26
- const r = Number.parseInt(t);
27
- return f(
28
- !Number.isNaN(r),
29
- `Invalid number value: ${i} = ${t}`
30
- ), e[i] = r, r;
31
- }
32
- function o(e, { recursive: i } = {}) {
33
- if (e != null) {
34
- if (Array.isArray(e)) {
35
- if (e.length === 0)
36
- return;
37
- if (i)
38
- for (const [t, r] of e.entries()) {
39
- const a = o(r, { recursive: i });
40
- a !== r && (e[t] = a ?? null);
41
- }
42
- return e;
43
- }
44
- if (typeof e == "object" && e.constructor === Object) {
45
- const t = e;
46
- if (Object.keys(t).length === 0 || t["@xsi:nil"] === "true")
47
- return;
48
- const r = t["@xmlns"] ?? t.xmlns;
49
- if (r !== void 0 && (f.strictEqual(r, y), delete t["@xmlns"], delete t.xmlns), t["@xmlns:xsi"] === x && delete t["@xmlns:xsi"], i)
50
- for (const [a, c] of Object.entries(t)) {
51
- const d = o(c, { recursive: i });
52
- d === void 0 ? delete t[a] : d !== c && (t[a] = d);
53
- }
54
- else
55
- for (const [a, c] of Object.entries(t))
56
- (c == null || c["@xsi:nil"] === "true" || Array.isArray(c) && c.length === 0 || !Array.isArray(c) && c.constructor === Object && Object.keys(c).length === 0) && delete t[a];
57
- return Object.keys(t).length === 0 ? void 0 : t;
58
- }
59
- return e;
60
- }
61
- }
62
- function _(e) {
63
- o(e);
64
- const i = e.signataires;
65
- {
66
- o(i);
67
- const s = i.auteur;
68
- if (o(s), i.cosignataires !== void 0) {
69
- const l = i.cosignataires.acteurRef;
70
- Array.isArray(l) ? i.cosignatairesRefs = l : (f(l), i.cosignatairesRefs = [l]), delete i.cosignataires;
71
- }
72
- let n = i.libelle;
73
- n !== void 0 && (n = n.replace(/ |\u00A0/g, " ").split(" ").filter(Boolean).join(" "), n ? i.libelle = n : delete i.libelle);
74
- }
75
- const t = e.pointeurFragmentTexte;
76
- {
77
- o(t);
78
- const s = t.division;
79
- if (s !== void 0) {
80
- o(s);
81
- let l = s.avant_A_Apres;
82
- l !== void 0 && (delete s.avant_A_Apres, l === "Après" && (l = "Apres"), s.avantAApres = l);
83
- }
84
- const n = t.amendementStandard;
85
- if (n !== void 0) {
86
- o(n);
87
- const l = n.alinea;
88
- if (l !== void 0) {
89
- o(l);
90
- let u = l.avant_A_Apres;
91
- u !== void 0 && (delete l.avant_A_Apres, u === "Après" ? u = "Apres" : m.includes(u) || (u = "A"), l.avantAApres = u), t.alinea = l;
92
- }
93
- delete t.amendementStandard;
94
- }
95
- }
96
- const r = e.corps;
97
- if (r !== void 0) {
98
- o(r);
99
- const s = r.contenuAuteur;
100
- if (s !== void 0) {
101
- o(s);
102
- const n = s.avantAppel;
103
- n !== void 0 && (o(n), A(n.dispositifAmdtCreditPLF, {
104
- rectificatif: !1
105
- }), A(n.dispositifAmdtCreditPLFR, {
106
- rectificatif: !0
107
- }), Object.keys(n).length === 0 && delete s.avantAppel), f.strictEqual(s.annexeExposeSommaire, void 0), A(s.dispositifAmdtCreditPLF, {
108
- rectificatif: !1
109
- }), A(s.dispositifAmdtCreditPLFR, {
110
- rectificatif: !0
111
- });
112
- }
113
- }
114
- const a = e.cycleDeVie;
115
- if (a !== void 0) {
116
- o(a);
117
- const s = a.etatDesTraitements;
118
- {
119
- o(s);
120
- const n = s.etat;
121
- o(n);
122
- const l = s.sousEtat;
123
- l !== void 0 && o(l);
124
- }
125
- }
126
- if (e.representations !== void 0) {
127
- const s = e.representations.representation;
128
- f(!Array.isArray(s)), e.representation = s, delete e.representations;
129
- {
130
- o(s), f.strictEqual(s.repSource, void 0), f.strictEqual(s.offset, void 0), f.strictEqual(s.dateDispoRepresentation, void 0);
131
- const n = s.statutRepresentation;
132
- v(n, "canonique"), v(n, "enregistrement"), v(n, "officielle"), v(n, "transcription"), v(n, "verbatim");
133
- }
134
- }
135
- const c = e.loiReference;
136
- c !== void 0 && o(c);
137
- const d = e.discussionCommune;
138
- d !== void 0 && o(d);
139
- const p = e.discussionIdentique;
140
- return p !== void 0 && o(p), e;
141
- }
142
- function A(e, { rectificatif: i }) {
143
- if (e !== void 0) {
144
- const t = e.listeProgrammes?.programme;
145
- if (t !== void 0) {
146
- Array.isArray(t) ? e.listeProgrammes = t : (f(t), e.listeProgrammes = [t]);
147
- for (const r of e.listeProgrammes)
148
- if (o(r), r.lignesCredits !== void 0) {
149
- let a = r.lignesCredits.ligneCredit;
150
- if (a === void 0 ? delete r.lignesCredits : (Array.isArray(a) || (f(a), a = [a]), r.lignesCredits = a), a !== void 0)
151
- for (const c of a)
152
- i ? g(c) : o(c);
153
- }
154
- }
155
- }
156
- }
157
- function g(e) {
158
- if (o(e), e.lignesCredits !== void 0) {
159
- let i = e.lignesCredits.ligneCredit;
160
- if (i === void 0 ? delete e.lignesCredits : (Array.isArray(i) || (f(i), i = [i]), e.lignesCredits = i), i !== void 0)
161
- for (const t of i)
162
- g(t);
163
- }
164
- }
165
- export {
166
- v as a,
167
- O as b,
168
- o as c,
169
- _ as d
170
- };