@m1kad0/hannah-proto 3.7.0 → 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.d.ts +8 -0
- package/dist/messages.js +220 -126
- 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/user_registry.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/user_registry.proto
|
|
7
7
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
@@ -59,91 +59,101 @@ exports.User = {
|
|
|
59
59
|
},
|
|
60
60
|
decode(input, length) {
|
|
61
61
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
62
|
-
const
|
|
63
|
-
|
|
64
|
-
|
|
65
|
-
|
|
66
|
-
|
|
67
|
-
|
|
68
|
-
|
|
69
|
-
|
|
62
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
63
|
+
if (previousRecursionDepth >= 100) {
|
|
64
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
65
|
+
}
|
|
66
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
67
|
+
try {
|
|
68
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
69
|
+
const message = createBaseUser();
|
|
70
|
+
while (reader.pos < end) {
|
|
71
|
+
const tag = reader.uint32();
|
|
72
|
+
switch (tag >>> 3) {
|
|
73
|
+
case 1: {
|
|
74
|
+
if (tag !== 8) {
|
|
75
|
+
break;
|
|
76
|
+
}
|
|
77
|
+
message.id = reader.int32();
|
|
78
|
+
continue;
|
|
70
79
|
}
|
|
71
|
-
|
|
72
|
-
|
|
73
|
-
|
|
74
|
-
|
|
75
|
-
|
|
76
|
-
|
|
80
|
+
case 2: {
|
|
81
|
+
if (tag !== 18) {
|
|
82
|
+
break;
|
|
83
|
+
}
|
|
84
|
+
message.userName = reader.string();
|
|
85
|
+
continue;
|
|
77
86
|
}
|
|
78
|
-
|
|
79
|
-
|
|
80
|
-
|
|
81
|
-
|
|
82
|
-
|
|
83
|
-
|
|
87
|
+
case 3: {
|
|
88
|
+
if (tag !== 26) {
|
|
89
|
+
break;
|
|
90
|
+
}
|
|
91
|
+
message.displayName = reader.string();
|
|
92
|
+
continue;
|
|
84
93
|
}
|
|
85
|
-
|
|
86
|
-
|
|
87
|
-
|
|
88
|
-
|
|
89
|
-
|
|
90
|
-
|
|
94
|
+
case 4: {
|
|
95
|
+
if (tag !== 32) {
|
|
96
|
+
break;
|
|
97
|
+
}
|
|
98
|
+
message.trustLevel = reader.int32();
|
|
99
|
+
continue;
|
|
91
100
|
}
|
|
92
|
-
|
|
93
|
-
|
|
94
|
-
|
|
95
|
-
|
|
96
|
-
|
|
97
|
-
|
|
101
|
+
case 5: {
|
|
102
|
+
if (tag !== 40) {
|
|
103
|
+
break;
|
|
104
|
+
}
|
|
105
|
+
message.active = reader.bool();
|
|
106
|
+
continue;
|
|
98
107
|
}
|
|
99
|
-
|
|
100
|
-
|
|
101
|
-
|
|
102
|
-
|
|
103
|
-
|
|
104
|
-
|
|
108
|
+
case 6: {
|
|
109
|
+
if (tag !== 50) {
|
|
110
|
+
break;
|
|
111
|
+
}
|
|
112
|
+
const entry6 = exports.User_LinkedAccountsEntry.decode(reader, reader.uint32());
|
|
113
|
+
if (entry6.value !== undefined) {
|
|
114
|
+
message.linkedAccounts[entry6.key] = entry6.value;
|
|
115
|
+
}
|
|
116
|
+
continue;
|
|
105
117
|
}
|
|
106
|
-
|
|
107
|
-
|
|
108
|
-
|
|
118
|
+
case 7: {
|
|
119
|
+
if (tag !== 56) {
|
|
120
|
+
break;
|
|
121
|
+
}
|
|
122
|
+
message.systemMessages = reader.bool();
|
|
123
|
+
continue;
|
|
109
124
|
}
|
|
110
|
-
|
|
111
|
-
|
|
112
|
-
|
|
113
|
-
|
|
114
|
-
|
|
125
|
+
case 8: {
|
|
126
|
+
if (tag !== 66) {
|
|
127
|
+
break;
|
|
128
|
+
}
|
|
129
|
+
message.email = reader.string();
|
|
130
|
+
continue;
|
|
115
131
|
}
|
|
116
|
-
|
|
117
|
-
|
|
118
|
-
|
|
119
|
-
|
|
120
|
-
|
|
121
|
-
|
|
132
|
+
case 9: {
|
|
133
|
+
if (tag !== 74) {
|
|
134
|
+
break;
|
|
135
|
+
}
|
|
136
|
+
message.type = reader.string();
|
|
137
|
+
continue;
|
|
122
138
|
}
|
|
123
|
-
|
|
124
|
-
|
|
125
|
-
|
|
126
|
-
|
|
127
|
-
|
|
128
|
-
|
|
139
|
+
case 10: {
|
|
140
|
+
if (tag !== 82) {
|
|
141
|
+
break;
|
|
142
|
+
}
|
|
143
|
+
message.enabledAutomations.push(reader.string());
|
|
144
|
+
continue;
|
|
129
145
|
}
|
|
130
|
-
message.type = reader.string();
|
|
131
|
-
continue;
|
|
132
146
|
}
|
|
133
|
-
|
|
134
|
-
|
|
135
|
-
break;
|
|
136
|
-
}
|
|
137
|
-
message.enabledAutomations.push(reader.string());
|
|
138
|
-
continue;
|
|
147
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
148
|
+
break;
|
|
139
149
|
}
|
|
150
|
+
reader.skip(tag & 7);
|
|
140
151
|
}
|
|
141
|
-
|
|
142
|
-
|
|
143
|
-
|
|
144
|
-
reader.
|
|
152
|
+
return message;
|
|
153
|
+
}
|
|
154
|
+
finally {
|
|
155
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
145
156
|
}
|
|
146
|
-
return message;
|
|
147
157
|
},
|
|
148
158
|
create(base) {
|
|
149
159
|
return exports.User.fromPartial(base ?? {});
|
|
@@ -183,32 +193,42 @@ exports.User_LinkedAccountsEntry = {
|
|
|
183
193
|
},
|
|
184
194
|
decode(input, length) {
|
|
185
195
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
186
|
-
const
|
|
187
|
-
|
|
188
|
-
|
|
189
|
-
|
|
190
|
-
|
|
191
|
-
|
|
192
|
-
|
|
193
|
-
|
|
196
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
197
|
+
if (previousRecursionDepth >= 100) {
|
|
198
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
199
|
+
}
|
|
200
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
201
|
+
try {
|
|
202
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
203
|
+
const message = createBaseUser_LinkedAccountsEntry();
|
|
204
|
+
while (reader.pos < end) {
|
|
205
|
+
const tag = reader.uint32();
|
|
206
|
+
switch (tag >>> 3) {
|
|
207
|
+
case 1: {
|
|
208
|
+
if (tag !== 10) {
|
|
209
|
+
break;
|
|
210
|
+
}
|
|
211
|
+
message.key = reader.string();
|
|
212
|
+
continue;
|
|
194
213
|
}
|
|
195
|
-
|
|
196
|
-
|
|
197
|
-
|
|
198
|
-
|
|
199
|
-
|
|
200
|
-
|
|
214
|
+
case 2: {
|
|
215
|
+
if (tag !== 18) {
|
|
216
|
+
break;
|
|
217
|
+
}
|
|
218
|
+
message.value = reader.string();
|
|
219
|
+
continue;
|
|
201
220
|
}
|
|
202
|
-
message.value = reader.string();
|
|
203
|
-
continue;
|
|
204
221
|
}
|
|
222
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
223
|
+
break;
|
|
224
|
+
}
|
|
225
|
+
reader.skip(tag & 7);
|
|
205
226
|
}
|
|
206
|
-
|
|
207
|
-
|
|
208
|
-
|
|
209
|
-
reader.
|
|
227
|
+
return message;
|
|
228
|
+
}
|
|
229
|
+
finally {
|
|
230
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
210
231
|
}
|
|
211
|
-
return message;
|
|
212
232
|
},
|
|
213
233
|
create(base) {
|
|
214
234
|
return exports.User_LinkedAccountsEntry.fromPartial(base ?? {});
|
|
@@ -232,25 +252,35 @@ exports.GetUsersRequest = {
|
|
|
232
252
|
},
|
|
233
253
|
decode(input, length) {
|
|
234
254
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
235
|
-
const
|
|
236
|
-
|
|
237
|
-
|
|
238
|
-
|
|
239
|
-
|
|
240
|
-
|
|
241
|
-
|
|
242
|
-
|
|
255
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
256
|
+
if (previousRecursionDepth >= 100) {
|
|
257
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
258
|
+
}
|
|
259
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
260
|
+
try {
|
|
261
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
262
|
+
const message = createBaseGetUsersRequest();
|
|
263
|
+
while (reader.pos < end) {
|
|
264
|
+
const tag = reader.uint32();
|
|
265
|
+
switch (tag >>> 3) {
|
|
266
|
+
case 1: {
|
|
267
|
+
if (tag !== 8) {
|
|
268
|
+
break;
|
|
269
|
+
}
|
|
270
|
+
message.includeInactive = reader.bool();
|
|
271
|
+
continue;
|
|
243
272
|
}
|
|
244
|
-
message.includeInactive = reader.bool();
|
|
245
|
-
continue;
|
|
246
273
|
}
|
|
274
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
275
|
+
break;
|
|
276
|
+
}
|
|
277
|
+
reader.skip(tag & 7);
|
|
247
278
|
}
|
|
248
|
-
|
|
249
|
-
|
|
250
|
-
|
|
251
|
-
reader.
|
|
279
|
+
return message;
|
|
280
|
+
}
|
|
281
|
+
finally {
|
|
282
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
252
283
|
}
|
|
253
|
-
return message;
|
|
254
284
|
},
|
|
255
285
|
create(base) {
|
|
256
286
|
return exports.GetUsersRequest.fromPartial(base ?? {});
|
|
@@ -273,25 +303,35 @@ exports.GetUsersResponse = {
|
|
|
273
303
|
},
|
|
274
304
|
decode(input, length) {
|
|
275
305
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
276
|
-
const
|
|
277
|
-
|
|
278
|
-
|
|
279
|
-
|
|
280
|
-
|
|
281
|
-
|
|
282
|
-
|
|
283
|
-
|
|
306
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
307
|
+
if (previousRecursionDepth >= 100) {
|
|
308
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
309
|
+
}
|
|
310
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
311
|
+
try {
|
|
312
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
313
|
+
const message = createBaseGetUsersResponse();
|
|
314
|
+
while (reader.pos < end) {
|
|
315
|
+
const tag = reader.uint32();
|
|
316
|
+
switch (tag >>> 3) {
|
|
317
|
+
case 1: {
|
|
318
|
+
if (tag !== 10) {
|
|
319
|
+
break;
|
|
320
|
+
}
|
|
321
|
+
message.users.push(exports.User.decode(reader, reader.uint32()));
|
|
322
|
+
continue;
|
|
284
323
|
}
|
|
285
|
-
message.users.push(exports.User.decode(reader, reader.uint32()));
|
|
286
|
-
continue;
|
|
287
324
|
}
|
|
325
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
326
|
+
break;
|
|
327
|
+
}
|
|
328
|
+
reader.skip(tag & 7);
|
|
288
329
|
}
|
|
289
|
-
|
|
290
|
-
|
|
291
|
-
|
|
292
|
-
reader.
|
|
330
|
+
return message;
|
|
331
|
+
}
|
|
332
|
+
finally {
|
|
333
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
293
334
|
}
|
|
294
|
-
return message;
|
|
295
335
|
},
|
|
296
336
|
create(base) {
|
|
297
337
|
return exports.GetUsersResponse.fromPartial(base ?? {});
|
|
@@ -323,46 +363,56 @@ exports.GetUserRequest = {
|
|
|
323
363
|
},
|
|
324
364
|
decode(input, length) {
|
|
325
365
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
326
|
-
const
|
|
327
|
-
|
|
328
|
-
|
|
329
|
-
|
|
330
|
-
|
|
331
|
-
|
|
332
|
-
|
|
333
|
-
|
|
366
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
367
|
+
if (previousRecursionDepth >= 100) {
|
|
368
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
369
|
+
}
|
|
370
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
371
|
+
try {
|
|
372
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
373
|
+
const message = createBaseGetUserRequest();
|
|
374
|
+
while (reader.pos < end) {
|
|
375
|
+
const tag = reader.uint32();
|
|
376
|
+
switch (tag >>> 3) {
|
|
377
|
+
case 1: {
|
|
378
|
+
if (tag !== 10) {
|
|
379
|
+
break;
|
|
380
|
+
}
|
|
381
|
+
message.userName = reader.string();
|
|
382
|
+
continue;
|
|
334
383
|
}
|
|
335
|
-
|
|
336
|
-
|
|
337
|
-
|
|
338
|
-
|
|
339
|
-
|
|
340
|
-
|
|
384
|
+
case 2: {
|
|
385
|
+
if (tag !== 16) {
|
|
386
|
+
break;
|
|
387
|
+
}
|
|
388
|
+
message.id = reader.int32();
|
|
389
|
+
continue;
|
|
341
390
|
}
|
|
342
|
-
|
|
343
|
-
|
|
344
|
-
|
|
345
|
-
|
|
346
|
-
|
|
347
|
-
|
|
391
|
+
case 3: {
|
|
392
|
+
if (tag !== 26) {
|
|
393
|
+
break;
|
|
394
|
+
}
|
|
395
|
+
message.linkedAccount = exports.LinkedAccountLookup.decode(reader, reader.uint32());
|
|
396
|
+
continue;
|
|
348
397
|
}
|
|
349
|
-
|
|
350
|
-
|
|
351
|
-
|
|
352
|
-
|
|
353
|
-
|
|
354
|
-
|
|
398
|
+
case 4: {
|
|
399
|
+
if (tag !== 32) {
|
|
400
|
+
break;
|
|
401
|
+
}
|
|
402
|
+
message.type = reader.int32();
|
|
403
|
+
continue;
|
|
355
404
|
}
|
|
356
|
-
message.type = reader.int32();
|
|
357
|
-
continue;
|
|
358
405
|
}
|
|
406
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
407
|
+
break;
|
|
408
|
+
}
|
|
409
|
+
reader.skip(tag & 7);
|
|
359
410
|
}
|
|
360
|
-
|
|
361
|
-
|
|
362
|
-
|
|
363
|
-
reader.
|
|
411
|
+
return message;
|
|
412
|
+
}
|
|
413
|
+
finally {
|
|
414
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
364
415
|
}
|
|
365
|
-
return message;
|
|
366
416
|
},
|
|
367
417
|
create(base) {
|
|
368
418
|
return exports.GetUserRequest.fromPartial(base ?? {});
|
|
@@ -393,32 +443,42 @@ exports.LinkedAccountLookup = {
|
|
|
393
443
|
},
|
|
394
444
|
decode(input, length) {
|
|
395
445
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
396
|
-
const
|
|
397
|
-
|
|
398
|
-
|
|
399
|
-
|
|
400
|
-
|
|
401
|
-
|
|
402
|
-
|
|
403
|
-
|
|
446
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
447
|
+
if (previousRecursionDepth >= 100) {
|
|
448
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
449
|
+
}
|
|
450
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
451
|
+
try {
|
|
452
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
453
|
+
const message = createBaseLinkedAccountLookup();
|
|
454
|
+
while (reader.pos < end) {
|
|
455
|
+
const tag = reader.uint32();
|
|
456
|
+
switch (tag >>> 3) {
|
|
457
|
+
case 1: {
|
|
458
|
+
if (tag !== 10) {
|
|
459
|
+
break;
|
|
460
|
+
}
|
|
461
|
+
message.provider = reader.string();
|
|
462
|
+
continue;
|
|
404
463
|
}
|
|
405
|
-
|
|
406
|
-
|
|
407
|
-
|
|
408
|
-
|
|
409
|
-
|
|
410
|
-
|
|
464
|
+
case 2: {
|
|
465
|
+
if (tag !== 18) {
|
|
466
|
+
break;
|
|
467
|
+
}
|
|
468
|
+
message.externalId = reader.string();
|
|
469
|
+
continue;
|
|
411
470
|
}
|
|
412
|
-
message.externalId = reader.string();
|
|
413
|
-
continue;
|
|
414
471
|
}
|
|
472
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
473
|
+
break;
|
|
474
|
+
}
|
|
475
|
+
reader.skip(tag & 7);
|
|
415
476
|
}
|
|
416
|
-
|
|
417
|
-
|
|
418
|
-
|
|
419
|
-
reader.
|
|
477
|
+
return message;
|
|
478
|
+
}
|
|
479
|
+
finally {
|
|
480
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
420
481
|
}
|
|
421
|
-
return message;
|
|
422
482
|
},
|
|
423
483
|
create(base) {
|
|
424
484
|
return exports.LinkedAccountLookup.fromPartial(base ?? {});
|
|
@@ -445,32 +505,42 @@ exports.UserResponse = {
|
|
|
445
505
|
},
|
|
446
506
|
decode(input, length) {
|
|
447
507
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
448
|
-
const
|
|
449
|
-
|
|
450
|
-
|
|
451
|
-
|
|
452
|
-
|
|
453
|
-
|
|
454
|
-
|
|
455
|
-
|
|
508
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
509
|
+
if (previousRecursionDepth >= 100) {
|
|
510
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
511
|
+
}
|
|
512
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
513
|
+
try {
|
|
514
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
515
|
+
const message = createBaseUserResponse();
|
|
516
|
+
while (reader.pos < end) {
|
|
517
|
+
const tag = reader.uint32();
|
|
518
|
+
switch (tag >>> 3) {
|
|
519
|
+
case 1: {
|
|
520
|
+
if (tag !== 8) {
|
|
521
|
+
break;
|
|
522
|
+
}
|
|
523
|
+
message.found = reader.bool();
|
|
524
|
+
continue;
|
|
456
525
|
}
|
|
457
|
-
|
|
458
|
-
|
|
459
|
-
|
|
460
|
-
|
|
461
|
-
|
|
462
|
-
|
|
526
|
+
case 2: {
|
|
527
|
+
if (tag !== 18) {
|
|
528
|
+
break;
|
|
529
|
+
}
|
|
530
|
+
message.user = exports.User.decode(reader, reader.uint32());
|
|
531
|
+
continue;
|
|
463
532
|
}
|
|
464
|
-
message.user = exports.User.decode(reader, reader.uint32());
|
|
465
|
-
continue;
|
|
466
533
|
}
|
|
534
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
535
|
+
break;
|
|
536
|
+
}
|
|
537
|
+
reader.skip(tag & 7);
|
|
467
538
|
}
|
|
468
|
-
|
|
469
|
-
|
|
470
|
-
|
|
471
|
-
reader.
|
|
539
|
+
return message;
|
|
540
|
+
}
|
|
541
|
+
finally {
|
|
542
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
472
543
|
}
|
|
473
|
-
return message;
|
|
474
544
|
},
|
|
475
545
|
create(base) {
|
|
476
546
|
return exports.UserResponse.fromPartial(base ?? {});
|
|
@@ -497,32 +567,42 @@ exports.LoginRequest = {
|
|
|
497
567
|
},
|
|
498
568
|
decode(input, length) {
|
|
499
569
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
500
|
-
const
|
|
501
|
-
|
|
502
|
-
|
|
503
|
-
|
|
504
|
-
|
|
505
|
-
|
|
506
|
-
|
|
507
|
-
|
|
570
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
571
|
+
if (previousRecursionDepth >= 100) {
|
|
572
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
573
|
+
}
|
|
574
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
575
|
+
try {
|
|
576
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
577
|
+
const message = createBaseLoginRequest();
|
|
578
|
+
while (reader.pos < end) {
|
|
579
|
+
const tag = reader.uint32();
|
|
580
|
+
switch (tag >>> 3) {
|
|
581
|
+
case 1: {
|
|
582
|
+
if (tag !== 10) {
|
|
583
|
+
break;
|
|
584
|
+
}
|
|
585
|
+
message.username = reader.string();
|
|
586
|
+
continue;
|
|
508
587
|
}
|
|
509
|
-
|
|
510
|
-
|
|
511
|
-
|
|
512
|
-
|
|
513
|
-
|
|
514
|
-
|
|
588
|
+
case 2: {
|
|
589
|
+
if (tag !== 18) {
|
|
590
|
+
break;
|
|
591
|
+
}
|
|
592
|
+
message.password = reader.string();
|
|
593
|
+
continue;
|
|
515
594
|
}
|
|
516
|
-
message.password = reader.string();
|
|
517
|
-
continue;
|
|
518
595
|
}
|
|
596
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
597
|
+
break;
|
|
598
|
+
}
|
|
599
|
+
reader.skip(tag & 7);
|
|
519
600
|
}
|
|
520
|
-
|
|
521
|
-
|
|
522
|
-
|
|
523
|
-
reader.
|
|
601
|
+
return message;
|
|
602
|
+
}
|
|
603
|
+
finally {
|
|
604
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
524
605
|
}
|
|
525
|
-
return message;
|
|
526
606
|
},
|
|
527
607
|
create(base) {
|
|
528
608
|
return exports.LoginRequest.fromPartial(base ?? {});
|
|
@@ -555,46 +635,56 @@ exports.LinkAccountRequest = {
|
|
|
555
635
|
},
|
|
556
636
|
decode(input, length) {
|
|
557
637
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
558
|
-
const
|
|
559
|
-
|
|
560
|
-
|
|
561
|
-
|
|
562
|
-
|
|
563
|
-
|
|
564
|
-
|
|
565
|
-
|
|
638
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
639
|
+
if (previousRecursionDepth >= 100) {
|
|
640
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
641
|
+
}
|
|
642
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
643
|
+
try {
|
|
644
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
645
|
+
const message = createBaseLinkAccountRequest();
|
|
646
|
+
while (reader.pos < end) {
|
|
647
|
+
const tag = reader.uint32();
|
|
648
|
+
switch (tag >>> 3) {
|
|
649
|
+
case 1: {
|
|
650
|
+
if (tag !== 8) {
|
|
651
|
+
break;
|
|
652
|
+
}
|
|
653
|
+
message.userId = reader.int32();
|
|
654
|
+
continue;
|
|
566
655
|
}
|
|
567
|
-
|
|
568
|
-
|
|
569
|
-
|
|
570
|
-
|
|
571
|
-
|
|
572
|
-
|
|
656
|
+
case 2: {
|
|
657
|
+
if (tag !== 18) {
|
|
658
|
+
break;
|
|
659
|
+
}
|
|
660
|
+
message.service = reader.string();
|
|
661
|
+
continue;
|
|
573
662
|
}
|
|
574
|
-
|
|
575
|
-
|
|
576
|
-
|
|
577
|
-
|
|
578
|
-
|
|
579
|
-
|
|
663
|
+
case 3: {
|
|
664
|
+
if (tag !== 26) {
|
|
665
|
+
break;
|
|
666
|
+
}
|
|
667
|
+
message.accountId = reader.string();
|
|
668
|
+
continue;
|
|
580
669
|
}
|
|
581
|
-
|
|
582
|
-
|
|
583
|
-
|
|
584
|
-
|
|
585
|
-
|
|
586
|
-
|
|
670
|
+
case 4: {
|
|
671
|
+
if (tag !== 34) {
|
|
672
|
+
break;
|
|
673
|
+
}
|
|
674
|
+
message.providerPayload = reader.string();
|
|
675
|
+
continue;
|
|
587
676
|
}
|
|
588
|
-
message.providerPayload = reader.string();
|
|
589
|
-
continue;
|
|
590
677
|
}
|
|
678
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
679
|
+
break;
|
|
680
|
+
}
|
|
681
|
+
reader.skip(tag & 7);
|
|
591
682
|
}
|
|
592
|
-
|
|
593
|
-
|
|
594
|
-
|
|
595
|
-
reader.
|
|
683
|
+
return message;
|
|
684
|
+
}
|
|
685
|
+
finally {
|
|
686
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
596
687
|
}
|
|
597
|
-
return message;
|
|
598
688
|
},
|
|
599
689
|
create(base) {
|
|
600
690
|
return exports.LinkAccountRequest.fromPartial(base ?? {});
|
|
@@ -629,46 +719,56 @@ exports.UnlinkAccountRequest = {
|
|
|
629
719
|
},
|
|
630
720
|
decode(input, length) {
|
|
631
721
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
632
|
-
const
|
|
633
|
-
|
|
634
|
-
|
|
635
|
-
|
|
636
|
-
|
|
637
|
-
|
|
638
|
-
|
|
639
|
-
|
|
722
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
723
|
+
if (previousRecursionDepth >= 100) {
|
|
724
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
725
|
+
}
|
|
726
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
727
|
+
try {
|
|
728
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
729
|
+
const message = createBaseUnlinkAccountRequest();
|
|
730
|
+
while (reader.pos < end) {
|
|
731
|
+
const tag = reader.uint32();
|
|
732
|
+
switch (tag >>> 3) {
|
|
733
|
+
case 1: {
|
|
734
|
+
if (tag !== 8) {
|
|
735
|
+
break;
|
|
736
|
+
}
|
|
737
|
+
message.userId = reader.int32();
|
|
738
|
+
continue;
|
|
640
739
|
}
|
|
641
|
-
|
|
642
|
-
|
|
643
|
-
|
|
644
|
-
|
|
645
|
-
|
|
646
|
-
|
|
740
|
+
case 2: {
|
|
741
|
+
if (tag !== 18) {
|
|
742
|
+
break;
|
|
743
|
+
}
|
|
744
|
+
message.service = reader.string();
|
|
745
|
+
continue;
|
|
647
746
|
}
|
|
648
|
-
|
|
649
|
-
|
|
650
|
-
|
|
651
|
-
|
|
652
|
-
|
|
653
|
-
|
|
747
|
+
case 3: {
|
|
748
|
+
if (tag !== 26) {
|
|
749
|
+
break;
|
|
750
|
+
}
|
|
751
|
+
message.accountId = reader.string();
|
|
752
|
+
continue;
|
|
654
753
|
}
|
|
655
|
-
|
|
656
|
-
|
|
657
|
-
|
|
658
|
-
|
|
659
|
-
|
|
660
|
-
|
|
754
|
+
case 4: {
|
|
755
|
+
if (tag !== 32) {
|
|
756
|
+
break;
|
|
757
|
+
}
|
|
758
|
+
message.requestorId = reader.int32();
|
|
759
|
+
continue;
|
|
661
760
|
}
|
|
662
|
-
message.requestorId = reader.int32();
|
|
663
|
-
continue;
|
|
664
761
|
}
|
|
762
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
763
|
+
break;
|
|
764
|
+
}
|
|
765
|
+
reader.skip(tag & 7);
|
|
665
766
|
}
|
|
666
|
-
|
|
667
|
-
|
|
668
|
-
|
|
669
|
-
reader.
|
|
767
|
+
return message;
|
|
768
|
+
}
|
|
769
|
+
finally {
|
|
770
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
670
771
|
}
|
|
671
|
-
return message;
|
|
672
772
|
},
|
|
673
773
|
create(base) {
|
|
674
774
|
return exports.UnlinkAccountRequest.fromPartial(base ?? {});
|
|
@@ -697,32 +797,42 @@ exports.SetTrustLevelRequest = {
|
|
|
697
797
|
},
|
|
698
798
|
decode(input, length) {
|
|
699
799
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
700
|
-
const
|
|
701
|
-
|
|
702
|
-
|
|
703
|
-
|
|
704
|
-
|
|
705
|
-
|
|
706
|
-
|
|
707
|
-
|
|
800
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
801
|
+
if (previousRecursionDepth >= 100) {
|
|
802
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
803
|
+
}
|
|
804
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
805
|
+
try {
|
|
806
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
807
|
+
const message = createBaseSetTrustLevelRequest();
|
|
808
|
+
while (reader.pos < end) {
|
|
809
|
+
const tag = reader.uint32();
|
|
810
|
+
switch (tag >>> 3) {
|
|
811
|
+
case 1: {
|
|
812
|
+
if (tag !== 8) {
|
|
813
|
+
break;
|
|
814
|
+
}
|
|
815
|
+
message.userId = reader.int32();
|
|
816
|
+
continue;
|
|
708
817
|
}
|
|
709
|
-
|
|
710
|
-
|
|
711
|
-
|
|
712
|
-
|
|
713
|
-
|
|
714
|
-
|
|
818
|
+
case 2: {
|
|
819
|
+
if (tag !== 16) {
|
|
820
|
+
break;
|
|
821
|
+
}
|
|
822
|
+
message.level = reader.int32();
|
|
823
|
+
continue;
|
|
715
824
|
}
|
|
716
|
-
message.level = reader.int32();
|
|
717
|
-
continue;
|
|
718
825
|
}
|
|
826
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
827
|
+
break;
|
|
828
|
+
}
|
|
829
|
+
reader.skip(tag & 7);
|
|
719
830
|
}
|
|
720
|
-
|
|
721
|
-
|
|
722
|
-
|
|
723
|
-
reader.
|
|
831
|
+
return message;
|
|
832
|
+
}
|
|
833
|
+
finally {
|
|
834
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
724
835
|
}
|
|
725
|
-
return message;
|
|
726
836
|
},
|
|
727
837
|
create(base) {
|
|
728
838
|
return exports.SetTrustLevelRequest.fromPartial(base ?? {});
|
|
@@ -749,32 +859,42 @@ exports.SetSystemMessagesRequest = {
|
|
|
749
859
|
},
|
|
750
860
|
decode(input, length) {
|
|
751
861
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
752
|
-
const
|
|
753
|
-
|
|
754
|
-
|
|
755
|
-
|
|
756
|
-
|
|
757
|
-
|
|
758
|
-
|
|
759
|
-
|
|
862
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
863
|
+
if (previousRecursionDepth >= 100) {
|
|
864
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
865
|
+
}
|
|
866
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
867
|
+
try {
|
|
868
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
869
|
+
const message = createBaseSetSystemMessagesRequest();
|
|
870
|
+
while (reader.pos < end) {
|
|
871
|
+
const tag = reader.uint32();
|
|
872
|
+
switch (tag >>> 3) {
|
|
873
|
+
case 1: {
|
|
874
|
+
if (tag !== 8) {
|
|
875
|
+
break;
|
|
876
|
+
}
|
|
877
|
+
message.userId = reader.int32();
|
|
878
|
+
continue;
|
|
760
879
|
}
|
|
761
|
-
|
|
762
|
-
|
|
763
|
-
|
|
764
|
-
|
|
765
|
-
|
|
766
|
-
|
|
880
|
+
case 2: {
|
|
881
|
+
if (tag !== 16) {
|
|
882
|
+
break;
|
|
883
|
+
}
|
|
884
|
+
message.enabled = reader.bool();
|
|
885
|
+
continue;
|
|
767
886
|
}
|
|
768
|
-
message.enabled = reader.bool();
|
|
769
|
-
continue;
|
|
770
887
|
}
|
|
888
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
889
|
+
break;
|
|
890
|
+
}
|
|
891
|
+
reader.skip(tag & 7);
|
|
771
892
|
}
|
|
772
|
-
|
|
773
|
-
|
|
774
|
-
|
|
775
|
-
reader.
|
|
893
|
+
return message;
|
|
894
|
+
}
|
|
895
|
+
finally {
|
|
896
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
776
897
|
}
|
|
777
|
-
return message;
|
|
778
898
|
},
|
|
779
899
|
create(base) {
|
|
780
900
|
return exports.SetSystemMessagesRequest.fromPartial(base ?? {});
|
|
@@ -804,39 +924,49 @@ exports.SetAutomationRequest = {
|
|
|
804
924
|
},
|
|
805
925
|
decode(input, length) {
|
|
806
926
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
807
|
-
const
|
|
808
|
-
|
|
809
|
-
|
|
810
|
-
|
|
811
|
-
|
|
812
|
-
|
|
813
|
-
|
|
814
|
-
|
|
927
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
928
|
+
if (previousRecursionDepth >= 100) {
|
|
929
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
930
|
+
}
|
|
931
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
932
|
+
try {
|
|
933
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
934
|
+
const message = createBaseSetAutomationRequest();
|
|
935
|
+
while (reader.pos < end) {
|
|
936
|
+
const tag = reader.uint32();
|
|
937
|
+
switch (tag >>> 3) {
|
|
938
|
+
case 1: {
|
|
939
|
+
if (tag !== 8) {
|
|
940
|
+
break;
|
|
941
|
+
}
|
|
942
|
+
message.userId = reader.int32();
|
|
943
|
+
continue;
|
|
815
944
|
}
|
|
816
|
-
|
|
817
|
-
|
|
818
|
-
|
|
819
|
-
|
|
820
|
-
|
|
821
|
-
|
|
945
|
+
case 2: {
|
|
946
|
+
if (tag !== 18) {
|
|
947
|
+
break;
|
|
948
|
+
}
|
|
949
|
+
message.automation = reader.string();
|
|
950
|
+
continue;
|
|
822
951
|
}
|
|
823
|
-
|
|
824
|
-
|
|
825
|
-
|
|
826
|
-
|
|
827
|
-
|
|
828
|
-
|
|
952
|
+
case 3: {
|
|
953
|
+
if (tag !== 24) {
|
|
954
|
+
break;
|
|
955
|
+
}
|
|
956
|
+
message.enabled = reader.bool();
|
|
957
|
+
continue;
|
|
829
958
|
}
|
|
830
|
-
message.enabled = reader.bool();
|
|
831
|
-
continue;
|
|
832
959
|
}
|
|
960
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
961
|
+
break;
|
|
962
|
+
}
|
|
963
|
+
reader.skip(tag & 7);
|
|
833
964
|
}
|
|
834
|
-
|
|
835
|
-
|
|
836
|
-
|
|
837
|
-
reader.
|
|
965
|
+
return message;
|
|
966
|
+
}
|
|
967
|
+
finally {
|
|
968
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
838
969
|
}
|
|
839
|
-
return message;
|
|
840
970
|
},
|
|
841
971
|
create(base) {
|
|
842
972
|
return exports.SetAutomationRequest.fromPartial(base ?? {});
|
|
@@ -873,53 +1003,63 @@ exports.CreateUserRequest = {
|
|
|
873
1003
|
},
|
|
874
1004
|
decode(input, length) {
|
|
875
1005
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
876
|
-
const
|
|
877
|
-
|
|
878
|
-
|
|
879
|
-
|
|
880
|
-
|
|
881
|
-
|
|
882
|
-
|
|
883
|
-
|
|
1006
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1007
|
+
if (previousRecursionDepth >= 100) {
|
|
1008
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1009
|
+
}
|
|
1010
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1011
|
+
try {
|
|
1012
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1013
|
+
const message = createBaseCreateUserRequest();
|
|
1014
|
+
while (reader.pos < end) {
|
|
1015
|
+
const tag = reader.uint32();
|
|
1016
|
+
switch (tag >>> 3) {
|
|
1017
|
+
case 1: {
|
|
1018
|
+
if (tag !== 10) {
|
|
1019
|
+
break;
|
|
1020
|
+
}
|
|
1021
|
+
message.username = reader.string();
|
|
1022
|
+
continue;
|
|
884
1023
|
}
|
|
885
|
-
|
|
886
|
-
|
|
887
|
-
|
|
888
|
-
|
|
889
|
-
|
|
890
|
-
|
|
1024
|
+
case 2: {
|
|
1025
|
+
if (tag !== 18) {
|
|
1026
|
+
break;
|
|
1027
|
+
}
|
|
1028
|
+
message.password = reader.string();
|
|
1029
|
+
continue;
|
|
891
1030
|
}
|
|
892
|
-
|
|
893
|
-
|
|
894
|
-
|
|
895
|
-
|
|
896
|
-
|
|
897
|
-
|
|
1031
|
+
case 3: {
|
|
1032
|
+
if (tag !== 26) {
|
|
1033
|
+
break;
|
|
1034
|
+
}
|
|
1035
|
+
message.email = reader.string();
|
|
1036
|
+
continue;
|
|
898
1037
|
}
|
|
899
|
-
|
|
900
|
-
|
|
901
|
-
|
|
902
|
-
|
|
903
|
-
|
|
904
|
-
|
|
1038
|
+
case 4: {
|
|
1039
|
+
if (tag !== 34) {
|
|
1040
|
+
break;
|
|
1041
|
+
}
|
|
1042
|
+
message.displayName = reader.string();
|
|
1043
|
+
continue;
|
|
905
1044
|
}
|
|
906
|
-
|
|
907
|
-
|
|
908
|
-
|
|
909
|
-
|
|
910
|
-
|
|
911
|
-
|
|
1045
|
+
case 5: {
|
|
1046
|
+
if (tag !== 42) {
|
|
1047
|
+
break;
|
|
1048
|
+
}
|
|
1049
|
+
message.type = reader.string();
|
|
1050
|
+
continue;
|
|
912
1051
|
}
|
|
913
|
-
message.type = reader.string();
|
|
914
|
-
continue;
|
|
915
1052
|
}
|
|
1053
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1054
|
+
break;
|
|
1055
|
+
}
|
|
1056
|
+
reader.skip(tag & 7);
|
|
916
1057
|
}
|
|
917
|
-
|
|
918
|
-
|
|
919
|
-
|
|
920
|
-
reader.
|
|
1058
|
+
return message;
|
|
1059
|
+
}
|
|
1060
|
+
finally {
|
|
1061
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
921
1062
|
}
|
|
922
|
-
return message;
|
|
923
1063
|
},
|
|
924
1064
|
create(base) {
|
|
925
1065
|
return exports.CreateUserRequest.fromPartial(base ?? {});
|
|
@@ -952,39 +1092,49 @@ exports.CreateUserResponse = {
|
|
|
952
1092
|
},
|
|
953
1093
|
decode(input, length) {
|
|
954
1094
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
955
|
-
const
|
|
956
|
-
|
|
957
|
-
|
|
958
|
-
|
|
959
|
-
|
|
960
|
-
|
|
961
|
-
|
|
962
|
-
|
|
1095
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1096
|
+
if (previousRecursionDepth >= 100) {
|
|
1097
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1098
|
+
}
|
|
1099
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1100
|
+
try {
|
|
1101
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1102
|
+
const message = createBaseCreateUserResponse();
|
|
1103
|
+
while (reader.pos < end) {
|
|
1104
|
+
const tag = reader.uint32();
|
|
1105
|
+
switch (tag >>> 3) {
|
|
1106
|
+
case 1: {
|
|
1107
|
+
if (tag !== 8) {
|
|
1108
|
+
break;
|
|
1109
|
+
}
|
|
1110
|
+
message.ok = reader.bool();
|
|
1111
|
+
continue;
|
|
963
1112
|
}
|
|
964
|
-
|
|
965
|
-
|
|
966
|
-
|
|
967
|
-
|
|
968
|
-
|
|
969
|
-
|
|
1113
|
+
case 2: {
|
|
1114
|
+
if (tag !== 16) {
|
|
1115
|
+
break;
|
|
1116
|
+
}
|
|
1117
|
+
message.id = reader.int32();
|
|
1118
|
+
continue;
|
|
970
1119
|
}
|
|
971
|
-
|
|
972
|
-
|
|
973
|
-
|
|
974
|
-
|
|
975
|
-
|
|
976
|
-
|
|
1120
|
+
case 3: {
|
|
1121
|
+
if (tag !== 26) {
|
|
1122
|
+
break;
|
|
1123
|
+
}
|
|
1124
|
+
message.message = reader.string();
|
|
1125
|
+
continue;
|
|
977
1126
|
}
|
|
978
|
-
message.message = reader.string();
|
|
979
|
-
continue;
|
|
980
1127
|
}
|
|
1128
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1129
|
+
break;
|
|
1130
|
+
}
|
|
1131
|
+
reader.skip(tag & 7);
|
|
981
1132
|
}
|
|
982
|
-
|
|
983
|
-
|
|
984
|
-
|
|
985
|
-
reader.
|
|
1133
|
+
return message;
|
|
1134
|
+
}
|
|
1135
|
+
finally {
|
|
1136
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
986
1137
|
}
|
|
987
|
-
return message;
|
|
988
1138
|
},
|
|
989
1139
|
create(base) {
|
|
990
1140
|
return exports.CreateUserResponse.fromPartial(base ?? {});
|
|
@@ -1024,60 +1174,70 @@ exports.UpdateUserRequest = {
|
|
|
1024
1174
|
},
|
|
1025
1175
|
decode(input, length) {
|
|
1026
1176
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
1027
|
-
const
|
|
1028
|
-
|
|
1029
|
-
|
|
1030
|
-
|
|
1031
|
-
|
|
1032
|
-
|
|
1033
|
-
|
|
1034
|
-
|
|
1177
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1178
|
+
if (previousRecursionDepth >= 100) {
|
|
1179
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1180
|
+
}
|
|
1181
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1182
|
+
try {
|
|
1183
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1184
|
+
const message = createBaseUpdateUserRequest();
|
|
1185
|
+
while (reader.pos < end) {
|
|
1186
|
+
const tag = reader.uint32();
|
|
1187
|
+
switch (tag >>> 3) {
|
|
1188
|
+
case 1: {
|
|
1189
|
+
if (tag !== 8) {
|
|
1190
|
+
break;
|
|
1191
|
+
}
|
|
1192
|
+
message.userId = reader.int32();
|
|
1193
|
+
continue;
|
|
1035
1194
|
}
|
|
1036
|
-
|
|
1037
|
-
|
|
1038
|
-
|
|
1039
|
-
|
|
1040
|
-
|
|
1041
|
-
|
|
1195
|
+
case 2: {
|
|
1196
|
+
if (tag !== 18) {
|
|
1197
|
+
break;
|
|
1198
|
+
}
|
|
1199
|
+
message.displayName = reader.string();
|
|
1200
|
+
continue;
|
|
1042
1201
|
}
|
|
1043
|
-
|
|
1044
|
-
|
|
1045
|
-
|
|
1046
|
-
|
|
1047
|
-
|
|
1048
|
-
|
|
1202
|
+
case 3: {
|
|
1203
|
+
if (tag !== 26) {
|
|
1204
|
+
break;
|
|
1205
|
+
}
|
|
1206
|
+
message.email = reader.string();
|
|
1207
|
+
continue;
|
|
1049
1208
|
}
|
|
1050
|
-
|
|
1051
|
-
|
|
1052
|
-
|
|
1053
|
-
|
|
1054
|
-
|
|
1055
|
-
|
|
1209
|
+
case 4: {
|
|
1210
|
+
if (tag !== 34) {
|
|
1211
|
+
break;
|
|
1212
|
+
}
|
|
1213
|
+
message.type = reader.string();
|
|
1214
|
+
continue;
|
|
1056
1215
|
}
|
|
1057
|
-
|
|
1058
|
-
|
|
1059
|
-
|
|
1060
|
-
|
|
1061
|
-
|
|
1062
|
-
|
|
1216
|
+
case 5: {
|
|
1217
|
+
if (tag !== 40) {
|
|
1218
|
+
break;
|
|
1219
|
+
}
|
|
1220
|
+
message.isActive = reader.bool();
|
|
1221
|
+
continue;
|
|
1063
1222
|
}
|
|
1064
|
-
|
|
1065
|
-
|
|
1066
|
-
|
|
1067
|
-
|
|
1068
|
-
|
|
1069
|
-
|
|
1223
|
+
case 6: {
|
|
1224
|
+
if (tag !== 50) {
|
|
1225
|
+
break;
|
|
1226
|
+
}
|
|
1227
|
+
message.password = reader.string();
|
|
1228
|
+
continue;
|
|
1070
1229
|
}
|
|
1071
|
-
message.password = reader.string();
|
|
1072
|
-
continue;
|
|
1073
1230
|
}
|
|
1231
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1232
|
+
break;
|
|
1233
|
+
}
|
|
1234
|
+
reader.skip(tag & 7);
|
|
1074
1235
|
}
|
|
1075
|
-
|
|
1076
|
-
|
|
1077
|
-
|
|
1078
|
-
reader.
|
|
1236
|
+
return message;
|
|
1237
|
+
}
|
|
1238
|
+
finally {
|
|
1239
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1079
1240
|
}
|
|
1080
|
-
return message;
|
|
1081
1241
|
},
|
|
1082
1242
|
create(base) {
|
|
1083
1243
|
return exports.UpdateUserRequest.fromPartial(base ?? {});
|
|
@@ -1105,25 +1265,35 @@ exports.DeleteUserRequest = {
|
|
|
1105
1265
|
},
|
|
1106
1266
|
decode(input, length) {
|
|
1107
1267
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
1108
|
-
const
|
|
1109
|
-
|
|
1110
|
-
|
|
1111
|
-
|
|
1112
|
-
|
|
1113
|
-
|
|
1114
|
-
|
|
1115
|
-
|
|
1268
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1269
|
+
if (previousRecursionDepth >= 100) {
|
|
1270
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1271
|
+
}
|
|
1272
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1273
|
+
try {
|
|
1274
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1275
|
+
const message = createBaseDeleteUserRequest();
|
|
1276
|
+
while (reader.pos < end) {
|
|
1277
|
+
const tag = reader.uint32();
|
|
1278
|
+
switch (tag >>> 3) {
|
|
1279
|
+
case 1: {
|
|
1280
|
+
if (tag !== 8) {
|
|
1281
|
+
break;
|
|
1282
|
+
}
|
|
1283
|
+
message.userId = reader.int32();
|
|
1284
|
+
continue;
|
|
1116
1285
|
}
|
|
1117
|
-
message.userId = reader.int32();
|
|
1118
|
-
continue;
|
|
1119
1286
|
}
|
|
1287
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1288
|
+
break;
|
|
1289
|
+
}
|
|
1290
|
+
reader.skip(tag & 7);
|
|
1120
1291
|
}
|
|
1121
|
-
|
|
1122
|
-
|
|
1123
|
-
|
|
1124
|
-
reader.
|
|
1292
|
+
return message;
|
|
1293
|
+
}
|
|
1294
|
+
finally {
|
|
1295
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1125
1296
|
}
|
|
1126
|
-
return message;
|
|
1127
1297
|
},
|
|
1128
1298
|
create(base) {
|
|
1129
1299
|
return exports.DeleteUserRequest.fromPartial(base ?? {});
|
|
@@ -1158,53 +1328,63 @@ exports.Resident = {
|
|
|
1158
1328
|
},
|
|
1159
1329
|
decode(input, length) {
|
|
1160
1330
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
1161
|
-
const
|
|
1162
|
-
|
|
1163
|
-
|
|
1164
|
-
|
|
1165
|
-
|
|
1166
|
-
|
|
1167
|
-
|
|
1168
|
-
|
|
1331
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1332
|
+
if (previousRecursionDepth >= 100) {
|
|
1333
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1334
|
+
}
|
|
1335
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1336
|
+
try {
|
|
1337
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1338
|
+
const message = createBaseResident();
|
|
1339
|
+
while (reader.pos < end) {
|
|
1340
|
+
const tag = reader.uint32();
|
|
1341
|
+
switch (tag >>> 3) {
|
|
1342
|
+
case 1: {
|
|
1343
|
+
if (tag !== 10) {
|
|
1344
|
+
break;
|
|
1345
|
+
}
|
|
1346
|
+
message.id = reader.string();
|
|
1347
|
+
continue;
|
|
1169
1348
|
}
|
|
1170
|
-
|
|
1171
|
-
|
|
1172
|
-
|
|
1173
|
-
|
|
1174
|
-
|
|
1175
|
-
|
|
1349
|
+
case 2: {
|
|
1350
|
+
if (tag !== 18) {
|
|
1351
|
+
break;
|
|
1352
|
+
}
|
|
1353
|
+
message.roomieId = reader.string();
|
|
1354
|
+
continue;
|
|
1176
1355
|
}
|
|
1177
|
-
|
|
1178
|
-
|
|
1179
|
-
|
|
1180
|
-
|
|
1181
|
-
|
|
1182
|
-
|
|
1356
|
+
case 3: {
|
|
1357
|
+
if (tag !== 26) {
|
|
1358
|
+
break;
|
|
1359
|
+
}
|
|
1360
|
+
message.displayName = reader.string();
|
|
1361
|
+
continue;
|
|
1183
1362
|
}
|
|
1184
|
-
|
|
1185
|
-
|
|
1186
|
-
|
|
1187
|
-
|
|
1188
|
-
|
|
1189
|
-
|
|
1363
|
+
case 4: {
|
|
1364
|
+
if (tag !== 34) {
|
|
1365
|
+
break;
|
|
1366
|
+
}
|
|
1367
|
+
message.type = reader.string();
|
|
1368
|
+
continue;
|
|
1190
1369
|
}
|
|
1191
|
-
|
|
1192
|
-
|
|
1193
|
-
|
|
1194
|
-
|
|
1195
|
-
|
|
1196
|
-
|
|
1370
|
+
case 5: {
|
|
1371
|
+
if (tag !== 40) {
|
|
1372
|
+
break;
|
|
1373
|
+
}
|
|
1374
|
+
message.home = reader.bool();
|
|
1375
|
+
continue;
|
|
1197
1376
|
}
|
|
1198
|
-
message.home = reader.bool();
|
|
1199
|
-
continue;
|
|
1200
1377
|
}
|
|
1378
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1379
|
+
break;
|
|
1380
|
+
}
|
|
1381
|
+
reader.skip(tag & 7);
|
|
1201
1382
|
}
|
|
1202
|
-
|
|
1203
|
-
|
|
1204
|
-
|
|
1205
|
-
reader.
|
|
1383
|
+
return message;
|
|
1384
|
+
}
|
|
1385
|
+
finally {
|
|
1386
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1206
1387
|
}
|
|
1207
|
-
return message;
|
|
1208
1388
|
},
|
|
1209
1389
|
create(base) {
|
|
1210
1390
|
return exports.Resident.fromPartial(base ?? {});
|
|
@@ -1231,25 +1411,35 @@ exports.GetResidentsResponse = {
|
|
|
1231
1411
|
},
|
|
1232
1412
|
decode(input, length) {
|
|
1233
1413
|
const reader = input instanceof wire_1.BinaryReader ? input : new wire_1.BinaryReader(input);
|
|
1234
|
-
const
|
|
1235
|
-
|
|
1236
|
-
|
|
1237
|
-
|
|
1238
|
-
|
|
1239
|
-
|
|
1240
|
-
|
|
1241
|
-
|
|
1414
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1415
|
+
if (previousRecursionDepth >= 100) {
|
|
1416
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1417
|
+
}
|
|
1418
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1419
|
+
try {
|
|
1420
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1421
|
+
const message = createBaseGetResidentsResponse();
|
|
1422
|
+
while (reader.pos < end) {
|
|
1423
|
+
const tag = reader.uint32();
|
|
1424
|
+
switch (tag >>> 3) {
|
|
1425
|
+
case 1: {
|
|
1426
|
+
if (tag !== 10) {
|
|
1427
|
+
break;
|
|
1428
|
+
}
|
|
1429
|
+
message.residents.push(exports.Resident.decode(reader, reader.uint32()));
|
|
1430
|
+
continue;
|
|
1242
1431
|
}
|
|
1243
|
-
message.residents.push(exports.Resident.decode(reader, reader.uint32()));
|
|
1244
|
-
continue;
|
|
1245
1432
|
}
|
|
1433
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1434
|
+
break;
|
|
1435
|
+
}
|
|
1436
|
+
reader.skip(tag & 7);
|
|
1246
1437
|
}
|
|
1247
|
-
|
|
1248
|
-
|
|
1249
|
-
|
|
1250
|
-
reader.
|
|
1438
|
+
return message;
|
|
1439
|
+
}
|
|
1440
|
+
finally {
|
|
1441
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1251
1442
|
}
|
|
1252
|
-
return message;
|
|
1253
1443
|
},
|
|
1254
1444
|
create(base) {
|
|
1255
1445
|
return exports.GetResidentsResponse.fromPartial(base ?? {});
|