@cratis/chronicle.contracts 16.36.3 → 16.37.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- 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
|
@@ -207,32 +207,42 @@ const AllJobsRequest = {
|
|
|
207
207
|
},
|
|
208
208
|
decode(input, length) {
|
|
209
209
|
const reader = input instanceof wire.BinaryReader ? input : new wire.BinaryReader(input);
|
|
210
|
-
const
|
|
211
|
-
|
|
212
|
-
|
|
213
|
-
|
|
214
|
-
|
|
215
|
-
|
|
216
|
-
|
|
217
|
-
|
|
218
|
-
|
|
219
|
-
|
|
220
|
-
|
|
221
|
-
|
|
222
|
-
|
|
223
|
-
|
|
224
|
-
|
|
225
|
-
|
|
226
|
-
|
|
227
|
-
|
|
228
|
-
|
|
229
|
-
|
|
230
|
-
|
|
231
|
-
|
|
210
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
211
|
+
if (previousRecursionDepth >= 100) {
|
|
212
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
213
|
+
}
|
|
214
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
215
|
+
try {
|
|
216
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
217
|
+
const message = createBaseAllJobsRequest();
|
|
218
|
+
while (reader.pos < end) {
|
|
219
|
+
const tag = reader.uint32();
|
|
220
|
+
switch (tag >>> 3) {
|
|
221
|
+
case 1: {
|
|
222
|
+
if (tag !== 10) {
|
|
223
|
+
break;
|
|
224
|
+
}
|
|
225
|
+
message.EventStore = reader.string();
|
|
226
|
+
continue;
|
|
227
|
+
}
|
|
228
|
+
case 2: {
|
|
229
|
+
if (tag !== 18) {
|
|
230
|
+
break;
|
|
231
|
+
}
|
|
232
|
+
message.Namespace = reader.string();
|
|
233
|
+
continue;
|
|
234
|
+
}
|
|
235
|
+
}
|
|
236
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
237
|
+
break;
|
|
238
|
+
}
|
|
239
|
+
reader.skip(tag & 7);
|
|
232
240
|
}
|
|
233
|
-
|
|
241
|
+
return message;
|
|
242
|
+
}
|
|
243
|
+
finally {
|
|
244
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
234
245
|
}
|
|
235
|
-
return message;
|
|
236
246
|
},
|
|
237
247
|
fromJSON(object) {
|
|
238
248
|
return {
|
|
@@ -294,60 +304,70 @@ const CommandResult = {
|
|
|
294
304
|
},
|
|
295
305
|
decode(input, length) {
|
|
296
306
|
const reader = input instanceof wire.BinaryReader ? input : new wire.BinaryReader(input);
|
|
297
|
-
const
|
|
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
|
-
|
|
345
|
-
|
|
346
|
-
|
|
307
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
308
|
+
if (previousRecursionDepth >= 100) {
|
|
309
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
310
|
+
}
|
|
311
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
312
|
+
try {
|
|
313
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
314
|
+
const message = createBaseCommandResult();
|
|
315
|
+
while (reader.pos < end) {
|
|
316
|
+
const tag = reader.uint32();
|
|
317
|
+
switch (tag >>> 3) {
|
|
318
|
+
case 1: {
|
|
319
|
+
if (tag !== 10) {
|
|
320
|
+
break;
|
|
321
|
+
}
|
|
322
|
+
message.CorrelationId = bcl.Guid.decode(reader, reader.uint32());
|
|
323
|
+
continue;
|
|
324
|
+
}
|
|
325
|
+
case 2: {
|
|
326
|
+
if (tag !== 16) {
|
|
327
|
+
break;
|
|
328
|
+
}
|
|
329
|
+
message.IsAuthorized = reader.bool();
|
|
330
|
+
continue;
|
|
331
|
+
}
|
|
332
|
+
case 3: {
|
|
333
|
+
if (tag !== 26) {
|
|
334
|
+
break;
|
|
335
|
+
}
|
|
336
|
+
message.ValidationResults.push(ValidationResult.decode(reader, reader.uint32()));
|
|
337
|
+
continue;
|
|
338
|
+
}
|
|
339
|
+
case 4: {
|
|
340
|
+
if (tag !== 34) {
|
|
341
|
+
break;
|
|
342
|
+
}
|
|
343
|
+
message.ExceptionMessages.push(reader.string());
|
|
344
|
+
continue;
|
|
345
|
+
}
|
|
346
|
+
case 5: {
|
|
347
|
+
if (tag !== 42) {
|
|
348
|
+
break;
|
|
349
|
+
}
|
|
350
|
+
message.ExceptionStackTrace = reader.string();
|
|
351
|
+
continue;
|
|
352
|
+
}
|
|
353
|
+
case 6: {
|
|
354
|
+
if (tag !== 50) {
|
|
355
|
+
break;
|
|
356
|
+
}
|
|
357
|
+
message.AuthorizationFailureReason = reader.string();
|
|
358
|
+
continue;
|
|
359
|
+
}
|
|
360
|
+
}
|
|
361
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
362
|
+
break;
|
|
363
|
+
}
|
|
364
|
+
reader.skip(tag & 7);
|
|
347
365
|
}
|
|
348
|
-
|
|
366
|
+
return message;
|
|
367
|
+
}
|
|
368
|
+
finally {
|
|
369
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
349
370
|
}
|
|
350
|
-
return message;
|
|
351
371
|
},
|
|
352
372
|
fromJSON(object) {
|
|
353
373
|
return {
|
|
@@ -412,16 +432,28 @@ const DateTimeOffset = {
|
|
|
412
432
|
},
|
|
413
433
|
decode(input, length) {
|
|
414
434
|
const reader = input instanceof wire.BinaryReader ? input : new wire.BinaryReader(input);
|
|
415
|
-
const
|
|
416
|
-
|
|
417
|
-
|
|
418
|
-
|
|
419
|
-
|
|
420
|
-
|
|
435
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
436
|
+
if (previousRecursionDepth >= 100) {
|
|
437
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
438
|
+
}
|
|
439
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
440
|
+
try {
|
|
441
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
442
|
+
const message = createBaseDateTimeOffset();
|
|
443
|
+
while (reader.pos < end) {
|
|
444
|
+
const tag = reader.uint32();
|
|
445
|
+
switch (tag >>> 3) {
|
|
446
|
+
}
|
|
447
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
448
|
+
break;
|
|
449
|
+
}
|
|
450
|
+
reader.skip(tag & 7);
|
|
421
451
|
}
|
|
422
|
-
|
|
452
|
+
return message;
|
|
453
|
+
}
|
|
454
|
+
finally {
|
|
455
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
423
456
|
}
|
|
424
|
-
return message;
|
|
425
457
|
},
|
|
426
458
|
fromJSON(_) {
|
|
427
459
|
return {};
|
|
@@ -456,39 +488,49 @@ const DeleteJobRequest = {
|
|
|
456
488
|
},
|
|
457
489
|
decode(input, length) {
|
|
458
490
|
const reader = input instanceof wire.BinaryReader ? input : new wire.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
|
-
|
|
485
|
-
|
|
486
|
-
|
|
487
|
-
|
|
491
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
492
|
+
if (previousRecursionDepth >= 100) {
|
|
493
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
494
|
+
}
|
|
495
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
496
|
+
try {
|
|
497
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
498
|
+
const message = createBaseDeleteJobRequest();
|
|
499
|
+
while (reader.pos < end) {
|
|
500
|
+
const tag = reader.uint32();
|
|
501
|
+
switch (tag >>> 3) {
|
|
502
|
+
case 1: {
|
|
503
|
+
if (tag !== 10) {
|
|
504
|
+
break;
|
|
505
|
+
}
|
|
506
|
+
message.EventStore = reader.string();
|
|
507
|
+
continue;
|
|
508
|
+
}
|
|
509
|
+
case 2: {
|
|
510
|
+
if (tag !== 18) {
|
|
511
|
+
break;
|
|
512
|
+
}
|
|
513
|
+
message.Namespace = reader.string();
|
|
514
|
+
continue;
|
|
515
|
+
}
|
|
516
|
+
case 3: {
|
|
517
|
+
if (tag !== 26) {
|
|
518
|
+
break;
|
|
519
|
+
}
|
|
520
|
+
message.JobId = bcl.Guid.decode(reader, reader.uint32());
|
|
521
|
+
continue;
|
|
522
|
+
}
|
|
523
|
+
}
|
|
524
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
525
|
+
break;
|
|
526
|
+
}
|
|
527
|
+
reader.skip(tag & 7);
|
|
488
528
|
}
|
|
489
|
-
|
|
529
|
+
return message;
|
|
530
|
+
}
|
|
531
|
+
finally {
|
|
532
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
490
533
|
}
|
|
491
|
-
return message;
|
|
492
534
|
},
|
|
493
535
|
fromJSON(object) {
|
|
494
536
|
return {
|
|
@@ -539,39 +581,49 @@ const GetJobStepsRequest = {
|
|
|
539
581
|
},
|
|
540
582
|
decode(input, length) {
|
|
541
583
|
const reader = input instanceof wire.BinaryReader ? input : new wire.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
|
-
|
|
568
|
-
|
|
569
|
-
|
|
570
|
-
|
|
584
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
585
|
+
if (previousRecursionDepth >= 100) {
|
|
586
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
587
|
+
}
|
|
588
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
589
|
+
try {
|
|
590
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
591
|
+
const message = createBaseGetJobStepsRequest();
|
|
592
|
+
while (reader.pos < end) {
|
|
593
|
+
const tag = reader.uint32();
|
|
594
|
+
switch (tag >>> 3) {
|
|
595
|
+
case 1: {
|
|
596
|
+
if (tag !== 10) {
|
|
597
|
+
break;
|
|
598
|
+
}
|
|
599
|
+
message.EventStore = reader.string();
|
|
600
|
+
continue;
|
|
601
|
+
}
|
|
602
|
+
case 2: {
|
|
603
|
+
if (tag !== 18) {
|
|
604
|
+
break;
|
|
605
|
+
}
|
|
606
|
+
message.Namespace = reader.string();
|
|
607
|
+
continue;
|
|
608
|
+
}
|
|
609
|
+
case 3: {
|
|
610
|
+
if (tag !== 26) {
|
|
611
|
+
break;
|
|
612
|
+
}
|
|
613
|
+
message.JobId = bcl.Guid.decode(reader, reader.uint32());
|
|
614
|
+
continue;
|
|
615
|
+
}
|
|
616
|
+
}
|
|
617
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
618
|
+
break;
|
|
619
|
+
}
|
|
620
|
+
reader.skip(tag & 7);
|
|
571
621
|
}
|
|
572
|
-
|
|
622
|
+
return message;
|
|
623
|
+
}
|
|
624
|
+
finally {
|
|
625
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
573
626
|
}
|
|
574
|
-
return message;
|
|
575
627
|
},
|
|
576
628
|
fromJSON(object) {
|
|
577
629
|
return {
|
|
@@ -642,67 +694,77 @@ const JobProgress = {
|
|
|
642
694
|
},
|
|
643
695
|
decode(input, length) {
|
|
644
696
|
const reader = input instanceof wire.BinaryReader ? input : new wire.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
|
-
|
|
699
|
-
|
|
700
|
-
|
|
701
|
-
|
|
697
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
698
|
+
if (previousRecursionDepth >= 100) {
|
|
699
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
700
|
+
}
|
|
701
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
702
|
+
try {
|
|
703
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
704
|
+
const message = createBaseJobProgress();
|
|
705
|
+
while (reader.pos < end) {
|
|
706
|
+
const tag = reader.uint32();
|
|
707
|
+
switch (tag >>> 3) {
|
|
708
|
+
case 1: {
|
|
709
|
+
if (tag !== 8) {
|
|
710
|
+
break;
|
|
711
|
+
}
|
|
712
|
+
message.TotalSteps = reader.int32();
|
|
713
|
+
continue;
|
|
714
|
+
}
|
|
715
|
+
case 2: {
|
|
716
|
+
if (tag !== 16) {
|
|
717
|
+
break;
|
|
718
|
+
}
|
|
719
|
+
message.SuccessfulSteps = reader.int32();
|
|
720
|
+
continue;
|
|
721
|
+
}
|
|
722
|
+
case 3: {
|
|
723
|
+
if (tag !== 24) {
|
|
724
|
+
break;
|
|
725
|
+
}
|
|
726
|
+
message.FailedSteps = reader.int32();
|
|
727
|
+
continue;
|
|
728
|
+
}
|
|
729
|
+
case 4: {
|
|
730
|
+
if (tag !== 32) {
|
|
731
|
+
break;
|
|
732
|
+
}
|
|
733
|
+
message.StoppedSteps = reader.int32();
|
|
734
|
+
continue;
|
|
735
|
+
}
|
|
736
|
+
case 5: {
|
|
737
|
+
if (tag !== 40) {
|
|
738
|
+
break;
|
|
739
|
+
}
|
|
740
|
+
message.IsCompleted = reader.bool();
|
|
741
|
+
continue;
|
|
742
|
+
}
|
|
743
|
+
case 6: {
|
|
744
|
+
if (tag !== 48) {
|
|
745
|
+
break;
|
|
746
|
+
}
|
|
747
|
+
message.IsStopped = reader.bool();
|
|
748
|
+
continue;
|
|
749
|
+
}
|
|
750
|
+
case 7: {
|
|
751
|
+
if (tag !== 58) {
|
|
752
|
+
break;
|
|
753
|
+
}
|
|
754
|
+
message.Message = reader.string();
|
|
755
|
+
continue;
|
|
756
|
+
}
|
|
757
|
+
}
|
|
758
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
759
|
+
break;
|
|
760
|
+
}
|
|
761
|
+
reader.skip(tag & 7);
|
|
702
762
|
}
|
|
703
|
-
|
|
763
|
+
return message;
|
|
764
|
+
}
|
|
765
|
+
finally {
|
|
766
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
704
767
|
}
|
|
705
|
-
return message;
|
|
706
768
|
},
|
|
707
769
|
fromJSON(object) {
|
|
708
770
|
return {
|
|
@@ -776,46 +838,56 @@ const JobStatusChanged = {
|
|
|
776
838
|
},
|
|
777
839
|
decode(input, length) {
|
|
778
840
|
const reader = input instanceof wire.BinaryReader ? input : new wire.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
|
-
|
|
812
|
-
|
|
813
|
-
|
|
814
|
-
|
|
841
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
842
|
+
if (previousRecursionDepth >= 100) {
|
|
843
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
844
|
+
}
|
|
845
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
846
|
+
try {
|
|
847
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
848
|
+
const message = createBaseJobStatusChanged();
|
|
849
|
+
while (reader.pos < end) {
|
|
850
|
+
const tag = reader.uint32();
|
|
851
|
+
switch (tag >>> 3) {
|
|
852
|
+
case 1: {
|
|
853
|
+
if (tag !== 8) {
|
|
854
|
+
break;
|
|
855
|
+
}
|
|
856
|
+
message.Status = reader.int32();
|
|
857
|
+
continue;
|
|
858
|
+
}
|
|
859
|
+
case 2: {
|
|
860
|
+
if (tag !== 18) {
|
|
861
|
+
break;
|
|
862
|
+
}
|
|
863
|
+
message.Occurred = SerializableDateTimeOffset.decode(reader, reader.uint32());
|
|
864
|
+
continue;
|
|
865
|
+
}
|
|
866
|
+
case 3: {
|
|
867
|
+
if (tag !== 26) {
|
|
868
|
+
break;
|
|
869
|
+
}
|
|
870
|
+
message.ExceptionMessages.push(reader.string());
|
|
871
|
+
continue;
|
|
872
|
+
}
|
|
873
|
+
case 4: {
|
|
874
|
+
if (tag !== 34) {
|
|
875
|
+
break;
|
|
876
|
+
}
|
|
877
|
+
message.ExceptionStackTrace = reader.string();
|
|
878
|
+
continue;
|
|
879
|
+
}
|
|
880
|
+
}
|
|
881
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
882
|
+
break;
|
|
883
|
+
}
|
|
884
|
+
reader.skip(tag & 7);
|
|
815
885
|
}
|
|
816
|
-
|
|
886
|
+
return message;
|
|
887
|
+
}
|
|
888
|
+
finally {
|
|
889
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
817
890
|
}
|
|
818
|
-
return message;
|
|
819
891
|
},
|
|
820
892
|
fromJSON(object) {
|
|
821
893
|
return {
|
|
@@ -872,32 +944,42 @@ const JobStepProgress = {
|
|
|
872
944
|
},
|
|
873
945
|
decode(input, length) {
|
|
874
946
|
const reader = input instanceof wire.BinaryReader ? input : new wire.BinaryReader(input);
|
|
875
|
-
const
|
|
876
|
-
|
|
877
|
-
|
|
878
|
-
|
|
879
|
-
|
|
880
|
-
|
|
881
|
-
|
|
882
|
-
|
|
883
|
-
|
|
884
|
-
|
|
885
|
-
|
|
886
|
-
|
|
887
|
-
|
|
888
|
-
|
|
889
|
-
|
|
890
|
-
|
|
891
|
-
|
|
892
|
-
|
|
893
|
-
|
|
947
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
948
|
+
if (previousRecursionDepth >= 100) {
|
|
949
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
950
|
+
}
|
|
951
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
952
|
+
try {
|
|
953
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
954
|
+
const message = createBaseJobStepProgress();
|
|
955
|
+
while (reader.pos < end) {
|
|
956
|
+
const tag = reader.uint32();
|
|
957
|
+
switch (tag >>> 3) {
|
|
958
|
+
case 1: {
|
|
959
|
+
if (tag !== 8) {
|
|
960
|
+
break;
|
|
961
|
+
}
|
|
962
|
+
message.Percentage = reader.int32();
|
|
963
|
+
continue;
|
|
964
|
+
}
|
|
965
|
+
case 2: {
|
|
966
|
+
if (tag !== 18) {
|
|
967
|
+
break;
|
|
968
|
+
}
|
|
969
|
+
message.Message = reader.string();
|
|
970
|
+
continue;
|
|
971
|
+
}
|
|
972
|
+
}
|
|
973
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
974
|
+
break;
|
|
975
|
+
}
|
|
976
|
+
reader.skip(tag & 7);
|
|
894
977
|
}
|
|
895
|
-
|
|
896
|
-
|
|
897
|
-
|
|
898
|
-
reader.
|
|
978
|
+
return message;
|
|
979
|
+
}
|
|
980
|
+
finally {
|
|
981
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
899
982
|
}
|
|
900
|
-
return message;
|
|
901
983
|
},
|
|
902
984
|
fromJSON(object) {
|
|
903
985
|
return {
|
|
@@ -946,46 +1028,56 @@ const JobStepStatusChanged = {
|
|
|
946
1028
|
},
|
|
947
1029
|
decode(input, length) {
|
|
948
1030
|
const reader = input instanceof wire.BinaryReader ? input : new wire.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
|
-
|
|
982
|
-
|
|
983
|
-
|
|
984
|
-
|
|
1031
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1032
|
+
if (previousRecursionDepth >= 100) {
|
|
1033
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1034
|
+
}
|
|
1035
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1036
|
+
try {
|
|
1037
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1038
|
+
const message = createBaseJobStepStatusChanged();
|
|
1039
|
+
while (reader.pos < end) {
|
|
1040
|
+
const tag = reader.uint32();
|
|
1041
|
+
switch (tag >>> 3) {
|
|
1042
|
+
case 1: {
|
|
1043
|
+
if (tag !== 8) {
|
|
1044
|
+
break;
|
|
1045
|
+
}
|
|
1046
|
+
message.Status = reader.int32();
|
|
1047
|
+
continue;
|
|
1048
|
+
}
|
|
1049
|
+
case 2: {
|
|
1050
|
+
if (tag !== 18) {
|
|
1051
|
+
break;
|
|
1052
|
+
}
|
|
1053
|
+
message.Occurred = SerializableDateTimeOffset.decode(reader, reader.uint32());
|
|
1054
|
+
continue;
|
|
1055
|
+
}
|
|
1056
|
+
case 3: {
|
|
1057
|
+
if (tag !== 26) {
|
|
1058
|
+
break;
|
|
1059
|
+
}
|
|
1060
|
+
message.ExceptionMessages.push(reader.string());
|
|
1061
|
+
continue;
|
|
1062
|
+
}
|
|
1063
|
+
case 4: {
|
|
1064
|
+
if (tag !== 34) {
|
|
1065
|
+
break;
|
|
1066
|
+
}
|
|
1067
|
+
message.ExceptionStackTrace = reader.string();
|
|
1068
|
+
continue;
|
|
1069
|
+
}
|
|
1070
|
+
}
|
|
1071
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1072
|
+
break;
|
|
1073
|
+
}
|
|
1074
|
+
reader.skip(tag & 7);
|
|
985
1075
|
}
|
|
986
|
-
|
|
1076
|
+
return message;
|
|
1077
|
+
}
|
|
1078
|
+
finally {
|
|
1079
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
987
1080
|
}
|
|
988
|
-
return message;
|
|
989
1081
|
},
|
|
990
1082
|
fromJSON(object) {
|
|
991
1083
|
return {
|
|
@@ -1054,60 +1146,70 @@ const JobStepSummaryResponse = {
|
|
|
1054
1146
|
},
|
|
1055
1147
|
decode(input, length) {
|
|
1056
1148
|
const reader = input instanceof wire.BinaryReader ? input : new wire.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
|
-
|
|
1149
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1150
|
+
if (previousRecursionDepth >= 100) {
|
|
1151
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1152
|
+
}
|
|
1153
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1154
|
+
try {
|
|
1155
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1156
|
+
const message = createBaseJobStepSummaryResponse();
|
|
1157
|
+
while (reader.pos < end) {
|
|
1158
|
+
const tag = reader.uint32();
|
|
1159
|
+
switch (tag >>> 3) {
|
|
1160
|
+
case 1: {
|
|
1161
|
+
if (tag !== 10) {
|
|
1162
|
+
break;
|
|
1163
|
+
}
|
|
1164
|
+
message.Id = bcl.Guid.decode(reader, reader.uint32());
|
|
1165
|
+
continue;
|
|
1166
|
+
}
|
|
1167
|
+
case 2: {
|
|
1168
|
+
if (tag !== 18) {
|
|
1169
|
+
break;
|
|
1170
|
+
}
|
|
1171
|
+
message.Type = reader.string();
|
|
1172
|
+
continue;
|
|
1173
|
+
}
|
|
1174
|
+
case 3: {
|
|
1175
|
+
if (tag !== 26) {
|
|
1176
|
+
break;
|
|
1177
|
+
}
|
|
1178
|
+
message.Name = reader.string();
|
|
1179
|
+
continue;
|
|
1180
|
+
}
|
|
1181
|
+
case 4: {
|
|
1182
|
+
if (tag !== 32) {
|
|
1183
|
+
break;
|
|
1184
|
+
}
|
|
1185
|
+
message.Status = reader.int32();
|
|
1186
|
+
continue;
|
|
1187
|
+
}
|
|
1188
|
+
case 5: {
|
|
1189
|
+
if (tag !== 42) {
|
|
1190
|
+
break;
|
|
1191
|
+
}
|
|
1192
|
+
message.StatusChanges.push(JobStepStatusChanged.decode(reader, reader.uint32()));
|
|
1193
|
+
continue;
|
|
1194
|
+
}
|
|
1195
|
+
case 6: {
|
|
1196
|
+
if (tag !== 50) {
|
|
1197
|
+
break;
|
|
1198
|
+
}
|
|
1199
|
+
message.Progress = JobStepProgress.decode(reader, reader.uint32());
|
|
1200
|
+
continue;
|
|
1201
|
+
}
|
|
1202
|
+
}
|
|
1203
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1204
|
+
break;
|
|
1205
|
+
}
|
|
1206
|
+
reader.skip(tag & 7);
|
|
1104
1207
|
}
|
|
1105
|
-
|
|
1106
|
-
|
|
1107
|
-
|
|
1108
|
-
reader.
|
|
1208
|
+
return message;
|
|
1209
|
+
}
|
|
1210
|
+
finally {
|
|
1211
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1109
1212
|
}
|
|
1110
|
-
return message;
|
|
1111
1213
|
},
|
|
1112
1214
|
fromJSON(object) {
|
|
1113
1215
|
return {
|
|
@@ -1197,67 +1299,77 @@ const JobSummaryResponse = {
|
|
|
1197
1299
|
},
|
|
1198
1300
|
decode(input, length) {
|
|
1199
1301
|
const reader = input instanceof wire.BinaryReader ? input : new wire.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
|
-
|
|
1302
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1303
|
+
if (previousRecursionDepth >= 100) {
|
|
1304
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1305
|
+
}
|
|
1306
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1307
|
+
try {
|
|
1308
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1309
|
+
const message = createBaseJobSummaryResponse();
|
|
1310
|
+
while (reader.pos < end) {
|
|
1311
|
+
const tag = reader.uint32();
|
|
1312
|
+
switch (tag >>> 3) {
|
|
1313
|
+
case 1: {
|
|
1314
|
+
if (tag !== 10) {
|
|
1315
|
+
break;
|
|
1316
|
+
}
|
|
1317
|
+
message.Id = bcl.Guid.decode(reader, reader.uint32());
|
|
1318
|
+
continue;
|
|
1319
|
+
}
|
|
1320
|
+
case 2: {
|
|
1321
|
+
if (tag !== 18) {
|
|
1322
|
+
break;
|
|
1323
|
+
}
|
|
1324
|
+
message.Details = reader.string();
|
|
1325
|
+
continue;
|
|
1326
|
+
}
|
|
1327
|
+
case 3: {
|
|
1328
|
+
if (tag !== 26) {
|
|
1329
|
+
break;
|
|
1330
|
+
}
|
|
1331
|
+
message.Type = reader.string();
|
|
1332
|
+
continue;
|
|
1333
|
+
}
|
|
1334
|
+
case 4: {
|
|
1335
|
+
if (tag !== 32) {
|
|
1336
|
+
break;
|
|
1337
|
+
}
|
|
1338
|
+
message.Status = reader.int32();
|
|
1339
|
+
continue;
|
|
1340
|
+
}
|
|
1341
|
+
case 5: {
|
|
1342
|
+
if (tag !== 42) {
|
|
1343
|
+
break;
|
|
1344
|
+
}
|
|
1345
|
+
message.Created = DateTimeOffset.decode(reader, reader.uint32());
|
|
1346
|
+
continue;
|
|
1347
|
+
}
|
|
1348
|
+
case 6: {
|
|
1349
|
+
if (tag !== 50) {
|
|
1350
|
+
break;
|
|
1351
|
+
}
|
|
1352
|
+
message.StatusChanges.push(JobStatusChanged.decode(reader, reader.uint32()));
|
|
1353
|
+
continue;
|
|
1354
|
+
}
|
|
1355
|
+
case 7: {
|
|
1356
|
+
if (tag !== 58) {
|
|
1357
|
+
break;
|
|
1358
|
+
}
|
|
1359
|
+
message.Progress = JobProgress.decode(reader, reader.uint32());
|
|
1360
|
+
continue;
|
|
1361
|
+
}
|
|
1362
|
+
}
|
|
1363
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1364
|
+
break;
|
|
1365
|
+
}
|
|
1366
|
+
reader.skip(tag & 7);
|
|
1254
1367
|
}
|
|
1255
|
-
|
|
1256
|
-
|
|
1257
|
-
|
|
1258
|
-
reader.
|
|
1368
|
+
return message;
|
|
1369
|
+
}
|
|
1370
|
+
finally {
|
|
1371
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1259
1372
|
}
|
|
1260
|
-
return message;
|
|
1261
1373
|
},
|
|
1262
1374
|
fromJSON(object) {
|
|
1263
1375
|
return {
|
|
@@ -1350,60 +1462,70 @@ const QueryResultIEnumerableJobStepSummaryResponse = {
|
|
|
1350
1462
|
},
|
|
1351
1463
|
decode(input, length) {
|
|
1352
1464
|
const reader = input instanceof wire.BinaryReader ? input : new wire.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
|
-
|
|
1465
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1466
|
+
if (previousRecursionDepth >= 100) {
|
|
1467
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1468
|
+
}
|
|
1469
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1470
|
+
try {
|
|
1471
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1472
|
+
const message = createBaseQueryResultIEnumerableJobStepSummaryResponse();
|
|
1473
|
+
while (reader.pos < end) {
|
|
1474
|
+
const tag = reader.uint32();
|
|
1475
|
+
switch (tag >>> 3) {
|
|
1476
|
+
case 1: {
|
|
1477
|
+
if (tag !== 10) {
|
|
1478
|
+
break;
|
|
1479
|
+
}
|
|
1480
|
+
message.CorrelationId = bcl.Guid.decode(reader, reader.uint32());
|
|
1481
|
+
continue;
|
|
1482
|
+
}
|
|
1483
|
+
case 2: {
|
|
1484
|
+
if (tag !== 16) {
|
|
1485
|
+
break;
|
|
1486
|
+
}
|
|
1487
|
+
message.IsAuthorized = reader.bool();
|
|
1488
|
+
continue;
|
|
1489
|
+
}
|
|
1490
|
+
case 3: {
|
|
1491
|
+
if (tag !== 26) {
|
|
1492
|
+
break;
|
|
1493
|
+
}
|
|
1494
|
+
message.ValidationResults.push(ValidationResult.decode(reader, reader.uint32()));
|
|
1495
|
+
continue;
|
|
1496
|
+
}
|
|
1497
|
+
case 4: {
|
|
1498
|
+
if (tag !== 34) {
|
|
1499
|
+
break;
|
|
1500
|
+
}
|
|
1501
|
+
message.ExceptionMessages.push(reader.string());
|
|
1502
|
+
continue;
|
|
1503
|
+
}
|
|
1504
|
+
case 5: {
|
|
1505
|
+
if (tag !== 42) {
|
|
1506
|
+
break;
|
|
1507
|
+
}
|
|
1508
|
+
message.ExceptionStackTrace = reader.string();
|
|
1509
|
+
continue;
|
|
1510
|
+
}
|
|
1511
|
+
case 6: {
|
|
1512
|
+
if (tag !== 50) {
|
|
1513
|
+
break;
|
|
1514
|
+
}
|
|
1515
|
+
message.Data.push(JobStepSummaryResponse.decode(reader, reader.uint32()));
|
|
1516
|
+
continue;
|
|
1517
|
+
}
|
|
1518
|
+
}
|
|
1519
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1520
|
+
break;
|
|
1521
|
+
}
|
|
1522
|
+
reader.skip(tag & 7);
|
|
1400
1523
|
}
|
|
1401
|
-
|
|
1402
|
-
|
|
1403
|
-
|
|
1404
|
-
reader.
|
|
1524
|
+
return message;
|
|
1525
|
+
}
|
|
1526
|
+
finally {
|
|
1527
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1405
1528
|
}
|
|
1406
|
-
return message;
|
|
1407
1529
|
},
|
|
1408
1530
|
fromJSON(object) {
|
|
1409
1531
|
return {
|
|
@@ -1493,60 +1615,70 @@ const QueryResultIEnumerableJobSummaryResponse = {
|
|
|
1493
1615
|
},
|
|
1494
1616
|
decode(input, length) {
|
|
1495
1617
|
const reader = input instanceof wire.BinaryReader ? input : new wire.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
|
-
|
|
1618
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1619
|
+
if (previousRecursionDepth >= 100) {
|
|
1620
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1621
|
+
}
|
|
1622
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1623
|
+
try {
|
|
1624
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1625
|
+
const message = createBaseQueryResultIEnumerableJobSummaryResponse();
|
|
1626
|
+
while (reader.pos < end) {
|
|
1627
|
+
const tag = reader.uint32();
|
|
1628
|
+
switch (tag >>> 3) {
|
|
1629
|
+
case 1: {
|
|
1630
|
+
if (tag !== 10) {
|
|
1631
|
+
break;
|
|
1632
|
+
}
|
|
1633
|
+
message.CorrelationId = bcl.Guid.decode(reader, reader.uint32());
|
|
1634
|
+
continue;
|
|
1635
|
+
}
|
|
1636
|
+
case 2: {
|
|
1637
|
+
if (tag !== 16) {
|
|
1638
|
+
break;
|
|
1639
|
+
}
|
|
1640
|
+
message.IsAuthorized = reader.bool();
|
|
1641
|
+
continue;
|
|
1642
|
+
}
|
|
1643
|
+
case 3: {
|
|
1644
|
+
if (tag !== 26) {
|
|
1645
|
+
break;
|
|
1646
|
+
}
|
|
1647
|
+
message.ValidationResults.push(ValidationResult.decode(reader, reader.uint32()));
|
|
1648
|
+
continue;
|
|
1649
|
+
}
|
|
1650
|
+
case 4: {
|
|
1651
|
+
if (tag !== 34) {
|
|
1652
|
+
break;
|
|
1653
|
+
}
|
|
1654
|
+
message.ExceptionMessages.push(reader.string());
|
|
1655
|
+
continue;
|
|
1656
|
+
}
|
|
1657
|
+
case 5: {
|
|
1658
|
+
if (tag !== 42) {
|
|
1659
|
+
break;
|
|
1660
|
+
}
|
|
1661
|
+
message.ExceptionStackTrace = reader.string();
|
|
1662
|
+
continue;
|
|
1663
|
+
}
|
|
1664
|
+
case 6: {
|
|
1665
|
+
if (tag !== 50) {
|
|
1666
|
+
break;
|
|
1667
|
+
}
|
|
1668
|
+
message.Data.push(JobSummaryResponse.decode(reader, reader.uint32()));
|
|
1669
|
+
continue;
|
|
1670
|
+
}
|
|
1671
|
+
}
|
|
1672
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1673
|
+
break;
|
|
1674
|
+
}
|
|
1675
|
+
reader.skip(tag & 7);
|
|
1546
1676
|
}
|
|
1547
|
-
|
|
1677
|
+
return message;
|
|
1678
|
+
}
|
|
1679
|
+
finally {
|
|
1680
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1548
1681
|
}
|
|
1549
|
-
return message;
|
|
1550
1682
|
},
|
|
1551
1683
|
fromJSON(object) {
|
|
1552
1684
|
return {
|
|
@@ -1618,39 +1750,49 @@ const ResumeJobRequest = {
|
|
|
1618
1750
|
},
|
|
1619
1751
|
decode(input, length) {
|
|
1620
1752
|
const reader = input instanceof wire.BinaryReader ? input : new wire.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
|
-
|
|
1753
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1754
|
+
if (previousRecursionDepth >= 100) {
|
|
1755
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1756
|
+
}
|
|
1757
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1758
|
+
try {
|
|
1759
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1760
|
+
const message = createBaseResumeJobRequest();
|
|
1761
|
+
while (reader.pos < end) {
|
|
1762
|
+
const tag = reader.uint32();
|
|
1763
|
+
switch (tag >>> 3) {
|
|
1764
|
+
case 1: {
|
|
1765
|
+
if (tag !== 10) {
|
|
1766
|
+
break;
|
|
1767
|
+
}
|
|
1768
|
+
message.EventStore = reader.string();
|
|
1769
|
+
continue;
|
|
1770
|
+
}
|
|
1771
|
+
case 2: {
|
|
1772
|
+
if (tag !== 18) {
|
|
1773
|
+
break;
|
|
1774
|
+
}
|
|
1775
|
+
message.Namespace = reader.string();
|
|
1776
|
+
continue;
|
|
1777
|
+
}
|
|
1778
|
+
case 3: {
|
|
1779
|
+
if (tag !== 26) {
|
|
1780
|
+
break;
|
|
1781
|
+
}
|
|
1782
|
+
message.JobId = bcl.Guid.decode(reader, reader.uint32());
|
|
1783
|
+
continue;
|
|
1784
|
+
}
|
|
1785
|
+
}
|
|
1786
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1787
|
+
break;
|
|
1788
|
+
}
|
|
1789
|
+
reader.skip(tag & 7);
|
|
1650
1790
|
}
|
|
1651
|
-
|
|
1791
|
+
return message;
|
|
1792
|
+
}
|
|
1793
|
+
finally {
|
|
1794
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1652
1795
|
}
|
|
1653
|
-
return message;
|
|
1654
1796
|
},
|
|
1655
1797
|
fromJSON(object) {
|
|
1656
1798
|
return {
|
|
@@ -1695,25 +1837,35 @@ const SerializableDateTimeOffset = {
|
|
|
1695
1837
|
},
|
|
1696
1838
|
decode(input, length) {
|
|
1697
1839
|
const reader = input instanceof wire.BinaryReader ? input : new wire.BinaryReader(input);
|
|
1698
|
-
const
|
|
1699
|
-
|
|
1700
|
-
|
|
1701
|
-
|
|
1702
|
-
|
|
1703
|
-
|
|
1704
|
-
|
|
1705
|
-
|
|
1706
|
-
|
|
1707
|
-
|
|
1708
|
-
|
|
1709
|
-
|
|
1710
|
-
|
|
1711
|
-
|
|
1712
|
-
|
|
1840
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1841
|
+
if (previousRecursionDepth >= 100) {
|
|
1842
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1843
|
+
}
|
|
1844
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1845
|
+
try {
|
|
1846
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1847
|
+
const message = createBaseSerializableDateTimeOffset();
|
|
1848
|
+
while (reader.pos < end) {
|
|
1849
|
+
const tag = reader.uint32();
|
|
1850
|
+
switch (tag >>> 3) {
|
|
1851
|
+
case 1: {
|
|
1852
|
+
if (tag !== 10) {
|
|
1853
|
+
break;
|
|
1854
|
+
}
|
|
1855
|
+
message.Value = reader.string();
|
|
1856
|
+
continue;
|
|
1857
|
+
}
|
|
1858
|
+
}
|
|
1859
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1860
|
+
break;
|
|
1861
|
+
}
|
|
1862
|
+
reader.skip(tag & 7);
|
|
1713
1863
|
}
|
|
1714
|
-
|
|
1864
|
+
return message;
|
|
1865
|
+
}
|
|
1866
|
+
finally {
|
|
1867
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1715
1868
|
}
|
|
1716
|
-
return message;
|
|
1717
1869
|
},
|
|
1718
1870
|
fromJSON(object) {
|
|
1719
1871
|
return { Value: isSet(object.Value) ? globalThis.String(object.Value) : "" };
|
|
@@ -1752,39 +1904,49 @@ const StopJobRequest = {
|
|
|
1752
1904
|
},
|
|
1753
1905
|
decode(input, length) {
|
|
1754
1906
|
const reader = input instanceof wire.BinaryReader ? input : new wire.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
|
-
|
|
1907
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1908
|
+
if (previousRecursionDepth >= 100) {
|
|
1909
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1910
|
+
}
|
|
1911
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1912
|
+
try {
|
|
1913
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1914
|
+
const message = createBaseStopJobRequest();
|
|
1915
|
+
while (reader.pos < end) {
|
|
1916
|
+
const tag = reader.uint32();
|
|
1917
|
+
switch (tag >>> 3) {
|
|
1918
|
+
case 1: {
|
|
1919
|
+
if (tag !== 10) {
|
|
1920
|
+
break;
|
|
1921
|
+
}
|
|
1922
|
+
message.EventStore = reader.string();
|
|
1923
|
+
continue;
|
|
1924
|
+
}
|
|
1925
|
+
case 2: {
|
|
1926
|
+
if (tag !== 18) {
|
|
1927
|
+
break;
|
|
1928
|
+
}
|
|
1929
|
+
message.Namespace = reader.string();
|
|
1930
|
+
continue;
|
|
1931
|
+
}
|
|
1932
|
+
case 3: {
|
|
1933
|
+
if (tag !== 26) {
|
|
1934
|
+
break;
|
|
1935
|
+
}
|
|
1936
|
+
message.JobId = bcl.Guid.decode(reader, reader.uint32());
|
|
1937
|
+
continue;
|
|
1938
|
+
}
|
|
1939
|
+
}
|
|
1940
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1941
|
+
break;
|
|
1942
|
+
}
|
|
1943
|
+
reader.skip(tag & 7);
|
|
1784
1944
|
}
|
|
1785
|
-
|
|
1945
|
+
return message;
|
|
1946
|
+
}
|
|
1947
|
+
finally {
|
|
1948
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1786
1949
|
}
|
|
1787
|
-
return message;
|
|
1788
1950
|
},
|
|
1789
1951
|
fromJSON(object) {
|
|
1790
1952
|
return {
|
|
@@ -1835,39 +1997,49 @@ const ValidationResult = {
|
|
|
1835
1997
|
},
|
|
1836
1998
|
decode(input, length) {
|
|
1837
1999
|
const reader = input instanceof wire.BinaryReader ? input : new wire.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
|
-
|
|
2000
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
2001
|
+
if (previousRecursionDepth >= 100) {
|
|
2002
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2003
|
+
}
|
|
2004
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2005
|
+
try {
|
|
2006
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2007
|
+
const message = createBaseValidationResult();
|
|
2008
|
+
while (reader.pos < end) {
|
|
2009
|
+
const tag = reader.uint32();
|
|
2010
|
+
switch (tag >>> 3) {
|
|
2011
|
+
case 1: {
|
|
2012
|
+
if (tag !== 8) {
|
|
2013
|
+
break;
|
|
2014
|
+
}
|
|
2015
|
+
message.Severity = reader.int32();
|
|
2016
|
+
continue;
|
|
2017
|
+
}
|
|
2018
|
+
case 2: {
|
|
2019
|
+
if (tag !== 18) {
|
|
2020
|
+
break;
|
|
2021
|
+
}
|
|
2022
|
+
message.Message = reader.string();
|
|
2023
|
+
continue;
|
|
2024
|
+
}
|
|
2025
|
+
case 3: {
|
|
2026
|
+
if (tag !== 26) {
|
|
2027
|
+
break;
|
|
2028
|
+
}
|
|
2029
|
+
message.Members.push(reader.string());
|
|
2030
|
+
continue;
|
|
2031
|
+
}
|
|
2032
|
+
}
|
|
2033
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2034
|
+
break;
|
|
2035
|
+
}
|
|
2036
|
+
reader.skip(tag & 7);
|
|
1867
2037
|
}
|
|
1868
|
-
|
|
2038
|
+
return message;
|
|
2039
|
+
}
|
|
2040
|
+
finally {
|
|
2041
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1869
2042
|
}
|
|
1870
|
-
return message;
|
|
1871
2043
|
},
|
|
1872
2044
|
fromJSON(object) {
|
|
1873
2045
|
return {
|