@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/rule_gateway.proto
|
|
6
6
|
|
|
@@ -424,90 +424,99 @@ export const TraceRule: MessageFns<TraceRule> = {
|
|
|
424
424
|
|
|
425
425
|
decode(input: BinaryReader | Uint8Array, length?: number): TraceRule {
|
|
426
426
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
427
|
-
const
|
|
428
|
-
|
|
429
|
-
|
|
430
|
-
|
|
431
|
-
|
|
432
|
-
|
|
433
|
-
|
|
434
|
-
|
|
435
|
-
|
|
436
|
-
|
|
437
|
-
|
|
438
|
-
|
|
439
|
-
|
|
440
|
-
|
|
441
|
-
|
|
442
|
-
|
|
443
|
-
|
|
444
|
-
|
|
445
|
-
|
|
446
|
-
|
|
447
|
-
|
|
448
|
-
|
|
449
|
-
|
|
450
|
-
|
|
451
|
-
|
|
452
|
-
|
|
453
|
-
|
|
454
|
-
|
|
455
|
-
|
|
456
|
-
|
|
457
|
-
|
|
458
|
-
|
|
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
|
-
|
|
427
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
428
|
+
if (previousRecursionDepth >= 100) {
|
|
429
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
430
|
+
}
|
|
431
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
432
|
+
try {
|
|
433
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
434
|
+
const message = createBaseTraceRule();
|
|
435
|
+
while (reader.pos < end) {
|
|
436
|
+
const tag = reader.uint32();
|
|
437
|
+
switch (tag >>> 3) {
|
|
438
|
+
case 1: {
|
|
439
|
+
if (tag !== 10) {
|
|
440
|
+
break;
|
|
441
|
+
}
|
|
442
|
+
|
|
443
|
+
message.id = reader.string();
|
|
444
|
+
continue;
|
|
445
|
+
}
|
|
446
|
+
case 2: {
|
|
447
|
+
if (tag !== 18) {
|
|
448
|
+
break;
|
|
449
|
+
}
|
|
450
|
+
|
|
451
|
+
message.projectId = reader.string();
|
|
452
|
+
continue;
|
|
453
|
+
}
|
|
454
|
+
case 3: {
|
|
455
|
+
if (tag !== 26) {
|
|
456
|
+
break;
|
|
457
|
+
}
|
|
458
|
+
|
|
459
|
+
message.name = reader.string();
|
|
460
|
+
continue;
|
|
461
|
+
}
|
|
462
|
+
case 4: {
|
|
463
|
+
if (tag !== 34) {
|
|
464
|
+
break;
|
|
465
|
+
}
|
|
466
|
+
|
|
467
|
+
message.description = reader.string();
|
|
468
|
+
continue;
|
|
469
|
+
}
|
|
470
|
+
case 5: {
|
|
471
|
+
if (tag !== 40) {
|
|
472
|
+
break;
|
|
473
|
+
}
|
|
474
|
+
|
|
475
|
+
message.enabled = reader.int32() as any;
|
|
476
|
+
continue;
|
|
477
|
+
}
|
|
478
|
+
case 6: {
|
|
479
|
+
if (tag !== 50) {
|
|
480
|
+
break;
|
|
481
|
+
}
|
|
482
|
+
|
|
483
|
+
message.integrationIds.push(reader.string());
|
|
484
|
+
continue;
|
|
485
|
+
}
|
|
486
|
+
case 7: {
|
|
487
|
+
if (tag !== 58) {
|
|
488
|
+
break;
|
|
489
|
+
}
|
|
490
|
+
|
|
491
|
+
message.celExpression = reader.string();
|
|
492
|
+
continue;
|
|
493
|
+
}
|
|
494
|
+
case 8: {
|
|
495
|
+
if (tag !== 66) {
|
|
496
|
+
break;
|
|
497
|
+
}
|
|
498
|
+
|
|
499
|
+
message.createdAt = fromTimestamp(Timestamp.decode(reader, reader.uint32()));
|
|
500
|
+
continue;
|
|
501
|
+
}
|
|
502
|
+
case 9: {
|
|
503
|
+
if (tag !== 74) {
|
|
504
|
+
break;
|
|
505
|
+
}
|
|
506
|
+
|
|
507
|
+
message.updatedAt = fromTimestamp(Timestamp.decode(reader, reader.uint32()));
|
|
508
|
+
continue;
|
|
509
|
+
}
|
|
510
|
+
}
|
|
511
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
512
|
+
break;
|
|
513
|
+
}
|
|
514
|
+
reader.skip(tag & 7);
|
|
504
515
|
}
|
|
505
|
-
|
|
506
|
-
|
|
507
|
-
|
|
508
|
-
reader.skip(tag & 7);
|
|
516
|
+
return message;
|
|
517
|
+
} finally {
|
|
518
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
509
519
|
}
|
|
510
|
-
return message;
|
|
511
520
|
},
|
|
512
521
|
|
|
513
522
|
fromJSON(object: any): TraceRule {
|
|
@@ -623,66 +632,75 @@ export const CreateTraceRuleRequest: MessageFns<CreateTraceRuleRequest> = {
|
|
|
623
632
|
|
|
624
633
|
decode(input: BinaryReader | Uint8Array, length?: number): CreateTraceRuleRequest {
|
|
625
634
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
626
|
-
const
|
|
627
|
-
|
|
628
|
-
|
|
629
|
-
|
|
630
|
-
|
|
631
|
-
|
|
632
|
-
|
|
633
|
-
|
|
634
|
-
|
|
635
|
-
|
|
636
|
-
|
|
637
|
-
|
|
638
|
-
|
|
639
|
-
|
|
640
|
-
|
|
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
|
-
|
|
672
|
-
|
|
673
|
-
|
|
674
|
-
|
|
675
|
-
|
|
676
|
-
|
|
677
|
-
|
|
678
|
-
|
|
679
|
-
|
|
680
|
-
|
|
681
|
-
|
|
635
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
636
|
+
if (previousRecursionDepth >= 100) {
|
|
637
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
638
|
+
}
|
|
639
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
640
|
+
try {
|
|
641
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
642
|
+
const message = createBaseCreateTraceRuleRequest();
|
|
643
|
+
while (reader.pos < end) {
|
|
644
|
+
const tag = reader.uint32();
|
|
645
|
+
switch (tag >>> 3) {
|
|
646
|
+
case 1: {
|
|
647
|
+
if (tag !== 10) {
|
|
648
|
+
break;
|
|
649
|
+
}
|
|
650
|
+
|
|
651
|
+
message.projectId = reader.string();
|
|
652
|
+
continue;
|
|
653
|
+
}
|
|
654
|
+
case 2: {
|
|
655
|
+
if (tag !== 18) {
|
|
656
|
+
break;
|
|
657
|
+
}
|
|
658
|
+
|
|
659
|
+
message.name = reader.string();
|
|
660
|
+
continue;
|
|
661
|
+
}
|
|
662
|
+
case 3: {
|
|
663
|
+
if (tag !== 26) {
|
|
664
|
+
break;
|
|
665
|
+
}
|
|
666
|
+
|
|
667
|
+
message.description = reader.string();
|
|
668
|
+
continue;
|
|
669
|
+
}
|
|
670
|
+
case 4: {
|
|
671
|
+
if (tag !== 34) {
|
|
672
|
+
break;
|
|
673
|
+
}
|
|
674
|
+
|
|
675
|
+
message.integrationIds.push(reader.string());
|
|
676
|
+
continue;
|
|
677
|
+
}
|
|
678
|
+
case 5: {
|
|
679
|
+
if (tag !== 42) {
|
|
680
|
+
break;
|
|
681
|
+
}
|
|
682
|
+
|
|
683
|
+
message.celExpression = reader.string();
|
|
684
|
+
continue;
|
|
685
|
+
}
|
|
686
|
+
case 6: {
|
|
687
|
+
if (tag !== 50) {
|
|
688
|
+
break;
|
|
689
|
+
}
|
|
690
|
+
|
|
691
|
+
message.organizationId = reader.string();
|
|
692
|
+
continue;
|
|
693
|
+
}
|
|
694
|
+
}
|
|
695
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
696
|
+
break;
|
|
697
|
+
}
|
|
698
|
+
reader.skip(tag & 7);
|
|
682
699
|
}
|
|
683
|
-
|
|
700
|
+
return message;
|
|
701
|
+
} finally {
|
|
702
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
684
703
|
}
|
|
685
|
-
return message;
|
|
686
704
|
},
|
|
687
705
|
|
|
688
706
|
fromJSON(object: any): CreateTraceRuleRequest {
|
|
@@ -767,34 +785,43 @@ export const CreateTraceRuleResponse: MessageFns<CreateTraceRuleResponse> = {
|
|
|
767
785
|
|
|
768
786
|
decode(input: BinaryReader | Uint8Array, length?: number): CreateTraceRuleResponse {
|
|
769
787
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
770
|
-
const
|
|
771
|
-
|
|
772
|
-
|
|
773
|
-
|
|
774
|
-
|
|
775
|
-
|
|
776
|
-
|
|
777
|
-
|
|
778
|
-
|
|
779
|
-
|
|
780
|
-
|
|
781
|
-
|
|
782
|
-
|
|
783
|
-
|
|
784
|
-
|
|
785
|
-
|
|
786
|
-
|
|
787
|
-
|
|
788
|
-
|
|
789
|
-
|
|
790
|
-
|
|
788
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
789
|
+
if (previousRecursionDepth >= 100) {
|
|
790
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
791
|
+
}
|
|
792
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
793
|
+
try {
|
|
794
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
795
|
+
const message = createBaseCreateTraceRuleResponse();
|
|
796
|
+
while (reader.pos < end) {
|
|
797
|
+
const tag = reader.uint32();
|
|
798
|
+
switch (tag >>> 3) {
|
|
799
|
+
case 1: {
|
|
800
|
+
if (tag !== 10) {
|
|
801
|
+
break;
|
|
802
|
+
}
|
|
803
|
+
|
|
804
|
+
message.status = ResponseStatus.decode(reader, reader.uint32());
|
|
805
|
+
continue;
|
|
806
|
+
}
|
|
807
|
+
case 2: {
|
|
808
|
+
if (tag !== 18) {
|
|
809
|
+
break;
|
|
810
|
+
}
|
|
811
|
+
|
|
812
|
+
message.rule = TraceRule.decode(reader, reader.uint32());
|
|
813
|
+
continue;
|
|
814
|
+
}
|
|
815
|
+
}
|
|
816
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
817
|
+
break;
|
|
818
|
+
}
|
|
819
|
+
reader.skip(tag & 7);
|
|
791
820
|
}
|
|
792
|
-
|
|
793
|
-
|
|
794
|
-
|
|
795
|
-
reader.skip(tag & 7);
|
|
821
|
+
return message;
|
|
822
|
+
} finally {
|
|
823
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
796
824
|
}
|
|
797
|
-
return message;
|
|
798
825
|
},
|
|
799
826
|
|
|
800
827
|
fromJSON(object: any): CreateTraceRuleResponse {
|
|
@@ -848,42 +875,51 @@ export const GetTraceRuleRequest: MessageFns<GetTraceRuleRequest> = {
|
|
|
848
875
|
|
|
849
876
|
decode(input: BinaryReader | Uint8Array, length?: number): GetTraceRuleRequest {
|
|
850
877
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
851
|
-
const
|
|
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
|
-
|
|
878
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
879
|
+
if (previousRecursionDepth >= 100) {
|
|
880
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
881
|
+
}
|
|
882
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
883
|
+
try {
|
|
884
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
885
|
+
const message = createBaseGetTraceRuleRequest();
|
|
886
|
+
while (reader.pos < end) {
|
|
887
|
+
const tag = reader.uint32();
|
|
888
|
+
switch (tag >>> 3) {
|
|
889
|
+
case 1: {
|
|
890
|
+
if (tag !== 10) {
|
|
891
|
+
break;
|
|
892
|
+
}
|
|
893
|
+
|
|
894
|
+
message.projectId = reader.string();
|
|
895
|
+
continue;
|
|
896
|
+
}
|
|
897
|
+
case 2: {
|
|
898
|
+
if (tag !== 18) {
|
|
899
|
+
break;
|
|
900
|
+
}
|
|
901
|
+
|
|
902
|
+
message.ruleId = reader.string();
|
|
903
|
+
continue;
|
|
904
|
+
}
|
|
905
|
+
case 3: {
|
|
906
|
+
if (tag !== 26) {
|
|
907
|
+
break;
|
|
908
|
+
}
|
|
909
|
+
|
|
910
|
+
message.organizationId = reader.string();
|
|
911
|
+
continue;
|
|
912
|
+
}
|
|
913
|
+
}
|
|
914
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
915
|
+
break;
|
|
916
|
+
}
|
|
917
|
+
reader.skip(tag & 7);
|
|
880
918
|
}
|
|
881
|
-
|
|
882
|
-
|
|
883
|
-
|
|
884
|
-
reader.skip(tag & 7);
|
|
919
|
+
return message;
|
|
920
|
+
} finally {
|
|
921
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
885
922
|
}
|
|
886
|
-
return message;
|
|
887
923
|
},
|
|
888
924
|
|
|
889
925
|
fromJSON(object: any): GetTraceRuleRequest {
|
|
@@ -949,34 +985,43 @@ export const GetTraceRuleResponse: MessageFns<GetTraceRuleResponse> = {
|
|
|
949
985
|
|
|
950
986
|
decode(input: BinaryReader | Uint8Array, length?: number): GetTraceRuleResponse {
|
|
951
987
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
952
|
-
const
|
|
953
|
-
|
|
954
|
-
|
|
955
|
-
|
|
956
|
-
|
|
957
|
-
|
|
958
|
-
|
|
959
|
-
|
|
960
|
-
|
|
961
|
-
|
|
962
|
-
|
|
963
|
-
|
|
964
|
-
|
|
965
|
-
|
|
966
|
-
|
|
967
|
-
|
|
968
|
-
|
|
969
|
-
|
|
970
|
-
|
|
971
|
-
|
|
972
|
-
|
|
973
|
-
|
|
974
|
-
|
|
975
|
-
|
|
988
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
989
|
+
if (previousRecursionDepth >= 100) {
|
|
990
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
991
|
+
}
|
|
992
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
993
|
+
try {
|
|
994
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
995
|
+
const message = createBaseGetTraceRuleResponse();
|
|
996
|
+
while (reader.pos < end) {
|
|
997
|
+
const tag = reader.uint32();
|
|
998
|
+
switch (tag >>> 3) {
|
|
999
|
+
case 1: {
|
|
1000
|
+
if (tag !== 10) {
|
|
1001
|
+
break;
|
|
1002
|
+
}
|
|
1003
|
+
|
|
1004
|
+
message.status = ResponseStatus.decode(reader, reader.uint32());
|
|
1005
|
+
continue;
|
|
1006
|
+
}
|
|
1007
|
+
case 2: {
|
|
1008
|
+
if (tag !== 18) {
|
|
1009
|
+
break;
|
|
1010
|
+
}
|
|
1011
|
+
|
|
1012
|
+
message.rule = TraceRule.decode(reader, reader.uint32());
|
|
1013
|
+
continue;
|
|
1014
|
+
}
|
|
1015
|
+
}
|
|
1016
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1017
|
+
break;
|
|
1018
|
+
}
|
|
1019
|
+
reader.skip(tag & 7);
|
|
976
1020
|
}
|
|
977
|
-
|
|
1021
|
+
return message;
|
|
1022
|
+
} finally {
|
|
1023
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
978
1024
|
}
|
|
979
|
-
return message;
|
|
980
1025
|
},
|
|
981
1026
|
|
|
982
1027
|
fromJSON(object: any): GetTraceRuleResponse {
|
|
@@ -1030,42 +1075,51 @@ export const ListTraceRulesRequest: MessageFns<ListTraceRulesRequest> = {
|
|
|
1030
1075
|
|
|
1031
1076
|
decode(input: BinaryReader | Uint8Array, length?: number): ListTraceRulesRequest {
|
|
1032
1077
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1033
|
-
const
|
|
1034
|
-
|
|
1035
|
-
|
|
1036
|
-
|
|
1037
|
-
|
|
1038
|
-
|
|
1039
|
-
|
|
1040
|
-
|
|
1041
|
-
|
|
1042
|
-
|
|
1043
|
-
|
|
1044
|
-
|
|
1045
|
-
|
|
1046
|
-
|
|
1047
|
-
|
|
1048
|
-
|
|
1049
|
-
|
|
1050
|
-
|
|
1051
|
-
|
|
1052
|
-
|
|
1053
|
-
|
|
1054
|
-
|
|
1055
|
-
|
|
1056
|
-
|
|
1057
|
-
|
|
1058
|
-
|
|
1059
|
-
|
|
1060
|
-
|
|
1061
|
-
|
|
1062
|
-
|
|
1063
|
-
|
|
1064
|
-
|
|
1078
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
1079
|
+
if (previousRecursionDepth >= 100) {
|
|
1080
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1081
|
+
}
|
|
1082
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1083
|
+
try {
|
|
1084
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1085
|
+
const message = createBaseListTraceRulesRequest();
|
|
1086
|
+
while (reader.pos < end) {
|
|
1087
|
+
const tag = reader.uint32();
|
|
1088
|
+
switch (tag >>> 3) {
|
|
1089
|
+
case 1: {
|
|
1090
|
+
if (tag !== 10) {
|
|
1091
|
+
break;
|
|
1092
|
+
}
|
|
1093
|
+
|
|
1094
|
+
message.organizationId = reader.string();
|
|
1095
|
+
continue;
|
|
1096
|
+
}
|
|
1097
|
+
case 2: {
|
|
1098
|
+
if (tag !== 18) {
|
|
1099
|
+
break;
|
|
1100
|
+
}
|
|
1101
|
+
|
|
1102
|
+
message.organizationIdFilter = reader.string();
|
|
1103
|
+
continue;
|
|
1104
|
+
}
|
|
1105
|
+
case 3: {
|
|
1106
|
+
if (tag !== 26) {
|
|
1107
|
+
break;
|
|
1108
|
+
}
|
|
1109
|
+
|
|
1110
|
+
message.projectIdFilter = reader.string();
|
|
1111
|
+
continue;
|
|
1112
|
+
}
|
|
1113
|
+
}
|
|
1114
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1115
|
+
break;
|
|
1116
|
+
}
|
|
1117
|
+
reader.skip(tag & 7);
|
|
1065
1118
|
}
|
|
1066
|
-
|
|
1119
|
+
return message;
|
|
1120
|
+
} finally {
|
|
1121
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1067
1122
|
}
|
|
1068
|
-
return message;
|
|
1069
1123
|
},
|
|
1070
1124
|
|
|
1071
1125
|
fromJSON(object: any): ListTraceRulesRequest {
|
|
@@ -1131,34 +1185,43 @@ export const ListTraceRulesResponse: MessageFns<ListTraceRulesResponse> = {
|
|
|
1131
1185
|
|
|
1132
1186
|
decode(input: BinaryReader | Uint8Array, length?: number): ListTraceRulesResponse {
|
|
1133
1187
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1134
|
-
const
|
|
1135
|
-
|
|
1136
|
-
|
|
1137
|
-
|
|
1138
|
-
|
|
1139
|
-
|
|
1140
|
-
|
|
1141
|
-
|
|
1142
|
-
|
|
1143
|
-
|
|
1144
|
-
|
|
1145
|
-
|
|
1146
|
-
|
|
1147
|
-
|
|
1148
|
-
|
|
1149
|
-
|
|
1150
|
-
|
|
1151
|
-
|
|
1152
|
-
|
|
1153
|
-
|
|
1154
|
-
|
|
1188
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
1189
|
+
if (previousRecursionDepth >= 100) {
|
|
1190
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1191
|
+
}
|
|
1192
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1193
|
+
try {
|
|
1194
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1195
|
+
const message = createBaseListTraceRulesResponse();
|
|
1196
|
+
while (reader.pos < end) {
|
|
1197
|
+
const tag = reader.uint32();
|
|
1198
|
+
switch (tag >>> 3) {
|
|
1199
|
+
case 1: {
|
|
1200
|
+
if (tag !== 10) {
|
|
1201
|
+
break;
|
|
1202
|
+
}
|
|
1203
|
+
|
|
1204
|
+
message.status = ResponseStatus.decode(reader, reader.uint32());
|
|
1205
|
+
continue;
|
|
1206
|
+
}
|
|
1207
|
+
case 2: {
|
|
1208
|
+
if (tag !== 18) {
|
|
1209
|
+
break;
|
|
1210
|
+
}
|
|
1211
|
+
|
|
1212
|
+
message.rules.push(TraceRule.decode(reader, reader.uint32()));
|
|
1213
|
+
continue;
|
|
1214
|
+
}
|
|
1215
|
+
}
|
|
1216
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1217
|
+
break;
|
|
1218
|
+
}
|
|
1219
|
+
reader.skip(tag & 7);
|
|
1155
1220
|
}
|
|
1156
|
-
|
|
1157
|
-
|
|
1158
|
-
|
|
1159
|
-
reader.skip(tag & 7);
|
|
1221
|
+
return message;
|
|
1222
|
+
} finally {
|
|
1223
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1160
1224
|
}
|
|
1161
|
-
return message;
|
|
1162
1225
|
},
|
|
1163
1226
|
|
|
1164
1227
|
fromJSON(object: any): ListTraceRulesResponse {
|
|
@@ -1215,50 +1278,59 @@ export const UpdateTraceRuleRequest: MessageFns<UpdateTraceRuleRequest> = {
|
|
|
1215
1278
|
|
|
1216
1279
|
decode(input: BinaryReader | Uint8Array, length?: number): UpdateTraceRuleRequest {
|
|
1217
1280
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1218
|
-
const
|
|
1219
|
-
|
|
1220
|
-
|
|
1221
|
-
|
|
1222
|
-
|
|
1223
|
-
|
|
1224
|
-
|
|
1225
|
-
|
|
1226
|
-
|
|
1227
|
-
|
|
1228
|
-
|
|
1229
|
-
|
|
1230
|
-
|
|
1231
|
-
|
|
1232
|
-
|
|
1233
|
-
|
|
1234
|
-
|
|
1235
|
-
|
|
1236
|
-
|
|
1237
|
-
|
|
1238
|
-
|
|
1239
|
-
|
|
1240
|
-
|
|
1241
|
-
|
|
1242
|
-
|
|
1243
|
-
|
|
1244
|
-
|
|
1245
|
-
|
|
1246
|
-
|
|
1247
|
-
|
|
1248
|
-
|
|
1249
|
-
|
|
1250
|
-
|
|
1251
|
-
|
|
1252
|
-
|
|
1253
|
-
|
|
1254
|
-
|
|
1255
|
-
|
|
1256
|
-
|
|
1257
|
-
|
|
1281
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
1282
|
+
if (previousRecursionDepth >= 100) {
|
|
1283
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1284
|
+
}
|
|
1285
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1286
|
+
try {
|
|
1287
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1288
|
+
const message = createBaseUpdateTraceRuleRequest();
|
|
1289
|
+
while (reader.pos < end) {
|
|
1290
|
+
const tag = reader.uint32();
|
|
1291
|
+
switch (tag >>> 3) {
|
|
1292
|
+
case 1: {
|
|
1293
|
+
if (tag !== 10) {
|
|
1294
|
+
break;
|
|
1295
|
+
}
|
|
1296
|
+
|
|
1297
|
+
message.projectId = reader.string();
|
|
1298
|
+
continue;
|
|
1299
|
+
}
|
|
1300
|
+
case 2: {
|
|
1301
|
+
if (tag !== 18) {
|
|
1302
|
+
break;
|
|
1303
|
+
}
|
|
1304
|
+
|
|
1305
|
+
message.ruleId = reader.string();
|
|
1306
|
+
continue;
|
|
1307
|
+
}
|
|
1308
|
+
case 3: {
|
|
1309
|
+
if (tag !== 26) {
|
|
1310
|
+
break;
|
|
1311
|
+
}
|
|
1312
|
+
|
|
1313
|
+
message.updates = UpdateTraceRuleRequest_TraceRuleUpdates.decode(reader, reader.uint32());
|
|
1314
|
+
continue;
|
|
1315
|
+
}
|
|
1316
|
+
case 4: {
|
|
1317
|
+
if (tag !== 34) {
|
|
1318
|
+
break;
|
|
1319
|
+
}
|
|
1320
|
+
|
|
1321
|
+
message.organizationId = reader.string();
|
|
1322
|
+
continue;
|
|
1323
|
+
}
|
|
1324
|
+
}
|
|
1325
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1326
|
+
break;
|
|
1327
|
+
}
|
|
1328
|
+
reader.skip(tag & 7);
|
|
1258
1329
|
}
|
|
1259
|
-
|
|
1330
|
+
return message;
|
|
1331
|
+
} finally {
|
|
1332
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1260
1333
|
}
|
|
1261
|
-
return message;
|
|
1262
1334
|
},
|
|
1263
1335
|
|
|
1264
1336
|
fromJSON(object: any): UpdateTraceRuleRequest {
|
|
@@ -1328,26 +1400,35 @@ export const UpdateTraceRuleRequest_IntegrationIds: MessageFns<UpdateTraceRuleRe
|
|
|
1328
1400
|
|
|
1329
1401
|
decode(input: BinaryReader | Uint8Array, length?: number): UpdateTraceRuleRequest_IntegrationIds {
|
|
1330
1402
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1331
|
-
const
|
|
1332
|
-
|
|
1333
|
-
|
|
1334
|
-
|
|
1335
|
-
|
|
1336
|
-
|
|
1337
|
-
|
|
1338
|
-
|
|
1339
|
-
|
|
1340
|
-
|
|
1341
|
-
|
|
1342
|
-
|
|
1343
|
-
|
|
1344
|
-
|
|
1345
|
-
|
|
1346
|
-
|
|
1403
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
1404
|
+
if (previousRecursionDepth >= 100) {
|
|
1405
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1406
|
+
}
|
|
1407
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1408
|
+
try {
|
|
1409
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1410
|
+
const message = createBaseUpdateTraceRuleRequest_IntegrationIds();
|
|
1411
|
+
while (reader.pos < end) {
|
|
1412
|
+
const tag = reader.uint32();
|
|
1413
|
+
switch (tag >>> 3) {
|
|
1414
|
+
case 1: {
|
|
1415
|
+
if (tag !== 10) {
|
|
1416
|
+
break;
|
|
1417
|
+
}
|
|
1418
|
+
|
|
1419
|
+
message.ids.push(reader.string());
|
|
1420
|
+
continue;
|
|
1421
|
+
}
|
|
1422
|
+
}
|
|
1423
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1424
|
+
break;
|
|
1425
|
+
}
|
|
1426
|
+
reader.skip(tag & 7);
|
|
1347
1427
|
}
|
|
1348
|
-
|
|
1428
|
+
return message;
|
|
1429
|
+
} finally {
|
|
1430
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1349
1431
|
}
|
|
1350
|
-
return message;
|
|
1351
1432
|
},
|
|
1352
1433
|
|
|
1353
1434
|
fromJSON(object: any): UpdateTraceRuleRequest_IntegrationIds {
|
|
@@ -1390,26 +1471,35 @@ export const UpdateTraceRuleRequest_CelExpression: MessageFns<UpdateTraceRuleReq
|
|
|
1390
1471
|
|
|
1391
1472
|
decode(input: BinaryReader | Uint8Array, length?: number): UpdateTraceRuleRequest_CelExpression {
|
|
1392
1473
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1393
|
-
const
|
|
1394
|
-
|
|
1395
|
-
|
|
1396
|
-
|
|
1397
|
-
|
|
1398
|
-
|
|
1399
|
-
|
|
1400
|
-
|
|
1401
|
-
|
|
1402
|
-
|
|
1403
|
-
|
|
1404
|
-
|
|
1405
|
-
|
|
1406
|
-
|
|
1407
|
-
|
|
1408
|
-
|
|
1474
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
1475
|
+
if (previousRecursionDepth >= 100) {
|
|
1476
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1477
|
+
}
|
|
1478
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1479
|
+
try {
|
|
1480
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1481
|
+
const message = createBaseUpdateTraceRuleRequest_CelExpression();
|
|
1482
|
+
while (reader.pos < end) {
|
|
1483
|
+
const tag = reader.uint32();
|
|
1484
|
+
switch (tag >>> 3) {
|
|
1485
|
+
case 1: {
|
|
1486
|
+
if (tag !== 10) {
|
|
1487
|
+
break;
|
|
1488
|
+
}
|
|
1489
|
+
|
|
1490
|
+
message.celExpression = reader.string();
|
|
1491
|
+
continue;
|
|
1492
|
+
}
|
|
1493
|
+
}
|
|
1494
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1495
|
+
break;
|
|
1496
|
+
}
|
|
1497
|
+
reader.skip(tag & 7);
|
|
1409
1498
|
}
|
|
1410
|
-
|
|
1499
|
+
return message;
|
|
1500
|
+
} finally {
|
|
1501
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1411
1502
|
}
|
|
1412
|
-
return message;
|
|
1413
1503
|
},
|
|
1414
1504
|
|
|
1415
1505
|
fromJSON(object: any): UpdateTraceRuleRequest_CelExpression {
|
|
@@ -1476,58 +1566,67 @@ export const UpdateTraceRuleRequest_TraceRuleUpdates: MessageFns<UpdateTraceRule
|
|
|
1476
1566
|
|
|
1477
1567
|
decode(input: BinaryReader | Uint8Array, length?: number): UpdateTraceRuleRequest_TraceRuleUpdates {
|
|
1478
1568
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1479
|
-
const
|
|
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
|
-
|
|
1516
|
-
|
|
1517
|
-
|
|
1518
|
-
|
|
1519
|
-
|
|
1520
|
-
|
|
1521
|
-
|
|
1522
|
-
|
|
1523
|
-
|
|
1524
|
-
|
|
1525
|
-
|
|
1526
|
-
|
|
1569
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
1570
|
+
if (previousRecursionDepth >= 100) {
|
|
1571
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1572
|
+
}
|
|
1573
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1574
|
+
try {
|
|
1575
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1576
|
+
const message = createBaseUpdateTraceRuleRequest_TraceRuleUpdates();
|
|
1577
|
+
while (reader.pos < end) {
|
|
1578
|
+
const tag = reader.uint32();
|
|
1579
|
+
switch (tag >>> 3) {
|
|
1580
|
+
case 1: {
|
|
1581
|
+
if (tag !== 10) {
|
|
1582
|
+
break;
|
|
1583
|
+
}
|
|
1584
|
+
|
|
1585
|
+
message.name = reader.string();
|
|
1586
|
+
continue;
|
|
1587
|
+
}
|
|
1588
|
+
case 2: {
|
|
1589
|
+
if (tag !== 18) {
|
|
1590
|
+
break;
|
|
1591
|
+
}
|
|
1592
|
+
|
|
1593
|
+
message.description = reader.string();
|
|
1594
|
+
continue;
|
|
1595
|
+
}
|
|
1596
|
+
case 3: {
|
|
1597
|
+
if (tag !== 24) {
|
|
1598
|
+
break;
|
|
1599
|
+
}
|
|
1600
|
+
|
|
1601
|
+
message.enabled = reader.int32() as any;
|
|
1602
|
+
continue;
|
|
1603
|
+
}
|
|
1604
|
+
case 4: {
|
|
1605
|
+
if (tag !== 34) {
|
|
1606
|
+
break;
|
|
1607
|
+
}
|
|
1608
|
+
|
|
1609
|
+
message.integrationIds = UpdateTraceRuleRequest_IntegrationIds.decode(reader, reader.uint32());
|
|
1610
|
+
continue;
|
|
1611
|
+
}
|
|
1612
|
+
case 5: {
|
|
1613
|
+
if (tag !== 42) {
|
|
1614
|
+
break;
|
|
1615
|
+
}
|
|
1616
|
+
|
|
1617
|
+
message.celExpression = UpdateTraceRuleRequest_CelExpression.decode(reader, reader.uint32());
|
|
1618
|
+
continue;
|
|
1619
|
+
}
|
|
1620
|
+
}
|
|
1621
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1622
|
+
break;
|
|
1623
|
+
}
|
|
1624
|
+
reader.skip(tag & 7);
|
|
1527
1625
|
}
|
|
1528
|
-
|
|
1626
|
+
return message;
|
|
1627
|
+
} finally {
|
|
1628
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1529
1629
|
}
|
|
1530
|
-
return message;
|
|
1531
1630
|
},
|
|
1532
1631
|
|
|
1533
1632
|
fromJSON(object: any): UpdateTraceRuleRequest_TraceRuleUpdates {
|
|
@@ -1607,34 +1706,43 @@ export const UpdateTraceRuleResponse: MessageFns<UpdateTraceRuleResponse> = {
|
|
|
1607
1706
|
|
|
1608
1707
|
decode(input: BinaryReader | Uint8Array, length?: number): UpdateTraceRuleResponse {
|
|
1609
1708
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1610
|
-
const
|
|
1611
|
-
|
|
1612
|
-
|
|
1613
|
-
|
|
1614
|
-
|
|
1615
|
-
|
|
1616
|
-
|
|
1617
|
-
|
|
1618
|
-
|
|
1619
|
-
|
|
1620
|
-
|
|
1621
|
-
|
|
1622
|
-
|
|
1623
|
-
|
|
1624
|
-
|
|
1625
|
-
|
|
1626
|
-
|
|
1627
|
-
|
|
1628
|
-
|
|
1629
|
-
|
|
1630
|
-
|
|
1709
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
1710
|
+
if (previousRecursionDepth >= 100) {
|
|
1711
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1712
|
+
}
|
|
1713
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1714
|
+
try {
|
|
1715
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1716
|
+
const message = createBaseUpdateTraceRuleResponse();
|
|
1717
|
+
while (reader.pos < end) {
|
|
1718
|
+
const tag = reader.uint32();
|
|
1719
|
+
switch (tag >>> 3) {
|
|
1720
|
+
case 1: {
|
|
1721
|
+
if (tag !== 10) {
|
|
1722
|
+
break;
|
|
1723
|
+
}
|
|
1724
|
+
|
|
1725
|
+
message.status = ResponseStatus.decode(reader, reader.uint32());
|
|
1726
|
+
continue;
|
|
1727
|
+
}
|
|
1728
|
+
case 2: {
|
|
1729
|
+
if (tag !== 18) {
|
|
1730
|
+
break;
|
|
1731
|
+
}
|
|
1732
|
+
|
|
1733
|
+
message.rule = TraceRule.decode(reader, reader.uint32());
|
|
1734
|
+
continue;
|
|
1735
|
+
}
|
|
1736
|
+
}
|
|
1737
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1738
|
+
break;
|
|
1739
|
+
}
|
|
1740
|
+
reader.skip(tag & 7);
|
|
1631
1741
|
}
|
|
1632
|
-
|
|
1633
|
-
|
|
1634
|
-
|
|
1635
|
-
reader.skip(tag & 7);
|
|
1742
|
+
return message;
|
|
1743
|
+
} finally {
|
|
1744
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1636
1745
|
}
|
|
1637
|
-
return message;
|
|
1638
1746
|
},
|
|
1639
1747
|
|
|
1640
1748
|
fromJSON(object: any): UpdateTraceRuleResponse {
|
|
@@ -1688,42 +1796,51 @@ export const DeleteTraceRuleRequest: MessageFns<DeleteTraceRuleRequest> = {
|
|
|
1688
1796
|
|
|
1689
1797
|
decode(input: BinaryReader | Uint8Array, length?: number): DeleteTraceRuleRequest {
|
|
1690
1798
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1691
|
-
const
|
|
1692
|
-
|
|
1693
|
-
|
|
1694
|
-
|
|
1695
|
-
|
|
1696
|
-
|
|
1697
|
-
|
|
1698
|
-
|
|
1699
|
-
|
|
1700
|
-
|
|
1701
|
-
|
|
1702
|
-
|
|
1703
|
-
|
|
1704
|
-
|
|
1705
|
-
|
|
1706
|
-
|
|
1707
|
-
|
|
1708
|
-
|
|
1709
|
-
|
|
1710
|
-
|
|
1711
|
-
|
|
1712
|
-
|
|
1713
|
-
|
|
1714
|
-
|
|
1715
|
-
|
|
1716
|
-
|
|
1717
|
-
|
|
1718
|
-
|
|
1719
|
-
|
|
1799
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
1800
|
+
if (previousRecursionDepth >= 100) {
|
|
1801
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1802
|
+
}
|
|
1803
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1804
|
+
try {
|
|
1805
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1806
|
+
const message = createBaseDeleteTraceRuleRequest();
|
|
1807
|
+
while (reader.pos < end) {
|
|
1808
|
+
const tag = reader.uint32();
|
|
1809
|
+
switch (tag >>> 3) {
|
|
1810
|
+
case 1: {
|
|
1811
|
+
if (tag !== 10) {
|
|
1812
|
+
break;
|
|
1813
|
+
}
|
|
1814
|
+
|
|
1815
|
+
message.projectId = reader.string();
|
|
1816
|
+
continue;
|
|
1817
|
+
}
|
|
1818
|
+
case 2: {
|
|
1819
|
+
if (tag !== 18) {
|
|
1820
|
+
break;
|
|
1821
|
+
}
|
|
1822
|
+
|
|
1823
|
+
message.ruleId = reader.string();
|
|
1824
|
+
continue;
|
|
1825
|
+
}
|
|
1826
|
+
case 3: {
|
|
1827
|
+
if (tag !== 26) {
|
|
1828
|
+
break;
|
|
1829
|
+
}
|
|
1830
|
+
|
|
1831
|
+
message.organizationId = reader.string();
|
|
1832
|
+
continue;
|
|
1833
|
+
}
|
|
1834
|
+
}
|
|
1835
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1836
|
+
break;
|
|
1837
|
+
}
|
|
1838
|
+
reader.skip(tag & 7);
|
|
1720
1839
|
}
|
|
1721
|
-
|
|
1722
|
-
|
|
1723
|
-
|
|
1724
|
-
reader.skip(tag & 7);
|
|
1840
|
+
return message;
|
|
1841
|
+
} finally {
|
|
1842
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1725
1843
|
}
|
|
1726
|
-
return message;
|
|
1727
1844
|
},
|
|
1728
1845
|
|
|
1729
1846
|
fromJSON(object: any): DeleteTraceRuleRequest {
|
|
@@ -1786,26 +1903,35 @@ export const DeleteTraceRuleResponse: MessageFns<DeleteTraceRuleResponse> = {
|
|
|
1786
1903
|
|
|
1787
1904
|
decode(input: BinaryReader | Uint8Array, length?: number): DeleteTraceRuleResponse {
|
|
1788
1905
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1789
|
-
const
|
|
1790
|
-
|
|
1791
|
-
|
|
1792
|
-
|
|
1793
|
-
|
|
1794
|
-
|
|
1795
|
-
|
|
1796
|
-
|
|
1797
|
-
|
|
1798
|
-
|
|
1799
|
-
|
|
1800
|
-
|
|
1801
|
-
|
|
1906
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
1907
|
+
if (previousRecursionDepth >= 100) {
|
|
1908
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1909
|
+
}
|
|
1910
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1911
|
+
try {
|
|
1912
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1913
|
+
const message = createBaseDeleteTraceRuleResponse();
|
|
1914
|
+
while (reader.pos < end) {
|
|
1915
|
+
const tag = reader.uint32();
|
|
1916
|
+
switch (tag >>> 3) {
|
|
1917
|
+
case 1: {
|
|
1918
|
+
if (tag !== 10) {
|
|
1919
|
+
break;
|
|
1920
|
+
}
|
|
1921
|
+
|
|
1922
|
+
message.status = ResponseStatus.decode(reader, reader.uint32());
|
|
1923
|
+
continue;
|
|
1924
|
+
}
|
|
1925
|
+
}
|
|
1926
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1927
|
+
break;
|
|
1928
|
+
}
|
|
1929
|
+
reader.skip(tag & 7);
|
|
1802
1930
|
}
|
|
1803
|
-
|
|
1804
|
-
|
|
1805
|
-
|
|
1806
|
-
reader.skip(tag & 7);
|
|
1931
|
+
return message;
|
|
1932
|
+
} finally {
|
|
1933
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1807
1934
|
}
|
|
1808
|
-
return message;
|
|
1809
1935
|
},
|
|
1810
1936
|
|
|
1811
1937
|
fromJSON(object: any): DeleteTraceRuleResponse {
|
|
@@ -1855,50 +1981,59 @@ export const StreamTraceRuleSimulationRequest: MessageFns<StreamTraceRuleSimulat
|
|
|
1855
1981
|
|
|
1856
1982
|
decode(input: BinaryReader | Uint8Array, length?: number): StreamTraceRuleSimulationRequest {
|
|
1857
1983
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1858
|
-
const
|
|
1859
|
-
|
|
1860
|
-
|
|
1861
|
-
|
|
1862
|
-
|
|
1863
|
-
|
|
1864
|
-
|
|
1865
|
-
|
|
1866
|
-
|
|
1867
|
-
|
|
1868
|
-
|
|
1869
|
-
|
|
1870
|
-
|
|
1871
|
-
|
|
1872
|
-
|
|
1873
|
-
|
|
1874
|
-
|
|
1875
|
-
|
|
1876
|
-
|
|
1877
|
-
|
|
1878
|
-
|
|
1879
|
-
|
|
1880
|
-
|
|
1881
|
-
|
|
1882
|
-
|
|
1883
|
-
|
|
1884
|
-
|
|
1885
|
-
|
|
1886
|
-
|
|
1887
|
-
|
|
1888
|
-
|
|
1889
|
-
|
|
1890
|
-
|
|
1891
|
-
|
|
1892
|
-
|
|
1893
|
-
|
|
1894
|
-
|
|
1895
|
-
|
|
1896
|
-
|
|
1897
|
-
|
|
1984
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
1985
|
+
if (previousRecursionDepth >= 100) {
|
|
1986
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1987
|
+
}
|
|
1988
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1989
|
+
try {
|
|
1990
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1991
|
+
const message = createBaseStreamTraceRuleSimulationRequest();
|
|
1992
|
+
while (reader.pos < end) {
|
|
1993
|
+
const tag = reader.uint32();
|
|
1994
|
+
switch (tag >>> 3) {
|
|
1995
|
+
case 1: {
|
|
1996
|
+
if (tag !== 10) {
|
|
1997
|
+
break;
|
|
1998
|
+
}
|
|
1999
|
+
|
|
2000
|
+
message.projectId = reader.string();
|
|
2001
|
+
continue;
|
|
2002
|
+
}
|
|
2003
|
+
case 2: {
|
|
2004
|
+
if (tag !== 18) {
|
|
2005
|
+
break;
|
|
2006
|
+
}
|
|
2007
|
+
|
|
2008
|
+
message.celExpression = reader.string();
|
|
2009
|
+
continue;
|
|
2010
|
+
}
|
|
2011
|
+
case 3: {
|
|
2012
|
+
if (tag !== 24) {
|
|
2013
|
+
break;
|
|
2014
|
+
}
|
|
2015
|
+
|
|
2016
|
+
message.limit = reader.int32();
|
|
2017
|
+
continue;
|
|
2018
|
+
}
|
|
2019
|
+
case 4: {
|
|
2020
|
+
if (tag !== 34) {
|
|
2021
|
+
break;
|
|
2022
|
+
}
|
|
2023
|
+
|
|
2024
|
+
message.organizationId = reader.string();
|
|
2025
|
+
continue;
|
|
2026
|
+
}
|
|
2027
|
+
}
|
|
2028
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2029
|
+
break;
|
|
2030
|
+
}
|
|
2031
|
+
reader.skip(tag & 7);
|
|
1898
2032
|
}
|
|
1899
|
-
|
|
2033
|
+
return message;
|
|
2034
|
+
} finally {
|
|
2035
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1900
2036
|
}
|
|
1901
|
-
return message;
|
|
1902
2037
|
},
|
|
1903
2038
|
|
|
1904
2039
|
fromJSON(object: any): StreamTraceRuleSimulationRequest {
|
|
@@ -1979,50 +2114,59 @@ export const TraceRuleSimulationMatch: MessageFns<TraceRuleSimulationMatch> = {
|
|
|
1979
2114
|
|
|
1980
2115
|
decode(input: BinaryReader | Uint8Array, length?: number): TraceRuleSimulationMatch {
|
|
1981
2116
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1982
|
-
const
|
|
1983
|
-
|
|
1984
|
-
|
|
1985
|
-
|
|
1986
|
-
|
|
1987
|
-
|
|
1988
|
-
|
|
1989
|
-
|
|
1990
|
-
|
|
1991
|
-
|
|
1992
|
-
|
|
1993
|
-
|
|
1994
|
-
|
|
1995
|
-
|
|
1996
|
-
|
|
1997
|
-
|
|
1998
|
-
|
|
1999
|
-
|
|
2000
|
-
|
|
2001
|
-
|
|
2002
|
-
|
|
2003
|
-
|
|
2004
|
-
|
|
2005
|
-
|
|
2006
|
-
|
|
2007
|
-
|
|
2008
|
-
|
|
2009
|
-
|
|
2010
|
-
|
|
2011
|
-
|
|
2012
|
-
|
|
2013
|
-
|
|
2014
|
-
|
|
2015
|
-
|
|
2016
|
-
|
|
2017
|
-
|
|
2018
|
-
|
|
2117
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
2118
|
+
if (previousRecursionDepth >= 100) {
|
|
2119
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2120
|
+
}
|
|
2121
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2122
|
+
try {
|
|
2123
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2124
|
+
const message = createBaseTraceRuleSimulationMatch();
|
|
2125
|
+
while (reader.pos < end) {
|
|
2126
|
+
const tag = reader.uint32();
|
|
2127
|
+
switch (tag >>> 3) {
|
|
2128
|
+
case 1: {
|
|
2129
|
+
if (tag !== 10) {
|
|
2130
|
+
break;
|
|
2131
|
+
}
|
|
2132
|
+
|
|
2133
|
+
message.traceId = reader.string();
|
|
2134
|
+
continue;
|
|
2135
|
+
}
|
|
2136
|
+
case 2: {
|
|
2137
|
+
if (tag !== 18) {
|
|
2138
|
+
break;
|
|
2139
|
+
}
|
|
2140
|
+
|
|
2141
|
+
message.traceName = reader.string();
|
|
2142
|
+
continue;
|
|
2143
|
+
}
|
|
2144
|
+
case 3: {
|
|
2145
|
+
if (tag !== 26) {
|
|
2146
|
+
break;
|
|
2147
|
+
}
|
|
2148
|
+
|
|
2149
|
+
message.matchReason = reader.string();
|
|
2150
|
+
continue;
|
|
2151
|
+
}
|
|
2152
|
+
case 4: {
|
|
2153
|
+
if (tag !== 34) {
|
|
2154
|
+
break;
|
|
2155
|
+
}
|
|
2156
|
+
|
|
2157
|
+
message.createdAt = fromTimestamp(Timestamp.decode(reader, reader.uint32()));
|
|
2158
|
+
continue;
|
|
2159
|
+
}
|
|
2160
|
+
}
|
|
2161
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2162
|
+
break;
|
|
2163
|
+
}
|
|
2164
|
+
reader.skip(tag & 7);
|
|
2019
2165
|
}
|
|
2020
|
-
|
|
2021
|
-
|
|
2022
|
-
|
|
2023
|
-
reader.skip(tag & 7);
|
|
2166
|
+
return message;
|
|
2167
|
+
} finally {
|
|
2168
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2024
2169
|
}
|
|
2025
|
-
return message;
|
|
2026
2170
|
},
|
|
2027
2171
|
|
|
2028
2172
|
fromJSON(object: any): TraceRuleSimulationMatch {
|
|
@@ -2094,26 +2238,35 @@ export const ListTraceRuleSchemasRequest: MessageFns<ListTraceRuleSchemasRequest
|
|
|
2094
2238
|
|
|
2095
2239
|
decode(input: BinaryReader | Uint8Array, length?: number): ListTraceRuleSchemasRequest {
|
|
2096
2240
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2097
|
-
const
|
|
2098
|
-
|
|
2099
|
-
|
|
2100
|
-
|
|
2101
|
-
|
|
2102
|
-
|
|
2103
|
-
|
|
2104
|
-
|
|
2105
|
-
|
|
2106
|
-
|
|
2107
|
-
|
|
2108
|
-
|
|
2109
|
-
|
|
2241
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
2242
|
+
if (previousRecursionDepth >= 100) {
|
|
2243
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2244
|
+
}
|
|
2245
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2246
|
+
try {
|
|
2247
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2248
|
+
const message = createBaseListTraceRuleSchemasRequest();
|
|
2249
|
+
while (reader.pos < end) {
|
|
2250
|
+
const tag = reader.uint32();
|
|
2251
|
+
switch (tag >>> 3) {
|
|
2252
|
+
case 1: {
|
|
2253
|
+
if (tag !== 10) {
|
|
2254
|
+
break;
|
|
2255
|
+
}
|
|
2256
|
+
|
|
2257
|
+
message.organizationId = reader.string();
|
|
2258
|
+
continue;
|
|
2259
|
+
}
|
|
2260
|
+
}
|
|
2261
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2262
|
+
break;
|
|
2263
|
+
}
|
|
2264
|
+
reader.skip(tag & 7);
|
|
2110
2265
|
}
|
|
2111
|
-
|
|
2112
|
-
|
|
2113
|
-
|
|
2114
|
-
reader.skip(tag & 7);
|
|
2266
|
+
return message;
|
|
2267
|
+
} finally {
|
|
2268
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2115
2269
|
}
|
|
2116
|
-
return message;
|
|
2117
2270
|
},
|
|
2118
2271
|
|
|
2119
2272
|
fromJSON(object: any): ListTraceRuleSchemasRequest {
|
|
@@ -2161,34 +2314,43 @@ export const ListTraceRuleSchemasResponse: MessageFns<ListTraceRuleSchemasRespon
|
|
|
2161
2314
|
|
|
2162
2315
|
decode(input: BinaryReader | Uint8Array, length?: number): ListTraceRuleSchemasResponse {
|
|
2163
2316
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2164
|
-
const
|
|
2165
|
-
|
|
2166
|
-
|
|
2167
|
-
|
|
2168
|
-
|
|
2169
|
-
|
|
2170
|
-
|
|
2171
|
-
|
|
2172
|
-
|
|
2173
|
-
|
|
2174
|
-
|
|
2175
|
-
|
|
2176
|
-
|
|
2177
|
-
|
|
2178
|
-
|
|
2179
|
-
|
|
2180
|
-
|
|
2181
|
-
|
|
2182
|
-
|
|
2183
|
-
|
|
2184
|
-
|
|
2185
|
-
|
|
2186
|
-
|
|
2187
|
-
|
|
2317
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
2318
|
+
if (previousRecursionDepth >= 100) {
|
|
2319
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2320
|
+
}
|
|
2321
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2322
|
+
try {
|
|
2323
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2324
|
+
const message = createBaseListTraceRuleSchemasResponse();
|
|
2325
|
+
while (reader.pos < end) {
|
|
2326
|
+
const tag = reader.uint32();
|
|
2327
|
+
switch (tag >>> 3) {
|
|
2328
|
+
case 1: {
|
|
2329
|
+
if (tag !== 10) {
|
|
2330
|
+
break;
|
|
2331
|
+
}
|
|
2332
|
+
|
|
2333
|
+
message.status = ResponseStatus.decode(reader, reader.uint32());
|
|
2334
|
+
continue;
|
|
2335
|
+
}
|
|
2336
|
+
case 2: {
|
|
2337
|
+
if (tag !== 18) {
|
|
2338
|
+
break;
|
|
2339
|
+
}
|
|
2340
|
+
|
|
2341
|
+
message.schemas.push(TraceRuleSchema.decode(reader, reader.uint32()));
|
|
2342
|
+
continue;
|
|
2343
|
+
}
|
|
2344
|
+
}
|
|
2345
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2346
|
+
break;
|
|
2347
|
+
}
|
|
2348
|
+
reader.skip(tag & 7);
|
|
2188
2349
|
}
|
|
2189
|
-
|
|
2350
|
+
return message;
|
|
2351
|
+
} finally {
|
|
2352
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2190
2353
|
}
|
|
2191
|
-
return message;
|
|
2192
2354
|
},
|
|
2193
2355
|
|
|
2194
2356
|
fromJSON(object: any): ListTraceRuleSchemasResponse {
|
|
@@ -2247,50 +2409,59 @@ export const TraceRuleSchema: MessageFns<TraceRuleSchema> = {
|
|
|
2247
2409
|
|
|
2248
2410
|
decode(input: BinaryReader | Uint8Array, length?: number): TraceRuleSchema {
|
|
2249
2411
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2250
|
-
const
|
|
2251
|
-
|
|
2252
|
-
|
|
2253
|
-
|
|
2254
|
-
|
|
2255
|
-
|
|
2256
|
-
|
|
2257
|
-
|
|
2258
|
-
|
|
2259
|
-
|
|
2260
|
-
|
|
2261
|
-
|
|
2262
|
-
|
|
2263
|
-
|
|
2264
|
-
|
|
2265
|
-
|
|
2266
|
-
|
|
2267
|
-
|
|
2268
|
-
|
|
2269
|
-
|
|
2270
|
-
|
|
2271
|
-
|
|
2272
|
-
|
|
2273
|
-
|
|
2274
|
-
|
|
2275
|
-
|
|
2276
|
-
|
|
2277
|
-
|
|
2278
|
-
|
|
2279
|
-
|
|
2280
|
-
|
|
2281
|
-
|
|
2282
|
-
|
|
2283
|
-
|
|
2284
|
-
|
|
2285
|
-
|
|
2286
|
-
|
|
2412
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
2413
|
+
if (previousRecursionDepth >= 100) {
|
|
2414
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2415
|
+
}
|
|
2416
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2417
|
+
try {
|
|
2418
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2419
|
+
const message = createBaseTraceRuleSchema();
|
|
2420
|
+
while (reader.pos < end) {
|
|
2421
|
+
const tag = reader.uint32();
|
|
2422
|
+
switch (tag >>> 3) {
|
|
2423
|
+
case 1: {
|
|
2424
|
+
if (tag !== 10) {
|
|
2425
|
+
break;
|
|
2426
|
+
}
|
|
2427
|
+
|
|
2428
|
+
message.id = reader.string();
|
|
2429
|
+
continue;
|
|
2430
|
+
}
|
|
2431
|
+
case 2: {
|
|
2432
|
+
if (tag !== 18) {
|
|
2433
|
+
break;
|
|
2434
|
+
}
|
|
2435
|
+
|
|
2436
|
+
message.label = reader.string();
|
|
2437
|
+
continue;
|
|
2438
|
+
}
|
|
2439
|
+
case 3: {
|
|
2440
|
+
if (tag !== 26) {
|
|
2441
|
+
break;
|
|
2442
|
+
}
|
|
2443
|
+
|
|
2444
|
+
message.rootVariable = reader.string();
|
|
2445
|
+
continue;
|
|
2446
|
+
}
|
|
2447
|
+
case 4: {
|
|
2448
|
+
if (tag !== 34) {
|
|
2449
|
+
break;
|
|
2450
|
+
}
|
|
2451
|
+
|
|
2452
|
+
message.jsonSchema = reader.string();
|
|
2453
|
+
continue;
|
|
2454
|
+
}
|
|
2455
|
+
}
|
|
2456
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2457
|
+
break;
|
|
2458
|
+
}
|
|
2459
|
+
reader.skip(tag & 7);
|
|
2287
2460
|
}
|
|
2288
|
-
|
|
2289
|
-
|
|
2290
|
-
|
|
2291
|
-
reader.skip(tag & 7);
|
|
2461
|
+
return message;
|
|
2462
|
+
} finally {
|
|
2463
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2292
2464
|
}
|
|
2293
|
-
return message;
|
|
2294
2465
|
},
|
|
2295
2466
|
|
|
2296
2467
|
fromJSON(object: any): TraceRuleSchema {
|
|
@@ -2360,42 +2531,51 @@ export const StreamTraceRuleActivityRequest: MessageFns<StreamTraceRuleActivityR
|
|
|
2360
2531
|
|
|
2361
2532
|
decode(input: BinaryReader | Uint8Array, length?: number): StreamTraceRuleActivityRequest {
|
|
2362
2533
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2363
|
-
const
|
|
2364
|
-
|
|
2365
|
-
|
|
2366
|
-
|
|
2367
|
-
|
|
2368
|
-
|
|
2369
|
-
|
|
2370
|
-
|
|
2371
|
-
|
|
2372
|
-
|
|
2373
|
-
|
|
2374
|
-
|
|
2375
|
-
|
|
2376
|
-
|
|
2377
|
-
|
|
2378
|
-
|
|
2379
|
-
|
|
2380
|
-
|
|
2381
|
-
|
|
2382
|
-
|
|
2383
|
-
|
|
2384
|
-
|
|
2385
|
-
|
|
2386
|
-
|
|
2387
|
-
|
|
2388
|
-
|
|
2389
|
-
|
|
2390
|
-
|
|
2391
|
-
|
|
2534
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
2535
|
+
if (previousRecursionDepth >= 100) {
|
|
2536
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2537
|
+
}
|
|
2538
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2539
|
+
try {
|
|
2540
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2541
|
+
const message = createBaseStreamTraceRuleActivityRequest();
|
|
2542
|
+
while (reader.pos < end) {
|
|
2543
|
+
const tag = reader.uint32();
|
|
2544
|
+
switch (tag >>> 3) {
|
|
2545
|
+
case 1: {
|
|
2546
|
+
if (tag !== 10) {
|
|
2547
|
+
break;
|
|
2548
|
+
}
|
|
2549
|
+
|
|
2550
|
+
message.projectId = reader.string();
|
|
2551
|
+
continue;
|
|
2552
|
+
}
|
|
2553
|
+
case 2: {
|
|
2554
|
+
if (tag !== 18) {
|
|
2555
|
+
break;
|
|
2556
|
+
}
|
|
2557
|
+
|
|
2558
|
+
message.organizationId = reader.string();
|
|
2559
|
+
continue;
|
|
2560
|
+
}
|
|
2561
|
+
case 3: {
|
|
2562
|
+
if (tag !== 24) {
|
|
2563
|
+
break;
|
|
2564
|
+
}
|
|
2565
|
+
|
|
2566
|
+
message.limit = reader.int32();
|
|
2567
|
+
continue;
|
|
2568
|
+
}
|
|
2569
|
+
}
|
|
2570
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2571
|
+
break;
|
|
2572
|
+
}
|
|
2573
|
+
reader.skip(tag & 7);
|
|
2392
2574
|
}
|
|
2393
|
-
|
|
2394
|
-
|
|
2395
|
-
|
|
2396
|
-
reader.skip(tag & 7);
|
|
2575
|
+
return message;
|
|
2576
|
+
} finally {
|
|
2577
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2397
2578
|
}
|
|
2398
|
-
return message;
|
|
2399
2579
|
},
|
|
2400
2580
|
|
|
2401
2581
|
fromJSON(object: any): StreamTraceRuleActivityRequest {
|
|
@@ -2459,34 +2639,43 @@ export const TraceRuleActivityEnvelope: MessageFns<TraceRuleActivityEnvelope> =
|
|
|
2459
2639
|
|
|
2460
2640
|
decode(input: BinaryReader | Uint8Array, length?: number): TraceRuleActivityEnvelope {
|
|
2461
2641
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2462
|
-
const
|
|
2463
|
-
|
|
2464
|
-
|
|
2465
|
-
|
|
2466
|
-
|
|
2467
|
-
|
|
2468
|
-
|
|
2469
|
-
|
|
2470
|
-
|
|
2471
|
-
|
|
2472
|
-
|
|
2473
|
-
|
|
2474
|
-
|
|
2475
|
-
|
|
2476
|
-
|
|
2477
|
-
|
|
2478
|
-
|
|
2479
|
-
|
|
2480
|
-
|
|
2481
|
-
|
|
2482
|
-
|
|
2483
|
-
|
|
2484
|
-
|
|
2485
|
-
|
|
2642
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
2643
|
+
if (previousRecursionDepth >= 100) {
|
|
2644
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2645
|
+
}
|
|
2646
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2647
|
+
try {
|
|
2648
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2649
|
+
const message = createBaseTraceRuleActivityEnvelope();
|
|
2650
|
+
while (reader.pos < end) {
|
|
2651
|
+
const tag = reader.uint32();
|
|
2652
|
+
switch (tag >>> 3) {
|
|
2653
|
+
case 1: {
|
|
2654
|
+
if (tag !== 10) {
|
|
2655
|
+
break;
|
|
2656
|
+
}
|
|
2657
|
+
|
|
2658
|
+
message.snapshot = TraceRuleActivitySnapshot.decode(reader, reader.uint32());
|
|
2659
|
+
continue;
|
|
2660
|
+
}
|
|
2661
|
+
case 2: {
|
|
2662
|
+
if (tag !== 18) {
|
|
2663
|
+
break;
|
|
2664
|
+
}
|
|
2665
|
+
|
|
2666
|
+
message.update = TraceRuleActivityEvent.decode(reader, reader.uint32());
|
|
2667
|
+
continue;
|
|
2668
|
+
}
|
|
2669
|
+
}
|
|
2670
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2671
|
+
break;
|
|
2672
|
+
}
|
|
2673
|
+
reader.skip(tag & 7);
|
|
2486
2674
|
}
|
|
2487
|
-
|
|
2675
|
+
return message;
|
|
2676
|
+
} finally {
|
|
2677
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2488
2678
|
}
|
|
2489
|
-
return message;
|
|
2490
2679
|
},
|
|
2491
2680
|
|
|
2492
2681
|
fromJSON(object: any): TraceRuleActivityEnvelope {
|
|
@@ -2536,26 +2725,35 @@ export const TraceRuleActivitySnapshot: MessageFns<TraceRuleActivitySnapshot> =
|
|
|
2536
2725
|
|
|
2537
2726
|
decode(input: BinaryReader | Uint8Array, length?: number): TraceRuleActivitySnapshot {
|
|
2538
2727
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2539
|
-
const
|
|
2540
|
-
|
|
2541
|
-
|
|
2542
|
-
|
|
2543
|
-
|
|
2544
|
-
|
|
2545
|
-
|
|
2546
|
-
|
|
2547
|
-
|
|
2548
|
-
|
|
2549
|
-
|
|
2550
|
-
|
|
2551
|
-
|
|
2728
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
2729
|
+
if (previousRecursionDepth >= 100) {
|
|
2730
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2731
|
+
}
|
|
2732
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2733
|
+
try {
|
|
2734
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2735
|
+
const message = createBaseTraceRuleActivitySnapshot();
|
|
2736
|
+
while (reader.pos < end) {
|
|
2737
|
+
const tag = reader.uint32();
|
|
2738
|
+
switch (tag >>> 3) {
|
|
2739
|
+
case 1: {
|
|
2740
|
+
if (tag !== 10) {
|
|
2741
|
+
break;
|
|
2742
|
+
}
|
|
2743
|
+
|
|
2744
|
+
message.activities.push(TraceRuleActivityEvent.decode(reader, reader.uint32()));
|
|
2745
|
+
continue;
|
|
2746
|
+
}
|
|
2747
|
+
}
|
|
2748
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2749
|
+
break;
|
|
2750
|
+
}
|
|
2751
|
+
reader.skip(tag & 7);
|
|
2552
2752
|
}
|
|
2553
|
-
|
|
2554
|
-
|
|
2555
|
-
|
|
2556
|
-
reader.skip(tag & 7);
|
|
2753
|
+
return message;
|
|
2754
|
+
} finally {
|
|
2755
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2557
2756
|
}
|
|
2558
|
-
return message;
|
|
2559
2757
|
},
|
|
2560
2758
|
|
|
2561
2759
|
fromJSON(object: any): TraceRuleActivitySnapshot {
|
|
@@ -2628,82 +2826,91 @@ export const TraceRuleActivityEvent: MessageFns<TraceRuleActivityEvent> = {
|
|
|
2628
2826
|
|
|
2629
2827
|
decode(input: BinaryReader | Uint8Array, length?: number): TraceRuleActivityEvent {
|
|
2630
2828
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2631
|
-
const
|
|
2632
|
-
|
|
2633
|
-
|
|
2634
|
-
|
|
2635
|
-
|
|
2636
|
-
|
|
2637
|
-
|
|
2638
|
-
|
|
2639
|
-
|
|
2640
|
-
|
|
2641
|
-
|
|
2642
|
-
|
|
2643
|
-
|
|
2644
|
-
|
|
2645
|
-
|
|
2646
|
-
|
|
2647
|
-
|
|
2648
|
-
|
|
2649
|
-
|
|
2650
|
-
|
|
2651
|
-
|
|
2652
|
-
|
|
2653
|
-
|
|
2654
|
-
|
|
2655
|
-
|
|
2656
|
-
|
|
2657
|
-
|
|
2658
|
-
|
|
2659
|
-
|
|
2660
|
-
|
|
2661
|
-
|
|
2662
|
-
|
|
2663
|
-
|
|
2664
|
-
|
|
2665
|
-
|
|
2666
|
-
|
|
2667
|
-
|
|
2668
|
-
|
|
2669
|
-
|
|
2670
|
-
|
|
2671
|
-
|
|
2672
|
-
|
|
2673
|
-
|
|
2674
|
-
|
|
2675
|
-
|
|
2676
|
-
|
|
2677
|
-
|
|
2678
|
-
|
|
2679
|
-
|
|
2680
|
-
|
|
2681
|
-
|
|
2682
|
-
|
|
2683
|
-
|
|
2684
|
-
|
|
2685
|
-
|
|
2686
|
-
|
|
2687
|
-
|
|
2688
|
-
|
|
2689
|
-
|
|
2690
|
-
|
|
2691
|
-
|
|
2692
|
-
|
|
2693
|
-
|
|
2694
|
-
|
|
2695
|
-
|
|
2696
|
-
|
|
2697
|
-
|
|
2698
|
-
|
|
2699
|
-
|
|
2829
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
2830
|
+
if (previousRecursionDepth >= 100) {
|
|
2831
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2832
|
+
}
|
|
2833
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2834
|
+
try {
|
|
2835
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2836
|
+
const message = createBaseTraceRuleActivityEvent();
|
|
2837
|
+
while (reader.pos < end) {
|
|
2838
|
+
const tag = reader.uint32();
|
|
2839
|
+
switch (tag >>> 3) {
|
|
2840
|
+
case 1: {
|
|
2841
|
+
if (tag !== 10) {
|
|
2842
|
+
break;
|
|
2843
|
+
}
|
|
2844
|
+
|
|
2845
|
+
message.activityId = reader.string();
|
|
2846
|
+
continue;
|
|
2847
|
+
}
|
|
2848
|
+
case 2: {
|
|
2849
|
+
if (tag !== 18) {
|
|
2850
|
+
break;
|
|
2851
|
+
}
|
|
2852
|
+
|
|
2853
|
+
message.ruleId = reader.string();
|
|
2854
|
+
continue;
|
|
2855
|
+
}
|
|
2856
|
+
case 3: {
|
|
2857
|
+
if (tag !== 26) {
|
|
2858
|
+
break;
|
|
2859
|
+
}
|
|
2860
|
+
|
|
2861
|
+
message.ruleName = reader.string();
|
|
2862
|
+
continue;
|
|
2863
|
+
}
|
|
2864
|
+
case 4: {
|
|
2865
|
+
if (tag !== 34) {
|
|
2866
|
+
break;
|
|
2867
|
+
}
|
|
2868
|
+
|
|
2869
|
+
message.traceId = reader.string();
|
|
2870
|
+
continue;
|
|
2871
|
+
}
|
|
2872
|
+
case 5: {
|
|
2873
|
+
if (tag !== 40) {
|
|
2874
|
+
break;
|
|
2875
|
+
}
|
|
2876
|
+
|
|
2877
|
+
message.admittedTraceVersion = longToNumber(reader.uint64());
|
|
2878
|
+
continue;
|
|
2879
|
+
}
|
|
2880
|
+
case 6: {
|
|
2881
|
+
if (tag !== 50) {
|
|
2882
|
+
break;
|
|
2883
|
+
}
|
|
2884
|
+
|
|
2885
|
+
message.traceName = reader.string();
|
|
2886
|
+
continue;
|
|
2887
|
+
}
|
|
2888
|
+
case 7: {
|
|
2889
|
+
if (tag !== 58) {
|
|
2890
|
+
break;
|
|
2891
|
+
}
|
|
2892
|
+
|
|
2893
|
+
message.matchReason = reader.string();
|
|
2894
|
+
continue;
|
|
2895
|
+
}
|
|
2896
|
+
case 8: {
|
|
2897
|
+
if (tag !== 66) {
|
|
2898
|
+
break;
|
|
2899
|
+
}
|
|
2900
|
+
|
|
2901
|
+
message.occurredAt = fromTimestamp(Timestamp.decode(reader, reader.uint32()));
|
|
2902
|
+
continue;
|
|
2903
|
+
}
|
|
2904
|
+
}
|
|
2905
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2906
|
+
break;
|
|
2907
|
+
}
|
|
2908
|
+
reader.skip(tag & 7);
|
|
2700
2909
|
}
|
|
2701
|
-
|
|
2702
|
-
|
|
2703
|
-
|
|
2704
|
-
reader.skip(tag & 7);
|
|
2910
|
+
return message;
|
|
2911
|
+
} finally {
|
|
2912
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2705
2913
|
}
|
|
2706
|
-
return message;
|
|
2707
2914
|
},
|
|
2708
2915
|
|
|
2709
2916
|
fromJSON(object: any): TraceRuleActivityEvent {
|
|
@@ -2853,106 +3060,115 @@ export const MetricRule: MessageFns<MetricRule> = {
|
|
|
2853
3060
|
|
|
2854
3061
|
decode(input: BinaryReader | Uint8Array, length?: number): MetricRule {
|
|
2855
3062
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2856
|
-
const
|
|
2857
|
-
|
|
2858
|
-
|
|
2859
|
-
|
|
2860
|
-
|
|
2861
|
-
|
|
2862
|
-
|
|
2863
|
-
|
|
2864
|
-
|
|
2865
|
-
|
|
2866
|
-
|
|
2867
|
-
|
|
2868
|
-
|
|
2869
|
-
|
|
2870
|
-
|
|
2871
|
-
|
|
2872
|
-
|
|
2873
|
-
|
|
2874
|
-
|
|
2875
|
-
|
|
2876
|
-
|
|
2877
|
-
|
|
2878
|
-
|
|
2879
|
-
|
|
2880
|
-
|
|
2881
|
-
|
|
2882
|
-
|
|
2883
|
-
|
|
2884
|
-
|
|
2885
|
-
|
|
2886
|
-
|
|
2887
|
-
|
|
2888
|
-
|
|
2889
|
-
|
|
2890
|
-
|
|
2891
|
-
|
|
2892
|
-
|
|
2893
|
-
|
|
2894
|
-
|
|
2895
|
-
|
|
2896
|
-
|
|
2897
|
-
|
|
2898
|
-
|
|
2899
|
-
|
|
2900
|
-
|
|
2901
|
-
|
|
2902
|
-
|
|
2903
|
-
|
|
2904
|
-
|
|
2905
|
-
|
|
2906
|
-
|
|
2907
|
-
|
|
2908
|
-
|
|
2909
|
-
|
|
2910
|
-
|
|
2911
|
-
|
|
2912
|
-
|
|
2913
|
-
|
|
2914
|
-
|
|
2915
|
-
|
|
2916
|
-
|
|
2917
|
-
|
|
2918
|
-
|
|
2919
|
-
|
|
2920
|
-
|
|
2921
|
-
|
|
2922
|
-
|
|
2923
|
-
|
|
2924
|
-
|
|
2925
|
-
|
|
2926
|
-
|
|
2927
|
-
|
|
2928
|
-
|
|
2929
|
-
|
|
2930
|
-
|
|
2931
|
-
|
|
3063
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
3064
|
+
if (previousRecursionDepth >= 100) {
|
|
3065
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
3066
|
+
}
|
|
3067
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
3068
|
+
try {
|
|
3069
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
3070
|
+
const message = createBaseMetricRule();
|
|
3071
|
+
while (reader.pos < end) {
|
|
3072
|
+
const tag = reader.uint32();
|
|
3073
|
+
switch (tag >>> 3) {
|
|
3074
|
+
case 1: {
|
|
3075
|
+
if (tag !== 10) {
|
|
3076
|
+
break;
|
|
3077
|
+
}
|
|
3078
|
+
|
|
3079
|
+
message.id = reader.string();
|
|
3080
|
+
continue;
|
|
3081
|
+
}
|
|
3082
|
+
case 2: {
|
|
3083
|
+
if (tag !== 18) {
|
|
3084
|
+
break;
|
|
3085
|
+
}
|
|
3086
|
+
|
|
3087
|
+
message.projectId = reader.string();
|
|
3088
|
+
continue;
|
|
3089
|
+
}
|
|
3090
|
+
case 3: {
|
|
3091
|
+
if (tag !== 26) {
|
|
3092
|
+
break;
|
|
3093
|
+
}
|
|
3094
|
+
|
|
3095
|
+
message.organizationId = reader.string();
|
|
3096
|
+
continue;
|
|
3097
|
+
}
|
|
3098
|
+
case 4: {
|
|
3099
|
+
if (tag !== 34) {
|
|
3100
|
+
break;
|
|
3101
|
+
}
|
|
3102
|
+
|
|
3103
|
+
message.name = reader.string();
|
|
3104
|
+
continue;
|
|
3105
|
+
}
|
|
3106
|
+
case 5: {
|
|
3107
|
+
if (tag !== 42) {
|
|
3108
|
+
break;
|
|
3109
|
+
}
|
|
3110
|
+
|
|
3111
|
+
message.description = reader.string();
|
|
3112
|
+
continue;
|
|
3113
|
+
}
|
|
3114
|
+
case 6: {
|
|
3115
|
+
if (tag !== 48) {
|
|
3116
|
+
break;
|
|
3117
|
+
}
|
|
3118
|
+
|
|
3119
|
+
message.enabled = reader.int32() as any;
|
|
3120
|
+
continue;
|
|
3121
|
+
}
|
|
3122
|
+
case 7: {
|
|
3123
|
+
if (tag !== 58) {
|
|
3124
|
+
break;
|
|
3125
|
+
}
|
|
3126
|
+
|
|
3127
|
+
message.integrationIds.push(reader.string());
|
|
3128
|
+
continue;
|
|
3129
|
+
}
|
|
3130
|
+
case 8: {
|
|
3131
|
+
if (tag !== 66) {
|
|
3132
|
+
break;
|
|
3133
|
+
}
|
|
3134
|
+
|
|
3135
|
+
message.condition = MetricRuleCondition.decode(reader, reader.uint32());
|
|
3136
|
+
continue;
|
|
3137
|
+
}
|
|
3138
|
+
case 9: {
|
|
3139
|
+
if (tag !== 72) {
|
|
3140
|
+
break;
|
|
3141
|
+
}
|
|
3142
|
+
|
|
3143
|
+
message.severity = reader.int32() as any;
|
|
3144
|
+
continue;
|
|
3145
|
+
}
|
|
3146
|
+
case 10: {
|
|
3147
|
+
if (tag !== 82) {
|
|
3148
|
+
break;
|
|
3149
|
+
}
|
|
3150
|
+
|
|
3151
|
+
message.createdAt = fromTimestamp(Timestamp.decode(reader, reader.uint32()));
|
|
3152
|
+
continue;
|
|
3153
|
+
}
|
|
3154
|
+
case 11: {
|
|
3155
|
+
if (tag !== 90) {
|
|
3156
|
+
break;
|
|
3157
|
+
}
|
|
3158
|
+
|
|
3159
|
+
message.updatedAt = fromTimestamp(Timestamp.decode(reader, reader.uint32()));
|
|
3160
|
+
continue;
|
|
3161
|
+
}
|
|
3162
|
+
}
|
|
3163
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
3164
|
+
break;
|
|
2932
3165
|
}
|
|
2933
|
-
|
|
2934
|
-
if (tag !== 82) {
|
|
2935
|
-
break;
|
|
2936
|
-
}
|
|
2937
|
-
|
|
2938
|
-
message.createdAt = fromTimestamp(Timestamp.decode(reader, reader.uint32()));
|
|
2939
|
-
continue;
|
|
2940
|
-
}
|
|
2941
|
-
case 11: {
|
|
2942
|
-
if (tag !== 90) {
|
|
2943
|
-
break;
|
|
2944
|
-
}
|
|
2945
|
-
|
|
2946
|
-
message.updatedAt = fromTimestamp(Timestamp.decode(reader, reader.uint32()));
|
|
2947
|
-
continue;
|
|
2948
|
-
}
|
|
2949
|
-
}
|
|
2950
|
-
if ((tag & 7) === 4 || tag === 0) {
|
|
2951
|
-
break;
|
|
3166
|
+
reader.skip(tag & 7);
|
|
2952
3167
|
}
|
|
2953
|
-
|
|
3168
|
+
return message;
|
|
3169
|
+
} finally {
|
|
3170
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2954
3171
|
}
|
|
2955
|
-
return message;
|
|
2956
3172
|
},
|
|
2957
3173
|
|
|
2958
3174
|
fromJSON(object: any): MetricRule {
|
|
@@ -3068,34 +3284,43 @@ export const MetricRuleCondition: MessageFns<MetricRuleCondition> = {
|
|
|
3068
3284
|
|
|
3069
3285
|
decode(input: BinaryReader | Uint8Array, length?: number): MetricRuleCondition {
|
|
3070
3286
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
3071
|
-
const
|
|
3072
|
-
|
|
3073
|
-
|
|
3074
|
-
|
|
3075
|
-
|
|
3076
|
-
|
|
3077
|
-
|
|
3078
|
-
|
|
3079
|
-
|
|
3080
|
-
|
|
3081
|
-
|
|
3082
|
-
|
|
3083
|
-
|
|
3084
|
-
|
|
3085
|
-
|
|
3086
|
-
|
|
3087
|
-
|
|
3088
|
-
|
|
3089
|
-
|
|
3090
|
-
|
|
3091
|
-
|
|
3287
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
3288
|
+
if (previousRecursionDepth >= 100) {
|
|
3289
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
3290
|
+
}
|
|
3291
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
3292
|
+
try {
|
|
3293
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
3294
|
+
const message = createBaseMetricRuleCondition();
|
|
3295
|
+
while (reader.pos < end) {
|
|
3296
|
+
const tag = reader.uint32();
|
|
3297
|
+
switch (tag >>> 3) {
|
|
3298
|
+
case 1: {
|
|
3299
|
+
if (tag !== 10) {
|
|
3300
|
+
break;
|
|
3301
|
+
}
|
|
3302
|
+
|
|
3303
|
+
message.expression = reader.string();
|
|
3304
|
+
continue;
|
|
3305
|
+
}
|
|
3306
|
+
case 2: {
|
|
3307
|
+
if (tag !== 18) {
|
|
3308
|
+
break;
|
|
3309
|
+
}
|
|
3310
|
+
|
|
3311
|
+
message.recoveryExpression = reader.string();
|
|
3312
|
+
continue;
|
|
3313
|
+
}
|
|
3314
|
+
}
|
|
3315
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
3316
|
+
break;
|
|
3317
|
+
}
|
|
3318
|
+
reader.skip(tag & 7);
|
|
3092
3319
|
}
|
|
3093
|
-
|
|
3094
|
-
|
|
3095
|
-
|
|
3096
|
-
reader.skip(tag & 7);
|
|
3320
|
+
return message;
|
|
3321
|
+
} finally {
|
|
3322
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
3097
3323
|
}
|
|
3098
|
-
return message;
|
|
3099
3324
|
},
|
|
3100
3325
|
|
|
3101
3326
|
fromJSON(object: any): MetricRuleCondition {
|
|
@@ -3171,74 +3396,83 @@ export const CreateMetricRuleRequest: MessageFns<CreateMetricRuleRequest> = {
|
|
|
3171
3396
|
|
|
3172
3397
|
decode(input: BinaryReader | Uint8Array, length?: number): CreateMetricRuleRequest {
|
|
3173
3398
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
3174
|
-
const
|
|
3175
|
-
|
|
3176
|
-
|
|
3177
|
-
|
|
3178
|
-
|
|
3179
|
-
|
|
3180
|
-
|
|
3181
|
-
|
|
3182
|
-
|
|
3183
|
-
|
|
3184
|
-
|
|
3185
|
-
|
|
3186
|
-
|
|
3187
|
-
|
|
3188
|
-
|
|
3189
|
-
|
|
3190
|
-
|
|
3191
|
-
|
|
3192
|
-
|
|
3193
|
-
|
|
3194
|
-
|
|
3195
|
-
|
|
3196
|
-
|
|
3197
|
-
|
|
3198
|
-
|
|
3199
|
-
|
|
3200
|
-
|
|
3201
|
-
|
|
3202
|
-
|
|
3203
|
-
|
|
3204
|
-
|
|
3205
|
-
|
|
3206
|
-
|
|
3207
|
-
|
|
3208
|
-
|
|
3209
|
-
|
|
3210
|
-
|
|
3211
|
-
|
|
3212
|
-
|
|
3213
|
-
|
|
3214
|
-
|
|
3215
|
-
|
|
3216
|
-
|
|
3217
|
-
|
|
3218
|
-
|
|
3219
|
-
|
|
3220
|
-
|
|
3221
|
-
|
|
3222
|
-
|
|
3223
|
-
|
|
3224
|
-
|
|
3225
|
-
|
|
3226
|
-
|
|
3227
|
-
|
|
3228
|
-
|
|
3229
|
-
|
|
3230
|
-
|
|
3231
|
-
|
|
3232
|
-
|
|
3233
|
-
|
|
3234
|
-
|
|
3399
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
3400
|
+
if (previousRecursionDepth >= 100) {
|
|
3401
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
3402
|
+
}
|
|
3403
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
3404
|
+
try {
|
|
3405
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
3406
|
+
const message = createBaseCreateMetricRuleRequest();
|
|
3407
|
+
while (reader.pos < end) {
|
|
3408
|
+
const tag = reader.uint32();
|
|
3409
|
+
switch (tag >>> 3) {
|
|
3410
|
+
case 1: {
|
|
3411
|
+
if (tag !== 10) {
|
|
3412
|
+
break;
|
|
3413
|
+
}
|
|
3414
|
+
|
|
3415
|
+
message.projectId = reader.string();
|
|
3416
|
+
continue;
|
|
3417
|
+
}
|
|
3418
|
+
case 2: {
|
|
3419
|
+
if (tag !== 18) {
|
|
3420
|
+
break;
|
|
3421
|
+
}
|
|
3422
|
+
|
|
3423
|
+
message.name = reader.string();
|
|
3424
|
+
continue;
|
|
3425
|
+
}
|
|
3426
|
+
case 3: {
|
|
3427
|
+
if (tag !== 26) {
|
|
3428
|
+
break;
|
|
3429
|
+
}
|
|
3430
|
+
|
|
3431
|
+
message.description = reader.string();
|
|
3432
|
+
continue;
|
|
3433
|
+
}
|
|
3434
|
+
case 4: {
|
|
3435
|
+
if (tag !== 34) {
|
|
3436
|
+
break;
|
|
3437
|
+
}
|
|
3438
|
+
|
|
3439
|
+
message.integrationIds.push(reader.string());
|
|
3440
|
+
continue;
|
|
3441
|
+
}
|
|
3442
|
+
case 5: {
|
|
3443
|
+
if (tag !== 42) {
|
|
3444
|
+
break;
|
|
3445
|
+
}
|
|
3446
|
+
|
|
3447
|
+
message.condition = MetricRuleCondition.decode(reader, reader.uint32());
|
|
3448
|
+
continue;
|
|
3449
|
+
}
|
|
3450
|
+
case 6: {
|
|
3451
|
+
if (tag !== 48) {
|
|
3452
|
+
break;
|
|
3453
|
+
}
|
|
3454
|
+
|
|
3455
|
+
message.severity = reader.int32() as any;
|
|
3456
|
+
continue;
|
|
3457
|
+
}
|
|
3458
|
+
case 7: {
|
|
3459
|
+
if (tag !== 58) {
|
|
3460
|
+
break;
|
|
3461
|
+
}
|
|
3462
|
+
|
|
3463
|
+
message.organizationId = reader.string();
|
|
3464
|
+
continue;
|
|
3465
|
+
}
|
|
3466
|
+
}
|
|
3467
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
3468
|
+
break;
|
|
3469
|
+
}
|
|
3470
|
+
reader.skip(tag & 7);
|
|
3235
3471
|
}
|
|
3236
|
-
|
|
3237
|
-
|
|
3238
|
-
|
|
3239
|
-
reader.skip(tag & 7);
|
|
3472
|
+
return message;
|
|
3473
|
+
} finally {
|
|
3474
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
3240
3475
|
}
|
|
3241
|
-
return message;
|
|
3242
3476
|
},
|
|
3243
3477
|
|
|
3244
3478
|
fromJSON(object: any): CreateMetricRuleRequest {
|
|
@@ -3326,34 +3560,43 @@ export const CreateMetricRuleResponse: MessageFns<CreateMetricRuleResponse> = {
|
|
|
3326
3560
|
|
|
3327
3561
|
decode(input: BinaryReader | Uint8Array, length?: number): CreateMetricRuleResponse {
|
|
3328
3562
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
3329
|
-
const
|
|
3330
|
-
|
|
3331
|
-
|
|
3332
|
-
|
|
3333
|
-
|
|
3334
|
-
|
|
3335
|
-
|
|
3336
|
-
|
|
3337
|
-
|
|
3338
|
-
|
|
3339
|
-
|
|
3340
|
-
|
|
3341
|
-
|
|
3342
|
-
|
|
3343
|
-
|
|
3344
|
-
|
|
3345
|
-
|
|
3346
|
-
|
|
3347
|
-
|
|
3348
|
-
|
|
3349
|
-
|
|
3350
|
-
|
|
3351
|
-
|
|
3352
|
-
|
|
3563
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
3564
|
+
if (previousRecursionDepth >= 100) {
|
|
3565
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
3566
|
+
}
|
|
3567
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
3568
|
+
try {
|
|
3569
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
3570
|
+
const message = createBaseCreateMetricRuleResponse();
|
|
3571
|
+
while (reader.pos < end) {
|
|
3572
|
+
const tag = reader.uint32();
|
|
3573
|
+
switch (tag >>> 3) {
|
|
3574
|
+
case 1: {
|
|
3575
|
+
if (tag !== 10) {
|
|
3576
|
+
break;
|
|
3577
|
+
}
|
|
3578
|
+
|
|
3579
|
+
message.status = ResponseStatus.decode(reader, reader.uint32());
|
|
3580
|
+
continue;
|
|
3581
|
+
}
|
|
3582
|
+
case 2: {
|
|
3583
|
+
if (tag !== 18) {
|
|
3584
|
+
break;
|
|
3585
|
+
}
|
|
3586
|
+
|
|
3587
|
+
message.metricRule = MetricRule.decode(reader, reader.uint32());
|
|
3588
|
+
continue;
|
|
3589
|
+
}
|
|
3590
|
+
}
|
|
3591
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
3592
|
+
break;
|
|
3593
|
+
}
|
|
3594
|
+
reader.skip(tag & 7);
|
|
3353
3595
|
}
|
|
3354
|
-
|
|
3596
|
+
return message;
|
|
3597
|
+
} finally {
|
|
3598
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
3355
3599
|
}
|
|
3356
|
-
return message;
|
|
3357
3600
|
},
|
|
3358
3601
|
|
|
3359
3602
|
fromJSON(object: any): CreateMetricRuleResponse {
|
|
@@ -3413,42 +3656,51 @@ export const GetMetricRuleRequest: MessageFns<GetMetricRuleRequest> = {
|
|
|
3413
3656
|
|
|
3414
3657
|
decode(input: BinaryReader | Uint8Array, length?: number): GetMetricRuleRequest {
|
|
3415
3658
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
3416
|
-
const
|
|
3417
|
-
|
|
3418
|
-
|
|
3419
|
-
|
|
3420
|
-
|
|
3421
|
-
|
|
3422
|
-
|
|
3423
|
-
|
|
3424
|
-
|
|
3425
|
-
|
|
3426
|
-
|
|
3427
|
-
|
|
3428
|
-
|
|
3429
|
-
|
|
3430
|
-
|
|
3431
|
-
|
|
3432
|
-
|
|
3433
|
-
|
|
3434
|
-
|
|
3435
|
-
|
|
3436
|
-
|
|
3437
|
-
|
|
3438
|
-
|
|
3439
|
-
|
|
3440
|
-
|
|
3441
|
-
|
|
3442
|
-
|
|
3443
|
-
|
|
3444
|
-
|
|
3445
|
-
|
|
3446
|
-
|
|
3447
|
-
|
|
3659
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
3660
|
+
if (previousRecursionDepth >= 100) {
|
|
3661
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
3662
|
+
}
|
|
3663
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
3664
|
+
try {
|
|
3665
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
3666
|
+
const message = createBaseGetMetricRuleRequest();
|
|
3667
|
+
while (reader.pos < end) {
|
|
3668
|
+
const tag = reader.uint32();
|
|
3669
|
+
switch (tag >>> 3) {
|
|
3670
|
+
case 1: {
|
|
3671
|
+
if (tag !== 10) {
|
|
3672
|
+
break;
|
|
3673
|
+
}
|
|
3674
|
+
|
|
3675
|
+
message.projectId = reader.string();
|
|
3676
|
+
continue;
|
|
3677
|
+
}
|
|
3678
|
+
case 2: {
|
|
3679
|
+
if (tag !== 18) {
|
|
3680
|
+
break;
|
|
3681
|
+
}
|
|
3682
|
+
|
|
3683
|
+
message.metricRuleId = reader.string();
|
|
3684
|
+
continue;
|
|
3685
|
+
}
|
|
3686
|
+
case 3: {
|
|
3687
|
+
if (tag !== 26) {
|
|
3688
|
+
break;
|
|
3689
|
+
}
|
|
3690
|
+
|
|
3691
|
+
message.organizationId = reader.string();
|
|
3692
|
+
continue;
|
|
3693
|
+
}
|
|
3694
|
+
}
|
|
3695
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
3696
|
+
break;
|
|
3697
|
+
}
|
|
3698
|
+
reader.skip(tag & 7);
|
|
3448
3699
|
}
|
|
3449
|
-
|
|
3700
|
+
return message;
|
|
3701
|
+
} finally {
|
|
3702
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
3450
3703
|
}
|
|
3451
|
-
return message;
|
|
3452
3704
|
},
|
|
3453
3705
|
|
|
3454
3706
|
fromJSON(object: any): GetMetricRuleRequest {
|
|
@@ -3514,34 +3766,43 @@ export const GetMetricRuleResponse: MessageFns<GetMetricRuleResponse> = {
|
|
|
3514
3766
|
|
|
3515
3767
|
decode(input: BinaryReader | Uint8Array, length?: number): GetMetricRuleResponse {
|
|
3516
3768
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
3517
|
-
const
|
|
3518
|
-
|
|
3519
|
-
|
|
3520
|
-
|
|
3521
|
-
|
|
3522
|
-
|
|
3523
|
-
|
|
3524
|
-
|
|
3525
|
-
|
|
3526
|
-
|
|
3527
|
-
|
|
3528
|
-
|
|
3529
|
-
|
|
3530
|
-
|
|
3531
|
-
|
|
3532
|
-
|
|
3533
|
-
|
|
3534
|
-
|
|
3535
|
-
|
|
3536
|
-
|
|
3537
|
-
|
|
3538
|
-
|
|
3539
|
-
|
|
3540
|
-
|
|
3769
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
3770
|
+
if (previousRecursionDepth >= 100) {
|
|
3771
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
3772
|
+
}
|
|
3773
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
3774
|
+
try {
|
|
3775
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
3776
|
+
const message = createBaseGetMetricRuleResponse();
|
|
3777
|
+
while (reader.pos < end) {
|
|
3778
|
+
const tag = reader.uint32();
|
|
3779
|
+
switch (tag >>> 3) {
|
|
3780
|
+
case 1: {
|
|
3781
|
+
if (tag !== 10) {
|
|
3782
|
+
break;
|
|
3783
|
+
}
|
|
3784
|
+
|
|
3785
|
+
message.status = ResponseStatus.decode(reader, reader.uint32());
|
|
3786
|
+
continue;
|
|
3787
|
+
}
|
|
3788
|
+
case 2: {
|
|
3789
|
+
if (tag !== 18) {
|
|
3790
|
+
break;
|
|
3791
|
+
}
|
|
3792
|
+
|
|
3793
|
+
message.metricRule = MetricRule.decode(reader, reader.uint32());
|
|
3794
|
+
continue;
|
|
3795
|
+
}
|
|
3796
|
+
}
|
|
3797
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
3798
|
+
break;
|
|
3799
|
+
}
|
|
3800
|
+
reader.skip(tag & 7);
|
|
3541
3801
|
}
|
|
3542
|
-
|
|
3802
|
+
return message;
|
|
3803
|
+
} finally {
|
|
3804
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
3543
3805
|
}
|
|
3544
|
-
return message;
|
|
3545
3806
|
},
|
|
3546
3807
|
|
|
3547
3808
|
fromJSON(object: any): GetMetricRuleResponse {
|
|
@@ -3601,42 +3862,51 @@ export const ListMetricRulesRequest: MessageFns<ListMetricRulesRequest> = {
|
|
|
3601
3862
|
|
|
3602
3863
|
decode(input: BinaryReader | Uint8Array, length?: number): ListMetricRulesRequest {
|
|
3603
3864
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
3604
|
-
const
|
|
3605
|
-
|
|
3606
|
-
|
|
3607
|
-
|
|
3608
|
-
|
|
3609
|
-
|
|
3610
|
-
|
|
3611
|
-
|
|
3612
|
-
|
|
3613
|
-
|
|
3614
|
-
|
|
3615
|
-
|
|
3616
|
-
|
|
3617
|
-
|
|
3618
|
-
|
|
3619
|
-
|
|
3620
|
-
|
|
3621
|
-
|
|
3622
|
-
|
|
3623
|
-
|
|
3624
|
-
|
|
3625
|
-
|
|
3626
|
-
|
|
3627
|
-
|
|
3628
|
-
|
|
3629
|
-
|
|
3630
|
-
|
|
3631
|
-
|
|
3632
|
-
|
|
3633
|
-
|
|
3634
|
-
|
|
3635
|
-
|
|
3865
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
3866
|
+
if (previousRecursionDepth >= 100) {
|
|
3867
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
3868
|
+
}
|
|
3869
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
3870
|
+
try {
|
|
3871
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
3872
|
+
const message = createBaseListMetricRulesRequest();
|
|
3873
|
+
while (reader.pos < end) {
|
|
3874
|
+
const tag = reader.uint32();
|
|
3875
|
+
switch (tag >>> 3) {
|
|
3876
|
+
case 1: {
|
|
3877
|
+
if (tag !== 10) {
|
|
3878
|
+
break;
|
|
3879
|
+
}
|
|
3880
|
+
|
|
3881
|
+
message.organizationId = reader.string();
|
|
3882
|
+
continue;
|
|
3883
|
+
}
|
|
3884
|
+
case 2: {
|
|
3885
|
+
if (tag !== 18) {
|
|
3886
|
+
break;
|
|
3887
|
+
}
|
|
3888
|
+
|
|
3889
|
+
message.organizationIdFilter = reader.string();
|
|
3890
|
+
continue;
|
|
3891
|
+
}
|
|
3892
|
+
case 3: {
|
|
3893
|
+
if (tag !== 26) {
|
|
3894
|
+
break;
|
|
3895
|
+
}
|
|
3896
|
+
|
|
3897
|
+
message.projectIdFilter = reader.string();
|
|
3898
|
+
continue;
|
|
3899
|
+
}
|
|
3900
|
+
}
|
|
3901
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
3902
|
+
break;
|
|
3903
|
+
}
|
|
3904
|
+
reader.skip(tag & 7);
|
|
3636
3905
|
}
|
|
3637
|
-
|
|
3906
|
+
return message;
|
|
3907
|
+
} finally {
|
|
3908
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
3638
3909
|
}
|
|
3639
|
-
return message;
|
|
3640
3910
|
},
|
|
3641
3911
|
|
|
3642
3912
|
fromJSON(object: any): ListMetricRulesRequest {
|
|
@@ -3702,34 +3972,43 @@ export const ListMetricRulesResponse: MessageFns<ListMetricRulesResponse> = {
|
|
|
3702
3972
|
|
|
3703
3973
|
decode(input: BinaryReader | Uint8Array, length?: number): ListMetricRulesResponse {
|
|
3704
3974
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
3705
|
-
const
|
|
3706
|
-
|
|
3707
|
-
|
|
3708
|
-
|
|
3709
|
-
|
|
3710
|
-
|
|
3711
|
-
|
|
3712
|
-
|
|
3713
|
-
|
|
3714
|
-
|
|
3715
|
-
|
|
3716
|
-
|
|
3717
|
-
|
|
3718
|
-
|
|
3719
|
-
|
|
3720
|
-
|
|
3721
|
-
|
|
3722
|
-
|
|
3723
|
-
|
|
3724
|
-
|
|
3725
|
-
|
|
3975
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
3976
|
+
if (previousRecursionDepth >= 100) {
|
|
3977
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
3978
|
+
}
|
|
3979
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
3980
|
+
try {
|
|
3981
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
3982
|
+
const message = createBaseListMetricRulesResponse();
|
|
3983
|
+
while (reader.pos < end) {
|
|
3984
|
+
const tag = reader.uint32();
|
|
3985
|
+
switch (tag >>> 3) {
|
|
3986
|
+
case 1: {
|
|
3987
|
+
if (tag !== 10) {
|
|
3988
|
+
break;
|
|
3989
|
+
}
|
|
3990
|
+
|
|
3991
|
+
message.status = ResponseStatus.decode(reader, reader.uint32());
|
|
3992
|
+
continue;
|
|
3993
|
+
}
|
|
3994
|
+
case 2: {
|
|
3995
|
+
if (tag !== 18) {
|
|
3996
|
+
break;
|
|
3997
|
+
}
|
|
3998
|
+
|
|
3999
|
+
message.metricRules.push(MetricRule.decode(reader, reader.uint32()));
|
|
4000
|
+
continue;
|
|
4001
|
+
}
|
|
4002
|
+
}
|
|
4003
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
4004
|
+
break;
|
|
4005
|
+
}
|
|
4006
|
+
reader.skip(tag & 7);
|
|
3726
4007
|
}
|
|
3727
|
-
|
|
3728
|
-
|
|
3729
|
-
|
|
3730
|
-
reader.skip(tag & 7);
|
|
4008
|
+
return message;
|
|
4009
|
+
} finally {
|
|
4010
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
3731
4011
|
}
|
|
3732
|
-
return message;
|
|
3733
4012
|
},
|
|
3734
4013
|
|
|
3735
4014
|
fromJSON(object: any): ListMetricRulesResponse {
|
|
@@ -3790,50 +4069,59 @@ export const UpdateMetricRuleRequest: MessageFns<UpdateMetricRuleRequest> = {
|
|
|
3790
4069
|
|
|
3791
4070
|
decode(input: BinaryReader | Uint8Array, length?: number): UpdateMetricRuleRequest {
|
|
3792
4071
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
3793
|
-
const
|
|
3794
|
-
|
|
3795
|
-
|
|
3796
|
-
|
|
3797
|
-
|
|
3798
|
-
|
|
3799
|
-
|
|
3800
|
-
|
|
3801
|
-
|
|
3802
|
-
|
|
3803
|
-
|
|
3804
|
-
|
|
3805
|
-
|
|
3806
|
-
|
|
3807
|
-
|
|
3808
|
-
|
|
3809
|
-
|
|
3810
|
-
|
|
3811
|
-
|
|
3812
|
-
|
|
3813
|
-
|
|
3814
|
-
|
|
3815
|
-
|
|
3816
|
-
|
|
3817
|
-
|
|
3818
|
-
|
|
3819
|
-
|
|
3820
|
-
|
|
3821
|
-
|
|
3822
|
-
|
|
3823
|
-
|
|
3824
|
-
|
|
3825
|
-
|
|
3826
|
-
|
|
3827
|
-
|
|
3828
|
-
|
|
3829
|
-
|
|
3830
|
-
|
|
3831
|
-
|
|
3832
|
-
|
|
4072
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
4073
|
+
if (previousRecursionDepth >= 100) {
|
|
4074
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
4075
|
+
}
|
|
4076
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
4077
|
+
try {
|
|
4078
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
4079
|
+
const message = createBaseUpdateMetricRuleRequest();
|
|
4080
|
+
while (reader.pos < end) {
|
|
4081
|
+
const tag = reader.uint32();
|
|
4082
|
+
switch (tag >>> 3) {
|
|
4083
|
+
case 1: {
|
|
4084
|
+
if (tag !== 10) {
|
|
4085
|
+
break;
|
|
4086
|
+
}
|
|
4087
|
+
|
|
4088
|
+
message.projectId = reader.string();
|
|
4089
|
+
continue;
|
|
4090
|
+
}
|
|
4091
|
+
case 2: {
|
|
4092
|
+
if (tag !== 18) {
|
|
4093
|
+
break;
|
|
4094
|
+
}
|
|
4095
|
+
|
|
4096
|
+
message.metricRuleId = reader.string();
|
|
4097
|
+
continue;
|
|
4098
|
+
}
|
|
4099
|
+
case 3: {
|
|
4100
|
+
if (tag !== 26) {
|
|
4101
|
+
break;
|
|
4102
|
+
}
|
|
4103
|
+
|
|
4104
|
+
message.updates = UpdateMetricRuleRequest_MetricRuleUpdates.decode(reader, reader.uint32());
|
|
4105
|
+
continue;
|
|
4106
|
+
}
|
|
4107
|
+
case 4: {
|
|
4108
|
+
if (tag !== 34) {
|
|
4109
|
+
break;
|
|
4110
|
+
}
|
|
4111
|
+
|
|
4112
|
+
message.organizationId = reader.string();
|
|
4113
|
+
continue;
|
|
4114
|
+
}
|
|
4115
|
+
}
|
|
4116
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
4117
|
+
break;
|
|
4118
|
+
}
|
|
4119
|
+
reader.skip(tag & 7);
|
|
3833
4120
|
}
|
|
3834
|
-
|
|
4121
|
+
return message;
|
|
4122
|
+
} finally {
|
|
4123
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
3835
4124
|
}
|
|
3836
|
-
return message;
|
|
3837
4125
|
},
|
|
3838
4126
|
|
|
3839
4127
|
fromJSON(object: any): UpdateMetricRuleRequest {
|
|
@@ -3903,26 +4191,35 @@ export const UpdateMetricRuleRequest_Condition: MessageFns<UpdateMetricRuleReque
|
|
|
3903
4191
|
|
|
3904
4192
|
decode(input: BinaryReader | Uint8Array, length?: number): UpdateMetricRuleRequest_Condition {
|
|
3905
4193
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
3906
|
-
const
|
|
3907
|
-
|
|
3908
|
-
|
|
3909
|
-
|
|
3910
|
-
|
|
3911
|
-
|
|
3912
|
-
|
|
3913
|
-
|
|
3914
|
-
|
|
3915
|
-
|
|
3916
|
-
|
|
3917
|
-
|
|
3918
|
-
|
|
4194
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
4195
|
+
if (previousRecursionDepth >= 100) {
|
|
4196
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
4197
|
+
}
|
|
4198
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
4199
|
+
try {
|
|
4200
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
4201
|
+
const message = createBaseUpdateMetricRuleRequest_Condition();
|
|
4202
|
+
while (reader.pos < end) {
|
|
4203
|
+
const tag = reader.uint32();
|
|
4204
|
+
switch (tag >>> 3) {
|
|
4205
|
+
case 1: {
|
|
4206
|
+
if (tag !== 10) {
|
|
4207
|
+
break;
|
|
4208
|
+
}
|
|
4209
|
+
|
|
4210
|
+
message.condition = MetricRuleCondition.decode(reader, reader.uint32());
|
|
4211
|
+
continue;
|
|
4212
|
+
}
|
|
4213
|
+
}
|
|
4214
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
4215
|
+
break;
|
|
4216
|
+
}
|
|
4217
|
+
reader.skip(tag & 7);
|
|
3919
4218
|
}
|
|
3920
|
-
|
|
3921
|
-
|
|
3922
|
-
|
|
3923
|
-
reader.skip(tag & 7);
|
|
4219
|
+
return message;
|
|
4220
|
+
} finally {
|
|
4221
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
3924
4222
|
}
|
|
3925
|
-
return message;
|
|
3926
4223
|
},
|
|
3927
4224
|
|
|
3928
4225
|
fromJSON(object: any): UpdateMetricRuleRequest_Condition {
|
|
@@ -3967,26 +4264,35 @@ export const UpdateMetricRuleRequest_IntegrationIds: MessageFns<UpdateMetricRule
|
|
|
3967
4264
|
|
|
3968
4265
|
decode(input: BinaryReader | Uint8Array, length?: number): UpdateMetricRuleRequest_IntegrationIds {
|
|
3969
4266
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
3970
|
-
const
|
|
3971
|
-
|
|
3972
|
-
|
|
3973
|
-
|
|
3974
|
-
|
|
3975
|
-
|
|
3976
|
-
|
|
3977
|
-
|
|
3978
|
-
|
|
3979
|
-
|
|
3980
|
-
|
|
3981
|
-
|
|
3982
|
-
|
|
3983
|
-
|
|
3984
|
-
|
|
3985
|
-
|
|
4267
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
4268
|
+
if (previousRecursionDepth >= 100) {
|
|
4269
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
4270
|
+
}
|
|
4271
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
4272
|
+
try {
|
|
4273
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
4274
|
+
const message = createBaseUpdateMetricRuleRequest_IntegrationIds();
|
|
4275
|
+
while (reader.pos < end) {
|
|
4276
|
+
const tag = reader.uint32();
|
|
4277
|
+
switch (tag >>> 3) {
|
|
4278
|
+
case 1: {
|
|
4279
|
+
if (tag !== 10) {
|
|
4280
|
+
break;
|
|
4281
|
+
}
|
|
4282
|
+
|
|
4283
|
+
message.ids.push(reader.string());
|
|
4284
|
+
continue;
|
|
4285
|
+
}
|
|
4286
|
+
}
|
|
4287
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
4288
|
+
break;
|
|
4289
|
+
}
|
|
4290
|
+
reader.skip(tag & 7);
|
|
3986
4291
|
}
|
|
3987
|
-
|
|
4292
|
+
return message;
|
|
4293
|
+
} finally {
|
|
4294
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
3988
4295
|
}
|
|
3989
|
-
return message;
|
|
3990
4296
|
},
|
|
3991
4297
|
|
|
3992
4298
|
fromJSON(object: any): UpdateMetricRuleRequest_IntegrationIds {
|
|
@@ -4051,66 +4357,75 @@ export const UpdateMetricRuleRequest_MetricRuleUpdates: MessageFns<UpdateMetricR
|
|
|
4051
4357
|
|
|
4052
4358
|
decode(input: BinaryReader | Uint8Array, length?: number): UpdateMetricRuleRequest_MetricRuleUpdates {
|
|
4053
4359
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
4054
|
-
const
|
|
4055
|
-
|
|
4056
|
-
|
|
4057
|
-
|
|
4058
|
-
|
|
4059
|
-
|
|
4060
|
-
|
|
4061
|
-
|
|
4062
|
-
|
|
4063
|
-
|
|
4064
|
-
|
|
4065
|
-
|
|
4066
|
-
|
|
4067
|
-
|
|
4068
|
-
|
|
4069
|
-
|
|
4070
|
-
|
|
4071
|
-
|
|
4072
|
-
|
|
4073
|
-
|
|
4074
|
-
|
|
4075
|
-
|
|
4076
|
-
|
|
4077
|
-
|
|
4078
|
-
|
|
4079
|
-
|
|
4080
|
-
|
|
4081
|
-
|
|
4082
|
-
|
|
4083
|
-
|
|
4084
|
-
|
|
4085
|
-
|
|
4086
|
-
|
|
4087
|
-
|
|
4088
|
-
|
|
4089
|
-
|
|
4090
|
-
|
|
4091
|
-
|
|
4092
|
-
|
|
4093
|
-
|
|
4094
|
-
|
|
4095
|
-
|
|
4096
|
-
|
|
4097
|
-
|
|
4098
|
-
|
|
4099
|
-
|
|
4100
|
-
|
|
4101
|
-
|
|
4102
|
-
|
|
4103
|
-
|
|
4104
|
-
|
|
4105
|
-
|
|
4106
|
-
|
|
4360
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
4361
|
+
if (previousRecursionDepth >= 100) {
|
|
4362
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
4363
|
+
}
|
|
4364
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
4365
|
+
try {
|
|
4366
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
4367
|
+
const message = createBaseUpdateMetricRuleRequest_MetricRuleUpdates();
|
|
4368
|
+
while (reader.pos < end) {
|
|
4369
|
+
const tag = reader.uint32();
|
|
4370
|
+
switch (tag >>> 3) {
|
|
4371
|
+
case 1: {
|
|
4372
|
+
if (tag !== 10) {
|
|
4373
|
+
break;
|
|
4374
|
+
}
|
|
4375
|
+
|
|
4376
|
+
message.name = reader.string();
|
|
4377
|
+
continue;
|
|
4378
|
+
}
|
|
4379
|
+
case 2: {
|
|
4380
|
+
if (tag !== 18) {
|
|
4381
|
+
break;
|
|
4382
|
+
}
|
|
4383
|
+
|
|
4384
|
+
message.description = reader.string();
|
|
4385
|
+
continue;
|
|
4386
|
+
}
|
|
4387
|
+
case 3: {
|
|
4388
|
+
if (tag !== 24) {
|
|
4389
|
+
break;
|
|
4390
|
+
}
|
|
4391
|
+
|
|
4392
|
+
message.enabled = reader.int32() as any;
|
|
4393
|
+
continue;
|
|
4394
|
+
}
|
|
4395
|
+
case 4: {
|
|
4396
|
+
if (tag !== 32) {
|
|
4397
|
+
break;
|
|
4398
|
+
}
|
|
4399
|
+
|
|
4400
|
+
message.severity = reader.int32() as any;
|
|
4401
|
+
continue;
|
|
4402
|
+
}
|
|
4403
|
+
case 5: {
|
|
4404
|
+
if (tag !== 42) {
|
|
4405
|
+
break;
|
|
4406
|
+
}
|
|
4407
|
+
|
|
4408
|
+
message.integrationIds = UpdateMetricRuleRequest_IntegrationIds.decode(reader, reader.uint32());
|
|
4409
|
+
continue;
|
|
4410
|
+
}
|
|
4411
|
+
case 6: {
|
|
4412
|
+
if (tag !== 50) {
|
|
4413
|
+
break;
|
|
4414
|
+
}
|
|
4415
|
+
|
|
4416
|
+
message.condition = UpdateMetricRuleRequest_Condition.decode(reader, reader.uint32());
|
|
4417
|
+
continue;
|
|
4418
|
+
}
|
|
4419
|
+
}
|
|
4420
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
4421
|
+
break;
|
|
4422
|
+
}
|
|
4423
|
+
reader.skip(tag & 7);
|
|
4107
4424
|
}
|
|
4108
|
-
|
|
4109
|
-
|
|
4110
|
-
|
|
4111
|
-
reader.skip(tag & 7);
|
|
4425
|
+
return message;
|
|
4426
|
+
} finally {
|
|
4427
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
4112
4428
|
}
|
|
4113
|
-
return message;
|
|
4114
4429
|
},
|
|
4115
4430
|
|
|
4116
4431
|
fromJSON(object: any): UpdateMetricRuleRequest_MetricRuleUpdates {
|
|
@@ -4191,34 +4506,43 @@ export const UpdateMetricRuleResponse: MessageFns<UpdateMetricRuleResponse> = {
|
|
|
4191
4506
|
|
|
4192
4507
|
decode(input: BinaryReader | Uint8Array, length?: number): UpdateMetricRuleResponse {
|
|
4193
4508
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
4194
|
-
const
|
|
4195
|
-
|
|
4196
|
-
|
|
4197
|
-
|
|
4198
|
-
|
|
4199
|
-
|
|
4200
|
-
|
|
4201
|
-
|
|
4202
|
-
|
|
4203
|
-
|
|
4204
|
-
|
|
4205
|
-
|
|
4206
|
-
|
|
4207
|
-
|
|
4208
|
-
|
|
4209
|
-
|
|
4210
|
-
|
|
4211
|
-
|
|
4212
|
-
|
|
4213
|
-
|
|
4214
|
-
|
|
4215
|
-
|
|
4216
|
-
|
|
4217
|
-
|
|
4509
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
4510
|
+
if (previousRecursionDepth >= 100) {
|
|
4511
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
4512
|
+
}
|
|
4513
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
4514
|
+
try {
|
|
4515
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
4516
|
+
const message = createBaseUpdateMetricRuleResponse();
|
|
4517
|
+
while (reader.pos < end) {
|
|
4518
|
+
const tag = reader.uint32();
|
|
4519
|
+
switch (tag >>> 3) {
|
|
4520
|
+
case 1: {
|
|
4521
|
+
if (tag !== 10) {
|
|
4522
|
+
break;
|
|
4523
|
+
}
|
|
4524
|
+
|
|
4525
|
+
message.status = ResponseStatus.decode(reader, reader.uint32());
|
|
4526
|
+
continue;
|
|
4527
|
+
}
|
|
4528
|
+
case 2: {
|
|
4529
|
+
if (tag !== 18) {
|
|
4530
|
+
break;
|
|
4531
|
+
}
|
|
4532
|
+
|
|
4533
|
+
message.metricRule = MetricRule.decode(reader, reader.uint32());
|
|
4534
|
+
continue;
|
|
4535
|
+
}
|
|
4536
|
+
}
|
|
4537
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
4538
|
+
break;
|
|
4539
|
+
}
|
|
4540
|
+
reader.skip(tag & 7);
|
|
4218
4541
|
}
|
|
4219
|
-
|
|
4542
|
+
return message;
|
|
4543
|
+
} finally {
|
|
4544
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
4220
4545
|
}
|
|
4221
|
-
return message;
|
|
4222
4546
|
},
|
|
4223
4547
|
|
|
4224
4548
|
fromJSON(object: any): UpdateMetricRuleResponse {
|
|
@@ -4278,42 +4602,51 @@ export const DeleteMetricRuleRequest: MessageFns<DeleteMetricRuleRequest> = {
|
|
|
4278
4602
|
|
|
4279
4603
|
decode(input: BinaryReader | Uint8Array, length?: number): DeleteMetricRuleRequest {
|
|
4280
4604
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
4281
|
-
const
|
|
4282
|
-
|
|
4283
|
-
|
|
4284
|
-
|
|
4285
|
-
|
|
4286
|
-
|
|
4287
|
-
|
|
4288
|
-
|
|
4289
|
-
|
|
4290
|
-
|
|
4291
|
-
|
|
4292
|
-
|
|
4293
|
-
|
|
4294
|
-
|
|
4295
|
-
|
|
4296
|
-
|
|
4297
|
-
|
|
4298
|
-
|
|
4299
|
-
|
|
4300
|
-
|
|
4301
|
-
|
|
4302
|
-
|
|
4303
|
-
|
|
4304
|
-
|
|
4305
|
-
|
|
4306
|
-
|
|
4307
|
-
|
|
4308
|
-
|
|
4309
|
-
|
|
4310
|
-
|
|
4311
|
-
|
|
4312
|
-
|
|
4605
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
4606
|
+
if (previousRecursionDepth >= 100) {
|
|
4607
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
4608
|
+
}
|
|
4609
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
4610
|
+
try {
|
|
4611
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
4612
|
+
const message = createBaseDeleteMetricRuleRequest();
|
|
4613
|
+
while (reader.pos < end) {
|
|
4614
|
+
const tag = reader.uint32();
|
|
4615
|
+
switch (tag >>> 3) {
|
|
4616
|
+
case 1: {
|
|
4617
|
+
if (tag !== 10) {
|
|
4618
|
+
break;
|
|
4619
|
+
}
|
|
4620
|
+
|
|
4621
|
+
message.projectId = reader.string();
|
|
4622
|
+
continue;
|
|
4623
|
+
}
|
|
4624
|
+
case 2: {
|
|
4625
|
+
if (tag !== 18) {
|
|
4626
|
+
break;
|
|
4627
|
+
}
|
|
4628
|
+
|
|
4629
|
+
message.metricRuleId = reader.string();
|
|
4630
|
+
continue;
|
|
4631
|
+
}
|
|
4632
|
+
case 3: {
|
|
4633
|
+
if (tag !== 26) {
|
|
4634
|
+
break;
|
|
4635
|
+
}
|
|
4636
|
+
|
|
4637
|
+
message.organizationId = reader.string();
|
|
4638
|
+
continue;
|
|
4639
|
+
}
|
|
4640
|
+
}
|
|
4641
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
4642
|
+
break;
|
|
4643
|
+
}
|
|
4644
|
+
reader.skip(tag & 7);
|
|
4313
4645
|
}
|
|
4314
|
-
|
|
4646
|
+
return message;
|
|
4647
|
+
} finally {
|
|
4648
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
4315
4649
|
}
|
|
4316
|
-
return message;
|
|
4317
4650
|
},
|
|
4318
4651
|
|
|
4319
4652
|
fromJSON(object: any): DeleteMetricRuleRequest {
|
|
@@ -4376,26 +4709,35 @@ export const DeleteMetricRuleResponse: MessageFns<DeleteMetricRuleResponse> = {
|
|
|
4376
4709
|
|
|
4377
4710
|
decode(input: BinaryReader | Uint8Array, length?: number): DeleteMetricRuleResponse {
|
|
4378
4711
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
4379
|
-
const
|
|
4380
|
-
|
|
4381
|
-
|
|
4382
|
-
|
|
4383
|
-
|
|
4384
|
-
|
|
4385
|
-
|
|
4386
|
-
|
|
4387
|
-
|
|
4388
|
-
|
|
4389
|
-
|
|
4390
|
-
|
|
4391
|
-
|
|
4712
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
4713
|
+
if (previousRecursionDepth >= 100) {
|
|
4714
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
4715
|
+
}
|
|
4716
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
4717
|
+
try {
|
|
4718
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
4719
|
+
const message = createBaseDeleteMetricRuleResponse();
|
|
4720
|
+
while (reader.pos < end) {
|
|
4721
|
+
const tag = reader.uint32();
|
|
4722
|
+
switch (tag >>> 3) {
|
|
4723
|
+
case 1: {
|
|
4724
|
+
if (tag !== 10) {
|
|
4725
|
+
break;
|
|
4726
|
+
}
|
|
4727
|
+
|
|
4728
|
+
message.status = ResponseStatus.decode(reader, reader.uint32());
|
|
4729
|
+
continue;
|
|
4730
|
+
}
|
|
4731
|
+
}
|
|
4732
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
4733
|
+
break;
|
|
4734
|
+
}
|
|
4735
|
+
reader.skip(tag & 7);
|
|
4392
4736
|
}
|
|
4393
|
-
|
|
4394
|
-
|
|
4395
|
-
|
|
4396
|
-
reader.skip(tag & 7);
|
|
4737
|
+
return message;
|
|
4738
|
+
} finally {
|
|
4739
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
4397
4740
|
}
|
|
4398
|
-
return message;
|
|
4399
4741
|
},
|
|
4400
4742
|
|
|
4401
4743
|
fromJSON(object: any): DeleteMetricRuleResponse {
|
|
@@ -4442,42 +4784,51 @@ export const PreviewMetricRuleRequest: MessageFns<PreviewMetricRuleRequest> = {
|
|
|
4442
4784
|
|
|
4443
4785
|
decode(input: BinaryReader | Uint8Array, length?: number): PreviewMetricRuleRequest {
|
|
4444
4786
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
4445
|
-
const
|
|
4446
|
-
|
|
4447
|
-
|
|
4448
|
-
|
|
4449
|
-
|
|
4450
|
-
|
|
4451
|
-
|
|
4452
|
-
|
|
4453
|
-
|
|
4454
|
-
|
|
4455
|
-
|
|
4456
|
-
|
|
4457
|
-
|
|
4458
|
-
|
|
4459
|
-
|
|
4460
|
-
|
|
4461
|
-
|
|
4462
|
-
|
|
4463
|
-
|
|
4464
|
-
|
|
4465
|
-
|
|
4466
|
-
|
|
4467
|
-
|
|
4468
|
-
|
|
4469
|
-
|
|
4470
|
-
|
|
4471
|
-
|
|
4472
|
-
|
|
4473
|
-
|
|
4787
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
4788
|
+
if (previousRecursionDepth >= 100) {
|
|
4789
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
4790
|
+
}
|
|
4791
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
4792
|
+
try {
|
|
4793
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
4794
|
+
const message = createBasePreviewMetricRuleRequest();
|
|
4795
|
+
while (reader.pos < end) {
|
|
4796
|
+
const tag = reader.uint32();
|
|
4797
|
+
switch (tag >>> 3) {
|
|
4798
|
+
case 1: {
|
|
4799
|
+
if (tag !== 10) {
|
|
4800
|
+
break;
|
|
4801
|
+
}
|
|
4802
|
+
|
|
4803
|
+
message.projectId = reader.string();
|
|
4804
|
+
continue;
|
|
4805
|
+
}
|
|
4806
|
+
case 2: {
|
|
4807
|
+
if (tag !== 18) {
|
|
4808
|
+
break;
|
|
4809
|
+
}
|
|
4810
|
+
|
|
4811
|
+
message.expression = reader.string();
|
|
4812
|
+
continue;
|
|
4813
|
+
}
|
|
4814
|
+
case 3: {
|
|
4815
|
+
if (tag !== 26) {
|
|
4816
|
+
break;
|
|
4817
|
+
}
|
|
4818
|
+
|
|
4819
|
+
message.organizationId = reader.string();
|
|
4820
|
+
continue;
|
|
4821
|
+
}
|
|
4822
|
+
}
|
|
4823
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
4824
|
+
break;
|
|
4825
|
+
}
|
|
4826
|
+
reader.skip(tag & 7);
|
|
4474
4827
|
}
|
|
4475
|
-
|
|
4476
|
-
|
|
4477
|
-
|
|
4478
|
-
reader.skip(tag & 7);
|
|
4828
|
+
return message;
|
|
4829
|
+
} finally {
|
|
4830
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
4479
4831
|
}
|
|
4480
|
-
return message;
|
|
4481
4832
|
},
|
|
4482
4833
|
|
|
4483
4834
|
fromJSON(object: any): PreviewMetricRuleRequest {
|
|
@@ -4545,50 +4896,59 @@ export const PreviewMetricRuleResponse: MessageFns<PreviewMetricRuleResponse> =
|
|
|
4545
4896
|
|
|
4546
4897
|
decode(input: BinaryReader | Uint8Array, length?: number): PreviewMetricRuleResponse {
|
|
4547
4898
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
4548
|
-
const
|
|
4549
|
-
|
|
4550
|
-
|
|
4551
|
-
|
|
4552
|
-
|
|
4553
|
-
|
|
4554
|
-
|
|
4555
|
-
|
|
4556
|
-
|
|
4557
|
-
|
|
4558
|
-
|
|
4559
|
-
|
|
4560
|
-
|
|
4561
|
-
|
|
4562
|
-
|
|
4563
|
-
|
|
4564
|
-
|
|
4565
|
-
|
|
4566
|
-
|
|
4567
|
-
|
|
4568
|
-
|
|
4569
|
-
|
|
4570
|
-
|
|
4571
|
-
|
|
4572
|
-
|
|
4573
|
-
|
|
4574
|
-
|
|
4575
|
-
|
|
4576
|
-
|
|
4577
|
-
|
|
4578
|
-
|
|
4579
|
-
|
|
4580
|
-
|
|
4581
|
-
|
|
4582
|
-
|
|
4583
|
-
|
|
4584
|
-
|
|
4899
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
4900
|
+
if (previousRecursionDepth >= 100) {
|
|
4901
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
4902
|
+
}
|
|
4903
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
4904
|
+
try {
|
|
4905
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
4906
|
+
const message = createBasePreviewMetricRuleResponse();
|
|
4907
|
+
while (reader.pos < end) {
|
|
4908
|
+
const tag = reader.uint32();
|
|
4909
|
+
switch (tag >>> 3) {
|
|
4910
|
+
case 1: {
|
|
4911
|
+
if (tag !== 10) {
|
|
4912
|
+
break;
|
|
4913
|
+
}
|
|
4914
|
+
|
|
4915
|
+
message.status = ResponseStatus.decode(reader, reader.uint32());
|
|
4916
|
+
continue;
|
|
4917
|
+
}
|
|
4918
|
+
case 2: {
|
|
4919
|
+
if (tag !== 17) {
|
|
4920
|
+
break;
|
|
4921
|
+
}
|
|
4922
|
+
|
|
4923
|
+
message.value = reader.double();
|
|
4924
|
+
continue;
|
|
4925
|
+
}
|
|
4926
|
+
case 3: {
|
|
4927
|
+
if (tag !== 24) {
|
|
4928
|
+
break;
|
|
4929
|
+
}
|
|
4930
|
+
|
|
4931
|
+
message.wouldFire = reader.bool();
|
|
4932
|
+
continue;
|
|
4933
|
+
}
|
|
4934
|
+
case 4: {
|
|
4935
|
+
if (tag !== 34) {
|
|
4936
|
+
break;
|
|
4937
|
+
}
|
|
4938
|
+
|
|
4939
|
+
message.state = reader.string();
|
|
4940
|
+
continue;
|
|
4941
|
+
}
|
|
4942
|
+
}
|
|
4943
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
4944
|
+
break;
|
|
4945
|
+
}
|
|
4946
|
+
reader.skip(tag & 7);
|
|
4585
4947
|
}
|
|
4586
|
-
|
|
4587
|
-
|
|
4588
|
-
|
|
4589
|
-
reader.skip(tag & 7);
|
|
4948
|
+
return message;
|
|
4949
|
+
} finally {
|
|
4950
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
4590
4951
|
}
|
|
4591
|
-
return message;
|
|
4592
4952
|
},
|
|
4593
4953
|
|
|
4594
4954
|
fromJSON(object: any): PreviewMetricRuleResponse {
|
|
@@ -4656,42 +5016,51 @@ export const StreamMetricRuleActivityRequest: MessageFns<StreamMetricRuleActivit
|
|
|
4656
5016
|
|
|
4657
5017
|
decode(input: BinaryReader | Uint8Array, length?: number): StreamMetricRuleActivityRequest {
|
|
4658
5018
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
4659
|
-
const
|
|
4660
|
-
|
|
4661
|
-
|
|
4662
|
-
|
|
4663
|
-
|
|
4664
|
-
|
|
4665
|
-
|
|
4666
|
-
|
|
4667
|
-
|
|
4668
|
-
|
|
4669
|
-
|
|
4670
|
-
|
|
4671
|
-
|
|
4672
|
-
|
|
4673
|
-
|
|
4674
|
-
|
|
4675
|
-
|
|
4676
|
-
|
|
4677
|
-
|
|
4678
|
-
|
|
4679
|
-
|
|
4680
|
-
|
|
4681
|
-
|
|
4682
|
-
|
|
4683
|
-
|
|
4684
|
-
|
|
4685
|
-
|
|
4686
|
-
|
|
4687
|
-
|
|
5019
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
5020
|
+
if (previousRecursionDepth >= 100) {
|
|
5021
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
5022
|
+
}
|
|
5023
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
5024
|
+
try {
|
|
5025
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
5026
|
+
const message = createBaseStreamMetricRuleActivityRequest();
|
|
5027
|
+
while (reader.pos < end) {
|
|
5028
|
+
const tag = reader.uint32();
|
|
5029
|
+
switch (tag >>> 3) {
|
|
5030
|
+
case 1: {
|
|
5031
|
+
if (tag !== 10) {
|
|
5032
|
+
break;
|
|
5033
|
+
}
|
|
5034
|
+
|
|
5035
|
+
message.projectId = reader.string();
|
|
5036
|
+
continue;
|
|
5037
|
+
}
|
|
5038
|
+
case 2: {
|
|
5039
|
+
if (tag !== 18) {
|
|
5040
|
+
break;
|
|
5041
|
+
}
|
|
5042
|
+
|
|
5043
|
+
message.organizationId = reader.string();
|
|
5044
|
+
continue;
|
|
5045
|
+
}
|
|
5046
|
+
case 3: {
|
|
5047
|
+
if (tag !== 24) {
|
|
5048
|
+
break;
|
|
5049
|
+
}
|
|
5050
|
+
|
|
5051
|
+
message.limit = reader.int32();
|
|
5052
|
+
continue;
|
|
5053
|
+
}
|
|
5054
|
+
}
|
|
5055
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
5056
|
+
break;
|
|
5057
|
+
}
|
|
5058
|
+
reader.skip(tag & 7);
|
|
4688
5059
|
}
|
|
4689
|
-
|
|
4690
|
-
|
|
4691
|
-
|
|
4692
|
-
reader.skip(tag & 7);
|
|
5060
|
+
return message;
|
|
5061
|
+
} finally {
|
|
5062
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
4693
5063
|
}
|
|
4694
|
-
return message;
|
|
4695
5064
|
},
|
|
4696
5065
|
|
|
4697
5066
|
fromJSON(object: any): StreamMetricRuleActivityRequest {
|
|
@@ -4755,34 +5124,43 @@ export const MetricRuleActivityEnvelope: MessageFns<MetricRuleActivityEnvelope>
|
|
|
4755
5124
|
|
|
4756
5125
|
decode(input: BinaryReader | Uint8Array, length?: number): MetricRuleActivityEnvelope {
|
|
4757
5126
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
4758
|
-
const
|
|
4759
|
-
|
|
4760
|
-
|
|
4761
|
-
|
|
4762
|
-
|
|
4763
|
-
|
|
4764
|
-
|
|
4765
|
-
|
|
4766
|
-
|
|
4767
|
-
|
|
4768
|
-
|
|
4769
|
-
|
|
4770
|
-
|
|
4771
|
-
|
|
4772
|
-
|
|
4773
|
-
|
|
4774
|
-
|
|
4775
|
-
|
|
4776
|
-
|
|
4777
|
-
|
|
4778
|
-
|
|
5127
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
5128
|
+
if (previousRecursionDepth >= 100) {
|
|
5129
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
5130
|
+
}
|
|
5131
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
5132
|
+
try {
|
|
5133
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
5134
|
+
const message = createBaseMetricRuleActivityEnvelope();
|
|
5135
|
+
while (reader.pos < end) {
|
|
5136
|
+
const tag = reader.uint32();
|
|
5137
|
+
switch (tag >>> 3) {
|
|
5138
|
+
case 1: {
|
|
5139
|
+
if (tag !== 10) {
|
|
5140
|
+
break;
|
|
5141
|
+
}
|
|
5142
|
+
|
|
5143
|
+
message.snapshot = MetricRuleActivitySnapshot.decode(reader, reader.uint32());
|
|
5144
|
+
continue;
|
|
5145
|
+
}
|
|
5146
|
+
case 2: {
|
|
5147
|
+
if (tag !== 18) {
|
|
5148
|
+
break;
|
|
5149
|
+
}
|
|
5150
|
+
|
|
5151
|
+
message.update = MetricRuleActivityEvent.decode(reader, reader.uint32());
|
|
5152
|
+
continue;
|
|
5153
|
+
}
|
|
5154
|
+
}
|
|
5155
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
5156
|
+
break;
|
|
5157
|
+
}
|
|
5158
|
+
reader.skip(tag & 7);
|
|
4779
5159
|
}
|
|
4780
|
-
|
|
4781
|
-
|
|
4782
|
-
|
|
4783
|
-
reader.skip(tag & 7);
|
|
5160
|
+
return message;
|
|
5161
|
+
} finally {
|
|
5162
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
4784
5163
|
}
|
|
4785
|
-
return message;
|
|
4786
5164
|
},
|
|
4787
5165
|
|
|
4788
5166
|
fromJSON(object: any): MetricRuleActivityEnvelope {
|
|
@@ -4832,26 +5210,35 @@ export const MetricRuleActivitySnapshot: MessageFns<MetricRuleActivitySnapshot>
|
|
|
4832
5210
|
|
|
4833
5211
|
decode(input: BinaryReader | Uint8Array, length?: number): MetricRuleActivitySnapshot {
|
|
4834
5212
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
4835
|
-
const
|
|
4836
|
-
|
|
4837
|
-
|
|
4838
|
-
|
|
4839
|
-
|
|
4840
|
-
|
|
4841
|
-
|
|
4842
|
-
|
|
4843
|
-
|
|
4844
|
-
|
|
4845
|
-
|
|
4846
|
-
|
|
4847
|
-
|
|
4848
|
-
|
|
4849
|
-
|
|
4850
|
-
|
|
5213
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
5214
|
+
if (previousRecursionDepth >= 100) {
|
|
5215
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
5216
|
+
}
|
|
5217
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
5218
|
+
try {
|
|
5219
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
5220
|
+
const message = createBaseMetricRuleActivitySnapshot();
|
|
5221
|
+
while (reader.pos < end) {
|
|
5222
|
+
const tag = reader.uint32();
|
|
5223
|
+
switch (tag >>> 3) {
|
|
5224
|
+
case 1: {
|
|
5225
|
+
if (tag !== 10) {
|
|
5226
|
+
break;
|
|
5227
|
+
}
|
|
5228
|
+
|
|
5229
|
+
message.activities.push(MetricRuleActivityEvent.decode(reader, reader.uint32()));
|
|
5230
|
+
continue;
|
|
5231
|
+
}
|
|
5232
|
+
}
|
|
5233
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
5234
|
+
break;
|
|
5235
|
+
}
|
|
5236
|
+
reader.skip(tag & 7);
|
|
4851
5237
|
}
|
|
4852
|
-
|
|
5238
|
+
return message;
|
|
5239
|
+
} finally {
|
|
5240
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
4853
5241
|
}
|
|
4854
|
-
return message;
|
|
4855
5242
|
},
|
|
4856
5243
|
|
|
4857
5244
|
fromJSON(object: any): MetricRuleActivitySnapshot {
|
|
@@ -4928,90 +5315,99 @@ export const MetricRuleActivityEvent: MessageFns<MetricRuleActivityEvent> = {
|
|
|
4928
5315
|
|
|
4929
5316
|
decode(input: BinaryReader | Uint8Array, length?: number): MetricRuleActivityEvent {
|
|
4930
5317
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
4931
|
-
const
|
|
4932
|
-
|
|
4933
|
-
|
|
4934
|
-
|
|
4935
|
-
|
|
4936
|
-
|
|
4937
|
-
|
|
4938
|
-
|
|
4939
|
-
|
|
4940
|
-
|
|
4941
|
-
|
|
4942
|
-
|
|
4943
|
-
|
|
4944
|
-
|
|
4945
|
-
|
|
4946
|
-
|
|
4947
|
-
|
|
4948
|
-
|
|
4949
|
-
|
|
4950
|
-
|
|
4951
|
-
|
|
4952
|
-
|
|
4953
|
-
|
|
4954
|
-
|
|
4955
|
-
|
|
4956
|
-
|
|
4957
|
-
|
|
4958
|
-
|
|
4959
|
-
|
|
4960
|
-
|
|
4961
|
-
|
|
4962
|
-
|
|
4963
|
-
|
|
4964
|
-
|
|
4965
|
-
|
|
4966
|
-
|
|
4967
|
-
|
|
4968
|
-
|
|
4969
|
-
|
|
4970
|
-
|
|
4971
|
-
|
|
4972
|
-
|
|
4973
|
-
|
|
4974
|
-
|
|
4975
|
-
|
|
4976
|
-
|
|
4977
|
-
|
|
4978
|
-
|
|
4979
|
-
|
|
4980
|
-
|
|
4981
|
-
|
|
4982
|
-
|
|
4983
|
-
|
|
4984
|
-
|
|
4985
|
-
|
|
4986
|
-
|
|
4987
|
-
|
|
4988
|
-
|
|
4989
|
-
|
|
4990
|
-
|
|
4991
|
-
|
|
4992
|
-
|
|
4993
|
-
|
|
4994
|
-
|
|
4995
|
-
|
|
4996
|
-
|
|
4997
|
-
|
|
4998
|
-
|
|
4999
|
-
|
|
5000
|
-
|
|
5001
|
-
|
|
5002
|
-
|
|
5003
|
-
|
|
5004
|
-
|
|
5005
|
-
|
|
5006
|
-
|
|
5007
|
-
|
|
5318
|
+
const previousRecursionDepth = (reader as any).__tsProtoDecodeDepth ?? 0;
|
|
5319
|
+
if (previousRecursionDepth >= 100) {
|
|
5320
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
5321
|
+
}
|
|
5322
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
5323
|
+
try {
|
|
5324
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
5325
|
+
const message = createBaseMetricRuleActivityEvent();
|
|
5326
|
+
while (reader.pos < end) {
|
|
5327
|
+
const tag = reader.uint32();
|
|
5328
|
+
switch (tag >>> 3) {
|
|
5329
|
+
case 1: {
|
|
5330
|
+
if (tag !== 10) {
|
|
5331
|
+
break;
|
|
5332
|
+
}
|
|
5333
|
+
|
|
5334
|
+
message.activityId = reader.string();
|
|
5335
|
+
continue;
|
|
5336
|
+
}
|
|
5337
|
+
case 2: {
|
|
5338
|
+
if (tag !== 18) {
|
|
5339
|
+
break;
|
|
5340
|
+
}
|
|
5341
|
+
|
|
5342
|
+
message.ruleId = reader.string();
|
|
5343
|
+
continue;
|
|
5344
|
+
}
|
|
5345
|
+
case 3: {
|
|
5346
|
+
if (tag !== 26) {
|
|
5347
|
+
break;
|
|
5348
|
+
}
|
|
5349
|
+
|
|
5350
|
+
message.ruleName = reader.string();
|
|
5351
|
+
continue;
|
|
5352
|
+
}
|
|
5353
|
+
case 4: {
|
|
5354
|
+
if (tag !== 32) {
|
|
5355
|
+
break;
|
|
5356
|
+
}
|
|
5357
|
+
|
|
5358
|
+
message.type = reader.int32() as any;
|
|
5359
|
+
continue;
|
|
5360
|
+
}
|
|
5361
|
+
case 5: {
|
|
5362
|
+
if (tag !== 42) {
|
|
5363
|
+
break;
|
|
5364
|
+
}
|
|
5365
|
+
|
|
5366
|
+
message.incidentId = reader.string();
|
|
5367
|
+
continue;
|
|
5368
|
+
}
|
|
5369
|
+
case 6: {
|
|
5370
|
+
if (tag !== 50) {
|
|
5371
|
+
break;
|
|
5372
|
+
}
|
|
5373
|
+
|
|
5374
|
+
message.expression = reader.string();
|
|
5375
|
+
continue;
|
|
5376
|
+
}
|
|
5377
|
+
case 7: {
|
|
5378
|
+
if (tag !== 57) {
|
|
5379
|
+
break;
|
|
5380
|
+
}
|
|
5381
|
+
|
|
5382
|
+
message.observedValue = reader.double();
|
|
5383
|
+
continue;
|
|
5384
|
+
}
|
|
5385
|
+
case 8: {
|
|
5386
|
+
if (tag !== 64) {
|
|
5387
|
+
break;
|
|
5388
|
+
}
|
|
5389
|
+
|
|
5390
|
+
message.severity = reader.int32() as any;
|
|
5391
|
+
continue;
|
|
5392
|
+
}
|
|
5393
|
+
case 9: {
|
|
5394
|
+
if (tag !== 74) {
|
|
5395
|
+
break;
|
|
5396
|
+
}
|
|
5397
|
+
|
|
5398
|
+
message.occurredAt = fromTimestamp(Timestamp.decode(reader, reader.uint32()));
|
|
5399
|
+
continue;
|
|
5400
|
+
}
|
|
5401
|
+
}
|
|
5402
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
5403
|
+
break;
|
|
5404
|
+
}
|
|
5405
|
+
reader.skip(tag & 7);
|
|
5008
5406
|
}
|
|
5009
|
-
|
|
5010
|
-
|
|
5011
|
-
|
|
5012
|
-
reader.skip(tag & 7);
|
|
5407
|
+
return message;
|
|
5408
|
+
} finally {
|
|
5409
|
+
(reader as any).__tsProtoDecodeDepth = previousRecursionDepth;
|
|
5013
5410
|
}
|
|
5014
|
-
return message;
|
|
5015
5411
|
},
|
|
5016
5412
|
|
|
5017
5413
|
fromJSON(object: any): MetricRuleActivityEvent {
|
|
@@ -5104,7 +5500,7 @@ export const MetricRuleActivityEvent: MessageFns<MetricRuleActivityEvent> = {
|
|
|
5104
5500
|
|
|
5105
5501
|
/**
|
|
5106
5502
|
* RuleGatewayService provides web client access to rule management. Rules come
|
|
5107
|
-
* in two symmetric kinds: trace rules (CEL over
|
|
5503
|
+
* in two symmetric kinds: trace rules (CEL over trace state + events, matches) and
|
|
5108
5504
|
* metric rules (PromQL threshold alerting). Metric-rule RPCs are added
|
|
5109
5505
|
* alongside these.
|
|
5110
5506
|
*/
|