@e4779/pi-fabric 0.116.0-fork.26 → 0.117.2-fork.29

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 (179) hide show
  1. package/THIRD_PARTY_NOTICES.md +2 -2
  2. package/dist/agents.js +3 -3
  3. package/dist/chunks/{chunk-HZGQ7XYM.js → chunk-3FJUP3GV.js} +2 -2
  4. package/dist/chunks/{chunk-U2UBUKNQ.js → chunk-3UGN25XS.js} +2 -2
  5. package/dist/chunks/{chunk-HITKWKYD.js → chunk-4EW7GVUR.js} +192 -326
  6. package/dist/chunks/chunk-4EW7GVUR.js.map +7 -0
  7. package/dist/chunks/{chunk-VR2LV4CA.js → chunk-53N2I4QA.js} +2 -2
  8. package/dist/chunks/{chunk-IQXNJNDI.js → chunk-5UBRGTVN.js} +8 -8
  9. package/dist/chunks/{chunk-4GNFBZPR.js → chunk-ASSLHWZS.js} +2 -2
  10. package/dist/chunks/{chunk-DLXPTBPL.js → chunk-AV36PBKH.js} +9 -1
  11. package/dist/chunks/chunk-AV36PBKH.js.map +7 -0
  12. package/dist/chunks/chunk-BN7F52EG.js +525 -0
  13. package/dist/chunks/chunk-BN7F52EG.js.map +7 -0
  14. package/dist/chunks/{chunk-QGP7AY2R.js → chunk-C7Z6F3SO.js} +2 -2
  15. package/dist/chunks/{chunk-56RFFBBO.js → chunk-CRRUW26I.js} +12 -12
  16. package/dist/chunks/{chunk-I2TK65VR.js → chunk-D5NYNIST.js} +5 -5
  17. package/dist/chunks/{chunk-KBYSGB7E.js → chunk-EFETPXU2.js} +69 -229
  18. package/dist/chunks/chunk-EFETPXU2.js.map +7 -0
  19. package/dist/chunks/{chunk-QQ7D6UAM.js → chunk-EHQQ4KCX.js} +2 -2
  20. package/dist/chunks/{chunk-7EYJE4TW.js → chunk-EKODKR6Y.js} +55 -6
  21. package/dist/chunks/chunk-EKODKR6Y.js.map +7 -0
  22. package/dist/chunks/{chunk-ODYU3IJU.js → chunk-FE6NOAO7.js} +5 -5
  23. package/dist/chunks/{chunk-ODYU3IJU.js.map → chunk-FE6NOAO7.js.map} +2 -2
  24. package/dist/chunks/{chunk-H3SGA7G7.js → chunk-FIDUHKMM.js} +5 -5
  25. package/dist/chunks/{chunk-4GGBND7V.js → chunk-FSYAGCGA.js} +2 -2
  26. package/dist/chunks/{chunk-ZPI4QTOX.js → chunk-FUY6XVRX.js} +2 -2
  27. package/dist/chunks/{chunk-A5XF3ZPJ.js → chunk-G4TLWHRS.js} +2 -2
  28. package/dist/chunks/{chunk-PTZ5DKAB.js → chunk-G54PEZ44.js} +4 -3
  29. package/dist/chunks/chunk-G54PEZ44.js.map +7 -0
  30. package/dist/chunks/{chunk-7C5IEIQK.js → chunk-GEQMQVNS.js} +2 -2
  31. package/dist/chunks/{chunk-DONS3EZH.js → chunk-GIK2WNAK.js} +2 -2
  32. package/dist/chunks/{chunk-MOJBW5X2.js → chunk-GO32KSEZ.js} +5 -3
  33. package/dist/chunks/chunk-GO32KSEZ.js.map +7 -0
  34. package/dist/chunks/{chunk-HQ5YW2OJ.js → chunk-HP5P7NBO.js} +2 -2
  35. package/dist/chunks/{chunk-R2MMPHR2.js → chunk-INRXG4J5.js} +2 -2
  36. package/dist/chunks/{chunk-BQWJ5ZR7.js → chunk-K7J2ABAZ.js} +3 -3
  37. package/dist/chunks/{chunk-OTHMEDN6.js → chunk-KVYNGDGC.js} +6 -6
  38. package/dist/chunks/{chunk-6EVAHJAR.js → chunk-LEU5CDSL.js} +3 -3
  39. package/dist/chunks/{chunk-V2IV4LYW.js → chunk-LNASO4VT.js} +3 -3
  40. package/dist/chunks/{chunk-HCNHKJDA.js → chunk-MLLYR3Y6.js} +2 -2
  41. package/dist/chunks/{chunk-D3W6CBJZ.js → chunk-MZUC6LLH.js} +4 -4
  42. package/dist/chunks/{chunk-D3IONBBJ.js → chunk-P7CBPPHY.js} +5 -5
  43. package/dist/chunks/{chunk-WQ6LC2KK.js → chunk-QT4W5YVB.js} +2 -2
  44. package/dist/chunks/{chunk-TNPZBMYC.js → chunk-ROTCDDOV.js} +4 -4
  45. package/dist/chunks/{chunk-PH4PT6R4.js → chunk-TIIIHPHF.js} +2 -2
  46. package/dist/chunks/{chunk-2YG4ZA2K.js → chunk-TIJ3YQXX.js} +2 -2
  47. package/dist/chunks/{chunk-QCCPR3U5.js → chunk-UOM37PE4.js} +4 -4
  48. package/dist/chunks/{chunk-EQYQICUY.js → chunk-UXIBKMUM.js} +3 -3
  49. package/dist/chunks/{chunk-O7IREHJI.js → chunk-XCEEQ5AB.js} +318 -39
  50. package/dist/chunks/chunk-XCEEQ5AB.js.map +7 -0
  51. package/dist/chunks/{chunk-JV4JR6TT.js → chunk-ZEXCKK4K.js} +3 -3
  52. package/dist/cli/decisions.js +1 -1
  53. package/dist/cli/mesh.js +2 -2
  54. package/dist/commands/fabric.d.ts.map +1 -1
  55. package/dist/compaction/hook.js +6 -6
  56. package/dist/compaction/owner.js +7 -7
  57. package/dist/components/configuration.js +4 -4
  58. package/dist/core/action-registry.js +6 -6
  59. package/dist/core/provider-operations.js +53 -154
  60. package/dist/core/provider-operations.js.map +2 -2
  61. package/dist/durable.js +2 -2
  62. package/dist/durable.js.map +1 -1
  63. package/dist/entropy/index.js +8 -8
  64. package/dist/extension-bootstrap.js +16 -16
  65. package/dist/fabric-runtime-state.js +42 -42
  66. package/dist/index.js +20 -20
  67. package/dist/jev/client.js +3 -3
  68. package/dist/jev/decision-types.d.ts +16 -0
  69. package/dist/jev/decision-types.d.ts.map +1 -1
  70. package/dist/jev/guest-types.d.ts +1 -1
  71. package/dist/jev/guest-types.d.ts.map +1 -1
  72. package/dist/jev/observation.js +7 -7
  73. package/dist/jev/routes.d.ts +1 -1
  74. package/dist/jev/routes.d.ts.map +1 -1
  75. package/dist/jev.js +12 -12
  76. package/dist/memory/digest.js +2 -2
  77. package/dist/memory/discovery.js +6 -6
  78. package/dist/memory/file-worker.js +9 -9
  79. package/dist/memory/normalize.js +5 -5
  80. package/dist/memory/search.js +7 -7
  81. package/dist/memory/worker-provider.js +10 -10
  82. package/dist/memory.js +10 -10
  83. package/dist/providers/jev-provider.js +12 -12
  84. package/dist/providers/memory-provider.js +9 -9
  85. package/dist/residency/host.js +12 -12
  86. package/dist/residency/pi-entry.js +12 -12
  87. package/dist/runtime/core-override-guest-types.js +2 -2
  88. package/dist/runtime/guest-types.d.ts +1 -1
  89. package/dist/runtime/guest-types.d.ts.map +1 -1
  90. package/dist/runtime/guest-types.js +1 -1
  91. package/dist/runtime/monty-runtime.js +3 -3
  92. package/dist/runtime/typescript-kernel.js +2 -2
  93. package/dist/type-error-guidance.js +1 -1
  94. package/dist/ui/controller.d.ts +2 -0
  95. package/dist/ui/controller.d.ts.map +1 -1
  96. package/dist/ui/conversation.js +1 -1
  97. package/dist/ui/dashboard-detail.d.ts.map +1 -1
  98. package/dist/ui/dashboard.js +6 -5
  99. package/dist/ui/dashboard.js.map +2 -2
  100. package/dist/ui/settings.js +3 -3
  101. package/dist/ui/transcript-parser.d.ts.map +1 -1
  102. package/dist/ui/transcript-reader.d.ts +1 -0
  103. package/dist/ui/transcript-reader.d.ts.map +1 -1
  104. package/dist/ui/transcript-sanitization.d.ts +2 -0
  105. package/dist/ui/transcript-sanitization.d.ts.map +1 -1
  106. package/dist/ui/transcript.d.ts +1 -1
  107. package/dist/ui/transcript.d.ts.map +1 -1
  108. package/dist/ui/widget-activity.d.ts +21 -0
  109. package/dist/ui/widget-activity.d.ts.map +1 -0
  110. package/dist/ui/widget.d.ts +40 -3
  111. package/dist/ui/widget.d.ts.map +1 -1
  112. package/dist/verified/generated/authority-kernel.d.ts +1 -1
  113. package/dist/verified/generated/authority-kernel.js +61 -157
  114. package/dist/verified/generated/kernel.d.ts +8 -8
  115. package/dist/verified/generated/kernel.js +205 -449
  116. package/dist/verified/generated/lifecycle-kernel.d.ts +1 -1
  117. package/dist/verified/generated/lifecycle-kernel.js +95 -133
  118. package/dist/verified/generated/manifest.json +18 -18
  119. package/dist/verified/generated/provider-kernel.d.ts +1 -1
  120. package/dist/verified/generated/provider-kernel.js +48 -149
  121. package/dist/verified/generated/storage-kernel.d.ts +2 -2
  122. package/dist/verified/generated/storage-kernel.js +59 -219
  123. package/dist/verified/nat.d.ts.map +1 -1
  124. package/dist/verified/policy.d.ts.map +1 -1
  125. package/docs/configuration.md +1 -1
  126. package/docs/durable-pi.md +2 -2
  127. package/docs/interface.md +4 -0
  128. package/docs/jev.md +2 -2
  129. package/docs/provider-capabilities.md +1 -1
  130. package/docs/verified-kernels.md +4 -3
  131. package/package.json +9 -9
  132. package/proofs/abi.json +11 -11
  133. package/proofs/authority-types.d.ts +1 -1
  134. package/proofs/lifecycle-types.d.ts +1 -1
  135. package/proofs/provider-types.d.ts +1 -1
  136. package/proofs/storage-types.d.ts +2 -2
  137. package/proofs/types.d.ts +4 -4
  138. package/scripts/test-verified-kernels.mjs +1 -1
  139. package/scripts/verified-kernels.mjs +1 -1
  140. package/dist/chunks/chunk-7EYJE4TW.js.map +0 -7
  141. package/dist/chunks/chunk-DLXPTBPL.js.map +0 -7
  142. package/dist/chunks/chunk-HITKWKYD.js.map +0 -7
  143. package/dist/chunks/chunk-KBYSGB7E.js.map +0 -7
  144. package/dist/chunks/chunk-MOJBW5X2.js.map +0 -7
  145. package/dist/chunks/chunk-O7IREHJI.js.map +0 -7
  146. package/dist/chunks/chunk-PTZ5DKAB.js.map +0 -7
  147. package/dist/chunks/chunk-WTLH5RY4.js +0 -760
  148. package/dist/chunks/chunk-WTLH5RY4.js.map +0 -7
  149. /package/dist/chunks/{chunk-HZGQ7XYM.js.map → chunk-3FJUP3GV.js.map} +0 -0
  150. /package/dist/chunks/{chunk-U2UBUKNQ.js.map → chunk-3UGN25XS.js.map} +0 -0
  151. /package/dist/chunks/{chunk-VR2LV4CA.js.map → chunk-53N2I4QA.js.map} +0 -0
  152. /package/dist/chunks/{chunk-IQXNJNDI.js.map → chunk-5UBRGTVN.js.map} +0 -0
  153. /package/dist/chunks/{chunk-4GNFBZPR.js.map → chunk-ASSLHWZS.js.map} +0 -0
  154. /package/dist/chunks/{chunk-QGP7AY2R.js.map → chunk-C7Z6F3SO.js.map} +0 -0
  155. /package/dist/chunks/{chunk-56RFFBBO.js.map → chunk-CRRUW26I.js.map} +0 -0
  156. /package/dist/chunks/{chunk-I2TK65VR.js.map → chunk-D5NYNIST.js.map} +0 -0
  157. /package/dist/chunks/{chunk-QQ7D6UAM.js.map → chunk-EHQQ4KCX.js.map} +0 -0
  158. /package/dist/chunks/{chunk-H3SGA7G7.js.map → chunk-FIDUHKMM.js.map} +0 -0
  159. /package/dist/chunks/{chunk-4GGBND7V.js.map → chunk-FSYAGCGA.js.map} +0 -0
  160. /package/dist/chunks/{chunk-ZPI4QTOX.js.map → chunk-FUY6XVRX.js.map} +0 -0
  161. /package/dist/chunks/{chunk-A5XF3ZPJ.js.map → chunk-G4TLWHRS.js.map} +0 -0
  162. /package/dist/chunks/{chunk-7C5IEIQK.js.map → chunk-GEQMQVNS.js.map} +0 -0
  163. /package/dist/chunks/{chunk-DONS3EZH.js.map → chunk-GIK2WNAK.js.map} +0 -0
  164. /package/dist/chunks/{chunk-HQ5YW2OJ.js.map → chunk-HP5P7NBO.js.map} +0 -0
  165. /package/dist/chunks/{chunk-R2MMPHR2.js.map → chunk-INRXG4J5.js.map} +0 -0
  166. /package/dist/chunks/{chunk-BQWJ5ZR7.js.map → chunk-K7J2ABAZ.js.map} +0 -0
  167. /package/dist/chunks/{chunk-OTHMEDN6.js.map → chunk-KVYNGDGC.js.map} +0 -0
  168. /package/dist/chunks/{chunk-6EVAHJAR.js.map → chunk-LEU5CDSL.js.map} +0 -0
  169. /package/dist/chunks/{chunk-V2IV4LYW.js.map → chunk-LNASO4VT.js.map} +0 -0
  170. /package/dist/chunks/{chunk-HCNHKJDA.js.map → chunk-MLLYR3Y6.js.map} +0 -0
  171. /package/dist/chunks/{chunk-D3W6CBJZ.js.map → chunk-MZUC6LLH.js.map} +0 -0
  172. /package/dist/chunks/{chunk-D3IONBBJ.js.map → chunk-P7CBPPHY.js.map} +0 -0
  173. /package/dist/chunks/{chunk-WQ6LC2KK.js.map → chunk-QT4W5YVB.js.map} +0 -0
  174. /package/dist/chunks/{chunk-TNPZBMYC.js.map → chunk-ROTCDDOV.js.map} +0 -0
  175. /package/dist/chunks/{chunk-PH4PT6R4.js.map → chunk-TIIIHPHF.js.map} +0 -0
  176. /package/dist/chunks/{chunk-2YG4ZA2K.js.map → chunk-TIJ3YQXX.js.map} +0 -0
  177. /package/dist/chunks/{chunk-QCCPR3U5.js.map → chunk-UOM37PE4.js.map} +0 -0
  178. /package/dist/chunks/{chunk-EQYQICUY.js.map → chunk-UXIBKMUM.js.map} +0 -0
  179. /package/dist/chunks/{chunk-JV4JR6TT.js.map → chunk-ZEXCKK4K.js.map} +0 -0
@@ -0,0 +1,525 @@
1
+ // src/verified/generated/kernel.js
2
+ function x(e, n) {
3
+ return { $: e < n ? "LT" : e === n ? "EQ" : "GT" };
4
+ }
5
+ function g(e) {
6
+ if (e > 281474976710655)
7
+ throw "bend: a Nat past the largest immediate 2^48-1";
8
+ return e;
9
+ }
10
+ function h(e) {
11
+ return Number.isInteger(e) && e >= 0 && e <= 2 ** 53 ? e : g(1 / 0);
12
+ }
13
+ function z(e) {
14
+ for (; e !== null && typeof e == "object" && e.$ === "$JMP"; )
15
+ e = e.f(e.x);
16
+ return e;
17
+ }
18
+ function c(e, n) {
19
+ return (...t) => t.length < n ? c((...r) => e(...t, ...r), n - t.length) : z(e(...t));
20
+ }
21
+ function b(e, n, t) {
22
+ for (; ; ) {
23
+ let r = e, $ = n, u = t;
24
+ if (r.$ === "Nil")
25
+ return $.$ === "Nil" ? u : false;
26
+ {
27
+ let l = r.head, a = r.tail;
28
+ if ($.$ === "Nil")
29
+ return false;
30
+ {
31
+ let d = $.head, N = $.tail;
32
+ e = a, n = N, t = f(u, m(l, d));
33
+ continue;
34
+ }
35
+ }
36
+ }
37
+ }
38
+ function y(e) {
39
+ return e.$ !== "Nil";
40
+ }
41
+ function E(e, n) {
42
+ for (; ; ) {
43
+ let t = e, r = n;
44
+ if (t.$ === "Nil")
45
+ return true;
46
+ {
47
+ let $ = t.tail;
48
+ if (r === 0)
49
+ return false;
50
+ {
51
+ let u = r - 1;
52
+ e = $, n = u;
53
+ continue;
54
+ }
55
+ }
56
+ }
57
+ }
58
+ function T(e) {
59
+ return f(y(e), C(b(e, { $: "Con", head: 42, tail: { $: "Nil" } }, true)));
60
+ }
61
+ function W(e) {
62
+ return f(y(e), f(E(e, 256), C(b(e, { $: "Con", head: 42, tail: { $: "Nil" } }, true))));
63
+ }
64
+ function w(e, n, t) {
65
+ for (; ; ) {
66
+ let r = e, $ = n, u = t;
67
+ if (r.$ === "Nil")
68
+ return u;
69
+ {
70
+ let l = r.head, a = r.tail, d = b($, l, true);
71
+ e = a, n = $, t = u || d;
72
+ continue;
73
+ }
74
+ }
75
+ }
76
+ function k(e, n, t) {
77
+ for (; ; ) {
78
+ let r = e, $ = n, u = t;
79
+ if (r.$ === "Nil")
80
+ return u;
81
+ {
82
+ let l = r.head;
83
+ e = r.tail, n = $, t = f(u, w($, l, false));
84
+ continue;
85
+ }
86
+ }
87
+ }
88
+ function q(e, n) {
89
+ for (; ; ) {
90
+ let t = e, r = n;
91
+ if (t.$ === "Nil")
92
+ return true;
93
+ {
94
+ let $ = t.tail;
95
+ if (r === 0)
96
+ return false;
97
+ {
98
+ let u = r - 1;
99
+ e = $, n = u;
100
+ continue;
101
+ }
102
+ }
103
+ }
104
+ }
105
+ function G(e, n) {
106
+ for (; ; ) {
107
+ let t = e, r = n;
108
+ if (t.$ === "Nil")
109
+ return r;
110
+ {
111
+ let $ = t.head;
112
+ e = t.tail, n = f(r, W($));
113
+ continue;
114
+ }
115
+ }
116
+ }
117
+ function V(e, n) {
118
+ for (; ; ) {
119
+ let t = e, r = n;
120
+ if (t.$ === "Nil")
121
+ return r;
122
+ {
123
+ let $ = t.head;
124
+ e = t.tail, n = f(r, T($));
125
+ continue;
126
+ }
127
+ }
128
+ }
129
+ function S(e) {
130
+ return e.$ !== "Nil";
131
+ }
132
+ function A(e, n) {
133
+ return e ? { $: "resources.Exact", names: n } : { $: "resources.Unknown" };
134
+ }
135
+ function j(e) {
136
+ return A(f(S(e), V(e, true)), e);
137
+ }
138
+ function B(e) {
139
+ return f(S(e), f(q(e, 64), G(e, true)));
140
+ }
141
+ function F(e, n, t) {
142
+ return e ? f(k(n, t, true), k(t, n, true)) : false;
143
+ }
144
+ function M(e, n) {
145
+ return F(B(n), e, n);
146
+ }
147
+ function P(e, n) {
148
+ if (e.$ === "resources.Unknown")
149
+ return { $: "resources.Unknown" };
150
+ {
151
+ let t = e.names;
152
+ return A(M(t, n), n);
153
+ }
154
+ }
155
+ function R(e, n, t) {
156
+ for (; ; ) {
157
+ let r = e, $ = n, u = t;
158
+ if (r.$ === "Nil")
159
+ return u;
160
+ {
161
+ let l = r.head, a = r.tail, d = w($, l, false);
162
+ e = a, n = $, t = u || d;
163
+ continue;
164
+ }
165
+ }
166
+ }
167
+ function I(e, n) {
168
+ if (e.$ === "resources.Unknown")
169
+ return true;
170
+ {
171
+ let t = e.names;
172
+ if (n.$ === "resources.Unknown")
173
+ return true;
174
+ {
175
+ let r = n.names;
176
+ return R(t, r, false);
177
+ }
178
+ }
179
+ }
180
+ function v(e, n, t, r) {
181
+ return f(t || r, I(e, n));
182
+ }
183
+ function J(e, n) {
184
+ if (e.$ === "resources.Quiet")
185
+ return false;
186
+ {
187
+ let t = e.ordered, r = e.scope;
188
+ if (n.$ === "resources.Quiet")
189
+ return false;
190
+ {
191
+ let $ = n.ordered, u = n.scope;
192
+ return v(r, u, t, $);
193
+ }
194
+ }
195
+ }
196
+ function L(e, n, t) {
197
+ for (; ; ) {
198
+ let r = e, $ = n, u = t;
199
+ if (r.$ === "Nil")
200
+ return u;
201
+ {
202
+ let l = r.head, a = r.tail, d = J($, l);
203
+ e = a, n = $, t = u || d;
204
+ continue;
205
+ }
206
+ }
207
+ }
208
+ function O(e, n, t) {
209
+ for (; ; ) {
210
+ let r = e, $ = n, u = t;
211
+ if (r.$ === "Nil")
212
+ return u;
213
+ {
214
+ let l = r.head, a = r.tail, d = L($, l, false);
215
+ e = a, n = $, t = u || d;
216
+ continue;
217
+ }
218
+ }
219
+ }
220
+ function _(e) {
221
+ for (; ; ) {
222
+ let n = e;
223
+ if (n.$ === "Nil")
224
+ return true;
225
+ if (n.head) {
226
+ e = n.tail;
227
+ continue;
228
+ } else
229
+ return false;
230
+ }
231
+ }
232
+ function K(e, n, t, r, $, u) {
233
+ let l = f(e, n || u), a = f(r, $ || t);
234
+ return l || a;
235
+ }
236
+ function X(e, n, t, r) {
237
+ return { $: "Con", head: C(e), tail: { $: "Con", head: n, tail: { $: "Con", head: t, tail: { $: "Con", head: C(r), tail: { $: "Nil" } } } } };
238
+ }
239
+ function Y(e, n, t, r) {
240
+ return _(X(e, n, t, r));
241
+ }
242
+ function ne(e, n) {
243
+ return e ? 2 : n ? 1 : 0;
244
+ }
245
+ function te(e, n) {
246
+ let t = n.first, r = n.last, $ = n.paired, u = C($), l = p(e, t), a = u || l, d = r < e;
247
+ return a || d;
248
+ }
249
+ function Q(e, n) {
250
+ if (e.$ === "Nil")
251
+ return { $: "Nil" };
252
+ {
253
+ let t = e.head, r = e.tail;
254
+ return { $: "Con", head: te(n, t), tail: Q(r, n) };
255
+ }
256
+ }
257
+ function U(e, n) {
258
+ return _(Q(e, n));
259
+ }
260
+ function re(e) {
261
+ let n = e.eligible, t = e.afterPrevious, r = e.retained, $ = e.budget, u = e.boundary, l = e.spans;
262
+ return { $: "Con", head: n, tail: { $: "Con", head: t, tail: { $: "Con", head: p(r, $), tail: { $: "Con", head: U(l, u), tail: { $: "Nil" } } } } };
263
+ }
264
+ function ie(e) {
265
+ return _(re(e));
266
+ }
267
+ function oe(e, n) {
268
+ return e || n;
269
+ }
270
+ function $e(e, n) {
271
+ return _({ $: "Con", head: e, tail: { $: "Con", head: n, tail: { $: "Nil" } } });
272
+ }
273
+ function ue(e) {
274
+ let n = e.start, t = e.end, r = e.total, $ = e.expectedStart, u = e.expectedTotal, l = e.length, a = e.complete, d = m(t, r), N = n < t;
275
+ return { $: "Con", head: m(n, $), tail: { $: "Con", head: m(r, u), tail: { $: "Con", head: p(n, t), tail: { $: "Con", head: p(t, r), tail: { $: "Con", head: m(l, t < n ? 0 : t - n), tail: { $: "Con", head: C(a !== d), tail: { $: "Con", head: a || N, tail: { $: "Nil" } } } } } } } };
276
+ }
277
+ function le(e) {
278
+ return _(ue(e));
279
+ }
280
+ function ae(e, n) {
281
+ return _({ $: "Con", head: e, tail: { $: "Con", head: C(n), tail: { $: "Nil" } } });
282
+ }
283
+ function ce(e, n, t, r) {
284
+ return { $: "Con", head: C(e), tail: { $: "Con", head: n, tail: { $: "Con", head: t, tail: { $: "Con", head: r, tail: { $: "Nil" } } } } };
285
+ }
286
+ function se(e, n, t, r) {
287
+ return _(ce(e, n, t, r));
288
+ }
289
+ function fe(e, n, t, r, $) {
290
+ let u = f(r, $);
291
+ return _({ $: "Con", head: e, tail: { $: "Con", head: n, tail: { $: "Con", head: t || u, tail: { $: "Nil" } } } });
292
+ }
293
+ function de(e) {
294
+ return _(e);
295
+ }
296
+ function _e(e) {
297
+ return { $: "Tuple", fst: e, snd: false };
298
+ }
299
+ function he(e, n, t) {
300
+ return f(e, n || t);
301
+ }
302
+ function Ce(e, n, t, r) {
303
+ return _({ $: "Con", head: p(e, n), tail: { $: "Con", head: p(t, r), tail: { $: "Nil" } } });
304
+ }
305
+ function pe(e, n, t, r) {
306
+ let $ = n;
307
+ return _({ $: "Con", head: m(e, g($ + t)), tail: { $: "Con", head: p($, r), tail: { $: "Nil" } } });
308
+ }
309
+ function me(e) {
310
+ return j(e);
311
+ }
312
+ function Ne(e, n) {
313
+ return P(e, n);
314
+ }
315
+ function xe(e, n) {
316
+ return O(e, n, false);
317
+ }
318
+ function f(e, n) {
319
+ return e ? n : false;
320
+ }
321
+ function m(e, n) {
322
+ return ge(x(e, n));
323
+ }
324
+ function C(e) {
325
+ return !e;
326
+ }
327
+ function p(e, n) {
328
+ return ye(x(e, n));
329
+ }
330
+ function ge(e) {
331
+ return e.$ === "EQ";
332
+ }
333
+ function ye(e) {
334
+ return e.$ !== "GT";
335
+ }
336
+ var o = /* @__PURE__ */ new Map([["Unknown", "resources.Unknown"], ["Exact", "resources.Exact"], ["Quiet", "resources.Quiet"]]);
337
+ var s = /* @__PURE__ */ new Map([["resources.Unknown", "Unknown"], ["resources.Exact", "Exact"], ["resources.Quiet", "Quiet"]]);
338
+ function i(e, n) {
339
+ let t = [e];
340
+ for (let r = [[t, 0]]; r.length > 0; ) {
341
+ let [$, u] = r.pop(), l = $[u];
342
+ if (l === null || typeof l != "object") continue;
343
+ let a = Array.isArray(l) ? [...l] : { ...l };
344
+ typeof a.$ == "string" && (a.$ = n.get(a.$) ?? a.$), $[u] = a;
345
+ for (let d of Object.keys(a)) r.push([a, d]);
346
+ }
347
+ return t[0];
348
+ }
349
+ var Se = /* @__PURE__ */ c((e, n, t, r, $, u) => K(e, n, t, r, $, u), 6);
350
+ var Ae = (e, n, t, r, $, u) => i(Se(i(e, o), i(n, o), i(t, o), i(r, o), i($, o), i(u, o)), s);
351
+ var ve = /* @__PURE__ */ c((e, n, t, r) => Y(e, n, t, r), 4);
352
+ var Qe = (e, n, t, r) => i(ve(i(e, o), i(n, o), i(t, o), i(r, o)), s);
353
+ var Ee = /* @__PURE__ */ c((e, n) => ne(e, n), 2);
354
+ var Te = (e, n) => i(Ee(i(e, o), i(n, o)), s);
355
+ var Ge = /* @__PURE__ */ c((e) => ie(e), 1);
356
+ var Ve = (e) => i(Ge(i(e, o)), s);
357
+ var je = /* @__PURE__ */ c((e, n) => $e(e, n), 2);
358
+ var Be = (e, n) => i(je(i(e, o), i(n, o)), s);
359
+ var Fe = /* @__PURE__ */ c((e) => le(e), 1);
360
+ var Me = (e) => i(Fe(i(e, o)), s);
361
+ var Pe = /* @__PURE__ */ c((e, n) => ae(e, n), 2);
362
+ var Re = (e, n) => i(Pe(i(e, o), i(n, o)), s);
363
+ var Ie = /* @__PURE__ */ c((e, n, t, r) => se(e, n, t, r), 4);
364
+ var Je = (e, n, t, r) => i(Ie(i(e, o), i(n, o), i(t, o), i(r, o)), s);
365
+ var Le = /* @__PURE__ */ c((e, n, t, r, $) => fe(e, n, t, r, $), 5);
366
+ var Oe = (e, n, t, r, $) => i(Le(i(e, o), i(n, o), i(t, o), i(r, o), i($, o)), s);
367
+ var De = /* @__PURE__ */ c((e) => de(e), 1);
368
+ var He = (e) => i(De(i(e, o)), s);
369
+ var Ke = /* @__PURE__ */ c((e) => _e(e), 1);
370
+ var Xe = (e) => i(Ke(i(e, o)), s);
371
+ var Ye = /* @__PURE__ */ c((e, n) => oe(e, n), 2);
372
+ var Ze = (e, n) => i(Ye(i(e, o), i(n, o)), s);
373
+ var en = /* @__PURE__ */ c((e, n, t) => he(e, n, t), 3);
374
+ var nn = (e, n, t) => i(en(i(e, o), i(n, o), i(t, o)), s);
375
+ var tn = /* @__PURE__ */ c((e, n, t, r) => Ce(h(e), h(n), h(t), h(r)), 4);
376
+ var rn = (e, n, t, r) => i(tn(i(e, o), i(n, o), i(t, o), i(r, o)), s);
377
+ var on = /* @__PURE__ */ c((e, n, t, r) => pe(h(e), h(n), h(t), h(r)), 4);
378
+ var $n = (e, n, t, r) => i(on(i(e, o), i(n, o), i(t, o), i(r, o)), s);
379
+ var un = /* @__PURE__ */ c((e) => me(e), 1);
380
+ var ln = (e) => i(un(i(e, o)), s);
381
+ var an = /* @__PURE__ */ c((e, n) => Ne(e, n), 2);
382
+ var cn = (e, n) => i(an(i(e, o), i(n, o)), s);
383
+ var dn = /* @__PURE__ */ c((e, n) => xe(e, n), 2);
384
+ var _n = (e, n) => i(dn(i(e, o), i(n, o)), s);
385
+
386
+ // src/verified/nat.ts
387
+ var BEND_NAT_MAX = 2 ** 48 - 1;
388
+
389
+ // src/verified/resources.ts
390
+ var encodeResourceNames = (values) => {
391
+ let names = { $: "Nil" };
392
+ const cache = /* @__PURE__ */ new Map();
393
+ const input = Array.isArray(values) ? values : [];
394
+ for (let i2 = input.length - 1; i2 >= 0; i2--) {
395
+ const value = input[i2];
396
+ let name = { $: "Nil" };
397
+ if (typeof value === "string") {
398
+ const cached = cache.get(value);
399
+ if (cached) name = cached;
400
+ else {
401
+ for (let j2 = value.length - 1; j2 >= 0; j2--) {
402
+ name = { $: "Con", head: value.charCodeAt(j2), tail: name };
403
+ }
404
+ cache.set(value, name);
405
+ }
406
+ }
407
+ names = { $: "Con", head: name, tail: names };
408
+ }
409
+ return names;
410
+ };
411
+ var decodeResourceScope = (scope) => {
412
+ if (scope.$ === "Unknown") return ["*"];
413
+ const result = [];
414
+ for (let names = scope.names; names.$ === "Con"; names = names.tail) {
415
+ const chars = [];
416
+ for (let name = names.head; name.$ === "Con"; name = name.tail) {
417
+ if (name.head < 0 || name.head > 65535) throw new Error("Invalid verified resource code unit");
418
+ chars.push(String.fromCharCode(name.head));
419
+ }
420
+ result.push(chars.join(""));
421
+ }
422
+ return result;
423
+ };
424
+ var boundedEffectResources = (resources) => {
425
+ const declared = Array.isArray(resources) ? Array.from(resources) : [];
426
+ const original = ln(encodeResourceNames(declared));
427
+ const proposal = /* @__PURE__ */ new Set();
428
+ for (const resource of declared) {
429
+ proposal.add(resource);
430
+ if (proposal.size > 64) break;
431
+ }
432
+ return decodeResourceScope(cn(original, encodeResourceNames([...proposal])));
433
+ };
434
+ var encodeResourceEffects = (effects) => {
435
+ let result = { $: "Nil" };
436
+ for (let i2 = effects.length - 1; i2 >= 0; i2--) {
437
+ const effect = effects[i2];
438
+ const value = effect.kind === "none" ? { $: "Quiet" } : {
439
+ $: "Effect",
440
+ ordered: effect.ordering !== "commutative",
441
+ scope: ln(encodeResourceNames(effect.resources))
442
+ };
443
+ result = { $: "Con", head: value, tail: result };
444
+ }
445
+ return result;
446
+ };
447
+
448
+ // src/verified/policy.ts
449
+ var isNatural = (value) => Number.isSafeInteger(value) && value >= 0;
450
+ var isArithmeticNatural = (value) => isNatural(value) && value <= BEND_NAT_MAX;
451
+ var bendList = (values) => {
452
+ let list = { $: "Nil" };
453
+ for (let index = values.length - 1; index >= 0; index--) {
454
+ list = { $: "Con", head: values[index], tail: list };
455
+ }
456
+ return list;
457
+ };
458
+ var acceptSummaryBounds = (bytes, byteLimit, projected, target) => [bytes, byteLimit, projected, target].every(isNatural) && rn(bytes, byteLimit, projected, target);
459
+ var acceptSampleAccounting = (total, retained, omitted, limit) => [total, retained, omitted, limit].every(isArithmeticNatural) && retained + omitted <= BEND_NAT_MAX && $n(total, retained, omitted, limit);
460
+ var acceptCompactionCut = (candidate, spans) => {
461
+ if (![candidate.retained, candidate.budget, candidate.boundary].every(isNatural) || typeof candidate.eligible !== "boolean" || typeof candidate.afterPrevious !== "boolean") return false;
462
+ const base = {
463
+ $: "Cut",
464
+ eligible: candidate.eligible,
465
+ afterPrevious: candidate.afterPrevious,
466
+ retained: candidate.retained,
467
+ budget: candidate.budget,
468
+ boundary: candidate.boundary
469
+ };
470
+ if (!Ve({ ...base, spans: { $: "Nil" } })) return false;
471
+ let batch = [];
472
+ for (const span of spans) {
473
+ if (!isNatural(span.first) || !isNatural(span.last) || span.first > span.last || typeof span.hasCall !== "boolean" || typeof span.hasResult !== "boolean") return false;
474
+ batch.push({ $: "Span", first: span.first, last: span.last, paired: span.hasCall && span.hasResult });
475
+ if (batch.length === 128) {
476
+ if (!Ve({ ...base, spans: bendList(batch) })) return false;
477
+ batch = [];
478
+ }
479
+ }
480
+ return Ve({ ...base, spans: bendList(batch) });
481
+ };
482
+ var acceptMemoryChunk = (range, length, expectedStart, expectedTotal) => {
483
+ if (![range.start, range.end, range.total, length, expectedStart, expectedTotal].every(isArithmeticNatural) || range.start + length > BEND_NAT_MAX || typeof range.complete !== "boolean") return false;
484
+ return Me({
485
+ $: "Chunk",
486
+ start: range.start,
487
+ end: range.end,
488
+ total: range.total,
489
+ length,
490
+ expectedStart,
491
+ expectedTotal,
492
+ complete: range.complete
493
+ });
494
+ };
495
+ var assertCertificateFacts = (facts) => {
496
+ if (facts.length !== 8 || facts.some((fact) => typeof fact.valid !== "boolean")) {
497
+ throw new Error("Invalid Schema certificate evidence");
498
+ }
499
+ if (!He(bendList(facts.map((fact) => fact.valid)))) {
500
+ throw new Error(facts.find((fact) => !fact.valid)?.error ?? "Schema certificate rejected");
501
+ }
502
+ };
503
+
504
+ export {
505
+ BEND_NAT_MAX,
506
+ Ae,
507
+ Qe,
508
+ Te,
509
+ Be,
510
+ Re,
511
+ Je,
512
+ Oe,
513
+ Xe,
514
+ Ze,
515
+ nn,
516
+ _n,
517
+ boundedEffectResources,
518
+ encodeResourceEffects,
519
+ acceptSummaryBounds,
520
+ acceptSampleAccounting,
521
+ acceptCompactionCut,
522
+ acceptMemoryChunk,
523
+ assertCertificateFacts
524
+ };
525
+ //# sourceMappingURL=chunk-BN7F52EG.js.map
@@ -0,0 +1,7 @@
1
+ {
2
+ "version": 3,
3
+ "sources": ["../../src/verified/generated/kernel.js", "../../src/verified/nat.ts", "../../src/verified/resources.ts", "../../src/verified/policy.ts"],
4
+ "sourcesContent": ["// Generated by Bend 2.0.37; do not edit. See LAWS.bend and PROOF.bend.\n// Includes adapted Bend runtime/Base code, Copyright 2026 HigherOrderCO, Apache-2.0.\n// ABI exports selected and tags adapted by Pi Fabric; see THIRD_PARTY_NOTICES.md.\nfunction x(e, n) {\n return { $: e < n ? \"LT\" : e === n ? \"EQ\" : \"GT\" };\n}\nfunction g(e) {\n if (e > 281474976710655)\n throw \"bend: a Nat past the largest immediate 2^48-1\";\n return e;\n}\nfunction h(e) {\n return Number.isInteger(e) && e >= 0 && e <= 2 ** 53 ? e : g(1 / 0);\n}\nfunction z(e) {\n for (; e !== null && typeof e == \"object\" && e.$ === \"$JMP\"; )\n e = e.f(e.x);\n return e;\n}\nfunction c(e, n) {\n return (...t) => t.length < n ? c((...r) => e(...t, ...r), n - t.length) : z(e(...t));\n}\nfunction b(e, n, t) {\n for (; ; ) {\n let r = e, $ = n, u = t;\n if (r.$ === \"Nil\")\n return $.$ === \"Nil\" ? u : !1;\n {\n let l = r.head, a = r.tail;\n if ($.$ === \"Nil\")\n return !1;\n {\n let d = $.head, N = $.tail;\n e = a, n = N, t = f(u, m(l, d));\n continue;\n }\n }\n }\n}\nfunction y(e) {\n return e.$ !== \"Nil\";\n}\nfunction E(e, n) {\n for (; ; ) {\n let t = e, r = n;\n if (t.$ === \"Nil\")\n return !0;\n {\n let $ = t.tail;\n if (r === 0)\n return !1;\n {\n let u = r - 1;\n e = $, n = u;\n continue;\n }\n }\n }\n}\nfunction T(e) {\n return f(y(e), C(b(e, { $: \"Con\", head: 42, tail: { $: \"Nil\" } }, !0)));\n}\nfunction W(e) {\n return f(y(e), f(E(e, 256), C(b(e, { $: \"Con\", head: 42, tail: { $: \"Nil\" } }, !0))));\n}\nfunction w(e, n, t) {\n for (; ; ) {\n let r = e, $ = n, u = t;\n if (r.$ === \"Nil\")\n return u;\n {\n let l = r.head, a = r.tail, d = b($, l, !0);\n e = a, n = $, t = u || d;\n continue;\n }\n }\n}\nfunction k(e, n, t) {\n for (; ; ) {\n let r = e, $ = n, u = t;\n if (r.$ === \"Nil\")\n return u;\n {\n let l = r.head;\n e = r.tail, n = $, t = f(u, w($, l, !1));\n continue;\n }\n }\n}\nfunction q(e, n) {\n for (; ; ) {\n let t = e, r = n;\n if (t.$ === \"Nil\")\n return !0;\n {\n let $ = t.tail;\n if (r === 0)\n return !1;\n {\n let u = r - 1;\n e = $, n = u;\n continue;\n }\n }\n }\n}\nfunction G(e, n) {\n for (; ; ) {\n let t = e, r = n;\n if (t.$ === \"Nil\")\n return r;\n {\n let $ = t.head;\n e = t.tail, n = f(r, W($));\n continue;\n }\n }\n}\nfunction V(e, n) {\n for (; ; ) {\n let t = e, r = n;\n if (t.$ === \"Nil\")\n return r;\n {\n let $ = t.head;\n e = t.tail, n = f(r, T($));\n continue;\n }\n }\n}\nfunction S(e) {\n return e.$ !== \"Nil\";\n}\nfunction A(e, n) {\n return e ? { $: \"resources.Exact\", names: n } : { $: \"resources.Unknown\" };\n}\nfunction j(e) {\n return A(f(S(e), V(e, !0)), e);\n}\nfunction B(e) {\n return f(S(e), f(q(e, 64), G(e, !0)));\n}\nfunction F(e, n, t) {\n return e ? f(k(n, t, !0), k(t, n, !0)) : !1;\n}\nfunction M(e, n) {\n return F(B(n), e, n);\n}\nfunction P(e, n) {\n if (e.$ === \"resources.Unknown\")\n return { $: \"resources.Unknown\" };\n {\n let t = e.names;\n return A(M(t, n), n);\n }\n}\nfunction R(e, n, t) {\n for (; ; ) {\n let r = e, $ = n, u = t;\n if (r.$ === \"Nil\")\n return u;\n {\n let l = r.head, a = r.tail, d = w($, l, !1);\n e = a, n = $, t = u || d;\n continue;\n }\n }\n}\nfunction I(e, n) {\n if (e.$ === \"resources.Unknown\")\n return !0;\n {\n let t = e.names;\n if (n.$ === \"resources.Unknown\")\n return !0;\n {\n let r = n.names;\n return R(t, r, !1);\n }\n }\n}\nfunction v(e, n, t, r) {\n return f(t || r, I(e, n));\n}\nfunction J(e, n) {\n if (e.$ === \"resources.Quiet\")\n return !1;\n {\n let t = e.ordered, r = e.scope;\n if (n.$ === \"resources.Quiet\")\n return !1;\n {\n let $ = n.ordered, u = n.scope;\n return v(r, u, t, $);\n }\n }\n}\nfunction L(e, n, t) {\n for (; ; ) {\n let r = e, $ = n, u = t;\n if (r.$ === \"Nil\")\n return u;\n {\n let l = r.head, a = r.tail, d = J($, l);\n e = a, n = $, t = u || d;\n continue;\n }\n }\n}\nfunction O(e, n, t) {\n for (; ; ) {\n let r = e, $ = n, u = t;\n if (r.$ === \"Nil\")\n return u;\n {\n let l = r.head, a = r.tail, d = L($, l, !1);\n e = a, n = $, t = u || d;\n continue;\n }\n }\n}\nfunction _(e) {\n for (; ; ) {\n let n = e;\n if (n.$ === \"Nil\")\n return !0;\n if (n.head) {\n e = n.tail;\n continue;\n } else\n return !1;\n }\n}\nfunction D(e, n, t) {\n return { $: \"Con\", head: t, tail: { $: \"Con\", head: p(e, n), tail: { $: \"Nil\" } } };\n}\nfunction H(e, n, t) {\n return _(D(e, n, t));\n}\nfunction K(e, n, t, r, $, u) {\n let l = f(e, n || u), a = f(r, $ || t);\n return l || a;\n}\nfunction X(e, n, t, r) {\n return { $: \"Con\", head: C(e), tail: { $: \"Con\", head: n, tail: { $: \"Con\", head: t, tail: { $: \"Con\", head: C(r), tail: { $: \"Nil\" } } } } };\n}\nfunction Y(e, n, t, r) {\n return _(X(e, n, t, r));\n}\nfunction Z(e, n, t, r) {\n return { $: \"Con\", head: e, tail: { $: \"Con\", head: C(n), tail: { $: \"Con\", head: C(t), tail: { $: \"Con\", head: C(r), tail: { $: \"Nil\" } } } } };\n}\nfunction ee(e, n, t, r) {\n return _(Z(e, n, t, r));\n}\nfunction ne(e, n) {\n return e ? 2 : n ? 1 : 0;\n}\nfunction te(e, n) {\n let t = n.first, r = n.last, $ = n.paired, u = C($), l = p(e, t), a = u || l, d = r < e;\n return a || d;\n}\nfunction Q(e, n) {\n if (e.$ === \"Nil\")\n return { $: \"Nil\" };\n {\n let t = e.head, r = e.tail;\n return { $: \"Con\", head: te(n, t), tail: Q(r, n) };\n }\n}\nfunction U(e, n) {\n return _(Q(e, n));\n}\nfunction re(e) {\n let n = e.eligible, t = e.afterPrevious, r = e.retained, $ = e.budget, u = e.boundary, l = e.spans;\n return { $: \"Con\", head: n, tail: { $: \"Con\", head: t, tail: { $: \"Con\", head: p(r, $), tail: { $: \"Con\", head: U(l, u), tail: { $: \"Nil\" } } } } };\n}\nfunction ie(e) {\n return _(re(e));\n}\nfunction oe(e, n) {\n return e || n;\n}\nfunction $e(e, n) {\n return _({ $: \"Con\", head: e, tail: { $: \"Con\", head: n, tail: { $: \"Nil\" } } });\n}\nfunction ue(e) {\n let n = e.start, t = e.end, r = e.total, $ = e.expectedStart, u = e.expectedTotal, l = e.length, a = e.complete, d = m(t, r), N = n < t;\n return { $: \"Con\", head: m(n, $), tail: { $: \"Con\", head: m(r, u), tail: { $: \"Con\", head: p(n, t), tail: { $: \"Con\", head: p(t, r), tail: { $: \"Con\", head: m(l, t < n ? 0 : t - n), tail: { $: \"Con\", head: C(a !== d), tail: { $: \"Con\", head: a || N, tail: { $: \"Nil\" } } } } } } } };\n}\nfunction le(e) {\n return _(ue(e));\n}\nfunction ae(e, n) {\n return _({ $: \"Con\", head: e, tail: { $: \"Con\", head: C(n), tail: { $: \"Nil\" } } });\n}\nfunction ce(e, n, t, r) {\n return { $: \"Con\", head: C(e), tail: { $: \"Con\", head: n, tail: { $: \"Con\", head: t, tail: { $: \"Con\", head: r, tail: { $: \"Nil\" } } } } };\n}\nfunction se(e, n, t, r) {\n return _(ce(e, n, t, r));\n}\nfunction fe(e, n, t, r, $) {\n let u = f(r, $);\n return _({ $: \"Con\", head: e, tail: { $: \"Con\", head: n, tail: { $: \"Con\", head: t || u, tail: { $: \"Nil\" } } } });\n}\nfunction de(e) {\n return _(e);\n}\nfunction _e(e) {\n return { $: \"Tuple\", fst: e, snd: !1 };\n}\nfunction he(e, n, t) {\n return f(e, n || t);\n}\nfunction Ce(e, n, t, r) {\n return _({ $: \"Con\", head: p(e, n), tail: { $: \"Con\", head: p(t, r), tail: { $: \"Nil\" } } });\n}\nfunction pe(e, n, t, r) {\n let $ = n;\n return _({ $: \"Con\", head: m(e, g($ + t)), tail: { $: \"Con\", head: p($, r), tail: { $: \"Nil\" } } });\n}\nfunction me(e) {\n return j(e);\n}\nfunction Ne(e, n) {\n return P(e, n);\n}\nfunction be(e, n, t, r) {\n return v(e, n, t, r);\n}\nfunction xe(e, n) {\n return O(e, n, !1);\n}\nfunction f(e, n) {\n return e ? n : !1;\n}\nfunction m(e, n) {\n return ge(x(e, n));\n}\nfunction C(e) {\n return !e;\n}\nfunction p(e, n) {\n return ye(x(e, n));\n}\nfunction ge(e) {\n return e.$ === \"EQ\";\n}\nfunction ye(e) {\n return e.$ !== \"GT\";\n}\nvar o = /* @__PURE__ */ new Map([[\"Unknown\", \"resources.Unknown\"], [\"Exact\", \"resources.Exact\"], [\"Quiet\", \"resources.Quiet\"]]), s = /* @__PURE__ */ new Map([[\"resources.Unknown\", \"Unknown\"], [\"resources.Exact\", \"Exact\"], [\"resources.Quiet\", \"Quiet\"]]);\nfunction i(e, n) {\n let t = [e];\n for (let r = [[t, 0]]; r.length > 0; ) {\n let [$, u] = r.pop(), l = $[u];\n if (l === null || typeof l != \"object\") continue;\n let a = Array.isArray(l) ? [...l] : { ...l };\n typeof a.$ == \"string\" && (a.$ = n.get(a.$) ?? a.$), $[u] = a;\n for (let d of Object.keys(a)) r.push([a, d]);\n }\n return t[0];\n}\nvar we = /* @__PURE__ */ c((e, n, t) => H(h(e), h(n), t), 3), ke = (e, n, t) => i(we(i(e, o), i(n, o), i(t, o)), s), Se = /* @__PURE__ */ c((e, n, t, r, $, u) => K(e, n, t, r, $, u), 6), Ae = (e, n, t, r, $, u) => i(Se(i(e, o), i(n, o), i(t, o), i(r, o), i($, o), i(u, o)), s), ve = /* @__PURE__ */ c((e, n, t, r) => Y(e, n, t, r), 4), Qe = (e, n, t, r) => i(ve(i(e, o), i(n, o), i(t, o), i(r, o)), s), Ue = /* @__PURE__ */ c((e, n, t, r) => ee(e, n, t, r), 4), ze = (e, n, t, r) => i(Ue(i(e, o), i(n, o), i(t, o), i(r, o)), s), Ee = /* @__PURE__ */ c((e, n) => ne(e, n), 2), Te = (e, n) => i(Ee(i(e, o), i(n, o)), s), We = /* @__PURE__ */ c((e, n) => U(e, h(n)), 2), qe = (e, n) => i(We(i(e, o), i(n, o)), s), Ge = /* @__PURE__ */ c((e) => ie(e), 1), Ve = (e) => i(Ge(i(e, o)), s), je = /* @__PURE__ */ c((e, n) => $e(e, n), 2), Be = (e, n) => i(je(i(e, o), i(n, o)), s), Fe = /* @__PURE__ */ c((e) => le(e), 1), Me = (e) => i(Fe(i(e, o)), s), Pe = /* @__PURE__ */ c((e, n) => ae(e, n), 2), Re = (e, n) => i(Pe(i(e, o), i(n, o)), s), Ie = /* @__PURE__ */ c((e, n, t, r) => se(e, n, t, r), 4), Je = (e, n, t, r) => i(Ie(i(e, o), i(n, o), i(t, o), i(r, o)), s), Le = /* @__PURE__ */ c((e, n, t, r, $) => fe(e, n, t, r, $), 5), Oe = (e, n, t, r, $) => i(Le(i(e, o), i(n, o), i(t, o), i(r, o), i($, o)), s), De = /* @__PURE__ */ c((e) => de(e), 1), He = (e) => i(De(i(e, o)), s), Ke = /* @__PURE__ */ c((e) => _e(e), 1), Xe = (e) => i(Ke(i(e, o)), s), Ye = /* @__PURE__ */ c((e, n) => oe(e, n), 2), Ze = (e, n) => i(Ye(i(e, o), i(n, o)), s), en = /* @__PURE__ */ c((e, n, t) => he(e, n, t), 3), nn = (e, n, t) => i(en(i(e, o), i(n, o), i(t, o)), s), tn = /* @__PURE__ */ c((e, n, t, r) => Ce(h(e), h(n), h(t), h(r)), 4), rn = (e, n, t, r) => i(tn(i(e, o), i(n, o), i(t, o), i(r, o)), s), on = /* @__PURE__ */ c((e, n, t, r) => pe(h(e), h(n), h(t), h(r)), 4), $n = (e, n, t, r) => i(on(i(e, o), i(n, o), i(t, o), i(r, o)), s), un = /* @__PURE__ */ c((e) => me(e), 1), ln = (e) => i(un(i(e, o)), s), an = /* @__PURE__ */ c((e, n) => Ne(e, n), 2), cn = (e, n) => i(an(i(e, o), i(n, o)), s), sn = /* @__PURE__ */ c((e, n, t, r) => be(e, n, t, r), 4), fn = (e, n, t, r) => i(sn(i(e, o), i(n, o), i(t, o), i(r, o)), s), dn = /* @__PURE__ */ c((e, n) => xe(e, n), 2), _n = (e, n) => i(dn(i(e, o), i(n, o)), s);\nexport {\n ze as canClose,\n He as certificateAccepted,\n Me as chunkAccepted,\n Te as cleanupState,\n Xe as consume,\n Re as coverageComplete,\n Ve as cutAccepted,\n ke as footprintFits,\n Oe as headReadable,\n nn as knownConflict,\n Ze as lineageSelected,\n Be as pointerCurrent,\n fn as resourceConflict,\n _n as resourceGroups,\n cn as resourceNormalize,\n ln as resourceSource,\n $n as sampleWithin,\n qe as spansSafe,\n rn as summaryWithin,\n Qe as transitionCurrent,\n Ae as unknownConflict,\n Je as useNormalized\n};\n", "// Bend's JavaScript backend (2.0.37, as 2.0.36) rejects arithmetic naturals above\n// this bound; a Nat crosses to and from JS as a plain number since 2.0.37.\n// Comparison-only primitives can compare larger JS-safe integers. Storage uses\n// radix limbs to keep its full safe-integer revision arithmetic in this domain.\nexport const BEND_NAT_MAX = 2 ** 48 - 1;\n", "import {\n resourceSource, resourceNormalize, resourceGroups,\n type BendList, type ResourceName, type ResourceScope, type ResourceEffect,\n} from \"./generated/kernel.js\";\n\nexport { resourceGroups };\n\n/** Lossless wire encoding, including NULs and lone surrogates. Never truncate,\n * hash, normalize Unicode, or assign independently interned numeric IDs here. */\nexport const encodeResourceNames = (values: readonly unknown[] | undefined): BendList<ResourceName> => {\n let names: BendList<ResourceName> = { $: \"Nil\" };\n const cache = new Map<string, ResourceName>();\n const input = Array.isArray(values) ? values : [];\n for (let i = input.length - 1; i >= 0; i--) {\n const value: unknown = input[i];\n let name: ResourceName = { $: \"Nil\" };\n if (typeof value === \"string\") {\n const cached = cache.get(value);\n if (cached) name = cached;\n else {\n for (let j = value.length - 1; j >= 0; j--) {\n name = { $: \"Con\", head: value.charCodeAt(j), tail: name };\n }\n cache.set(value, name);\n }\n }\n names = { $: \"Con\", head: name, tail: names };\n }\n return names;\n};\n\n/** ABI decoding only. Normalization policy lives in the compiled checker. */\nexport const decodeResourceScope = (scope: ResourceScope): string[] => {\n if (scope.$ === \"Unknown\") return [\"*\"];\n const result: string[] = [];\n for (let names = scope.names; names.$ === \"Con\"; names = names.tail) {\n const chars: string[] = [];\n for (let name = names.head; name.$ === \"Con\"; name = name.tail) {\n if (name.head < 0 || name.head > 65535) throw new Error(\"Invalid verified resource code unit\");\n chars.push(String.fromCharCode(name.head));\n }\n result.push(chars.join(\"\"));\n }\n return result;\n};\n\nexport const boundedEffectResources = (resources: readonly string[] | undefined): string[] => {\n // Capture the entire declaration before running the untrusted proposer.\n const declared: unknown[] = Array.isArray(resources) ? Array.from(resources) : [];\n const original = resourceSource(encodeResourceNames(declared));\n const proposal = new Set<unknown>();\n for (const resource of declared) {\n proposal.add(resource);\n if (proposal.size > 64) break;\n }\n return decodeResourceScope(resourceNormalize(original, encodeResourceNames([...proposal])));\n};\n\nexport const encodeResourceEffects = (\n effects: readonly { kind: string; ordering: string; resources: readonly string[] }[],\n): BendList<ResourceEffect> => {\n let result: BendList<ResourceEffect> = { $: \"Nil\" };\n for (let i = effects.length - 1; i >= 0; i--) {\n const effect = effects[i]!;\n const value: ResourceEffect = effect.kind === \"none\" ? { $: \"Quiet\" } : {\n $: \"Effect\", ordered: effect.ordering !== \"commutative\",\n scope: resourceSource(encodeResourceNames(effect.resources)),\n };\n result = { $: \"Con\", head: value, tail: result };\n }\n return result;\n};\n", "import { BEND_NAT_MAX } from \"./nat.js\";\nimport {\n cutAccepted, chunkAccepted, certificateAccepted, summaryWithin, sampleWithin,\n type BendList, type Span,\n} from \"./generated/kernel.js\";\n\nexport {\n unknownConflict, knownConflict, transitionCurrent, canClose, cleanupState, pointerCurrent,\n coverageComplete, useNormalized, headReadable, consume, lineageSelected,\n} from \"./generated/kernel.js\";\n\nconst isNatural = (value: number): boolean => Number.isSafeInteger(value) && value >= 0;\nconst isArithmeticNatural = (value: number): boolean => isNatural(value) && value <= BEND_NAT_MAX;\n\nexport const bendList = <T>(values: readonly T[]): BendList<T> => {\n let list: BendList<T> = { $: \"Nil\" };\n for (let index = values.length - 1; index >= 0; index--) {\n list = { $: \"Con\", head: values[index]!, tail: list };\n }\n return list;\n};\n\nexport { boundedEffectResources } from \"./resources.js\";\n\nexport const acceptSummaryBounds = (bytes: number, byteLimit: number, projected: number, target: number): boolean =>\n [bytes, byteLimit, projected, target].every(isNatural) &&\n summaryWithin(bytes, byteLimit, projected, target);\n\nexport const acceptSampleAccounting = (total: number, retained: number, omitted: number, limit: number): boolean =>\n [total, retained, omitted, limit].every(isArithmeticNatural) && retained + omitted <= BEND_NAT_MAX &&\n sampleWithin(total, retained, omitted, limit);\n\nexport interface CutSpan {\n first: number;\n last: number;\n hasCall: boolean;\n hasResult: boolean;\n}\n\nexport interface CutCandidate {\n eligible: boolean;\n afterPrevious: boolean;\n retained: number;\n budget: number;\n boundary: number;\n}\n\n/** The producer may reject cheaply, but cannot publish a cut without this check.\n * Batches bound backend non-tail list construction; every source span is checked. */\nexport const acceptCompactionCut = (candidate: CutCandidate, spans: Iterable<CutSpan>): boolean => {\n if (![candidate.retained, candidate.budget, candidate.boundary].every(isNatural) ||\n typeof candidate.eligible !== \"boolean\" || typeof candidate.afterPrevious !== \"boolean\") return false;\n const base = {\n $: \"Cut\" as const, eligible: candidate.eligible, afterPrevious: candidate.afterPrevious,\n retained: candidate.retained, budget: candidate.budget, boundary: candidate.boundary,\n };\n if (!cutAccepted({ ...base, spans: { $: \"Nil\" } })) return false;\n let batch: Span[] = [];\n for (const span of spans) {\n if (!isNatural(span.first) || !isNatural(span.last) || span.first > span.last ||\n typeof span.hasCall !== \"boolean\" || typeof span.hasResult !== \"boolean\") return false;\n batch.push({ $: \"Span\", first: span.first, last: span.last, paired: span.hasCall && span.hasResult });\n if (batch.length === 128) {\n if (!cutAccepted({ ...base, spans: bendList(batch) })) return false;\n batch = [];\n }\n }\n return cutAccepted({ ...base, spans: bendList(batch) });\n};\n\nexport interface TextRange { start: number; end: number; total: number; complete: boolean }\nexport const acceptMemoryChunk = (\n range: TextRange, length: number, expectedStart: number, expectedTotal: number,\n): boolean => {\n if (![range.start, range.end, range.total, length, expectedStart, expectedTotal].every(isArithmeticNatural) || range.start + length > BEND_NAT_MAX ||\n typeof range.complete !== \"boolean\") return false;\n return chunkAccepted({\n $: \"Chunk\", start: range.start, end: range.end, total: range.total,\n length: length, expectedStart: expectedStart, expectedTotal: expectedTotal,\n complete: range.complete,\n });\n};\n\n/** A fixed ordered tuple prevents a missing check from becoming an empty,\n * vacuously accepted certificate. Messages are diagnostics, never authority. */\nexport const assertCertificateFacts = (\n facts: readonly [CertificateFact, CertificateFact, CertificateFact, CertificateFact, CertificateFact, CertificateFact, CertificateFact, CertificateFact],\n): void => {\n if (facts.length !== 8 || facts.some((fact) => typeof fact.valid !== \"boolean\")) {\n throw new Error(\"Invalid Schema certificate evidence\");\n }\n if (!certificateAccepted(bendList(facts.map((fact) => fact.valid)))) {\n throw new Error(facts.find((fact) => !fact.valid)?.error ?? \"Schema certificate rejected\");\n }\n};\ninterface CertificateFact { valid: boolean; error: string }\n"],
5
+ "mappings": ";AAGA,SAAS,EAAE,GAAG,GAAG;AACf,SAAO,EAAE,GAAG,IAAI,IAAI,OAAO,MAAM,IAAI,OAAO,KAAK;AACnD;AACA,SAAS,EAAE,GAAG;AACZ,MAAI,IAAI;AACN,UAAM;AACR,SAAO;AACT;AACA,SAAS,EAAE,GAAG;AACZ,SAAO,OAAO,UAAU,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI,EAAE,IAAI,CAAC;AACpE;AACA,SAAS,EAAE,GAAG;AACZ,SAAO,MAAM,QAAQ,OAAO,KAAK,YAAY,EAAE,MAAM;AACnD,QAAI,EAAE,EAAE,EAAE,CAAC;AACb,SAAO;AACT;AACA,SAAS,EAAE,GAAG,GAAG;AACf,SAAO,IAAI,MAAM,EAAE,SAAS,IAAI,EAAE,IAAI,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,GAAG,IAAI,EAAE,MAAM,IAAI,EAAE,EAAE,GAAG,CAAC,CAAC;AACtF;AACA,SAAS,EAAE,GAAG,GAAG,GAAG;AAClB,aAAW;AACT,QAAI,IAAI,GAAG,IAAI,GAAG,IAAI;AACtB,QAAI,EAAE,MAAM;AACV,aAAO,EAAE,MAAM,QAAQ,IAAI;AAC7B;AACE,UAAI,IAAI,EAAE,MAAM,IAAI,EAAE;AACtB,UAAI,EAAE,MAAM;AACV,eAAO;AACT;AACE,YAAI,IAAI,EAAE,MAAM,IAAI,EAAE;AACtB,YAAI,GAAG,IAAI,GAAG,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAC9B;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AACA,SAAS,EAAE,GAAG;AACZ,SAAO,EAAE,MAAM;AACjB;AACA,SAAS,EAAE,GAAG,GAAG;AACf,aAAW;AACT,QAAI,IAAI,GAAG,IAAI;AACf,QAAI,EAAE,MAAM;AACV,aAAO;AACT;AACE,UAAI,IAAI,EAAE;AACV,UAAI,MAAM;AACR,eAAO;AACT;AACE,YAAI,IAAI,IAAI;AACZ,YAAI,GAAG,IAAI;AACX;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AACA,SAAS,EAAE,GAAG;AACZ,SAAO,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,OAAO,MAAM,IAAI,MAAM,EAAE,GAAG,MAAM,EAAE,GAAG,IAAE,CAAC,CAAC;AACxE;AACA,SAAS,EAAE,GAAG;AACZ,SAAO,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,OAAO,MAAM,IAAI,MAAM,EAAE,GAAG,MAAM,EAAE,GAAG,IAAE,CAAC,CAAC,CAAC;AACtF;AACA,SAAS,EAAE,GAAG,GAAG,GAAG;AAClB,aAAW;AACT,QAAI,IAAI,GAAG,IAAI,GAAG,IAAI;AACtB,QAAI,EAAE,MAAM;AACV,aAAO;AACT;AACE,UAAI,IAAI,EAAE,MAAM,IAAI,EAAE,MAAM,IAAI,EAAE,GAAG,GAAG,IAAE;AAC1C,UAAI,GAAG,IAAI,GAAG,IAAI,KAAK;AACvB;AAAA,IACF;AAAA,EACF;AACF;AACA,SAAS,EAAE,GAAG,GAAG,GAAG;AAClB,aAAW;AACT,QAAI,IAAI,GAAG,IAAI,GAAG,IAAI;AACtB,QAAI,EAAE,MAAM;AACV,aAAO;AACT;AACE,UAAI,IAAI,EAAE;AACV,UAAI,EAAE,MAAM,IAAI,GAAG,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,KAAE,CAAC;AACvC;AAAA,IACF;AAAA,EACF;AACF;AACA,SAAS,EAAE,GAAG,GAAG;AACf,aAAW;AACT,QAAI,IAAI,GAAG,IAAI;AACf,QAAI,EAAE,MAAM;AACV,aAAO;AACT;AACE,UAAI,IAAI,EAAE;AACV,UAAI,MAAM;AACR,eAAO;AACT;AACE,YAAI,IAAI,IAAI;AACZ,YAAI,GAAG,IAAI;AACX;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AACA,SAAS,EAAE,GAAG,GAAG;AACf,aAAW;AACT,QAAI,IAAI,GAAG,IAAI;AACf,QAAI,EAAE,MAAM;AACV,aAAO;AACT;AACE,UAAI,IAAI,EAAE;AACV,UAAI,EAAE,MAAM,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC;AACzB;AAAA,IACF;AAAA,EACF;AACF;AACA,SAAS,EAAE,GAAG,GAAG;AACf,aAAW;AACT,QAAI,IAAI,GAAG,IAAI;AACf,QAAI,EAAE,MAAM;AACV,aAAO;AACT;AACE,UAAI,IAAI,EAAE;AACV,UAAI,EAAE,MAAM,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC;AACzB;AAAA,IACF;AAAA,EACF;AACF;AACA,SAAS,EAAE,GAAG;AACZ,SAAO,EAAE,MAAM;AACjB;AACA,SAAS,EAAE,GAAG,GAAG;AACf,SAAO,IAAI,EAAE,GAAG,mBAAmB,OAAO,EAAE,IAAI,EAAE,GAAG,oBAAoB;AAC3E;AACA,SAAS,EAAE,GAAG;AACZ,SAAO,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,IAAE,CAAC,GAAG,CAAC;AAC/B;AACA,SAAS,EAAE,GAAG;AACZ,SAAO,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAE,CAAC,CAAC;AACtC;AACA,SAAS,EAAE,GAAG,GAAG,GAAG;AAClB,SAAO,IAAI,EAAE,EAAE,GAAG,GAAG,IAAE,GAAG,EAAE,GAAG,GAAG,IAAE,CAAC,IAAI;AAC3C;AACA,SAAS,EAAE,GAAG,GAAG;AACf,SAAO,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC;AACrB;AACA,SAAS,EAAE,GAAG,GAAG;AACf,MAAI,EAAE,MAAM;AACV,WAAO,EAAE,GAAG,oBAAoB;AAClC;AACE,QAAI,IAAI,EAAE;AACV,WAAO,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC;AAAA,EACrB;AACF;AACA,SAAS,EAAE,GAAG,GAAG,GAAG;AAClB,aAAW;AACT,QAAI,IAAI,GAAG,IAAI,GAAG,IAAI;AACtB,QAAI,EAAE,MAAM;AACV,aAAO;AACT;AACE,UAAI,IAAI,EAAE,MAAM,IAAI,EAAE,MAAM,IAAI,EAAE,GAAG,GAAG,KAAE;AAC1C,UAAI,GAAG,IAAI,GAAG,IAAI,KAAK;AACvB;AAAA,IACF;AAAA,EACF;AACF;AACA,SAAS,EAAE,GAAG,GAAG;AACf,MAAI,EAAE,MAAM;AACV,WAAO;AACT;AACE,QAAI,IAAI,EAAE;AACV,QAAI,EAAE,MAAM;AACV,aAAO;AACT;AACE,UAAI,IAAI,EAAE;AACV,aAAO,EAAE,GAAG,GAAG,KAAE;AAAA,IACnB;AAAA,EACF;AACF;AACA,SAAS,EAAE,GAAG,GAAG,GAAG,GAAG;AACrB,SAAO,EAAE,KAAK,GAAG,EAAE,GAAG,CAAC,CAAC;AAC1B;AACA,SAAS,EAAE,GAAG,GAAG;AACf,MAAI,EAAE,MAAM;AACV,WAAO;AACT;AACE,QAAI,IAAI,EAAE,SAAS,IAAI,EAAE;AACzB,QAAI,EAAE,MAAM;AACV,aAAO;AACT;AACE,UAAI,IAAI,EAAE,SAAS,IAAI,EAAE;AACzB,aAAO,EAAE,GAAG,GAAG,GAAG,CAAC;AAAA,IACrB;AAAA,EACF;AACF;AACA,SAAS,EAAE,GAAG,GAAG,GAAG;AAClB,aAAW;AACT,QAAI,IAAI,GAAG,IAAI,GAAG,IAAI;AACtB,QAAI,EAAE,MAAM;AACV,aAAO;AACT;AACE,UAAI,IAAI,EAAE,MAAM,IAAI,EAAE,MAAM,IAAI,EAAE,GAAG,CAAC;AACtC,UAAI,GAAG,IAAI,GAAG,IAAI,KAAK;AACvB;AAAA,IACF;AAAA,EACF;AACF;AACA,SAAS,EAAE,GAAG,GAAG,GAAG;AAClB,aAAW;AACT,QAAI,IAAI,GAAG,IAAI,GAAG,IAAI;AACtB,QAAI,EAAE,MAAM;AACV,aAAO;AACT;AACE,UAAI,IAAI,EAAE,MAAM,IAAI,EAAE,MAAM,IAAI,EAAE,GAAG,GAAG,KAAE;AAC1C,UAAI,GAAG,IAAI,GAAG,IAAI,KAAK;AACvB;AAAA,IACF;AAAA,EACF;AACF;AACA,SAAS,EAAE,GAAG;AACZ,aAAW;AACT,QAAI,IAAI;AACR,QAAI,EAAE,MAAM;AACV,aAAO;AACT,QAAI,EAAE,MAAM;AACV,UAAI,EAAE;AACN;AAAA,IACF;AACE,aAAO;AAAA,EACX;AACF;AAOA,SAAS,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAC3B,MAAI,IAAI,EAAE,GAAG,KAAK,CAAC,GAAG,IAAI,EAAE,GAAG,KAAK,CAAC;AACrC,SAAO,KAAK;AACd;AACA,SAAS,EAAE,GAAG,GAAG,GAAG,GAAG;AACrB,SAAO,EAAE,GAAG,OAAO,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,GAAG,OAAO,MAAM,GAAG,MAAM,EAAE,GAAG,OAAO,MAAM,GAAG,MAAM,EAAE,GAAG,OAAO,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,GAAG,MAAM,EAAE,EAAE,EAAE,EAAE;AAC9I;AACA,SAAS,EAAE,GAAG,GAAG,GAAG,GAAG;AACrB,SAAO,EAAE,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;AACxB;AAOA,SAAS,GAAG,GAAG,GAAG;AAChB,SAAO,IAAI,IAAI,IAAI,IAAI;AACzB;AACA,SAAS,GAAG,GAAG,GAAG;AAChB,MAAI,IAAI,EAAE,OAAO,IAAI,EAAE,MAAM,IAAI,EAAE,QAAQ,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,GAAG,CAAC,GAAG,IAAI,KAAK,GAAG,IAAI,IAAI;AACtF,SAAO,KAAK;AACd;AACA,SAAS,EAAE,GAAG,GAAG;AACf,MAAI,EAAE,MAAM;AACV,WAAO,EAAE,GAAG,MAAM;AACpB;AACE,QAAI,IAAI,EAAE,MAAM,IAAI,EAAE;AACtB,WAAO,EAAE,GAAG,OAAO,MAAM,GAAG,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,CAAC,EAAE;AAAA,EACnD;AACF;AACA,SAAS,EAAE,GAAG,GAAG;AACf,SAAO,EAAE,EAAE,GAAG,CAAC,CAAC;AAClB;AACA,SAAS,GAAG,GAAG;AACb,MAAI,IAAI,EAAE,UAAU,IAAI,EAAE,eAAe,IAAI,EAAE,UAAU,IAAI,EAAE,QAAQ,IAAI,EAAE,UAAU,IAAI,EAAE;AAC7F,SAAO,EAAE,GAAG,OAAO,MAAM,GAAG,MAAM,EAAE,GAAG,OAAO,MAAM,GAAG,MAAM,EAAE,GAAG,OAAO,MAAM,EAAE,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,OAAO,MAAM,EAAE,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,MAAM,EAAE,EAAE,EAAE,EAAE;AACpJ;AACA,SAAS,GAAG,GAAG;AACb,SAAO,EAAE,GAAG,CAAC,CAAC;AAChB;AACA,SAAS,GAAG,GAAG,GAAG;AAChB,SAAO,KAAK;AACd;AACA,SAAS,GAAG,GAAG,GAAG;AAChB,SAAO,EAAE,EAAE,GAAG,OAAO,MAAM,GAAG,MAAM,EAAE,GAAG,OAAO,MAAM,GAAG,MAAM,EAAE,GAAG,MAAM,EAAE,EAAE,CAAC;AACjF;AACA,SAAS,GAAG,GAAG;AACb,MAAI,IAAI,EAAE,OAAO,IAAI,EAAE,KAAK,IAAI,EAAE,OAAO,IAAI,EAAE,eAAe,IAAI,EAAE,eAAe,IAAI,EAAE,QAAQ,IAAI,EAAE,UAAU,IAAI,EAAE,GAAG,CAAC,GAAG,IAAI,IAAI;AACtI,SAAO,EAAE,GAAG,OAAO,MAAM,EAAE,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,OAAO,MAAM,EAAE,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,OAAO,MAAM,EAAE,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,OAAO,MAAM,EAAE,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,OAAO,MAAM,EAAE,GAAG,IAAI,IAAI,IAAI,IAAI,CAAC,GAAG,MAAM,EAAE,GAAG,OAAO,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM,EAAE,GAAG,OAAO,MAAM,KAAK,GAAG,MAAM,EAAE,GAAG,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;AAC3R;AACA,SAAS,GAAG,GAAG;AACb,SAAO,EAAE,GAAG,CAAC,CAAC;AAChB;AACA,SAAS,GAAG,GAAG,GAAG;AAChB,SAAO,EAAE,EAAE,GAAG,OAAO,MAAM,GAAG,MAAM,EAAE,GAAG,OAAO,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,GAAG,MAAM,EAAE,EAAE,CAAC;AACpF;AACA,SAAS,GAAG,GAAG,GAAG,GAAG,GAAG;AACtB,SAAO,EAAE,GAAG,OAAO,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,GAAG,OAAO,MAAM,GAAG,MAAM,EAAE,GAAG,OAAO,MAAM,GAAG,MAAM,EAAE,GAAG,OAAO,MAAM,GAAG,MAAM,EAAE,GAAG,MAAM,EAAE,EAAE,EAAE,EAAE;AAC3I;AACA,SAAS,GAAG,GAAG,GAAG,GAAG,GAAG;AACtB,SAAO,EAAE,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;AACzB;AACA,SAAS,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AACzB,MAAI,IAAI,EAAE,GAAG,CAAC;AACd,SAAO,EAAE,EAAE,GAAG,OAAO,MAAM,GAAG,MAAM,EAAE,GAAG,OAAO,MAAM,GAAG,MAAM,EAAE,GAAG,OAAO,MAAM,KAAK,GAAG,MAAM,EAAE,GAAG,MAAM,EAAE,EAAE,EAAE,CAAC;AACnH;AACA,SAAS,GAAG,GAAG;AACb,SAAO,EAAE,CAAC;AACZ;AACA,SAAS,GAAG,GAAG;AACb,SAAO,EAAE,GAAG,SAAS,KAAK,GAAG,KAAK,MAAG;AACvC;AACA,SAAS,GAAG,GAAG,GAAG,GAAG;AACnB,SAAO,EAAE,GAAG,KAAK,CAAC;AACpB;AACA,SAAS,GAAG,GAAG,GAAG,GAAG,GAAG;AACtB,SAAO,EAAE,EAAE,GAAG,OAAO,MAAM,EAAE,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,OAAO,MAAM,EAAE,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,MAAM,EAAE,EAAE,CAAC;AAC7F;AACA,SAAS,GAAG,GAAG,GAAG,GAAG,GAAG;AACtB,MAAI,IAAI;AACR,SAAO,EAAE,EAAE,GAAG,OAAO,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,GAAG,MAAM,EAAE,GAAG,OAAO,MAAM,EAAE,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,MAAM,EAAE,EAAE,CAAC;AACpG;AACA,SAAS,GAAG,GAAG;AACb,SAAO,EAAE,CAAC;AACZ;AACA,SAAS,GAAG,GAAG,GAAG;AAChB,SAAO,EAAE,GAAG,CAAC;AACf;AAIA,SAAS,GAAG,GAAG,GAAG;AAChB,SAAO,EAAE,GAAG,GAAG,KAAE;AACnB;AACA,SAAS,EAAE,GAAG,GAAG;AACf,SAAO,IAAI,IAAI;AACjB;AACA,SAAS,EAAE,GAAG,GAAG;AACf,SAAO,GAAG,EAAE,GAAG,CAAC,CAAC;AACnB;AACA,SAAS,EAAE,GAAG;AACZ,SAAO,CAAC;AACV;AACA,SAAS,EAAE,GAAG,GAAG;AACf,SAAO,GAAG,EAAE,GAAG,CAAC,CAAC;AACnB;AACA,SAAS,GAAG,GAAG;AACb,SAAO,EAAE,MAAM;AACjB;AACA,SAAS,GAAG,GAAG;AACb,SAAO,EAAE,MAAM;AACjB;AACA,IAAI,IAAoB,oBAAI,IAAI,CAAC,CAAC,WAAW,mBAAmB,GAAG,CAAC,SAAS,iBAAiB,GAAG,CAAC,SAAS,iBAAiB,CAAC,CAAC;AAA9H,IAAiI,IAAoB,oBAAI,IAAI,CAAC,CAAC,qBAAqB,SAAS,GAAG,CAAC,mBAAmB,OAAO,GAAG,CAAC,mBAAmB,OAAO,CAAC,CAAC;AAC3P,SAAS,EAAE,GAAG,GAAG;AACf,MAAI,IAAI,CAAC,CAAC;AACV,WAAS,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,SAAS,KAAK;AACrC,QAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,EAAE,CAAC;AAC7B,QAAI,MAAM,QAAQ,OAAO,KAAK,SAAU;AACxC,QAAI,IAAI,MAAM,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,EAAE;AAC3C,WAAO,EAAE,KAAK,aAAa,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,IAAI;AAC5D,aAAS,KAAK,OAAO,KAAK,CAAC,EAAG,GAAE,KAAK,CAAC,GAAG,CAAC,CAAC;AAAA,EAC7C;AACA,SAAO,EAAE,CAAC;AACZ;AACA,IAAqH,KAAqB,kBAAE,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC;AAAxL,IAA2L,KAAK,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC;AAAnR,IAAsR,KAAqB,kBAAE,CAAC,GAAG,GAAG,GAAG,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC;AAA7U,IAAgV,KAAK,CAAC,GAAG,GAAG,GAAG,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC;AAAhZ,IAAihB,KAAqB,kBAAE,CAAC,GAAG,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC;AAA7jB,IAAgkB,KAAK,CAAC,GAAG,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC;AAAxmB,IAAusB,KAAqB,kBAAE,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC;AAA7uB,IAAgvB,KAAK,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC;AAA5wB,IAA+wB,KAAqB,kBAAE,CAAC,GAAG,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC;AAA3zB,IAA8zB,KAAK,CAAC,GAAG,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC;AAAt2B,IAAy2B,KAAqB,kBAAE,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC;AAA/4B,IAAk5B,KAAK,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC;AAA96B,IAAi7B,KAAqB,kBAAE,CAAC,GAAG,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC;AAA79B,IAAg+B,KAAK,CAAC,GAAG,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC;AAAxgC,IAA2gC,KAAqB,kBAAE,CAAC,GAAG,GAAG,GAAG,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC;AAAnkC,IAAskC,KAAK,CAAC,GAAG,GAAG,GAAG,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC;AAAtoC,IAAyoC,KAAqB,kBAAE,CAAC,GAAG,GAAG,GAAG,GAAG,MAAM,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC;AAAvsC,IAA0sC,KAAK,CAAC,GAAG,GAAG,GAAG,GAAG,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC;AAAtxC,IAAyxC,KAAqB,kBAAE,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC;AAA/zC,IAAk0C,KAAK,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC;AAA91C,IAAi2C,KAAqB,kBAAE,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC;AAAv4C,IAA04C,KAAK,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC;AAAt6C,IAAy6C,KAAqB,kBAAE,CAAC,GAAG,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC;AAAr9C,IAAw9C,KAAK,CAAC,GAAG,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC;AAAhgD,IAAmgD,KAAqB,kBAAE,CAAC,GAAG,GAAG,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC;AAArjD,IAAwjD,KAAK,CAAC,GAAG,GAAG,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC;AAA5mD,IAA+mD,KAAqB,kBAAE,CAAC,GAAG,GAAG,GAAG,MAAM,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC;AAAnrD,IAAsrD,KAAK,CAAC,GAAG,GAAG,GAAG,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC;AAAtvD,IAAyvD,KAAqB,kBAAE,CAAC,GAAG,GAAG,GAAG,MAAM,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC;AAA7zD,IAAg0D,KAAK,CAAC,GAAG,GAAG,GAAG,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC;AAAh4D,IAAm4D,KAAqB,kBAAE,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC;AAAz6D,IAA46D,KAAK,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC;AAAx8D,IAA28D,KAAqB,kBAAE,CAAC,GAAG,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC;AAAv/D,IAA0/D,KAAK,CAAC,GAAG,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC;AAAliE,IAAmqE,KAAqB,kBAAE,CAAC,GAAG,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC;AAA/sE,IAAktE,KAAK,CAAC,GAAG,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC;;;ACxWnvE,IAAM,eAAe,KAAK,KAAK;;;ACK/B,IAAM,sBAAsB,CAAC,WAAmE;AACrG,MAAI,QAAgC,EAAE,GAAG,MAAM;AAC/C,QAAM,QAAQ,oBAAI,IAA0B;AAC5C,QAAM,QAAQ,MAAM,QAAQ,MAAM,IAAI,SAAS,CAAC;AAChD,WAASA,KAAI,MAAM,SAAS,GAAGA,MAAK,GAAGA,MAAK;AAC1C,UAAM,QAAiB,MAAMA,EAAC;AAC9B,QAAI,OAAqB,EAAE,GAAG,MAAM;AACpC,QAAI,OAAO,UAAU,UAAU;AAC7B,YAAM,SAAS,MAAM,IAAI,KAAK;AAC9B,UAAI,OAAQ,QAAO;AAAA,WACd;AACH,iBAASC,KAAI,MAAM,SAAS,GAAGA,MAAK,GAAGA,MAAK;AAC1C,iBAAO,EAAE,GAAG,OAAO,MAAM,MAAM,WAAWA,EAAC,GAAG,MAAM,KAAK;AAAA,QAC3D;AACA,cAAM,IAAI,OAAO,IAAI;AAAA,MACvB;AAAA,IACF;AACA,YAAQ,EAAE,GAAG,OAAO,MAAM,MAAM,MAAM,MAAM;AAAA,EAC9C;AACA,SAAO;AACT;AAGO,IAAM,sBAAsB,CAAC,UAAmC;AACrE,MAAI,MAAM,MAAM,UAAW,QAAO,CAAC,GAAG;AACtC,QAAM,SAAmB,CAAC;AAC1B,WAAS,QAAQ,MAAM,OAAO,MAAM,MAAM,OAAO,QAAQ,MAAM,MAAM;AACnE,UAAM,QAAkB,CAAC;AACzB,aAAS,OAAO,MAAM,MAAM,KAAK,MAAM,OAAO,OAAO,KAAK,MAAM;AAC9D,UAAI,KAAK,OAAO,KAAK,KAAK,OAAO,MAAO,OAAM,IAAI,MAAM,qCAAqC;AAC7F,YAAM,KAAK,OAAO,aAAa,KAAK,IAAI,CAAC;AAAA,IAC3C;AACA,WAAO,KAAK,MAAM,KAAK,EAAE,CAAC;AAAA,EAC5B;AACA,SAAO;AACT;AAEO,IAAM,yBAAyB,CAAC,cAAuD;AAE5F,QAAM,WAAsB,MAAM,QAAQ,SAAS,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC;AAChF,QAAM,WAAW,GAAe,oBAAoB,QAAQ,CAAC;AAC7D,QAAM,WAAW,oBAAI,IAAa;AAClC,aAAW,YAAY,UAAU;AAC/B,aAAS,IAAI,QAAQ;AACrB,QAAI,SAAS,OAAO,GAAI;AAAA,EAC1B;AACA,SAAO,oBAAoB,GAAkB,UAAU,oBAAoB,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;AAC5F;AAEO,IAAM,wBAAwB,CACnC,YAC6B;AAC7B,MAAI,SAAmC,EAAE,GAAG,MAAM;AAClD,WAASD,KAAI,QAAQ,SAAS,GAAGA,MAAK,GAAGA,MAAK;AAC5C,UAAM,SAAS,QAAQA,EAAC;AACxB,UAAM,QAAwB,OAAO,SAAS,SAAS,EAAE,GAAG,QAAQ,IAAI;AAAA,MACtE,GAAG;AAAA,MAAU,SAAS,OAAO,aAAa;AAAA,MAC1C,OAAO,GAAe,oBAAoB,OAAO,SAAS,CAAC;AAAA,IAC7D;AACA,aAAS,EAAE,GAAG,OAAO,MAAM,OAAO,MAAM,OAAO;AAAA,EACjD;AACA,SAAO;AACT;;;AC5DA,IAAM,YAAY,CAAC,UAA2B,OAAO,cAAc,KAAK,KAAK,SAAS;AACtF,IAAM,sBAAsB,CAAC,UAA2B,UAAU,KAAK,KAAK,SAAS;AAE9E,IAAM,WAAW,CAAI,WAAsC;AAChE,MAAI,OAAoB,EAAE,GAAG,MAAM;AACnC,WAAS,QAAQ,OAAO,SAAS,GAAG,SAAS,GAAG,SAAS;AACvD,WAAO,EAAE,GAAG,OAAO,MAAM,OAAO,KAAK,GAAI,MAAM,KAAK;AAAA,EACtD;AACA,SAAO;AACT;AAIO,IAAM,sBAAsB,CAAC,OAAe,WAAmB,WAAmB,WACvF,CAAC,OAAO,WAAW,WAAW,MAAM,EAAE,MAAM,SAAS,KACrD,GAAc,OAAO,WAAW,WAAW,MAAM;AAE5C,IAAM,yBAAyB,CAAC,OAAe,UAAkB,SAAiB,UACvF,CAAC,OAAO,UAAU,SAAS,KAAK,EAAE,MAAM,mBAAmB,KAAK,WAAW,WAAW,gBACtF,GAAa,OAAO,UAAU,SAAS,KAAK;AAmBvC,IAAM,sBAAsB,CAAC,WAAyB,UAAsC;AACjG,MAAI,CAAC,CAAC,UAAU,UAAU,UAAU,QAAQ,UAAU,QAAQ,EAAE,MAAM,SAAS,KAC3E,OAAO,UAAU,aAAa,aAAa,OAAO,UAAU,kBAAkB,UAAW,QAAO;AACpG,QAAM,OAAO;AAAA,IACX,GAAG;AAAA,IAAgB,UAAU,UAAU;AAAA,IAAU,eAAe,UAAU;AAAA,IAC1E,UAAU,UAAU;AAAA,IAAU,QAAQ,UAAU;AAAA,IAAQ,UAAU,UAAU;AAAA,EAC9E;AACA,MAAI,CAAC,GAAY,EAAE,GAAG,MAAM,OAAO,EAAE,GAAG,MAAM,EAAE,CAAC,EAAG,QAAO;AAC3D,MAAI,QAAgB,CAAC;AACrB,aAAW,QAAQ,OAAO;AACxB,QAAI,CAAC,UAAU,KAAK,KAAK,KAAK,CAAC,UAAU,KAAK,IAAI,KAAK,KAAK,QAAQ,KAAK,QACrE,OAAO,KAAK,YAAY,aAAa,OAAO,KAAK,cAAc,UAAW,QAAO;AACrF,UAAM,KAAK,EAAE,GAAG,QAAQ,OAAO,KAAK,OAAO,MAAM,KAAK,MAAM,QAAQ,KAAK,WAAW,KAAK,UAAU,CAAC;AACpG,QAAI,MAAM,WAAW,KAAK;AACxB,UAAI,CAAC,GAAY,EAAE,GAAG,MAAM,OAAO,SAAS,KAAK,EAAE,CAAC,EAAG,QAAO;AAC9D,cAAQ,CAAC;AAAA,IACX;AAAA,EACF;AACA,SAAO,GAAY,EAAE,GAAG,MAAM,OAAO,SAAS,KAAK,EAAE,CAAC;AACxD;AAGO,IAAM,oBAAoB,CAC/B,OAAkB,QAAgB,eAAuB,kBAC7C;AACZ,MAAI,CAAC,CAAC,MAAM,OAAO,MAAM,KAAK,MAAM,OAAO,QAAQ,eAAe,aAAa,EAAE,MAAM,mBAAmB,KAAK,MAAM,QAAQ,SAAS,gBAClI,OAAO,MAAM,aAAa,UAAW,QAAO;AAChD,SAAO,GAAc;AAAA,IACnB,GAAG;AAAA,IAAS,OAAO,MAAM;AAAA,IAAO,KAAK,MAAM;AAAA,IAAK,OAAO,MAAM;AAAA,IAC7D;AAAA,IAAgB;AAAA,IAA8B;AAAA,IAC9C,UAAU,MAAM;AAAA,EAClB,CAAC;AACH;AAIO,IAAM,yBAAyB,CACpC,UACS;AACT,MAAI,MAAM,WAAW,KAAK,MAAM,KAAK,CAAC,SAAS,OAAO,KAAK,UAAU,SAAS,GAAG;AAC/E,UAAM,IAAI,MAAM,qCAAqC;AAAA,EACvD;AACA,MAAI,CAAC,GAAoB,SAAS,MAAM,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,CAAC,GAAG;AACnE,UAAM,IAAI,MAAM,MAAM,KAAK,CAAC,SAAS,CAAC,KAAK,KAAK,GAAG,SAAS,6BAA6B;AAAA,EAC3F;AACF;",
6
+ "names": ["i", "j"]
7
+ }
@@ -1,7 +1,7 @@
1
1
  import {
2
2
  headlineArg,
3
3
  truncateMiddle
4
- } from "./chunk-7EYJE4TW.js";
4
+ } from "./chunk-EKODKR6Y.js";
5
5
  import {
6
6
  CONFIG_DIR_NAME
7
7
  } from "./chunk-PBDDXBHY.js";
@@ -1843,4 +1843,4 @@ export {
1843
1843
  captureLoadedFileIdentity,
1844
1844
  runtimeIdentityStatus
1845
1845
  };
1846
- //# sourceMappingURL=chunk-QGP7AY2R.js.map
1846
+ //# sourceMappingURL=chunk-C7Z6F3SO.js.map