lakutata 2.0.66 → 2.0.68
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/com/cacher.cjs +1 -1
- package/com/cacher.mjs +1 -1
- package/com/entrypoint.cjs +3 -1
- package/com/entrypoint.mjs +3 -1
- package/decorator/ctrl.cjs +3 -1
- package/decorator/ctrl.mjs +3 -1
- package/helper.cjs +24 -18
- package/helper.d.ts +128 -2
- package/helper.mjs +6 -2
- package/lakutata.cjs +3 -1
- package/lakutata.d.ts +1 -1
- package/lakutata.mjs +3 -1
- package/package.json +1 -1
- package/src/components/cacher/Cacher.cjs +1 -1
- package/src/components/cacher/Cacher.mjs +1 -1
- package/src/components/cacher/adapters/CreateFileCacheAdapter.cjs +1 -1
- package/src/components/cacher/adapters/CreateFileCacheAdapter.mjs +1 -1
- package/src/components/cacher/adapters/CreateMemcacheCacheAdapter.cjs +2 -2
- package/src/components/cacher/adapters/CreateMemcacheCacheAdapter.mjs +2 -2
- package/src/components/cacher/adapters/CreateMongoCacheAdapter.cjs +2 -2
- package/src/components/cacher/adapters/CreateMongoCacheAdapter.mjs +2 -2
- package/src/components/cacher/adapters/CreateMysqlCacheAdapter.cjs +2 -2
- package/src/components/cacher/adapters/CreateMysqlCacheAdapter.mjs +2 -2
- package/src/components/cacher/adapters/CreatePostgresCacheAdapter.cjs +2 -2
- package/src/components/cacher/adapters/CreatePostgresCacheAdapter.mjs +2 -2
- package/src/components/cacher/adapters/CreateRedisCacheAdapter.cjs +2 -2
- package/src/components/cacher/adapters/CreateRedisCacheAdapter.mjs +2 -2
- package/src/components/cacher/adapters/CreateSqliteCacheAdapter.cjs +2 -2
- package/src/components/cacher/adapters/CreateSqliteCacheAdapter.mjs +2 -2
- package/src/components/entrypoint/Entrypoint.cjs +6 -1
- package/src/components/entrypoint/Entrypoint.mjs +6 -1
- package/src/decorators/ctrl/CLIAction.cjs +7 -5
- package/src/decorators/ctrl/CLIAction.mjs +3 -1
- package/src/decorators/ctrl/HTTPAction.cjs +8 -6
- package/src/decorators/ctrl/HTTPAction.mjs +3 -1
- package/src/decorators/ctrl/ServiceAction.cjs +3 -1
- package/src/decorators/ctrl/ServiceAction.mjs +7 -5
- package/src/decorators/ctrl/http/DELETE.cjs +3 -1
- package/src/decorators/ctrl/http/DELETE.mjs +3 -1
- package/src/decorators/ctrl/http/GET.cjs +3 -1
- package/src/decorators/ctrl/http/GET.mjs +3 -1
- package/src/decorators/ctrl/http/HEAD.cjs +3 -1
- package/src/decorators/ctrl/http/HEAD.mjs +3 -1
- package/src/decorators/ctrl/http/OPTIONS.cjs +3 -1
- package/src/decorators/ctrl/http/OPTIONS.mjs +3 -1
- package/src/decorators/ctrl/http/PATCH.cjs +3 -1
- package/src/decorators/ctrl/http/PATCH.mjs +3 -1
- package/src/decorators/ctrl/http/POST.cjs +3 -1
- package/src/decorators/ctrl/http/POST.mjs +3 -1
- package/src/decorators/ctrl/http/PUT.cjs +3 -1
- package/src/decorators/ctrl/http/PUT.mjs +3 -1
- package/src/lib/base/internal/ControllerEntrypoint.cjs +70 -610
- package/src/lib/base/internal/ControllerEntrypoint.mjs +87 -627
- package/src/lib/base/internal/StringifyPattern.cjs +1 -1
- package/src/lib/base/internal/StringifyPattern.mjs +1 -1
- package/src/lib/core/Application.cjs +3 -1
- package/src/lib/core/Application.mjs +3 -1
- package/src/lib/helpers/MD5.cjs +1 -1
- package/src/lib/helpers/MD5.mjs +1 -1
- package/src/lib/helpers/SHA1.cjs +1 -1
- package/src/lib/helpers/SHA1.mjs +1 -1
- package/src/lib/helpers/SHA256.cjs +1 -1
- package/src/lib/helpers/SHA256.mjs +1 -1
- package/src/lib/helpers/SortArray.cjs +1 -1
- package/src/lib/helpers/SortArray.mjs +1 -1
- package/src/lib/helpers/UUID.cjs +45 -0
- package/src/lib/helpers/UUID.mjs +39 -0
- package/vendor/Package.19.cjs +1 -1
- package/vendor/Package.19.mjs +176 -187
- package/vendor/Package.610.cjs +297 -113
- package/vendor/Package.610.mjs +285 -97
- package/vendor/Package.611.cjs +85 -103
- package/vendor/Package.611.mjs +80 -98
- package/vendor/Package.612.cjs +100 -121
- package/vendor/Package.612.mjs +97 -120
- package/vendor/Package.613.cjs +196 -0
- package/vendor/Package.613.mjs +180 -0
- package/vendor/Package.64.cjs +511 -134
- package/vendor/Package.64.mjs +491 -134
- package/vendor/Package.65.cjs +140 -4118
- package/vendor/Package.65.mjs +140 -4126
- package/vendor/Package.66.cjs +4142 -692
- package/vendor/Package.66.mjs +4151 -689
- package/vendor/Package.67.cjs +571 -535
- package/vendor/Package.67.mjs +586 -528
- package/vendor/Package.68.cjs +633 -96
- package/vendor/Package.68.mjs +619 -94
- package/vendor/Package.69.cjs +96 -294
- package/vendor/Package.69.mjs +95 -295
- package/vendor/TypeDef.internal.13.d.ts +1 -0
- package/vendor/TypeDef.internal.5.d.ts +1 -1
|
@@ -8,15 +8,17 @@ const e = require("../../helpers/ObjectConstructor.cjs");
|
|
|
8
8
|
|
|
9
9
|
const t = require("../../helpers/As.cjs");
|
|
10
10
|
|
|
11
|
-
const
|
|
11
|
+
const r = require("../../helpers/ObjectParentConstructors.cjs");
|
|
12
12
|
|
|
13
|
-
const
|
|
13
|
+
const n = require("../../helpers/ObjectHash.cjs");
|
|
14
14
|
|
|
15
15
|
const o = require("../../helpers/GetObjectNestingDepth.cjs");
|
|
16
16
|
|
|
17
17
|
const c = require("../../../exceptions/InvalidActionPatternDepthException.cjs");
|
|
18
18
|
|
|
19
|
-
const s = require("
|
|
19
|
+
const s = require("../../../../vendor/Package.64.cjs");
|
|
20
|
+
|
|
21
|
+
const a = require("./StringifyPattern.cjs");
|
|
20
22
|
|
|
21
23
|
require("../../helpers/ObjectParentConstructor.cjs");
|
|
22
24
|
|
|
@@ -42,549 +44,7 @@ require("./CamelCase.cjs");
|
|
|
42
44
|
|
|
43
45
|
require("../../helpers/NoCase.cjs");
|
|
44
46
|
|
|
45
|
-
require("../../../../vendor/Package.
|
|
46
|
-
|
|
47
|
-
const i = "ffffffff-ffff-ffff-ffff-ffffffffffff";
|
|
48
|
-
|
|
49
|
-
const f = "00000000-0000-0000-0000-000000000000";
|
|
50
|
-
|
|
51
|
-
const a = /^(?:[0-9a-f]{8}-[0-9a-f]{4}-[1-8][0-9a-f]{3}-[89ab][0-9a-f]{3}-[0-9a-f]{12}|00000000-0000-0000-0000-000000000000|ffffffff-ffff-ffff-ffff-ffffffffffff)$/i;
|
|
52
|
-
|
|
53
|
-
function u(e) {
|
|
54
|
-
return typeof e === "string" && a.test(e);
|
|
55
|
-
}
|
|
56
|
-
|
|
57
|
-
function l(e) {
|
|
58
|
-
if (!u(e)) {
|
|
59
|
-
throw TypeError("Invalid UUID");
|
|
60
|
-
}
|
|
61
|
-
let t;
|
|
62
|
-
return Uint8Array.of((t = parseInt(e.slice(0, 8), 16)) >>> 24, t >>> 16 & 255, t >>> 8 & 255, t & 255, (t = parseInt(e.slice(9, 13), 16)) >>> 8, t & 255, (t = parseInt(e.slice(14, 18), 16)) >>> 8, t & 255, (t = parseInt(e.slice(19, 23), 16)) >>> 8, t & 255, (t = parseInt(e.slice(24, 36), 16)) / 1099511627776 & 255, t / 4294967296 & 255, t >>> 24 & 255, t >>> 16 & 255, t >>> 8 & 255, t & 255);
|
|
63
|
-
}
|
|
64
|
-
|
|
65
|
-
const p = [];
|
|
66
|
-
|
|
67
|
-
for (let e = 0; e < 256; ++e) {
|
|
68
|
-
p.push((e + 256).toString(16).slice(1));
|
|
69
|
-
}
|
|
70
|
-
|
|
71
|
-
function d(e, t = 0) {
|
|
72
|
-
return (p[e[t + 0]] + p[e[t + 1]] + p[e[t + 2]] + p[e[t + 3]] + "-" + p[e[t + 4]] + p[e[t + 5]] + "-" + p[e[t + 6]] + p[e[t + 7]] + "-" + p[e[t + 8]] + p[e[t + 9]] + "-" + p[e[t + 10]] + p[e[t + 11]] + p[e[t + 12]] + p[e[t + 13]] + p[e[t + 14]] + p[e[t + 15]]).toLowerCase();
|
|
73
|
-
}
|
|
74
|
-
|
|
75
|
-
function g(e, t = 0) {
|
|
76
|
-
const n = d(e, t);
|
|
77
|
-
if (!u(n)) {
|
|
78
|
-
throw TypeError("Stringified UUID is invalid");
|
|
79
|
-
}
|
|
80
|
-
return n;
|
|
81
|
-
}
|
|
82
|
-
|
|
83
|
-
let h;
|
|
84
|
-
|
|
85
|
-
const y = new Uint8Array(16);
|
|
86
|
-
|
|
87
|
-
function m() {
|
|
88
|
-
if (!h) {
|
|
89
|
-
if (typeof crypto === "undefined" || !crypto.getRandomValues) {
|
|
90
|
-
throw new Error("crypto.getRandomValues() not supported. See https://github.com/uuidjs/uuid#getrandomvalues-not-supported");
|
|
91
|
-
}
|
|
92
|
-
h = crypto.getRandomValues.bind(crypto);
|
|
93
|
-
}
|
|
94
|
-
return h(y);
|
|
95
|
-
}
|
|
96
|
-
|
|
97
|
-
const w = {};
|
|
98
|
-
|
|
99
|
-
function A(e, t, n) {
|
|
100
|
-
let r;
|
|
101
|
-
const o = e?._v6 ?? false;
|
|
102
|
-
if (e) {
|
|
103
|
-
const t = Object.keys(e);
|
|
104
|
-
if (t.length === 1 && t[0] === "_v6") {
|
|
105
|
-
e = undefined;
|
|
106
|
-
}
|
|
107
|
-
}
|
|
108
|
-
if (e) {
|
|
109
|
-
r = T(e.random ?? e.rng?.() ?? m(), e.msecs, e.nsecs, e.clockseq, e.node, t, n);
|
|
110
|
-
} else {
|
|
111
|
-
const e = Date.now();
|
|
112
|
-
const c = m();
|
|
113
|
-
b(w, e, c);
|
|
114
|
-
r = T(c, w.msecs, w.nsecs, o ? undefined : w.clockseq, o ? undefined : w.node, t, n);
|
|
115
|
-
}
|
|
116
|
-
return t ?? d(r);
|
|
117
|
-
}
|
|
118
|
-
|
|
119
|
-
function b(e, t, n) {
|
|
120
|
-
e.msecs ??= -Infinity;
|
|
121
|
-
e.nsecs ??= 0;
|
|
122
|
-
if (t === e.msecs) {
|
|
123
|
-
e.nsecs++;
|
|
124
|
-
if (e.nsecs >= 1e4) {
|
|
125
|
-
e.node = undefined;
|
|
126
|
-
e.nsecs = 0;
|
|
127
|
-
}
|
|
128
|
-
} else if (t > e.msecs) {
|
|
129
|
-
e.nsecs = 0;
|
|
130
|
-
} else if (t < e.msecs) {
|
|
131
|
-
e.node = undefined;
|
|
132
|
-
}
|
|
133
|
-
if (!e.node) {
|
|
134
|
-
e.node = n.slice(10, 16);
|
|
135
|
-
e.node[0] |= 1;
|
|
136
|
-
e.clockseq = (n[8] << 8 | n[9]) & 16383;
|
|
137
|
-
}
|
|
138
|
-
e.msecs = t;
|
|
139
|
-
return e;
|
|
140
|
-
}
|
|
141
|
-
|
|
142
|
-
function T(e, t, n, r, o, c, s = 0) {
|
|
143
|
-
if (e.length < 16) {
|
|
144
|
-
throw new Error("Random bytes length must be >= 16");
|
|
145
|
-
}
|
|
146
|
-
if (!c) {
|
|
147
|
-
c = new Uint8Array(16);
|
|
148
|
-
s = 0;
|
|
149
|
-
} else {
|
|
150
|
-
if (s < 0 || s + 16 > c.length) {
|
|
151
|
-
throw new RangeError(`UUID byte range ${s}:${s + 15} is out of buffer bounds`);
|
|
152
|
-
}
|
|
153
|
-
}
|
|
154
|
-
t ??= Date.now();
|
|
155
|
-
n ??= 0;
|
|
156
|
-
r ??= (e[8] << 8 | e[9]) & 16383;
|
|
157
|
-
o ??= e.slice(10, 16);
|
|
158
|
-
t += 122192928e5;
|
|
159
|
-
const i = ((t & 268435455) * 1e4 + n) % 4294967296;
|
|
160
|
-
c[s++] = i >>> 24 & 255;
|
|
161
|
-
c[s++] = i >>> 16 & 255;
|
|
162
|
-
c[s++] = i >>> 8 & 255;
|
|
163
|
-
c[s++] = i & 255;
|
|
164
|
-
const f = t / 4294967296 * 1e4 & 268435455;
|
|
165
|
-
c[s++] = f >>> 8 & 255;
|
|
166
|
-
c[s++] = f & 255;
|
|
167
|
-
c[s++] = f >>> 24 & 15 | 16;
|
|
168
|
-
c[s++] = f >>> 16 & 255;
|
|
169
|
-
c[s++] = r >>> 8 | 128;
|
|
170
|
-
c[s++] = r & 255;
|
|
171
|
-
for (let e = 0; e < 6; ++e) {
|
|
172
|
-
c[s++] = o[e];
|
|
173
|
-
}
|
|
174
|
-
return c;
|
|
175
|
-
}
|
|
176
|
-
|
|
177
|
-
function P(e) {
|
|
178
|
-
const t = typeof e === "string" ? l(e) : e;
|
|
179
|
-
const n = U(t);
|
|
180
|
-
return typeof e === "string" ? d(n) : n;
|
|
181
|
-
}
|
|
182
|
-
|
|
183
|
-
function U(e) {
|
|
184
|
-
return Uint8Array.of((e[6] & 15) << 4 | e[7] >> 4 & 15, (e[7] & 15) << 4 | (e[4] & 240) >> 4, (e[4] & 15) << 4 | (e[5] & 240) >> 4, (e[5] & 15) << 4 | (e[0] & 240) >> 4, (e[0] & 15) << 4 | (e[1] & 240) >> 4, (e[1] & 15) << 4 | (e[2] & 240) >> 4, 96 | e[2] & 15, e[3], e[8], e[9], e[10], e[11], e[12], e[13], e[14], e[15]);
|
|
185
|
-
}
|
|
186
|
-
|
|
187
|
-
function j(e) {
|
|
188
|
-
const t = q(e);
|
|
189
|
-
const n = C(t, e.length * 8);
|
|
190
|
-
return M(n);
|
|
191
|
-
}
|
|
192
|
-
|
|
193
|
-
function M(e) {
|
|
194
|
-
const t = new Uint8Array(e.length * 4);
|
|
195
|
-
for (let n = 0; n < e.length * 4; n++) {
|
|
196
|
-
t[n] = e[n >> 2] >>> n % 4 * 8 & 255;
|
|
197
|
-
}
|
|
198
|
-
return t;
|
|
199
|
-
}
|
|
200
|
-
|
|
201
|
-
function I(e) {
|
|
202
|
-
return (e + 64 >>> 9 << 4) + 14 + 1;
|
|
203
|
-
}
|
|
204
|
-
|
|
205
|
-
function C(e, t) {
|
|
206
|
-
const n = new Uint32Array(I(t)).fill(0);
|
|
207
|
-
n.set(e);
|
|
208
|
-
n[t >> 5] |= 128 << t % 32;
|
|
209
|
-
n[n.length - 1] = t;
|
|
210
|
-
e = n;
|
|
211
|
-
let r = 1732584193;
|
|
212
|
-
let o = -271733879;
|
|
213
|
-
let c = -1732584194;
|
|
214
|
-
let s = 271733878;
|
|
215
|
-
for (let t = 0; t < e.length; t += 16) {
|
|
216
|
-
const n = r;
|
|
217
|
-
const i = o;
|
|
218
|
-
const f = c;
|
|
219
|
-
const a = s;
|
|
220
|
-
r = O(r, o, c, s, e[t], 7, -680876936);
|
|
221
|
-
s = O(s, r, o, c, e[t + 1], 12, -389564586);
|
|
222
|
-
c = O(c, s, r, o, e[t + 2], 17, 606105819);
|
|
223
|
-
o = O(o, c, s, r, e[t + 3], 22, -1044525330);
|
|
224
|
-
r = O(r, o, c, s, e[t + 4], 7, -176418897);
|
|
225
|
-
s = O(s, r, o, c, e[t + 5], 12, 1200080426);
|
|
226
|
-
c = O(c, s, r, o, e[t + 6], 17, -1473231341);
|
|
227
|
-
o = O(o, c, s, r, e[t + 7], 22, -45705983);
|
|
228
|
-
r = O(r, o, c, s, e[t + 8], 7, 1770035416);
|
|
229
|
-
s = O(s, r, o, c, e[t + 9], 12, -1958414417);
|
|
230
|
-
c = O(c, s, r, o, e[t + 10], 17, -42063);
|
|
231
|
-
o = O(o, c, s, r, e[t + 11], 22, -1990404162);
|
|
232
|
-
r = O(r, o, c, s, e[t + 12], 7, 1804603682);
|
|
233
|
-
s = O(s, r, o, c, e[t + 13], 12, -40341101);
|
|
234
|
-
c = O(c, s, r, o, e[t + 14], 17, -1502002290);
|
|
235
|
-
o = O(o, c, s, r, e[t + 15], 22, 1236535329);
|
|
236
|
-
r = R(r, o, c, s, e[t + 1], 5, -165796510);
|
|
237
|
-
s = R(s, r, o, c, e[t + 6], 9, -1069501632);
|
|
238
|
-
c = R(c, s, r, o, e[t + 11], 14, 643717713);
|
|
239
|
-
o = R(o, c, s, r, e[t], 20, -373897302);
|
|
240
|
-
r = R(r, o, c, s, e[t + 5], 5, -701558691);
|
|
241
|
-
s = R(s, r, o, c, e[t + 10], 9, 38016083);
|
|
242
|
-
c = R(c, s, r, o, e[t + 15], 14, -660478335);
|
|
243
|
-
o = R(o, c, s, r, e[t + 4], 20, -405537848);
|
|
244
|
-
r = R(r, o, c, s, e[t + 9], 5, 568446438);
|
|
245
|
-
s = R(s, r, o, c, e[t + 14], 9, -1019803690);
|
|
246
|
-
c = R(c, s, r, o, e[t + 3], 14, -187363961);
|
|
247
|
-
o = R(o, c, s, r, e[t + 8], 20, 1163531501);
|
|
248
|
-
r = R(r, o, c, s, e[t + 13], 5, -1444681467);
|
|
249
|
-
s = R(s, r, o, c, e[t + 2], 9, -51403784);
|
|
250
|
-
c = R(c, s, r, o, e[t + 7], 14, 1735328473);
|
|
251
|
-
o = R(o, c, s, r, e[t + 12], 20, -1926607734);
|
|
252
|
-
r = x(r, o, c, s, e[t + 5], 4, -378558);
|
|
253
|
-
s = x(s, r, o, c, e[t + 8], 11, -2022574463);
|
|
254
|
-
c = x(c, s, r, o, e[t + 11], 16, 1839030562);
|
|
255
|
-
o = x(o, c, s, r, e[t + 14], 23, -35309556);
|
|
256
|
-
r = x(r, o, c, s, e[t + 1], 4, -1530992060);
|
|
257
|
-
s = x(s, r, o, c, e[t + 4], 11, 1272893353);
|
|
258
|
-
c = x(c, s, r, o, e[t + 7], 16, -155497632);
|
|
259
|
-
o = x(o, c, s, r, e[t + 10], 23, -1094730640);
|
|
260
|
-
r = x(r, o, c, s, e[t + 13], 4, 681279174);
|
|
261
|
-
s = x(s, r, o, c, e[t], 11, -358537222);
|
|
262
|
-
c = x(c, s, r, o, e[t + 3], 16, -722521979);
|
|
263
|
-
o = x(o, c, s, r, e[t + 6], 23, 76029189);
|
|
264
|
-
r = x(r, o, c, s, e[t + 9], 4, -640364487);
|
|
265
|
-
s = x(s, r, o, c, e[t + 12], 11, -421815835);
|
|
266
|
-
c = x(c, s, r, o, e[t + 15], 16, 530742520);
|
|
267
|
-
o = x(o, c, s, r, e[t + 2], 23, -995338651);
|
|
268
|
-
r = D(r, o, c, s, e[t], 6, -198630844);
|
|
269
|
-
s = D(s, r, o, c, e[t + 7], 10, 1126891415);
|
|
270
|
-
c = D(c, s, r, o, e[t + 14], 15, -1416354905);
|
|
271
|
-
o = D(o, c, s, r, e[t + 5], 21, -57434055);
|
|
272
|
-
r = D(r, o, c, s, e[t + 12], 6, 1700485571);
|
|
273
|
-
s = D(s, r, o, c, e[t + 3], 10, -1894986606);
|
|
274
|
-
c = D(c, s, r, o, e[t + 10], 15, -1051523);
|
|
275
|
-
o = D(o, c, s, r, e[t + 1], 21, -2054922799);
|
|
276
|
-
r = D(r, o, c, s, e[t + 8], 6, 1873313359);
|
|
277
|
-
s = D(s, r, o, c, e[t + 15], 10, -30611744);
|
|
278
|
-
c = D(c, s, r, o, e[t + 6], 15, -1560198380);
|
|
279
|
-
o = D(o, c, s, r, e[t + 13], 21, 1309151649);
|
|
280
|
-
r = D(r, o, c, s, e[t + 4], 6, -145523070);
|
|
281
|
-
s = D(s, r, o, c, e[t + 11], 10, -1120210379);
|
|
282
|
-
c = D(c, s, r, o, e[t + 2], 15, 718787259);
|
|
283
|
-
o = D(o, c, s, r, e[t + 9], 21, -343485551);
|
|
284
|
-
r = v(r, n);
|
|
285
|
-
o = v(o, i);
|
|
286
|
-
c = v(c, f);
|
|
287
|
-
s = v(s, a);
|
|
288
|
-
}
|
|
289
|
-
return Uint32Array.of(r, o, c, s);
|
|
290
|
-
}
|
|
291
|
-
|
|
292
|
-
function q(e) {
|
|
293
|
-
if (e.length === 0) {
|
|
294
|
-
return new Uint32Array;
|
|
295
|
-
}
|
|
296
|
-
const t = new Uint32Array(I(e.length * 8)).fill(0);
|
|
297
|
-
for (let n = 0; n < e.length; n++) {
|
|
298
|
-
t[n >> 2] |= (e[n] & 255) << n % 4 * 8;
|
|
299
|
-
}
|
|
300
|
-
return t;
|
|
301
|
-
}
|
|
302
|
-
|
|
303
|
-
function v(e, t) {
|
|
304
|
-
const n = (e & 65535) + (t & 65535);
|
|
305
|
-
const r = (e >> 16) + (t >> 16) + (n >> 16);
|
|
306
|
-
return r << 16 | n & 65535;
|
|
307
|
-
}
|
|
308
|
-
|
|
309
|
-
function S(e, t) {
|
|
310
|
-
return e << t | e >>> 32 - t;
|
|
311
|
-
}
|
|
312
|
-
|
|
313
|
-
function E(e, t, n, r, o, c) {
|
|
314
|
-
return v(S(v(v(t, e), v(r, c)), o), n);
|
|
315
|
-
}
|
|
316
|
-
|
|
317
|
-
function O(e, t, n, r, o, c, s) {
|
|
318
|
-
return E(t & n | ~t & r, e, t, o, c, s);
|
|
319
|
-
}
|
|
320
|
-
|
|
321
|
-
function R(e, t, n, r, o, c, s) {
|
|
322
|
-
return E(t & r | n & ~r, e, t, o, c, s);
|
|
323
|
-
}
|
|
324
|
-
|
|
325
|
-
function x(e, t, n, r, o, c, s) {
|
|
326
|
-
return E(t ^ n ^ r, e, t, o, c, s);
|
|
327
|
-
}
|
|
328
|
-
|
|
329
|
-
function D(e, t, n, r, o, c, s) {
|
|
330
|
-
return E(n ^ (t | ~r), e, t, o, c, s);
|
|
331
|
-
}
|
|
332
|
-
|
|
333
|
-
function $(e) {
|
|
334
|
-
e = unescape(encodeURIComponent(e));
|
|
335
|
-
const t = new Uint8Array(e.length);
|
|
336
|
-
for (let n = 0; n < e.length; ++n) {
|
|
337
|
-
t[n] = e.charCodeAt(n);
|
|
338
|
-
}
|
|
339
|
-
return t;
|
|
340
|
-
}
|
|
341
|
-
|
|
342
|
-
const L = "6ba7b810-9dad-11d1-80b4-00c04fd430c8";
|
|
343
|
-
|
|
344
|
-
const H = "6ba7b811-9dad-11d1-80b4-00c04fd430c8";
|
|
345
|
-
|
|
346
|
-
function _(e, t, n, r, o, c) {
|
|
347
|
-
const s = typeof n === "string" ? $(n) : n;
|
|
348
|
-
const i = typeof r === "string" ? l(r) : r;
|
|
349
|
-
if (typeof r === "string") {
|
|
350
|
-
r = l(r);
|
|
351
|
-
}
|
|
352
|
-
if (r?.length !== 16) {
|
|
353
|
-
throw TypeError("Namespace must be array-like (16 iterable integer values, 0-255)");
|
|
354
|
-
}
|
|
355
|
-
let f = new Uint8Array(16 + s.length);
|
|
356
|
-
f.set(i);
|
|
357
|
-
f.set(s, i.length);
|
|
358
|
-
f = t(f);
|
|
359
|
-
f[6] = f[6] & 15 | e;
|
|
360
|
-
f[8] = f[8] & 63 | 128;
|
|
361
|
-
if (o) {
|
|
362
|
-
c = c || 0;
|
|
363
|
-
for (let e = 0; e < 16; ++e) {
|
|
364
|
-
o[c + e] = f[e];
|
|
365
|
-
}
|
|
366
|
-
return o;
|
|
367
|
-
}
|
|
368
|
-
return d(f);
|
|
369
|
-
}
|
|
370
|
-
|
|
371
|
-
function k(e, t, n, r) {
|
|
372
|
-
return _(48, j, e, t, n, r);
|
|
373
|
-
}
|
|
374
|
-
|
|
375
|
-
k.DNS = L;
|
|
376
|
-
|
|
377
|
-
k.URL = H;
|
|
378
|
-
|
|
379
|
-
const N = typeof crypto !== "undefined" && crypto.randomUUID && crypto.randomUUID.bind(crypto);
|
|
380
|
-
|
|
381
|
-
const G = {
|
|
382
|
-
randomUUID: N
|
|
383
|
-
};
|
|
384
|
-
|
|
385
|
-
function J(e, t, n) {
|
|
386
|
-
e = e || {};
|
|
387
|
-
const r = e.random ?? e.rng?.() ?? m();
|
|
388
|
-
if (r.length < 16) {
|
|
389
|
-
throw new Error("Random bytes length must be >= 16");
|
|
390
|
-
}
|
|
391
|
-
r[6] = r[6] & 15 | 64;
|
|
392
|
-
r[8] = r[8] & 63 | 128;
|
|
393
|
-
if (t) {
|
|
394
|
-
n = n || 0;
|
|
395
|
-
if (n < 0 || n + 16 > t.length) {
|
|
396
|
-
throw new RangeError(`UUID byte range ${n}:${n + 15} is out of buffer bounds`);
|
|
397
|
-
}
|
|
398
|
-
for (let e = 0; e < 16; ++e) {
|
|
399
|
-
t[n + e] = r[e];
|
|
400
|
-
}
|
|
401
|
-
return t;
|
|
402
|
-
}
|
|
403
|
-
return d(r);
|
|
404
|
-
}
|
|
405
|
-
|
|
406
|
-
function V(e, t, n) {
|
|
407
|
-
if (G.randomUUID && !t && !e) {
|
|
408
|
-
return G.randomUUID();
|
|
409
|
-
}
|
|
410
|
-
return J(e, t, n);
|
|
411
|
-
}
|
|
412
|
-
|
|
413
|
-
function B(e, t, n, r) {
|
|
414
|
-
switch (e) {
|
|
415
|
-
case 0:
|
|
416
|
-
return t & n ^ ~t & r;
|
|
417
|
-
|
|
418
|
-
case 1:
|
|
419
|
-
return t ^ n ^ r;
|
|
420
|
-
|
|
421
|
-
case 2:
|
|
422
|
-
return t & n ^ t & r ^ n & r;
|
|
423
|
-
|
|
424
|
-
case 3:
|
|
425
|
-
return t ^ n ^ r;
|
|
426
|
-
}
|
|
427
|
-
}
|
|
428
|
-
|
|
429
|
-
function W(e, t) {
|
|
430
|
-
return e << t | e >>> 32 - t;
|
|
431
|
-
}
|
|
432
|
-
|
|
433
|
-
function z(e) {
|
|
434
|
-
const t = [ 1518500249, 1859775393, 2400959708, 3395469782 ];
|
|
435
|
-
const n = [ 1732584193, 4023233417, 2562383102, 271733878, 3285377520 ];
|
|
436
|
-
const r = new Uint8Array(e.length + 1);
|
|
437
|
-
r.set(e);
|
|
438
|
-
r[e.length] = 128;
|
|
439
|
-
e = r;
|
|
440
|
-
const o = e.length / 4 + 2;
|
|
441
|
-
const c = Math.ceil(o / 16);
|
|
442
|
-
const s = new Array(c);
|
|
443
|
-
for (let t = 0; t < c; ++t) {
|
|
444
|
-
const n = new Uint32Array(16);
|
|
445
|
-
for (let r = 0; r < 16; ++r) {
|
|
446
|
-
n[r] = e[t * 64 + r * 4] << 24 | e[t * 64 + r * 4 + 1] << 16 | e[t * 64 + r * 4 + 2] << 8 | e[t * 64 + r * 4 + 3];
|
|
447
|
-
}
|
|
448
|
-
s[t] = n;
|
|
449
|
-
}
|
|
450
|
-
s[c - 1][14] = (e.length - 1) * 8 / Math.pow(2, 32);
|
|
451
|
-
s[c - 1][14] = Math.floor(s[c - 1][14]);
|
|
452
|
-
s[c - 1][15] = (e.length - 1) * 8 & 4294967295;
|
|
453
|
-
for (let e = 0; e < c; ++e) {
|
|
454
|
-
const r = new Uint32Array(80);
|
|
455
|
-
for (let t = 0; t < 16; ++t) {
|
|
456
|
-
r[t] = s[e][t];
|
|
457
|
-
}
|
|
458
|
-
for (let e = 16; e < 80; ++e) {
|
|
459
|
-
r[e] = W(r[e - 3] ^ r[e - 8] ^ r[e - 14] ^ r[e - 16], 1);
|
|
460
|
-
}
|
|
461
|
-
let o = n[0];
|
|
462
|
-
let c = n[1];
|
|
463
|
-
let i = n[2];
|
|
464
|
-
let f = n[3];
|
|
465
|
-
let a = n[4];
|
|
466
|
-
for (let e = 0; e < 80; ++e) {
|
|
467
|
-
const n = Math.floor(e / 20);
|
|
468
|
-
const s = W(o, 5) + B(n, c, i, f) + a + t[n] + r[e] >>> 0;
|
|
469
|
-
a = f;
|
|
470
|
-
f = i;
|
|
471
|
-
i = W(c, 30) >>> 0;
|
|
472
|
-
c = o;
|
|
473
|
-
o = s;
|
|
474
|
-
}
|
|
475
|
-
n[0] = n[0] + o >>> 0;
|
|
476
|
-
n[1] = n[1] + c >>> 0;
|
|
477
|
-
n[2] = n[2] + i >>> 0;
|
|
478
|
-
n[3] = n[3] + f >>> 0;
|
|
479
|
-
n[4] = n[4] + a >>> 0;
|
|
480
|
-
}
|
|
481
|
-
return Uint8Array.of(n[0] >> 24, n[0] >> 16, n[0] >> 8, n[0], n[1] >> 24, n[1] >> 16, n[1] >> 8, n[1], n[2] >> 24, n[2] >> 16, n[2] >> 8, n[2], n[3] >> 24, n[3] >> 16, n[3] >> 8, n[3], n[4] >> 24, n[4] >> 16, n[4] >> 8, n[4]);
|
|
482
|
-
}
|
|
483
|
-
|
|
484
|
-
function F(e, t, n, r) {
|
|
485
|
-
return _(80, z, e, t, n, r);
|
|
486
|
-
}
|
|
487
|
-
|
|
488
|
-
F.DNS = L;
|
|
489
|
-
|
|
490
|
-
F.URL = H;
|
|
491
|
-
|
|
492
|
-
function K(e, t, n) {
|
|
493
|
-
e ??= {};
|
|
494
|
-
n ??= 0;
|
|
495
|
-
let r = A({
|
|
496
|
-
...e,
|
|
497
|
-
_v6: true
|
|
498
|
-
}, new Uint8Array(16));
|
|
499
|
-
r = P(r);
|
|
500
|
-
if (t) {
|
|
501
|
-
for (let e = 0; e < 16; e++) {
|
|
502
|
-
t[n + e] = r[e];
|
|
503
|
-
}
|
|
504
|
-
return t;
|
|
505
|
-
}
|
|
506
|
-
return d(r);
|
|
507
|
-
}
|
|
508
|
-
|
|
509
|
-
function Q(e) {
|
|
510
|
-
const t = typeof e === "string" ? l(e) : e;
|
|
511
|
-
const n = X(t);
|
|
512
|
-
return typeof e === "string" ? d(n) : n;
|
|
513
|
-
}
|
|
514
|
-
|
|
515
|
-
function X(e) {
|
|
516
|
-
return Uint8Array.of((e[3] & 15) << 4 | e[4] >> 4 & 15, (e[4] & 15) << 4 | (e[5] & 240) >> 4, (e[5] & 15) << 4 | e[6] & 15, e[7], (e[1] & 15) << 4 | (e[2] & 240) >> 4, (e[2] & 15) << 4 | (e[3] & 240) >> 4, 16 | (e[0] & 240) >> 4, (e[0] & 15) << 4 | (e[1] & 240) >> 4, e[8], e[9], e[10], e[11], e[12], e[13], e[14], e[15]);
|
|
517
|
-
}
|
|
518
|
-
|
|
519
|
-
const Y = {};
|
|
520
|
-
|
|
521
|
-
function Z(e, t, n) {
|
|
522
|
-
let r;
|
|
523
|
-
if (e) {
|
|
524
|
-
r = te(e.random ?? e.rng?.() ?? m(), e.msecs, e.seq, t, n);
|
|
525
|
-
} else {
|
|
526
|
-
const e = Date.now();
|
|
527
|
-
const o = m();
|
|
528
|
-
ee(Y, e, o);
|
|
529
|
-
r = te(o, Y.msecs, Y.seq, t, n);
|
|
530
|
-
}
|
|
531
|
-
return t ?? d(r);
|
|
532
|
-
}
|
|
533
|
-
|
|
534
|
-
function ee(e, t, n) {
|
|
535
|
-
e.msecs ??= -Infinity;
|
|
536
|
-
e.seq ??= 0;
|
|
537
|
-
if (t > e.msecs) {
|
|
538
|
-
e.seq = n[6] << 23 | n[7] << 16 | n[8] << 8 | n[9];
|
|
539
|
-
e.msecs = t;
|
|
540
|
-
} else {
|
|
541
|
-
e.seq = e.seq + 1 | 0;
|
|
542
|
-
if (e.seq === 0) {
|
|
543
|
-
e.msecs++;
|
|
544
|
-
}
|
|
545
|
-
}
|
|
546
|
-
return e;
|
|
547
|
-
}
|
|
548
|
-
|
|
549
|
-
function te(e, t, n, r, o = 0) {
|
|
550
|
-
if (e.length < 16) {
|
|
551
|
-
throw new Error("Random bytes length must be >= 16");
|
|
552
|
-
}
|
|
553
|
-
if (!r) {
|
|
554
|
-
r = new Uint8Array(16);
|
|
555
|
-
o = 0;
|
|
556
|
-
} else {
|
|
557
|
-
if (o < 0 || o + 16 > r.length) {
|
|
558
|
-
throw new RangeError(`UUID byte range ${o}:${o + 15} is out of buffer bounds`);
|
|
559
|
-
}
|
|
560
|
-
}
|
|
561
|
-
t ??= Date.now();
|
|
562
|
-
n ??= e[6] * 127 << 24 | e[7] << 16 | e[8] << 8 | e[9];
|
|
563
|
-
r[o++] = t / 1099511627776 & 255;
|
|
564
|
-
r[o++] = t / 4294967296 & 255;
|
|
565
|
-
r[o++] = t / 16777216 & 255;
|
|
566
|
-
r[o++] = t / 65536 & 255;
|
|
567
|
-
r[o++] = t / 256 & 255;
|
|
568
|
-
r[o++] = t & 255;
|
|
569
|
-
r[o++] = 112 | n >>> 28 & 15;
|
|
570
|
-
r[o++] = n >>> 20 & 255;
|
|
571
|
-
r[o++] = 128 | n >>> 14 & 63;
|
|
572
|
-
r[o++] = n >>> 6 & 255;
|
|
573
|
-
r[o++] = n << 2 & 255 | e[10] & 3;
|
|
574
|
-
r[o++] = e[11];
|
|
575
|
-
r[o++] = e[12];
|
|
576
|
-
r[o++] = e[13];
|
|
577
|
-
r[o++] = e[14];
|
|
578
|
-
r[o++] = e[15];
|
|
579
|
-
return r;
|
|
580
|
-
}
|
|
581
|
-
|
|
582
|
-
function ne(e) {
|
|
583
|
-
if (!u(e)) {
|
|
584
|
-
throw TypeError("Invalid UUID");
|
|
585
|
-
}
|
|
586
|
-
return parseInt(e.slice(14, 15), 16);
|
|
587
|
-
}
|
|
47
|
+
require("../../../../vendor/Package.65.cjs");
|
|
588
48
|
|
|
589
49
|
exports.ActionPatternManagerType = void 0;
|
|
590
50
|
|
|
@@ -594,136 +54,136 @@ exports.ActionPatternManagerType = void 0;
|
|
|
594
54
|
e["Service"] = "_$APMT_Service";
|
|
595
55
|
})(exports.ActionPatternManagerType || (exports.ActionPatternManagerType = {}));
|
|
596
56
|
|
|
597
|
-
const
|
|
57
|
+
const i = Symbol("COMPONENT.CTRL.MAP");
|
|
598
58
|
|
|
599
|
-
function
|
|
600
|
-
const
|
|
601
|
-
const i =
|
|
602
|
-
const
|
|
59
|
+
function p(r, n, o, c) {
|
|
60
|
+
const a = `${t.As(e.ObjectConstructor(r)).className}:${n}`;
|
|
61
|
+
const i = s.v5(`${a}:${c}`, s.NIL);
|
|
62
|
+
const p = o.name ? o.name : a;
|
|
603
63
|
const u = o.description ? o.description : "";
|
|
604
64
|
return {
|
|
605
65
|
id: i,
|
|
606
66
|
acl: !!o.acl,
|
|
607
|
-
action:
|
|
608
|
-
name:
|
|
67
|
+
action: a,
|
|
68
|
+
name: p,
|
|
609
69
|
description: u,
|
|
610
70
|
groups: o.groups ? o.groups : [],
|
|
611
71
|
rule: o.rule
|
|
612
72
|
};
|
|
613
73
|
}
|
|
614
74
|
|
|
615
|
-
function
|
|
75
|
+
function u(e) {
|
|
616
76
|
const t = o.GetObjectNestingDepth(e);
|
|
617
77
|
if (t > 2) throw new c.InvalidActionPatternDepthException("The maximum nesting depth of ActionPattern objects cannot be greater than 2 levels. The current nesting depth of the object is {0} levels", [ t ]);
|
|
618
78
|
return e;
|
|
619
79
|
}
|
|
620
80
|
|
|
621
|
-
function
|
|
81
|
+
function P(e, n) {
|
|
622
82
|
const o = new Map;
|
|
623
|
-
|
|
624
|
-
const
|
|
625
|
-
|
|
83
|
+
r.ObjectParentConstructors(n).forEach((t => {
|
|
84
|
+
const r = Reflect.getOwnMetadata(`${e}_MAP`, t) || new Map;
|
|
85
|
+
r.forEach(((e, t) => o.set(t, e)));
|
|
626
86
|
}));
|
|
627
|
-
t.As(Reflect.getOwnMetadata(`${e}_MAP`,
|
|
87
|
+
t.As(Reflect.getOwnMetadata(`${e}_MAP`, n) || new Map).forEach(((e, t) => o.set(t, e)));
|
|
628
88
|
return o;
|
|
629
89
|
}
|
|
630
90
|
|
|
631
|
-
function
|
|
632
|
-
|
|
633
|
-
const c =
|
|
634
|
-
c.set(
|
|
635
|
-
pattern:
|
|
91
|
+
function h(e, t, r, o) {
|
|
92
|
+
r = u(r);
|
|
93
|
+
const c = P(e, t);
|
|
94
|
+
c.set(n.ObjectHash(r), {
|
|
95
|
+
pattern: r,
|
|
636
96
|
details: o
|
|
637
97
|
});
|
|
638
98
|
Reflect.defineMetadata(`${e}_MAP`, c, t);
|
|
639
99
|
}
|
|
640
100
|
|
|
641
|
-
function
|
|
642
|
-
const
|
|
101
|
+
function T(e, t) {
|
|
102
|
+
const r = Reflect.getOwnMetadata(i, e) || {
|
|
643
103
|
CLI: new Map,
|
|
644
104
|
HTTP: new Map,
|
|
645
105
|
Service: new Map
|
|
646
106
|
};
|
|
647
|
-
|
|
648
|
-
|
|
649
|
-
|
|
650
|
-
Reflect.defineMetadata(
|
|
107
|
+
P(exports.ActionPatternManagerType.CLI, t).forEach(((e, t) => r.CLI.set(t, e)));
|
|
108
|
+
P(exports.ActionPatternManagerType.HTTP, t).forEach(((e, t) => r.HTTP.set(t, e)));
|
|
109
|
+
P(exports.ActionPatternManagerType.Service, t).forEach(((e, t) => r.Service.set(t, e)));
|
|
110
|
+
Reflect.defineMetadata(i, r, e);
|
|
651
111
|
}
|
|
652
112
|
|
|
653
|
-
function
|
|
654
|
-
const t = Reflect.getOwnMetadata(
|
|
113
|
+
function j(e) {
|
|
114
|
+
const t = Reflect.getOwnMetadata(i, e) || {
|
|
655
115
|
CLI: new Map,
|
|
656
116
|
HTTP: new Map,
|
|
657
117
|
Service: new Map
|
|
658
118
|
};
|
|
659
|
-
const
|
|
119
|
+
const r = {
|
|
660
120
|
CLI: new Map,
|
|
661
121
|
HTTP: new Map,
|
|
662
122
|
Service: new Map
|
|
663
123
|
};
|
|
664
|
-
t.CLI.forEach((e =>
|
|
665
|
-
t.HTTP.forEach((e =>
|
|
666
|
-
t.Service.forEach((e =>
|
|
667
|
-
return
|
|
124
|
+
t.CLI.forEach((e => r.CLI.set(e.pattern, e.details)));
|
|
125
|
+
t.HTTP.forEach((e => r.HTTP.set(e.pattern, e.details)));
|
|
126
|
+
t.Service.forEach((e => r.Service.set(e.pattern, e.details)));
|
|
127
|
+
return r;
|
|
668
128
|
}
|
|
669
129
|
|
|
670
|
-
function
|
|
671
|
-
|
|
672
|
-
const
|
|
673
|
-
route:
|
|
674
|
-
method:
|
|
130
|
+
function l(r, n, o, c, s, a) {
|
|
131
|
+
n.forEach((n => {
|
|
132
|
+
const i = {
|
|
133
|
+
route: r,
|
|
134
|
+
method: n
|
|
675
135
|
};
|
|
676
|
-
const
|
|
677
|
-
|
|
678
|
-
...
|
|
679
|
-
pattern:
|
|
136
|
+
const u = p(o, c, a, r);
|
|
137
|
+
h(exports.ActionPatternManagerType.HTTP, t.As(e.ObjectConstructor(o)), i, {
|
|
138
|
+
...u,
|
|
139
|
+
pattern: i,
|
|
680
140
|
constructor: t.As(e.ObjectConstructor(o)),
|
|
681
141
|
method: c,
|
|
682
142
|
dtoConstructor: s,
|
|
683
143
|
jsonSchema: s.toJsonSchema(),
|
|
684
|
-
getActionInfo: () =>
|
|
144
|
+
getActionInfo: () => u
|
|
685
145
|
});
|
|
686
146
|
}));
|
|
687
147
|
}
|
|
688
148
|
|
|
689
|
-
function
|
|
690
|
-
const
|
|
691
|
-
command:
|
|
149
|
+
function g(r, n, o, c, s) {
|
|
150
|
+
const a = {
|
|
151
|
+
command: r
|
|
692
152
|
};
|
|
693
|
-
const
|
|
694
|
-
|
|
695
|
-
...
|
|
696
|
-
pattern:
|
|
697
|
-
constructor: t.As(e.ObjectConstructor(
|
|
153
|
+
const i = p(n, o, s, r);
|
|
154
|
+
h(exports.ActionPatternManagerType.CLI, t.As(e.ObjectConstructor(n)), a, {
|
|
155
|
+
...i,
|
|
156
|
+
pattern: a,
|
|
157
|
+
constructor: t.As(e.ObjectConstructor(n)),
|
|
698
158
|
method: o,
|
|
699
159
|
dtoConstructor: c,
|
|
700
160
|
jsonSchema: c.toJsonSchema(),
|
|
701
|
-
getActionInfo: () =>
|
|
161
|
+
getActionInfo: () => i
|
|
702
162
|
});
|
|
703
163
|
}
|
|
704
164
|
|
|
705
|
-
function
|
|
706
|
-
const
|
|
707
|
-
const
|
|
708
|
-
|
|
709
|
-
...
|
|
710
|
-
pattern:
|
|
711
|
-
constructor: t.As(e.ObjectConstructor(
|
|
165
|
+
function d(r, n, o, c, s) {
|
|
166
|
+
const i = a.StringifyPattern(r);
|
|
167
|
+
const u = p(n, o, s, i);
|
|
168
|
+
h(exports.ActionPatternManagerType.Service, t.As(e.ObjectConstructor(n)), r, {
|
|
169
|
+
...u,
|
|
170
|
+
pattern: r,
|
|
171
|
+
constructor: t.As(e.ObjectConstructor(n)),
|
|
712
172
|
method: o,
|
|
713
173
|
dtoConstructor: c,
|
|
714
174
|
jsonSchema: c.toJsonSchema(),
|
|
715
|
-
getActionInfo: () =>
|
|
175
|
+
getActionInfo: () => u
|
|
716
176
|
});
|
|
717
177
|
}
|
|
718
178
|
|
|
719
|
-
exports.BindControllerToComponent =
|
|
179
|
+
exports.BindControllerToComponent = T;
|
|
720
180
|
|
|
721
|
-
exports.GetComponentControllerActionMap =
|
|
181
|
+
exports.GetComponentControllerActionMap = j;
|
|
722
182
|
|
|
723
|
-
exports.RegisterCLIAction =
|
|
183
|
+
exports.RegisterCLIAction = g;
|
|
724
184
|
|
|
725
|
-
exports.RegisterControllerActionPattern =
|
|
185
|
+
exports.RegisterControllerActionPattern = h;
|
|
726
186
|
|
|
727
|
-
exports.RegisterHTTPAction =
|
|
187
|
+
exports.RegisterHTTPAction = l;
|
|
728
188
|
|
|
729
|
-
exports.RegisterServiceAction =
|
|
189
|
+
exports.RegisterServiceAction = d;
|