@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/generated/jobs.ts
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
// Code generated by protoc-gen-ts_proto. DO NOT EDIT.
|
|
2
2
|
// versions:
|
|
3
|
-
// protoc-gen-ts_proto v2.12.
|
|
3
|
+
// protoc-gen-ts_proto v2.12.1
|
|
4
4
|
// protoc v5.28.3
|
|
5
5
|
// source: jobs.proto
|
|
6
6
|
|
|
@@ -360,34 +360,43 @@ export const AllJobsRequest: MessageFns<AllJobsRequest> = {
|
|
|
360
360
|
|
|
361
361
|
decode(input: BinaryReader | Uint8Array, length?: number): AllJobsRequest {
|
|
362
362
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
363
|
-
const
|
|
364
|
-
|
|
365
|
-
|
|
366
|
-
|
|
367
|
-
|
|
368
|
-
|
|
369
|
-
|
|
370
|
-
|
|
371
|
-
|
|
372
|
-
|
|
373
|
-
|
|
374
|
-
|
|
375
|
-
|
|
376
|
-
|
|
377
|
-
|
|
378
|
-
|
|
379
|
-
|
|
380
|
-
|
|
381
|
-
|
|
382
|
-
|
|
383
|
-
|
|
384
|
-
|
|
385
|
-
|
|
386
|
-
|
|
363
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
364
|
+
if (previousRecursionDepth >= 100) {
|
|
365
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
366
|
+
}
|
|
367
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
368
|
+
try {
|
|
369
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
370
|
+
const message = createBaseAllJobsRequest();
|
|
371
|
+
while (reader.pos < end) {
|
|
372
|
+
const tag = reader.uint32();
|
|
373
|
+
switch (tag >>> 3) {
|
|
374
|
+
case 1: {
|
|
375
|
+
if (tag !== 10) {
|
|
376
|
+
break;
|
|
377
|
+
}
|
|
378
|
+
|
|
379
|
+
message.EventStore = reader.string();
|
|
380
|
+
continue;
|
|
381
|
+
}
|
|
382
|
+
case 2: {
|
|
383
|
+
if (tag !== 18) {
|
|
384
|
+
break;
|
|
385
|
+
}
|
|
386
|
+
|
|
387
|
+
message.Namespace = reader.string();
|
|
388
|
+
continue;
|
|
389
|
+
}
|
|
390
|
+
}
|
|
391
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
392
|
+
break;
|
|
393
|
+
}
|
|
394
|
+
reader.skip(tag & 7);
|
|
387
395
|
}
|
|
388
|
-
|
|
396
|
+
return message;
|
|
397
|
+
} finally {
|
|
398
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
389
399
|
}
|
|
390
|
-
return message;
|
|
391
400
|
},
|
|
392
401
|
|
|
393
402
|
fromJSON(object: any): AllJobsRequest {
|
|
@@ -455,66 +464,75 @@ export const CommandResult: MessageFns<CommandResult> = {
|
|
|
455
464
|
|
|
456
465
|
decode(input: BinaryReader | Uint8Array, length?: number): CommandResult {
|
|
457
466
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
458
|
-
const
|
|
459
|
-
|
|
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
|
-
|
|
488
|
-
|
|
489
|
-
|
|
490
|
-
|
|
491
|
-
|
|
492
|
-
|
|
493
|
-
|
|
494
|
-
|
|
495
|
-
|
|
496
|
-
|
|
497
|
-
|
|
498
|
-
|
|
499
|
-
|
|
500
|
-
|
|
501
|
-
|
|
502
|
-
|
|
503
|
-
|
|
504
|
-
|
|
505
|
-
|
|
506
|
-
|
|
507
|
-
|
|
508
|
-
|
|
509
|
-
|
|
510
|
-
|
|
467
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
468
|
+
if (previousRecursionDepth >= 100) {
|
|
469
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
470
|
+
}
|
|
471
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
472
|
+
try {
|
|
473
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
474
|
+
const message = createBaseCommandResult();
|
|
475
|
+
while (reader.pos < end) {
|
|
476
|
+
const tag = reader.uint32();
|
|
477
|
+
switch (tag >>> 3) {
|
|
478
|
+
case 1: {
|
|
479
|
+
if (tag !== 10) {
|
|
480
|
+
break;
|
|
481
|
+
}
|
|
482
|
+
|
|
483
|
+
message.CorrelationId = Guid.decode(reader, reader.uint32());
|
|
484
|
+
continue;
|
|
485
|
+
}
|
|
486
|
+
case 2: {
|
|
487
|
+
if (tag !== 16) {
|
|
488
|
+
break;
|
|
489
|
+
}
|
|
490
|
+
|
|
491
|
+
message.IsAuthorized = reader.bool();
|
|
492
|
+
continue;
|
|
493
|
+
}
|
|
494
|
+
case 3: {
|
|
495
|
+
if (tag !== 26) {
|
|
496
|
+
break;
|
|
497
|
+
}
|
|
498
|
+
|
|
499
|
+
message.ValidationResults.push(ValidationResult.decode(reader, reader.uint32()));
|
|
500
|
+
continue;
|
|
501
|
+
}
|
|
502
|
+
case 4: {
|
|
503
|
+
if (tag !== 34) {
|
|
504
|
+
break;
|
|
505
|
+
}
|
|
506
|
+
|
|
507
|
+
message.ExceptionMessages.push(reader.string());
|
|
508
|
+
continue;
|
|
509
|
+
}
|
|
510
|
+
case 5: {
|
|
511
|
+
if (tag !== 42) {
|
|
512
|
+
break;
|
|
513
|
+
}
|
|
514
|
+
|
|
515
|
+
message.ExceptionStackTrace = reader.string();
|
|
516
|
+
continue;
|
|
517
|
+
}
|
|
518
|
+
case 6: {
|
|
519
|
+
if (tag !== 50) {
|
|
520
|
+
break;
|
|
521
|
+
}
|
|
522
|
+
|
|
523
|
+
message.AuthorizationFailureReason = reader.string();
|
|
524
|
+
continue;
|
|
525
|
+
}
|
|
526
|
+
}
|
|
527
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
528
|
+
break;
|
|
529
|
+
}
|
|
530
|
+
reader.skip(tag & 7);
|
|
511
531
|
}
|
|
512
|
-
|
|
513
|
-
|
|
514
|
-
|
|
515
|
-
reader.skip(tag & 7);
|
|
532
|
+
return message;
|
|
533
|
+
} finally {
|
|
534
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
516
535
|
}
|
|
517
|
-
return message;
|
|
518
536
|
},
|
|
519
537
|
|
|
520
538
|
fromJSON(object: any): CommandResult {
|
|
@@ -585,18 +603,27 @@ export const DateTimeOffset: MessageFns<DateTimeOffset> = {
|
|
|
585
603
|
|
|
586
604
|
decode(input: BinaryReader | Uint8Array, length?: number): DateTimeOffset {
|
|
587
605
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
588
|
-
const
|
|
589
|
-
|
|
590
|
-
|
|
591
|
-
|
|
592
|
-
|
|
593
|
-
|
|
594
|
-
|
|
595
|
-
|
|
606
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
607
|
+
if (previousRecursionDepth >= 100) {
|
|
608
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
609
|
+
}
|
|
610
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
611
|
+
try {
|
|
612
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
613
|
+
const message = createBaseDateTimeOffset();
|
|
614
|
+
while (reader.pos < end) {
|
|
615
|
+
const tag = reader.uint32();
|
|
616
|
+
switch (tag >>> 3) {
|
|
617
|
+
}
|
|
618
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
619
|
+
break;
|
|
620
|
+
}
|
|
621
|
+
reader.skip(tag & 7);
|
|
596
622
|
}
|
|
597
|
-
|
|
623
|
+
return message;
|
|
624
|
+
} finally {
|
|
625
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
598
626
|
}
|
|
599
|
-
return message;
|
|
600
627
|
},
|
|
601
628
|
|
|
602
629
|
fromJSON(_: any): DateTimeOffset {
|
|
@@ -637,42 +664,51 @@ export const DeleteJobRequest: MessageFns<DeleteJobRequest> = {
|
|
|
637
664
|
|
|
638
665
|
decode(input: BinaryReader | Uint8Array, length?: number): DeleteJobRequest {
|
|
639
666
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
640
|
-
const
|
|
641
|
-
|
|
642
|
-
|
|
643
|
-
|
|
644
|
-
|
|
645
|
-
|
|
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
|
-
|
|
667
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
668
|
+
if (previousRecursionDepth >= 100) {
|
|
669
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
670
|
+
}
|
|
671
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
672
|
+
try {
|
|
673
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
674
|
+
const message = createBaseDeleteJobRequest();
|
|
675
|
+
while (reader.pos < end) {
|
|
676
|
+
const tag = reader.uint32();
|
|
677
|
+
switch (tag >>> 3) {
|
|
678
|
+
case 1: {
|
|
679
|
+
if (tag !== 10) {
|
|
680
|
+
break;
|
|
681
|
+
}
|
|
682
|
+
|
|
683
|
+
message.EventStore = reader.string();
|
|
684
|
+
continue;
|
|
685
|
+
}
|
|
686
|
+
case 2: {
|
|
687
|
+
if (tag !== 18) {
|
|
688
|
+
break;
|
|
689
|
+
}
|
|
690
|
+
|
|
691
|
+
message.Namespace = reader.string();
|
|
692
|
+
continue;
|
|
693
|
+
}
|
|
694
|
+
case 3: {
|
|
695
|
+
if (tag !== 26) {
|
|
696
|
+
break;
|
|
697
|
+
}
|
|
698
|
+
|
|
699
|
+
message.JobId = Guid.decode(reader, reader.uint32());
|
|
700
|
+
continue;
|
|
701
|
+
}
|
|
702
|
+
}
|
|
703
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
704
|
+
break;
|
|
705
|
+
}
|
|
706
|
+
reader.skip(tag & 7);
|
|
672
707
|
}
|
|
673
|
-
|
|
708
|
+
return message;
|
|
709
|
+
} finally {
|
|
710
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
674
711
|
}
|
|
675
|
-
return message;
|
|
676
712
|
},
|
|
677
713
|
|
|
678
714
|
fromJSON(object: any): DeleteJobRequest {
|
|
@@ -729,42 +765,51 @@ export const GetJobStepsRequest: MessageFns<GetJobStepsRequest> = {
|
|
|
729
765
|
|
|
730
766
|
decode(input: BinaryReader | Uint8Array, length?: number): GetJobStepsRequest {
|
|
731
767
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
732
|
-
const
|
|
733
|
-
|
|
734
|
-
|
|
735
|
-
|
|
736
|
-
|
|
737
|
-
|
|
738
|
-
|
|
739
|
-
|
|
740
|
-
|
|
741
|
-
|
|
742
|
-
|
|
743
|
-
|
|
744
|
-
|
|
745
|
-
|
|
746
|
-
|
|
747
|
-
|
|
748
|
-
|
|
749
|
-
|
|
750
|
-
|
|
751
|
-
|
|
752
|
-
|
|
753
|
-
|
|
754
|
-
|
|
755
|
-
|
|
756
|
-
|
|
757
|
-
|
|
758
|
-
|
|
759
|
-
|
|
760
|
-
|
|
761
|
-
|
|
762
|
-
|
|
763
|
-
|
|
768
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
769
|
+
if (previousRecursionDepth >= 100) {
|
|
770
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
771
|
+
}
|
|
772
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
773
|
+
try {
|
|
774
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
775
|
+
const message = createBaseGetJobStepsRequest();
|
|
776
|
+
while (reader.pos < end) {
|
|
777
|
+
const tag = reader.uint32();
|
|
778
|
+
switch (tag >>> 3) {
|
|
779
|
+
case 1: {
|
|
780
|
+
if (tag !== 10) {
|
|
781
|
+
break;
|
|
782
|
+
}
|
|
783
|
+
|
|
784
|
+
message.EventStore = reader.string();
|
|
785
|
+
continue;
|
|
786
|
+
}
|
|
787
|
+
case 2: {
|
|
788
|
+
if (tag !== 18) {
|
|
789
|
+
break;
|
|
790
|
+
}
|
|
791
|
+
|
|
792
|
+
message.Namespace = reader.string();
|
|
793
|
+
continue;
|
|
794
|
+
}
|
|
795
|
+
case 3: {
|
|
796
|
+
if (tag !== 26) {
|
|
797
|
+
break;
|
|
798
|
+
}
|
|
799
|
+
|
|
800
|
+
message.JobId = Guid.decode(reader, reader.uint32());
|
|
801
|
+
continue;
|
|
802
|
+
}
|
|
803
|
+
}
|
|
804
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
805
|
+
break;
|
|
806
|
+
}
|
|
807
|
+
reader.skip(tag & 7);
|
|
764
808
|
}
|
|
765
|
-
|
|
809
|
+
return message;
|
|
810
|
+
} finally {
|
|
811
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
766
812
|
}
|
|
767
|
-
return message;
|
|
768
813
|
},
|
|
769
814
|
|
|
770
815
|
fromJSON(object: any): GetJobStepsRequest {
|
|
@@ -841,74 +886,83 @@ export const JobProgress: MessageFns<JobProgress> = {
|
|
|
841
886
|
|
|
842
887
|
decode(input: BinaryReader | Uint8Array, length?: number): JobProgress {
|
|
843
888
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
844
|
-
const
|
|
845
|
-
|
|
846
|
-
|
|
847
|
-
|
|
848
|
-
|
|
849
|
-
|
|
850
|
-
|
|
851
|
-
|
|
852
|
-
|
|
853
|
-
|
|
854
|
-
|
|
855
|
-
|
|
856
|
-
|
|
857
|
-
|
|
858
|
-
|
|
859
|
-
|
|
860
|
-
|
|
861
|
-
|
|
862
|
-
|
|
863
|
-
|
|
864
|
-
|
|
865
|
-
|
|
866
|
-
|
|
867
|
-
|
|
868
|
-
|
|
869
|
-
|
|
870
|
-
|
|
871
|
-
|
|
872
|
-
|
|
873
|
-
|
|
874
|
-
|
|
875
|
-
|
|
876
|
-
|
|
877
|
-
|
|
878
|
-
|
|
879
|
-
|
|
880
|
-
|
|
881
|
-
|
|
882
|
-
|
|
883
|
-
|
|
884
|
-
|
|
885
|
-
|
|
886
|
-
|
|
887
|
-
|
|
888
|
-
|
|
889
|
-
|
|
890
|
-
|
|
891
|
-
|
|
892
|
-
|
|
893
|
-
|
|
894
|
-
|
|
895
|
-
|
|
896
|
-
|
|
897
|
-
|
|
898
|
-
|
|
899
|
-
|
|
900
|
-
|
|
901
|
-
|
|
902
|
-
|
|
903
|
-
|
|
904
|
-
|
|
889
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
890
|
+
if (previousRecursionDepth >= 100) {
|
|
891
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
892
|
+
}
|
|
893
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
894
|
+
try {
|
|
895
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
896
|
+
const message = createBaseJobProgress();
|
|
897
|
+
while (reader.pos < end) {
|
|
898
|
+
const tag = reader.uint32();
|
|
899
|
+
switch (tag >>> 3) {
|
|
900
|
+
case 1: {
|
|
901
|
+
if (tag !== 8) {
|
|
902
|
+
break;
|
|
903
|
+
}
|
|
904
|
+
|
|
905
|
+
message.TotalSteps = reader.int32();
|
|
906
|
+
continue;
|
|
907
|
+
}
|
|
908
|
+
case 2: {
|
|
909
|
+
if (tag !== 16) {
|
|
910
|
+
break;
|
|
911
|
+
}
|
|
912
|
+
|
|
913
|
+
message.SuccessfulSteps = reader.int32();
|
|
914
|
+
continue;
|
|
915
|
+
}
|
|
916
|
+
case 3: {
|
|
917
|
+
if (tag !== 24) {
|
|
918
|
+
break;
|
|
919
|
+
}
|
|
920
|
+
|
|
921
|
+
message.FailedSteps = reader.int32();
|
|
922
|
+
continue;
|
|
923
|
+
}
|
|
924
|
+
case 4: {
|
|
925
|
+
if (tag !== 32) {
|
|
926
|
+
break;
|
|
927
|
+
}
|
|
928
|
+
|
|
929
|
+
message.StoppedSteps = reader.int32();
|
|
930
|
+
continue;
|
|
931
|
+
}
|
|
932
|
+
case 5: {
|
|
933
|
+
if (tag !== 40) {
|
|
934
|
+
break;
|
|
935
|
+
}
|
|
936
|
+
|
|
937
|
+
message.IsCompleted = reader.bool();
|
|
938
|
+
continue;
|
|
939
|
+
}
|
|
940
|
+
case 6: {
|
|
941
|
+
if (tag !== 48) {
|
|
942
|
+
break;
|
|
943
|
+
}
|
|
944
|
+
|
|
945
|
+
message.IsStopped = reader.bool();
|
|
946
|
+
continue;
|
|
947
|
+
}
|
|
948
|
+
case 7: {
|
|
949
|
+
if (tag !== 58) {
|
|
950
|
+
break;
|
|
951
|
+
}
|
|
952
|
+
|
|
953
|
+
message.Message = reader.string();
|
|
954
|
+
continue;
|
|
955
|
+
}
|
|
956
|
+
}
|
|
957
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
958
|
+
break;
|
|
959
|
+
}
|
|
960
|
+
reader.skip(tag & 7);
|
|
905
961
|
}
|
|
906
|
-
|
|
907
|
-
|
|
908
|
-
|
|
909
|
-
reader.skip(tag & 7);
|
|
962
|
+
return message;
|
|
963
|
+
} finally {
|
|
964
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
910
965
|
}
|
|
911
|
-
return message;
|
|
912
966
|
},
|
|
913
967
|
|
|
914
968
|
fromJSON(object: any): JobProgress {
|
|
@@ -988,50 +1042,59 @@ export const JobStatusChanged: MessageFns<JobStatusChanged> = {
|
|
|
988
1042
|
|
|
989
1043
|
decode(input: BinaryReader | Uint8Array, length?: number): JobStatusChanged {
|
|
990
1044
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
991
|
-
const
|
|
992
|
-
|
|
993
|
-
|
|
994
|
-
|
|
995
|
-
|
|
996
|
-
|
|
997
|
-
|
|
998
|
-
|
|
999
|
-
|
|
1000
|
-
|
|
1001
|
-
|
|
1002
|
-
|
|
1003
|
-
|
|
1004
|
-
|
|
1005
|
-
|
|
1006
|
-
|
|
1007
|
-
|
|
1008
|
-
|
|
1009
|
-
|
|
1010
|
-
|
|
1011
|
-
|
|
1012
|
-
|
|
1013
|
-
|
|
1014
|
-
|
|
1015
|
-
|
|
1016
|
-
|
|
1017
|
-
|
|
1018
|
-
|
|
1019
|
-
|
|
1020
|
-
|
|
1021
|
-
|
|
1022
|
-
|
|
1023
|
-
|
|
1024
|
-
|
|
1025
|
-
|
|
1026
|
-
|
|
1027
|
-
|
|
1045
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
1046
|
+
if (previousRecursionDepth >= 100) {
|
|
1047
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1048
|
+
}
|
|
1049
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1050
|
+
try {
|
|
1051
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1052
|
+
const message = createBaseJobStatusChanged();
|
|
1053
|
+
while (reader.pos < end) {
|
|
1054
|
+
const tag = reader.uint32();
|
|
1055
|
+
switch (tag >>> 3) {
|
|
1056
|
+
case 1: {
|
|
1057
|
+
if (tag !== 8) {
|
|
1058
|
+
break;
|
|
1059
|
+
}
|
|
1060
|
+
|
|
1061
|
+
message.Status = reader.int32() as any;
|
|
1062
|
+
continue;
|
|
1063
|
+
}
|
|
1064
|
+
case 2: {
|
|
1065
|
+
if (tag !== 18) {
|
|
1066
|
+
break;
|
|
1067
|
+
}
|
|
1068
|
+
|
|
1069
|
+
message.Occurred = SerializableDateTimeOffset.decode(reader, reader.uint32());
|
|
1070
|
+
continue;
|
|
1071
|
+
}
|
|
1072
|
+
case 3: {
|
|
1073
|
+
if (tag !== 26) {
|
|
1074
|
+
break;
|
|
1075
|
+
}
|
|
1076
|
+
|
|
1077
|
+
message.ExceptionMessages.push(reader.string());
|
|
1078
|
+
continue;
|
|
1079
|
+
}
|
|
1080
|
+
case 4: {
|
|
1081
|
+
if (tag !== 34) {
|
|
1082
|
+
break;
|
|
1083
|
+
}
|
|
1084
|
+
|
|
1085
|
+
message.ExceptionStackTrace = reader.string();
|
|
1086
|
+
continue;
|
|
1087
|
+
}
|
|
1088
|
+
}
|
|
1089
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1090
|
+
break;
|
|
1091
|
+
}
|
|
1092
|
+
reader.skip(tag & 7);
|
|
1028
1093
|
}
|
|
1029
|
-
|
|
1030
|
-
|
|
1031
|
-
|
|
1032
|
-
reader.skip(tag & 7);
|
|
1094
|
+
return message;
|
|
1095
|
+
} finally {
|
|
1096
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1033
1097
|
}
|
|
1034
|
-
return message;
|
|
1035
1098
|
},
|
|
1036
1099
|
|
|
1037
1100
|
fromJSON(object: any): JobStatusChanged {
|
|
@@ -1094,34 +1157,43 @@ export const JobStepProgress: MessageFns<JobStepProgress> = {
|
|
|
1094
1157
|
|
|
1095
1158
|
decode(input: BinaryReader | Uint8Array, length?: number): JobStepProgress {
|
|
1096
1159
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1097
|
-
const
|
|
1098
|
-
|
|
1099
|
-
|
|
1100
|
-
|
|
1101
|
-
|
|
1102
|
-
|
|
1103
|
-
|
|
1104
|
-
|
|
1105
|
-
|
|
1106
|
-
|
|
1107
|
-
|
|
1108
|
-
|
|
1109
|
-
|
|
1110
|
-
|
|
1111
|
-
|
|
1112
|
-
|
|
1113
|
-
|
|
1114
|
-
|
|
1115
|
-
|
|
1116
|
-
|
|
1117
|
-
|
|
1118
|
-
|
|
1119
|
-
|
|
1120
|
-
|
|
1160
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
1161
|
+
if (previousRecursionDepth >= 100) {
|
|
1162
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1163
|
+
}
|
|
1164
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1165
|
+
try {
|
|
1166
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1167
|
+
const message = createBaseJobStepProgress();
|
|
1168
|
+
while (reader.pos < end) {
|
|
1169
|
+
const tag = reader.uint32();
|
|
1170
|
+
switch (tag >>> 3) {
|
|
1171
|
+
case 1: {
|
|
1172
|
+
if (tag !== 8) {
|
|
1173
|
+
break;
|
|
1174
|
+
}
|
|
1175
|
+
|
|
1176
|
+
message.Percentage = reader.int32();
|
|
1177
|
+
continue;
|
|
1178
|
+
}
|
|
1179
|
+
case 2: {
|
|
1180
|
+
if (tag !== 18) {
|
|
1181
|
+
break;
|
|
1182
|
+
}
|
|
1183
|
+
|
|
1184
|
+
message.Message = reader.string();
|
|
1185
|
+
continue;
|
|
1186
|
+
}
|
|
1187
|
+
}
|
|
1188
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1189
|
+
break;
|
|
1190
|
+
}
|
|
1191
|
+
reader.skip(tag & 7);
|
|
1121
1192
|
}
|
|
1122
|
-
|
|
1193
|
+
return message;
|
|
1194
|
+
} finally {
|
|
1195
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1123
1196
|
}
|
|
1124
|
-
return message;
|
|
1125
1197
|
},
|
|
1126
1198
|
|
|
1127
1199
|
fromJSON(object: any): JobStepProgress {
|
|
@@ -1176,50 +1248,59 @@ export const JobStepStatusChanged: MessageFns<JobStepStatusChanged> = {
|
|
|
1176
1248
|
|
|
1177
1249
|
decode(input: BinaryReader | Uint8Array, length?: number): JobStepStatusChanged {
|
|
1178
1250
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1179
|
-
const
|
|
1180
|
-
|
|
1181
|
-
|
|
1182
|
-
|
|
1183
|
-
|
|
1184
|
-
|
|
1185
|
-
|
|
1186
|
-
|
|
1187
|
-
|
|
1188
|
-
|
|
1189
|
-
|
|
1190
|
-
|
|
1191
|
-
|
|
1192
|
-
|
|
1193
|
-
|
|
1194
|
-
|
|
1195
|
-
|
|
1196
|
-
|
|
1197
|
-
|
|
1198
|
-
|
|
1199
|
-
|
|
1200
|
-
|
|
1201
|
-
|
|
1202
|
-
|
|
1203
|
-
|
|
1204
|
-
|
|
1205
|
-
|
|
1206
|
-
|
|
1207
|
-
|
|
1208
|
-
|
|
1209
|
-
|
|
1210
|
-
|
|
1211
|
-
|
|
1212
|
-
|
|
1213
|
-
|
|
1214
|
-
|
|
1215
|
-
|
|
1251
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
1252
|
+
if (previousRecursionDepth >= 100) {
|
|
1253
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1254
|
+
}
|
|
1255
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1256
|
+
try {
|
|
1257
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1258
|
+
const message = createBaseJobStepStatusChanged();
|
|
1259
|
+
while (reader.pos < end) {
|
|
1260
|
+
const tag = reader.uint32();
|
|
1261
|
+
switch (tag >>> 3) {
|
|
1262
|
+
case 1: {
|
|
1263
|
+
if (tag !== 8) {
|
|
1264
|
+
break;
|
|
1265
|
+
}
|
|
1266
|
+
|
|
1267
|
+
message.Status = reader.int32() as any;
|
|
1268
|
+
continue;
|
|
1269
|
+
}
|
|
1270
|
+
case 2: {
|
|
1271
|
+
if (tag !== 18) {
|
|
1272
|
+
break;
|
|
1273
|
+
}
|
|
1274
|
+
|
|
1275
|
+
message.Occurred = SerializableDateTimeOffset.decode(reader, reader.uint32());
|
|
1276
|
+
continue;
|
|
1277
|
+
}
|
|
1278
|
+
case 3: {
|
|
1279
|
+
if (tag !== 26) {
|
|
1280
|
+
break;
|
|
1281
|
+
}
|
|
1282
|
+
|
|
1283
|
+
message.ExceptionMessages.push(reader.string());
|
|
1284
|
+
continue;
|
|
1285
|
+
}
|
|
1286
|
+
case 4: {
|
|
1287
|
+
if (tag !== 34) {
|
|
1288
|
+
break;
|
|
1289
|
+
}
|
|
1290
|
+
|
|
1291
|
+
message.ExceptionStackTrace = reader.string();
|
|
1292
|
+
continue;
|
|
1293
|
+
}
|
|
1294
|
+
}
|
|
1295
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1296
|
+
break;
|
|
1297
|
+
}
|
|
1298
|
+
reader.skip(tag & 7);
|
|
1216
1299
|
}
|
|
1217
|
-
|
|
1218
|
-
|
|
1219
|
-
|
|
1220
|
-
reader.skip(tag & 7);
|
|
1300
|
+
return message;
|
|
1301
|
+
} finally {
|
|
1302
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1221
1303
|
}
|
|
1222
|
-
return message;
|
|
1223
1304
|
},
|
|
1224
1305
|
|
|
1225
1306
|
fromJSON(object: any): JobStepStatusChanged {
|
|
@@ -1294,66 +1375,75 @@ export const JobStepSummaryResponse: MessageFns<JobStepSummaryResponse> = {
|
|
|
1294
1375
|
|
|
1295
1376
|
decode(input: BinaryReader | Uint8Array, length?: number): JobStepSummaryResponse {
|
|
1296
1377
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1297
|
-
const
|
|
1298
|
-
|
|
1299
|
-
|
|
1300
|
-
|
|
1301
|
-
|
|
1302
|
-
|
|
1303
|
-
|
|
1304
|
-
|
|
1305
|
-
|
|
1306
|
-
|
|
1307
|
-
|
|
1308
|
-
|
|
1309
|
-
|
|
1310
|
-
|
|
1311
|
-
|
|
1312
|
-
|
|
1313
|
-
|
|
1314
|
-
|
|
1315
|
-
|
|
1316
|
-
|
|
1317
|
-
|
|
1318
|
-
|
|
1319
|
-
|
|
1320
|
-
|
|
1321
|
-
|
|
1322
|
-
|
|
1323
|
-
|
|
1324
|
-
|
|
1325
|
-
|
|
1326
|
-
|
|
1327
|
-
|
|
1328
|
-
|
|
1329
|
-
|
|
1330
|
-
|
|
1331
|
-
|
|
1332
|
-
|
|
1333
|
-
|
|
1334
|
-
|
|
1335
|
-
|
|
1336
|
-
|
|
1337
|
-
|
|
1338
|
-
|
|
1339
|
-
|
|
1340
|
-
|
|
1341
|
-
|
|
1342
|
-
|
|
1343
|
-
|
|
1344
|
-
|
|
1345
|
-
|
|
1346
|
-
|
|
1347
|
-
|
|
1348
|
-
|
|
1349
|
-
|
|
1378
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
1379
|
+
if (previousRecursionDepth >= 100) {
|
|
1380
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1381
|
+
}
|
|
1382
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1383
|
+
try {
|
|
1384
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1385
|
+
const message = createBaseJobStepSummaryResponse();
|
|
1386
|
+
while (reader.pos < end) {
|
|
1387
|
+
const tag = reader.uint32();
|
|
1388
|
+
switch (tag >>> 3) {
|
|
1389
|
+
case 1: {
|
|
1390
|
+
if (tag !== 10) {
|
|
1391
|
+
break;
|
|
1392
|
+
}
|
|
1393
|
+
|
|
1394
|
+
message.Id = Guid.decode(reader, reader.uint32());
|
|
1395
|
+
continue;
|
|
1396
|
+
}
|
|
1397
|
+
case 2: {
|
|
1398
|
+
if (tag !== 18) {
|
|
1399
|
+
break;
|
|
1400
|
+
}
|
|
1401
|
+
|
|
1402
|
+
message.Type = reader.string();
|
|
1403
|
+
continue;
|
|
1404
|
+
}
|
|
1405
|
+
case 3: {
|
|
1406
|
+
if (tag !== 26) {
|
|
1407
|
+
break;
|
|
1408
|
+
}
|
|
1409
|
+
|
|
1410
|
+
message.Name = reader.string();
|
|
1411
|
+
continue;
|
|
1412
|
+
}
|
|
1413
|
+
case 4: {
|
|
1414
|
+
if (tag !== 32) {
|
|
1415
|
+
break;
|
|
1416
|
+
}
|
|
1417
|
+
|
|
1418
|
+
message.Status = reader.int32() as any;
|
|
1419
|
+
continue;
|
|
1420
|
+
}
|
|
1421
|
+
case 5: {
|
|
1422
|
+
if (tag !== 42) {
|
|
1423
|
+
break;
|
|
1424
|
+
}
|
|
1425
|
+
|
|
1426
|
+
message.StatusChanges.push(JobStepStatusChanged.decode(reader, reader.uint32()));
|
|
1427
|
+
continue;
|
|
1428
|
+
}
|
|
1429
|
+
case 6: {
|
|
1430
|
+
if (tag !== 50) {
|
|
1431
|
+
break;
|
|
1432
|
+
}
|
|
1433
|
+
|
|
1434
|
+
message.Progress = JobStepProgress.decode(reader, reader.uint32());
|
|
1435
|
+
continue;
|
|
1436
|
+
}
|
|
1437
|
+
}
|
|
1438
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1439
|
+
break;
|
|
1440
|
+
}
|
|
1441
|
+
reader.skip(tag & 7);
|
|
1350
1442
|
}
|
|
1351
|
-
|
|
1352
|
-
|
|
1353
|
-
|
|
1354
|
-
reader.skip(tag & 7);
|
|
1443
|
+
return message;
|
|
1444
|
+
} finally {
|
|
1445
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1355
1446
|
}
|
|
1356
|
-
return message;
|
|
1357
1447
|
},
|
|
1358
1448
|
|
|
1359
1449
|
fromJSON(object: any): JobStepSummaryResponse {
|
|
@@ -1449,74 +1539,83 @@ export const JobSummaryResponse: MessageFns<JobSummaryResponse> = {
|
|
|
1449
1539
|
|
|
1450
1540
|
decode(input: BinaryReader | Uint8Array, length?: number): JobSummaryResponse {
|
|
1451
1541
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1452
|
-
const
|
|
1453
|
-
|
|
1454
|
-
|
|
1455
|
-
|
|
1456
|
-
|
|
1457
|
-
|
|
1458
|
-
|
|
1459
|
-
|
|
1460
|
-
|
|
1461
|
-
|
|
1462
|
-
|
|
1463
|
-
|
|
1464
|
-
|
|
1465
|
-
|
|
1466
|
-
|
|
1467
|
-
|
|
1468
|
-
|
|
1469
|
-
|
|
1470
|
-
|
|
1471
|
-
|
|
1472
|
-
|
|
1473
|
-
|
|
1474
|
-
|
|
1475
|
-
|
|
1476
|
-
|
|
1477
|
-
|
|
1478
|
-
|
|
1479
|
-
|
|
1480
|
-
|
|
1481
|
-
|
|
1482
|
-
|
|
1483
|
-
|
|
1484
|
-
|
|
1485
|
-
|
|
1486
|
-
|
|
1487
|
-
|
|
1488
|
-
|
|
1489
|
-
|
|
1490
|
-
|
|
1491
|
-
|
|
1492
|
-
|
|
1493
|
-
|
|
1494
|
-
|
|
1495
|
-
|
|
1496
|
-
|
|
1497
|
-
|
|
1498
|
-
|
|
1499
|
-
|
|
1500
|
-
|
|
1501
|
-
|
|
1502
|
-
|
|
1503
|
-
|
|
1504
|
-
|
|
1505
|
-
|
|
1506
|
-
|
|
1507
|
-
|
|
1508
|
-
|
|
1509
|
-
|
|
1510
|
-
|
|
1511
|
-
|
|
1512
|
-
|
|
1513
|
-
|
|
1514
|
-
|
|
1515
|
-
|
|
1542
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
1543
|
+
if (previousRecursionDepth >= 100) {
|
|
1544
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1545
|
+
}
|
|
1546
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1547
|
+
try {
|
|
1548
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1549
|
+
const message = createBaseJobSummaryResponse();
|
|
1550
|
+
while (reader.pos < end) {
|
|
1551
|
+
const tag = reader.uint32();
|
|
1552
|
+
switch (tag >>> 3) {
|
|
1553
|
+
case 1: {
|
|
1554
|
+
if (tag !== 10) {
|
|
1555
|
+
break;
|
|
1556
|
+
}
|
|
1557
|
+
|
|
1558
|
+
message.Id = Guid.decode(reader, reader.uint32());
|
|
1559
|
+
continue;
|
|
1560
|
+
}
|
|
1561
|
+
case 2: {
|
|
1562
|
+
if (tag !== 18) {
|
|
1563
|
+
break;
|
|
1564
|
+
}
|
|
1565
|
+
|
|
1566
|
+
message.Details = reader.string();
|
|
1567
|
+
continue;
|
|
1568
|
+
}
|
|
1569
|
+
case 3: {
|
|
1570
|
+
if (tag !== 26) {
|
|
1571
|
+
break;
|
|
1572
|
+
}
|
|
1573
|
+
|
|
1574
|
+
message.Type = reader.string();
|
|
1575
|
+
continue;
|
|
1576
|
+
}
|
|
1577
|
+
case 4: {
|
|
1578
|
+
if (tag !== 32) {
|
|
1579
|
+
break;
|
|
1580
|
+
}
|
|
1581
|
+
|
|
1582
|
+
message.Status = reader.int32() as any;
|
|
1583
|
+
continue;
|
|
1584
|
+
}
|
|
1585
|
+
case 5: {
|
|
1586
|
+
if (tag !== 42) {
|
|
1587
|
+
break;
|
|
1588
|
+
}
|
|
1589
|
+
|
|
1590
|
+
message.Created = DateTimeOffset.decode(reader, reader.uint32());
|
|
1591
|
+
continue;
|
|
1592
|
+
}
|
|
1593
|
+
case 6: {
|
|
1594
|
+
if (tag !== 50) {
|
|
1595
|
+
break;
|
|
1596
|
+
}
|
|
1597
|
+
|
|
1598
|
+
message.StatusChanges.push(JobStatusChanged.decode(reader, reader.uint32()));
|
|
1599
|
+
continue;
|
|
1600
|
+
}
|
|
1601
|
+
case 7: {
|
|
1602
|
+
if (tag !== 58) {
|
|
1603
|
+
break;
|
|
1604
|
+
}
|
|
1605
|
+
|
|
1606
|
+
message.Progress = JobProgress.decode(reader, reader.uint32());
|
|
1607
|
+
continue;
|
|
1608
|
+
}
|
|
1609
|
+
}
|
|
1610
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1611
|
+
break;
|
|
1612
|
+
}
|
|
1613
|
+
reader.skip(tag & 7);
|
|
1516
1614
|
}
|
|
1517
|
-
|
|
1615
|
+
return message;
|
|
1616
|
+
} finally {
|
|
1617
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1518
1618
|
}
|
|
1519
|
-
return message;
|
|
1520
1619
|
},
|
|
1521
1620
|
|
|
1522
1621
|
fromJSON(object: any): JobSummaryResponse {
|
|
@@ -1618,66 +1717,75 @@ export const QueryResultIEnumerableJobStepSummaryResponse: MessageFns<QueryResul
|
|
|
1618
1717
|
|
|
1619
1718
|
decode(input: BinaryReader | Uint8Array, length?: number): QueryResultIEnumerableJobStepSummaryResponse {
|
|
1620
1719
|
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
|
-
|
|
1650
|
-
|
|
1651
|
-
|
|
1652
|
-
|
|
1653
|
-
|
|
1654
|
-
|
|
1655
|
-
|
|
1656
|
-
|
|
1657
|
-
|
|
1658
|
-
|
|
1659
|
-
|
|
1660
|
-
|
|
1661
|
-
|
|
1662
|
-
|
|
1663
|
-
|
|
1664
|
-
|
|
1665
|
-
|
|
1666
|
-
|
|
1667
|
-
|
|
1668
|
-
|
|
1669
|
-
|
|
1670
|
-
|
|
1671
|
-
|
|
1672
|
-
|
|
1673
|
-
|
|
1720
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
1721
|
+
if (previousRecursionDepth >= 100) {
|
|
1722
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1723
|
+
}
|
|
1724
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1725
|
+
try {
|
|
1726
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1727
|
+
const message = createBaseQueryResultIEnumerableJobStepSummaryResponse();
|
|
1728
|
+
while (reader.pos < end) {
|
|
1729
|
+
const tag = reader.uint32();
|
|
1730
|
+
switch (tag >>> 3) {
|
|
1731
|
+
case 1: {
|
|
1732
|
+
if (tag !== 10) {
|
|
1733
|
+
break;
|
|
1734
|
+
}
|
|
1735
|
+
|
|
1736
|
+
message.CorrelationId = Guid.decode(reader, reader.uint32());
|
|
1737
|
+
continue;
|
|
1738
|
+
}
|
|
1739
|
+
case 2: {
|
|
1740
|
+
if (tag !== 16) {
|
|
1741
|
+
break;
|
|
1742
|
+
}
|
|
1743
|
+
|
|
1744
|
+
message.IsAuthorized = reader.bool();
|
|
1745
|
+
continue;
|
|
1746
|
+
}
|
|
1747
|
+
case 3: {
|
|
1748
|
+
if (tag !== 26) {
|
|
1749
|
+
break;
|
|
1750
|
+
}
|
|
1751
|
+
|
|
1752
|
+
message.ValidationResults.push(ValidationResult.decode(reader, reader.uint32()));
|
|
1753
|
+
continue;
|
|
1754
|
+
}
|
|
1755
|
+
case 4: {
|
|
1756
|
+
if (tag !== 34) {
|
|
1757
|
+
break;
|
|
1758
|
+
}
|
|
1759
|
+
|
|
1760
|
+
message.ExceptionMessages.push(reader.string());
|
|
1761
|
+
continue;
|
|
1762
|
+
}
|
|
1763
|
+
case 5: {
|
|
1764
|
+
if (tag !== 42) {
|
|
1765
|
+
break;
|
|
1766
|
+
}
|
|
1767
|
+
|
|
1768
|
+
message.ExceptionStackTrace = reader.string();
|
|
1769
|
+
continue;
|
|
1770
|
+
}
|
|
1771
|
+
case 6: {
|
|
1772
|
+
if (tag !== 50) {
|
|
1773
|
+
break;
|
|
1774
|
+
}
|
|
1775
|
+
|
|
1776
|
+
message.Data.push(JobStepSummaryResponse.decode(reader, reader.uint32()));
|
|
1777
|
+
continue;
|
|
1778
|
+
}
|
|
1779
|
+
}
|
|
1780
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1781
|
+
break;
|
|
1782
|
+
}
|
|
1783
|
+
reader.skip(tag & 7);
|
|
1674
1784
|
}
|
|
1675
|
-
|
|
1676
|
-
|
|
1677
|
-
|
|
1678
|
-
reader.skip(tag & 7);
|
|
1785
|
+
return message;
|
|
1786
|
+
} finally {
|
|
1787
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1679
1788
|
}
|
|
1680
|
-
return message;
|
|
1681
1789
|
},
|
|
1682
1790
|
|
|
1683
1791
|
fromJSON(object: any): QueryResultIEnumerableJobStepSummaryResponse {
|
|
@@ -1777,66 +1885,75 @@ export const QueryResultIEnumerableJobSummaryResponse: MessageFns<QueryResultIEn
|
|
|
1777
1885
|
|
|
1778
1886
|
decode(input: BinaryReader | Uint8Array, length?: number): QueryResultIEnumerableJobSummaryResponse {
|
|
1779
1887
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1780
|
-
const
|
|
1781
|
-
|
|
1782
|
-
|
|
1783
|
-
|
|
1784
|
-
|
|
1785
|
-
|
|
1786
|
-
|
|
1787
|
-
|
|
1788
|
-
|
|
1789
|
-
|
|
1790
|
-
|
|
1791
|
-
|
|
1792
|
-
|
|
1793
|
-
|
|
1794
|
-
|
|
1795
|
-
|
|
1796
|
-
|
|
1797
|
-
|
|
1798
|
-
|
|
1799
|
-
|
|
1800
|
-
|
|
1801
|
-
|
|
1802
|
-
|
|
1803
|
-
|
|
1804
|
-
|
|
1805
|
-
|
|
1806
|
-
|
|
1807
|
-
|
|
1808
|
-
|
|
1809
|
-
|
|
1810
|
-
|
|
1811
|
-
|
|
1812
|
-
|
|
1813
|
-
|
|
1814
|
-
|
|
1815
|
-
|
|
1816
|
-
|
|
1817
|
-
|
|
1818
|
-
|
|
1819
|
-
|
|
1820
|
-
|
|
1821
|
-
|
|
1822
|
-
|
|
1823
|
-
|
|
1824
|
-
|
|
1825
|
-
|
|
1826
|
-
|
|
1827
|
-
|
|
1828
|
-
|
|
1829
|
-
|
|
1830
|
-
|
|
1831
|
-
|
|
1832
|
-
|
|
1888
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
1889
|
+
if (previousRecursionDepth >= 100) {
|
|
1890
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1891
|
+
}
|
|
1892
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1893
|
+
try {
|
|
1894
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1895
|
+
const message = createBaseQueryResultIEnumerableJobSummaryResponse();
|
|
1896
|
+
while (reader.pos < end) {
|
|
1897
|
+
const tag = reader.uint32();
|
|
1898
|
+
switch (tag >>> 3) {
|
|
1899
|
+
case 1: {
|
|
1900
|
+
if (tag !== 10) {
|
|
1901
|
+
break;
|
|
1902
|
+
}
|
|
1903
|
+
|
|
1904
|
+
message.CorrelationId = Guid.decode(reader, reader.uint32());
|
|
1905
|
+
continue;
|
|
1906
|
+
}
|
|
1907
|
+
case 2: {
|
|
1908
|
+
if (tag !== 16) {
|
|
1909
|
+
break;
|
|
1910
|
+
}
|
|
1911
|
+
|
|
1912
|
+
message.IsAuthorized = reader.bool();
|
|
1913
|
+
continue;
|
|
1914
|
+
}
|
|
1915
|
+
case 3: {
|
|
1916
|
+
if (tag !== 26) {
|
|
1917
|
+
break;
|
|
1918
|
+
}
|
|
1919
|
+
|
|
1920
|
+
message.ValidationResults.push(ValidationResult.decode(reader, reader.uint32()));
|
|
1921
|
+
continue;
|
|
1922
|
+
}
|
|
1923
|
+
case 4: {
|
|
1924
|
+
if (tag !== 34) {
|
|
1925
|
+
break;
|
|
1926
|
+
}
|
|
1927
|
+
|
|
1928
|
+
message.ExceptionMessages.push(reader.string());
|
|
1929
|
+
continue;
|
|
1930
|
+
}
|
|
1931
|
+
case 5: {
|
|
1932
|
+
if (tag !== 42) {
|
|
1933
|
+
break;
|
|
1934
|
+
}
|
|
1935
|
+
|
|
1936
|
+
message.ExceptionStackTrace = reader.string();
|
|
1937
|
+
continue;
|
|
1938
|
+
}
|
|
1939
|
+
case 6: {
|
|
1940
|
+
if (tag !== 50) {
|
|
1941
|
+
break;
|
|
1942
|
+
}
|
|
1943
|
+
|
|
1944
|
+
message.Data.push(JobSummaryResponse.decode(reader, reader.uint32()));
|
|
1945
|
+
continue;
|
|
1946
|
+
}
|
|
1947
|
+
}
|
|
1948
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1949
|
+
break;
|
|
1950
|
+
}
|
|
1951
|
+
reader.skip(tag & 7);
|
|
1833
1952
|
}
|
|
1834
|
-
|
|
1835
|
-
|
|
1836
|
-
|
|
1837
|
-
reader.skip(tag & 7);
|
|
1953
|
+
return message;
|
|
1954
|
+
} finally {
|
|
1955
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1838
1956
|
}
|
|
1839
|
-
return message;
|
|
1840
1957
|
},
|
|
1841
1958
|
|
|
1842
1959
|
fromJSON(object: any): QueryResultIEnumerableJobSummaryResponse {
|
|
@@ -1914,42 +2031,51 @@ export const ResumeJobRequest: MessageFns<ResumeJobRequest> = {
|
|
|
1914
2031
|
|
|
1915
2032
|
decode(input: BinaryReader | Uint8Array, length?: number): ResumeJobRequest {
|
|
1916
2033
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1917
|
-
const
|
|
1918
|
-
|
|
1919
|
-
|
|
1920
|
-
|
|
1921
|
-
|
|
1922
|
-
|
|
1923
|
-
|
|
1924
|
-
|
|
1925
|
-
|
|
1926
|
-
|
|
1927
|
-
|
|
1928
|
-
|
|
1929
|
-
|
|
1930
|
-
|
|
1931
|
-
|
|
1932
|
-
|
|
1933
|
-
|
|
1934
|
-
|
|
1935
|
-
|
|
1936
|
-
|
|
1937
|
-
|
|
1938
|
-
|
|
1939
|
-
|
|
1940
|
-
|
|
1941
|
-
|
|
1942
|
-
|
|
1943
|
-
|
|
1944
|
-
|
|
1945
|
-
|
|
1946
|
-
|
|
1947
|
-
|
|
1948
|
-
|
|
2034
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
2035
|
+
if (previousRecursionDepth >= 100) {
|
|
2036
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2037
|
+
}
|
|
2038
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2039
|
+
try {
|
|
2040
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2041
|
+
const message = createBaseResumeJobRequest();
|
|
2042
|
+
while (reader.pos < end) {
|
|
2043
|
+
const tag = reader.uint32();
|
|
2044
|
+
switch (tag >>> 3) {
|
|
2045
|
+
case 1: {
|
|
2046
|
+
if (tag !== 10) {
|
|
2047
|
+
break;
|
|
2048
|
+
}
|
|
2049
|
+
|
|
2050
|
+
message.EventStore = reader.string();
|
|
2051
|
+
continue;
|
|
2052
|
+
}
|
|
2053
|
+
case 2: {
|
|
2054
|
+
if (tag !== 18) {
|
|
2055
|
+
break;
|
|
2056
|
+
}
|
|
2057
|
+
|
|
2058
|
+
message.Namespace = reader.string();
|
|
2059
|
+
continue;
|
|
2060
|
+
}
|
|
2061
|
+
case 3: {
|
|
2062
|
+
if (tag !== 26) {
|
|
2063
|
+
break;
|
|
2064
|
+
}
|
|
2065
|
+
|
|
2066
|
+
message.JobId = Guid.decode(reader, reader.uint32());
|
|
2067
|
+
continue;
|
|
2068
|
+
}
|
|
2069
|
+
}
|
|
2070
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2071
|
+
break;
|
|
2072
|
+
}
|
|
2073
|
+
reader.skip(tag & 7);
|
|
1949
2074
|
}
|
|
1950
|
-
|
|
2075
|
+
return message;
|
|
2076
|
+
} finally {
|
|
2077
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1951
2078
|
}
|
|
1952
|
-
return message;
|
|
1953
2079
|
},
|
|
1954
2080
|
|
|
1955
2081
|
fromJSON(object: any): ResumeJobRequest {
|
|
@@ -2000,26 +2126,35 @@ export const SerializableDateTimeOffset: MessageFns<SerializableDateTimeOffset>
|
|
|
2000
2126
|
|
|
2001
2127
|
decode(input: BinaryReader | Uint8Array, length?: number): SerializableDateTimeOffset {
|
|
2002
2128
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2003
|
-
const
|
|
2004
|
-
|
|
2005
|
-
|
|
2006
|
-
|
|
2007
|
-
|
|
2008
|
-
|
|
2009
|
-
|
|
2010
|
-
|
|
2011
|
-
|
|
2012
|
-
|
|
2013
|
-
|
|
2014
|
-
|
|
2015
|
-
|
|
2016
|
-
|
|
2017
|
-
|
|
2018
|
-
|
|
2129
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
2130
|
+
if (previousRecursionDepth >= 100) {
|
|
2131
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2132
|
+
}
|
|
2133
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2134
|
+
try {
|
|
2135
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2136
|
+
const message = createBaseSerializableDateTimeOffset();
|
|
2137
|
+
while (reader.pos < end) {
|
|
2138
|
+
const tag = reader.uint32();
|
|
2139
|
+
switch (tag >>> 3) {
|
|
2140
|
+
case 1: {
|
|
2141
|
+
if (tag !== 10) {
|
|
2142
|
+
break;
|
|
2143
|
+
}
|
|
2144
|
+
|
|
2145
|
+
message.Value = reader.string();
|
|
2146
|
+
continue;
|
|
2147
|
+
}
|
|
2148
|
+
}
|
|
2149
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2150
|
+
break;
|
|
2151
|
+
}
|
|
2152
|
+
reader.skip(tag & 7);
|
|
2019
2153
|
}
|
|
2020
|
-
|
|
2154
|
+
return message;
|
|
2155
|
+
} finally {
|
|
2156
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2021
2157
|
}
|
|
2022
|
-
return message;
|
|
2023
2158
|
},
|
|
2024
2159
|
|
|
2025
2160
|
fromJSON(object: any): SerializableDateTimeOffset {
|
|
@@ -2064,42 +2199,51 @@ export const StopJobRequest: MessageFns<StopJobRequest> = {
|
|
|
2064
2199
|
|
|
2065
2200
|
decode(input: BinaryReader | Uint8Array, length?: number): StopJobRequest {
|
|
2066
2201
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2067
|
-
const
|
|
2068
|
-
|
|
2069
|
-
|
|
2070
|
-
|
|
2071
|
-
|
|
2072
|
-
|
|
2073
|
-
|
|
2074
|
-
|
|
2075
|
-
|
|
2076
|
-
|
|
2077
|
-
|
|
2078
|
-
|
|
2079
|
-
|
|
2080
|
-
|
|
2081
|
-
|
|
2082
|
-
|
|
2083
|
-
|
|
2084
|
-
|
|
2085
|
-
|
|
2086
|
-
|
|
2087
|
-
|
|
2088
|
-
|
|
2089
|
-
|
|
2090
|
-
|
|
2091
|
-
|
|
2092
|
-
|
|
2093
|
-
|
|
2094
|
-
|
|
2095
|
-
|
|
2096
|
-
|
|
2097
|
-
|
|
2098
|
-
|
|
2202
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
2203
|
+
if (previousRecursionDepth >= 100) {
|
|
2204
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2205
|
+
}
|
|
2206
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2207
|
+
try {
|
|
2208
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2209
|
+
const message = createBaseStopJobRequest();
|
|
2210
|
+
while (reader.pos < end) {
|
|
2211
|
+
const tag = reader.uint32();
|
|
2212
|
+
switch (tag >>> 3) {
|
|
2213
|
+
case 1: {
|
|
2214
|
+
if (tag !== 10) {
|
|
2215
|
+
break;
|
|
2216
|
+
}
|
|
2217
|
+
|
|
2218
|
+
message.EventStore = reader.string();
|
|
2219
|
+
continue;
|
|
2220
|
+
}
|
|
2221
|
+
case 2: {
|
|
2222
|
+
if (tag !== 18) {
|
|
2223
|
+
break;
|
|
2224
|
+
}
|
|
2225
|
+
|
|
2226
|
+
message.Namespace = reader.string();
|
|
2227
|
+
continue;
|
|
2228
|
+
}
|
|
2229
|
+
case 3: {
|
|
2230
|
+
if (tag !== 26) {
|
|
2231
|
+
break;
|
|
2232
|
+
}
|
|
2233
|
+
|
|
2234
|
+
message.JobId = Guid.decode(reader, reader.uint32());
|
|
2235
|
+
continue;
|
|
2236
|
+
}
|
|
2237
|
+
}
|
|
2238
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2239
|
+
break;
|
|
2240
|
+
}
|
|
2241
|
+
reader.skip(tag & 7);
|
|
2099
2242
|
}
|
|
2100
|
-
|
|
2243
|
+
return message;
|
|
2244
|
+
} finally {
|
|
2245
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2101
2246
|
}
|
|
2102
|
-
return message;
|
|
2103
2247
|
},
|
|
2104
2248
|
|
|
2105
2249
|
fromJSON(object: any): StopJobRequest {
|
|
@@ -2156,42 +2300,51 @@ export const ValidationResult: MessageFns<ValidationResult> = {
|
|
|
2156
2300
|
|
|
2157
2301
|
decode(input: BinaryReader | Uint8Array, length?: number): ValidationResult {
|
|
2158
2302
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2159
|
-
const
|
|
2160
|
-
|
|
2161
|
-
|
|
2162
|
-
|
|
2163
|
-
|
|
2164
|
-
|
|
2165
|
-
|
|
2166
|
-
|
|
2167
|
-
|
|
2168
|
-
|
|
2169
|
-
|
|
2170
|
-
|
|
2171
|
-
|
|
2172
|
-
|
|
2173
|
-
|
|
2174
|
-
|
|
2175
|
-
|
|
2176
|
-
|
|
2177
|
-
|
|
2178
|
-
|
|
2179
|
-
|
|
2180
|
-
|
|
2181
|
-
|
|
2182
|
-
|
|
2183
|
-
|
|
2184
|
-
|
|
2185
|
-
|
|
2186
|
-
|
|
2187
|
-
|
|
2188
|
-
|
|
2189
|
-
|
|
2190
|
-
|
|
2303
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
2304
|
+
if (previousRecursionDepth >= 100) {
|
|
2305
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2306
|
+
}
|
|
2307
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2308
|
+
try {
|
|
2309
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2310
|
+
const message = createBaseValidationResult();
|
|
2311
|
+
while (reader.pos < end) {
|
|
2312
|
+
const tag = reader.uint32();
|
|
2313
|
+
switch (tag >>> 3) {
|
|
2314
|
+
case 1: {
|
|
2315
|
+
if (tag !== 8) {
|
|
2316
|
+
break;
|
|
2317
|
+
}
|
|
2318
|
+
|
|
2319
|
+
message.Severity = reader.int32() as any;
|
|
2320
|
+
continue;
|
|
2321
|
+
}
|
|
2322
|
+
case 2: {
|
|
2323
|
+
if (tag !== 18) {
|
|
2324
|
+
break;
|
|
2325
|
+
}
|
|
2326
|
+
|
|
2327
|
+
message.Message = reader.string();
|
|
2328
|
+
continue;
|
|
2329
|
+
}
|
|
2330
|
+
case 3: {
|
|
2331
|
+
if (tag !== 26) {
|
|
2332
|
+
break;
|
|
2333
|
+
}
|
|
2334
|
+
|
|
2335
|
+
message.Members.push(reader.string());
|
|
2336
|
+
continue;
|
|
2337
|
+
}
|
|
2338
|
+
}
|
|
2339
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2340
|
+
break;
|
|
2341
|
+
}
|
|
2342
|
+
reader.skip(tag & 7);
|
|
2191
2343
|
}
|
|
2192
|
-
|
|
2344
|
+
return message;
|
|
2345
|
+
} finally {
|
|
2346
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2193
2347
|
}
|
|
2194
|
-
return message;
|
|
2195
2348
|
},
|
|
2196
2349
|
|
|
2197
2350
|
fromJSON(object: any): ValidationResult {
|