@miradorlabs/web-grpc 2.32.0 → 2.36.0
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/google/protobuf/timestamp.ts +32 -23
- package/package.json +1 -1
- package/proto/gateway/common/v1/attribute_value.ts +143 -107
- package/proto/gateway/common/v1/status.ts +32 -23
- package/proto/gateway/common/v1/types.ts +32 -23
- package/proto/gateway/web/v1/account_gateway.ts +2608 -1951
- package/proto/gateway/web/v1/attribute_value.ts +143 -107
- package/proto/gateway/web/v1/chain_gateway.ts +1362 -1164
- package/proto/gateway/web/v1/common.ts +1 -1
- package/proto/gateway/web/v1/derived_metric_gateway.ts +933 -743
- package/proto/gateway/web/v1/integration_gateway.ts +1094 -873
- package/proto/gateway/web/v1/log_gateway.ts +593 -452
- package/proto/gateway/web/v1/market_gateway.ts +156 -111
- package/proto/gateway/web/v1/metric_gateway.ts +1842 -1453
- package/proto/gateway/web/v1/oauth_gateway.ts +648 -495
- package/proto/gateway/web/v1/plan_gateway.ts +488 -371
- package/proto/gateway/web/v1/rule_gateway.ts +1997 -1601
- package/proto/gateway/web/v1/rule_gateway_grpc_pb.js +1 -1
- package/proto/gateway/web/v1/slo_gateway.ts +2166 -1765
- package/proto/gateway/web/v1/trace_gateway.ts +2701 -14662
- package/proto/gateway/web/v1/trace_gateway_grpc_pb.js +0 -1
- package/proto/gateway/web/v1/trace_gateway_pb.js +4548 -26949
- package/proto/gateway/web/v1/trace_measure_gateway.ts +278 -214
|
@@ -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 v3.21.12
|
|
5
5
|
// source: proto/gateway/web/v1/plan_gateway.proto
|
|
6
6
|
|
|
@@ -262,26 +262,35 @@ export const GetPlanRequest: MessageFns<GetPlanRequest> = {
|
|
|
262
262
|
|
|
263
263
|
decode(input: BinaryReader | Uint8Array, length?: number): GetPlanRequest {
|
|
264
264
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
265
|
-
const
|
|
266
|
-
|
|
267
|
-
|
|
268
|
-
|
|
269
|
-
|
|
270
|
-
|
|
271
|
-
|
|
272
|
-
|
|
265
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
266
|
+
if (previousRecursionDepth >= 100) {
|
|
267
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
268
|
+
}
|
|
269
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
270
|
+
try {
|
|
271
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
272
|
+
const message = createBaseGetPlanRequest();
|
|
273
|
+
while (reader.pos < end) {
|
|
274
|
+
const tag = reader.uint32();
|
|
275
|
+
switch (tag >>> 3) {
|
|
276
|
+
case 1: {
|
|
277
|
+
if (tag !== 10) {
|
|
278
|
+
break;
|
|
279
|
+
}
|
|
280
|
+
|
|
281
|
+
message.organizationId = reader.string();
|
|
282
|
+
continue;
|
|
273
283
|
}
|
|
274
|
-
|
|
275
|
-
message.organizationId = reader.string();
|
|
276
|
-
continue;
|
|
277
284
|
}
|
|
285
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
286
|
+
break;
|
|
287
|
+
}
|
|
288
|
+
reader.skip(tag & 7);
|
|
278
289
|
}
|
|
279
|
-
|
|
280
|
-
|
|
281
|
-
|
|
282
|
-
reader.skip(tag & 7);
|
|
290
|
+
return message;
|
|
291
|
+
} finally {
|
|
292
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
283
293
|
}
|
|
284
|
-
return message;
|
|
285
294
|
},
|
|
286
295
|
|
|
287
296
|
fromJSON(object: any): GetPlanRequest {
|
|
@@ -332,42 +341,51 @@ export const GetPlanResponse: MessageFns<GetPlanResponse> = {
|
|
|
332
341
|
|
|
333
342
|
decode(input: BinaryReader | Uint8Array, length?: number): GetPlanResponse {
|
|
334
343
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
335
|
-
const
|
|
336
|
-
|
|
337
|
-
|
|
338
|
-
|
|
339
|
-
|
|
340
|
-
|
|
341
|
-
|
|
342
|
-
|
|
344
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
345
|
+
if (previousRecursionDepth >= 100) {
|
|
346
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
347
|
+
}
|
|
348
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
349
|
+
try {
|
|
350
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
351
|
+
const message = createBaseGetPlanResponse();
|
|
352
|
+
while (reader.pos < end) {
|
|
353
|
+
const tag = reader.uint32();
|
|
354
|
+
switch (tag >>> 3) {
|
|
355
|
+
case 1: {
|
|
356
|
+
if (tag !== 10) {
|
|
357
|
+
break;
|
|
358
|
+
}
|
|
359
|
+
|
|
360
|
+
message.status = ResponseStatus.decode(reader, reader.uint32());
|
|
361
|
+
continue;
|
|
343
362
|
}
|
|
363
|
+
case 2: {
|
|
364
|
+
if (tag !== 18) {
|
|
365
|
+
break;
|
|
366
|
+
}
|
|
344
367
|
|
|
345
|
-
|
|
346
|
-
|
|
347
|
-
}
|
|
348
|
-
case 2: {
|
|
349
|
-
if (tag !== 18) {
|
|
350
|
-
break;
|
|
368
|
+
message.plan = Plan.decode(reader, reader.uint32());
|
|
369
|
+
continue;
|
|
351
370
|
}
|
|
371
|
+
case 3: {
|
|
372
|
+
if (tag !== 26) {
|
|
373
|
+
break;
|
|
374
|
+
}
|
|
352
375
|
|
|
353
|
-
|
|
354
|
-
|
|
355
|
-
}
|
|
356
|
-
case 3: {
|
|
357
|
-
if (tag !== 26) {
|
|
358
|
-
break;
|
|
376
|
+
message.payment = PlanPayment.decode(reader, reader.uint32());
|
|
377
|
+
continue;
|
|
359
378
|
}
|
|
360
|
-
|
|
361
|
-
message.payment = PlanPayment.decode(reader, reader.uint32());
|
|
362
|
-
continue;
|
|
363
379
|
}
|
|
380
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
381
|
+
break;
|
|
382
|
+
}
|
|
383
|
+
reader.skip(tag & 7);
|
|
364
384
|
}
|
|
365
|
-
|
|
366
|
-
|
|
367
|
-
|
|
368
|
-
reader.skip(tag & 7);
|
|
385
|
+
return message;
|
|
386
|
+
} finally {
|
|
387
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
369
388
|
}
|
|
370
|
-
return message;
|
|
371
389
|
},
|
|
372
390
|
|
|
373
391
|
fromJSON(object: any): GetPlanResponse {
|
|
@@ -437,66 +455,75 @@ export const Plan: MessageFns<Plan> = {
|
|
|
437
455
|
|
|
438
456
|
decode(input: BinaryReader | Uint8Array, length?: number): Plan {
|
|
439
457
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
440
|
-
const
|
|
441
|
-
|
|
442
|
-
|
|
443
|
-
|
|
444
|
-
|
|
445
|
-
|
|
446
|
-
|
|
447
|
-
|
|
458
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
459
|
+
if (previousRecursionDepth >= 100) {
|
|
460
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
461
|
+
}
|
|
462
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
463
|
+
try {
|
|
464
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
465
|
+
const message = createBasePlan();
|
|
466
|
+
while (reader.pos < end) {
|
|
467
|
+
const tag = reader.uint32();
|
|
468
|
+
switch (tag >>> 3) {
|
|
469
|
+
case 1: {
|
|
470
|
+
if (tag !== 10) {
|
|
471
|
+
break;
|
|
472
|
+
}
|
|
473
|
+
|
|
474
|
+
message.planId = reader.string();
|
|
475
|
+
continue;
|
|
448
476
|
}
|
|
477
|
+
case 2: {
|
|
478
|
+
if (tag !== 18) {
|
|
479
|
+
break;
|
|
480
|
+
}
|
|
449
481
|
|
|
450
|
-
|
|
451
|
-
|
|
452
|
-
}
|
|
453
|
-
case 2: {
|
|
454
|
-
if (tag !== 18) {
|
|
455
|
-
break;
|
|
482
|
+
message.organizationId = reader.string();
|
|
483
|
+
continue;
|
|
456
484
|
}
|
|
485
|
+
case 3: {
|
|
486
|
+
if (tag !== 24) {
|
|
487
|
+
break;
|
|
488
|
+
}
|
|
457
489
|
|
|
458
|
-
|
|
459
|
-
|
|
460
|
-
}
|
|
461
|
-
case 3: {
|
|
462
|
-
if (tag !== 24) {
|
|
463
|
-
break;
|
|
490
|
+
message.tier = reader.int32() as any;
|
|
491
|
+
continue;
|
|
464
492
|
}
|
|
493
|
+
case 4: {
|
|
494
|
+
if (tag !== 32) {
|
|
495
|
+
break;
|
|
496
|
+
}
|
|
465
497
|
|
|
466
|
-
|
|
467
|
-
|
|
468
|
-
}
|
|
469
|
-
case 4: {
|
|
470
|
-
if (tag !== 32) {
|
|
471
|
-
break;
|
|
498
|
+
message.planStatus = reader.int32() as any;
|
|
499
|
+
continue;
|
|
472
500
|
}
|
|
501
|
+
case 5: {
|
|
502
|
+
if (tag !== 42) {
|
|
503
|
+
break;
|
|
504
|
+
}
|
|
473
505
|
|
|
474
|
-
|
|
475
|
-
|
|
476
|
-
}
|
|
477
|
-
case 5: {
|
|
478
|
-
if (tag !== 42) {
|
|
479
|
-
break;
|
|
506
|
+
message.createdAt = fromTimestamp(Timestamp.decode(reader, reader.uint32()));
|
|
507
|
+
continue;
|
|
480
508
|
}
|
|
509
|
+
case 6: {
|
|
510
|
+
if (tag !== 50) {
|
|
511
|
+
break;
|
|
512
|
+
}
|
|
481
513
|
|
|
482
|
-
|
|
483
|
-
|
|
484
|
-
}
|
|
485
|
-
case 6: {
|
|
486
|
-
if (tag !== 50) {
|
|
487
|
-
break;
|
|
514
|
+
message.updatedAt = fromTimestamp(Timestamp.decode(reader, reader.uint32()));
|
|
515
|
+
continue;
|
|
488
516
|
}
|
|
489
|
-
|
|
490
|
-
message.updatedAt = fromTimestamp(Timestamp.decode(reader, reader.uint32()));
|
|
491
|
-
continue;
|
|
492
517
|
}
|
|
518
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
519
|
+
break;
|
|
520
|
+
}
|
|
521
|
+
reader.skip(tag & 7);
|
|
493
522
|
}
|
|
494
|
-
|
|
495
|
-
|
|
496
|
-
|
|
497
|
-
reader.skip(tag & 7);
|
|
523
|
+
return message;
|
|
524
|
+
} finally {
|
|
525
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
498
526
|
}
|
|
499
|
-
return message;
|
|
500
527
|
},
|
|
501
528
|
|
|
502
529
|
fromJSON(object: any): Plan {
|
|
@@ -624,106 +651,115 @@ export const PlanPayment: MessageFns<PlanPayment> = {
|
|
|
624
651
|
|
|
625
652
|
decode(input: BinaryReader | Uint8Array, length?: number): PlanPayment {
|
|
626
653
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
627
|
-
const
|
|
628
|
-
|
|
629
|
-
|
|
630
|
-
|
|
631
|
-
|
|
632
|
-
|
|
633
|
-
|
|
634
|
-
|
|
654
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
655
|
+
if (previousRecursionDepth >= 100) {
|
|
656
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
657
|
+
}
|
|
658
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
659
|
+
try {
|
|
660
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
661
|
+
const message = createBasePlanPayment();
|
|
662
|
+
while (reader.pos < end) {
|
|
663
|
+
const tag = reader.uint32();
|
|
664
|
+
switch (tag >>> 3) {
|
|
665
|
+
case 1: {
|
|
666
|
+
if (tag !== 10) {
|
|
667
|
+
break;
|
|
668
|
+
}
|
|
669
|
+
|
|
670
|
+
message.paymentId = reader.string();
|
|
671
|
+
continue;
|
|
635
672
|
}
|
|
673
|
+
case 2: {
|
|
674
|
+
if (tag !== 18) {
|
|
675
|
+
break;
|
|
676
|
+
}
|
|
636
677
|
|
|
637
|
-
|
|
638
|
-
|
|
639
|
-
}
|
|
640
|
-
case 2: {
|
|
641
|
-
if (tag !== 18) {
|
|
642
|
-
break;
|
|
678
|
+
message.planId = reader.string();
|
|
679
|
+
continue;
|
|
643
680
|
}
|
|
681
|
+
case 3: {
|
|
682
|
+
if (tag !== 26) {
|
|
683
|
+
break;
|
|
684
|
+
}
|
|
644
685
|
|
|
645
|
-
|
|
646
|
-
|
|
647
|
-
}
|
|
648
|
-
case 3: {
|
|
649
|
-
if (tag !== 26) {
|
|
650
|
-
break;
|
|
686
|
+
message.stripeSubscriptionId = reader.string();
|
|
687
|
+
continue;
|
|
651
688
|
}
|
|
689
|
+
case 4: {
|
|
690
|
+
if (tag !== 34) {
|
|
691
|
+
break;
|
|
692
|
+
}
|
|
652
693
|
|
|
653
|
-
|
|
654
|
-
|
|
655
|
-
}
|
|
656
|
-
case 4: {
|
|
657
|
-
if (tag !== 34) {
|
|
658
|
-
break;
|
|
694
|
+
message.stripeCustomerId = reader.string();
|
|
695
|
+
continue;
|
|
659
696
|
}
|
|
697
|
+
case 5: {
|
|
698
|
+
if (tag !== 40) {
|
|
699
|
+
break;
|
|
700
|
+
}
|
|
660
701
|
|
|
661
|
-
|
|
662
|
-
|
|
663
|
-
}
|
|
664
|
-
case 5: {
|
|
665
|
-
if (tag !== 40) {
|
|
666
|
-
break;
|
|
702
|
+
message.paymentStatus = reader.int32() as any;
|
|
703
|
+
continue;
|
|
667
704
|
}
|
|
705
|
+
case 6: {
|
|
706
|
+
if (tag !== 50) {
|
|
707
|
+
break;
|
|
708
|
+
}
|
|
668
709
|
|
|
669
|
-
|
|
670
|
-
|
|
671
|
-
}
|
|
672
|
-
case 6: {
|
|
673
|
-
if (tag !== 50) {
|
|
674
|
-
break;
|
|
710
|
+
message.billingPeriodStart = fromTimestamp(Timestamp.decode(reader, reader.uint32()));
|
|
711
|
+
continue;
|
|
675
712
|
}
|
|
713
|
+
case 7: {
|
|
714
|
+
if (tag !== 58) {
|
|
715
|
+
break;
|
|
716
|
+
}
|
|
676
717
|
|
|
677
|
-
|
|
678
|
-
|
|
679
|
-
}
|
|
680
|
-
case 7: {
|
|
681
|
-
if (tag !== 58) {
|
|
682
|
-
break;
|
|
718
|
+
message.billingPeriodEnd = fromTimestamp(Timestamp.decode(reader, reader.uint32()));
|
|
719
|
+
continue;
|
|
683
720
|
}
|
|
721
|
+
case 8: {
|
|
722
|
+
if (tag !== 66) {
|
|
723
|
+
break;
|
|
724
|
+
}
|
|
684
725
|
|
|
685
|
-
|
|
686
|
-
|
|
687
|
-
}
|
|
688
|
-
case 8: {
|
|
689
|
-
if (tag !== 66) {
|
|
690
|
-
break;
|
|
726
|
+
message.createdAt = fromTimestamp(Timestamp.decode(reader, reader.uint32()));
|
|
727
|
+
continue;
|
|
691
728
|
}
|
|
729
|
+
case 9: {
|
|
730
|
+
if (tag !== 74) {
|
|
731
|
+
break;
|
|
732
|
+
}
|
|
692
733
|
|
|
693
|
-
|
|
694
|
-
|
|
695
|
-
}
|
|
696
|
-
case 9: {
|
|
697
|
-
if (tag !== 74) {
|
|
698
|
-
break;
|
|
734
|
+
message.updatedAt = fromTimestamp(Timestamp.decode(reader, reader.uint32()));
|
|
735
|
+
continue;
|
|
699
736
|
}
|
|
737
|
+
case 10: {
|
|
738
|
+
if (tag !== 80) {
|
|
739
|
+
break;
|
|
740
|
+
}
|
|
700
741
|
|
|
701
|
-
|
|
702
|
-
|
|
703
|
-
}
|
|
704
|
-
case 10: {
|
|
705
|
-
if (tag !== 80) {
|
|
706
|
-
break;
|
|
742
|
+
message.cancelAtPeriodEnd = reader.bool();
|
|
743
|
+
continue;
|
|
707
744
|
}
|
|
745
|
+
case 11: {
|
|
746
|
+
if (tag !== 90) {
|
|
747
|
+
break;
|
|
748
|
+
}
|
|
708
749
|
|
|
709
|
-
|
|
710
|
-
|
|
711
|
-
}
|
|
712
|
-
case 11: {
|
|
713
|
-
if (tag !== 90) {
|
|
714
|
-
break;
|
|
750
|
+
message.cancelAt = fromTimestamp(Timestamp.decode(reader, reader.uint32()));
|
|
751
|
+
continue;
|
|
715
752
|
}
|
|
716
|
-
|
|
717
|
-
message.cancelAt = fromTimestamp(Timestamp.decode(reader, reader.uint32()));
|
|
718
|
-
continue;
|
|
719
753
|
}
|
|
754
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
755
|
+
break;
|
|
756
|
+
}
|
|
757
|
+
reader.skip(tag & 7);
|
|
720
758
|
}
|
|
721
|
-
|
|
722
|
-
|
|
723
|
-
|
|
724
|
-
reader.skip(tag & 7);
|
|
759
|
+
return message;
|
|
760
|
+
} finally {
|
|
761
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
725
762
|
}
|
|
726
|
-
return message;
|
|
727
763
|
},
|
|
728
764
|
|
|
729
765
|
fromJSON(object: any): PlanPayment {
|
|
@@ -858,26 +894,35 @@ export const StreamPlanUpdatesRequest: MessageFns<StreamPlanUpdatesRequest> = {
|
|
|
858
894
|
|
|
859
895
|
decode(input: BinaryReader | Uint8Array, length?: number): StreamPlanUpdatesRequest {
|
|
860
896
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
861
|
-
const
|
|
862
|
-
|
|
863
|
-
|
|
864
|
-
|
|
865
|
-
|
|
866
|
-
|
|
867
|
-
|
|
868
|
-
|
|
897
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
898
|
+
if (previousRecursionDepth >= 100) {
|
|
899
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
900
|
+
}
|
|
901
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
902
|
+
try {
|
|
903
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
904
|
+
const message = createBaseStreamPlanUpdatesRequest();
|
|
905
|
+
while (reader.pos < end) {
|
|
906
|
+
const tag = reader.uint32();
|
|
907
|
+
switch (tag >>> 3) {
|
|
908
|
+
case 1: {
|
|
909
|
+
if (tag !== 10) {
|
|
910
|
+
break;
|
|
911
|
+
}
|
|
912
|
+
|
|
913
|
+
message.organizationId = reader.string();
|
|
914
|
+
continue;
|
|
869
915
|
}
|
|
870
|
-
|
|
871
|
-
message.organizationId = reader.string();
|
|
872
|
-
continue;
|
|
873
916
|
}
|
|
917
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
918
|
+
break;
|
|
919
|
+
}
|
|
920
|
+
reader.skip(tag & 7);
|
|
874
921
|
}
|
|
875
|
-
|
|
876
|
-
|
|
877
|
-
|
|
878
|
-
reader.skip(tag & 7);
|
|
922
|
+
return message;
|
|
923
|
+
} finally {
|
|
924
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
879
925
|
}
|
|
880
|
-
return message;
|
|
881
926
|
},
|
|
882
927
|
|
|
883
928
|
fromJSON(object: any): StreamPlanUpdatesRequest {
|
|
@@ -931,50 +976,59 @@ export const PlanUpdateEnvelope: MessageFns<PlanUpdateEnvelope> = {
|
|
|
931
976
|
|
|
932
977
|
decode(input: BinaryReader | Uint8Array, length?: number): PlanUpdateEnvelope {
|
|
933
978
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
934
|
-
const
|
|
935
|
-
|
|
936
|
-
|
|
937
|
-
|
|
938
|
-
|
|
939
|
-
|
|
940
|
-
|
|
941
|
-
|
|
979
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
980
|
+
if (previousRecursionDepth >= 100) {
|
|
981
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
982
|
+
}
|
|
983
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
984
|
+
try {
|
|
985
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
986
|
+
const message = createBasePlanUpdateEnvelope();
|
|
987
|
+
while (reader.pos < end) {
|
|
988
|
+
const tag = reader.uint32();
|
|
989
|
+
switch (tag >>> 3) {
|
|
990
|
+
case 1: {
|
|
991
|
+
if (tag !== 10) {
|
|
992
|
+
break;
|
|
993
|
+
}
|
|
994
|
+
|
|
995
|
+
message.snapshot = PlanSnapshot.decode(reader, reader.uint32());
|
|
996
|
+
continue;
|
|
942
997
|
}
|
|
998
|
+
case 2: {
|
|
999
|
+
if (tag !== 18) {
|
|
1000
|
+
break;
|
|
1001
|
+
}
|
|
943
1002
|
|
|
944
|
-
|
|
945
|
-
|
|
946
|
-
}
|
|
947
|
-
case 2: {
|
|
948
|
-
if (tag !== 18) {
|
|
949
|
-
break;
|
|
1003
|
+
message.planCreated = PlanCreated.decode(reader, reader.uint32());
|
|
1004
|
+
continue;
|
|
950
1005
|
}
|
|
1006
|
+
case 3: {
|
|
1007
|
+
if (tag !== 26) {
|
|
1008
|
+
break;
|
|
1009
|
+
}
|
|
951
1010
|
|
|
952
|
-
|
|
953
|
-
|
|
954
|
-
}
|
|
955
|
-
case 3: {
|
|
956
|
-
if (tag !== 26) {
|
|
957
|
-
break;
|
|
1011
|
+
message.planUpdated = PlanUpdated.decode(reader, reader.uint32());
|
|
1012
|
+
continue;
|
|
958
1013
|
}
|
|
1014
|
+
case 4: {
|
|
1015
|
+
if (tag !== 34) {
|
|
1016
|
+
break;
|
|
1017
|
+
}
|
|
959
1018
|
|
|
960
|
-
|
|
961
|
-
|
|
962
|
-
}
|
|
963
|
-
case 4: {
|
|
964
|
-
if (tag !== 34) {
|
|
965
|
-
break;
|
|
1019
|
+
message.planDeactivated = PlanDeactivated.decode(reader, reader.uint32());
|
|
1020
|
+
continue;
|
|
966
1021
|
}
|
|
967
|
-
|
|
968
|
-
message.planDeactivated = PlanDeactivated.decode(reader, reader.uint32());
|
|
969
|
-
continue;
|
|
970
1022
|
}
|
|
1023
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1024
|
+
break;
|
|
1025
|
+
}
|
|
1026
|
+
reader.skip(tag & 7);
|
|
971
1027
|
}
|
|
972
|
-
|
|
973
|
-
|
|
974
|
-
|
|
975
|
-
reader.skip(tag & 7);
|
|
1028
|
+
return message;
|
|
1029
|
+
} finally {
|
|
1030
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
976
1031
|
}
|
|
977
|
-
return message;
|
|
978
1032
|
},
|
|
979
1033
|
|
|
980
1034
|
fromJSON(object: any): PlanUpdateEnvelope {
|
|
@@ -1053,34 +1107,43 @@ export const PlanSnapshot: MessageFns<PlanSnapshot> = {
|
|
|
1053
1107
|
|
|
1054
1108
|
decode(input: BinaryReader | Uint8Array, length?: number): PlanSnapshot {
|
|
1055
1109
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1056
|
-
const
|
|
1057
|
-
|
|
1058
|
-
|
|
1059
|
-
|
|
1060
|
-
|
|
1061
|
-
|
|
1062
|
-
|
|
1063
|
-
|
|
1110
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
1111
|
+
if (previousRecursionDepth >= 100) {
|
|
1112
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1113
|
+
}
|
|
1114
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1115
|
+
try {
|
|
1116
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1117
|
+
const message = createBasePlanSnapshot();
|
|
1118
|
+
while (reader.pos < end) {
|
|
1119
|
+
const tag = reader.uint32();
|
|
1120
|
+
switch (tag >>> 3) {
|
|
1121
|
+
case 1: {
|
|
1122
|
+
if (tag !== 10) {
|
|
1123
|
+
break;
|
|
1124
|
+
}
|
|
1125
|
+
|
|
1126
|
+
message.plan = Plan.decode(reader, reader.uint32());
|
|
1127
|
+
continue;
|
|
1064
1128
|
}
|
|
1129
|
+
case 2: {
|
|
1130
|
+
if (tag !== 18) {
|
|
1131
|
+
break;
|
|
1132
|
+
}
|
|
1065
1133
|
|
|
1066
|
-
|
|
1067
|
-
|
|
1068
|
-
}
|
|
1069
|
-
case 2: {
|
|
1070
|
-
if (tag !== 18) {
|
|
1071
|
-
break;
|
|
1134
|
+
message.payment = PlanPayment.decode(reader, reader.uint32());
|
|
1135
|
+
continue;
|
|
1072
1136
|
}
|
|
1073
|
-
|
|
1074
|
-
message.payment = PlanPayment.decode(reader, reader.uint32());
|
|
1075
|
-
continue;
|
|
1076
1137
|
}
|
|
1138
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1139
|
+
break;
|
|
1140
|
+
}
|
|
1141
|
+
reader.skip(tag & 7);
|
|
1077
1142
|
}
|
|
1078
|
-
|
|
1079
|
-
|
|
1080
|
-
|
|
1081
|
-
reader.skip(tag & 7);
|
|
1143
|
+
return message;
|
|
1144
|
+
} finally {
|
|
1145
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1082
1146
|
}
|
|
1083
|
-
return message;
|
|
1084
1147
|
},
|
|
1085
1148
|
|
|
1086
1149
|
fromJSON(object: any): PlanSnapshot {
|
|
@@ -1128,26 +1191,35 @@ export const PlanCreated: MessageFns<PlanCreated> = {
|
|
|
1128
1191
|
|
|
1129
1192
|
decode(input: BinaryReader | Uint8Array, length?: number): PlanCreated {
|
|
1130
1193
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1131
|
-
const
|
|
1132
|
-
|
|
1133
|
-
|
|
1134
|
-
|
|
1135
|
-
|
|
1136
|
-
|
|
1137
|
-
|
|
1138
|
-
|
|
1194
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
1195
|
+
if (previousRecursionDepth >= 100) {
|
|
1196
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1197
|
+
}
|
|
1198
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1199
|
+
try {
|
|
1200
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1201
|
+
const message = createBasePlanCreated();
|
|
1202
|
+
while (reader.pos < end) {
|
|
1203
|
+
const tag = reader.uint32();
|
|
1204
|
+
switch (tag >>> 3) {
|
|
1205
|
+
case 1: {
|
|
1206
|
+
if (tag !== 10) {
|
|
1207
|
+
break;
|
|
1208
|
+
}
|
|
1209
|
+
|
|
1210
|
+
message.plan = Plan.decode(reader, reader.uint32());
|
|
1211
|
+
continue;
|
|
1139
1212
|
}
|
|
1140
|
-
|
|
1141
|
-
message.plan = Plan.decode(reader, reader.uint32());
|
|
1142
|
-
continue;
|
|
1143
1213
|
}
|
|
1214
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1215
|
+
break;
|
|
1216
|
+
}
|
|
1217
|
+
reader.skip(tag & 7);
|
|
1144
1218
|
}
|
|
1145
|
-
|
|
1146
|
-
|
|
1147
|
-
|
|
1148
|
-
reader.skip(tag & 7);
|
|
1219
|
+
return message;
|
|
1220
|
+
} finally {
|
|
1221
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1149
1222
|
}
|
|
1150
|
-
return message;
|
|
1151
1223
|
},
|
|
1152
1224
|
|
|
1153
1225
|
fromJSON(object: any): PlanCreated {
|
|
@@ -1189,34 +1261,43 @@ export const PlanUpdated: MessageFns<PlanUpdated> = {
|
|
|
1189
1261
|
|
|
1190
1262
|
decode(input: BinaryReader | Uint8Array, length?: number): PlanUpdated {
|
|
1191
1263
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1192
|
-
const
|
|
1193
|
-
|
|
1194
|
-
|
|
1195
|
-
|
|
1196
|
-
|
|
1197
|
-
|
|
1198
|
-
|
|
1199
|
-
|
|
1264
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
1265
|
+
if (previousRecursionDepth >= 100) {
|
|
1266
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1267
|
+
}
|
|
1268
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1269
|
+
try {
|
|
1270
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1271
|
+
const message = createBasePlanUpdated();
|
|
1272
|
+
while (reader.pos < end) {
|
|
1273
|
+
const tag = reader.uint32();
|
|
1274
|
+
switch (tag >>> 3) {
|
|
1275
|
+
case 1: {
|
|
1276
|
+
if (tag !== 10) {
|
|
1277
|
+
break;
|
|
1278
|
+
}
|
|
1279
|
+
|
|
1280
|
+
message.plan = Plan.decode(reader, reader.uint32());
|
|
1281
|
+
continue;
|
|
1200
1282
|
}
|
|
1283
|
+
case 2: {
|
|
1284
|
+
if (tag !== 16) {
|
|
1285
|
+
break;
|
|
1286
|
+
}
|
|
1201
1287
|
|
|
1202
|
-
|
|
1203
|
-
|
|
1204
|
-
}
|
|
1205
|
-
case 2: {
|
|
1206
|
-
if (tag !== 16) {
|
|
1207
|
-
break;
|
|
1288
|
+
message.previousTier = reader.int32() as any;
|
|
1289
|
+
continue;
|
|
1208
1290
|
}
|
|
1209
|
-
|
|
1210
|
-
message.previousTier = reader.int32() as any;
|
|
1211
|
-
continue;
|
|
1212
1291
|
}
|
|
1292
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1293
|
+
break;
|
|
1294
|
+
}
|
|
1295
|
+
reader.skip(tag & 7);
|
|
1213
1296
|
}
|
|
1214
|
-
|
|
1215
|
-
|
|
1216
|
-
|
|
1217
|
-
reader.skip(tag & 7);
|
|
1297
|
+
return message;
|
|
1298
|
+
} finally {
|
|
1299
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1218
1300
|
}
|
|
1219
|
-
return message;
|
|
1220
1301
|
},
|
|
1221
1302
|
|
|
1222
1303
|
fromJSON(object: any): PlanUpdated {
|
|
@@ -1269,34 +1350,43 @@ export const PlanDeactivated: MessageFns<PlanDeactivated> = {
|
|
|
1269
1350
|
|
|
1270
1351
|
decode(input: BinaryReader | Uint8Array, length?: number): PlanDeactivated {
|
|
1271
1352
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1272
|
-
const
|
|
1273
|
-
|
|
1274
|
-
|
|
1275
|
-
|
|
1276
|
-
|
|
1277
|
-
|
|
1278
|
-
|
|
1279
|
-
|
|
1353
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
1354
|
+
if (previousRecursionDepth >= 100) {
|
|
1355
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1356
|
+
}
|
|
1357
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1358
|
+
try {
|
|
1359
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1360
|
+
const message = createBasePlanDeactivated();
|
|
1361
|
+
while (reader.pos < end) {
|
|
1362
|
+
const tag = reader.uint32();
|
|
1363
|
+
switch (tag >>> 3) {
|
|
1364
|
+
case 1: {
|
|
1365
|
+
if (tag !== 10) {
|
|
1366
|
+
break;
|
|
1367
|
+
}
|
|
1368
|
+
|
|
1369
|
+
message.plan = Plan.decode(reader, reader.uint32());
|
|
1370
|
+
continue;
|
|
1280
1371
|
}
|
|
1372
|
+
case 2: {
|
|
1373
|
+
if (tag !== 18) {
|
|
1374
|
+
break;
|
|
1375
|
+
}
|
|
1281
1376
|
|
|
1282
|
-
|
|
1283
|
-
|
|
1284
|
-
}
|
|
1285
|
-
case 2: {
|
|
1286
|
-
if (tag !== 18) {
|
|
1287
|
-
break;
|
|
1377
|
+
message.reason = reader.string();
|
|
1378
|
+
continue;
|
|
1288
1379
|
}
|
|
1289
|
-
|
|
1290
|
-
message.reason = reader.string();
|
|
1291
|
-
continue;
|
|
1292
1380
|
}
|
|
1381
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1382
|
+
break;
|
|
1383
|
+
}
|
|
1384
|
+
reader.skip(tag & 7);
|
|
1293
1385
|
}
|
|
1294
|
-
|
|
1295
|
-
|
|
1296
|
-
|
|
1297
|
-
reader.skip(tag & 7);
|
|
1386
|
+
return message;
|
|
1387
|
+
} finally {
|
|
1388
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1298
1389
|
}
|
|
1299
|
-
return message;
|
|
1300
1390
|
},
|
|
1301
1391
|
|
|
1302
1392
|
fromJSON(object: any): PlanDeactivated {
|
|
@@ -1339,18 +1429,27 @@ export const ListAvailablePlansRequest: MessageFns<ListAvailablePlansRequest> =
|
|
|
1339
1429
|
|
|
1340
1430
|
decode(input: BinaryReader | Uint8Array, length?: number): ListAvailablePlansRequest {
|
|
1341
1431
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1342
|
-
const
|
|
1343
|
-
|
|
1344
|
-
|
|
1345
|
-
|
|
1346
|
-
|
|
1347
|
-
|
|
1348
|
-
|
|
1349
|
-
|
|
1432
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
1433
|
+
if (previousRecursionDepth >= 100) {
|
|
1434
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1435
|
+
}
|
|
1436
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1437
|
+
try {
|
|
1438
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1439
|
+
const message = createBaseListAvailablePlansRequest();
|
|
1440
|
+
while (reader.pos < end) {
|
|
1441
|
+
const tag = reader.uint32();
|
|
1442
|
+
switch (tag >>> 3) {
|
|
1443
|
+
}
|
|
1444
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1445
|
+
break;
|
|
1446
|
+
}
|
|
1447
|
+
reader.skip(tag & 7);
|
|
1350
1448
|
}
|
|
1351
|
-
|
|
1449
|
+
return message;
|
|
1450
|
+
} finally {
|
|
1451
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1352
1452
|
}
|
|
1353
|
-
return message;
|
|
1354
1453
|
},
|
|
1355
1454
|
|
|
1356
1455
|
fromJSON(_: any): ListAvailablePlansRequest {
|
|
@@ -1388,34 +1487,43 @@ export const ListAvailablePlansResponse: MessageFns<ListAvailablePlansResponse>
|
|
|
1388
1487
|
|
|
1389
1488
|
decode(input: BinaryReader | Uint8Array, length?: number): ListAvailablePlansResponse {
|
|
1390
1489
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1391
|
-
const
|
|
1392
|
-
|
|
1393
|
-
|
|
1394
|
-
|
|
1395
|
-
|
|
1396
|
-
|
|
1397
|
-
|
|
1398
|
-
|
|
1490
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
1491
|
+
if (previousRecursionDepth >= 100) {
|
|
1492
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1493
|
+
}
|
|
1494
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1495
|
+
try {
|
|
1496
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1497
|
+
const message = createBaseListAvailablePlansResponse();
|
|
1498
|
+
while (reader.pos < end) {
|
|
1499
|
+
const tag = reader.uint32();
|
|
1500
|
+
switch (tag >>> 3) {
|
|
1501
|
+
case 1: {
|
|
1502
|
+
if (tag !== 10) {
|
|
1503
|
+
break;
|
|
1504
|
+
}
|
|
1505
|
+
|
|
1506
|
+
message.status = ResponseStatus.decode(reader, reader.uint32());
|
|
1507
|
+
continue;
|
|
1399
1508
|
}
|
|
1509
|
+
case 2: {
|
|
1510
|
+
if (tag !== 18) {
|
|
1511
|
+
break;
|
|
1512
|
+
}
|
|
1400
1513
|
|
|
1401
|
-
|
|
1402
|
-
|
|
1403
|
-
}
|
|
1404
|
-
case 2: {
|
|
1405
|
-
if (tag !== 18) {
|
|
1406
|
-
break;
|
|
1514
|
+
message.plans.push(PlanDetails.decode(reader, reader.uint32()));
|
|
1515
|
+
continue;
|
|
1407
1516
|
}
|
|
1408
|
-
|
|
1409
|
-
message.plans.push(PlanDetails.decode(reader, reader.uint32()));
|
|
1410
|
-
continue;
|
|
1411
1517
|
}
|
|
1518
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1519
|
+
break;
|
|
1520
|
+
}
|
|
1521
|
+
reader.skip(tag & 7);
|
|
1412
1522
|
}
|
|
1413
|
-
|
|
1414
|
-
|
|
1415
|
-
|
|
1416
|
-
reader.skip(tag & 7);
|
|
1523
|
+
return message;
|
|
1524
|
+
} finally {
|
|
1525
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1417
1526
|
}
|
|
1418
|
-
return message;
|
|
1419
1527
|
},
|
|
1420
1528
|
|
|
1421
1529
|
fromJSON(object: any): ListAvailablePlansResponse {
|
|
@@ -1475,58 +1583,67 @@ export const PlanDetails: MessageFns<PlanDetails> = {
|
|
|
1475
1583
|
|
|
1476
1584
|
decode(input: BinaryReader | Uint8Array, length?: number): PlanDetails {
|
|
1477
1585
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1478
|
-
const
|
|
1479
|
-
|
|
1480
|
-
|
|
1481
|
-
|
|
1482
|
-
|
|
1483
|
-
|
|
1484
|
-
|
|
1485
|
-
|
|
1586
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
1587
|
+
if (previousRecursionDepth >= 100) {
|
|
1588
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1589
|
+
}
|
|
1590
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1591
|
+
try {
|
|
1592
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1593
|
+
const message = createBasePlanDetails();
|
|
1594
|
+
while (reader.pos < end) {
|
|
1595
|
+
const tag = reader.uint32();
|
|
1596
|
+
switch (tag >>> 3) {
|
|
1597
|
+
case 1: {
|
|
1598
|
+
if (tag !== 8) {
|
|
1599
|
+
break;
|
|
1600
|
+
}
|
|
1601
|
+
|
|
1602
|
+
message.tier = reader.int32() as any;
|
|
1603
|
+
continue;
|
|
1486
1604
|
}
|
|
1605
|
+
case 2: {
|
|
1606
|
+
if (tag !== 18) {
|
|
1607
|
+
break;
|
|
1608
|
+
}
|
|
1487
1609
|
|
|
1488
|
-
|
|
1489
|
-
|
|
1490
|
-
}
|
|
1491
|
-
case 2: {
|
|
1492
|
-
if (tag !== 18) {
|
|
1493
|
-
break;
|
|
1610
|
+
message.name = reader.string();
|
|
1611
|
+
continue;
|
|
1494
1612
|
}
|
|
1613
|
+
case 3: {
|
|
1614
|
+
if (tag !== 26) {
|
|
1615
|
+
break;
|
|
1616
|
+
}
|
|
1495
1617
|
|
|
1496
|
-
|
|
1497
|
-
|
|
1498
|
-
}
|
|
1499
|
-
case 3: {
|
|
1500
|
-
if (tag !== 26) {
|
|
1501
|
-
break;
|
|
1618
|
+
message.description = reader.string();
|
|
1619
|
+
continue;
|
|
1502
1620
|
}
|
|
1621
|
+
case 4: {
|
|
1622
|
+
if (tag !== 34) {
|
|
1623
|
+
break;
|
|
1624
|
+
}
|
|
1503
1625
|
|
|
1504
|
-
|
|
1505
|
-
|
|
1506
|
-
}
|
|
1507
|
-
case 4: {
|
|
1508
|
-
if (tag !== 34) {
|
|
1509
|
-
break;
|
|
1626
|
+
message.displayPrice = reader.string();
|
|
1627
|
+
continue;
|
|
1510
1628
|
}
|
|
1629
|
+
case 5: {
|
|
1630
|
+
if (tag !== 40) {
|
|
1631
|
+
break;
|
|
1632
|
+
}
|
|
1511
1633
|
|
|
1512
|
-
|
|
1513
|
-
|
|
1514
|
-
}
|
|
1515
|
-
case 5: {
|
|
1516
|
-
if (tag !== 40) {
|
|
1517
|
-
break;
|
|
1634
|
+
message.selfServe = reader.bool();
|
|
1635
|
+
continue;
|
|
1518
1636
|
}
|
|
1519
|
-
|
|
1520
|
-
message.selfServe = reader.bool();
|
|
1521
|
-
continue;
|
|
1522
1637
|
}
|
|
1638
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1639
|
+
break;
|
|
1640
|
+
}
|
|
1641
|
+
reader.skip(tag & 7);
|
|
1523
1642
|
}
|
|
1524
|
-
|
|
1525
|
-
|
|
1526
|
-
|
|
1527
|
-
reader.skip(tag & 7);
|
|
1643
|
+
return message;
|
|
1644
|
+
} finally {
|
|
1645
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1528
1646
|
}
|
|
1529
|
-
return message;
|
|
1530
1647
|
},
|
|
1531
1648
|
|
|
1532
1649
|
fromJSON(object: any): PlanDetails {
|