@cratis/chronicle.contracts 16.37.0 → 16.37.2
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/cjs/generated/captures.d.ts.map +1 -1
- package/dist/cjs/generated/clients.d.ts.map +1 -1
- package/dist/cjs/generated/clients.js +234 -174
- package/dist/cjs/generated/clients.js.map +1 -1
- package/dist/cjs/generated/compliance.d.ts.map +1 -1
- package/dist/cjs/generated/events.d.ts.map +1 -1
- package/dist/cjs/generated/events.js +371 -261
- package/dist/cjs/generated/events.js.map +1 -1
- package/dist/cjs/generated/events_constraints.d.ts.map +1 -1
- package/dist/cjs/generated/events_constraints.js +235 -165
- package/dist/cjs/generated/events_constraints.js.map +1 -1
- package/dist/cjs/generated/eventsequences.d.ts.map +1 -1
- package/dist/cjs/generated/eventsequences.js +1693 -1341
- package/dist/cjs/generated/eventsequences.js.map +1 -1
- package/dist/cjs/generated/eventstores.d.ts.map +1 -1
- package/dist/cjs/generated/eventstores.js +172 -132
- package/dist/cjs/generated/eventstores.js.map +1 -1
- package/dist/cjs/generated/externalservices.d.ts.map +1 -1
- package/dist/cjs/generated/google/protobuf/empty.d.ts.map +1 -1
- package/dist/cjs/generated/google/protobuf/empty.js +20 -8
- package/dist/cjs/generated/google/protobuf/empty.js.map +1 -1
- package/dist/cjs/generated/host.d.ts.map +1 -1
- package/dist/cjs/generated/host.js +31 -21
- package/dist/cjs/generated/host.js.map +1 -1
- package/dist/cjs/generated/identities.d.ts.map +1 -1
- package/dist/cjs/generated/identities.js +142 -102
- package/dist/cjs/generated/identities.js.map +1 -1
- package/dist/cjs/generated/jobs.d.ts.map +1 -1
- package/dist/cjs/generated/jobs.js +802 -630
- package/dist/cjs/generated/jobs.js.map +1 -1
- package/dist/cjs/generated/namespaces.d.ts.map +1 -1
- package/dist/cjs/generated/namespaces.js +203 -153
- package/dist/cjs/generated/namespaces.js.map +1 -1
- package/dist/cjs/generated/observation.d.ts.map +1 -1
- package/dist/cjs/generated/observation.js +959 -749
- package/dist/cjs/generated/observation.js.map +1 -1
- package/dist/cjs/generated/observation_eventstoresubscriptions.d.ts.map +1 -1
- package/dist/cjs/generated/observation_reactors.d.ts.map +1 -1
- package/dist/cjs/generated/observation_reactors.js +895 -695
- package/dist/cjs/generated/observation_reactors.js.map +1 -1
- package/dist/cjs/generated/observation_reducers.d.ts.map +1 -1
- package/dist/cjs/generated/observation_reducers.js +841 -661
- package/dist/cjs/generated/observation_reducers.js.map +1 -1
- package/dist/cjs/generated/observation_webhooks.d.ts.map +1 -1
- package/dist/cjs/generated/observation_webhooks.js +541 -376
- package/dist/cjs/generated/observation_webhooks.js.map +1 -1
- package/dist/cjs/generated/projections.d.ts.map +1 -1
- package/dist/cjs/generated/projections.js +1867 -1392
- package/dist/cjs/generated/projections.js.map +1 -1
- package/dist/cjs/generated/protobuf-net/bcl.d.ts.map +1 -1
- package/dist/cjs/generated/protobuf-net/bcl.js +130 -90
- package/dist/cjs/generated/protobuf-net/bcl.js.map +1 -1
- package/dist/cjs/generated/readmodels.d.ts.map +1 -1
- package/dist/cjs/generated/readmodels.js +1705 -1345
- package/dist/cjs/generated/readmodels.js.map +1 -1
- package/dist/cjs/generated/recommendations.d.ts.map +1 -1
- package/dist/cjs/generated/recommendations.js +167 -117
- package/dist/cjs/generated/recommendations.js.map +1 -1
- package/dist/cjs/generated/security.d.ts.map +1 -1
- package/dist/cjs/generated/security.js +684 -512
- package/dist/cjs/generated/security.js.map +1 -1
- package/dist/cjs/generated/seeding.d.ts.map +1 -1
- package/dist/cjs/generated/seeding.js +247 -177
- package/dist/cjs/generated/seeding.js.map +1 -1
- package/dist/esm/generated/captures.d.ts.map +1 -1
- package/dist/esm/generated/clients.d.ts.map +1 -1
- package/dist/esm/generated/clients.js +234 -174
- package/dist/esm/generated/clients.js.map +1 -1
- package/dist/esm/generated/compliance.d.ts.map +1 -1
- package/dist/esm/generated/events.d.ts.map +1 -1
- package/dist/esm/generated/events.js +371 -261
- package/dist/esm/generated/events.js.map +1 -1
- package/dist/esm/generated/events_constraints.d.ts.map +1 -1
- package/dist/esm/generated/events_constraints.js +235 -165
- package/dist/esm/generated/events_constraints.js.map +1 -1
- package/dist/esm/generated/eventsequences.d.ts.map +1 -1
- package/dist/esm/generated/eventsequences.js +1693 -1341
- package/dist/esm/generated/eventsequences.js.map +1 -1
- package/dist/esm/generated/eventstores.d.ts.map +1 -1
- package/dist/esm/generated/eventstores.js +172 -132
- package/dist/esm/generated/eventstores.js.map +1 -1
- package/dist/esm/generated/externalservices.d.ts.map +1 -1
- package/dist/esm/generated/google/protobuf/empty.d.ts.map +1 -1
- package/dist/esm/generated/google/protobuf/empty.js +20 -8
- package/dist/esm/generated/google/protobuf/empty.js.map +1 -1
- package/dist/esm/generated/host.d.ts.map +1 -1
- package/dist/esm/generated/host.js +31 -21
- package/dist/esm/generated/host.js.map +1 -1
- package/dist/esm/generated/identities.d.ts.map +1 -1
- package/dist/esm/generated/identities.js +142 -102
- package/dist/esm/generated/identities.js.map +1 -1
- package/dist/esm/generated/jobs.d.ts.map +1 -1
- package/dist/esm/generated/jobs.js +802 -630
- package/dist/esm/generated/jobs.js.map +1 -1
- package/dist/esm/generated/namespaces.d.ts.map +1 -1
- package/dist/esm/generated/namespaces.js +203 -153
- package/dist/esm/generated/namespaces.js.map +1 -1
- package/dist/esm/generated/observation.d.ts.map +1 -1
- package/dist/esm/generated/observation.js +959 -749
- package/dist/esm/generated/observation.js.map +1 -1
- package/dist/esm/generated/observation_eventstoresubscriptions.d.ts.map +1 -1
- package/dist/esm/generated/observation_reactors.d.ts.map +1 -1
- package/dist/esm/generated/observation_reactors.js +895 -695
- package/dist/esm/generated/observation_reactors.js.map +1 -1
- package/dist/esm/generated/observation_reducers.d.ts.map +1 -1
- package/dist/esm/generated/observation_reducers.js +841 -661
- package/dist/esm/generated/observation_reducers.js.map +1 -1
- package/dist/esm/generated/observation_webhooks.d.ts.map +1 -1
- package/dist/esm/generated/observation_webhooks.js +541 -376
- package/dist/esm/generated/observation_webhooks.js.map +1 -1
- package/dist/esm/generated/projections.d.ts.map +1 -1
- package/dist/esm/generated/projections.js +1867 -1392
- package/dist/esm/generated/projections.js.map +1 -1
- package/dist/esm/generated/protobuf-net/bcl.d.ts.map +1 -1
- package/dist/esm/generated/protobuf-net/bcl.js +130 -90
- package/dist/esm/generated/protobuf-net/bcl.js.map +1 -1
- package/dist/esm/generated/readmodels.d.ts.map +1 -1
- package/dist/esm/generated/readmodels.js +1705 -1345
- package/dist/esm/generated/readmodels.js.map +1 -1
- package/dist/esm/generated/recommendations.d.ts.map +1 -1
- package/dist/esm/generated/recommendations.js +167 -117
- package/dist/esm/generated/recommendations.js.map +1 -1
- package/dist/esm/generated/security.d.ts.map +1 -1
- package/dist/esm/generated/security.js +684 -512
- package/dist/esm/generated/security.js.map +1 -1
- package/dist/esm/generated/seeding.d.ts.map +1 -1
- package/dist/esm/generated/seeding.js +247 -177
- package/dist/esm/generated/seeding.js.map +1 -1
- package/dist/generated/captures.d.ts.map +1 -1
- package/dist/generated/captures.js +372 -252
- package/dist/generated/captures.js.map +1 -1
- package/dist/generated/clients.d.ts.map +1 -1
- package/dist/generated/clients.js +234 -174
- package/dist/generated/clients.js.map +1 -1
- package/dist/generated/compliance.d.ts.map +1 -1
- package/dist/generated/compliance.js +160 -120
- package/dist/generated/compliance.js.map +1 -1
- package/dist/generated/events.d.ts.map +1 -1
- package/dist/generated/events.js +371 -261
- package/dist/generated/events.js.map +1 -1
- package/dist/generated/events_constraints.d.ts.map +1 -1
- package/dist/generated/events_constraints.js +235 -165
- package/dist/generated/events_constraints.js.map +1 -1
- package/dist/generated/eventsequences.d.ts.map +1 -1
- package/dist/generated/eventsequences.js +1693 -1343
- package/dist/generated/eventsequences.js.map +1 -1
- package/dist/generated/eventstores.d.ts.map +1 -1
- package/dist/generated/eventstores.js +172 -132
- package/dist/generated/eventstores.js.map +1 -1
- package/dist/generated/externalservices.d.ts.map +1 -1
- package/dist/generated/externalservices.js +488 -338
- package/dist/generated/externalservices.js.map +1 -1
- package/dist/generated/google/protobuf/empty.d.ts.map +1 -1
- package/dist/generated/google/protobuf/empty.js +20 -10
- package/dist/generated/google/protobuf/empty.js.map +1 -1
- package/dist/generated/host.d.ts.map +1 -1
- package/dist/generated/host.js +31 -21
- package/dist/generated/host.js.map +1 -1
- package/dist/generated/identities.d.ts.map +1 -1
- package/dist/generated/identities.js +142 -102
- package/dist/generated/identities.js.map +1 -1
- package/dist/generated/jobs.d.ts.map +1 -1
- package/dist/generated/jobs.js +802 -632
- package/dist/generated/jobs.js.map +1 -1
- package/dist/generated/namespaces.d.ts.map +1 -1
- package/dist/generated/namespaces.js +203 -153
- package/dist/generated/namespaces.js.map +1 -1
- package/dist/generated/observation.d.ts.map +1 -1
- package/dist/generated/observation.js +959 -749
- package/dist/generated/observation.js.map +1 -1
- package/dist/generated/observation_eventstoresubscriptions.d.ts.map +1 -1
- package/dist/generated/observation_eventstoresubscriptions.js +186 -126
- package/dist/generated/observation_eventstoresubscriptions.js.map +1 -1
- package/dist/generated/observation_reactors.d.ts.map +1 -1
- package/dist/generated/observation_reactors.js +895 -695
- package/dist/generated/observation_reactors.js.map +1 -1
- package/dist/generated/observation_reducers.d.ts.map +1 -1
- package/dist/generated/observation_reducers.js +841 -661
- package/dist/generated/observation_reducers.js.map +1 -1
- package/dist/generated/observation_webhooks.d.ts.map +1 -1
- package/dist/generated/observation_webhooks.js +541 -376
- package/dist/generated/observation_webhooks.js.map +1 -1
- package/dist/generated/projections.d.ts.map +1 -1
- package/dist/generated/projections.js +1867 -1392
- package/dist/generated/projections.js.map +1 -1
- package/dist/generated/protobuf-net/bcl.d.ts.map +1 -1
- package/dist/generated/protobuf-net/bcl.js +167 -117
- package/dist/generated/protobuf-net/bcl.js.map +1 -1
- package/dist/generated/readmodels.d.ts.map +1 -1
- package/dist/generated/readmodels.js +1705 -1345
- package/dist/generated/readmodels.js.map +1 -1
- package/dist/generated/recommendations.d.ts.map +1 -1
- package/dist/generated/recommendations.js +167 -117
- package/dist/generated/recommendations.js.map +1 -1
- package/dist/generated/security.d.ts.map +1 -1
- package/dist/generated/security.js +684 -514
- package/dist/generated/security.js.map +1 -1
- package/dist/generated/seeding.d.ts.map +1 -1
- package/dist/generated/seeding.js +247 -177
- package/dist/generated/seeding.js.map +1 -1
- package/dist/tsconfig.tsbuildinfo +1 -1
- package/generated/captures.ts +373 -265
- package/generated/clients.ts +235 -181
- package/generated/compliance.ts +161 -125
- package/generated/events.ts +372 -273
- package/generated/events_constraints.ts +240 -177
- package/generated/eventsequences.ts +1691 -1374
- package/generated/eventstores.ts +173 -137
- package/generated/externalservices.ts +495 -359
- package/generated/google/protobuf/empty.ts +20 -11
- package/generated/host.ts +32 -23
- package/generated/identities.ts +143 -107
- package/generated/jobs.ts +852 -699
- package/generated/namespaces.ts +204 -159
- package/generated/observation.ts +1012 -823
- package/generated/observation_eventstoresubscriptions.ts +187 -133
- package/generated/observation_reactors.ts +937 -756
- package/generated/observation_reducers.ts +883 -720
- package/generated/observation_webhooks.ts +547 -398
- package/generated/projections.ts +1955 -1520
- package/generated/protobuf-net/bcl.ts +168 -123
- package/generated/readmodels.ts +1801 -1476
- package/generated/recommendations.ts +168 -123
- package/generated/security.ts +684 -531
- package/generated/seeding.ts +248 -185
- package/package.json +1 -1
|
@@ -241,101 +241,111 @@ const ChildrenDefinition = {
|
|
|
241
241
|
},
|
|
242
242
|
decode(input, length) {
|
|
243
243
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
244
|
-
const
|
|
245
|
-
|
|
246
|
-
|
|
247
|
-
|
|
248
|
-
|
|
249
|
-
|
|
250
|
-
|
|
251
|
-
|
|
252
|
-
|
|
253
|
-
|
|
254
|
-
|
|
255
|
-
|
|
256
|
-
|
|
257
|
-
|
|
258
|
-
|
|
259
|
-
|
|
260
|
-
|
|
261
|
-
|
|
262
|
-
|
|
263
|
-
|
|
264
|
-
|
|
265
|
-
|
|
266
|
-
|
|
267
|
-
|
|
268
|
-
|
|
269
|
-
|
|
270
|
-
|
|
271
|
-
|
|
272
|
-
|
|
273
|
-
|
|
274
|
-
|
|
275
|
-
|
|
276
|
-
|
|
277
|
-
|
|
278
|
-
|
|
279
|
-
|
|
280
|
-
|
|
281
|
-
|
|
282
|
-
|
|
283
|
-
|
|
284
|
-
|
|
285
|
-
|
|
286
|
-
|
|
287
|
-
|
|
288
|
-
|
|
289
|
-
|
|
290
|
-
|
|
291
|
-
|
|
292
|
-
|
|
293
|
-
|
|
294
|
-
|
|
295
|
-
|
|
296
|
-
|
|
297
|
-
|
|
298
|
-
|
|
299
|
-
|
|
300
|
-
|
|
301
|
-
|
|
302
|
-
|
|
303
|
-
|
|
304
|
-
|
|
305
|
-
|
|
306
|
-
|
|
307
|
-
|
|
308
|
-
|
|
309
|
-
|
|
310
|
-
|
|
311
|
-
|
|
312
|
-
|
|
313
|
-
|
|
314
|
-
|
|
315
|
-
|
|
316
|
-
|
|
317
|
-
|
|
318
|
-
|
|
319
|
-
|
|
320
|
-
|
|
321
|
-
|
|
322
|
-
|
|
323
|
-
|
|
324
|
-
|
|
325
|
-
|
|
326
|
-
|
|
327
|
-
|
|
328
|
-
|
|
329
|
-
|
|
330
|
-
|
|
331
|
-
|
|
332
|
-
|
|
333
|
-
|
|
334
|
-
|
|
244
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
245
|
+
if (previousRecursionDepth >= 100) {
|
|
246
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
247
|
+
}
|
|
248
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
249
|
+
try {
|
|
250
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
251
|
+
const message = createBaseChildrenDefinition();
|
|
252
|
+
while (reader.pos < end) {
|
|
253
|
+
const tag = reader.uint32();
|
|
254
|
+
switch (tag >>> 3) {
|
|
255
|
+
case 1: {
|
|
256
|
+
if (tag !== 10) {
|
|
257
|
+
break;
|
|
258
|
+
}
|
|
259
|
+
message.IdentifiedBy = reader.string();
|
|
260
|
+
continue;
|
|
261
|
+
}
|
|
262
|
+
case 2: {
|
|
263
|
+
if (tag !== 18) {
|
|
264
|
+
break;
|
|
265
|
+
}
|
|
266
|
+
message.From.push(KeyValuePairEventTypeFromDefinition.decode(reader, reader.uint32()));
|
|
267
|
+
continue;
|
|
268
|
+
}
|
|
269
|
+
case 3: {
|
|
270
|
+
if (tag !== 26) {
|
|
271
|
+
break;
|
|
272
|
+
}
|
|
273
|
+
message.Join.push(KeyValuePairEventTypeJoinDefinition.decode(reader, reader.uint32()));
|
|
274
|
+
continue;
|
|
275
|
+
}
|
|
276
|
+
case 4: {
|
|
277
|
+
if (tag !== 34) {
|
|
278
|
+
break;
|
|
279
|
+
}
|
|
280
|
+
const entry4 = ChildrenDefinition_ChildrenEntry.decode(reader, reader.uint32());
|
|
281
|
+
if (entry4.value !== undefined) {
|
|
282
|
+
message.Children[entry4.key] = entry4.value;
|
|
283
|
+
}
|
|
284
|
+
continue;
|
|
285
|
+
}
|
|
286
|
+
case 5: {
|
|
287
|
+
if (tag !== 42) {
|
|
288
|
+
break;
|
|
289
|
+
}
|
|
290
|
+
message.All = FromEveryDefinition.decode(reader, reader.uint32());
|
|
291
|
+
continue;
|
|
292
|
+
}
|
|
293
|
+
case 6: {
|
|
294
|
+
if (tag !== 50) {
|
|
295
|
+
break;
|
|
296
|
+
}
|
|
297
|
+
message.FromEventProperty = FromEventPropertyDefinition.decode(reader, reader.uint32());
|
|
298
|
+
continue;
|
|
299
|
+
}
|
|
300
|
+
case 7: {
|
|
301
|
+
if (tag !== 58) {
|
|
302
|
+
break;
|
|
303
|
+
}
|
|
304
|
+
message.RemovedWith.push(KeyValuePairEventTypeRemovedWithDefinition.decode(reader, reader.uint32()));
|
|
305
|
+
continue;
|
|
306
|
+
}
|
|
307
|
+
case 8: {
|
|
308
|
+
if (tag !== 66) {
|
|
309
|
+
break;
|
|
310
|
+
}
|
|
311
|
+
message.RemovedWithJoin.push(KeyValuePairEventTypeRemovedWithJoinDefinition.decode(reader, reader.uint32()));
|
|
312
|
+
continue;
|
|
313
|
+
}
|
|
314
|
+
case 9: {
|
|
315
|
+
if (tag !== 72) {
|
|
316
|
+
break;
|
|
317
|
+
}
|
|
318
|
+
message.AutoMap = reader.int32();
|
|
319
|
+
continue;
|
|
320
|
+
}
|
|
321
|
+
case 10: {
|
|
322
|
+
if (tag !== 82) {
|
|
323
|
+
break;
|
|
324
|
+
}
|
|
325
|
+
const entry10 = ChildrenDefinition_NestedEntry.decode(reader, reader.uint32());
|
|
326
|
+
if (entry10.value !== undefined) {
|
|
327
|
+
message.Nested[entry10.key] = entry10.value;
|
|
328
|
+
}
|
|
329
|
+
continue;
|
|
330
|
+
}
|
|
331
|
+
case 11: {
|
|
332
|
+
if (tag !== 90) {
|
|
333
|
+
break;
|
|
334
|
+
}
|
|
335
|
+
message.NoAutoMapProperties.push(reader.string());
|
|
336
|
+
continue;
|
|
337
|
+
}
|
|
338
|
+
}
|
|
339
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
340
|
+
break;
|
|
341
|
+
}
|
|
342
|
+
reader.skip(tag & 7);
|
|
335
343
|
}
|
|
336
|
-
|
|
344
|
+
return message;
|
|
345
|
+
}
|
|
346
|
+
finally {
|
|
347
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
337
348
|
}
|
|
338
|
-
return message;
|
|
339
349
|
},
|
|
340
350
|
fromJSON(object) {
|
|
341
351
|
return {
|
|
@@ -348,7 +358,12 @@ const ChildrenDefinition = {
|
|
|
348
358
|
: [],
|
|
349
359
|
Children: isObject(object.Children)
|
|
350
360
|
? globalThis.Object.entries(object.Children).reduce((acc, [key, value]) => {
|
|
351
|
-
acc
|
|
361
|
+
globalThis.Object.defineProperty(acc, key, {
|
|
362
|
+
value: ChildrenDefinition.fromJSON(value),
|
|
363
|
+
enumerable: true,
|
|
364
|
+
configurable: true,
|
|
365
|
+
writable: true,
|
|
366
|
+
});
|
|
352
367
|
return acc;
|
|
353
368
|
}, {})
|
|
354
369
|
: {},
|
|
@@ -365,7 +380,12 @@ const ChildrenDefinition = {
|
|
|
365
380
|
AutoMap: isSet(object.AutoMap) ? autoMapFromJSON(object.AutoMap) : 0,
|
|
366
381
|
Nested: isObject(object.Nested)
|
|
367
382
|
? globalThis.Object.entries(object.Nested).reduce((acc, [key, value]) => {
|
|
368
|
-
acc
|
|
383
|
+
globalThis.Object.defineProperty(acc, key, {
|
|
384
|
+
value: ChildrenDefinition.fromJSON(value),
|
|
385
|
+
enumerable: true,
|
|
386
|
+
configurable: true,
|
|
387
|
+
writable: true,
|
|
388
|
+
});
|
|
369
389
|
return acc;
|
|
370
390
|
}, {})
|
|
371
391
|
: {},
|
|
@@ -473,32 +493,42 @@ const ChildrenDefinition_ChildrenEntry = {
|
|
|
473
493
|
},
|
|
474
494
|
decode(input, length) {
|
|
475
495
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
476
|
-
const
|
|
477
|
-
|
|
478
|
-
|
|
479
|
-
|
|
480
|
-
|
|
481
|
-
|
|
482
|
-
|
|
483
|
-
|
|
484
|
-
|
|
485
|
-
|
|
486
|
-
|
|
487
|
-
|
|
488
|
-
|
|
489
|
-
|
|
490
|
-
|
|
491
|
-
|
|
492
|
-
|
|
493
|
-
|
|
494
|
-
|
|
495
|
-
|
|
496
|
-
|
|
497
|
-
|
|
496
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
497
|
+
if (previousRecursionDepth >= 100) {
|
|
498
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
499
|
+
}
|
|
500
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
501
|
+
try {
|
|
502
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
503
|
+
const message = createBaseChildrenDefinition_ChildrenEntry();
|
|
504
|
+
while (reader.pos < end) {
|
|
505
|
+
const tag = reader.uint32();
|
|
506
|
+
switch (tag >>> 3) {
|
|
507
|
+
case 1: {
|
|
508
|
+
if (tag !== 10) {
|
|
509
|
+
break;
|
|
510
|
+
}
|
|
511
|
+
message.key = reader.string();
|
|
512
|
+
continue;
|
|
513
|
+
}
|
|
514
|
+
case 2: {
|
|
515
|
+
if (tag !== 18) {
|
|
516
|
+
break;
|
|
517
|
+
}
|
|
518
|
+
message.value = ChildrenDefinition.decode(reader, reader.uint32());
|
|
519
|
+
continue;
|
|
520
|
+
}
|
|
521
|
+
}
|
|
522
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
523
|
+
break;
|
|
524
|
+
}
|
|
525
|
+
reader.skip(tag & 7);
|
|
498
526
|
}
|
|
499
|
-
|
|
527
|
+
return message;
|
|
528
|
+
}
|
|
529
|
+
finally {
|
|
530
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
500
531
|
}
|
|
501
|
-
return message;
|
|
502
532
|
},
|
|
503
533
|
fromJSON(object) {
|
|
504
534
|
return {
|
|
@@ -543,32 +573,42 @@ const ChildrenDefinition_NestedEntry = {
|
|
|
543
573
|
},
|
|
544
574
|
decode(input, length) {
|
|
545
575
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
546
|
-
const
|
|
547
|
-
|
|
548
|
-
|
|
549
|
-
|
|
550
|
-
|
|
551
|
-
|
|
552
|
-
|
|
553
|
-
|
|
554
|
-
|
|
555
|
-
|
|
556
|
-
|
|
557
|
-
|
|
558
|
-
|
|
559
|
-
|
|
560
|
-
|
|
561
|
-
|
|
562
|
-
|
|
563
|
-
|
|
564
|
-
|
|
565
|
-
|
|
566
|
-
|
|
567
|
-
|
|
576
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
577
|
+
if (previousRecursionDepth >= 100) {
|
|
578
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
579
|
+
}
|
|
580
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
581
|
+
try {
|
|
582
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
583
|
+
const message = createBaseChildrenDefinition_NestedEntry();
|
|
584
|
+
while (reader.pos < end) {
|
|
585
|
+
const tag = reader.uint32();
|
|
586
|
+
switch (tag >>> 3) {
|
|
587
|
+
case 1: {
|
|
588
|
+
if (tag !== 10) {
|
|
589
|
+
break;
|
|
590
|
+
}
|
|
591
|
+
message.key = reader.string();
|
|
592
|
+
continue;
|
|
593
|
+
}
|
|
594
|
+
case 2: {
|
|
595
|
+
if (tag !== 18) {
|
|
596
|
+
break;
|
|
597
|
+
}
|
|
598
|
+
message.value = ChildrenDefinition.decode(reader, reader.uint32());
|
|
599
|
+
continue;
|
|
600
|
+
}
|
|
601
|
+
}
|
|
602
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
603
|
+
break;
|
|
604
|
+
}
|
|
605
|
+
reader.skip(tag & 7);
|
|
568
606
|
}
|
|
569
|
-
|
|
607
|
+
return message;
|
|
608
|
+
}
|
|
609
|
+
finally {
|
|
610
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
570
611
|
}
|
|
571
|
-
return message;
|
|
572
612
|
},
|
|
573
613
|
fromJSON(object) {
|
|
574
614
|
return {
|
|
@@ -619,46 +659,56 @@ const DraftReadModelDefinition = {
|
|
|
619
659
|
},
|
|
620
660
|
decode(input, length) {
|
|
621
661
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
622
|
-
const
|
|
623
|
-
|
|
624
|
-
|
|
625
|
-
|
|
626
|
-
|
|
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
|
-
|
|
662
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
663
|
+
if (previousRecursionDepth >= 100) {
|
|
664
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
665
|
+
}
|
|
666
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
667
|
+
try {
|
|
668
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
669
|
+
const message = createBaseDraftReadModelDefinition();
|
|
670
|
+
while (reader.pos < end) {
|
|
671
|
+
const tag = reader.uint32();
|
|
672
|
+
switch (tag >>> 3) {
|
|
673
|
+
case 1: {
|
|
674
|
+
if (tag !== 10) {
|
|
675
|
+
break;
|
|
676
|
+
}
|
|
677
|
+
message.ContainerName = reader.string();
|
|
678
|
+
continue;
|
|
679
|
+
}
|
|
680
|
+
case 2: {
|
|
681
|
+
if (tag !== 18) {
|
|
682
|
+
break;
|
|
683
|
+
}
|
|
684
|
+
message.Schema = reader.string();
|
|
685
|
+
continue;
|
|
686
|
+
}
|
|
687
|
+
case 3: {
|
|
688
|
+
if (tag !== 26) {
|
|
689
|
+
break;
|
|
690
|
+
}
|
|
691
|
+
message.Identifier = reader.string();
|
|
692
|
+
continue;
|
|
693
|
+
}
|
|
694
|
+
case 4: {
|
|
695
|
+
if (tag !== 34) {
|
|
696
|
+
break;
|
|
697
|
+
}
|
|
698
|
+
message.DisplayName = reader.string();
|
|
699
|
+
continue;
|
|
700
|
+
}
|
|
701
|
+
}
|
|
702
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
703
|
+
break;
|
|
704
|
+
}
|
|
705
|
+
reader.skip(tag & 7);
|
|
658
706
|
}
|
|
659
|
-
|
|
707
|
+
return message;
|
|
708
|
+
}
|
|
709
|
+
finally {
|
|
710
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
660
711
|
}
|
|
661
|
-
return message;
|
|
662
712
|
},
|
|
663
713
|
fromJSON(object) {
|
|
664
714
|
return {
|
|
@@ -714,39 +764,49 @@ const EventType = {
|
|
|
714
764
|
},
|
|
715
765
|
decode(input, length) {
|
|
716
766
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
717
|
-
const
|
|
718
|
-
|
|
719
|
-
|
|
720
|
-
|
|
721
|
-
|
|
722
|
-
|
|
723
|
-
|
|
724
|
-
|
|
725
|
-
|
|
726
|
-
|
|
727
|
-
|
|
728
|
-
|
|
729
|
-
|
|
730
|
-
|
|
731
|
-
|
|
732
|
-
|
|
733
|
-
|
|
734
|
-
|
|
735
|
-
|
|
736
|
-
|
|
737
|
-
|
|
738
|
-
|
|
739
|
-
|
|
740
|
-
|
|
741
|
-
|
|
742
|
-
|
|
767
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
768
|
+
if (previousRecursionDepth >= 100) {
|
|
769
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
770
|
+
}
|
|
771
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
772
|
+
try {
|
|
773
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
774
|
+
const message = createBaseEventType();
|
|
775
|
+
while (reader.pos < end) {
|
|
776
|
+
const tag = reader.uint32();
|
|
777
|
+
switch (tag >>> 3) {
|
|
778
|
+
case 1: {
|
|
779
|
+
if (tag !== 10) {
|
|
780
|
+
break;
|
|
781
|
+
}
|
|
782
|
+
message.Id = reader.string();
|
|
783
|
+
continue;
|
|
784
|
+
}
|
|
785
|
+
case 2: {
|
|
786
|
+
if (tag !== 16) {
|
|
787
|
+
break;
|
|
788
|
+
}
|
|
789
|
+
message.Generation = reader.uint32();
|
|
790
|
+
continue;
|
|
791
|
+
}
|
|
792
|
+
case 3: {
|
|
793
|
+
if (tag !== 24) {
|
|
794
|
+
break;
|
|
795
|
+
}
|
|
796
|
+
message.Tombstone = reader.bool();
|
|
797
|
+
continue;
|
|
798
|
+
}
|
|
799
|
+
}
|
|
800
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
801
|
+
break;
|
|
802
|
+
}
|
|
803
|
+
reader.skip(tag & 7);
|
|
743
804
|
}
|
|
744
|
-
|
|
745
|
-
|
|
746
|
-
|
|
747
|
-
reader.
|
|
805
|
+
return message;
|
|
806
|
+
}
|
|
807
|
+
finally {
|
|
808
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
748
809
|
}
|
|
749
|
-
return message;
|
|
750
810
|
},
|
|
751
811
|
fromJSON(object) {
|
|
752
812
|
return {
|
|
@@ -797,48 +857,63 @@ const FromDefinition = {
|
|
|
797
857
|
},
|
|
798
858
|
decode(input, length) {
|
|
799
859
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
800
|
-
const
|
|
801
|
-
|
|
802
|
-
|
|
803
|
-
|
|
804
|
-
|
|
805
|
-
|
|
806
|
-
|
|
807
|
-
|
|
808
|
-
|
|
809
|
-
|
|
810
|
-
|
|
811
|
-
|
|
812
|
-
|
|
813
|
-
|
|
814
|
-
|
|
815
|
-
|
|
816
|
-
|
|
817
|
-
|
|
818
|
-
|
|
819
|
-
|
|
820
|
-
|
|
821
|
-
|
|
822
|
-
|
|
823
|
-
|
|
824
|
-
|
|
825
|
-
|
|
826
|
-
|
|
827
|
-
|
|
828
|
-
|
|
860
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
861
|
+
if (previousRecursionDepth >= 100) {
|
|
862
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
863
|
+
}
|
|
864
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
865
|
+
try {
|
|
866
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
867
|
+
const message = createBaseFromDefinition();
|
|
868
|
+
while (reader.pos < end) {
|
|
869
|
+
const tag = reader.uint32();
|
|
870
|
+
switch (tag >>> 3) {
|
|
871
|
+
case 1: {
|
|
872
|
+
if (tag !== 10) {
|
|
873
|
+
break;
|
|
874
|
+
}
|
|
875
|
+
const entry1 = FromDefinition_PropertiesEntry.decode(reader, reader.uint32());
|
|
876
|
+
if (entry1.value !== undefined) {
|
|
877
|
+
message.Properties[entry1.key] = entry1.value;
|
|
878
|
+
}
|
|
879
|
+
continue;
|
|
880
|
+
}
|
|
881
|
+
case 2: {
|
|
882
|
+
if (tag !== 18) {
|
|
883
|
+
break;
|
|
884
|
+
}
|
|
885
|
+
message.Key = reader.string();
|
|
886
|
+
continue;
|
|
887
|
+
}
|
|
888
|
+
case 3: {
|
|
889
|
+
if (tag !== 26) {
|
|
890
|
+
break;
|
|
891
|
+
}
|
|
892
|
+
message.ParentKey = reader.string();
|
|
893
|
+
continue;
|
|
894
|
+
}
|
|
895
|
+
}
|
|
896
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
897
|
+
break;
|
|
898
|
+
}
|
|
899
|
+
reader.skip(tag & 7);
|
|
829
900
|
}
|
|
830
|
-
|
|
831
|
-
|
|
832
|
-
|
|
833
|
-
reader.
|
|
901
|
+
return message;
|
|
902
|
+
}
|
|
903
|
+
finally {
|
|
904
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
834
905
|
}
|
|
835
|
-
return message;
|
|
836
906
|
},
|
|
837
907
|
fromJSON(object) {
|
|
838
908
|
return {
|
|
839
909
|
Properties: isObject(object.Properties)
|
|
840
910
|
? globalThis.Object.entries(object.Properties).reduce((acc, [key, value]) => {
|
|
841
|
-
acc
|
|
911
|
+
globalThis.Object.defineProperty(acc, key, {
|
|
912
|
+
value: globalThis.String(value),
|
|
913
|
+
enumerable: true,
|
|
914
|
+
configurable: true,
|
|
915
|
+
writable: true,
|
|
916
|
+
});
|
|
842
917
|
return acc;
|
|
843
918
|
}, {})
|
|
844
919
|
: {},
|
|
@@ -896,32 +971,42 @@ const FromDefinition_PropertiesEntry = {
|
|
|
896
971
|
},
|
|
897
972
|
decode(input, length) {
|
|
898
973
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
899
|
-
const
|
|
900
|
-
|
|
901
|
-
|
|
902
|
-
|
|
903
|
-
|
|
904
|
-
|
|
905
|
-
|
|
906
|
-
|
|
907
|
-
|
|
908
|
-
|
|
909
|
-
|
|
910
|
-
|
|
911
|
-
|
|
912
|
-
|
|
913
|
-
|
|
914
|
-
|
|
915
|
-
|
|
916
|
-
|
|
917
|
-
|
|
918
|
-
|
|
919
|
-
|
|
920
|
-
|
|
974
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
975
|
+
if (previousRecursionDepth >= 100) {
|
|
976
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
977
|
+
}
|
|
978
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
979
|
+
try {
|
|
980
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
981
|
+
const message = createBaseFromDefinition_PropertiesEntry();
|
|
982
|
+
while (reader.pos < end) {
|
|
983
|
+
const tag = reader.uint32();
|
|
984
|
+
switch (tag >>> 3) {
|
|
985
|
+
case 1: {
|
|
986
|
+
if (tag !== 10) {
|
|
987
|
+
break;
|
|
988
|
+
}
|
|
989
|
+
message.key = reader.string();
|
|
990
|
+
continue;
|
|
991
|
+
}
|
|
992
|
+
case 2: {
|
|
993
|
+
if (tag !== 18) {
|
|
994
|
+
break;
|
|
995
|
+
}
|
|
996
|
+
message.value = reader.string();
|
|
997
|
+
continue;
|
|
998
|
+
}
|
|
999
|
+
}
|
|
1000
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1001
|
+
break;
|
|
1002
|
+
}
|
|
1003
|
+
reader.skip(tag & 7);
|
|
921
1004
|
}
|
|
922
|
-
|
|
1005
|
+
return message;
|
|
1006
|
+
}
|
|
1007
|
+
finally {
|
|
1008
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
923
1009
|
}
|
|
924
|
-
return message;
|
|
925
1010
|
},
|
|
926
1011
|
fromJSON(object) {
|
|
927
1012
|
return {
|
|
@@ -964,32 +1049,42 @@ const FromDerivativesDefinition = {
|
|
|
964
1049
|
},
|
|
965
1050
|
decode(input, length) {
|
|
966
1051
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
967
|
-
const
|
|
968
|
-
|
|
969
|
-
|
|
970
|
-
|
|
971
|
-
|
|
972
|
-
|
|
973
|
-
|
|
974
|
-
|
|
975
|
-
|
|
976
|
-
|
|
977
|
-
|
|
978
|
-
|
|
979
|
-
|
|
980
|
-
|
|
981
|
-
|
|
982
|
-
|
|
983
|
-
|
|
984
|
-
|
|
985
|
-
|
|
986
|
-
|
|
987
|
-
|
|
988
|
-
|
|
1052
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1053
|
+
if (previousRecursionDepth >= 100) {
|
|
1054
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1055
|
+
}
|
|
1056
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1057
|
+
try {
|
|
1058
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1059
|
+
const message = createBaseFromDerivativesDefinition();
|
|
1060
|
+
while (reader.pos < end) {
|
|
1061
|
+
const tag = reader.uint32();
|
|
1062
|
+
switch (tag >>> 3) {
|
|
1063
|
+
case 1: {
|
|
1064
|
+
if (tag !== 10) {
|
|
1065
|
+
break;
|
|
1066
|
+
}
|
|
1067
|
+
message.EventTypes.push(EventType.decode(reader, reader.uint32()));
|
|
1068
|
+
continue;
|
|
1069
|
+
}
|
|
1070
|
+
case 2: {
|
|
1071
|
+
if (tag !== 18) {
|
|
1072
|
+
break;
|
|
1073
|
+
}
|
|
1074
|
+
message.From = FromDefinition.decode(reader, reader.uint32());
|
|
1075
|
+
continue;
|
|
1076
|
+
}
|
|
1077
|
+
}
|
|
1078
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1079
|
+
break;
|
|
1080
|
+
}
|
|
1081
|
+
reader.skip(tag & 7);
|
|
989
1082
|
}
|
|
990
|
-
|
|
1083
|
+
return message;
|
|
1084
|
+
}
|
|
1085
|
+
finally {
|
|
1086
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
991
1087
|
}
|
|
992
|
-
return message;
|
|
993
1088
|
},
|
|
994
1089
|
fromJSON(object) {
|
|
995
1090
|
return {
|
|
@@ -1036,32 +1131,42 @@ const FromEventPropertyDefinition = {
|
|
|
1036
1131
|
},
|
|
1037
1132
|
decode(input, length) {
|
|
1038
1133
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1039
|
-
const
|
|
1040
|
-
|
|
1041
|
-
|
|
1042
|
-
|
|
1043
|
-
|
|
1044
|
-
|
|
1045
|
-
|
|
1046
|
-
|
|
1047
|
-
|
|
1048
|
-
|
|
1049
|
-
|
|
1050
|
-
|
|
1051
|
-
|
|
1052
|
-
|
|
1053
|
-
|
|
1054
|
-
|
|
1055
|
-
|
|
1056
|
-
|
|
1057
|
-
|
|
1058
|
-
|
|
1059
|
-
|
|
1060
|
-
|
|
1134
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1135
|
+
if (previousRecursionDepth >= 100) {
|
|
1136
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1137
|
+
}
|
|
1138
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1139
|
+
try {
|
|
1140
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1141
|
+
const message = createBaseFromEventPropertyDefinition();
|
|
1142
|
+
while (reader.pos < end) {
|
|
1143
|
+
const tag = reader.uint32();
|
|
1144
|
+
switch (tag >>> 3) {
|
|
1145
|
+
case 1: {
|
|
1146
|
+
if (tag !== 10) {
|
|
1147
|
+
break;
|
|
1148
|
+
}
|
|
1149
|
+
message.Event = EventType.decode(reader, reader.uint32());
|
|
1150
|
+
continue;
|
|
1151
|
+
}
|
|
1152
|
+
case 2: {
|
|
1153
|
+
if (tag !== 18) {
|
|
1154
|
+
break;
|
|
1155
|
+
}
|
|
1156
|
+
message.PropertyExpression = reader.string();
|
|
1157
|
+
continue;
|
|
1158
|
+
}
|
|
1159
|
+
}
|
|
1160
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1161
|
+
break;
|
|
1162
|
+
}
|
|
1163
|
+
reader.skip(tag & 7);
|
|
1061
1164
|
}
|
|
1062
|
-
|
|
1165
|
+
return message;
|
|
1166
|
+
}
|
|
1167
|
+
finally {
|
|
1168
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1063
1169
|
}
|
|
1064
|
-
return message;
|
|
1065
1170
|
},
|
|
1066
1171
|
fromJSON(object) {
|
|
1067
1172
|
return {
|
|
@@ -1109,48 +1214,63 @@ const FromEveryDefinition = {
|
|
|
1109
1214
|
},
|
|
1110
1215
|
decode(input, length) {
|
|
1111
1216
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1112
|
-
const
|
|
1113
|
-
|
|
1114
|
-
|
|
1115
|
-
|
|
1116
|
-
|
|
1117
|
-
|
|
1118
|
-
|
|
1119
|
-
|
|
1120
|
-
|
|
1121
|
-
|
|
1122
|
-
|
|
1123
|
-
|
|
1124
|
-
|
|
1125
|
-
|
|
1126
|
-
|
|
1127
|
-
|
|
1128
|
-
|
|
1129
|
-
|
|
1130
|
-
|
|
1131
|
-
|
|
1132
|
-
|
|
1133
|
-
|
|
1134
|
-
|
|
1135
|
-
|
|
1136
|
-
|
|
1137
|
-
|
|
1138
|
-
|
|
1139
|
-
|
|
1140
|
-
|
|
1141
|
-
|
|
1142
|
-
|
|
1143
|
-
|
|
1217
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1218
|
+
if (previousRecursionDepth >= 100) {
|
|
1219
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1220
|
+
}
|
|
1221
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1222
|
+
try {
|
|
1223
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1224
|
+
const message = createBaseFromEveryDefinition();
|
|
1225
|
+
while (reader.pos < end) {
|
|
1226
|
+
const tag = reader.uint32();
|
|
1227
|
+
switch (tag >>> 3) {
|
|
1228
|
+
case 1: {
|
|
1229
|
+
if (tag !== 10) {
|
|
1230
|
+
break;
|
|
1231
|
+
}
|
|
1232
|
+
const entry1 = FromEveryDefinition_PropertiesEntry.decode(reader, reader.uint32());
|
|
1233
|
+
if (entry1.value !== undefined) {
|
|
1234
|
+
message.Properties[entry1.key] = entry1.value;
|
|
1235
|
+
}
|
|
1236
|
+
continue;
|
|
1237
|
+
}
|
|
1238
|
+
case 2: {
|
|
1239
|
+
if (tag !== 16) {
|
|
1240
|
+
break;
|
|
1241
|
+
}
|
|
1242
|
+
message.IncludeChildren = reader.bool();
|
|
1243
|
+
continue;
|
|
1244
|
+
}
|
|
1245
|
+
case 3: {
|
|
1246
|
+
if (tag !== 24) {
|
|
1247
|
+
break;
|
|
1248
|
+
}
|
|
1249
|
+
message.AutoMap = reader.int32();
|
|
1250
|
+
continue;
|
|
1251
|
+
}
|
|
1252
|
+
}
|
|
1253
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1254
|
+
break;
|
|
1255
|
+
}
|
|
1256
|
+
reader.skip(tag & 7);
|
|
1144
1257
|
}
|
|
1145
|
-
|
|
1258
|
+
return message;
|
|
1259
|
+
}
|
|
1260
|
+
finally {
|
|
1261
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1146
1262
|
}
|
|
1147
|
-
return message;
|
|
1148
1263
|
},
|
|
1149
1264
|
fromJSON(object) {
|
|
1150
1265
|
return {
|
|
1151
1266
|
Properties: isObject(object.Properties)
|
|
1152
1267
|
? globalThis.Object.entries(object.Properties).reduce((acc, [key, value]) => {
|
|
1153
|
-
acc
|
|
1268
|
+
globalThis.Object.defineProperty(acc, key, {
|
|
1269
|
+
value: globalThis.String(value),
|
|
1270
|
+
enumerable: true,
|
|
1271
|
+
configurable: true,
|
|
1272
|
+
writable: true,
|
|
1273
|
+
});
|
|
1154
1274
|
return acc;
|
|
1155
1275
|
}, {})
|
|
1156
1276
|
: {},
|
|
@@ -1208,32 +1328,42 @@ const FromEveryDefinition_PropertiesEntry = {
|
|
|
1208
1328
|
},
|
|
1209
1329
|
decode(input, length) {
|
|
1210
1330
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1211
|
-
const
|
|
1212
|
-
|
|
1213
|
-
|
|
1214
|
-
|
|
1215
|
-
|
|
1216
|
-
|
|
1217
|
-
|
|
1218
|
-
|
|
1219
|
-
|
|
1220
|
-
|
|
1221
|
-
|
|
1222
|
-
|
|
1223
|
-
|
|
1224
|
-
|
|
1225
|
-
|
|
1226
|
-
|
|
1227
|
-
|
|
1228
|
-
|
|
1229
|
-
|
|
1230
|
-
|
|
1231
|
-
|
|
1232
|
-
|
|
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 = createBaseFromEveryDefinition_PropertiesEntry();
|
|
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.key = reader.string();
|
|
1347
|
+
continue;
|
|
1348
|
+
}
|
|
1349
|
+
case 2: {
|
|
1350
|
+
if (tag !== 18) {
|
|
1351
|
+
break;
|
|
1352
|
+
}
|
|
1353
|
+
message.value = reader.string();
|
|
1354
|
+
continue;
|
|
1355
|
+
}
|
|
1356
|
+
}
|
|
1357
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1358
|
+
break;
|
|
1359
|
+
}
|
|
1360
|
+
reader.skip(tag & 7);
|
|
1233
1361
|
}
|
|
1234
|
-
|
|
1362
|
+
return message;
|
|
1363
|
+
}
|
|
1364
|
+
finally {
|
|
1365
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1235
1366
|
}
|
|
1236
|
-
return message;
|
|
1237
1367
|
},
|
|
1238
1368
|
fromJSON(object) {
|
|
1239
1369
|
return {
|
|
@@ -1282,46 +1412,56 @@ const GenerateDeclarativeCodeRequest = {
|
|
|
1282
1412
|
},
|
|
1283
1413
|
decode(input, length) {
|
|
1284
1414
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1285
|
-
const
|
|
1286
|
-
|
|
1287
|
-
|
|
1288
|
-
|
|
1289
|
-
|
|
1290
|
-
|
|
1291
|
-
|
|
1292
|
-
|
|
1293
|
-
|
|
1294
|
-
|
|
1295
|
-
|
|
1296
|
-
|
|
1297
|
-
|
|
1298
|
-
|
|
1299
|
-
|
|
1300
|
-
|
|
1301
|
-
|
|
1302
|
-
|
|
1303
|
-
|
|
1304
|
-
|
|
1305
|
-
|
|
1306
|
-
|
|
1307
|
-
|
|
1308
|
-
|
|
1309
|
-
|
|
1310
|
-
|
|
1311
|
-
|
|
1312
|
-
|
|
1313
|
-
|
|
1314
|
-
|
|
1315
|
-
|
|
1316
|
-
|
|
1317
|
-
|
|
1318
|
-
|
|
1319
|
-
|
|
1320
|
-
|
|
1415
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1416
|
+
if (previousRecursionDepth >= 100) {
|
|
1417
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1418
|
+
}
|
|
1419
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1420
|
+
try {
|
|
1421
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1422
|
+
const message = createBaseGenerateDeclarativeCodeRequest();
|
|
1423
|
+
while (reader.pos < end) {
|
|
1424
|
+
const tag = reader.uint32();
|
|
1425
|
+
switch (tag >>> 3) {
|
|
1426
|
+
case 1: {
|
|
1427
|
+
if (tag !== 10) {
|
|
1428
|
+
break;
|
|
1429
|
+
}
|
|
1430
|
+
message.EventStore = reader.string();
|
|
1431
|
+
continue;
|
|
1432
|
+
}
|
|
1433
|
+
case 2: {
|
|
1434
|
+
if (tag !== 18) {
|
|
1435
|
+
break;
|
|
1436
|
+
}
|
|
1437
|
+
message.Namespace = reader.string();
|
|
1438
|
+
continue;
|
|
1439
|
+
}
|
|
1440
|
+
case 3: {
|
|
1441
|
+
if (tag !== 26) {
|
|
1442
|
+
break;
|
|
1443
|
+
}
|
|
1444
|
+
message.Declaration = reader.string();
|
|
1445
|
+
continue;
|
|
1446
|
+
}
|
|
1447
|
+
case 4: {
|
|
1448
|
+
if (tag !== 34) {
|
|
1449
|
+
break;
|
|
1450
|
+
}
|
|
1451
|
+
message.DraftReadModel = DraftReadModelDefinition.decode(reader, reader.uint32());
|
|
1452
|
+
continue;
|
|
1453
|
+
}
|
|
1454
|
+
}
|
|
1455
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1456
|
+
break;
|
|
1457
|
+
}
|
|
1458
|
+
reader.skip(tag & 7);
|
|
1321
1459
|
}
|
|
1322
|
-
|
|
1460
|
+
return message;
|
|
1461
|
+
}
|
|
1462
|
+
finally {
|
|
1463
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1323
1464
|
}
|
|
1324
|
-
return message;
|
|
1325
1465
|
},
|
|
1326
1466
|
fromJSON(object) {
|
|
1327
1467
|
return {
|
|
@@ -1384,46 +1524,56 @@ const GenerateModelBoundCodeRequest = {
|
|
|
1384
1524
|
},
|
|
1385
1525
|
decode(input, length) {
|
|
1386
1526
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1387
|
-
const
|
|
1388
|
-
|
|
1389
|
-
|
|
1390
|
-
|
|
1391
|
-
|
|
1392
|
-
|
|
1393
|
-
|
|
1394
|
-
|
|
1395
|
-
|
|
1396
|
-
|
|
1397
|
-
|
|
1398
|
-
|
|
1399
|
-
|
|
1400
|
-
|
|
1401
|
-
|
|
1402
|
-
|
|
1403
|
-
|
|
1404
|
-
|
|
1405
|
-
|
|
1406
|
-
|
|
1407
|
-
|
|
1408
|
-
|
|
1409
|
-
|
|
1410
|
-
|
|
1411
|
-
|
|
1412
|
-
|
|
1413
|
-
|
|
1414
|
-
|
|
1415
|
-
|
|
1416
|
-
|
|
1417
|
-
|
|
1418
|
-
|
|
1419
|
-
|
|
1527
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1528
|
+
if (previousRecursionDepth >= 100) {
|
|
1529
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1530
|
+
}
|
|
1531
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1532
|
+
try {
|
|
1533
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1534
|
+
const message = createBaseGenerateModelBoundCodeRequest();
|
|
1535
|
+
while (reader.pos < end) {
|
|
1536
|
+
const tag = reader.uint32();
|
|
1537
|
+
switch (tag >>> 3) {
|
|
1538
|
+
case 1: {
|
|
1539
|
+
if (tag !== 10) {
|
|
1540
|
+
break;
|
|
1541
|
+
}
|
|
1542
|
+
message.EventStore = reader.string();
|
|
1543
|
+
continue;
|
|
1544
|
+
}
|
|
1545
|
+
case 2: {
|
|
1546
|
+
if (tag !== 18) {
|
|
1547
|
+
break;
|
|
1548
|
+
}
|
|
1549
|
+
message.Namespace = reader.string();
|
|
1550
|
+
continue;
|
|
1551
|
+
}
|
|
1552
|
+
case 3: {
|
|
1553
|
+
if (tag !== 26) {
|
|
1554
|
+
break;
|
|
1555
|
+
}
|
|
1556
|
+
message.Declaration = reader.string();
|
|
1557
|
+
continue;
|
|
1558
|
+
}
|
|
1559
|
+
case 4: {
|
|
1560
|
+
if (tag !== 34) {
|
|
1561
|
+
break;
|
|
1562
|
+
}
|
|
1563
|
+
message.DraftReadModel = DraftReadModelDefinition.decode(reader, reader.uint32());
|
|
1564
|
+
continue;
|
|
1565
|
+
}
|
|
1566
|
+
}
|
|
1567
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1568
|
+
break;
|
|
1569
|
+
}
|
|
1570
|
+
reader.skip(tag & 7);
|
|
1420
1571
|
}
|
|
1421
|
-
|
|
1422
|
-
|
|
1423
|
-
|
|
1424
|
-
reader.
|
|
1572
|
+
return message;
|
|
1573
|
+
}
|
|
1574
|
+
finally {
|
|
1575
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1425
1576
|
}
|
|
1426
|
-
return message;
|
|
1427
1577
|
},
|
|
1428
1578
|
fromJSON(object) {
|
|
1429
1579
|
return {
|
|
@@ -1477,25 +1627,35 @@ const GeneratedCode = {
|
|
|
1477
1627
|
},
|
|
1478
1628
|
decode(input, length) {
|
|
1479
1629
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1480
|
-
const
|
|
1481
|
-
|
|
1482
|
-
|
|
1483
|
-
|
|
1484
|
-
|
|
1485
|
-
|
|
1486
|
-
|
|
1487
|
-
|
|
1488
|
-
|
|
1489
|
-
|
|
1490
|
-
|
|
1491
|
-
|
|
1492
|
-
|
|
1493
|
-
|
|
1494
|
-
|
|
1630
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1631
|
+
if (previousRecursionDepth >= 100) {
|
|
1632
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1633
|
+
}
|
|
1634
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1635
|
+
try {
|
|
1636
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1637
|
+
const message = createBaseGeneratedCode();
|
|
1638
|
+
while (reader.pos < end) {
|
|
1639
|
+
const tag = reader.uint32();
|
|
1640
|
+
switch (tag >>> 3) {
|
|
1641
|
+
case 1: {
|
|
1642
|
+
if (tag !== 10) {
|
|
1643
|
+
break;
|
|
1644
|
+
}
|
|
1645
|
+
message.Code = reader.string();
|
|
1646
|
+
continue;
|
|
1647
|
+
}
|
|
1648
|
+
}
|
|
1649
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1650
|
+
break;
|
|
1651
|
+
}
|
|
1652
|
+
reader.skip(tag & 7);
|
|
1495
1653
|
}
|
|
1496
|
-
|
|
1654
|
+
return message;
|
|
1655
|
+
}
|
|
1656
|
+
finally {
|
|
1657
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1497
1658
|
}
|
|
1498
|
-
return message;
|
|
1499
1659
|
},
|
|
1500
1660
|
fromJSON(object) {
|
|
1501
1661
|
return { Code: isSet(object.Code) ? globalThis.String(object.Code) : "" };
|
|
@@ -1528,25 +1688,35 @@ const GetAllDeclarationsRequest = {
|
|
|
1528
1688
|
},
|
|
1529
1689
|
decode(input, length) {
|
|
1530
1690
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1531
|
-
const
|
|
1532
|
-
|
|
1533
|
-
|
|
1534
|
-
|
|
1535
|
-
|
|
1536
|
-
|
|
1537
|
-
|
|
1538
|
-
|
|
1539
|
-
|
|
1540
|
-
|
|
1541
|
-
|
|
1542
|
-
|
|
1691
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1692
|
+
if (previousRecursionDepth >= 100) {
|
|
1693
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1694
|
+
}
|
|
1695
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1696
|
+
try {
|
|
1697
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1698
|
+
const message = createBaseGetAllDeclarationsRequest();
|
|
1699
|
+
while (reader.pos < end) {
|
|
1700
|
+
const tag = reader.uint32();
|
|
1701
|
+
switch (tag >>> 3) {
|
|
1702
|
+
case 1: {
|
|
1703
|
+
if (tag !== 10) {
|
|
1704
|
+
break;
|
|
1705
|
+
}
|
|
1706
|
+
message.EventStore = reader.string();
|
|
1707
|
+
continue;
|
|
1708
|
+
}
|
|
1709
|
+
}
|
|
1710
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1711
|
+
break;
|
|
1712
|
+
}
|
|
1713
|
+
reader.skip(tag & 7);
|
|
1543
1714
|
}
|
|
1544
|
-
|
|
1545
|
-
|
|
1546
|
-
|
|
1547
|
-
reader.
|
|
1715
|
+
return message;
|
|
1716
|
+
}
|
|
1717
|
+
finally {
|
|
1718
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1548
1719
|
}
|
|
1549
|
-
return message;
|
|
1550
1720
|
},
|
|
1551
1721
|
fromJSON(object) {
|
|
1552
1722
|
return { EventStore: isSet(object.EventStore) ? globalThis.String(object.EventStore) : "" };
|
|
@@ -1579,25 +1749,35 @@ const GetAllDefinitionsRequest = {
|
|
|
1579
1749
|
},
|
|
1580
1750
|
decode(input, length) {
|
|
1581
1751
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1582
|
-
const
|
|
1583
|
-
|
|
1584
|
-
|
|
1585
|
-
|
|
1586
|
-
|
|
1587
|
-
|
|
1588
|
-
|
|
1589
|
-
|
|
1590
|
-
|
|
1591
|
-
|
|
1592
|
-
|
|
1593
|
-
|
|
1594
|
-
|
|
1595
|
-
|
|
1596
|
-
|
|
1752
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1753
|
+
if (previousRecursionDepth >= 100) {
|
|
1754
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1755
|
+
}
|
|
1756
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1757
|
+
try {
|
|
1758
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1759
|
+
const message = createBaseGetAllDefinitionsRequest();
|
|
1760
|
+
while (reader.pos < end) {
|
|
1761
|
+
const tag = reader.uint32();
|
|
1762
|
+
switch (tag >>> 3) {
|
|
1763
|
+
case 1: {
|
|
1764
|
+
if (tag !== 10) {
|
|
1765
|
+
break;
|
|
1766
|
+
}
|
|
1767
|
+
message.EventStore = reader.string();
|
|
1768
|
+
continue;
|
|
1769
|
+
}
|
|
1770
|
+
}
|
|
1771
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1772
|
+
break;
|
|
1773
|
+
}
|
|
1774
|
+
reader.skip(tag & 7);
|
|
1597
1775
|
}
|
|
1598
|
-
|
|
1776
|
+
return message;
|
|
1777
|
+
}
|
|
1778
|
+
finally {
|
|
1779
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1599
1780
|
}
|
|
1600
|
-
return message;
|
|
1601
1781
|
},
|
|
1602
1782
|
fromJSON(object) {
|
|
1603
1783
|
return { EventStore: isSet(object.EventStore) ? globalThis.String(object.EventStore) : "" };
|
|
@@ -1630,25 +1810,35 @@ const IEnumerableProjectionDefinition = {
|
|
|
1630
1810
|
},
|
|
1631
1811
|
decode(input, length) {
|
|
1632
1812
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1633
|
-
const
|
|
1634
|
-
|
|
1635
|
-
|
|
1636
|
-
|
|
1637
|
-
|
|
1638
|
-
|
|
1639
|
-
|
|
1640
|
-
|
|
1641
|
-
|
|
1642
|
-
|
|
1643
|
-
|
|
1644
|
-
|
|
1645
|
-
|
|
1646
|
-
|
|
1647
|
-
|
|
1813
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1814
|
+
if (previousRecursionDepth >= 100) {
|
|
1815
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1816
|
+
}
|
|
1817
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1818
|
+
try {
|
|
1819
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1820
|
+
const message = createBaseIEnumerableProjectionDefinition();
|
|
1821
|
+
while (reader.pos < end) {
|
|
1822
|
+
const tag = reader.uint32();
|
|
1823
|
+
switch (tag >>> 3) {
|
|
1824
|
+
case 1: {
|
|
1825
|
+
if (tag !== 10) {
|
|
1826
|
+
break;
|
|
1827
|
+
}
|
|
1828
|
+
message.items.push(ProjectionDefinition.decode(reader, reader.uint32()));
|
|
1829
|
+
continue;
|
|
1830
|
+
}
|
|
1831
|
+
}
|
|
1832
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1833
|
+
break;
|
|
1834
|
+
}
|
|
1835
|
+
reader.skip(tag & 7);
|
|
1648
1836
|
}
|
|
1649
|
-
|
|
1837
|
+
return message;
|
|
1838
|
+
}
|
|
1839
|
+
finally {
|
|
1840
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1650
1841
|
}
|
|
1651
|
-
return message;
|
|
1652
1842
|
},
|
|
1653
1843
|
fromJSON(object) {
|
|
1654
1844
|
return {
|
|
@@ -1685,25 +1875,35 @@ const IEnumerableProjectionWithDeclaration = {
|
|
|
1685
1875
|
},
|
|
1686
1876
|
decode(input, length) {
|
|
1687
1877
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1688
|
-
const
|
|
1689
|
-
|
|
1690
|
-
|
|
1691
|
-
|
|
1692
|
-
|
|
1693
|
-
|
|
1694
|
-
|
|
1695
|
-
|
|
1696
|
-
|
|
1697
|
-
|
|
1698
|
-
|
|
1699
|
-
|
|
1878
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1879
|
+
if (previousRecursionDepth >= 100) {
|
|
1880
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1881
|
+
}
|
|
1882
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1883
|
+
try {
|
|
1884
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1885
|
+
const message = createBaseIEnumerableProjectionWithDeclaration();
|
|
1886
|
+
while (reader.pos < end) {
|
|
1887
|
+
const tag = reader.uint32();
|
|
1888
|
+
switch (tag >>> 3) {
|
|
1889
|
+
case 1: {
|
|
1890
|
+
if (tag !== 10) {
|
|
1891
|
+
break;
|
|
1892
|
+
}
|
|
1893
|
+
message.items.push(ProjectionWithDeclaration.decode(reader, reader.uint32()));
|
|
1894
|
+
continue;
|
|
1895
|
+
}
|
|
1896
|
+
}
|
|
1897
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1898
|
+
break;
|
|
1899
|
+
}
|
|
1900
|
+
reader.skip(tag & 7);
|
|
1700
1901
|
}
|
|
1701
|
-
|
|
1702
|
-
|
|
1703
|
-
|
|
1704
|
-
reader.
|
|
1902
|
+
return message;
|
|
1903
|
+
}
|
|
1904
|
+
finally {
|
|
1905
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1705
1906
|
}
|
|
1706
|
-
return message;
|
|
1707
1907
|
},
|
|
1708
1908
|
fromJSON(object) {
|
|
1709
1909
|
return {
|
|
@@ -1740,25 +1940,35 @@ const IndexDefinition = {
|
|
|
1740
1940
|
},
|
|
1741
1941
|
decode(input, length) {
|
|
1742
1942
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1743
|
-
const
|
|
1744
|
-
|
|
1745
|
-
|
|
1746
|
-
|
|
1747
|
-
|
|
1748
|
-
|
|
1749
|
-
|
|
1750
|
-
|
|
1751
|
-
|
|
1752
|
-
|
|
1753
|
-
|
|
1754
|
-
|
|
1755
|
-
|
|
1756
|
-
|
|
1757
|
-
|
|
1943
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
1944
|
+
if (previousRecursionDepth >= 100) {
|
|
1945
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
1946
|
+
}
|
|
1947
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
1948
|
+
try {
|
|
1949
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
1950
|
+
const message = createBaseIndexDefinition();
|
|
1951
|
+
while (reader.pos < end) {
|
|
1952
|
+
const tag = reader.uint32();
|
|
1953
|
+
switch (tag >>> 3) {
|
|
1954
|
+
case 1: {
|
|
1955
|
+
if (tag !== 10) {
|
|
1956
|
+
break;
|
|
1957
|
+
}
|
|
1958
|
+
message.PropertyPath = reader.string();
|
|
1959
|
+
continue;
|
|
1960
|
+
}
|
|
1961
|
+
}
|
|
1962
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
1963
|
+
break;
|
|
1964
|
+
}
|
|
1965
|
+
reader.skip(tag & 7);
|
|
1758
1966
|
}
|
|
1759
|
-
|
|
1967
|
+
return message;
|
|
1968
|
+
}
|
|
1969
|
+
finally {
|
|
1970
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1760
1971
|
}
|
|
1761
|
-
return message;
|
|
1762
1972
|
},
|
|
1763
1973
|
fromJSON(object) {
|
|
1764
1974
|
return { PropertyPath: isSet(object.PropertyPath) ? globalThis.String(object.PropertyPath) : "" };
|
|
@@ -1797,49 +2007,64 @@ const JoinDefinition = {
|
|
|
1797
2007
|
},
|
|
1798
2008
|
decode(input, length) {
|
|
1799
2009
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1800
|
-
const
|
|
1801
|
-
|
|
1802
|
-
|
|
1803
|
-
|
|
1804
|
-
|
|
1805
|
-
|
|
1806
|
-
|
|
1807
|
-
|
|
1808
|
-
|
|
1809
|
-
|
|
1810
|
-
|
|
1811
|
-
|
|
1812
|
-
|
|
1813
|
-
|
|
1814
|
-
|
|
1815
|
-
|
|
1816
|
-
|
|
1817
|
-
|
|
1818
|
-
|
|
1819
|
-
|
|
1820
|
-
|
|
1821
|
-
|
|
1822
|
-
|
|
1823
|
-
|
|
1824
|
-
|
|
1825
|
-
|
|
1826
|
-
|
|
1827
|
-
|
|
1828
|
-
|
|
1829
|
-
|
|
1830
|
-
|
|
1831
|
-
|
|
2010
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
2011
|
+
if (previousRecursionDepth >= 100) {
|
|
2012
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2013
|
+
}
|
|
2014
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2015
|
+
try {
|
|
2016
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2017
|
+
const message = createBaseJoinDefinition();
|
|
2018
|
+
while (reader.pos < end) {
|
|
2019
|
+
const tag = reader.uint32();
|
|
2020
|
+
switch (tag >>> 3) {
|
|
2021
|
+
case 1: {
|
|
2022
|
+
if (tag !== 10) {
|
|
2023
|
+
break;
|
|
2024
|
+
}
|
|
2025
|
+
message.On = reader.string();
|
|
2026
|
+
continue;
|
|
2027
|
+
}
|
|
2028
|
+
case 2: {
|
|
2029
|
+
if (tag !== 18) {
|
|
2030
|
+
break;
|
|
2031
|
+
}
|
|
2032
|
+
const entry2 = JoinDefinition_PropertiesEntry.decode(reader, reader.uint32());
|
|
2033
|
+
if (entry2.value !== undefined) {
|
|
2034
|
+
message.Properties[entry2.key] = entry2.value;
|
|
2035
|
+
}
|
|
2036
|
+
continue;
|
|
2037
|
+
}
|
|
2038
|
+
case 3: {
|
|
2039
|
+
if (tag !== 26) {
|
|
2040
|
+
break;
|
|
2041
|
+
}
|
|
2042
|
+
message.Key = reader.string();
|
|
2043
|
+
continue;
|
|
2044
|
+
}
|
|
2045
|
+
}
|
|
2046
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2047
|
+
break;
|
|
2048
|
+
}
|
|
2049
|
+
reader.skip(tag & 7);
|
|
1832
2050
|
}
|
|
1833
|
-
|
|
2051
|
+
return message;
|
|
2052
|
+
}
|
|
2053
|
+
finally {
|
|
2054
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1834
2055
|
}
|
|
1835
|
-
return message;
|
|
1836
2056
|
},
|
|
1837
2057
|
fromJSON(object) {
|
|
1838
2058
|
return {
|
|
1839
2059
|
On: isSet(object.On) ? globalThis.String(object.On) : "",
|
|
1840
2060
|
Properties: isObject(object.Properties)
|
|
1841
2061
|
? globalThis.Object.entries(object.Properties).reduce((acc, [key, value]) => {
|
|
1842
|
-
acc
|
|
2062
|
+
globalThis.Object.defineProperty(acc, key, {
|
|
2063
|
+
value: globalThis.String(value),
|
|
2064
|
+
enumerable: true,
|
|
2065
|
+
configurable: true,
|
|
2066
|
+
writable: true,
|
|
2067
|
+
});
|
|
1843
2068
|
return acc;
|
|
1844
2069
|
}, {})
|
|
1845
2070
|
: {},
|
|
@@ -1896,32 +2121,42 @@ const JoinDefinition_PropertiesEntry = {
|
|
|
1896
2121
|
},
|
|
1897
2122
|
decode(input, length) {
|
|
1898
2123
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1899
|
-
const
|
|
1900
|
-
|
|
1901
|
-
|
|
1902
|
-
|
|
1903
|
-
|
|
1904
|
-
|
|
1905
|
-
|
|
1906
|
-
|
|
1907
|
-
|
|
1908
|
-
|
|
1909
|
-
|
|
1910
|
-
|
|
1911
|
-
|
|
1912
|
-
|
|
1913
|
-
|
|
1914
|
-
|
|
1915
|
-
|
|
1916
|
-
|
|
1917
|
-
|
|
2124
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
2125
|
+
if (previousRecursionDepth >= 100) {
|
|
2126
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2127
|
+
}
|
|
2128
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2129
|
+
try {
|
|
2130
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2131
|
+
const message = createBaseJoinDefinition_PropertiesEntry();
|
|
2132
|
+
while (reader.pos < end) {
|
|
2133
|
+
const tag = reader.uint32();
|
|
2134
|
+
switch (tag >>> 3) {
|
|
2135
|
+
case 1: {
|
|
2136
|
+
if (tag !== 10) {
|
|
2137
|
+
break;
|
|
2138
|
+
}
|
|
2139
|
+
message.key = reader.string();
|
|
2140
|
+
continue;
|
|
2141
|
+
}
|
|
2142
|
+
case 2: {
|
|
2143
|
+
if (tag !== 18) {
|
|
2144
|
+
break;
|
|
2145
|
+
}
|
|
2146
|
+
message.value = reader.string();
|
|
2147
|
+
continue;
|
|
2148
|
+
}
|
|
2149
|
+
}
|
|
2150
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2151
|
+
break;
|
|
2152
|
+
}
|
|
2153
|
+
reader.skip(tag & 7);
|
|
1918
2154
|
}
|
|
1919
|
-
|
|
1920
|
-
|
|
1921
|
-
|
|
1922
|
-
reader.
|
|
2155
|
+
return message;
|
|
2156
|
+
}
|
|
2157
|
+
finally {
|
|
2158
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1923
2159
|
}
|
|
1924
|
-
return message;
|
|
1925
2160
|
},
|
|
1926
2161
|
fromJSON(object) {
|
|
1927
2162
|
return {
|
|
@@ -1964,32 +2199,42 @@ const KeyValuePairEventTypeFromDefinition = {
|
|
|
1964
2199
|
},
|
|
1965
2200
|
decode(input, length) {
|
|
1966
2201
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1967
|
-
const
|
|
1968
|
-
|
|
1969
|
-
|
|
1970
|
-
|
|
1971
|
-
|
|
1972
|
-
|
|
1973
|
-
|
|
1974
|
-
|
|
1975
|
-
|
|
1976
|
-
|
|
1977
|
-
|
|
1978
|
-
|
|
1979
|
-
|
|
1980
|
-
|
|
1981
|
-
|
|
1982
|
-
|
|
1983
|
-
|
|
1984
|
-
|
|
1985
|
-
|
|
2202
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
2203
|
+
if (previousRecursionDepth >= 100) {
|
|
2204
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2205
|
+
}
|
|
2206
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2207
|
+
try {
|
|
2208
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2209
|
+
const message = createBaseKeyValuePairEventTypeFromDefinition();
|
|
2210
|
+
while (reader.pos < end) {
|
|
2211
|
+
const tag = reader.uint32();
|
|
2212
|
+
switch (tag >>> 3) {
|
|
2213
|
+
case 1: {
|
|
2214
|
+
if (tag !== 10) {
|
|
2215
|
+
break;
|
|
2216
|
+
}
|
|
2217
|
+
message.Key = EventType.decode(reader, reader.uint32());
|
|
2218
|
+
continue;
|
|
2219
|
+
}
|
|
2220
|
+
case 2: {
|
|
2221
|
+
if (tag !== 18) {
|
|
2222
|
+
break;
|
|
2223
|
+
}
|
|
2224
|
+
message.Value = FromDefinition.decode(reader, reader.uint32());
|
|
2225
|
+
continue;
|
|
2226
|
+
}
|
|
2227
|
+
}
|
|
2228
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2229
|
+
break;
|
|
2230
|
+
}
|
|
2231
|
+
reader.skip(tag & 7);
|
|
1986
2232
|
}
|
|
1987
|
-
|
|
1988
|
-
|
|
1989
|
-
|
|
1990
|
-
reader.
|
|
2233
|
+
return message;
|
|
2234
|
+
}
|
|
2235
|
+
finally {
|
|
2236
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
1991
2237
|
}
|
|
1992
|
-
return message;
|
|
1993
2238
|
},
|
|
1994
2239
|
fromJSON(object) {
|
|
1995
2240
|
return {
|
|
@@ -2034,32 +2279,42 @@ const KeyValuePairEventTypeJoinDefinition = {
|
|
|
2034
2279
|
},
|
|
2035
2280
|
decode(input, length) {
|
|
2036
2281
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2037
|
-
const
|
|
2038
|
-
|
|
2039
|
-
|
|
2040
|
-
|
|
2041
|
-
|
|
2042
|
-
|
|
2043
|
-
|
|
2044
|
-
|
|
2045
|
-
|
|
2046
|
-
|
|
2047
|
-
|
|
2048
|
-
|
|
2049
|
-
|
|
2050
|
-
|
|
2051
|
-
|
|
2052
|
-
|
|
2053
|
-
|
|
2054
|
-
|
|
2055
|
-
|
|
2056
|
-
|
|
2057
|
-
|
|
2058
|
-
|
|
2282
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
2283
|
+
if (previousRecursionDepth >= 100) {
|
|
2284
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2285
|
+
}
|
|
2286
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2287
|
+
try {
|
|
2288
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2289
|
+
const message = createBaseKeyValuePairEventTypeJoinDefinition();
|
|
2290
|
+
while (reader.pos < end) {
|
|
2291
|
+
const tag = reader.uint32();
|
|
2292
|
+
switch (tag >>> 3) {
|
|
2293
|
+
case 1: {
|
|
2294
|
+
if (tag !== 10) {
|
|
2295
|
+
break;
|
|
2296
|
+
}
|
|
2297
|
+
message.Key = EventType.decode(reader, reader.uint32());
|
|
2298
|
+
continue;
|
|
2299
|
+
}
|
|
2300
|
+
case 2: {
|
|
2301
|
+
if (tag !== 18) {
|
|
2302
|
+
break;
|
|
2303
|
+
}
|
|
2304
|
+
message.Value = JoinDefinition.decode(reader, reader.uint32());
|
|
2305
|
+
continue;
|
|
2306
|
+
}
|
|
2307
|
+
}
|
|
2308
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2309
|
+
break;
|
|
2310
|
+
}
|
|
2311
|
+
reader.skip(tag & 7);
|
|
2059
2312
|
}
|
|
2060
|
-
|
|
2313
|
+
return message;
|
|
2314
|
+
}
|
|
2315
|
+
finally {
|
|
2316
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2061
2317
|
}
|
|
2062
|
-
return message;
|
|
2063
2318
|
},
|
|
2064
2319
|
fromJSON(object) {
|
|
2065
2320
|
return {
|
|
@@ -2104,32 +2359,42 @@ const KeyValuePairEventTypeRemovedWithDefinition = {
|
|
|
2104
2359
|
},
|
|
2105
2360
|
decode(input, length) {
|
|
2106
2361
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2107
|
-
const
|
|
2108
|
-
|
|
2109
|
-
|
|
2110
|
-
|
|
2111
|
-
|
|
2112
|
-
|
|
2113
|
-
|
|
2114
|
-
|
|
2115
|
-
|
|
2116
|
-
|
|
2117
|
-
|
|
2118
|
-
|
|
2119
|
-
|
|
2120
|
-
|
|
2121
|
-
|
|
2122
|
-
|
|
2123
|
-
|
|
2124
|
-
|
|
2125
|
-
|
|
2126
|
-
|
|
2127
|
-
|
|
2128
|
-
|
|
2362
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
2363
|
+
if (previousRecursionDepth >= 100) {
|
|
2364
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2365
|
+
}
|
|
2366
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2367
|
+
try {
|
|
2368
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2369
|
+
const message = createBaseKeyValuePairEventTypeRemovedWithDefinition();
|
|
2370
|
+
while (reader.pos < end) {
|
|
2371
|
+
const tag = reader.uint32();
|
|
2372
|
+
switch (tag >>> 3) {
|
|
2373
|
+
case 1: {
|
|
2374
|
+
if (tag !== 10) {
|
|
2375
|
+
break;
|
|
2376
|
+
}
|
|
2377
|
+
message.Key = EventType.decode(reader, reader.uint32());
|
|
2378
|
+
continue;
|
|
2379
|
+
}
|
|
2380
|
+
case 2: {
|
|
2381
|
+
if (tag !== 18) {
|
|
2382
|
+
break;
|
|
2383
|
+
}
|
|
2384
|
+
message.Value = RemovedWithDefinition.decode(reader, reader.uint32());
|
|
2385
|
+
continue;
|
|
2386
|
+
}
|
|
2387
|
+
}
|
|
2388
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2389
|
+
break;
|
|
2390
|
+
}
|
|
2391
|
+
reader.skip(tag & 7);
|
|
2129
2392
|
}
|
|
2130
|
-
|
|
2393
|
+
return message;
|
|
2394
|
+
}
|
|
2395
|
+
finally {
|
|
2396
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2131
2397
|
}
|
|
2132
|
-
return message;
|
|
2133
2398
|
},
|
|
2134
2399
|
fromJSON(object) {
|
|
2135
2400
|
return {
|
|
@@ -2174,32 +2439,42 @@ const KeyValuePairEventTypeRemovedWithJoinDefinition = {
|
|
|
2174
2439
|
},
|
|
2175
2440
|
decode(input, length) {
|
|
2176
2441
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2177
|
-
const
|
|
2178
|
-
|
|
2179
|
-
|
|
2180
|
-
|
|
2181
|
-
|
|
2182
|
-
|
|
2183
|
-
|
|
2184
|
-
|
|
2185
|
-
|
|
2186
|
-
|
|
2187
|
-
|
|
2188
|
-
|
|
2189
|
-
|
|
2190
|
-
|
|
2191
|
-
|
|
2192
|
-
|
|
2193
|
-
|
|
2194
|
-
|
|
2195
|
-
|
|
2442
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
2443
|
+
if (previousRecursionDepth >= 100) {
|
|
2444
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2445
|
+
}
|
|
2446
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2447
|
+
try {
|
|
2448
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2449
|
+
const message = createBaseKeyValuePairEventTypeRemovedWithJoinDefinition();
|
|
2450
|
+
while (reader.pos < end) {
|
|
2451
|
+
const tag = reader.uint32();
|
|
2452
|
+
switch (tag >>> 3) {
|
|
2453
|
+
case 1: {
|
|
2454
|
+
if (tag !== 10) {
|
|
2455
|
+
break;
|
|
2456
|
+
}
|
|
2457
|
+
message.Key = EventType.decode(reader, reader.uint32());
|
|
2458
|
+
continue;
|
|
2459
|
+
}
|
|
2460
|
+
case 2: {
|
|
2461
|
+
if (tag !== 18) {
|
|
2462
|
+
break;
|
|
2463
|
+
}
|
|
2464
|
+
message.Value = RemovedWithJoinDefinition.decode(reader, reader.uint32());
|
|
2465
|
+
continue;
|
|
2466
|
+
}
|
|
2467
|
+
}
|
|
2468
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2469
|
+
break;
|
|
2470
|
+
}
|
|
2471
|
+
reader.skip(tag & 7);
|
|
2196
2472
|
}
|
|
2197
|
-
|
|
2198
|
-
|
|
2199
|
-
|
|
2200
|
-
reader.
|
|
2473
|
+
return message;
|
|
2474
|
+
}
|
|
2475
|
+
finally {
|
|
2476
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2201
2477
|
}
|
|
2202
|
-
return message;
|
|
2203
2478
|
},
|
|
2204
2479
|
fromJSON(object) {
|
|
2205
2480
|
return {
|
|
@@ -2244,32 +2519,42 @@ const OneOfGeneratedCodeProjectionDeclarationParsingErrors = {
|
|
|
2244
2519
|
},
|
|
2245
2520
|
decode(input, length) {
|
|
2246
2521
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2247
|
-
const
|
|
2248
|
-
|
|
2249
|
-
|
|
2250
|
-
|
|
2251
|
-
|
|
2252
|
-
|
|
2253
|
-
|
|
2254
|
-
|
|
2255
|
-
|
|
2256
|
-
|
|
2257
|
-
|
|
2258
|
-
|
|
2259
|
-
|
|
2260
|
-
|
|
2261
|
-
|
|
2262
|
-
|
|
2263
|
-
|
|
2264
|
-
|
|
2265
|
-
|
|
2522
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
2523
|
+
if (previousRecursionDepth >= 100) {
|
|
2524
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2525
|
+
}
|
|
2526
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2527
|
+
try {
|
|
2528
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2529
|
+
const message = createBaseOneOfGeneratedCodeProjectionDeclarationParsingErrors();
|
|
2530
|
+
while (reader.pos < end) {
|
|
2531
|
+
const tag = reader.uint32();
|
|
2532
|
+
switch (tag >>> 3) {
|
|
2533
|
+
case 1: {
|
|
2534
|
+
if (tag !== 10) {
|
|
2535
|
+
break;
|
|
2536
|
+
}
|
|
2537
|
+
message.Value0 = GeneratedCode.decode(reader, reader.uint32());
|
|
2538
|
+
continue;
|
|
2539
|
+
}
|
|
2540
|
+
case 2: {
|
|
2541
|
+
if (tag !== 18) {
|
|
2542
|
+
break;
|
|
2543
|
+
}
|
|
2544
|
+
message.Value1 = ProjectionDeclarationParsingErrors.decode(reader, reader.uint32());
|
|
2545
|
+
continue;
|
|
2546
|
+
}
|
|
2547
|
+
}
|
|
2548
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2549
|
+
break;
|
|
2550
|
+
}
|
|
2551
|
+
reader.skip(tag & 7);
|
|
2266
2552
|
}
|
|
2267
|
-
|
|
2268
|
-
|
|
2269
|
-
|
|
2270
|
-
reader.
|
|
2553
|
+
return message;
|
|
2554
|
+
}
|
|
2555
|
+
finally {
|
|
2556
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2271
2557
|
}
|
|
2272
|
-
return message;
|
|
2273
2558
|
},
|
|
2274
2559
|
fromJSON(object) {
|
|
2275
2560
|
return {
|
|
@@ -2316,32 +2601,42 @@ const OneOfProjectionPreviewProjectionDeclarationParsingErrors = {
|
|
|
2316
2601
|
},
|
|
2317
2602
|
decode(input, length) {
|
|
2318
2603
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2319
|
-
const
|
|
2320
|
-
|
|
2321
|
-
|
|
2322
|
-
|
|
2323
|
-
|
|
2324
|
-
|
|
2325
|
-
|
|
2326
|
-
|
|
2327
|
-
|
|
2328
|
-
|
|
2329
|
-
|
|
2330
|
-
|
|
2331
|
-
|
|
2332
|
-
|
|
2333
|
-
|
|
2334
|
-
|
|
2335
|
-
|
|
2336
|
-
|
|
2337
|
-
|
|
2338
|
-
|
|
2339
|
-
|
|
2340
|
-
|
|
2604
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
2605
|
+
if (previousRecursionDepth >= 100) {
|
|
2606
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2607
|
+
}
|
|
2608
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2609
|
+
try {
|
|
2610
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2611
|
+
const message = createBaseOneOfProjectionPreviewProjectionDeclarationParsingErrors();
|
|
2612
|
+
while (reader.pos < end) {
|
|
2613
|
+
const tag = reader.uint32();
|
|
2614
|
+
switch (tag >>> 3) {
|
|
2615
|
+
case 1: {
|
|
2616
|
+
if (tag !== 10) {
|
|
2617
|
+
break;
|
|
2618
|
+
}
|
|
2619
|
+
message.Value0 = ProjectionPreview.decode(reader, reader.uint32());
|
|
2620
|
+
continue;
|
|
2621
|
+
}
|
|
2622
|
+
case 2: {
|
|
2623
|
+
if (tag !== 18) {
|
|
2624
|
+
break;
|
|
2625
|
+
}
|
|
2626
|
+
message.Value1 = ProjectionDeclarationParsingErrors.decode(reader, reader.uint32());
|
|
2627
|
+
continue;
|
|
2628
|
+
}
|
|
2629
|
+
}
|
|
2630
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2631
|
+
break;
|
|
2632
|
+
}
|
|
2633
|
+
reader.skip(tag & 7);
|
|
2341
2634
|
}
|
|
2342
|
-
|
|
2635
|
+
return message;
|
|
2636
|
+
}
|
|
2637
|
+
finally {
|
|
2638
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2343
2639
|
}
|
|
2344
|
-
return message;
|
|
2345
2640
|
},
|
|
2346
2641
|
fromJSON(object) {
|
|
2347
2642
|
return {
|
|
@@ -2397,53 +2692,63 @@ const PreviewProjectionRequest = {
|
|
|
2397
2692
|
},
|
|
2398
2693
|
decode(input, length) {
|
|
2399
2694
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2400
|
-
const
|
|
2401
|
-
|
|
2402
|
-
|
|
2403
|
-
|
|
2404
|
-
|
|
2405
|
-
|
|
2406
|
-
|
|
2407
|
-
|
|
2408
|
-
|
|
2409
|
-
|
|
2410
|
-
|
|
2411
|
-
|
|
2412
|
-
|
|
2413
|
-
|
|
2414
|
-
|
|
2415
|
-
|
|
2416
|
-
|
|
2417
|
-
|
|
2418
|
-
|
|
2419
|
-
|
|
2420
|
-
|
|
2421
|
-
|
|
2422
|
-
|
|
2423
|
-
|
|
2424
|
-
|
|
2425
|
-
|
|
2426
|
-
|
|
2427
|
-
|
|
2428
|
-
|
|
2429
|
-
|
|
2430
|
-
|
|
2431
|
-
|
|
2432
|
-
|
|
2433
|
-
|
|
2434
|
-
|
|
2435
|
-
|
|
2436
|
-
|
|
2437
|
-
|
|
2438
|
-
|
|
2439
|
-
|
|
2695
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
2696
|
+
if (previousRecursionDepth >= 100) {
|
|
2697
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2698
|
+
}
|
|
2699
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2700
|
+
try {
|
|
2701
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2702
|
+
const message = createBasePreviewProjectionRequest();
|
|
2703
|
+
while (reader.pos < end) {
|
|
2704
|
+
const tag = reader.uint32();
|
|
2705
|
+
switch (tag >>> 3) {
|
|
2706
|
+
case 1: {
|
|
2707
|
+
if (tag !== 10) {
|
|
2708
|
+
break;
|
|
2709
|
+
}
|
|
2710
|
+
message.EventStore = reader.string();
|
|
2711
|
+
continue;
|
|
2712
|
+
}
|
|
2713
|
+
case 2: {
|
|
2714
|
+
if (tag !== 18) {
|
|
2715
|
+
break;
|
|
2716
|
+
}
|
|
2717
|
+
message.Namespace = reader.string();
|
|
2718
|
+
continue;
|
|
2719
|
+
}
|
|
2720
|
+
case 3: {
|
|
2721
|
+
if (tag !== 26) {
|
|
2722
|
+
break;
|
|
2723
|
+
}
|
|
2724
|
+
message.EventSequenceId = reader.string();
|
|
2725
|
+
continue;
|
|
2726
|
+
}
|
|
2727
|
+
case 4: {
|
|
2728
|
+
if (tag !== 34) {
|
|
2729
|
+
break;
|
|
2730
|
+
}
|
|
2731
|
+
message.Declaration = reader.string();
|
|
2732
|
+
continue;
|
|
2733
|
+
}
|
|
2734
|
+
case 5: {
|
|
2735
|
+
if (tag !== 42) {
|
|
2736
|
+
break;
|
|
2737
|
+
}
|
|
2738
|
+
message.DraftReadModel = DraftReadModelDefinition.decode(reader, reader.uint32());
|
|
2739
|
+
continue;
|
|
2740
|
+
}
|
|
2741
|
+
}
|
|
2742
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2743
|
+
break;
|
|
2744
|
+
}
|
|
2745
|
+
reader.skip(tag & 7);
|
|
2440
2746
|
}
|
|
2441
|
-
|
|
2442
|
-
|
|
2443
|
-
|
|
2444
|
-
reader.
|
|
2747
|
+
return message;
|
|
2748
|
+
}
|
|
2749
|
+
finally {
|
|
2750
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2445
2751
|
}
|
|
2446
|
-
return message;
|
|
2447
2752
|
},
|
|
2448
2753
|
fromJSON(object) {
|
|
2449
2754
|
return {
|
|
@@ -2502,25 +2807,35 @@ const ProjectionDeclarationParsingErrors = {
|
|
|
2502
2807
|
},
|
|
2503
2808
|
decode(input, length) {
|
|
2504
2809
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2505
|
-
const
|
|
2506
|
-
|
|
2507
|
-
|
|
2508
|
-
|
|
2509
|
-
|
|
2510
|
-
|
|
2511
|
-
|
|
2512
|
-
|
|
2513
|
-
|
|
2514
|
-
|
|
2515
|
-
|
|
2516
|
-
|
|
2810
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
2811
|
+
if (previousRecursionDepth >= 100) {
|
|
2812
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2813
|
+
}
|
|
2814
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2815
|
+
try {
|
|
2816
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2817
|
+
const message = createBaseProjectionDeclarationParsingErrors();
|
|
2818
|
+
while (reader.pos < end) {
|
|
2819
|
+
const tag = reader.uint32();
|
|
2820
|
+
switch (tag >>> 3) {
|
|
2821
|
+
case 1: {
|
|
2822
|
+
if (tag !== 10) {
|
|
2823
|
+
break;
|
|
2824
|
+
}
|
|
2825
|
+
message.Errors.push(ProjectionDeclarationSyntaxError.decode(reader, reader.uint32()));
|
|
2826
|
+
continue;
|
|
2827
|
+
}
|
|
2828
|
+
}
|
|
2829
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2830
|
+
break;
|
|
2831
|
+
}
|
|
2832
|
+
reader.skip(tag & 7);
|
|
2517
2833
|
}
|
|
2518
|
-
|
|
2519
|
-
|
|
2520
|
-
|
|
2521
|
-
reader.
|
|
2834
|
+
return message;
|
|
2835
|
+
}
|
|
2836
|
+
finally {
|
|
2837
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2522
2838
|
}
|
|
2523
|
-
return message;
|
|
2524
2839
|
},
|
|
2525
2840
|
fromJSON(object) {
|
|
2526
2841
|
return {
|
|
@@ -2563,39 +2878,49 @@ const ProjectionDeclarationSyntaxError = {
|
|
|
2563
2878
|
},
|
|
2564
2879
|
decode(input, length) {
|
|
2565
2880
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2566
|
-
const
|
|
2567
|
-
|
|
2568
|
-
|
|
2569
|
-
|
|
2570
|
-
|
|
2571
|
-
|
|
2572
|
-
|
|
2573
|
-
|
|
2574
|
-
|
|
2575
|
-
|
|
2576
|
-
|
|
2577
|
-
|
|
2578
|
-
|
|
2579
|
-
|
|
2580
|
-
|
|
2581
|
-
|
|
2582
|
-
|
|
2583
|
-
|
|
2584
|
-
|
|
2585
|
-
|
|
2586
|
-
|
|
2587
|
-
|
|
2588
|
-
|
|
2589
|
-
|
|
2590
|
-
|
|
2591
|
-
|
|
2881
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
2882
|
+
if (previousRecursionDepth >= 100) {
|
|
2883
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
2884
|
+
}
|
|
2885
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
2886
|
+
try {
|
|
2887
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
2888
|
+
const message = createBaseProjectionDeclarationSyntaxError();
|
|
2889
|
+
while (reader.pos < end) {
|
|
2890
|
+
const tag = reader.uint32();
|
|
2891
|
+
switch (tag >>> 3) {
|
|
2892
|
+
case 1: {
|
|
2893
|
+
if (tag !== 10) {
|
|
2894
|
+
break;
|
|
2895
|
+
}
|
|
2896
|
+
message.Message = reader.string();
|
|
2897
|
+
continue;
|
|
2898
|
+
}
|
|
2899
|
+
case 2: {
|
|
2900
|
+
if (tag !== 16) {
|
|
2901
|
+
break;
|
|
2902
|
+
}
|
|
2903
|
+
message.Line = reader.int32();
|
|
2904
|
+
continue;
|
|
2905
|
+
}
|
|
2906
|
+
case 3: {
|
|
2907
|
+
if (tag !== 24) {
|
|
2908
|
+
break;
|
|
2909
|
+
}
|
|
2910
|
+
message.Column = reader.int32();
|
|
2911
|
+
continue;
|
|
2912
|
+
}
|
|
2913
|
+
}
|
|
2914
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
2915
|
+
break;
|
|
2916
|
+
}
|
|
2917
|
+
reader.skip(tag & 7);
|
|
2592
2918
|
}
|
|
2593
|
-
|
|
2594
|
-
|
|
2595
|
-
|
|
2596
|
-
reader.
|
|
2919
|
+
return message;
|
|
2920
|
+
}
|
|
2921
|
+
finally {
|
|
2922
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2597
2923
|
}
|
|
2598
|
-
return message;
|
|
2599
2924
|
},
|
|
2600
2925
|
fromJSON(object) {
|
|
2601
2926
|
return {
|
|
@@ -2718,164 +3043,174 @@ const ProjectionDefinition = {
|
|
|
2718
3043
|
},
|
|
2719
3044
|
decode(input, length) {
|
|
2720
3045
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
2721
|
-
const
|
|
2722
|
-
|
|
2723
|
-
|
|
2724
|
-
|
|
2725
|
-
|
|
2726
|
-
|
|
2727
|
-
|
|
2728
|
-
|
|
2729
|
-
|
|
2730
|
-
|
|
2731
|
-
|
|
2732
|
-
|
|
2733
|
-
|
|
2734
|
-
|
|
2735
|
-
|
|
2736
|
-
|
|
2737
|
-
|
|
2738
|
-
|
|
2739
|
-
|
|
2740
|
-
|
|
2741
|
-
|
|
2742
|
-
|
|
2743
|
-
|
|
2744
|
-
|
|
2745
|
-
|
|
2746
|
-
|
|
2747
|
-
|
|
2748
|
-
|
|
2749
|
-
|
|
2750
|
-
|
|
2751
|
-
|
|
2752
|
-
|
|
2753
|
-
|
|
2754
|
-
|
|
2755
|
-
|
|
2756
|
-
|
|
2757
|
-
|
|
2758
|
-
|
|
2759
|
-
|
|
2760
|
-
|
|
2761
|
-
|
|
2762
|
-
|
|
2763
|
-
|
|
2764
|
-
|
|
2765
|
-
|
|
2766
|
-
|
|
2767
|
-
|
|
2768
|
-
|
|
2769
|
-
|
|
2770
|
-
|
|
2771
|
-
|
|
2772
|
-
|
|
2773
|
-
|
|
2774
|
-
|
|
2775
|
-
|
|
2776
|
-
|
|
2777
|
-
|
|
2778
|
-
|
|
2779
|
-
|
|
2780
|
-
|
|
2781
|
-
|
|
2782
|
-
|
|
2783
|
-
|
|
2784
|
-
|
|
2785
|
-
|
|
2786
|
-
|
|
2787
|
-
|
|
2788
|
-
|
|
2789
|
-
|
|
2790
|
-
|
|
2791
|
-
|
|
2792
|
-
|
|
2793
|
-
|
|
2794
|
-
|
|
2795
|
-
|
|
2796
|
-
|
|
2797
|
-
|
|
2798
|
-
|
|
2799
|
-
|
|
2800
|
-
|
|
2801
|
-
|
|
2802
|
-
|
|
2803
|
-
|
|
2804
|
-
|
|
2805
|
-
|
|
2806
|
-
|
|
2807
|
-
|
|
2808
|
-
|
|
2809
|
-
|
|
2810
|
-
|
|
2811
|
-
|
|
2812
|
-
|
|
2813
|
-
|
|
2814
|
-
|
|
2815
|
-
|
|
2816
|
-
|
|
2817
|
-
|
|
2818
|
-
|
|
2819
|
-
|
|
2820
|
-
|
|
2821
|
-
|
|
2822
|
-
|
|
2823
|
-
|
|
2824
|
-
|
|
2825
|
-
|
|
2826
|
-
|
|
2827
|
-
|
|
2828
|
-
|
|
2829
|
-
|
|
2830
|
-
|
|
2831
|
-
|
|
2832
|
-
|
|
2833
|
-
|
|
2834
|
-
|
|
2835
|
-
|
|
2836
|
-
|
|
2837
|
-
|
|
2838
|
-
|
|
2839
|
-
|
|
2840
|
-
|
|
2841
|
-
|
|
2842
|
-
|
|
2843
|
-
|
|
2844
|
-
|
|
2845
|
-
|
|
2846
|
-
|
|
2847
|
-
|
|
2848
|
-
|
|
2849
|
-
|
|
2850
|
-
|
|
2851
|
-
|
|
2852
|
-
|
|
2853
|
-
|
|
2854
|
-
|
|
2855
|
-
|
|
2856
|
-
|
|
2857
|
-
|
|
2858
|
-
|
|
2859
|
-
|
|
2860
|
-
|
|
2861
|
-
|
|
2862
|
-
|
|
2863
|
-
|
|
2864
|
-
|
|
2865
|
-
|
|
2866
|
-
|
|
2867
|
-
|
|
2868
|
-
|
|
2869
|
-
|
|
2870
|
-
|
|
2871
|
-
|
|
2872
|
-
|
|
2873
|
-
|
|
2874
|
-
|
|
3046
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
3047
|
+
if (previousRecursionDepth >= 100) {
|
|
3048
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
3049
|
+
}
|
|
3050
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
3051
|
+
try {
|
|
3052
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
3053
|
+
const message = createBaseProjectionDefinition();
|
|
3054
|
+
while (reader.pos < end) {
|
|
3055
|
+
const tag = reader.uint32();
|
|
3056
|
+
switch (tag >>> 3) {
|
|
3057
|
+
case 1: {
|
|
3058
|
+
if (tag !== 10) {
|
|
3059
|
+
break;
|
|
3060
|
+
}
|
|
3061
|
+
message.EventSequenceId = reader.string();
|
|
3062
|
+
continue;
|
|
3063
|
+
}
|
|
3064
|
+
case 2: {
|
|
3065
|
+
if (tag !== 18) {
|
|
3066
|
+
break;
|
|
3067
|
+
}
|
|
3068
|
+
message.Identifier = reader.string();
|
|
3069
|
+
continue;
|
|
3070
|
+
}
|
|
3071
|
+
case 3: {
|
|
3072
|
+
if (tag !== 26) {
|
|
3073
|
+
break;
|
|
3074
|
+
}
|
|
3075
|
+
message.ReadModel = reader.string();
|
|
3076
|
+
continue;
|
|
3077
|
+
}
|
|
3078
|
+
case 4: {
|
|
3079
|
+
if (tag !== 32) {
|
|
3080
|
+
break;
|
|
3081
|
+
}
|
|
3082
|
+
message.IsActive = reader.bool();
|
|
3083
|
+
continue;
|
|
3084
|
+
}
|
|
3085
|
+
case 5: {
|
|
3086
|
+
if (tag !== 40) {
|
|
3087
|
+
break;
|
|
3088
|
+
}
|
|
3089
|
+
message.IsRewindable = reader.bool();
|
|
3090
|
+
continue;
|
|
3091
|
+
}
|
|
3092
|
+
case 6: {
|
|
3093
|
+
if (tag !== 50) {
|
|
3094
|
+
break;
|
|
3095
|
+
}
|
|
3096
|
+
message.InitialModelState = reader.string();
|
|
3097
|
+
continue;
|
|
3098
|
+
}
|
|
3099
|
+
case 7: {
|
|
3100
|
+
if (tag !== 58) {
|
|
3101
|
+
break;
|
|
3102
|
+
}
|
|
3103
|
+
message.From.push(KeyValuePairEventTypeFromDefinition.decode(reader, reader.uint32()));
|
|
3104
|
+
continue;
|
|
3105
|
+
}
|
|
3106
|
+
case 8: {
|
|
3107
|
+
if (tag !== 66) {
|
|
3108
|
+
break;
|
|
3109
|
+
}
|
|
3110
|
+
message.Join.push(KeyValuePairEventTypeJoinDefinition.decode(reader, reader.uint32()));
|
|
3111
|
+
continue;
|
|
3112
|
+
}
|
|
3113
|
+
case 9: {
|
|
3114
|
+
if (tag !== 74) {
|
|
3115
|
+
break;
|
|
3116
|
+
}
|
|
3117
|
+
const entry9 = ProjectionDefinition_ChildrenEntry.decode(reader, reader.uint32());
|
|
3118
|
+
if (entry9.value !== undefined) {
|
|
3119
|
+
message.Children[entry9.key] = entry9.value;
|
|
3120
|
+
}
|
|
3121
|
+
continue;
|
|
3122
|
+
}
|
|
3123
|
+
case 10: {
|
|
3124
|
+
if (tag !== 82) {
|
|
3125
|
+
break;
|
|
3126
|
+
}
|
|
3127
|
+
message.FromEvery.push(FromDerivativesDefinition.decode(reader, reader.uint32()));
|
|
3128
|
+
continue;
|
|
3129
|
+
}
|
|
3130
|
+
case 11: {
|
|
3131
|
+
if (tag !== 90) {
|
|
3132
|
+
break;
|
|
3133
|
+
}
|
|
3134
|
+
message.All = FromEveryDefinition.decode(reader, reader.uint32());
|
|
3135
|
+
continue;
|
|
3136
|
+
}
|
|
3137
|
+
case 12: {
|
|
3138
|
+
if (tag !== 98) {
|
|
3139
|
+
break;
|
|
3140
|
+
}
|
|
3141
|
+
message.FromEventProperty = FromEventPropertyDefinition.decode(reader, reader.uint32());
|
|
3142
|
+
continue;
|
|
3143
|
+
}
|
|
3144
|
+
case 13: {
|
|
3145
|
+
if (tag !== 106) {
|
|
3146
|
+
break;
|
|
3147
|
+
}
|
|
3148
|
+
message.RemovedWith.push(KeyValuePairEventTypeRemovedWithDefinition.decode(reader, reader.uint32()));
|
|
3149
|
+
continue;
|
|
3150
|
+
}
|
|
3151
|
+
case 14: {
|
|
3152
|
+
if (tag !== 114) {
|
|
3153
|
+
break;
|
|
3154
|
+
}
|
|
3155
|
+
message.RemovedWithJoin.push(KeyValuePairEventTypeRemovedWithJoinDefinition.decode(reader, reader.uint32()));
|
|
3156
|
+
continue;
|
|
3157
|
+
}
|
|
3158
|
+
case 15: {
|
|
3159
|
+
if (tag !== 122) {
|
|
3160
|
+
break;
|
|
3161
|
+
}
|
|
3162
|
+
message.LastUpdated = SerializableDateTimeOffset.decode(reader, reader.uint32());
|
|
3163
|
+
continue;
|
|
3164
|
+
}
|
|
3165
|
+
case 16: {
|
|
3166
|
+
if (tag !== 130) {
|
|
3167
|
+
break;
|
|
3168
|
+
}
|
|
3169
|
+
message.Tags.push(reader.string());
|
|
3170
|
+
continue;
|
|
3171
|
+
}
|
|
3172
|
+
case 17: {
|
|
3173
|
+
if (tag !== 136) {
|
|
3174
|
+
break;
|
|
3175
|
+
}
|
|
3176
|
+
message.AutoMap = reader.int32();
|
|
3177
|
+
continue;
|
|
3178
|
+
}
|
|
3179
|
+
case 18: {
|
|
3180
|
+
if (tag !== 146) {
|
|
3181
|
+
break;
|
|
3182
|
+
}
|
|
3183
|
+
const entry18 = ProjectionDefinition_NestedEntry.decode(reader, reader.uint32());
|
|
3184
|
+
if (entry18.value !== undefined) {
|
|
3185
|
+
message.Nested[entry18.key] = entry18.value;
|
|
3186
|
+
}
|
|
3187
|
+
continue;
|
|
3188
|
+
}
|
|
3189
|
+
case 19: {
|
|
3190
|
+
if (tag !== 152) {
|
|
3191
|
+
break;
|
|
3192
|
+
}
|
|
3193
|
+
message.SubscribesToAllEvents = reader.bool();
|
|
3194
|
+
continue;
|
|
3195
|
+
}
|
|
3196
|
+
case 20: {
|
|
3197
|
+
if (tag !== 162) {
|
|
3198
|
+
break;
|
|
3199
|
+
}
|
|
3200
|
+
message.NoAutoMapProperties.push(reader.string());
|
|
3201
|
+
continue;
|
|
3202
|
+
}
|
|
3203
|
+
}
|
|
3204
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
3205
|
+
break;
|
|
3206
|
+
}
|
|
3207
|
+
reader.skip(tag & 7);
|
|
2875
3208
|
}
|
|
2876
|
-
|
|
3209
|
+
return message;
|
|
3210
|
+
}
|
|
3211
|
+
finally {
|
|
3212
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
2877
3213
|
}
|
|
2878
|
-
return message;
|
|
2879
3214
|
},
|
|
2880
3215
|
fromJSON(object) {
|
|
2881
3216
|
return {
|
|
@@ -2893,7 +3228,12 @@ const ProjectionDefinition = {
|
|
|
2893
3228
|
: [],
|
|
2894
3229
|
Children: isObject(object.Children)
|
|
2895
3230
|
? globalThis.Object.entries(object.Children).reduce((acc, [key, value]) => {
|
|
2896
|
-
acc
|
|
3231
|
+
globalThis.Object.defineProperty(acc, key, {
|
|
3232
|
+
value: ChildrenDefinition.fromJSON(value),
|
|
3233
|
+
enumerable: true,
|
|
3234
|
+
configurable: true,
|
|
3235
|
+
writable: true,
|
|
3236
|
+
});
|
|
2897
3237
|
return acc;
|
|
2898
3238
|
}, {})
|
|
2899
3239
|
: {},
|
|
@@ -2915,7 +3255,12 @@ const ProjectionDefinition = {
|
|
|
2915
3255
|
AutoMap: isSet(object.AutoMap) ? autoMapFromJSON(object.AutoMap) : 0,
|
|
2916
3256
|
Nested: isObject(object.Nested)
|
|
2917
3257
|
? globalThis.Object.entries(object.Nested).reduce((acc, [key, value]) => {
|
|
2918
|
-
acc
|
|
3258
|
+
globalThis.Object.defineProperty(acc, key, {
|
|
3259
|
+
value: ChildrenDefinition.fromJSON(value),
|
|
3260
|
+
enumerable: true,
|
|
3261
|
+
configurable: true,
|
|
3262
|
+
writable: true,
|
|
3263
|
+
});
|
|
2919
3264
|
return acc;
|
|
2920
3265
|
}, {})
|
|
2921
3266
|
: {},
|
|
@@ -3064,32 +3409,42 @@ const ProjectionDefinition_ChildrenEntry = {
|
|
|
3064
3409
|
},
|
|
3065
3410
|
decode(input, length) {
|
|
3066
3411
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
3067
|
-
const
|
|
3068
|
-
|
|
3069
|
-
|
|
3070
|
-
|
|
3071
|
-
|
|
3072
|
-
|
|
3073
|
-
|
|
3074
|
-
|
|
3075
|
-
|
|
3076
|
-
|
|
3077
|
-
|
|
3078
|
-
|
|
3079
|
-
|
|
3080
|
-
|
|
3081
|
-
|
|
3082
|
-
|
|
3083
|
-
|
|
3084
|
-
|
|
3085
|
-
|
|
3086
|
-
|
|
3087
|
-
|
|
3088
|
-
|
|
3412
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
3413
|
+
if (previousRecursionDepth >= 100) {
|
|
3414
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
3415
|
+
}
|
|
3416
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
3417
|
+
try {
|
|
3418
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
3419
|
+
const message = createBaseProjectionDefinition_ChildrenEntry();
|
|
3420
|
+
while (reader.pos < end) {
|
|
3421
|
+
const tag = reader.uint32();
|
|
3422
|
+
switch (tag >>> 3) {
|
|
3423
|
+
case 1: {
|
|
3424
|
+
if (tag !== 10) {
|
|
3425
|
+
break;
|
|
3426
|
+
}
|
|
3427
|
+
message.key = reader.string();
|
|
3428
|
+
continue;
|
|
3429
|
+
}
|
|
3430
|
+
case 2: {
|
|
3431
|
+
if (tag !== 18) {
|
|
3432
|
+
break;
|
|
3433
|
+
}
|
|
3434
|
+
message.value = ChildrenDefinition.decode(reader, reader.uint32());
|
|
3435
|
+
continue;
|
|
3436
|
+
}
|
|
3437
|
+
}
|
|
3438
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
3439
|
+
break;
|
|
3440
|
+
}
|
|
3441
|
+
reader.skip(tag & 7);
|
|
3089
3442
|
}
|
|
3090
|
-
|
|
3443
|
+
return message;
|
|
3444
|
+
}
|
|
3445
|
+
finally {
|
|
3446
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
3091
3447
|
}
|
|
3092
|
-
return message;
|
|
3093
3448
|
},
|
|
3094
3449
|
fromJSON(object) {
|
|
3095
3450
|
return {
|
|
@@ -3134,32 +3489,42 @@ const ProjectionDefinition_NestedEntry = {
|
|
|
3134
3489
|
},
|
|
3135
3490
|
decode(input, length) {
|
|
3136
3491
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
3137
|
-
const
|
|
3138
|
-
|
|
3139
|
-
|
|
3140
|
-
|
|
3141
|
-
|
|
3142
|
-
|
|
3143
|
-
|
|
3144
|
-
|
|
3145
|
-
|
|
3146
|
-
|
|
3147
|
-
|
|
3148
|
-
|
|
3149
|
-
|
|
3150
|
-
|
|
3151
|
-
|
|
3152
|
-
|
|
3153
|
-
|
|
3154
|
-
|
|
3155
|
-
|
|
3492
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
3493
|
+
if (previousRecursionDepth >= 100) {
|
|
3494
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
3495
|
+
}
|
|
3496
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
3497
|
+
try {
|
|
3498
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
3499
|
+
const message = createBaseProjectionDefinition_NestedEntry();
|
|
3500
|
+
while (reader.pos < end) {
|
|
3501
|
+
const tag = reader.uint32();
|
|
3502
|
+
switch (tag >>> 3) {
|
|
3503
|
+
case 1: {
|
|
3504
|
+
if (tag !== 10) {
|
|
3505
|
+
break;
|
|
3506
|
+
}
|
|
3507
|
+
message.key = reader.string();
|
|
3508
|
+
continue;
|
|
3509
|
+
}
|
|
3510
|
+
case 2: {
|
|
3511
|
+
if (tag !== 18) {
|
|
3512
|
+
break;
|
|
3513
|
+
}
|
|
3514
|
+
message.value = ChildrenDefinition.decode(reader, reader.uint32());
|
|
3515
|
+
continue;
|
|
3516
|
+
}
|
|
3517
|
+
}
|
|
3518
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
3519
|
+
break;
|
|
3520
|
+
}
|
|
3521
|
+
reader.skip(tag & 7);
|
|
3156
3522
|
}
|
|
3157
|
-
|
|
3158
|
-
|
|
3159
|
-
|
|
3160
|
-
reader.
|
|
3523
|
+
return message;
|
|
3524
|
+
}
|
|
3525
|
+
finally {
|
|
3526
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
3161
3527
|
}
|
|
3162
|
-
return message;
|
|
3163
3528
|
},
|
|
3164
3529
|
fromJSON(object) {
|
|
3165
3530
|
return {
|
|
@@ -3204,32 +3569,42 @@ const ProjectionPreview = {
|
|
|
3204
3569
|
},
|
|
3205
3570
|
decode(input, length) {
|
|
3206
3571
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
3207
|
-
const
|
|
3208
|
-
|
|
3209
|
-
|
|
3210
|
-
|
|
3211
|
-
|
|
3212
|
-
|
|
3213
|
-
|
|
3214
|
-
|
|
3215
|
-
|
|
3216
|
-
|
|
3217
|
-
|
|
3218
|
-
|
|
3219
|
-
|
|
3220
|
-
|
|
3221
|
-
|
|
3222
|
-
|
|
3223
|
-
|
|
3224
|
-
|
|
3225
|
-
|
|
3572
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
3573
|
+
if (previousRecursionDepth >= 100) {
|
|
3574
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
3575
|
+
}
|
|
3576
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
3577
|
+
try {
|
|
3578
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
3579
|
+
const message = createBaseProjectionPreview();
|
|
3580
|
+
while (reader.pos < end) {
|
|
3581
|
+
const tag = reader.uint32();
|
|
3582
|
+
switch (tag >>> 3) {
|
|
3583
|
+
case 1: {
|
|
3584
|
+
if (tag !== 10) {
|
|
3585
|
+
break;
|
|
3586
|
+
}
|
|
3587
|
+
message.ReadModelEntries.push(reader.string());
|
|
3588
|
+
continue;
|
|
3589
|
+
}
|
|
3590
|
+
case 2: {
|
|
3591
|
+
if (tag !== 18) {
|
|
3592
|
+
break;
|
|
3593
|
+
}
|
|
3594
|
+
message.ReadModel = ReadModelDefinition.decode(reader, reader.uint32());
|
|
3595
|
+
continue;
|
|
3596
|
+
}
|
|
3597
|
+
}
|
|
3598
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
3599
|
+
break;
|
|
3600
|
+
}
|
|
3601
|
+
reader.skip(tag & 7);
|
|
3226
3602
|
}
|
|
3227
|
-
|
|
3228
|
-
|
|
3229
|
-
|
|
3230
|
-
reader.
|
|
3603
|
+
return message;
|
|
3604
|
+
}
|
|
3605
|
+
finally {
|
|
3606
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
3231
3607
|
}
|
|
3232
|
-
return message;
|
|
3233
3608
|
},
|
|
3234
3609
|
fromJSON(object) {
|
|
3235
3610
|
return {
|
|
@@ -3279,39 +3654,49 @@ const ProjectionWithDeclaration = {
|
|
|
3279
3654
|
},
|
|
3280
3655
|
decode(input, length) {
|
|
3281
3656
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
3282
|
-
const
|
|
3283
|
-
|
|
3284
|
-
|
|
3285
|
-
|
|
3286
|
-
|
|
3287
|
-
|
|
3288
|
-
|
|
3289
|
-
|
|
3290
|
-
|
|
3291
|
-
|
|
3292
|
-
|
|
3293
|
-
|
|
3294
|
-
|
|
3295
|
-
|
|
3296
|
-
|
|
3297
|
-
|
|
3298
|
-
|
|
3299
|
-
|
|
3300
|
-
|
|
3301
|
-
|
|
3302
|
-
|
|
3303
|
-
|
|
3304
|
-
|
|
3305
|
-
|
|
3306
|
-
|
|
3307
|
-
|
|
3657
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
3658
|
+
if (previousRecursionDepth >= 100) {
|
|
3659
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
3660
|
+
}
|
|
3661
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
3662
|
+
try {
|
|
3663
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
3664
|
+
const message = createBaseProjectionWithDeclaration();
|
|
3665
|
+
while (reader.pos < end) {
|
|
3666
|
+
const tag = reader.uint32();
|
|
3667
|
+
switch (tag >>> 3) {
|
|
3668
|
+
case 1: {
|
|
3669
|
+
if (tag !== 10) {
|
|
3670
|
+
break;
|
|
3671
|
+
}
|
|
3672
|
+
message.Identifier = reader.string();
|
|
3673
|
+
continue;
|
|
3674
|
+
}
|
|
3675
|
+
case 2: {
|
|
3676
|
+
if (tag !== 18) {
|
|
3677
|
+
break;
|
|
3678
|
+
}
|
|
3679
|
+
message.ContainerName = reader.string();
|
|
3680
|
+
continue;
|
|
3681
|
+
}
|
|
3682
|
+
case 3: {
|
|
3683
|
+
if (tag !== 26) {
|
|
3684
|
+
break;
|
|
3685
|
+
}
|
|
3686
|
+
message.Declaration = reader.string();
|
|
3687
|
+
continue;
|
|
3688
|
+
}
|
|
3689
|
+
}
|
|
3690
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
3691
|
+
break;
|
|
3692
|
+
}
|
|
3693
|
+
reader.skip(tag & 7);
|
|
3308
3694
|
}
|
|
3309
|
-
|
|
3310
|
-
|
|
3311
|
-
|
|
3312
|
-
reader.
|
|
3695
|
+
return message;
|
|
3696
|
+
}
|
|
3697
|
+
finally {
|
|
3698
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
3313
3699
|
}
|
|
3314
|
-
return message;
|
|
3315
3700
|
},
|
|
3316
3701
|
fromJSON(object) {
|
|
3317
3702
|
return {
|
|
@@ -3394,88 +3779,98 @@ const ReadModelDefinition = {
|
|
|
3394
3779
|
},
|
|
3395
3780
|
decode(input, length) {
|
|
3396
3781
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
3397
|
-
const
|
|
3398
|
-
|
|
3399
|
-
|
|
3400
|
-
|
|
3401
|
-
|
|
3402
|
-
|
|
3403
|
-
|
|
3404
|
-
|
|
3405
|
-
|
|
3406
|
-
|
|
3407
|
-
|
|
3408
|
-
|
|
3409
|
-
|
|
3410
|
-
|
|
3411
|
-
|
|
3412
|
-
|
|
3413
|
-
|
|
3414
|
-
|
|
3415
|
-
|
|
3416
|
-
|
|
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
|
-
|
|
3448
|
-
|
|
3449
|
-
|
|
3450
|
-
|
|
3451
|
-
|
|
3452
|
-
|
|
3453
|
-
|
|
3454
|
-
|
|
3455
|
-
|
|
3456
|
-
|
|
3457
|
-
|
|
3458
|
-
|
|
3459
|
-
|
|
3460
|
-
|
|
3461
|
-
|
|
3462
|
-
|
|
3463
|
-
|
|
3464
|
-
|
|
3465
|
-
|
|
3466
|
-
|
|
3467
|
-
|
|
3468
|
-
|
|
3469
|
-
|
|
3470
|
-
|
|
3471
|
-
|
|
3472
|
-
|
|
3473
|
-
|
|
3474
|
-
|
|
3782
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
3783
|
+
if (previousRecursionDepth >= 100) {
|
|
3784
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
3785
|
+
}
|
|
3786
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
3787
|
+
try {
|
|
3788
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
3789
|
+
const message = createBaseReadModelDefinition();
|
|
3790
|
+
while (reader.pos < end) {
|
|
3791
|
+
const tag = reader.uint32();
|
|
3792
|
+
switch (tag >>> 3) {
|
|
3793
|
+
case 1: {
|
|
3794
|
+
if (tag !== 10) {
|
|
3795
|
+
break;
|
|
3796
|
+
}
|
|
3797
|
+
message.Type = ReadModelType.decode(reader, reader.uint32());
|
|
3798
|
+
continue;
|
|
3799
|
+
}
|
|
3800
|
+
case 2: {
|
|
3801
|
+
if (tag !== 18) {
|
|
3802
|
+
break;
|
|
3803
|
+
}
|
|
3804
|
+
message.ContainerName = reader.string();
|
|
3805
|
+
continue;
|
|
3806
|
+
}
|
|
3807
|
+
case 3: {
|
|
3808
|
+
if (tag !== 26) {
|
|
3809
|
+
break;
|
|
3810
|
+
}
|
|
3811
|
+
message.DisplayName = reader.string();
|
|
3812
|
+
continue;
|
|
3813
|
+
}
|
|
3814
|
+
case 4: {
|
|
3815
|
+
if (tag !== 34) {
|
|
3816
|
+
break;
|
|
3817
|
+
}
|
|
3818
|
+
message.Sink = SinkDefinition.decode(reader, reader.uint32());
|
|
3819
|
+
continue;
|
|
3820
|
+
}
|
|
3821
|
+
case 5: {
|
|
3822
|
+
if (tag !== 42) {
|
|
3823
|
+
break;
|
|
3824
|
+
}
|
|
3825
|
+
message.Schema = reader.string();
|
|
3826
|
+
continue;
|
|
3827
|
+
}
|
|
3828
|
+
case 6: {
|
|
3829
|
+
if (tag !== 50) {
|
|
3830
|
+
break;
|
|
3831
|
+
}
|
|
3832
|
+
message.Indexes.push(IndexDefinition.decode(reader, reader.uint32()));
|
|
3833
|
+
continue;
|
|
3834
|
+
}
|
|
3835
|
+
case 7: {
|
|
3836
|
+
if (tag !== 56) {
|
|
3837
|
+
break;
|
|
3838
|
+
}
|
|
3839
|
+
message.ObserverType = reader.int32();
|
|
3840
|
+
continue;
|
|
3841
|
+
}
|
|
3842
|
+
case 8: {
|
|
3843
|
+
if (tag !== 66) {
|
|
3844
|
+
break;
|
|
3845
|
+
}
|
|
3846
|
+
message.ObserverIdentifier = reader.string();
|
|
3847
|
+
continue;
|
|
3848
|
+
}
|
|
3849
|
+
case 9: {
|
|
3850
|
+
if (tag !== 72) {
|
|
3851
|
+
break;
|
|
3852
|
+
}
|
|
3853
|
+
message.Owner = reader.int32();
|
|
3854
|
+
continue;
|
|
3855
|
+
}
|
|
3856
|
+
case 10: {
|
|
3857
|
+
if (tag !== 80) {
|
|
3858
|
+
break;
|
|
3859
|
+
}
|
|
3860
|
+
message.Source = reader.int32();
|
|
3861
|
+
continue;
|
|
3862
|
+
}
|
|
3863
|
+
}
|
|
3864
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
3865
|
+
break;
|
|
3866
|
+
}
|
|
3867
|
+
reader.skip(tag & 7);
|
|
3475
3868
|
}
|
|
3476
|
-
|
|
3869
|
+
return message;
|
|
3870
|
+
}
|
|
3871
|
+
finally {
|
|
3872
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
3477
3873
|
}
|
|
3478
|
-
return message;
|
|
3479
3874
|
},
|
|
3480
3875
|
fromJSON(object) {
|
|
3481
3876
|
return {
|
|
@@ -3564,32 +3959,42 @@ const ReadModelType = {
|
|
|
3564
3959
|
},
|
|
3565
3960
|
decode(input, length) {
|
|
3566
3961
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
3567
|
-
const
|
|
3568
|
-
|
|
3569
|
-
|
|
3570
|
-
|
|
3571
|
-
|
|
3572
|
-
|
|
3573
|
-
|
|
3574
|
-
|
|
3575
|
-
|
|
3576
|
-
|
|
3577
|
-
|
|
3578
|
-
|
|
3579
|
-
|
|
3580
|
-
|
|
3581
|
-
|
|
3582
|
-
|
|
3583
|
-
|
|
3584
|
-
|
|
3585
|
-
|
|
3586
|
-
|
|
3587
|
-
|
|
3588
|
-
|
|
3962
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
3963
|
+
if (previousRecursionDepth >= 100) {
|
|
3964
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
3965
|
+
}
|
|
3966
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
3967
|
+
try {
|
|
3968
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
3969
|
+
const message = createBaseReadModelType();
|
|
3970
|
+
while (reader.pos < end) {
|
|
3971
|
+
const tag = reader.uint32();
|
|
3972
|
+
switch (tag >>> 3) {
|
|
3973
|
+
case 1: {
|
|
3974
|
+
if (tag !== 10) {
|
|
3975
|
+
break;
|
|
3976
|
+
}
|
|
3977
|
+
message.Identifier = reader.string();
|
|
3978
|
+
continue;
|
|
3979
|
+
}
|
|
3980
|
+
case 2: {
|
|
3981
|
+
if (tag !== 16) {
|
|
3982
|
+
break;
|
|
3983
|
+
}
|
|
3984
|
+
message.Generation = reader.uint32();
|
|
3985
|
+
continue;
|
|
3986
|
+
}
|
|
3987
|
+
}
|
|
3988
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
3989
|
+
break;
|
|
3990
|
+
}
|
|
3991
|
+
reader.skip(tag & 7);
|
|
3589
3992
|
}
|
|
3590
|
-
|
|
3993
|
+
return message;
|
|
3994
|
+
}
|
|
3995
|
+
finally {
|
|
3996
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
3591
3997
|
}
|
|
3592
|
-
return message;
|
|
3593
3998
|
},
|
|
3594
3999
|
fromJSON(object) {
|
|
3595
4000
|
return {
|
|
@@ -3635,39 +4040,49 @@ const RegisterRequest = {
|
|
|
3635
4040
|
},
|
|
3636
4041
|
decode(input, length) {
|
|
3637
4042
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
3638
|
-
const
|
|
3639
|
-
|
|
3640
|
-
|
|
3641
|
-
|
|
3642
|
-
|
|
3643
|
-
|
|
3644
|
-
|
|
3645
|
-
|
|
3646
|
-
|
|
3647
|
-
|
|
3648
|
-
|
|
3649
|
-
|
|
3650
|
-
|
|
3651
|
-
|
|
3652
|
-
|
|
3653
|
-
|
|
3654
|
-
|
|
3655
|
-
|
|
3656
|
-
|
|
3657
|
-
|
|
3658
|
-
|
|
3659
|
-
|
|
3660
|
-
|
|
3661
|
-
|
|
3662
|
-
|
|
3663
|
-
|
|
3664
|
-
|
|
3665
|
-
|
|
3666
|
-
|
|
4043
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
4044
|
+
if (previousRecursionDepth >= 100) {
|
|
4045
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
4046
|
+
}
|
|
4047
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
4048
|
+
try {
|
|
4049
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
4050
|
+
const message = createBaseRegisterRequest();
|
|
4051
|
+
while (reader.pos < end) {
|
|
4052
|
+
const tag = reader.uint32();
|
|
4053
|
+
switch (tag >>> 3) {
|
|
4054
|
+
case 1: {
|
|
4055
|
+
if (tag !== 10) {
|
|
4056
|
+
break;
|
|
4057
|
+
}
|
|
4058
|
+
message.EventStore = reader.string();
|
|
4059
|
+
continue;
|
|
4060
|
+
}
|
|
4061
|
+
case 2: {
|
|
4062
|
+
if (tag !== 16) {
|
|
4063
|
+
break;
|
|
4064
|
+
}
|
|
4065
|
+
message.Owner = reader.int32();
|
|
4066
|
+
continue;
|
|
4067
|
+
}
|
|
4068
|
+
case 3: {
|
|
4069
|
+
if (tag !== 26) {
|
|
4070
|
+
break;
|
|
4071
|
+
}
|
|
4072
|
+
message.Projections.push(ProjectionDefinition.decode(reader, reader.uint32()));
|
|
4073
|
+
continue;
|
|
4074
|
+
}
|
|
4075
|
+
}
|
|
4076
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
4077
|
+
break;
|
|
4078
|
+
}
|
|
4079
|
+
reader.skip(tag & 7);
|
|
3667
4080
|
}
|
|
3668
|
-
|
|
4081
|
+
return message;
|
|
4082
|
+
}
|
|
4083
|
+
finally {
|
|
4084
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
3669
4085
|
}
|
|
3670
|
-
return message;
|
|
3671
4086
|
},
|
|
3672
4087
|
fromJSON(object) {
|
|
3673
4088
|
return {
|
|
@@ -3717,32 +4132,42 @@ const RemovedWithDefinition = {
|
|
|
3717
4132
|
},
|
|
3718
4133
|
decode(input, length) {
|
|
3719
4134
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
3720
|
-
const
|
|
3721
|
-
|
|
3722
|
-
|
|
3723
|
-
|
|
3724
|
-
|
|
3725
|
-
|
|
3726
|
-
|
|
3727
|
-
|
|
3728
|
-
|
|
3729
|
-
|
|
3730
|
-
|
|
3731
|
-
|
|
3732
|
-
|
|
3733
|
-
|
|
3734
|
-
|
|
3735
|
-
|
|
3736
|
-
|
|
3737
|
-
|
|
3738
|
-
|
|
3739
|
-
|
|
3740
|
-
|
|
3741
|
-
|
|
4135
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
4136
|
+
if (previousRecursionDepth >= 100) {
|
|
4137
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
4138
|
+
}
|
|
4139
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
4140
|
+
try {
|
|
4141
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
4142
|
+
const message = createBaseRemovedWithDefinition();
|
|
4143
|
+
while (reader.pos < end) {
|
|
4144
|
+
const tag = reader.uint32();
|
|
4145
|
+
switch (tag >>> 3) {
|
|
4146
|
+
case 1: {
|
|
4147
|
+
if (tag !== 10) {
|
|
4148
|
+
break;
|
|
4149
|
+
}
|
|
4150
|
+
message.Key = reader.string();
|
|
4151
|
+
continue;
|
|
4152
|
+
}
|
|
4153
|
+
case 2: {
|
|
4154
|
+
if (tag !== 18) {
|
|
4155
|
+
break;
|
|
4156
|
+
}
|
|
4157
|
+
message.ParentKey = reader.string();
|
|
4158
|
+
continue;
|
|
4159
|
+
}
|
|
4160
|
+
}
|
|
4161
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
4162
|
+
break;
|
|
4163
|
+
}
|
|
4164
|
+
reader.skip(tag & 7);
|
|
3742
4165
|
}
|
|
3743
|
-
|
|
4166
|
+
return message;
|
|
4167
|
+
}
|
|
4168
|
+
finally {
|
|
4169
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
3744
4170
|
}
|
|
3745
|
-
return message;
|
|
3746
4171
|
},
|
|
3747
4172
|
fromJSON(object) {
|
|
3748
4173
|
return {
|
|
@@ -3782,25 +4207,35 @@ const RemovedWithJoinDefinition = {
|
|
|
3782
4207
|
},
|
|
3783
4208
|
decode(input, length) {
|
|
3784
4209
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
3785
|
-
const
|
|
3786
|
-
|
|
3787
|
-
|
|
3788
|
-
|
|
3789
|
-
|
|
3790
|
-
|
|
3791
|
-
|
|
3792
|
-
|
|
3793
|
-
|
|
3794
|
-
|
|
3795
|
-
|
|
3796
|
-
|
|
3797
|
-
|
|
3798
|
-
|
|
3799
|
-
|
|
4210
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
4211
|
+
if (previousRecursionDepth >= 100) {
|
|
4212
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
4213
|
+
}
|
|
4214
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
4215
|
+
try {
|
|
4216
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
4217
|
+
const message = createBaseRemovedWithJoinDefinition();
|
|
4218
|
+
while (reader.pos < end) {
|
|
4219
|
+
const tag = reader.uint32();
|
|
4220
|
+
switch (tag >>> 3) {
|
|
4221
|
+
case 1: {
|
|
4222
|
+
if (tag !== 10) {
|
|
4223
|
+
break;
|
|
4224
|
+
}
|
|
4225
|
+
message.Key = reader.string();
|
|
4226
|
+
continue;
|
|
4227
|
+
}
|
|
4228
|
+
}
|
|
4229
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
4230
|
+
break;
|
|
4231
|
+
}
|
|
4232
|
+
reader.skip(tag & 7);
|
|
3800
4233
|
}
|
|
3801
|
-
|
|
4234
|
+
return message;
|
|
4235
|
+
}
|
|
4236
|
+
finally {
|
|
4237
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
3802
4238
|
}
|
|
3803
|
-
return message;
|
|
3804
4239
|
},
|
|
3805
4240
|
fromJSON(object) {
|
|
3806
4241
|
return { Key: isSet(object.Key) ? globalThis.String(object.Key) : "" };
|
|
@@ -3845,53 +4280,63 @@ const SaveProjectionRequest = {
|
|
|
3845
4280
|
},
|
|
3846
4281
|
decode(input, length) {
|
|
3847
4282
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
3848
|
-
const
|
|
3849
|
-
|
|
3850
|
-
|
|
3851
|
-
|
|
3852
|
-
|
|
3853
|
-
|
|
3854
|
-
|
|
3855
|
-
|
|
3856
|
-
|
|
3857
|
-
|
|
3858
|
-
|
|
3859
|
-
|
|
3860
|
-
|
|
3861
|
-
|
|
3862
|
-
|
|
3863
|
-
|
|
3864
|
-
|
|
3865
|
-
|
|
3866
|
-
|
|
3867
|
-
|
|
3868
|
-
|
|
3869
|
-
|
|
3870
|
-
|
|
3871
|
-
|
|
3872
|
-
|
|
3873
|
-
|
|
3874
|
-
|
|
3875
|
-
|
|
3876
|
-
|
|
3877
|
-
|
|
3878
|
-
|
|
3879
|
-
|
|
3880
|
-
|
|
3881
|
-
|
|
3882
|
-
|
|
3883
|
-
|
|
3884
|
-
|
|
3885
|
-
|
|
3886
|
-
|
|
3887
|
-
|
|
3888
|
-
|
|
3889
|
-
|
|
3890
|
-
|
|
4283
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
4284
|
+
if (previousRecursionDepth >= 100) {
|
|
4285
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
4286
|
+
}
|
|
4287
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
4288
|
+
try {
|
|
4289
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
4290
|
+
const message = createBaseSaveProjectionRequest();
|
|
4291
|
+
while (reader.pos < end) {
|
|
4292
|
+
const tag = reader.uint32();
|
|
4293
|
+
switch (tag >>> 3) {
|
|
4294
|
+
case 1: {
|
|
4295
|
+
if (tag !== 10) {
|
|
4296
|
+
break;
|
|
4297
|
+
}
|
|
4298
|
+
message.EventStore = reader.string();
|
|
4299
|
+
continue;
|
|
4300
|
+
}
|
|
4301
|
+
case 2: {
|
|
4302
|
+
if (tag !== 18) {
|
|
4303
|
+
break;
|
|
4304
|
+
}
|
|
4305
|
+
message.Namespace = reader.string();
|
|
4306
|
+
continue;
|
|
4307
|
+
}
|
|
4308
|
+
case 3: {
|
|
4309
|
+
if (tag !== 26) {
|
|
4310
|
+
break;
|
|
4311
|
+
}
|
|
4312
|
+
message.EventSequenceId = reader.string();
|
|
4313
|
+
continue;
|
|
4314
|
+
}
|
|
4315
|
+
case 4: {
|
|
4316
|
+
if (tag !== 34) {
|
|
4317
|
+
break;
|
|
4318
|
+
}
|
|
4319
|
+
message.Declaration = reader.string();
|
|
4320
|
+
continue;
|
|
4321
|
+
}
|
|
4322
|
+
case 5: {
|
|
4323
|
+
if (tag !== 42) {
|
|
4324
|
+
break;
|
|
4325
|
+
}
|
|
4326
|
+
message.DraftReadModel = DraftReadModelDefinition.decode(reader, reader.uint32());
|
|
4327
|
+
continue;
|
|
4328
|
+
}
|
|
4329
|
+
}
|
|
4330
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
4331
|
+
break;
|
|
4332
|
+
}
|
|
4333
|
+
reader.skip(tag & 7);
|
|
3891
4334
|
}
|
|
3892
|
-
|
|
4335
|
+
return message;
|
|
4336
|
+
}
|
|
4337
|
+
finally {
|
|
4338
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
3893
4339
|
}
|
|
3894
|
-
return message;
|
|
3895
4340
|
},
|
|
3896
4341
|
fromJSON(object) {
|
|
3897
4342
|
return {
|
|
@@ -3950,25 +4395,35 @@ const SaveProjectionResult = {
|
|
|
3950
4395
|
},
|
|
3951
4396
|
decode(input, length) {
|
|
3952
4397
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
3953
|
-
const
|
|
3954
|
-
|
|
3955
|
-
|
|
3956
|
-
|
|
3957
|
-
|
|
3958
|
-
|
|
3959
|
-
|
|
3960
|
-
|
|
3961
|
-
|
|
3962
|
-
|
|
3963
|
-
|
|
3964
|
-
|
|
4398
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
4399
|
+
if (previousRecursionDepth >= 100) {
|
|
4400
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
4401
|
+
}
|
|
4402
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
4403
|
+
try {
|
|
4404
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
4405
|
+
const message = createBaseSaveProjectionResult();
|
|
4406
|
+
while (reader.pos < end) {
|
|
4407
|
+
const tag = reader.uint32();
|
|
4408
|
+
switch (tag >>> 3) {
|
|
4409
|
+
case 1: {
|
|
4410
|
+
if (tag !== 10) {
|
|
4411
|
+
break;
|
|
4412
|
+
}
|
|
4413
|
+
message.Errors.push(ProjectionDeclarationSyntaxError.decode(reader, reader.uint32()));
|
|
4414
|
+
continue;
|
|
4415
|
+
}
|
|
4416
|
+
}
|
|
4417
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
4418
|
+
break;
|
|
4419
|
+
}
|
|
4420
|
+
reader.skip(tag & 7);
|
|
3965
4421
|
}
|
|
3966
|
-
|
|
3967
|
-
|
|
3968
|
-
|
|
3969
|
-
reader.
|
|
4422
|
+
return message;
|
|
4423
|
+
}
|
|
4424
|
+
finally {
|
|
4425
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
3970
4426
|
}
|
|
3971
|
-
return message;
|
|
3972
4427
|
},
|
|
3973
4428
|
fromJSON(object) {
|
|
3974
4429
|
return {
|
|
@@ -4005,25 +4460,35 @@ const SerializableDateTimeOffset = {
|
|
|
4005
4460
|
},
|
|
4006
4461
|
decode(input, length) {
|
|
4007
4462
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
4008
|
-
const
|
|
4009
|
-
|
|
4010
|
-
|
|
4011
|
-
|
|
4012
|
-
|
|
4013
|
-
|
|
4014
|
-
|
|
4015
|
-
|
|
4016
|
-
|
|
4017
|
-
|
|
4018
|
-
|
|
4019
|
-
|
|
4020
|
-
|
|
4021
|
-
|
|
4022
|
-
|
|
4463
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
4464
|
+
if (previousRecursionDepth >= 100) {
|
|
4465
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
4466
|
+
}
|
|
4467
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
4468
|
+
try {
|
|
4469
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
4470
|
+
const message = createBaseSerializableDateTimeOffset();
|
|
4471
|
+
while (reader.pos < end) {
|
|
4472
|
+
const tag = reader.uint32();
|
|
4473
|
+
switch (tag >>> 3) {
|
|
4474
|
+
case 1: {
|
|
4475
|
+
if (tag !== 10) {
|
|
4476
|
+
break;
|
|
4477
|
+
}
|
|
4478
|
+
message.Value = reader.string();
|
|
4479
|
+
continue;
|
|
4480
|
+
}
|
|
4481
|
+
}
|
|
4482
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
4483
|
+
break;
|
|
4484
|
+
}
|
|
4485
|
+
reader.skip(tag & 7);
|
|
4023
4486
|
}
|
|
4024
|
-
|
|
4487
|
+
return message;
|
|
4488
|
+
}
|
|
4489
|
+
finally {
|
|
4490
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
4025
4491
|
}
|
|
4026
|
-
return message;
|
|
4027
4492
|
},
|
|
4028
4493
|
fromJSON(object) {
|
|
4029
4494
|
return { Value: isSet(object.Value) ? globalThis.String(object.Value) : "" };
|
|
@@ -4059,32 +4524,42 @@ const SinkDefinition = {
|
|
|
4059
4524
|
},
|
|
4060
4525
|
decode(input, length) {
|
|
4061
4526
|
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
4062
|
-
const
|
|
4063
|
-
|
|
4064
|
-
|
|
4065
|
-
|
|
4066
|
-
|
|
4067
|
-
|
|
4068
|
-
|
|
4069
|
-
|
|
4070
|
-
|
|
4071
|
-
|
|
4072
|
-
|
|
4073
|
-
|
|
4074
|
-
|
|
4075
|
-
|
|
4076
|
-
|
|
4077
|
-
|
|
4078
|
-
|
|
4079
|
-
|
|
4080
|
-
|
|
4527
|
+
const previousRecursionDepth = reader.__tsProtoDecodeDepth ?? 0;
|
|
4528
|
+
if (previousRecursionDepth >= 100) {
|
|
4529
|
+
throw new globalThis.Error("protobuf decode recursion limit exceeded");
|
|
4530
|
+
}
|
|
4531
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth + 1;
|
|
4532
|
+
try {
|
|
4533
|
+
const end = length === undefined ? reader.len : reader.pos + length;
|
|
4534
|
+
const message = createBaseSinkDefinition();
|
|
4535
|
+
while (reader.pos < end) {
|
|
4536
|
+
const tag = reader.uint32();
|
|
4537
|
+
switch (tag >>> 3) {
|
|
4538
|
+
case 1: {
|
|
4539
|
+
if (tag !== 10) {
|
|
4540
|
+
break;
|
|
4541
|
+
}
|
|
4542
|
+
message.ConfigurationId = Guid.decode(reader, reader.uint32());
|
|
4543
|
+
continue;
|
|
4544
|
+
}
|
|
4545
|
+
case 2: {
|
|
4546
|
+
if (tag !== 18) {
|
|
4547
|
+
break;
|
|
4548
|
+
}
|
|
4549
|
+
message.TypeId = reader.string();
|
|
4550
|
+
continue;
|
|
4551
|
+
}
|
|
4552
|
+
}
|
|
4553
|
+
if ((tag & 7) === 4 || tag === 0) {
|
|
4554
|
+
break;
|
|
4555
|
+
}
|
|
4556
|
+
reader.skip(tag & 7);
|
|
4081
4557
|
}
|
|
4082
|
-
|
|
4083
|
-
|
|
4084
|
-
|
|
4085
|
-
reader.
|
|
4558
|
+
return message;
|
|
4559
|
+
}
|
|
4560
|
+
finally {
|
|
4561
|
+
reader.__tsProtoDecodeDepth = previousRecursionDepth;
|
|
4086
4562
|
}
|
|
4087
|
-
return message;
|
|
4088
4563
|
},
|
|
4089
4564
|
fromJSON(object) {
|
|
4090
4565
|
return {
|