@m1kad0/hannah-proto 3.7.1 → 3.7.2
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/activity_log.js +216 -166
- package/dist/agent.js +1330 -1050
- package/dist/automation.js +142 -92
- package/dist/car_state.js +245 -195
- package/dist/compat_versions.js +1 -1
- package/dist/control.js +1675 -1255
- package/dist/descriptor.binpb +0 -0
- package/dist/device_control_menu.js +302 -222
- package/dist/event_stream.js +236 -166
- package/dist/google/protobuf/descriptor.js +1721 -1381
- package/dist/hannah.js +1 -1
- package/dist/messages.js +198 -148
- package/dist/options.js +1 -1
- package/dist/satellite.js +314 -244
- package/dist/satellite_provisioning.js +38 -28
- package/dist/satellite_proxy.d.ts +5 -2
- package/dist/satellite_proxy.js +278 -208
- package/dist/shared.js +111 -71
- package/dist/speaker_enrollment.js +38 -28
- package/dist/timer_admin.js +131 -91
- package/dist/timer_service.js +467 -327
- package/dist/user_registry.js +724 -534
- package/dist/wakeword_capture.js +295 -195
- package/dist/weather.js +172 -142
- package/package.json +2 -2
package/dist/shared.js
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
"use strict";
|
|
2
2
|
// Code generated by protoc-gen-ts_proto. DO NOT EDIT.
|
|
3
3
|
// versions:
|
|
4
|
-
// protoc-gen-ts_proto v2.12.
|
|
4
|
+
// protoc-gen-ts_proto v2.12.1
|
|
5
5
|
// protoc unknown
|
|
6
6
|
// source: hannah/shared.proto
|
|
7
7
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
@@ -33,18 +33,28 @@ exports.Empty = {
|
|
|
33
33
|
},
|
|
34
34
|
decode(input, length) {
|
|
35
35
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
36
|
-
const
|
|
37
|
-
|
|
38
|
-
|
|
39
|
-
|
|
40
|
-
|
|
41
|
-
|
|
42
|
-
|
|
43
|
-
|
|
36
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
37
|
+
if (previousRecursionDepth >= 100) {
|
|
38
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
39
|
+
}
|
|
40
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
41
|
+
try {
|
|
42
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
43
|
+
const message = createBaseEmpty();
|
|
44
|
+
while (reader.pos < end) {
|
|
45
|
+
const tag = reader.uint32();
|
|
46
|
+
switch (tag >>> 3) {
|
|
47
|
+
}
|
|
48
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
49
|
+
break;
|
|
50
|
+
}
|
|
51
|
+
reader.skip(tag & 7);
|
|
44
52
|
}
|
|
45
|
-
|
|
53
|
+
return message;
|
|
54
|
+
}
|
|
55
|
+
finally {
|
|
56
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
46
57
|
}
|
|
47
|
-
return message;
|
|
48
58
|
},
|
|
49
59
|
create(base) {
|
|
50
60
|
return exports.Empty.fromPartial(base ?? {});
|
|
@@ -69,32 +79,42 @@ exports.StatusResponse = {
|
|
|
69
79
|
},
|
|
70
80
|
decode(input, length) {
|
|
71
81
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
72
|
-
const
|
|
73
|
-
|
|
74
|
-
|
|
75
|
-
|
|
76
|
-
|
|
77
|
-
|
|
78
|
-
|
|
79
|
-
|
|
82
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
83
|
+
if (previousRecursionDepth >= 100) {
|
|
84
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
85
|
+
}
|
|
86
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
87
|
+
try {
|
|
88
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
89
|
+
const message = createBaseStatusResponse();
|
|
90
|
+
while (reader.pos < end) {
|
|
91
|
+
const tag = reader.uint32();
|
|
92
|
+
switch (tag >>> 3) {
|
|
93
|
+
case 1: {
|
|
94
|
+
if (tag !== 8) {
|
|
95
|
+
break;
|
|
96
|
+
}
|
|
97
|
+
message.ok = reader.bool();
|
|
98
|
+
continue;
|
|
80
99
|
}
|
|
81
|
-
|
|
82
|
-
|
|
83
|
-
|
|
84
|
-
|
|
85
|
-
|
|
86
|
-
|
|
100
|
+
case 2: {
|
|
101
|
+
if (tag !== 18) {
|
|
102
|
+
break;
|
|
103
|
+
}
|
|
104
|
+
message.message = reader.string();
|
|
105
|
+
continue;
|
|
87
106
|
}
|
|
88
|
-
message.message = reader.string();
|
|
89
|
-
continue;
|
|
90
107
|
}
|
|
108
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
109
|
+
break;
|
|
110
|
+
}
|
|
111
|
+
reader.skip(tag & 7);
|
|
91
112
|
}
|
|
92
|
-
|
|
93
|
-
|
|
94
|
-
|
|
95
|
-
reader.
|
|
113
|
+
return message;
|
|
114
|
+
}
|
|
115
|
+
finally {
|
|
116
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
96
117
|
}
|
|
97
|
-
return message;
|
|
98
118
|
},
|
|
99
119
|
create(base) {
|
|
100
120
|
return exports.StatusResponse.fromPartial(base ?? {});
|
|
@@ -118,28 +138,38 @@ exports.EnumValues = {
|
|
|
118
138
|
},
|
|
119
139
|
decode(input, length) {
|
|
120
140
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
121
|
-
const
|
|
122
|
-
|
|
123
|
-
|
|
124
|
-
|
|
125
|
-
|
|
126
|
-
|
|
127
|
-
|
|
128
|
-
|
|
129
|
-
|
|
130
|
-
|
|
131
|
-
|
|
132
|
-
|
|
141
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
142
|
+
if (previousRecursionDepth >= 100) {
|
|
143
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
144
|
+
}
|
|
145
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
146
|
+
try {
|
|
147
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
148
|
+
const message = createBaseEnumValues();
|
|
149
|
+
while (reader.pos < end) {
|
|
150
|
+
const tag = reader.uint32();
|
|
151
|
+
switch (tag >>> 3) {
|
|
152
|
+
case 1: {
|
|
153
|
+
if (tag !== 10) {
|
|
154
|
+
break;
|
|
155
|
+
}
|
|
156
|
+
const entry1 = exports.EnumValues_ValuesEntry.decode(reader, reader.uint32());
|
|
157
|
+
if (entry1.value !== undefined) {
|
|
158
|
+
message.values[entry1.key] = entry1.value;
|
|
159
|
+
}
|
|
160
|
+
continue;
|
|
133
161
|
}
|
|
134
|
-
continue;
|
|
135
162
|
}
|
|
163
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
164
|
+
break;
|
|
165
|
+
}
|
|
166
|
+
reader.skip(tag & 7);
|
|
136
167
|
}
|
|
137
|
-
|
|
138
|
-
|
|
139
|
-
|
|
140
|
-
reader.
|
|
168
|
+
return message;
|
|
169
|
+
}
|
|
170
|
+
finally {
|
|
171
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
141
172
|
}
|
|
142
|
-
return message;
|
|
143
173
|
},
|
|
144
174
|
create(base) {
|
|
145
175
|
return exports.EnumValues.fromPartial(base ?? {});
|
|
@@ -170,32 +200,42 @@ exports.EnumValues_ValuesEntry = {
|
|
|
170
200
|
},
|
|
171
201
|
decode(input, length) {
|
|
172
202
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
173
|
-
const
|
|
174
|
-
|
|
175
|
-
|
|
176
|
-
|
|
177
|
-
|
|
178
|
-
|
|
179
|
-
|
|
180
|
-
|
|
203
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
204
|
+
if (previousRecursionDepth >= 100) {
|
|
205
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
206
|
+
}
|
|
207
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
208
|
+
try {
|
|
209
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
210
|
+
const message = createBaseEnumValues_ValuesEntry();
|
|
211
|
+
while (reader.pos < end) {
|
|
212
|
+
const tag = reader.uint32();
|
|
213
|
+
switch (tag >>> 3) {
|
|
214
|
+
case 1: {
|
|
215
|
+
if (tag !== 10) {
|
|
216
|
+
break;
|
|
217
|
+
}
|
|
218
|
+
message.key = reader.string();
|
|
219
|
+
continue;
|
|
181
220
|
}
|
|
182
|
-
|
|
183
|
-
|
|
184
|
-
|
|
185
|
-
|
|
186
|
-
|
|
187
|
-
|
|
221
|
+
case 2: {
|
|
222
|
+
if (tag !== 18) {
|
|
223
|
+
break;
|
|
224
|
+
}
|
|
225
|
+
message.value = reader.string();
|
|
226
|
+
continue;
|
|
188
227
|
}
|
|
189
|
-
message.value = reader.string();
|
|
190
|
-
continue;
|
|
191
228
|
}
|
|
229
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
230
|
+
break;
|
|
231
|
+
}
|
|
232
|
+
reader.skip(tag & 7);
|
|
192
233
|
}
|
|
193
|
-
|
|
194
|
-
|
|
195
|
-
|
|
196
|
-
reader.
|
|
234
|
+
return message;
|
|
235
|
+
}
|
|
236
|
+
finally {
|
|
237
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
197
238
|
}
|
|
198
|
-
return message;
|
|
199
239
|
},
|
|
200
240
|
create(base) {
|
|
201
241
|
return exports.EnumValues_ValuesEntry.fromPartial(base ?? {});
|
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
"use strict";
|
|
2
2
|
// Code generated by protoc-gen-ts_proto. DO NOT EDIT.
|
|
3
3
|
// versions:
|
|
4
|
-
// protoc-gen-ts_proto v2.12.
|
|
4
|
+
// protoc-gen-ts_proto v2.12.1
|
|
5
5
|
// protoc unknown
|
|
6
6
|
// source: hannah/speaker_enrollment.proto
|
|
7
7
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
@@ -27,39 +27,49 @@ exports.EnrollVoiceprintRequest = {
|
|
|
27
27
|
},
|
|
28
28
|
decode(input, length) {
|
|
29
29
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
30
|
-
const
|
|
31
|
-
|
|
32
|
-
|
|
33
|
-
|
|
34
|
-
|
|
35
|
-
|
|
36
|
-
|
|
37
|
-
|
|
30
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
31
|
+
if (previousRecursionDepth >= 100) {
|
|
32
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
33
|
+
}
|
|
34
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
35
|
+
try {
|
|
36
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
37
|
+
const message = createBaseEnrollVoiceprintRequest();
|
|
38
|
+
while (reader.pos < end) {
|
|
39
|
+
const tag = reader.uint32();
|
|
40
|
+
switch (tag >>> 3) {
|
|
41
|
+
case 1: {
|
|
42
|
+
if (tag !== 10) {
|
|
43
|
+
break;
|
|
44
|
+
}
|
|
45
|
+
message.userId = reader.string();
|
|
46
|
+
continue;
|
|
38
47
|
}
|
|
39
|
-
|
|
40
|
-
|
|
41
|
-
|
|
42
|
-
|
|
43
|
-
|
|
44
|
-
|
|
48
|
+
case 2: {
|
|
49
|
+
if (tag !== 18) {
|
|
50
|
+
break;
|
|
51
|
+
}
|
|
52
|
+
message.audioPcm = reader.bytes();
|
|
53
|
+
continue;
|
|
45
54
|
}
|
|
46
|
-
|
|
47
|
-
|
|
48
|
-
|
|
49
|
-
|
|
50
|
-
|
|
51
|
-
|
|
55
|
+
case 3: {
|
|
56
|
+
if (tag !== 24) {
|
|
57
|
+
break;
|
|
58
|
+
}
|
|
59
|
+
message.sampleRate = reader.int32();
|
|
60
|
+
continue;
|
|
52
61
|
}
|
|
53
|
-
message.sampleRate = reader.int32();
|
|
54
|
-
continue;
|
|
55
62
|
}
|
|
63
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
64
|
+
break;
|
|
65
|
+
}
|
|
66
|
+
reader.skip(tag & 7);
|
|
56
67
|
}
|
|
57
|
-
|
|
58
|
-
|
|
59
|
-
|
|
60
|
-
reader.
|
|
68
|
+
return message;
|
|
69
|
+
}
|
|
70
|
+
finally {
|
|
71
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
61
72
|
}
|
|
62
|
-
return message;
|
|
63
73
|
},
|
|
64
74
|
create(base) {
|
|
65
75
|
return exports.EnrollVoiceprintRequest.fromPartial(base ?? {});
|
package/dist/timer_admin.js
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
"use strict";
|
|
2
2
|
// Code generated by protoc-gen-ts_proto. DO NOT EDIT.
|
|
3
3
|
// versions:
|
|
4
|
-
// protoc-gen-ts_proto v2.12.
|
|
4
|
+
// protoc-gen-ts_proto v2.12.1
|
|
5
5
|
// protoc unknown
|
|
6
6
|
// source: hannah/timer_admin.proto
|
|
7
7
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
@@ -36,53 +36,63 @@ exports.Timer = {
|
|
|
36
36
|
},
|
|
37
37
|
decode(input, length) {
|
|
38
38
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
39
|
-
const
|
|
40
|
-
|
|
41
|
-
|
|
42
|
-
|
|
43
|
-
|
|
44
|
-
|
|
45
|
-
|
|
46
|
-
|
|
39
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
40
|
+
if (previousRecursionDepth >= 100) {
|
|
41
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
42
|
+
}
|
|
43
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
44
|
+
try {
|
|
45
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
46
|
+
const message = createBaseTimer();
|
|
47
|
+
while (reader.pos < end) {
|
|
48
|
+
const tag = reader.uint32();
|
|
49
|
+
switch (tag >>> 3) {
|
|
50
|
+
case 1: {
|
|
51
|
+
if (tag !== 10) {
|
|
52
|
+
break;
|
|
53
|
+
}
|
|
54
|
+
message.timerId = reader.string();
|
|
55
|
+
continue;
|
|
47
56
|
}
|
|
48
|
-
|
|
49
|
-
|
|
50
|
-
|
|
51
|
-
|
|
52
|
-
|
|
53
|
-
|
|
57
|
+
case 2: {
|
|
58
|
+
if (tag !== 18) {
|
|
59
|
+
break;
|
|
60
|
+
}
|
|
61
|
+
message.label = reader.string();
|
|
62
|
+
continue;
|
|
54
63
|
}
|
|
55
|
-
|
|
56
|
-
|
|
57
|
-
|
|
58
|
-
|
|
59
|
-
|
|
60
|
-
|
|
64
|
+
case 3: {
|
|
65
|
+
if (tag !== 24) {
|
|
66
|
+
break;
|
|
67
|
+
}
|
|
68
|
+
message.seconds = reader.int64();
|
|
69
|
+
continue;
|
|
61
70
|
}
|
|
62
|
-
|
|
63
|
-
|
|
64
|
-
|
|
65
|
-
|
|
66
|
-
|
|
67
|
-
|
|
71
|
+
case 4: {
|
|
72
|
+
if (tag !== 34) {
|
|
73
|
+
break;
|
|
74
|
+
}
|
|
75
|
+
message.roomId = reader.string();
|
|
76
|
+
continue;
|
|
68
77
|
}
|
|
69
|
-
|
|
70
|
-
|
|
71
|
-
|
|
72
|
-
|
|
73
|
-
|
|
74
|
-
|
|
78
|
+
case 5: {
|
|
79
|
+
if (tag !== 40) {
|
|
80
|
+
break;
|
|
81
|
+
}
|
|
82
|
+
message.userId = reader.int32();
|
|
83
|
+
continue;
|
|
75
84
|
}
|
|
76
|
-
message.userId = reader.int32();
|
|
77
|
-
continue;
|
|
78
85
|
}
|
|
86
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
87
|
+
break;
|
|
88
|
+
}
|
|
89
|
+
reader.skip(tag & 7);
|
|
79
90
|
}
|
|
80
|
-
|
|
81
|
-
|
|
82
|
-
|
|
83
|
-
reader.
|
|
91
|
+
return message;
|
|
92
|
+
}
|
|
93
|
+
finally {
|
|
94
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
84
95
|
}
|
|
85
|
-
return message;
|
|
86
96
|
},
|
|
87
97
|
create(base) {
|
|
88
98
|
return exports.Timer.fromPartial(base ?? {});
|
|
@@ -109,25 +119,35 @@ exports.GetTimersRequest = {
|
|
|
109
119
|
},
|
|
110
120
|
decode(input, length) {
|
|
111
121
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
112
|
-
const
|
|
113
|
-
|
|
114
|
-
|
|
115
|
-
|
|
116
|
-
|
|
117
|
-
|
|
118
|
-
|
|
119
|
-
|
|
122
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
123
|
+
if (previousRecursionDepth >= 100) {
|
|
124
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
125
|
+
}
|
|
126
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
127
|
+
try {
|
|
128
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
129
|
+
const message = createBaseGetTimersRequest();
|
|
130
|
+
while (reader.pos < end) {
|
|
131
|
+
const tag = reader.uint32();
|
|
132
|
+
switch (tag >>> 3) {
|
|
133
|
+
case 1: {
|
|
134
|
+
if (tag !== 8) {
|
|
135
|
+
break;
|
|
136
|
+
}
|
|
137
|
+
message.userId = reader.int32();
|
|
138
|
+
continue;
|
|
120
139
|
}
|
|
121
|
-
message.userId = reader.int32();
|
|
122
|
-
continue;
|
|
123
140
|
}
|
|
141
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
142
|
+
break;
|
|
143
|
+
}
|
|
144
|
+
reader.skip(tag & 7);
|
|
124
145
|
}
|
|
125
|
-
|
|
126
|
-
|
|
127
|
-
|
|
128
|
-
reader.
|
|
146
|
+
return message;
|
|
147
|
+
}
|
|
148
|
+
finally {
|
|
149
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
129
150
|
}
|
|
130
|
-
return message;
|
|
131
151
|
},
|
|
132
152
|
create(base) {
|
|
133
153
|
return exports.GetTimersRequest.fromPartial(base ?? {});
|
|
@@ -150,25 +170,35 @@ exports.GetTimersResponse = {
|
|
|
150
170
|
},
|
|
151
171
|
decode(input, length) {
|
|
152
172
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
153
|
-
const
|
|
154
|
-
|
|
155
|
-
|
|
156
|
-
|
|
157
|
-
|
|
158
|
-
|
|
159
|
-
|
|
160
|
-
|
|
173
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
174
|
+
if (previousRecursionDepth >= 100) {
|
|
175
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
176
|
+
}
|
|
177
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
178
|
+
try {
|
|
179
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
180
|
+
const message = createBaseGetTimersResponse();
|
|
181
|
+
while (reader.pos < end) {
|
|
182
|
+
const tag = reader.uint32();
|
|
183
|
+
switch (tag >>> 3) {
|
|
184
|
+
case 1: {
|
|
185
|
+
if (tag !== 10) {
|
|
186
|
+
break;
|
|
187
|
+
}
|
|
188
|
+
message.timers.push(exports.Timer.decode(reader, reader.uint32()));
|
|
189
|
+
continue;
|
|
161
190
|
}
|
|
162
|
-
message.timers.push(exports.Timer.decode(reader, reader.uint32()));
|
|
163
|
-
continue;
|
|
164
191
|
}
|
|
192
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
193
|
+
break;
|
|
194
|
+
}
|
|
195
|
+
reader.skip(tag & 7);
|
|
165
196
|
}
|
|
166
|
-
|
|
167
|
-
|
|
168
|
-
|
|
169
|
-
reader.
|
|
197
|
+
return message;
|
|
198
|
+
}
|
|
199
|
+
finally {
|
|
200
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
170
201
|
}
|
|
171
|
-
return message;
|
|
172
202
|
},
|
|
173
203
|
create(base) {
|
|
174
204
|
return exports.GetTimersResponse.fromPartial(base ?? {});
|
|
@@ -194,32 +224,42 @@ exports.DeleteTimerRequest = {
|
|
|
194
224
|
},
|
|
195
225
|
decode(input, length) {
|
|
196
226
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
197
|
-
const
|
|
198
|
-
|
|
199
|
-
|
|
200
|
-
|
|
201
|
-
|
|
202
|
-
|
|
203
|
-
|
|
204
|
-
|
|
227
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
228
|
+
if (previousRecursionDepth >= 100) {
|
|
229
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
230
|
+
}
|
|
231
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
232
|
+
try {
|
|
233
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
234
|
+
const message = createBaseDeleteTimerRequest();
|
|
235
|
+
while (reader.pos < end) {
|
|
236
|
+
const tag = reader.uint32();
|
|
237
|
+
switch (tag >>> 3) {
|
|
238
|
+
case 1: {
|
|
239
|
+
if (tag !== 10) {
|
|
240
|
+
break;
|
|
241
|
+
}
|
|
242
|
+
message.timerId = reader.string();
|
|
243
|
+
continue;
|
|
205
244
|
}
|
|
206
|
-
|
|
207
|
-
|
|
208
|
-
|
|
209
|
-
|
|
210
|
-
|
|
211
|
-
|
|
245
|
+
case 2: {
|
|
246
|
+
if (tag !== 16) {
|
|
247
|
+
break;
|
|
248
|
+
}
|
|
249
|
+
message.requestorId = reader.int32();
|
|
250
|
+
continue;
|
|
212
251
|
}
|
|
213
|
-
message.requestorId = reader.int32();
|
|
214
|
-
continue;
|
|
215
252
|
}
|
|
253
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
254
|
+
break;
|
|
255
|
+
}
|
|
256
|
+
reader.skip(tag & 7);
|
|
216
257
|
}
|
|
217
|
-
|
|
218
|
-
|
|
219
|
-
|
|
220
|
-
reader.
|
|
258
|
+
return message;
|
|
259
|
+
}
|
|
260
|
+
finally {
|
|
261
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
221
262
|
}
|
|
222
|
-
return message;
|
|
223
263
|
},
|
|
224
264
|
create(base) {
|
|
225
265
|
return exports.DeleteTimerRequest.fromPartial(base ?? {});
|