@cratis/chronicle.contracts 16.37.0 → 16.37.2
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/dist/cjs/generated/captures.d.ts.map +1 -1
- package/dist/cjs/generated/clients.d.ts.map +1 -1
- package/dist/cjs/generated/clients.js +234 -174
- package/dist/cjs/generated/clients.js.map +1 -1
- package/dist/cjs/generated/compliance.d.ts.map +1 -1
- package/dist/cjs/generated/events.d.ts.map +1 -1
- package/dist/cjs/generated/events.js +371 -261
- package/dist/cjs/generated/events.js.map +1 -1
- package/dist/cjs/generated/events_constraints.d.ts.map +1 -1
- package/dist/cjs/generated/events_constraints.js +235 -165
- package/dist/cjs/generated/events_constraints.js.map +1 -1
- package/dist/cjs/generated/eventsequences.d.ts.map +1 -1
- package/dist/cjs/generated/eventsequences.js +1693 -1341
- package/dist/cjs/generated/eventsequences.js.map +1 -1
- package/dist/cjs/generated/eventstores.d.ts.map +1 -1
- package/dist/cjs/generated/eventstores.js +172 -132
- package/dist/cjs/generated/eventstores.js.map +1 -1
- package/dist/cjs/generated/externalservices.d.ts.map +1 -1
- package/dist/cjs/generated/google/protobuf/empty.d.ts.map +1 -1
- package/dist/cjs/generated/google/protobuf/empty.js +20 -8
- package/dist/cjs/generated/google/protobuf/empty.js.map +1 -1
- package/dist/cjs/generated/host.d.ts.map +1 -1
- package/dist/cjs/generated/host.js +31 -21
- package/dist/cjs/generated/host.js.map +1 -1
- package/dist/cjs/generated/identities.d.ts.map +1 -1
- package/dist/cjs/generated/identities.js +142 -102
- package/dist/cjs/generated/identities.js.map +1 -1
- package/dist/cjs/generated/jobs.d.ts.map +1 -1
- package/dist/cjs/generated/jobs.js +802 -630
- package/dist/cjs/generated/jobs.js.map +1 -1
- package/dist/cjs/generated/namespaces.d.ts.map +1 -1
- package/dist/cjs/generated/namespaces.js +203 -153
- package/dist/cjs/generated/namespaces.js.map +1 -1
- package/dist/cjs/generated/observation.d.ts.map +1 -1
- package/dist/cjs/generated/observation.js +959 -749
- package/dist/cjs/generated/observation.js.map +1 -1
- package/dist/cjs/generated/observation_eventstoresubscriptions.d.ts.map +1 -1
- package/dist/cjs/generated/observation_reactors.d.ts.map +1 -1
- package/dist/cjs/generated/observation_reactors.js +895 -695
- package/dist/cjs/generated/observation_reactors.js.map +1 -1
- package/dist/cjs/generated/observation_reducers.d.ts.map +1 -1
- package/dist/cjs/generated/observation_reducers.js +841 -661
- package/dist/cjs/generated/observation_reducers.js.map +1 -1
- package/dist/cjs/generated/observation_webhooks.d.ts.map +1 -1
- package/dist/cjs/generated/observation_webhooks.js +541 -376
- package/dist/cjs/generated/observation_webhooks.js.map +1 -1
- package/dist/cjs/generated/projections.d.ts.map +1 -1
- package/dist/cjs/generated/projections.js +1867 -1392
- package/dist/cjs/generated/projections.js.map +1 -1
- package/dist/cjs/generated/protobuf-net/bcl.d.ts.map +1 -1
- package/dist/cjs/generated/protobuf-net/bcl.js +130 -90
- package/dist/cjs/generated/protobuf-net/bcl.js.map +1 -1
- package/dist/cjs/generated/readmodels.d.ts.map +1 -1
- package/dist/cjs/generated/readmodels.js +1705 -1345
- package/dist/cjs/generated/readmodels.js.map +1 -1
- package/dist/cjs/generated/recommendations.d.ts.map +1 -1
- package/dist/cjs/generated/recommendations.js +167 -117
- package/dist/cjs/generated/recommendations.js.map +1 -1
- package/dist/cjs/generated/security.d.ts.map +1 -1
- package/dist/cjs/generated/security.js +684 -512
- package/dist/cjs/generated/security.js.map +1 -1
- package/dist/cjs/generated/seeding.d.ts.map +1 -1
- package/dist/cjs/generated/seeding.js +247 -177
- package/dist/cjs/generated/seeding.js.map +1 -1
- package/dist/esm/generated/captures.d.ts.map +1 -1
- package/dist/esm/generated/clients.d.ts.map +1 -1
- package/dist/esm/generated/clients.js +234 -174
- package/dist/esm/generated/clients.js.map +1 -1
- package/dist/esm/generated/compliance.d.ts.map +1 -1
- package/dist/esm/generated/events.d.ts.map +1 -1
- package/dist/esm/generated/events.js +371 -261
- package/dist/esm/generated/events.js.map +1 -1
- package/dist/esm/generated/events_constraints.d.ts.map +1 -1
- package/dist/esm/generated/events_constraints.js +235 -165
- package/dist/esm/generated/events_constraints.js.map +1 -1
- package/dist/esm/generated/eventsequences.d.ts.map +1 -1
- package/dist/esm/generated/eventsequences.js +1693 -1341
- package/dist/esm/generated/eventsequences.js.map +1 -1
- package/dist/esm/generated/eventstores.d.ts.map +1 -1
- package/dist/esm/generated/eventstores.js +172 -132
- package/dist/esm/generated/eventstores.js.map +1 -1
- package/dist/esm/generated/externalservices.d.ts.map +1 -1
- package/dist/esm/generated/google/protobuf/empty.d.ts.map +1 -1
- package/dist/esm/generated/google/protobuf/empty.js +20 -8
- package/dist/esm/generated/google/protobuf/empty.js.map +1 -1
- package/dist/esm/generated/host.d.ts.map +1 -1
- package/dist/esm/generated/host.js +31 -21
- package/dist/esm/generated/host.js.map +1 -1
- package/dist/esm/generated/identities.d.ts.map +1 -1
- package/dist/esm/generated/identities.js +142 -102
- package/dist/esm/generated/identities.js.map +1 -1
- package/dist/esm/generated/jobs.d.ts.map +1 -1
- package/dist/esm/generated/jobs.js +802 -630
- package/dist/esm/generated/jobs.js.map +1 -1
- package/dist/esm/generated/namespaces.d.ts.map +1 -1
- package/dist/esm/generated/namespaces.js +203 -153
- package/dist/esm/generated/namespaces.js.map +1 -1
- package/dist/esm/generated/observation.d.ts.map +1 -1
- package/dist/esm/generated/observation.js +959 -749
- package/dist/esm/generated/observation.js.map +1 -1
- package/dist/esm/generated/observation_eventstoresubscriptions.d.ts.map +1 -1
- package/dist/esm/generated/observation_reactors.d.ts.map +1 -1
- package/dist/esm/generated/observation_reactors.js +895 -695
- package/dist/esm/generated/observation_reactors.js.map +1 -1
- package/dist/esm/generated/observation_reducers.d.ts.map +1 -1
- package/dist/esm/generated/observation_reducers.js +841 -661
- package/dist/esm/generated/observation_reducers.js.map +1 -1
- package/dist/esm/generated/observation_webhooks.d.ts.map +1 -1
- package/dist/esm/generated/observation_webhooks.js +541 -376
- package/dist/esm/generated/observation_webhooks.js.map +1 -1
- package/dist/esm/generated/projections.d.ts.map +1 -1
- package/dist/esm/generated/projections.js +1867 -1392
- package/dist/esm/generated/projections.js.map +1 -1
- package/dist/esm/generated/protobuf-net/bcl.d.ts.map +1 -1
- package/dist/esm/generated/protobuf-net/bcl.js +130 -90
- package/dist/esm/generated/protobuf-net/bcl.js.map +1 -1
- package/dist/esm/generated/readmodels.d.ts.map +1 -1
- package/dist/esm/generated/readmodels.js +1705 -1345
- package/dist/esm/generated/readmodels.js.map +1 -1
- package/dist/esm/generated/recommendations.d.ts.map +1 -1
- package/dist/esm/generated/recommendations.js +167 -117
- package/dist/esm/generated/recommendations.js.map +1 -1
- package/dist/esm/generated/security.d.ts.map +1 -1
- package/dist/esm/generated/security.js +684 -512
- package/dist/esm/generated/security.js.map +1 -1
- package/dist/esm/generated/seeding.d.ts.map +1 -1
- package/dist/esm/generated/seeding.js +247 -177
- package/dist/esm/generated/seeding.js.map +1 -1
- package/dist/generated/captures.d.ts.map +1 -1
- package/dist/generated/captures.js +372 -252
- package/dist/generated/captures.js.map +1 -1
- package/dist/generated/clients.d.ts.map +1 -1
- package/dist/generated/clients.js +234 -174
- package/dist/generated/clients.js.map +1 -1
- package/dist/generated/compliance.d.ts.map +1 -1
- package/dist/generated/compliance.js +160 -120
- package/dist/generated/compliance.js.map +1 -1
- package/dist/generated/events.d.ts.map +1 -1
- package/dist/generated/events.js +371 -261
- package/dist/generated/events.js.map +1 -1
- package/dist/generated/events_constraints.d.ts.map +1 -1
- package/dist/generated/events_constraints.js +235 -165
- package/dist/generated/events_constraints.js.map +1 -1
- package/dist/generated/eventsequences.d.ts.map +1 -1
- package/dist/generated/eventsequences.js +1693 -1343
- package/dist/generated/eventsequences.js.map +1 -1
- package/dist/generated/eventstores.d.ts.map +1 -1
- package/dist/generated/eventstores.js +172 -132
- package/dist/generated/eventstores.js.map +1 -1
- package/dist/generated/externalservices.d.ts.map +1 -1
- package/dist/generated/externalservices.js +488 -338
- package/dist/generated/externalservices.js.map +1 -1
- package/dist/generated/google/protobuf/empty.d.ts.map +1 -1
- package/dist/generated/google/protobuf/empty.js +20 -10
- package/dist/generated/google/protobuf/empty.js.map +1 -1
- package/dist/generated/host.d.ts.map +1 -1
- package/dist/generated/host.js +31 -21
- package/dist/generated/host.js.map +1 -1
- package/dist/generated/identities.d.ts.map +1 -1
- package/dist/generated/identities.js +142 -102
- package/dist/generated/identities.js.map +1 -1
- package/dist/generated/jobs.d.ts.map +1 -1
- package/dist/generated/jobs.js +802 -632
- package/dist/generated/jobs.js.map +1 -1
- package/dist/generated/namespaces.d.ts.map +1 -1
- package/dist/generated/namespaces.js +203 -153
- package/dist/generated/namespaces.js.map +1 -1
- package/dist/generated/observation.d.ts.map +1 -1
- package/dist/generated/observation.js +959 -749
- package/dist/generated/observation.js.map +1 -1
- package/dist/generated/observation_eventstoresubscriptions.d.ts.map +1 -1
- package/dist/generated/observation_eventstoresubscriptions.js +186 -126
- package/dist/generated/observation_eventstoresubscriptions.js.map +1 -1
- package/dist/generated/observation_reactors.d.ts.map +1 -1
- package/dist/generated/observation_reactors.js +895 -695
- package/dist/generated/observation_reactors.js.map +1 -1
- package/dist/generated/observation_reducers.d.ts.map +1 -1
- package/dist/generated/observation_reducers.js +841 -661
- package/dist/generated/observation_reducers.js.map +1 -1
- package/dist/generated/observation_webhooks.d.ts.map +1 -1
- package/dist/generated/observation_webhooks.js +541 -376
- package/dist/generated/observation_webhooks.js.map +1 -1
- package/dist/generated/projections.d.ts.map +1 -1
- package/dist/generated/projections.js +1867 -1392
- package/dist/generated/projections.js.map +1 -1
- package/dist/generated/protobuf-net/bcl.d.ts.map +1 -1
- package/dist/generated/protobuf-net/bcl.js +167 -117
- package/dist/generated/protobuf-net/bcl.js.map +1 -1
- package/dist/generated/readmodels.d.ts.map +1 -1
- package/dist/generated/readmodels.js +1705 -1345
- package/dist/generated/readmodels.js.map +1 -1
- package/dist/generated/recommendations.d.ts.map +1 -1
- package/dist/generated/recommendations.js +167 -117
- package/dist/generated/recommendations.js.map +1 -1
- package/dist/generated/security.d.ts.map +1 -1
- package/dist/generated/security.js +684 -514
- package/dist/generated/security.js.map +1 -1
- package/dist/generated/seeding.d.ts.map +1 -1
- package/dist/generated/seeding.js +247 -177
- package/dist/generated/seeding.js.map +1 -1
- package/dist/tsconfig.tsbuildinfo +1 -1
- package/generated/captures.ts +373 -265
- package/generated/clients.ts +235 -181
- package/generated/compliance.ts +161 -125
- package/generated/events.ts +372 -273
- package/generated/events_constraints.ts +240 -177
- package/generated/eventsequences.ts +1691 -1374
- package/generated/eventstores.ts +173 -137
- package/generated/externalservices.ts +495 -359
- package/generated/google/protobuf/empty.ts +20 -11
- package/generated/host.ts +32 -23
- package/generated/identities.ts +143 -107
- package/generated/jobs.ts +852 -699
- package/generated/namespaces.ts +204 -159
- package/generated/observation.ts +1012 -823
- package/generated/observation_eventstoresubscriptions.ts +187 -133
- package/generated/observation_reactors.ts +937 -756
- package/generated/observation_reducers.ts +883 -720
- package/generated/observation_webhooks.ts +547 -398
- package/generated/projections.ts +1955 -1520
- package/generated/protobuf-net/bcl.ts +168 -123
- package/generated/readmodels.ts +1801 -1476
- package/generated/recommendations.ts +168 -123
- package/generated/security.ts +684 -531
- package/generated/seeding.ts +248 -185
- package/package.json +1 -1
package/dist/generated/jobs.js
CHANGED
|
@@ -205,32 +205,42 @@ export const AllJobsRequest = {
|
|
|
205
205
|
},
|
|
206
206
|
decode(input, length) {
|
|
207
207
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
208
|
-
const
|
|
209
|
-
|
|
210
|
-
|
|
211
|
-
|
|
212
|
-
|
|
213
|
-
|
|
214
|
-
|
|
215
|
-
|
|
216
|
-
|
|
217
|
-
|
|
218
|
-
|
|
219
|
-
|
|
220
|
-
|
|
221
|
-
|
|
222
|
-
|
|
223
|
-
|
|
224
|
-
|
|
225
|
-
|
|
226
|
-
|
|
227
|
-
|
|
228
|
-
|
|
229
|
-
|
|
208
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
209
|
+
if (previousRecursionDepth >= 100) {
|
|
210
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
211
|
+
}
|
|
212
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
213
|
+
try {
|
|
214
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
215
|
+
const message = createBaseAllJobsRequest();
|
|
216
|
+
while (reader.pos < end) {
|
|
217
|
+
const tag = reader.uint32();
|
|
218
|
+
switch (tag >>> 3) {
|
|
219
|
+
case 1: {
|
|
220
|
+
if (tag !== 10) {
|
|
221
|
+
break;
|
|
222
|
+
}
|
|
223
|
+
message.EventStore = reader.string();
|
|
224
|
+
continue;
|
|
225
|
+
}
|
|
226
|
+
case 2: {
|
|
227
|
+
if (tag !== 18) {
|
|
228
|
+
break;
|
|
229
|
+
}
|
|
230
|
+
message.Namespace = reader.string();
|
|
231
|
+
continue;
|
|
232
|
+
}
|
|
233
|
+
}
|
|
234
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
235
|
+
break;
|
|
236
|
+
}
|
|
237
|
+
reader.skip(tag & 7);
|
|
230
238
|
}
|
|
231
|
-
|
|
239
|
+
return message;
|
|
240
|
+
}
|
|
241
|
+
finally {
|
|
242
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
232
243
|
}
|
|
233
|
-
return message;
|
|
234
244
|
},
|
|
235
245
|
fromJSON(object) {
|
|
236
246
|
return {
|
|
@@ -292,60 +302,70 @@ export const CommandResult = {
|
|
|
292
302
|
},
|
|
293
303
|
decode(input, length) {
|
|
294
304
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
295
|
-
const
|
|
296
|
-
|
|
297
|
-
|
|
298
|
-
|
|
299
|
-
|
|
300
|
-
|
|
301
|
-
|
|
302
|
-
|
|
303
|
-
|
|
304
|
-
|
|
305
|
-
|
|
306
|
-
|
|
307
|
-
|
|
308
|
-
|
|
309
|
-
|
|
310
|
-
|
|
311
|
-
|
|
312
|
-
|
|
313
|
-
|
|
314
|
-
|
|
315
|
-
|
|
316
|
-
|
|
317
|
-
|
|
318
|
-
|
|
319
|
-
|
|
320
|
-
|
|
321
|
-
|
|
322
|
-
|
|
323
|
-
|
|
324
|
-
|
|
325
|
-
|
|
326
|
-
|
|
327
|
-
|
|
328
|
-
|
|
329
|
-
|
|
330
|
-
|
|
331
|
-
|
|
332
|
-
|
|
333
|
-
|
|
334
|
-
|
|
335
|
-
|
|
336
|
-
|
|
337
|
-
|
|
338
|
-
|
|
339
|
-
|
|
340
|
-
|
|
341
|
-
|
|
342
|
-
|
|
343
|
-
|
|
344
|
-
|
|
305
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
306
|
+
if (previousRecursionDepth >= 100) {
|
|
307
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
308
|
+
}
|
|
309
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
310
|
+
try {
|
|
311
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
312
|
+
const message = createBaseCommandResult();
|
|
313
|
+
while (reader.pos < end) {
|
|
314
|
+
const tag = reader.uint32();
|
|
315
|
+
switch (tag >>> 3) {
|
|
316
|
+
case 1: {
|
|
317
|
+
if (tag !== 10) {
|
|
318
|
+
break;
|
|
319
|
+
}
|
|
320
|
+
message.CorrelationId = Guid.decode(reader, reader.uint32());
|
|
321
|
+
continue;
|
|
322
|
+
}
|
|
323
|
+
case 2: {
|
|
324
|
+
if (tag !== 16) {
|
|
325
|
+
break;
|
|
326
|
+
}
|
|
327
|
+
message.IsAuthorized = reader.bool();
|
|
328
|
+
continue;
|
|
329
|
+
}
|
|
330
|
+
case 3: {
|
|
331
|
+
if (tag !== 26) {
|
|
332
|
+
break;
|
|
333
|
+
}
|
|
334
|
+
message.ValidationResults.push(ValidationResult.decode(reader, reader.uint32()));
|
|
335
|
+
continue;
|
|
336
|
+
}
|
|
337
|
+
case 4: {
|
|
338
|
+
if (tag !== 34) {
|
|
339
|
+
break;
|
|
340
|
+
}
|
|
341
|
+
message.ExceptionMessages.push(reader.string());
|
|
342
|
+
continue;
|
|
343
|
+
}
|
|
344
|
+
case 5: {
|
|
345
|
+
if (tag !== 42) {
|
|
346
|
+
break;
|
|
347
|
+
}
|
|
348
|
+
message.ExceptionStackTrace = reader.string();
|
|
349
|
+
continue;
|
|
350
|
+
}
|
|
351
|
+
case 6: {
|
|
352
|
+
if (tag !== 50) {
|
|
353
|
+
break;
|
|
354
|
+
}
|
|
355
|
+
message.AuthorizationFailureReason = reader.string();
|
|
356
|
+
continue;
|
|
357
|
+
}
|
|
358
|
+
}
|
|
359
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
360
|
+
break;
|
|
361
|
+
}
|
|
362
|
+
reader.skip(tag & 7);
|
|
345
363
|
}
|
|
346
|
-
|
|
364
|
+
return message;
|
|
365
|
+
}
|
|
366
|
+
finally {
|
|
367
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
347
368
|
}
|
|
348
|
-
return message;
|
|
349
369
|
},
|
|
350
370
|
fromJSON(object) {
|
|
351
371
|
return {
|
|
@@ -410,18 +430,28 @@ export const DateTimeOffset = {
|
|
|
410
430
|
},
|
|
411
431
|
decode(input, length) {
|
|
412
432
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
413
|
-
const
|
|
414
|
-
|
|
415
|
-
|
|
416
|
-
|
|
417
|
-
|
|
433
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
434
|
+
if (previousRecursionDepth >= 100) {
|
|
435
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
436
|
+
}
|
|
437
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
438
|
+
try {
|
|
439
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
440
|
+
const message = createBaseDateTimeOffset();
|
|
441
|
+
while (reader.pos < end) {
|
|
442
|
+
const tag = reader.uint32();
|
|
443
|
+
switch (tag >>> 3) {
|
|
444
|
+
}
|
|
445
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
446
|
+
break;
|
|
447
|
+
}
|
|
448
|
+
reader.skip(tag & 7);
|
|
418
449
|
}
|
|
419
|
-
|
|
420
|
-
|
|
421
|
-
|
|
422
|
-
reader.
|
|
450
|
+
return message;
|
|
451
|
+
}
|
|
452
|
+
finally {
|
|
453
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
423
454
|
}
|
|
424
|
-
return message;
|
|
425
455
|
},
|
|
426
456
|
fromJSON(_) {
|
|
427
457
|
return {};
|
|
@@ -456,39 +486,49 @@ export const DeleteJobRequest = {
|
|
|
456
486
|
},
|
|
457
487
|
decode(input, length) {
|
|
458
488
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
459
|
-
const
|
|
460
|
-
|
|
461
|
-
|
|
462
|
-
|
|
463
|
-
|
|
464
|
-
|
|
465
|
-
|
|
466
|
-
|
|
467
|
-
|
|
468
|
-
|
|
469
|
-
|
|
470
|
-
|
|
471
|
-
|
|
472
|
-
|
|
473
|
-
|
|
474
|
-
|
|
475
|
-
|
|
476
|
-
|
|
477
|
-
|
|
478
|
-
|
|
479
|
-
|
|
480
|
-
|
|
481
|
-
|
|
482
|
-
|
|
483
|
-
|
|
484
|
-
|
|
489
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
490
|
+
if (previousRecursionDepth >= 100) {
|
|
491
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
492
|
+
}
|
|
493
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
494
|
+
try {
|
|
495
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
496
|
+
const message = createBaseDeleteJobRequest();
|
|
497
|
+
while (reader.pos < end) {
|
|
498
|
+
const tag = reader.uint32();
|
|
499
|
+
switch (tag >>> 3) {
|
|
500
|
+
case 1: {
|
|
501
|
+
if (tag !== 10) {
|
|
502
|
+
break;
|
|
503
|
+
}
|
|
504
|
+
message.EventStore = reader.string();
|
|
505
|
+
continue;
|
|
506
|
+
}
|
|
507
|
+
case 2: {
|
|
508
|
+
if (tag !== 18) {
|
|
509
|
+
break;
|
|
510
|
+
}
|
|
511
|
+
message.Namespace = reader.string();
|
|
512
|
+
continue;
|
|
513
|
+
}
|
|
514
|
+
case 3: {
|
|
515
|
+
if (tag !== 26) {
|
|
516
|
+
break;
|
|
517
|
+
}
|
|
518
|
+
message.JobId = Guid.decode(reader, reader.uint32());
|
|
519
|
+
continue;
|
|
520
|
+
}
|
|
521
|
+
}
|
|
522
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
523
|
+
break;
|
|
524
|
+
}
|
|
525
|
+
reader.skip(tag & 7);
|
|
485
526
|
}
|
|
486
|
-
|
|
487
|
-
|
|
488
|
-
|
|
489
|
-
reader.
|
|
527
|
+
return message;
|
|
528
|
+
}
|
|
529
|
+
finally {
|
|
530
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
490
531
|
}
|
|
491
|
-
return message;
|
|
492
532
|
},
|
|
493
533
|
fromJSON(object) {
|
|
494
534
|
return {
|
|
@@ -539,39 +579,49 @@ export const GetJobStepsRequest = {
|
|
|
539
579
|
},
|
|
540
580
|
decode(input, length) {
|
|
541
581
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
542
|
-
const
|
|
543
|
-
|
|
544
|
-
|
|
545
|
-
|
|
546
|
-
|
|
547
|
-
|
|
548
|
-
|
|
549
|
-
|
|
550
|
-
|
|
551
|
-
|
|
552
|
-
|
|
553
|
-
|
|
554
|
-
|
|
555
|
-
|
|
556
|
-
|
|
557
|
-
|
|
558
|
-
|
|
559
|
-
|
|
560
|
-
|
|
561
|
-
|
|
562
|
-
|
|
563
|
-
|
|
564
|
-
|
|
565
|
-
|
|
566
|
-
|
|
567
|
-
|
|
582
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
583
|
+
if (previousRecursionDepth >= 100) {
|
|
584
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
585
|
+
}
|
|
586
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
587
|
+
try {
|
|
588
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
589
|
+
const message = createBaseGetJobStepsRequest();
|
|
590
|
+
while (reader.pos < end) {
|
|
591
|
+
const tag = reader.uint32();
|
|
592
|
+
switch (tag >>> 3) {
|
|
593
|
+
case 1: {
|
|
594
|
+
if (tag !== 10) {
|
|
595
|
+
break;
|
|
596
|
+
}
|
|
597
|
+
message.EventStore = reader.string();
|
|
598
|
+
continue;
|
|
599
|
+
}
|
|
600
|
+
case 2: {
|
|
601
|
+
if (tag !== 18) {
|
|
602
|
+
break;
|
|
603
|
+
}
|
|
604
|
+
message.Namespace = reader.string();
|
|
605
|
+
continue;
|
|
606
|
+
}
|
|
607
|
+
case 3: {
|
|
608
|
+
if (tag !== 26) {
|
|
609
|
+
break;
|
|
610
|
+
}
|
|
611
|
+
message.JobId = Guid.decode(reader, reader.uint32());
|
|
612
|
+
continue;
|
|
613
|
+
}
|
|
614
|
+
}
|
|
615
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
616
|
+
break;
|
|
617
|
+
}
|
|
618
|
+
reader.skip(tag & 7);
|
|
568
619
|
}
|
|
569
|
-
|
|
570
|
-
|
|
571
|
-
|
|
572
|
-
reader.
|
|
620
|
+
return message;
|
|
621
|
+
}
|
|
622
|
+
finally {
|
|
623
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
573
624
|
}
|
|
574
|
-
return message;
|
|
575
625
|
},
|
|
576
626
|
fromJSON(object) {
|
|
577
627
|
return {
|
|
@@ -642,67 +692,77 @@ export const JobProgress = {
|
|
|
642
692
|
},
|
|
643
693
|
decode(input, length) {
|
|
644
694
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
645
|
-
const
|
|
646
|
-
|
|
647
|
-
|
|
648
|
-
|
|
649
|
-
|
|
650
|
-
|
|
651
|
-
|
|
652
|
-
|
|
653
|
-
|
|
654
|
-
|
|
655
|
-
|
|
656
|
-
|
|
657
|
-
|
|
658
|
-
|
|
659
|
-
|
|
660
|
-
|
|
661
|
-
|
|
662
|
-
|
|
663
|
-
|
|
664
|
-
|
|
665
|
-
|
|
666
|
-
|
|
667
|
-
|
|
668
|
-
|
|
669
|
-
|
|
670
|
-
|
|
671
|
-
|
|
672
|
-
|
|
673
|
-
|
|
674
|
-
|
|
675
|
-
|
|
676
|
-
|
|
677
|
-
|
|
678
|
-
|
|
679
|
-
|
|
680
|
-
|
|
681
|
-
|
|
682
|
-
|
|
683
|
-
|
|
684
|
-
|
|
685
|
-
|
|
686
|
-
|
|
687
|
-
|
|
688
|
-
|
|
689
|
-
|
|
690
|
-
|
|
691
|
-
|
|
692
|
-
|
|
693
|
-
|
|
694
|
-
|
|
695
|
-
|
|
696
|
-
|
|
697
|
-
|
|
698
|
-
|
|
695
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
696
|
+
if (previousRecursionDepth >= 100) {
|
|
697
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
698
|
+
}
|
|
699
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
700
|
+
try {
|
|
701
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
702
|
+
const message = createBaseJobProgress();
|
|
703
|
+
while (reader.pos < end) {
|
|
704
|
+
const tag = reader.uint32();
|
|
705
|
+
switch (tag >>> 3) {
|
|
706
|
+
case 1: {
|
|
707
|
+
if (tag !== 8) {
|
|
708
|
+
break;
|
|
709
|
+
}
|
|
710
|
+
message.TotalSteps = reader.int32();
|
|
711
|
+
continue;
|
|
712
|
+
}
|
|
713
|
+
case 2: {
|
|
714
|
+
if (tag !== 16) {
|
|
715
|
+
break;
|
|
716
|
+
}
|
|
717
|
+
message.SuccessfulSteps = reader.int32();
|
|
718
|
+
continue;
|
|
719
|
+
}
|
|
720
|
+
case 3: {
|
|
721
|
+
if (tag !== 24) {
|
|
722
|
+
break;
|
|
723
|
+
}
|
|
724
|
+
message.FailedSteps = reader.int32();
|
|
725
|
+
continue;
|
|
726
|
+
}
|
|
727
|
+
case 4: {
|
|
728
|
+
if (tag !== 32) {
|
|
729
|
+
break;
|
|
730
|
+
}
|
|
731
|
+
message.StoppedSteps = reader.int32();
|
|
732
|
+
continue;
|
|
733
|
+
}
|
|
734
|
+
case 5: {
|
|
735
|
+
if (tag !== 40) {
|
|
736
|
+
break;
|
|
737
|
+
}
|
|
738
|
+
message.IsCompleted = reader.bool();
|
|
739
|
+
continue;
|
|
740
|
+
}
|
|
741
|
+
case 6: {
|
|
742
|
+
if (tag !== 48) {
|
|
743
|
+
break;
|
|
744
|
+
}
|
|
745
|
+
message.IsStopped = reader.bool();
|
|
746
|
+
continue;
|
|
747
|
+
}
|
|
748
|
+
case 7: {
|
|
749
|
+
if (tag !== 58) {
|
|
750
|
+
break;
|
|
751
|
+
}
|
|
752
|
+
message.Message = reader.string();
|
|
753
|
+
continue;
|
|
754
|
+
}
|
|
755
|
+
}
|
|
756
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
757
|
+
break;
|
|
758
|
+
}
|
|
759
|
+
reader.skip(tag & 7);
|
|
699
760
|
}
|
|
700
|
-
|
|
701
|
-
|
|
702
|
-
|
|
703
|
-
reader.
|
|
761
|
+
return message;
|
|
762
|
+
}
|
|
763
|
+
finally {
|
|
764
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
704
765
|
}
|
|
705
|
-
return message;
|
|
706
766
|
},
|
|
707
767
|
fromJSON(object) {
|
|
708
768
|
return {
|
|
@@ -776,46 +836,56 @@ export const JobStatusChanged = {
|
|
|
776
836
|
},
|
|
777
837
|
decode(input, length) {
|
|
778
838
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
779
|
-
const
|
|
780
|
-
|
|
781
|
-
|
|
782
|
-
|
|
783
|
-
|
|
784
|
-
|
|
785
|
-
|
|
786
|
-
|
|
787
|
-
|
|
788
|
-
|
|
789
|
-
|
|
790
|
-
|
|
791
|
-
|
|
792
|
-
|
|
793
|
-
|
|
794
|
-
|
|
795
|
-
|
|
796
|
-
|
|
797
|
-
|
|
798
|
-
|
|
799
|
-
|
|
800
|
-
|
|
801
|
-
|
|
802
|
-
|
|
803
|
-
|
|
804
|
-
|
|
805
|
-
|
|
806
|
-
|
|
807
|
-
|
|
808
|
-
|
|
809
|
-
|
|
810
|
-
|
|
811
|
-
|
|
839
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
840
|
+
if (previousRecursionDepth >= 100) {
|
|
841
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
842
|
+
}
|
|
843
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
844
|
+
try {
|
|
845
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
846
|
+
const message = createBaseJobStatusChanged();
|
|
847
|
+
while (reader.pos < end) {
|
|
848
|
+
const tag = reader.uint32();
|
|
849
|
+
switch (tag >>> 3) {
|
|
850
|
+
case 1: {
|
|
851
|
+
if (tag !== 8) {
|
|
852
|
+
break;
|
|
853
|
+
}
|
|
854
|
+
message.Status = reader.int32();
|
|
855
|
+
continue;
|
|
856
|
+
}
|
|
857
|
+
case 2: {
|
|
858
|
+
if (tag !== 18) {
|
|
859
|
+
break;
|
|
860
|
+
}
|
|
861
|
+
message.Occurred = SerializableDateTimeOffset.decode(reader, reader.uint32());
|
|
862
|
+
continue;
|
|
863
|
+
}
|
|
864
|
+
case 3: {
|
|
865
|
+
if (tag !== 26) {
|
|
866
|
+
break;
|
|
867
|
+
}
|
|
868
|
+
message.ExceptionMessages.push(reader.string());
|
|
869
|
+
continue;
|
|
870
|
+
}
|
|
871
|
+
case 4: {
|
|
872
|
+
if (tag !== 34) {
|
|
873
|
+
break;
|
|
874
|
+
}
|
|
875
|
+
message.ExceptionStackTrace = reader.string();
|
|
876
|
+
continue;
|
|
877
|
+
}
|
|
878
|
+
}
|
|
879
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
880
|
+
break;
|
|
881
|
+
}
|
|
882
|
+
reader.skip(tag & 7);
|
|
812
883
|
}
|
|
813
|
-
|
|
814
|
-
|
|
815
|
-
|
|
816
|
-
reader.
|
|
884
|
+
return message;
|
|
885
|
+
}
|
|
886
|
+
finally {
|
|
887
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
817
888
|
}
|
|
818
|
-
return message;
|
|
819
889
|
},
|
|
820
890
|
fromJSON(object) {
|
|
821
891
|
return {
|
|
@@ -872,32 +942,42 @@ export const JobStepProgress = {
|
|
|
872
942
|
},
|
|
873
943
|
decode(input, length) {
|
|
874
944
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
875
|
-
const
|
|
876
|
-
|
|
877
|
-
|
|
878
|
-
|
|
879
|
-
|
|
880
|
-
|
|
881
|
-
|
|
882
|
-
|
|
883
|
-
|
|
884
|
-
|
|
885
|
-
|
|
886
|
-
|
|
887
|
-
|
|
888
|
-
|
|
889
|
-
|
|
890
|
-
|
|
891
|
-
|
|
892
|
-
|
|
893
|
-
|
|
894
|
-
|
|
895
|
-
|
|
896
|
-
|
|
945
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
946
|
+
if (previousRecursionDepth >= 100) {
|
|
947
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
948
|
+
}
|
|
949
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
950
|
+
try {
|
|
951
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
952
|
+
const message = createBaseJobStepProgress();
|
|
953
|
+
while (reader.pos < end) {
|
|
954
|
+
const tag = reader.uint32();
|
|
955
|
+
switch (tag >>> 3) {
|
|
956
|
+
case 1: {
|
|
957
|
+
if (tag !== 8) {
|
|
958
|
+
break;
|
|
959
|
+
}
|
|
960
|
+
message.Percentage = reader.int32();
|
|
961
|
+
continue;
|
|
962
|
+
}
|
|
963
|
+
case 2: {
|
|
964
|
+
if (tag !== 18) {
|
|
965
|
+
break;
|
|
966
|
+
}
|
|
967
|
+
message.Message = reader.string();
|
|
968
|
+
continue;
|
|
969
|
+
}
|
|
970
|
+
}
|
|
971
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
972
|
+
break;
|
|
973
|
+
}
|
|
974
|
+
reader.skip(tag & 7);
|
|
897
975
|
}
|
|
898
|
-
|
|
976
|
+
return message;
|
|
977
|
+
}
|
|
978
|
+
finally {
|
|
979
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
899
980
|
}
|
|
900
|
-
return message;
|
|
901
981
|
},
|
|
902
982
|
fromJSON(object) {
|
|
903
983
|
return {
|
|
@@ -946,46 +1026,56 @@ export const JobStepStatusChanged = {
|
|
|
946
1026
|
},
|
|
947
1027
|
decode(input, length) {
|
|
948
1028
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
949
|
-
const
|
|
950
|
-
|
|
951
|
-
|
|
952
|
-
|
|
953
|
-
|
|
954
|
-
|
|
955
|
-
|
|
956
|
-
|
|
957
|
-
|
|
958
|
-
|
|
959
|
-
|
|
960
|
-
|
|
961
|
-
|
|
962
|
-
|
|
963
|
-
|
|
964
|
-
|
|
965
|
-
|
|
966
|
-
|
|
967
|
-
|
|
968
|
-
|
|
969
|
-
|
|
970
|
-
|
|
971
|
-
|
|
972
|
-
|
|
973
|
-
|
|
974
|
-
|
|
975
|
-
|
|
976
|
-
|
|
977
|
-
|
|
978
|
-
|
|
979
|
-
|
|
980
|
-
|
|
981
|
-
|
|
1029
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1030
|
+
if (previousRecursionDepth >= 100) {
|
|
1031
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1032
|
+
}
|
|
1033
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1034
|
+
try {
|
|
1035
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1036
|
+
const message = createBaseJobStepStatusChanged();
|
|
1037
|
+
while (reader.pos < end) {
|
|
1038
|
+
const tag = reader.uint32();
|
|
1039
|
+
switch (tag >>> 3) {
|
|
1040
|
+
case 1: {
|
|
1041
|
+
if (tag !== 8) {
|
|
1042
|
+
break;
|
|
1043
|
+
}
|
|
1044
|
+
message.Status = reader.int32();
|
|
1045
|
+
continue;
|
|
1046
|
+
}
|
|
1047
|
+
case 2: {
|
|
1048
|
+
if (tag !== 18) {
|
|
1049
|
+
break;
|
|
1050
|
+
}
|
|
1051
|
+
message.Occurred = SerializableDateTimeOffset.decode(reader, reader.uint32());
|
|
1052
|
+
continue;
|
|
1053
|
+
}
|
|
1054
|
+
case 3: {
|
|
1055
|
+
if (tag !== 26) {
|
|
1056
|
+
break;
|
|
1057
|
+
}
|
|
1058
|
+
message.ExceptionMessages.push(reader.string());
|
|
1059
|
+
continue;
|
|
1060
|
+
}
|
|
1061
|
+
case 4: {
|
|
1062
|
+
if (tag !== 34) {
|
|
1063
|
+
break;
|
|
1064
|
+
}
|
|
1065
|
+
message.ExceptionStackTrace = reader.string();
|
|
1066
|
+
continue;
|
|
1067
|
+
}
|
|
1068
|
+
}
|
|
1069
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1070
|
+
break;
|
|
1071
|
+
}
|
|
1072
|
+
reader.skip(tag & 7);
|
|
982
1073
|
}
|
|
983
|
-
|
|
984
|
-
|
|
985
|
-
|
|
986
|
-
reader.
|
|
1074
|
+
return message;
|
|
1075
|
+
}
|
|
1076
|
+
finally {
|
|
1077
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
987
1078
|
}
|
|
988
|
-
return message;
|
|
989
1079
|
},
|
|
990
1080
|
fromJSON(object) {
|
|
991
1081
|
return {
|
|
@@ -1054,60 +1144,70 @@ export const JobStepSummaryResponse = {
|
|
|
1054
1144
|
},
|
|
1055
1145
|
decode(input, length) {
|
|
1056
1146
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1057
|
-
const
|
|
1058
|
-
|
|
1059
|
-
|
|
1060
|
-
|
|
1061
|
-
|
|
1062
|
-
|
|
1063
|
-
|
|
1064
|
-
|
|
1065
|
-
|
|
1066
|
-
|
|
1067
|
-
|
|
1068
|
-
|
|
1069
|
-
|
|
1070
|
-
|
|
1071
|
-
|
|
1072
|
-
|
|
1073
|
-
|
|
1074
|
-
|
|
1075
|
-
|
|
1076
|
-
|
|
1077
|
-
|
|
1078
|
-
|
|
1079
|
-
|
|
1080
|
-
|
|
1081
|
-
|
|
1082
|
-
|
|
1083
|
-
|
|
1084
|
-
|
|
1085
|
-
|
|
1086
|
-
|
|
1087
|
-
|
|
1088
|
-
|
|
1089
|
-
|
|
1090
|
-
|
|
1091
|
-
|
|
1092
|
-
|
|
1093
|
-
|
|
1094
|
-
|
|
1095
|
-
|
|
1096
|
-
|
|
1097
|
-
|
|
1098
|
-
|
|
1099
|
-
|
|
1100
|
-
|
|
1101
|
-
|
|
1102
|
-
|
|
1103
|
-
|
|
1104
|
-
|
|
1105
|
-
|
|
1106
|
-
|
|
1147
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1148
|
+
if (previousRecursionDepth >= 100) {
|
|
1149
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1150
|
+
}
|
|
1151
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1152
|
+
try {
|
|
1153
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1154
|
+
const message = createBaseJobStepSummaryResponse();
|
|
1155
|
+
while (reader.pos < end) {
|
|
1156
|
+
const tag = reader.uint32();
|
|
1157
|
+
switch (tag >>> 3) {
|
|
1158
|
+
case 1: {
|
|
1159
|
+
if (tag !== 10) {
|
|
1160
|
+
break;
|
|
1161
|
+
}
|
|
1162
|
+
message.Id = Guid.decode(reader, reader.uint32());
|
|
1163
|
+
continue;
|
|
1164
|
+
}
|
|
1165
|
+
case 2: {
|
|
1166
|
+
if (tag !== 18) {
|
|
1167
|
+
break;
|
|
1168
|
+
}
|
|
1169
|
+
message.Type = reader.string();
|
|
1170
|
+
continue;
|
|
1171
|
+
}
|
|
1172
|
+
case 3: {
|
|
1173
|
+
if (tag !== 26) {
|
|
1174
|
+
break;
|
|
1175
|
+
}
|
|
1176
|
+
message.Name = reader.string();
|
|
1177
|
+
continue;
|
|
1178
|
+
}
|
|
1179
|
+
case 4: {
|
|
1180
|
+
if (tag !== 32) {
|
|
1181
|
+
break;
|
|
1182
|
+
}
|
|
1183
|
+
message.Status = reader.int32();
|
|
1184
|
+
continue;
|
|
1185
|
+
}
|
|
1186
|
+
case 5: {
|
|
1187
|
+
if (tag !== 42) {
|
|
1188
|
+
break;
|
|
1189
|
+
}
|
|
1190
|
+
message.StatusChanges.push(JobStepStatusChanged.decode(reader, reader.uint32()));
|
|
1191
|
+
continue;
|
|
1192
|
+
}
|
|
1193
|
+
case 6: {
|
|
1194
|
+
if (tag !== 50) {
|
|
1195
|
+
break;
|
|
1196
|
+
}
|
|
1197
|
+
message.Progress = JobStepProgress.decode(reader, reader.uint32());
|
|
1198
|
+
continue;
|
|
1199
|
+
}
|
|
1200
|
+
}
|
|
1201
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1202
|
+
break;
|
|
1203
|
+
}
|
|
1204
|
+
reader.skip(tag & 7);
|
|
1107
1205
|
}
|
|
1108
|
-
|
|
1206
|
+
return message;
|
|
1207
|
+
}
|
|
1208
|
+
finally {
|
|
1209
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1109
1210
|
}
|
|
1110
|
-
return message;
|
|
1111
1211
|
},
|
|
1112
1212
|
fromJSON(object) {
|
|
1113
1213
|
return {
|
|
@@ -1197,67 +1297,77 @@ export const JobSummaryResponse = {
|
|
|
1197
1297
|
},
|
|
1198
1298
|
decode(input, length) {
|
|
1199
1299
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1200
|
-
const
|
|
1201
|
-
|
|
1202
|
-
|
|
1203
|
-
|
|
1204
|
-
|
|
1205
|
-
|
|
1206
|
-
|
|
1207
|
-
|
|
1208
|
-
|
|
1209
|
-
|
|
1210
|
-
|
|
1211
|
-
|
|
1212
|
-
|
|
1213
|
-
|
|
1214
|
-
|
|
1215
|
-
|
|
1216
|
-
|
|
1217
|
-
|
|
1218
|
-
|
|
1219
|
-
|
|
1220
|
-
|
|
1221
|
-
|
|
1222
|
-
|
|
1223
|
-
|
|
1224
|
-
|
|
1225
|
-
|
|
1226
|
-
|
|
1227
|
-
|
|
1228
|
-
|
|
1229
|
-
|
|
1230
|
-
|
|
1231
|
-
|
|
1232
|
-
|
|
1233
|
-
|
|
1234
|
-
|
|
1235
|
-
|
|
1236
|
-
|
|
1237
|
-
|
|
1238
|
-
|
|
1239
|
-
|
|
1240
|
-
|
|
1241
|
-
|
|
1242
|
-
|
|
1243
|
-
|
|
1244
|
-
|
|
1245
|
-
|
|
1246
|
-
|
|
1247
|
-
|
|
1248
|
-
|
|
1249
|
-
|
|
1250
|
-
|
|
1251
|
-
|
|
1252
|
-
|
|
1253
|
-
|
|
1254
|
-
|
|
1255
|
-
|
|
1256
|
-
|
|
1300
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1301
|
+
if (previousRecursionDepth >= 100) {
|
|
1302
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1303
|
+
}
|
|
1304
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1305
|
+
try {
|
|
1306
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1307
|
+
const message = createBaseJobSummaryResponse();
|
|
1308
|
+
while (reader.pos < end) {
|
|
1309
|
+
const tag = reader.uint32();
|
|
1310
|
+
switch (tag >>> 3) {
|
|
1311
|
+
case 1: {
|
|
1312
|
+
if (tag !== 10) {
|
|
1313
|
+
break;
|
|
1314
|
+
}
|
|
1315
|
+
message.Id = Guid.decode(reader, reader.uint32());
|
|
1316
|
+
continue;
|
|
1317
|
+
}
|
|
1318
|
+
case 2: {
|
|
1319
|
+
if (tag !== 18) {
|
|
1320
|
+
break;
|
|
1321
|
+
}
|
|
1322
|
+
message.Details = reader.string();
|
|
1323
|
+
continue;
|
|
1324
|
+
}
|
|
1325
|
+
case 3: {
|
|
1326
|
+
if (tag !== 26) {
|
|
1327
|
+
break;
|
|
1328
|
+
}
|
|
1329
|
+
message.Type = reader.string();
|
|
1330
|
+
continue;
|
|
1331
|
+
}
|
|
1332
|
+
case 4: {
|
|
1333
|
+
if (tag !== 32) {
|
|
1334
|
+
break;
|
|
1335
|
+
}
|
|
1336
|
+
message.Status = reader.int32();
|
|
1337
|
+
continue;
|
|
1338
|
+
}
|
|
1339
|
+
case 5: {
|
|
1340
|
+
if (tag !== 42) {
|
|
1341
|
+
break;
|
|
1342
|
+
}
|
|
1343
|
+
message.Created = DateTimeOffset.decode(reader, reader.uint32());
|
|
1344
|
+
continue;
|
|
1345
|
+
}
|
|
1346
|
+
case 6: {
|
|
1347
|
+
if (tag !== 50) {
|
|
1348
|
+
break;
|
|
1349
|
+
}
|
|
1350
|
+
message.StatusChanges.push(JobStatusChanged.decode(reader, reader.uint32()));
|
|
1351
|
+
continue;
|
|
1352
|
+
}
|
|
1353
|
+
case 7: {
|
|
1354
|
+
if (tag !== 58) {
|
|
1355
|
+
break;
|
|
1356
|
+
}
|
|
1357
|
+
message.Progress = JobProgress.decode(reader, reader.uint32());
|
|
1358
|
+
continue;
|
|
1359
|
+
}
|
|
1360
|
+
}
|
|
1361
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1362
|
+
break;
|
|
1363
|
+
}
|
|
1364
|
+
reader.skip(tag & 7);
|
|
1257
1365
|
}
|
|
1258
|
-
|
|
1366
|
+
return message;
|
|
1367
|
+
}
|
|
1368
|
+
finally {
|
|
1369
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1259
1370
|
}
|
|
1260
|
-
return message;
|
|
1261
1371
|
},
|
|
1262
1372
|
fromJSON(object) {
|
|
1263
1373
|
return {
|
|
@@ -1350,60 +1460,70 @@ export const QueryResultIEnumerableJobStepSummaryResponse = {
|
|
|
1350
1460
|
},
|
|
1351
1461
|
decode(input, length) {
|
|
1352
1462
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1353
|
-
const
|
|
1354
|
-
|
|
1355
|
-
|
|
1356
|
-
|
|
1357
|
-
|
|
1358
|
-
|
|
1359
|
-
|
|
1360
|
-
|
|
1361
|
-
|
|
1362
|
-
|
|
1363
|
-
|
|
1364
|
-
|
|
1365
|
-
|
|
1366
|
-
|
|
1367
|
-
|
|
1368
|
-
|
|
1369
|
-
|
|
1370
|
-
|
|
1371
|
-
|
|
1372
|
-
|
|
1373
|
-
|
|
1374
|
-
|
|
1375
|
-
|
|
1376
|
-
|
|
1377
|
-
|
|
1378
|
-
|
|
1379
|
-
|
|
1380
|
-
|
|
1381
|
-
|
|
1382
|
-
|
|
1383
|
-
|
|
1384
|
-
|
|
1385
|
-
|
|
1386
|
-
|
|
1387
|
-
|
|
1388
|
-
|
|
1389
|
-
|
|
1390
|
-
|
|
1391
|
-
|
|
1392
|
-
|
|
1393
|
-
|
|
1394
|
-
|
|
1395
|
-
|
|
1396
|
-
|
|
1397
|
-
|
|
1398
|
-
|
|
1399
|
-
|
|
1400
|
-
|
|
1401
|
-
|
|
1402
|
-
|
|
1463
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1464
|
+
if (previousRecursionDepth >= 100) {
|
|
1465
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1466
|
+
}
|
|
1467
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1468
|
+
try {
|
|
1469
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1470
|
+
const message = createBaseQueryResultIEnumerableJobStepSummaryResponse();
|
|
1471
|
+
while (reader.pos < end) {
|
|
1472
|
+
const tag = reader.uint32();
|
|
1473
|
+
switch (tag >>> 3) {
|
|
1474
|
+
case 1: {
|
|
1475
|
+
if (tag !== 10) {
|
|
1476
|
+
break;
|
|
1477
|
+
}
|
|
1478
|
+
message.CorrelationId = Guid.decode(reader, reader.uint32());
|
|
1479
|
+
continue;
|
|
1480
|
+
}
|
|
1481
|
+
case 2: {
|
|
1482
|
+
if (tag !== 16) {
|
|
1483
|
+
break;
|
|
1484
|
+
}
|
|
1485
|
+
message.IsAuthorized = reader.bool();
|
|
1486
|
+
continue;
|
|
1487
|
+
}
|
|
1488
|
+
case 3: {
|
|
1489
|
+
if (tag !== 26) {
|
|
1490
|
+
break;
|
|
1491
|
+
}
|
|
1492
|
+
message.ValidationResults.push(ValidationResult.decode(reader, reader.uint32()));
|
|
1493
|
+
continue;
|
|
1494
|
+
}
|
|
1495
|
+
case 4: {
|
|
1496
|
+
if (tag !== 34) {
|
|
1497
|
+
break;
|
|
1498
|
+
}
|
|
1499
|
+
message.ExceptionMessages.push(reader.string());
|
|
1500
|
+
continue;
|
|
1501
|
+
}
|
|
1502
|
+
case 5: {
|
|
1503
|
+
if (tag !== 42) {
|
|
1504
|
+
break;
|
|
1505
|
+
}
|
|
1506
|
+
message.ExceptionStackTrace = reader.string();
|
|
1507
|
+
continue;
|
|
1508
|
+
}
|
|
1509
|
+
case 6: {
|
|
1510
|
+
if (tag !== 50) {
|
|
1511
|
+
break;
|
|
1512
|
+
}
|
|
1513
|
+
message.Data.push(JobStepSummaryResponse.decode(reader, reader.uint32()));
|
|
1514
|
+
continue;
|
|
1515
|
+
}
|
|
1516
|
+
}
|
|
1517
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1518
|
+
break;
|
|
1519
|
+
}
|
|
1520
|
+
reader.skip(tag & 7);
|
|
1403
1521
|
}
|
|
1404
|
-
|
|
1522
|
+
return message;
|
|
1523
|
+
}
|
|
1524
|
+
finally {
|
|
1525
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1405
1526
|
}
|
|
1406
|
-
return message;
|
|
1407
1527
|
},
|
|
1408
1528
|
fromJSON(object) {
|
|
1409
1529
|
return {
|
|
@@ -1493,60 +1613,70 @@ export const QueryResultIEnumerableJobSummaryResponse = {
|
|
|
1493
1613
|
},
|
|
1494
1614
|
decode(input, length) {
|
|
1495
1615
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1496
|
-
const
|
|
1497
|
-
|
|
1498
|
-
|
|
1499
|
-
|
|
1500
|
-
|
|
1501
|
-
|
|
1502
|
-
|
|
1503
|
-
|
|
1504
|
-
|
|
1505
|
-
|
|
1506
|
-
|
|
1507
|
-
|
|
1508
|
-
|
|
1509
|
-
|
|
1510
|
-
|
|
1511
|
-
|
|
1512
|
-
|
|
1513
|
-
|
|
1514
|
-
|
|
1515
|
-
|
|
1516
|
-
|
|
1517
|
-
|
|
1518
|
-
|
|
1519
|
-
|
|
1520
|
-
|
|
1521
|
-
|
|
1522
|
-
|
|
1523
|
-
|
|
1524
|
-
|
|
1525
|
-
|
|
1526
|
-
|
|
1527
|
-
|
|
1528
|
-
|
|
1529
|
-
|
|
1530
|
-
|
|
1531
|
-
|
|
1532
|
-
|
|
1533
|
-
|
|
1534
|
-
|
|
1535
|
-
|
|
1536
|
-
|
|
1537
|
-
|
|
1538
|
-
|
|
1539
|
-
|
|
1540
|
-
|
|
1541
|
-
|
|
1542
|
-
|
|
1543
|
-
|
|
1544
|
-
|
|
1545
|
-
|
|
1616
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1617
|
+
if (previousRecursionDepth >= 100) {
|
|
1618
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1619
|
+
}
|
|
1620
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1621
|
+
try {
|
|
1622
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1623
|
+
const message = createBaseQueryResultIEnumerableJobSummaryResponse();
|
|
1624
|
+
while (reader.pos < end) {
|
|
1625
|
+
const tag = reader.uint32();
|
|
1626
|
+
switch (tag >>> 3) {
|
|
1627
|
+
case 1: {
|
|
1628
|
+
if (tag !== 10) {
|
|
1629
|
+
break;
|
|
1630
|
+
}
|
|
1631
|
+
message.CorrelationId = Guid.decode(reader, reader.uint32());
|
|
1632
|
+
continue;
|
|
1633
|
+
}
|
|
1634
|
+
case 2: {
|
|
1635
|
+
if (tag !== 16) {
|
|
1636
|
+
break;
|
|
1637
|
+
}
|
|
1638
|
+
message.IsAuthorized = reader.bool();
|
|
1639
|
+
continue;
|
|
1640
|
+
}
|
|
1641
|
+
case 3: {
|
|
1642
|
+
if (tag !== 26) {
|
|
1643
|
+
break;
|
|
1644
|
+
}
|
|
1645
|
+
message.ValidationResults.push(ValidationResult.decode(reader, reader.uint32()));
|
|
1646
|
+
continue;
|
|
1647
|
+
}
|
|
1648
|
+
case 4: {
|
|
1649
|
+
if (tag !== 34) {
|
|
1650
|
+
break;
|
|
1651
|
+
}
|
|
1652
|
+
message.ExceptionMessages.push(reader.string());
|
|
1653
|
+
continue;
|
|
1654
|
+
}
|
|
1655
|
+
case 5: {
|
|
1656
|
+
if (tag !== 42) {
|
|
1657
|
+
break;
|
|
1658
|
+
}
|
|
1659
|
+
message.ExceptionStackTrace = reader.string();
|
|
1660
|
+
continue;
|
|
1661
|
+
}
|
|
1662
|
+
case 6: {
|
|
1663
|
+
if (tag !== 50) {
|
|
1664
|
+
break;
|
|
1665
|
+
}
|
|
1666
|
+
message.Data.push(JobSummaryResponse.decode(reader, reader.uint32()));
|
|
1667
|
+
continue;
|
|
1668
|
+
}
|
|
1669
|
+
}
|
|
1670
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1671
|
+
break;
|
|
1672
|
+
}
|
|
1673
|
+
reader.skip(tag & 7);
|
|
1546
1674
|
}
|
|
1547
|
-
|
|
1675
|
+
return message;
|
|
1676
|
+
}
|
|
1677
|
+
finally {
|
|
1678
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1548
1679
|
}
|
|
1549
|
-
return message;
|
|
1550
1680
|
},
|
|
1551
1681
|
fromJSON(object) {
|
|
1552
1682
|
return {
|
|
@@ -1618,39 +1748,49 @@ export const ResumeJobRequest = {
|
|
|
1618
1748
|
},
|
|
1619
1749
|
decode(input, length) {
|
|
1620
1750
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1621
|
-
const
|
|
1622
|
-
|
|
1623
|
-
|
|
1624
|
-
|
|
1625
|
-
|
|
1626
|
-
|
|
1627
|
-
|
|
1628
|
-
|
|
1629
|
-
|
|
1630
|
-
|
|
1631
|
-
|
|
1632
|
-
|
|
1633
|
-
|
|
1634
|
-
|
|
1635
|
-
|
|
1636
|
-
|
|
1637
|
-
|
|
1638
|
-
|
|
1639
|
-
|
|
1640
|
-
|
|
1641
|
-
|
|
1642
|
-
|
|
1643
|
-
|
|
1644
|
-
|
|
1645
|
-
|
|
1646
|
-
|
|
1647
|
-
|
|
1648
|
-
|
|
1649
|
-
|
|
1751
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1752
|
+
if (previousRecursionDepth >= 100) {
|
|
1753
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1754
|
+
}
|
|
1755
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1756
|
+
try {
|
|
1757
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1758
|
+
const message = createBaseResumeJobRequest();
|
|
1759
|
+
while (reader.pos < end) {
|
|
1760
|
+
const tag = reader.uint32();
|
|
1761
|
+
switch (tag >>> 3) {
|
|
1762
|
+
case 1: {
|
|
1763
|
+
if (tag !== 10) {
|
|
1764
|
+
break;
|
|
1765
|
+
}
|
|
1766
|
+
message.EventStore = reader.string();
|
|
1767
|
+
continue;
|
|
1768
|
+
}
|
|
1769
|
+
case 2: {
|
|
1770
|
+
if (tag !== 18) {
|
|
1771
|
+
break;
|
|
1772
|
+
}
|
|
1773
|
+
message.Namespace = reader.string();
|
|
1774
|
+
continue;
|
|
1775
|
+
}
|
|
1776
|
+
case 3: {
|
|
1777
|
+
if (tag !== 26) {
|
|
1778
|
+
break;
|
|
1779
|
+
}
|
|
1780
|
+
message.JobId = Guid.decode(reader, reader.uint32());
|
|
1781
|
+
continue;
|
|
1782
|
+
}
|
|
1783
|
+
}
|
|
1784
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1785
|
+
break;
|
|
1786
|
+
}
|
|
1787
|
+
reader.skip(tag & 7);
|
|
1650
1788
|
}
|
|
1651
|
-
|
|
1789
|
+
return message;
|
|
1790
|
+
}
|
|
1791
|
+
finally {
|
|
1792
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1652
1793
|
}
|
|
1653
|
-
return message;
|
|
1654
1794
|
},
|
|
1655
1795
|
fromJSON(object) {
|
|
1656
1796
|
return {
|
|
@@ -1695,25 +1835,35 @@ export const SerializableDateTimeOffset = {
|
|
|
1695
1835
|
},
|
|
1696
1836
|
decode(input, length) {
|
|
1697
1837
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1698
|
-
const
|
|
1699
|
-
|
|
1700
|
-
|
|
1701
|
-
|
|
1702
|
-
|
|
1703
|
-
|
|
1704
|
-
|
|
1705
|
-
|
|
1706
|
-
|
|
1707
|
-
|
|
1708
|
-
|
|
1709
|
-
|
|
1710
|
-
|
|
1711
|
-
|
|
1712
|
-
|
|
1838
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1839
|
+
if (previousRecursionDepth >= 100) {
|
|
1840
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1841
|
+
}
|
|
1842
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1843
|
+
try {
|
|
1844
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1845
|
+
const message = createBaseSerializableDateTimeOffset();
|
|
1846
|
+
while (reader.pos < end) {
|
|
1847
|
+
const tag = reader.uint32();
|
|
1848
|
+
switch (tag >>> 3) {
|
|
1849
|
+
case 1: {
|
|
1850
|
+
if (tag !== 10) {
|
|
1851
|
+
break;
|
|
1852
|
+
}
|
|
1853
|
+
message.Value = reader.string();
|
|
1854
|
+
continue;
|
|
1855
|
+
}
|
|
1856
|
+
}
|
|
1857
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1858
|
+
break;
|
|
1859
|
+
}
|
|
1860
|
+
reader.skip(tag & 7);
|
|
1713
1861
|
}
|
|
1714
|
-
|
|
1862
|
+
return message;
|
|
1863
|
+
}
|
|
1864
|
+
finally {
|
|
1865
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1715
1866
|
}
|
|
1716
|
-
return message;
|
|
1717
1867
|
},
|
|
1718
1868
|
fromJSON(object) {
|
|
1719
1869
|
return { Value: isSet(object.Value) ? globalThis.String(object.Value) : "" };
|
|
@@ -1752,39 +1902,49 @@ export const StopJobRequest = {
|
|
|
1752
1902
|
},
|
|
1753
1903
|
decode(input, length) {
|
|
1754
1904
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1755
|
-
const
|
|
1756
|
-
|
|
1757
|
-
|
|
1758
|
-
|
|
1759
|
-
|
|
1760
|
-
|
|
1761
|
-
|
|
1762
|
-
|
|
1763
|
-
|
|
1764
|
-
|
|
1765
|
-
|
|
1766
|
-
|
|
1767
|
-
|
|
1768
|
-
|
|
1769
|
-
|
|
1770
|
-
|
|
1771
|
-
|
|
1772
|
-
|
|
1773
|
-
|
|
1774
|
-
|
|
1775
|
-
|
|
1776
|
-
|
|
1777
|
-
|
|
1778
|
-
|
|
1779
|
-
|
|
1780
|
-
|
|
1781
|
-
|
|
1782
|
-
|
|
1783
|
-
|
|
1905
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1906
|
+
if (previousRecursionDepth >= 100) {
|
|
1907
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1908
|
+
}
|
|
1909
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1910
|
+
try {
|
|
1911
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1912
|
+
const message = createBaseStopJobRequest();
|
|
1913
|
+
while (reader.pos < end) {
|
|
1914
|
+
const tag = reader.uint32();
|
|
1915
|
+
switch (tag >>> 3) {
|
|
1916
|
+
case 1: {
|
|
1917
|
+
if (tag !== 10) {
|
|
1918
|
+
break;
|
|
1919
|
+
}
|
|
1920
|
+
message.EventStore = reader.string();
|
|
1921
|
+
continue;
|
|
1922
|
+
}
|
|
1923
|
+
case 2: {
|
|
1924
|
+
if (tag !== 18) {
|
|
1925
|
+
break;
|
|
1926
|
+
}
|
|
1927
|
+
message.Namespace = reader.string();
|
|
1928
|
+
continue;
|
|
1929
|
+
}
|
|
1930
|
+
case 3: {
|
|
1931
|
+
if (tag !== 26) {
|
|
1932
|
+
break;
|
|
1933
|
+
}
|
|
1934
|
+
message.JobId = Guid.decode(reader, reader.uint32());
|
|
1935
|
+
continue;
|
|
1936
|
+
}
|
|
1937
|
+
}
|
|
1938
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1939
|
+
break;
|
|
1940
|
+
}
|
|
1941
|
+
reader.skip(tag & 7);
|
|
1784
1942
|
}
|
|
1785
|
-
|
|
1943
|
+
return message;
|
|
1944
|
+
}
|
|
1945
|
+
finally {
|
|
1946
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1786
1947
|
}
|
|
1787
|
-
return message;
|
|
1788
1948
|
},
|
|
1789
1949
|
fromJSON(object) {
|
|
1790
1950
|
return {
|
|
@@ -1835,39 +1995,49 @@ export const ValidationResult = {
|
|
|
1835
1995
|
},
|
|
1836
1996
|
decode(input, length) {
|
|
1837
1997
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1838
|
-
const
|
|
1839
|
-
|
|
1840
|
-
|
|
1841
|
-
|
|
1842
|
-
|
|
1843
|
-
|
|
1844
|
-
|
|
1845
|
-
|
|
1846
|
-
|
|
1847
|
-
|
|
1848
|
-
|
|
1849
|
-
|
|
1850
|
-
|
|
1851
|
-
|
|
1852
|
-
|
|
1853
|
-
|
|
1854
|
-
|
|
1855
|
-
|
|
1856
|
-
|
|
1857
|
-
|
|
1858
|
-
|
|
1859
|
-
|
|
1860
|
-
|
|
1861
|
-
|
|
1862
|
-
|
|
1863
|
-
|
|
1864
|
-
|
|
1865
|
-
|
|
1866
|
-
|
|
1998
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1999
|
+
if (previousRecursionDepth >= 100) {
|
|
2000
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2001
|
+
}
|
|
2002
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2003
|
+
try {
|
|
2004
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2005
|
+
const message = createBaseValidationResult();
|
|
2006
|
+
while (reader.pos < end) {
|
|
2007
|
+
const tag = reader.uint32();
|
|
2008
|
+
switch (tag >>> 3) {
|
|
2009
|
+
case 1: {
|
|
2010
|
+
if (tag !== 8) {
|
|
2011
|
+
break;
|
|
2012
|
+
}
|
|
2013
|
+
message.Severity = reader.int32();
|
|
2014
|
+
continue;
|
|
2015
|
+
}
|
|
2016
|
+
case 2: {
|
|
2017
|
+
if (tag !== 18) {
|
|
2018
|
+
break;
|
|
2019
|
+
}
|
|
2020
|
+
message.Message = reader.string();
|
|
2021
|
+
continue;
|
|
2022
|
+
}
|
|
2023
|
+
case 3: {
|
|
2024
|
+
if (tag !== 26) {
|
|
2025
|
+
break;
|
|
2026
|
+
}
|
|
2027
|
+
message.Members.push(reader.string());
|
|
2028
|
+
continue;
|
|
2029
|
+
}
|
|
2030
|
+
}
|
|
2031
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2032
|
+
break;
|
|
2033
|
+
}
|
|
2034
|
+
reader.skip(tag & 7);
|
|
1867
2035
|
}
|
|
1868
|
-
|
|
2036
|
+
return message;
|
|
2037
|
+
}
|
|
2038
|
+
finally {
|
|
2039
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1869
2040
|
}
|
|
1870
|
-
return message;
|
|
1871
2041
|
},
|
|
1872
2042
|
fromJSON(object) {
|
|
1873
2043
|
return {
|