decentralcardgame-cardchain-client-ts 0.0.5 → 0.0.6
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/DecentralCardGame.cardchain.cardchain/module.js +311 -309
- package/DecentralCardGame.cardchain.cardchain/module.ts +469 -467
- package/DecentralCardGame.cardchain.cardchain/registry.js +58 -58
- package/DecentralCardGame.cardchain.cardchain/registry.ts +58 -58
- package/DecentralCardGame.cardchain.cardchain/rest.ts +3 -0
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/cardchain/card.js +41 -0
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/cardchain/card.ts +51 -0
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/cardchain/genesis.js +14 -1
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/cardchain/genesis.ts +16 -2
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/cardchain/query.js +10 -0
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/cardchain/query.ts +11 -0
- package/DecentralCardGame.cardchain.cardchain/types.js +2 -1
- package/DecentralCardGame.cardchain.cardchain/types.ts +2 -0
- package/client.js +1 -2
- package/package.json +1 -1
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/card.js +0 -491
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/card.ts +0 -556
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/collection.js +0 -365
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/collection.ts +0 -416
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/collection_proposal.js +0 -93
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/collection_proposal.ts +0 -124
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/copyright_proposal.js +0 -102
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/copyright_proposal.ts +0 -134
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/council.js +0 -350
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/council.ts +0 -409
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/genesis.js +0 -241
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/genesis.ts +0 -267
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/image.js +0 -88
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/image.ts +0 -115
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/match.js +0 -210
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/match.ts +0 -255
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/match_reporter_proposal.js +0 -67
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/match_reporter_proposal.ts +0 -92
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/num.js +0 -73
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/num.ts +0 -102
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/params.js +0 -275
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/params.ts +0 -324
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/query.js +0 -1970
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/query.ts +0 -2366
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/running_average.js +0 -85
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/running_average.ts +0 -111
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/sell_offer.js +0 -148
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/sell_offer.ts +0 -183
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/server.js +0 -93
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/server.ts +0 -124
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/tx.js +0 -4137
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/tx.ts +0 -5125
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/user.js +0 -496
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/user.ts +0 -556
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/vote_right.js +0 -84
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/vote_right.ts +0 -114
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/voting_result.js +0 -127
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/voting_result.ts +0 -161
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/voting_results.js +0 -148
- package/DecentralCardGame.cardchain.cardchain/types/cardchain/voting_results.ts +0 -182
- package/cosmos.authz.v1beta1/types/cosmos/base/abci/v1beta1/abci.js +0 -773
- package/cosmos.authz.v1beta1/types/cosmos/base/abci/v1beta1/abci.ts +0 -989
- package/cosmos.authz.v1beta1/types/google/protobuf/duration.js +0 -84
- package/cosmos.authz.v1beta1/types/google/protobuf/duration.ts +0 -187
- package/cosmos.authz.v1beta1/types/tendermint/abci/types.js +0 -3447
- package/cosmos.authz.v1beta1/types/tendermint/abci/types.ts +0 -4107
- package/cosmos.authz.v1beta1/types/tendermint/crypto/keys.js +0 -100
- package/cosmos.authz.v1beta1/types/tendermint/crypto/keys.ts +0 -129
- package/cosmos.authz.v1beta1/types/tendermint/crypto/proof.js +0 -356
- package/cosmos.authz.v1beta1/types/tendermint/crypto/proof.ts +0 -439
- package/cosmos.authz.v1beta1/types/tendermint/types/params.js +0 -378
- package/cosmos.authz.v1beta1/types/tendermint/types/params.ts +0 -514
- package/cosmos.authz.v1beta1/types/tendermint/types/types.js +0 -1207
- package/cosmos.authz.v1beta1/types/tendermint/types/types.ts +0 -1452
- package/cosmos.authz.v1beta1/types/tendermint/types/validator.js +0 -254
- package/cosmos.authz.v1beta1/types/tendermint/types/validator.ts +0 -308
- package/cosmos.authz.v1beta1/types/tendermint/version/types.js +0 -133
- package/cosmos.authz.v1beta1/types/tendermint/version/types.ts +0 -184
- package/ibc.core.connection.v1/types/confio/proofs.js +0 -1120
- package/ibc.core.connection.v1/types/confio/proofs.ts +0 -1402
|
@@ -1,1120 +0,0 @@
|
|
|
1
|
-
/* eslint-disable */
|
|
2
|
-
import _m0 from "protobufjs/minimal";
|
|
3
|
-
export const protobufPackage = "ics23";
|
|
4
|
-
export var HashOp;
|
|
5
|
-
(function (HashOp) {
|
|
6
|
-
/** NO_HASH - NO_HASH is the default if no data passed. Note this is an illegal argument some places. */
|
|
7
|
-
HashOp[HashOp["NO_HASH"] = 0] = "NO_HASH";
|
|
8
|
-
HashOp[HashOp["SHA256"] = 1] = "SHA256";
|
|
9
|
-
HashOp[HashOp["SHA512"] = 2] = "SHA512";
|
|
10
|
-
HashOp[HashOp["KECCAK"] = 3] = "KECCAK";
|
|
11
|
-
HashOp[HashOp["RIPEMD160"] = 4] = "RIPEMD160";
|
|
12
|
-
/** BITCOIN - ripemd160(sha256(x)) */
|
|
13
|
-
HashOp[HashOp["BITCOIN"] = 5] = "BITCOIN";
|
|
14
|
-
HashOp[HashOp["UNRECOGNIZED"] = -1] = "UNRECOGNIZED";
|
|
15
|
-
})(HashOp || (HashOp = {}));
|
|
16
|
-
export function hashOpFromJSON(object) {
|
|
17
|
-
switch (object) {
|
|
18
|
-
case 0:
|
|
19
|
-
case "NO_HASH":
|
|
20
|
-
return HashOp.NO_HASH;
|
|
21
|
-
case 1:
|
|
22
|
-
case "SHA256":
|
|
23
|
-
return HashOp.SHA256;
|
|
24
|
-
case 2:
|
|
25
|
-
case "SHA512":
|
|
26
|
-
return HashOp.SHA512;
|
|
27
|
-
case 3:
|
|
28
|
-
case "KECCAK":
|
|
29
|
-
return HashOp.KECCAK;
|
|
30
|
-
case 4:
|
|
31
|
-
case "RIPEMD160":
|
|
32
|
-
return HashOp.RIPEMD160;
|
|
33
|
-
case 5:
|
|
34
|
-
case "BITCOIN":
|
|
35
|
-
return HashOp.BITCOIN;
|
|
36
|
-
case -1:
|
|
37
|
-
case "UNRECOGNIZED":
|
|
38
|
-
default:
|
|
39
|
-
return HashOp.UNRECOGNIZED;
|
|
40
|
-
}
|
|
41
|
-
}
|
|
42
|
-
export function hashOpToJSON(object) {
|
|
43
|
-
switch (object) {
|
|
44
|
-
case HashOp.NO_HASH:
|
|
45
|
-
return "NO_HASH";
|
|
46
|
-
case HashOp.SHA256:
|
|
47
|
-
return "SHA256";
|
|
48
|
-
case HashOp.SHA512:
|
|
49
|
-
return "SHA512";
|
|
50
|
-
case HashOp.KECCAK:
|
|
51
|
-
return "KECCAK";
|
|
52
|
-
case HashOp.RIPEMD160:
|
|
53
|
-
return "RIPEMD160";
|
|
54
|
-
case HashOp.BITCOIN:
|
|
55
|
-
return "BITCOIN";
|
|
56
|
-
case HashOp.UNRECOGNIZED:
|
|
57
|
-
default:
|
|
58
|
-
return "UNRECOGNIZED";
|
|
59
|
-
}
|
|
60
|
-
}
|
|
61
|
-
/**
|
|
62
|
-
* LengthOp defines how to process the key and value of the LeafOp
|
|
63
|
-
* to include length information. After encoding the length with the given
|
|
64
|
-
* algorithm, the length will be prepended to the key and value bytes.
|
|
65
|
-
* (Each one with it's own encoded length)
|
|
66
|
-
*/
|
|
67
|
-
export var LengthOp;
|
|
68
|
-
(function (LengthOp) {
|
|
69
|
-
/** NO_PREFIX - NO_PREFIX don't include any length info */
|
|
70
|
-
LengthOp[LengthOp["NO_PREFIX"] = 0] = "NO_PREFIX";
|
|
71
|
-
/** VAR_PROTO - VAR_PROTO uses protobuf (and go-amino) varint encoding of the length */
|
|
72
|
-
LengthOp[LengthOp["VAR_PROTO"] = 1] = "VAR_PROTO";
|
|
73
|
-
/** VAR_RLP - VAR_RLP uses rlp int encoding of the length */
|
|
74
|
-
LengthOp[LengthOp["VAR_RLP"] = 2] = "VAR_RLP";
|
|
75
|
-
/** FIXED32_BIG - FIXED32_BIG uses big-endian encoding of the length as a 32 bit integer */
|
|
76
|
-
LengthOp[LengthOp["FIXED32_BIG"] = 3] = "FIXED32_BIG";
|
|
77
|
-
/** FIXED32_LITTLE - FIXED32_LITTLE uses little-endian encoding of the length as a 32 bit integer */
|
|
78
|
-
LengthOp[LengthOp["FIXED32_LITTLE"] = 4] = "FIXED32_LITTLE";
|
|
79
|
-
/** FIXED64_BIG - FIXED64_BIG uses big-endian encoding of the length as a 64 bit integer */
|
|
80
|
-
LengthOp[LengthOp["FIXED64_BIG"] = 5] = "FIXED64_BIG";
|
|
81
|
-
/** FIXED64_LITTLE - FIXED64_LITTLE uses little-endian encoding of the length as a 64 bit integer */
|
|
82
|
-
LengthOp[LengthOp["FIXED64_LITTLE"] = 6] = "FIXED64_LITTLE";
|
|
83
|
-
/** REQUIRE_32_BYTES - REQUIRE_32_BYTES is like NONE, but will fail if the input is not exactly 32 bytes (sha256 output) */
|
|
84
|
-
LengthOp[LengthOp["REQUIRE_32_BYTES"] = 7] = "REQUIRE_32_BYTES";
|
|
85
|
-
/** REQUIRE_64_BYTES - REQUIRE_64_BYTES is like NONE, but will fail if the input is not exactly 64 bytes (sha512 output) */
|
|
86
|
-
LengthOp[LengthOp["REQUIRE_64_BYTES"] = 8] = "REQUIRE_64_BYTES";
|
|
87
|
-
LengthOp[LengthOp["UNRECOGNIZED"] = -1] = "UNRECOGNIZED";
|
|
88
|
-
})(LengthOp || (LengthOp = {}));
|
|
89
|
-
export function lengthOpFromJSON(object) {
|
|
90
|
-
switch (object) {
|
|
91
|
-
case 0:
|
|
92
|
-
case "NO_PREFIX":
|
|
93
|
-
return LengthOp.NO_PREFIX;
|
|
94
|
-
case 1:
|
|
95
|
-
case "VAR_PROTO":
|
|
96
|
-
return LengthOp.VAR_PROTO;
|
|
97
|
-
case 2:
|
|
98
|
-
case "VAR_RLP":
|
|
99
|
-
return LengthOp.VAR_RLP;
|
|
100
|
-
case 3:
|
|
101
|
-
case "FIXED32_BIG":
|
|
102
|
-
return LengthOp.FIXED32_BIG;
|
|
103
|
-
case 4:
|
|
104
|
-
case "FIXED32_LITTLE":
|
|
105
|
-
return LengthOp.FIXED32_LITTLE;
|
|
106
|
-
case 5:
|
|
107
|
-
case "FIXED64_BIG":
|
|
108
|
-
return LengthOp.FIXED64_BIG;
|
|
109
|
-
case 6:
|
|
110
|
-
case "FIXED64_LITTLE":
|
|
111
|
-
return LengthOp.FIXED64_LITTLE;
|
|
112
|
-
case 7:
|
|
113
|
-
case "REQUIRE_32_BYTES":
|
|
114
|
-
return LengthOp.REQUIRE_32_BYTES;
|
|
115
|
-
case 8:
|
|
116
|
-
case "REQUIRE_64_BYTES":
|
|
117
|
-
return LengthOp.REQUIRE_64_BYTES;
|
|
118
|
-
case -1:
|
|
119
|
-
case "UNRECOGNIZED":
|
|
120
|
-
default:
|
|
121
|
-
return LengthOp.UNRECOGNIZED;
|
|
122
|
-
}
|
|
123
|
-
}
|
|
124
|
-
export function lengthOpToJSON(object) {
|
|
125
|
-
switch (object) {
|
|
126
|
-
case LengthOp.NO_PREFIX:
|
|
127
|
-
return "NO_PREFIX";
|
|
128
|
-
case LengthOp.VAR_PROTO:
|
|
129
|
-
return "VAR_PROTO";
|
|
130
|
-
case LengthOp.VAR_RLP:
|
|
131
|
-
return "VAR_RLP";
|
|
132
|
-
case LengthOp.FIXED32_BIG:
|
|
133
|
-
return "FIXED32_BIG";
|
|
134
|
-
case LengthOp.FIXED32_LITTLE:
|
|
135
|
-
return "FIXED32_LITTLE";
|
|
136
|
-
case LengthOp.FIXED64_BIG:
|
|
137
|
-
return "FIXED64_BIG";
|
|
138
|
-
case LengthOp.FIXED64_LITTLE:
|
|
139
|
-
return "FIXED64_LITTLE";
|
|
140
|
-
case LengthOp.REQUIRE_32_BYTES:
|
|
141
|
-
return "REQUIRE_32_BYTES";
|
|
142
|
-
case LengthOp.REQUIRE_64_BYTES:
|
|
143
|
-
return "REQUIRE_64_BYTES";
|
|
144
|
-
case LengthOp.UNRECOGNIZED:
|
|
145
|
-
default:
|
|
146
|
-
return "UNRECOGNIZED";
|
|
147
|
-
}
|
|
148
|
-
}
|
|
149
|
-
function createBaseExistenceProof() {
|
|
150
|
-
return { key: new Uint8Array(), value: new Uint8Array(), leaf: undefined, path: [] };
|
|
151
|
-
}
|
|
152
|
-
export const ExistenceProof = {
|
|
153
|
-
encode(message, writer = _m0.Writer.create()) {
|
|
154
|
-
if (message.key.length !== 0) {
|
|
155
|
-
writer.uint32(10).bytes(message.key);
|
|
156
|
-
}
|
|
157
|
-
if (message.value.length !== 0) {
|
|
158
|
-
writer.uint32(18).bytes(message.value);
|
|
159
|
-
}
|
|
160
|
-
if (message.leaf !== undefined) {
|
|
161
|
-
LeafOp.encode(message.leaf, writer.uint32(26).fork()).ldelim();
|
|
162
|
-
}
|
|
163
|
-
for (const v of message.path) {
|
|
164
|
-
InnerOp.encode(v, writer.uint32(34).fork()).ldelim();
|
|
165
|
-
}
|
|
166
|
-
return writer;
|
|
167
|
-
},
|
|
168
|
-
decode(input, length) {
|
|
169
|
-
const reader = input instanceof _m0.Reader ? input : new _m0.Reader(input);
|
|
170
|
-
let end = length === undefined ? reader.len : reader.pos + length;
|
|
171
|
-
const message = createBaseExistenceProof();
|
|
172
|
-
while (reader.pos < end) {
|
|
173
|
-
const tag = reader.uint32();
|
|
174
|
-
switch (tag >>> 3) {
|
|
175
|
-
case 1:
|
|
176
|
-
message.key = reader.bytes();
|
|
177
|
-
break;
|
|
178
|
-
case 2:
|
|
179
|
-
message.value = reader.bytes();
|
|
180
|
-
break;
|
|
181
|
-
case 3:
|
|
182
|
-
message.leaf = LeafOp.decode(reader, reader.uint32());
|
|
183
|
-
break;
|
|
184
|
-
case 4:
|
|
185
|
-
message.path.push(InnerOp.decode(reader, reader.uint32()));
|
|
186
|
-
break;
|
|
187
|
-
default:
|
|
188
|
-
reader.skipType(tag & 7);
|
|
189
|
-
break;
|
|
190
|
-
}
|
|
191
|
-
}
|
|
192
|
-
return message;
|
|
193
|
-
},
|
|
194
|
-
fromJSON(object) {
|
|
195
|
-
return {
|
|
196
|
-
key: isSet(object.key) ? bytesFromBase64(object.key) : new Uint8Array(),
|
|
197
|
-
value: isSet(object.value) ? bytesFromBase64(object.value) : new Uint8Array(),
|
|
198
|
-
leaf: isSet(object.leaf) ? LeafOp.fromJSON(object.leaf) : undefined,
|
|
199
|
-
path: Array.isArray(object?.path) ? object.path.map((e) => InnerOp.fromJSON(e)) : [],
|
|
200
|
-
};
|
|
201
|
-
},
|
|
202
|
-
toJSON(message) {
|
|
203
|
-
const obj = {};
|
|
204
|
-
message.key !== undefined
|
|
205
|
-
&& (obj.key = base64FromBytes(message.key !== undefined ? message.key : new Uint8Array()));
|
|
206
|
-
message.value !== undefined
|
|
207
|
-
&& (obj.value = base64FromBytes(message.value !== undefined ? message.value : new Uint8Array()));
|
|
208
|
-
message.leaf !== undefined && (obj.leaf = message.leaf ? LeafOp.toJSON(message.leaf) : undefined);
|
|
209
|
-
if (message.path) {
|
|
210
|
-
obj.path = message.path.map((e) => e ? InnerOp.toJSON(e) : undefined);
|
|
211
|
-
}
|
|
212
|
-
else {
|
|
213
|
-
obj.path = [];
|
|
214
|
-
}
|
|
215
|
-
return obj;
|
|
216
|
-
},
|
|
217
|
-
fromPartial(object) {
|
|
218
|
-
const message = createBaseExistenceProof();
|
|
219
|
-
message.key = object.key ?? new Uint8Array();
|
|
220
|
-
message.value = object.value ?? new Uint8Array();
|
|
221
|
-
message.leaf = (object.leaf !== undefined && object.leaf !== null) ? LeafOp.fromPartial(object.leaf) : undefined;
|
|
222
|
-
message.path = object.path?.map((e) => InnerOp.fromPartial(e)) || [];
|
|
223
|
-
return message;
|
|
224
|
-
},
|
|
225
|
-
};
|
|
226
|
-
function createBaseNonExistenceProof() {
|
|
227
|
-
return { key: new Uint8Array(), left: undefined, right: undefined };
|
|
228
|
-
}
|
|
229
|
-
export const NonExistenceProof = {
|
|
230
|
-
encode(message, writer = _m0.Writer.create()) {
|
|
231
|
-
if (message.key.length !== 0) {
|
|
232
|
-
writer.uint32(10).bytes(message.key);
|
|
233
|
-
}
|
|
234
|
-
if (message.left !== undefined) {
|
|
235
|
-
ExistenceProof.encode(message.left, writer.uint32(18).fork()).ldelim();
|
|
236
|
-
}
|
|
237
|
-
if (message.right !== undefined) {
|
|
238
|
-
ExistenceProof.encode(message.right, writer.uint32(26).fork()).ldelim();
|
|
239
|
-
}
|
|
240
|
-
return writer;
|
|
241
|
-
},
|
|
242
|
-
decode(input, length) {
|
|
243
|
-
const reader = input instanceof _m0.Reader ? input : new _m0.Reader(input);
|
|
244
|
-
let end = length === undefined ? reader.len : reader.pos + length;
|
|
245
|
-
const message = createBaseNonExistenceProof();
|
|
246
|
-
while (reader.pos < end) {
|
|
247
|
-
const tag = reader.uint32();
|
|
248
|
-
switch (tag >>> 3) {
|
|
249
|
-
case 1:
|
|
250
|
-
message.key = reader.bytes();
|
|
251
|
-
break;
|
|
252
|
-
case 2:
|
|
253
|
-
message.left = ExistenceProof.decode(reader, reader.uint32());
|
|
254
|
-
break;
|
|
255
|
-
case 3:
|
|
256
|
-
message.right = ExistenceProof.decode(reader, reader.uint32());
|
|
257
|
-
break;
|
|
258
|
-
default:
|
|
259
|
-
reader.skipType(tag & 7);
|
|
260
|
-
break;
|
|
261
|
-
}
|
|
262
|
-
}
|
|
263
|
-
return message;
|
|
264
|
-
},
|
|
265
|
-
fromJSON(object) {
|
|
266
|
-
return {
|
|
267
|
-
key: isSet(object.key) ? bytesFromBase64(object.key) : new Uint8Array(),
|
|
268
|
-
left: isSet(object.left) ? ExistenceProof.fromJSON(object.left) : undefined,
|
|
269
|
-
right: isSet(object.right) ? ExistenceProof.fromJSON(object.right) : undefined,
|
|
270
|
-
};
|
|
271
|
-
},
|
|
272
|
-
toJSON(message) {
|
|
273
|
-
const obj = {};
|
|
274
|
-
message.key !== undefined
|
|
275
|
-
&& (obj.key = base64FromBytes(message.key !== undefined ? message.key : new Uint8Array()));
|
|
276
|
-
message.left !== undefined && (obj.left = message.left ? ExistenceProof.toJSON(message.left) : undefined);
|
|
277
|
-
message.right !== undefined && (obj.right = message.right ? ExistenceProof.toJSON(message.right) : undefined);
|
|
278
|
-
return obj;
|
|
279
|
-
},
|
|
280
|
-
fromPartial(object) {
|
|
281
|
-
const message = createBaseNonExistenceProof();
|
|
282
|
-
message.key = object.key ?? new Uint8Array();
|
|
283
|
-
message.left = (object.left !== undefined && object.left !== null)
|
|
284
|
-
? ExistenceProof.fromPartial(object.left)
|
|
285
|
-
: undefined;
|
|
286
|
-
message.right = (object.right !== undefined && object.right !== null)
|
|
287
|
-
? ExistenceProof.fromPartial(object.right)
|
|
288
|
-
: undefined;
|
|
289
|
-
return message;
|
|
290
|
-
},
|
|
291
|
-
};
|
|
292
|
-
function createBaseCommitmentProof() {
|
|
293
|
-
return { exist: undefined, nonexist: undefined, batch: undefined, compressed: undefined };
|
|
294
|
-
}
|
|
295
|
-
export const CommitmentProof = {
|
|
296
|
-
encode(message, writer = _m0.Writer.create()) {
|
|
297
|
-
if (message.exist !== undefined) {
|
|
298
|
-
ExistenceProof.encode(message.exist, writer.uint32(10).fork()).ldelim();
|
|
299
|
-
}
|
|
300
|
-
if (message.nonexist !== undefined) {
|
|
301
|
-
NonExistenceProof.encode(message.nonexist, writer.uint32(18).fork()).ldelim();
|
|
302
|
-
}
|
|
303
|
-
if (message.batch !== undefined) {
|
|
304
|
-
BatchProof.encode(message.batch, writer.uint32(26).fork()).ldelim();
|
|
305
|
-
}
|
|
306
|
-
if (message.compressed !== undefined) {
|
|
307
|
-
CompressedBatchProof.encode(message.compressed, writer.uint32(34).fork()).ldelim();
|
|
308
|
-
}
|
|
309
|
-
return writer;
|
|
310
|
-
},
|
|
311
|
-
decode(input, length) {
|
|
312
|
-
const reader = input instanceof _m0.Reader ? input : new _m0.Reader(input);
|
|
313
|
-
let end = length === undefined ? reader.len : reader.pos + length;
|
|
314
|
-
const message = createBaseCommitmentProof();
|
|
315
|
-
while (reader.pos < end) {
|
|
316
|
-
const tag = reader.uint32();
|
|
317
|
-
switch (tag >>> 3) {
|
|
318
|
-
case 1:
|
|
319
|
-
message.exist = ExistenceProof.decode(reader, reader.uint32());
|
|
320
|
-
break;
|
|
321
|
-
case 2:
|
|
322
|
-
message.nonexist = NonExistenceProof.decode(reader, reader.uint32());
|
|
323
|
-
break;
|
|
324
|
-
case 3:
|
|
325
|
-
message.batch = BatchProof.decode(reader, reader.uint32());
|
|
326
|
-
break;
|
|
327
|
-
case 4:
|
|
328
|
-
message.compressed = CompressedBatchProof.decode(reader, reader.uint32());
|
|
329
|
-
break;
|
|
330
|
-
default:
|
|
331
|
-
reader.skipType(tag & 7);
|
|
332
|
-
break;
|
|
333
|
-
}
|
|
334
|
-
}
|
|
335
|
-
return message;
|
|
336
|
-
},
|
|
337
|
-
fromJSON(object) {
|
|
338
|
-
return {
|
|
339
|
-
exist: isSet(object.exist) ? ExistenceProof.fromJSON(object.exist) : undefined,
|
|
340
|
-
nonexist: isSet(object.nonexist) ? NonExistenceProof.fromJSON(object.nonexist) : undefined,
|
|
341
|
-
batch: isSet(object.batch) ? BatchProof.fromJSON(object.batch) : undefined,
|
|
342
|
-
compressed: isSet(object.compressed) ? CompressedBatchProof.fromJSON(object.compressed) : undefined,
|
|
343
|
-
};
|
|
344
|
-
},
|
|
345
|
-
toJSON(message) {
|
|
346
|
-
const obj = {};
|
|
347
|
-
message.exist !== undefined && (obj.exist = message.exist ? ExistenceProof.toJSON(message.exist) : undefined);
|
|
348
|
-
message.nonexist !== undefined
|
|
349
|
-
&& (obj.nonexist = message.nonexist ? NonExistenceProof.toJSON(message.nonexist) : undefined);
|
|
350
|
-
message.batch !== undefined && (obj.batch = message.batch ? BatchProof.toJSON(message.batch) : undefined);
|
|
351
|
-
message.compressed !== undefined
|
|
352
|
-
&& (obj.compressed = message.compressed ? CompressedBatchProof.toJSON(message.compressed) : undefined);
|
|
353
|
-
return obj;
|
|
354
|
-
},
|
|
355
|
-
fromPartial(object) {
|
|
356
|
-
const message = createBaseCommitmentProof();
|
|
357
|
-
message.exist = (object.exist !== undefined && object.exist !== null)
|
|
358
|
-
? ExistenceProof.fromPartial(object.exist)
|
|
359
|
-
: undefined;
|
|
360
|
-
message.nonexist = (object.nonexist !== undefined && object.nonexist !== null)
|
|
361
|
-
? NonExistenceProof.fromPartial(object.nonexist)
|
|
362
|
-
: undefined;
|
|
363
|
-
message.batch = (object.batch !== undefined && object.batch !== null)
|
|
364
|
-
? BatchProof.fromPartial(object.batch)
|
|
365
|
-
: undefined;
|
|
366
|
-
message.compressed = (object.compressed !== undefined && object.compressed !== null)
|
|
367
|
-
? CompressedBatchProof.fromPartial(object.compressed)
|
|
368
|
-
: undefined;
|
|
369
|
-
return message;
|
|
370
|
-
},
|
|
371
|
-
};
|
|
372
|
-
function createBaseLeafOp() {
|
|
373
|
-
return { hash: 0, prehashKey: 0, prehashValue: 0, length: 0, prefix: new Uint8Array() };
|
|
374
|
-
}
|
|
375
|
-
export const LeafOp = {
|
|
376
|
-
encode(message, writer = _m0.Writer.create()) {
|
|
377
|
-
if (message.hash !== 0) {
|
|
378
|
-
writer.uint32(8).int32(message.hash);
|
|
379
|
-
}
|
|
380
|
-
if (message.prehashKey !== 0) {
|
|
381
|
-
writer.uint32(16).int32(message.prehashKey);
|
|
382
|
-
}
|
|
383
|
-
if (message.prehashValue !== 0) {
|
|
384
|
-
writer.uint32(24).int32(message.prehashValue);
|
|
385
|
-
}
|
|
386
|
-
if (message.length !== 0) {
|
|
387
|
-
writer.uint32(32).int32(message.length);
|
|
388
|
-
}
|
|
389
|
-
if (message.prefix.length !== 0) {
|
|
390
|
-
writer.uint32(42).bytes(message.prefix);
|
|
391
|
-
}
|
|
392
|
-
return writer;
|
|
393
|
-
},
|
|
394
|
-
decode(input, length) {
|
|
395
|
-
const reader = input instanceof _m0.Reader ? input : new _m0.Reader(input);
|
|
396
|
-
let end = length === undefined ? reader.len : reader.pos + length;
|
|
397
|
-
const message = createBaseLeafOp();
|
|
398
|
-
while (reader.pos < end) {
|
|
399
|
-
const tag = reader.uint32();
|
|
400
|
-
switch (tag >>> 3) {
|
|
401
|
-
case 1:
|
|
402
|
-
message.hash = reader.int32();
|
|
403
|
-
break;
|
|
404
|
-
case 2:
|
|
405
|
-
message.prehashKey = reader.int32();
|
|
406
|
-
break;
|
|
407
|
-
case 3:
|
|
408
|
-
message.prehashValue = reader.int32();
|
|
409
|
-
break;
|
|
410
|
-
case 4:
|
|
411
|
-
message.length = reader.int32();
|
|
412
|
-
break;
|
|
413
|
-
case 5:
|
|
414
|
-
message.prefix = reader.bytes();
|
|
415
|
-
break;
|
|
416
|
-
default:
|
|
417
|
-
reader.skipType(tag & 7);
|
|
418
|
-
break;
|
|
419
|
-
}
|
|
420
|
-
}
|
|
421
|
-
return message;
|
|
422
|
-
},
|
|
423
|
-
fromJSON(object) {
|
|
424
|
-
return {
|
|
425
|
-
hash: isSet(object.hash) ? hashOpFromJSON(object.hash) : 0,
|
|
426
|
-
prehashKey: isSet(object.prehashKey) ? hashOpFromJSON(object.prehashKey) : 0,
|
|
427
|
-
prehashValue: isSet(object.prehashValue) ? hashOpFromJSON(object.prehashValue) : 0,
|
|
428
|
-
length: isSet(object.length) ? lengthOpFromJSON(object.length) : 0,
|
|
429
|
-
prefix: isSet(object.prefix) ? bytesFromBase64(object.prefix) : new Uint8Array(),
|
|
430
|
-
};
|
|
431
|
-
},
|
|
432
|
-
toJSON(message) {
|
|
433
|
-
const obj = {};
|
|
434
|
-
message.hash !== undefined && (obj.hash = hashOpToJSON(message.hash));
|
|
435
|
-
message.prehashKey !== undefined && (obj.prehashKey = hashOpToJSON(message.prehashKey));
|
|
436
|
-
message.prehashValue !== undefined && (obj.prehashValue = hashOpToJSON(message.prehashValue));
|
|
437
|
-
message.length !== undefined && (obj.length = lengthOpToJSON(message.length));
|
|
438
|
-
message.prefix !== undefined
|
|
439
|
-
&& (obj.prefix = base64FromBytes(message.prefix !== undefined ? message.prefix : new Uint8Array()));
|
|
440
|
-
return obj;
|
|
441
|
-
},
|
|
442
|
-
fromPartial(object) {
|
|
443
|
-
const message = createBaseLeafOp();
|
|
444
|
-
message.hash = object.hash ?? 0;
|
|
445
|
-
message.prehashKey = object.prehashKey ?? 0;
|
|
446
|
-
message.prehashValue = object.prehashValue ?? 0;
|
|
447
|
-
message.length = object.length ?? 0;
|
|
448
|
-
message.prefix = object.prefix ?? new Uint8Array();
|
|
449
|
-
return message;
|
|
450
|
-
},
|
|
451
|
-
};
|
|
452
|
-
function createBaseInnerOp() {
|
|
453
|
-
return { hash: 0, prefix: new Uint8Array(), suffix: new Uint8Array() };
|
|
454
|
-
}
|
|
455
|
-
export const InnerOp = {
|
|
456
|
-
encode(message, writer = _m0.Writer.create()) {
|
|
457
|
-
if (message.hash !== 0) {
|
|
458
|
-
writer.uint32(8).int32(message.hash);
|
|
459
|
-
}
|
|
460
|
-
if (message.prefix.length !== 0) {
|
|
461
|
-
writer.uint32(18).bytes(message.prefix);
|
|
462
|
-
}
|
|
463
|
-
if (message.suffix.length !== 0) {
|
|
464
|
-
writer.uint32(26).bytes(message.suffix);
|
|
465
|
-
}
|
|
466
|
-
return writer;
|
|
467
|
-
},
|
|
468
|
-
decode(input, length) {
|
|
469
|
-
const reader = input instanceof _m0.Reader ? input : new _m0.Reader(input);
|
|
470
|
-
let end = length === undefined ? reader.len : reader.pos + length;
|
|
471
|
-
const message = createBaseInnerOp();
|
|
472
|
-
while (reader.pos < end) {
|
|
473
|
-
const tag = reader.uint32();
|
|
474
|
-
switch (tag >>> 3) {
|
|
475
|
-
case 1:
|
|
476
|
-
message.hash = reader.int32();
|
|
477
|
-
break;
|
|
478
|
-
case 2:
|
|
479
|
-
message.prefix = reader.bytes();
|
|
480
|
-
break;
|
|
481
|
-
case 3:
|
|
482
|
-
message.suffix = reader.bytes();
|
|
483
|
-
break;
|
|
484
|
-
default:
|
|
485
|
-
reader.skipType(tag & 7);
|
|
486
|
-
break;
|
|
487
|
-
}
|
|
488
|
-
}
|
|
489
|
-
return message;
|
|
490
|
-
},
|
|
491
|
-
fromJSON(object) {
|
|
492
|
-
return {
|
|
493
|
-
hash: isSet(object.hash) ? hashOpFromJSON(object.hash) : 0,
|
|
494
|
-
prefix: isSet(object.prefix) ? bytesFromBase64(object.prefix) : new Uint8Array(),
|
|
495
|
-
suffix: isSet(object.suffix) ? bytesFromBase64(object.suffix) : new Uint8Array(),
|
|
496
|
-
};
|
|
497
|
-
},
|
|
498
|
-
toJSON(message) {
|
|
499
|
-
const obj = {};
|
|
500
|
-
message.hash !== undefined && (obj.hash = hashOpToJSON(message.hash));
|
|
501
|
-
message.prefix !== undefined
|
|
502
|
-
&& (obj.prefix = base64FromBytes(message.prefix !== undefined ? message.prefix : new Uint8Array()));
|
|
503
|
-
message.suffix !== undefined
|
|
504
|
-
&& (obj.suffix = base64FromBytes(message.suffix !== undefined ? message.suffix : new Uint8Array()));
|
|
505
|
-
return obj;
|
|
506
|
-
},
|
|
507
|
-
fromPartial(object) {
|
|
508
|
-
const message = createBaseInnerOp();
|
|
509
|
-
message.hash = object.hash ?? 0;
|
|
510
|
-
message.prefix = object.prefix ?? new Uint8Array();
|
|
511
|
-
message.suffix = object.suffix ?? new Uint8Array();
|
|
512
|
-
return message;
|
|
513
|
-
},
|
|
514
|
-
};
|
|
515
|
-
function createBaseProofSpec() {
|
|
516
|
-
return { leafSpec: undefined, innerSpec: undefined, maxDepth: 0, minDepth: 0 };
|
|
517
|
-
}
|
|
518
|
-
export const ProofSpec = {
|
|
519
|
-
encode(message, writer = _m0.Writer.create()) {
|
|
520
|
-
if (message.leafSpec !== undefined) {
|
|
521
|
-
LeafOp.encode(message.leafSpec, writer.uint32(10).fork()).ldelim();
|
|
522
|
-
}
|
|
523
|
-
if (message.innerSpec !== undefined) {
|
|
524
|
-
InnerSpec.encode(message.innerSpec, writer.uint32(18).fork()).ldelim();
|
|
525
|
-
}
|
|
526
|
-
if (message.maxDepth !== 0) {
|
|
527
|
-
writer.uint32(24).int32(message.maxDepth);
|
|
528
|
-
}
|
|
529
|
-
if (message.minDepth !== 0) {
|
|
530
|
-
writer.uint32(32).int32(message.minDepth);
|
|
531
|
-
}
|
|
532
|
-
return writer;
|
|
533
|
-
},
|
|
534
|
-
decode(input, length) {
|
|
535
|
-
const reader = input instanceof _m0.Reader ? input : new _m0.Reader(input);
|
|
536
|
-
let end = length === undefined ? reader.len : reader.pos + length;
|
|
537
|
-
const message = createBaseProofSpec();
|
|
538
|
-
while (reader.pos < end) {
|
|
539
|
-
const tag = reader.uint32();
|
|
540
|
-
switch (tag >>> 3) {
|
|
541
|
-
case 1:
|
|
542
|
-
message.leafSpec = LeafOp.decode(reader, reader.uint32());
|
|
543
|
-
break;
|
|
544
|
-
case 2:
|
|
545
|
-
message.innerSpec = InnerSpec.decode(reader, reader.uint32());
|
|
546
|
-
break;
|
|
547
|
-
case 3:
|
|
548
|
-
message.maxDepth = reader.int32();
|
|
549
|
-
break;
|
|
550
|
-
case 4:
|
|
551
|
-
message.minDepth = reader.int32();
|
|
552
|
-
break;
|
|
553
|
-
default:
|
|
554
|
-
reader.skipType(tag & 7);
|
|
555
|
-
break;
|
|
556
|
-
}
|
|
557
|
-
}
|
|
558
|
-
return message;
|
|
559
|
-
},
|
|
560
|
-
fromJSON(object) {
|
|
561
|
-
return {
|
|
562
|
-
leafSpec: isSet(object.leafSpec) ? LeafOp.fromJSON(object.leafSpec) : undefined,
|
|
563
|
-
innerSpec: isSet(object.innerSpec) ? InnerSpec.fromJSON(object.innerSpec) : undefined,
|
|
564
|
-
maxDepth: isSet(object.maxDepth) ? Number(object.maxDepth) : 0,
|
|
565
|
-
minDepth: isSet(object.minDepth) ? Number(object.minDepth) : 0,
|
|
566
|
-
};
|
|
567
|
-
},
|
|
568
|
-
toJSON(message) {
|
|
569
|
-
const obj = {};
|
|
570
|
-
message.leafSpec !== undefined && (obj.leafSpec = message.leafSpec ? LeafOp.toJSON(message.leafSpec) : undefined);
|
|
571
|
-
message.innerSpec !== undefined
|
|
572
|
-
&& (obj.innerSpec = message.innerSpec ? InnerSpec.toJSON(message.innerSpec) : undefined);
|
|
573
|
-
message.maxDepth !== undefined && (obj.maxDepth = Math.round(message.maxDepth));
|
|
574
|
-
message.minDepth !== undefined && (obj.minDepth = Math.round(message.minDepth));
|
|
575
|
-
return obj;
|
|
576
|
-
},
|
|
577
|
-
fromPartial(object) {
|
|
578
|
-
const message = createBaseProofSpec();
|
|
579
|
-
message.leafSpec = (object.leafSpec !== undefined && object.leafSpec !== null)
|
|
580
|
-
? LeafOp.fromPartial(object.leafSpec)
|
|
581
|
-
: undefined;
|
|
582
|
-
message.innerSpec = (object.innerSpec !== undefined && object.innerSpec !== null)
|
|
583
|
-
? InnerSpec.fromPartial(object.innerSpec)
|
|
584
|
-
: undefined;
|
|
585
|
-
message.maxDepth = object.maxDepth ?? 0;
|
|
586
|
-
message.minDepth = object.minDepth ?? 0;
|
|
587
|
-
return message;
|
|
588
|
-
},
|
|
589
|
-
};
|
|
590
|
-
function createBaseInnerSpec() {
|
|
591
|
-
return {
|
|
592
|
-
childOrder: [],
|
|
593
|
-
childSize: 0,
|
|
594
|
-
minPrefixLength: 0,
|
|
595
|
-
maxPrefixLength: 0,
|
|
596
|
-
emptyChild: new Uint8Array(),
|
|
597
|
-
hash: 0,
|
|
598
|
-
};
|
|
599
|
-
}
|
|
600
|
-
export const InnerSpec = {
|
|
601
|
-
encode(message, writer = _m0.Writer.create()) {
|
|
602
|
-
writer.uint32(10).fork();
|
|
603
|
-
for (const v of message.childOrder) {
|
|
604
|
-
writer.int32(v);
|
|
605
|
-
}
|
|
606
|
-
writer.ldelim();
|
|
607
|
-
if (message.childSize !== 0) {
|
|
608
|
-
writer.uint32(16).int32(message.childSize);
|
|
609
|
-
}
|
|
610
|
-
if (message.minPrefixLength !== 0) {
|
|
611
|
-
writer.uint32(24).int32(message.minPrefixLength);
|
|
612
|
-
}
|
|
613
|
-
if (message.maxPrefixLength !== 0) {
|
|
614
|
-
writer.uint32(32).int32(message.maxPrefixLength);
|
|
615
|
-
}
|
|
616
|
-
if (message.emptyChild.length !== 0) {
|
|
617
|
-
writer.uint32(42).bytes(message.emptyChild);
|
|
618
|
-
}
|
|
619
|
-
if (message.hash !== 0) {
|
|
620
|
-
writer.uint32(48).int32(message.hash);
|
|
621
|
-
}
|
|
622
|
-
return writer;
|
|
623
|
-
},
|
|
624
|
-
decode(input, length) {
|
|
625
|
-
const reader = input instanceof _m0.Reader ? input : new _m0.Reader(input);
|
|
626
|
-
let end = length === undefined ? reader.len : reader.pos + length;
|
|
627
|
-
const message = createBaseInnerSpec();
|
|
628
|
-
while (reader.pos < end) {
|
|
629
|
-
const tag = reader.uint32();
|
|
630
|
-
switch (tag >>> 3) {
|
|
631
|
-
case 1:
|
|
632
|
-
if ((tag & 7) === 2) {
|
|
633
|
-
const end2 = reader.uint32() + reader.pos;
|
|
634
|
-
while (reader.pos < end2) {
|
|
635
|
-
message.childOrder.push(reader.int32());
|
|
636
|
-
}
|
|
637
|
-
}
|
|
638
|
-
else {
|
|
639
|
-
message.childOrder.push(reader.int32());
|
|
640
|
-
}
|
|
641
|
-
break;
|
|
642
|
-
case 2:
|
|
643
|
-
message.childSize = reader.int32();
|
|
644
|
-
break;
|
|
645
|
-
case 3:
|
|
646
|
-
message.minPrefixLength = reader.int32();
|
|
647
|
-
break;
|
|
648
|
-
case 4:
|
|
649
|
-
message.maxPrefixLength = reader.int32();
|
|
650
|
-
break;
|
|
651
|
-
case 5:
|
|
652
|
-
message.emptyChild = reader.bytes();
|
|
653
|
-
break;
|
|
654
|
-
case 6:
|
|
655
|
-
message.hash = reader.int32();
|
|
656
|
-
break;
|
|
657
|
-
default:
|
|
658
|
-
reader.skipType(tag & 7);
|
|
659
|
-
break;
|
|
660
|
-
}
|
|
661
|
-
}
|
|
662
|
-
return message;
|
|
663
|
-
},
|
|
664
|
-
fromJSON(object) {
|
|
665
|
-
return {
|
|
666
|
-
childOrder: Array.isArray(object?.childOrder) ? object.childOrder.map((e) => Number(e)) : [],
|
|
667
|
-
childSize: isSet(object.childSize) ? Number(object.childSize) : 0,
|
|
668
|
-
minPrefixLength: isSet(object.minPrefixLength) ? Number(object.minPrefixLength) : 0,
|
|
669
|
-
maxPrefixLength: isSet(object.maxPrefixLength) ? Number(object.maxPrefixLength) : 0,
|
|
670
|
-
emptyChild: isSet(object.emptyChild) ? bytesFromBase64(object.emptyChild) : new Uint8Array(),
|
|
671
|
-
hash: isSet(object.hash) ? hashOpFromJSON(object.hash) : 0,
|
|
672
|
-
};
|
|
673
|
-
},
|
|
674
|
-
toJSON(message) {
|
|
675
|
-
const obj = {};
|
|
676
|
-
if (message.childOrder) {
|
|
677
|
-
obj.childOrder = message.childOrder.map((e) => Math.round(e));
|
|
678
|
-
}
|
|
679
|
-
else {
|
|
680
|
-
obj.childOrder = [];
|
|
681
|
-
}
|
|
682
|
-
message.childSize !== undefined && (obj.childSize = Math.round(message.childSize));
|
|
683
|
-
message.minPrefixLength !== undefined && (obj.minPrefixLength = Math.round(message.minPrefixLength));
|
|
684
|
-
message.maxPrefixLength !== undefined && (obj.maxPrefixLength = Math.round(message.maxPrefixLength));
|
|
685
|
-
message.emptyChild !== undefined
|
|
686
|
-
&& (obj.emptyChild = base64FromBytes(message.emptyChild !== undefined ? message.emptyChild : new Uint8Array()));
|
|
687
|
-
message.hash !== undefined && (obj.hash = hashOpToJSON(message.hash));
|
|
688
|
-
return obj;
|
|
689
|
-
},
|
|
690
|
-
fromPartial(object) {
|
|
691
|
-
const message = createBaseInnerSpec();
|
|
692
|
-
message.childOrder = object.childOrder?.map((e) => e) || [];
|
|
693
|
-
message.childSize = object.childSize ?? 0;
|
|
694
|
-
message.minPrefixLength = object.minPrefixLength ?? 0;
|
|
695
|
-
message.maxPrefixLength = object.maxPrefixLength ?? 0;
|
|
696
|
-
message.emptyChild = object.emptyChild ?? new Uint8Array();
|
|
697
|
-
message.hash = object.hash ?? 0;
|
|
698
|
-
return message;
|
|
699
|
-
},
|
|
700
|
-
};
|
|
701
|
-
function createBaseBatchProof() {
|
|
702
|
-
return { entries: [] };
|
|
703
|
-
}
|
|
704
|
-
export const BatchProof = {
|
|
705
|
-
encode(message, writer = _m0.Writer.create()) {
|
|
706
|
-
for (const v of message.entries) {
|
|
707
|
-
BatchEntry.encode(v, writer.uint32(10).fork()).ldelim();
|
|
708
|
-
}
|
|
709
|
-
return writer;
|
|
710
|
-
},
|
|
711
|
-
decode(input, length) {
|
|
712
|
-
const reader = input instanceof _m0.Reader ? input : new _m0.Reader(input);
|
|
713
|
-
let end = length === undefined ? reader.len : reader.pos + length;
|
|
714
|
-
const message = createBaseBatchProof();
|
|
715
|
-
while (reader.pos < end) {
|
|
716
|
-
const tag = reader.uint32();
|
|
717
|
-
switch (tag >>> 3) {
|
|
718
|
-
case 1:
|
|
719
|
-
message.entries.push(BatchEntry.decode(reader, reader.uint32()));
|
|
720
|
-
break;
|
|
721
|
-
default:
|
|
722
|
-
reader.skipType(tag & 7);
|
|
723
|
-
break;
|
|
724
|
-
}
|
|
725
|
-
}
|
|
726
|
-
return message;
|
|
727
|
-
},
|
|
728
|
-
fromJSON(object) {
|
|
729
|
-
return { entries: Array.isArray(object?.entries) ? object.entries.map((e) => BatchEntry.fromJSON(e)) : [] };
|
|
730
|
-
},
|
|
731
|
-
toJSON(message) {
|
|
732
|
-
const obj = {};
|
|
733
|
-
if (message.entries) {
|
|
734
|
-
obj.entries = message.entries.map((e) => e ? BatchEntry.toJSON(e) : undefined);
|
|
735
|
-
}
|
|
736
|
-
else {
|
|
737
|
-
obj.entries = [];
|
|
738
|
-
}
|
|
739
|
-
return obj;
|
|
740
|
-
},
|
|
741
|
-
fromPartial(object) {
|
|
742
|
-
const message = createBaseBatchProof();
|
|
743
|
-
message.entries = object.entries?.map((e) => BatchEntry.fromPartial(e)) || [];
|
|
744
|
-
return message;
|
|
745
|
-
},
|
|
746
|
-
};
|
|
747
|
-
function createBaseBatchEntry() {
|
|
748
|
-
return { exist: undefined, nonexist: undefined };
|
|
749
|
-
}
|
|
750
|
-
export const BatchEntry = {
|
|
751
|
-
encode(message, writer = _m0.Writer.create()) {
|
|
752
|
-
if (message.exist !== undefined) {
|
|
753
|
-
ExistenceProof.encode(message.exist, writer.uint32(10).fork()).ldelim();
|
|
754
|
-
}
|
|
755
|
-
if (message.nonexist !== undefined) {
|
|
756
|
-
NonExistenceProof.encode(message.nonexist, writer.uint32(18).fork()).ldelim();
|
|
757
|
-
}
|
|
758
|
-
return writer;
|
|
759
|
-
},
|
|
760
|
-
decode(input, length) {
|
|
761
|
-
const reader = input instanceof _m0.Reader ? input : new _m0.Reader(input);
|
|
762
|
-
let end = length === undefined ? reader.len : reader.pos + length;
|
|
763
|
-
const message = createBaseBatchEntry();
|
|
764
|
-
while (reader.pos < end) {
|
|
765
|
-
const tag = reader.uint32();
|
|
766
|
-
switch (tag >>> 3) {
|
|
767
|
-
case 1:
|
|
768
|
-
message.exist = ExistenceProof.decode(reader, reader.uint32());
|
|
769
|
-
break;
|
|
770
|
-
case 2:
|
|
771
|
-
message.nonexist = NonExistenceProof.decode(reader, reader.uint32());
|
|
772
|
-
break;
|
|
773
|
-
default:
|
|
774
|
-
reader.skipType(tag & 7);
|
|
775
|
-
break;
|
|
776
|
-
}
|
|
777
|
-
}
|
|
778
|
-
return message;
|
|
779
|
-
},
|
|
780
|
-
fromJSON(object) {
|
|
781
|
-
return {
|
|
782
|
-
exist: isSet(object.exist) ? ExistenceProof.fromJSON(object.exist) : undefined,
|
|
783
|
-
nonexist: isSet(object.nonexist) ? NonExistenceProof.fromJSON(object.nonexist) : undefined,
|
|
784
|
-
};
|
|
785
|
-
},
|
|
786
|
-
toJSON(message) {
|
|
787
|
-
const obj = {};
|
|
788
|
-
message.exist !== undefined && (obj.exist = message.exist ? ExistenceProof.toJSON(message.exist) : undefined);
|
|
789
|
-
message.nonexist !== undefined
|
|
790
|
-
&& (obj.nonexist = message.nonexist ? NonExistenceProof.toJSON(message.nonexist) : undefined);
|
|
791
|
-
return obj;
|
|
792
|
-
},
|
|
793
|
-
fromPartial(object) {
|
|
794
|
-
const message = createBaseBatchEntry();
|
|
795
|
-
message.exist = (object.exist !== undefined && object.exist !== null)
|
|
796
|
-
? ExistenceProof.fromPartial(object.exist)
|
|
797
|
-
: undefined;
|
|
798
|
-
message.nonexist = (object.nonexist !== undefined && object.nonexist !== null)
|
|
799
|
-
? NonExistenceProof.fromPartial(object.nonexist)
|
|
800
|
-
: undefined;
|
|
801
|
-
return message;
|
|
802
|
-
},
|
|
803
|
-
};
|
|
804
|
-
function createBaseCompressedBatchProof() {
|
|
805
|
-
return { entries: [], lookupInners: [] };
|
|
806
|
-
}
|
|
807
|
-
export const CompressedBatchProof = {
|
|
808
|
-
encode(message, writer = _m0.Writer.create()) {
|
|
809
|
-
for (const v of message.entries) {
|
|
810
|
-
CompressedBatchEntry.encode(v, writer.uint32(10).fork()).ldelim();
|
|
811
|
-
}
|
|
812
|
-
for (const v of message.lookupInners) {
|
|
813
|
-
InnerOp.encode(v, writer.uint32(18).fork()).ldelim();
|
|
814
|
-
}
|
|
815
|
-
return writer;
|
|
816
|
-
},
|
|
817
|
-
decode(input, length) {
|
|
818
|
-
const reader = input instanceof _m0.Reader ? input : new _m0.Reader(input);
|
|
819
|
-
let end = length === undefined ? reader.len : reader.pos + length;
|
|
820
|
-
const message = createBaseCompressedBatchProof();
|
|
821
|
-
while (reader.pos < end) {
|
|
822
|
-
const tag = reader.uint32();
|
|
823
|
-
switch (tag >>> 3) {
|
|
824
|
-
case 1:
|
|
825
|
-
message.entries.push(CompressedBatchEntry.decode(reader, reader.uint32()));
|
|
826
|
-
break;
|
|
827
|
-
case 2:
|
|
828
|
-
message.lookupInners.push(InnerOp.decode(reader, reader.uint32()));
|
|
829
|
-
break;
|
|
830
|
-
default:
|
|
831
|
-
reader.skipType(tag & 7);
|
|
832
|
-
break;
|
|
833
|
-
}
|
|
834
|
-
}
|
|
835
|
-
return message;
|
|
836
|
-
},
|
|
837
|
-
fromJSON(object) {
|
|
838
|
-
return {
|
|
839
|
-
entries: Array.isArray(object?.entries) ? object.entries.map((e) => CompressedBatchEntry.fromJSON(e)) : [],
|
|
840
|
-
lookupInners: Array.isArray(object?.lookupInners) ? object.lookupInners.map((e) => InnerOp.fromJSON(e)) : [],
|
|
841
|
-
};
|
|
842
|
-
},
|
|
843
|
-
toJSON(message) {
|
|
844
|
-
const obj = {};
|
|
845
|
-
if (message.entries) {
|
|
846
|
-
obj.entries = message.entries.map((e) => e ? CompressedBatchEntry.toJSON(e) : undefined);
|
|
847
|
-
}
|
|
848
|
-
else {
|
|
849
|
-
obj.entries = [];
|
|
850
|
-
}
|
|
851
|
-
if (message.lookupInners) {
|
|
852
|
-
obj.lookupInners = message.lookupInners.map((e) => e ? InnerOp.toJSON(e) : undefined);
|
|
853
|
-
}
|
|
854
|
-
else {
|
|
855
|
-
obj.lookupInners = [];
|
|
856
|
-
}
|
|
857
|
-
return obj;
|
|
858
|
-
},
|
|
859
|
-
fromPartial(object) {
|
|
860
|
-
const message = createBaseCompressedBatchProof();
|
|
861
|
-
message.entries = object.entries?.map((e) => CompressedBatchEntry.fromPartial(e)) || [];
|
|
862
|
-
message.lookupInners = object.lookupInners?.map((e) => InnerOp.fromPartial(e)) || [];
|
|
863
|
-
return message;
|
|
864
|
-
},
|
|
865
|
-
};
|
|
866
|
-
function createBaseCompressedBatchEntry() {
|
|
867
|
-
return { exist: undefined, nonexist: undefined };
|
|
868
|
-
}
|
|
869
|
-
export const CompressedBatchEntry = {
|
|
870
|
-
encode(message, writer = _m0.Writer.create()) {
|
|
871
|
-
if (message.exist !== undefined) {
|
|
872
|
-
CompressedExistenceProof.encode(message.exist, writer.uint32(10).fork()).ldelim();
|
|
873
|
-
}
|
|
874
|
-
if (message.nonexist !== undefined) {
|
|
875
|
-
CompressedNonExistenceProof.encode(message.nonexist, writer.uint32(18).fork()).ldelim();
|
|
876
|
-
}
|
|
877
|
-
return writer;
|
|
878
|
-
},
|
|
879
|
-
decode(input, length) {
|
|
880
|
-
const reader = input instanceof _m0.Reader ? input : new _m0.Reader(input);
|
|
881
|
-
let end = length === undefined ? reader.len : reader.pos + length;
|
|
882
|
-
const message = createBaseCompressedBatchEntry();
|
|
883
|
-
while (reader.pos < end) {
|
|
884
|
-
const tag = reader.uint32();
|
|
885
|
-
switch (tag >>> 3) {
|
|
886
|
-
case 1:
|
|
887
|
-
message.exist = CompressedExistenceProof.decode(reader, reader.uint32());
|
|
888
|
-
break;
|
|
889
|
-
case 2:
|
|
890
|
-
message.nonexist = CompressedNonExistenceProof.decode(reader, reader.uint32());
|
|
891
|
-
break;
|
|
892
|
-
default:
|
|
893
|
-
reader.skipType(tag & 7);
|
|
894
|
-
break;
|
|
895
|
-
}
|
|
896
|
-
}
|
|
897
|
-
return message;
|
|
898
|
-
},
|
|
899
|
-
fromJSON(object) {
|
|
900
|
-
return {
|
|
901
|
-
exist: isSet(object.exist) ? CompressedExistenceProof.fromJSON(object.exist) : undefined,
|
|
902
|
-
nonexist: isSet(object.nonexist) ? CompressedNonExistenceProof.fromJSON(object.nonexist) : undefined,
|
|
903
|
-
};
|
|
904
|
-
},
|
|
905
|
-
toJSON(message) {
|
|
906
|
-
const obj = {};
|
|
907
|
-
message.exist !== undefined
|
|
908
|
-
&& (obj.exist = message.exist ? CompressedExistenceProof.toJSON(message.exist) : undefined);
|
|
909
|
-
message.nonexist !== undefined
|
|
910
|
-
&& (obj.nonexist = message.nonexist ? CompressedNonExistenceProof.toJSON(message.nonexist) : undefined);
|
|
911
|
-
return obj;
|
|
912
|
-
},
|
|
913
|
-
fromPartial(object) {
|
|
914
|
-
const message = createBaseCompressedBatchEntry();
|
|
915
|
-
message.exist = (object.exist !== undefined && object.exist !== null)
|
|
916
|
-
? CompressedExistenceProof.fromPartial(object.exist)
|
|
917
|
-
: undefined;
|
|
918
|
-
message.nonexist = (object.nonexist !== undefined && object.nonexist !== null)
|
|
919
|
-
? CompressedNonExistenceProof.fromPartial(object.nonexist)
|
|
920
|
-
: undefined;
|
|
921
|
-
return message;
|
|
922
|
-
},
|
|
923
|
-
};
|
|
924
|
-
function createBaseCompressedExistenceProof() {
|
|
925
|
-
return { key: new Uint8Array(), value: new Uint8Array(), leaf: undefined, path: [] };
|
|
926
|
-
}
|
|
927
|
-
export const CompressedExistenceProof = {
|
|
928
|
-
encode(message, writer = _m0.Writer.create()) {
|
|
929
|
-
if (message.key.length !== 0) {
|
|
930
|
-
writer.uint32(10).bytes(message.key);
|
|
931
|
-
}
|
|
932
|
-
if (message.value.length !== 0) {
|
|
933
|
-
writer.uint32(18).bytes(message.value);
|
|
934
|
-
}
|
|
935
|
-
if (message.leaf !== undefined) {
|
|
936
|
-
LeafOp.encode(message.leaf, writer.uint32(26).fork()).ldelim();
|
|
937
|
-
}
|
|
938
|
-
writer.uint32(34).fork();
|
|
939
|
-
for (const v of message.path) {
|
|
940
|
-
writer.int32(v);
|
|
941
|
-
}
|
|
942
|
-
writer.ldelim();
|
|
943
|
-
return writer;
|
|
944
|
-
},
|
|
945
|
-
decode(input, length) {
|
|
946
|
-
const reader = input instanceof _m0.Reader ? input : new _m0.Reader(input);
|
|
947
|
-
let end = length === undefined ? reader.len : reader.pos + length;
|
|
948
|
-
const message = createBaseCompressedExistenceProof();
|
|
949
|
-
while (reader.pos < end) {
|
|
950
|
-
const tag = reader.uint32();
|
|
951
|
-
switch (tag >>> 3) {
|
|
952
|
-
case 1:
|
|
953
|
-
message.key = reader.bytes();
|
|
954
|
-
break;
|
|
955
|
-
case 2:
|
|
956
|
-
message.value = reader.bytes();
|
|
957
|
-
break;
|
|
958
|
-
case 3:
|
|
959
|
-
message.leaf = LeafOp.decode(reader, reader.uint32());
|
|
960
|
-
break;
|
|
961
|
-
case 4:
|
|
962
|
-
if ((tag & 7) === 2) {
|
|
963
|
-
const end2 = reader.uint32() + reader.pos;
|
|
964
|
-
while (reader.pos < end2) {
|
|
965
|
-
message.path.push(reader.int32());
|
|
966
|
-
}
|
|
967
|
-
}
|
|
968
|
-
else {
|
|
969
|
-
message.path.push(reader.int32());
|
|
970
|
-
}
|
|
971
|
-
break;
|
|
972
|
-
default:
|
|
973
|
-
reader.skipType(tag & 7);
|
|
974
|
-
break;
|
|
975
|
-
}
|
|
976
|
-
}
|
|
977
|
-
return message;
|
|
978
|
-
},
|
|
979
|
-
fromJSON(object) {
|
|
980
|
-
return {
|
|
981
|
-
key: isSet(object.key) ? bytesFromBase64(object.key) : new Uint8Array(),
|
|
982
|
-
value: isSet(object.value) ? bytesFromBase64(object.value) : new Uint8Array(),
|
|
983
|
-
leaf: isSet(object.leaf) ? LeafOp.fromJSON(object.leaf) : undefined,
|
|
984
|
-
path: Array.isArray(object?.path) ? object.path.map((e) => Number(e)) : [],
|
|
985
|
-
};
|
|
986
|
-
},
|
|
987
|
-
toJSON(message) {
|
|
988
|
-
const obj = {};
|
|
989
|
-
message.key !== undefined
|
|
990
|
-
&& (obj.key = base64FromBytes(message.key !== undefined ? message.key : new Uint8Array()));
|
|
991
|
-
message.value !== undefined
|
|
992
|
-
&& (obj.value = base64FromBytes(message.value !== undefined ? message.value : new Uint8Array()));
|
|
993
|
-
message.leaf !== undefined && (obj.leaf = message.leaf ? LeafOp.toJSON(message.leaf) : undefined);
|
|
994
|
-
if (message.path) {
|
|
995
|
-
obj.path = message.path.map((e) => Math.round(e));
|
|
996
|
-
}
|
|
997
|
-
else {
|
|
998
|
-
obj.path = [];
|
|
999
|
-
}
|
|
1000
|
-
return obj;
|
|
1001
|
-
},
|
|
1002
|
-
fromPartial(object) {
|
|
1003
|
-
const message = createBaseCompressedExistenceProof();
|
|
1004
|
-
message.key = object.key ?? new Uint8Array();
|
|
1005
|
-
message.value = object.value ?? new Uint8Array();
|
|
1006
|
-
message.leaf = (object.leaf !== undefined && object.leaf !== null) ? LeafOp.fromPartial(object.leaf) : undefined;
|
|
1007
|
-
message.path = object.path?.map((e) => e) || [];
|
|
1008
|
-
return message;
|
|
1009
|
-
},
|
|
1010
|
-
};
|
|
1011
|
-
function createBaseCompressedNonExistenceProof() {
|
|
1012
|
-
return { key: new Uint8Array(), left: undefined, right: undefined };
|
|
1013
|
-
}
|
|
1014
|
-
export const CompressedNonExistenceProof = {
|
|
1015
|
-
encode(message, writer = _m0.Writer.create()) {
|
|
1016
|
-
if (message.key.length !== 0) {
|
|
1017
|
-
writer.uint32(10).bytes(message.key);
|
|
1018
|
-
}
|
|
1019
|
-
if (message.left !== undefined) {
|
|
1020
|
-
CompressedExistenceProof.encode(message.left, writer.uint32(18).fork()).ldelim();
|
|
1021
|
-
}
|
|
1022
|
-
if (message.right !== undefined) {
|
|
1023
|
-
CompressedExistenceProof.encode(message.right, writer.uint32(26).fork()).ldelim();
|
|
1024
|
-
}
|
|
1025
|
-
return writer;
|
|
1026
|
-
},
|
|
1027
|
-
decode(input, length) {
|
|
1028
|
-
const reader = input instanceof _m0.Reader ? input : new _m0.Reader(input);
|
|
1029
|
-
let end = length === undefined ? reader.len : reader.pos + length;
|
|
1030
|
-
const message = createBaseCompressedNonExistenceProof();
|
|
1031
|
-
while (reader.pos < end) {
|
|
1032
|
-
const tag = reader.uint32();
|
|
1033
|
-
switch (tag >>> 3) {
|
|
1034
|
-
case 1:
|
|
1035
|
-
message.key = reader.bytes();
|
|
1036
|
-
break;
|
|
1037
|
-
case 2:
|
|
1038
|
-
message.left = CompressedExistenceProof.decode(reader, reader.uint32());
|
|
1039
|
-
break;
|
|
1040
|
-
case 3:
|
|
1041
|
-
message.right = CompressedExistenceProof.decode(reader, reader.uint32());
|
|
1042
|
-
break;
|
|
1043
|
-
default:
|
|
1044
|
-
reader.skipType(tag & 7);
|
|
1045
|
-
break;
|
|
1046
|
-
}
|
|
1047
|
-
}
|
|
1048
|
-
return message;
|
|
1049
|
-
},
|
|
1050
|
-
fromJSON(object) {
|
|
1051
|
-
return {
|
|
1052
|
-
key: isSet(object.key) ? bytesFromBase64(object.key) : new Uint8Array(),
|
|
1053
|
-
left: isSet(object.left) ? CompressedExistenceProof.fromJSON(object.left) : undefined,
|
|
1054
|
-
right: isSet(object.right) ? CompressedExistenceProof.fromJSON(object.right) : undefined,
|
|
1055
|
-
};
|
|
1056
|
-
},
|
|
1057
|
-
toJSON(message) {
|
|
1058
|
-
const obj = {};
|
|
1059
|
-
message.key !== undefined
|
|
1060
|
-
&& (obj.key = base64FromBytes(message.key !== undefined ? message.key : new Uint8Array()));
|
|
1061
|
-
message.left !== undefined && (obj.left = message.left ? CompressedExistenceProof.toJSON(message.left) : undefined);
|
|
1062
|
-
message.right !== undefined
|
|
1063
|
-
&& (obj.right = message.right ? CompressedExistenceProof.toJSON(message.right) : undefined);
|
|
1064
|
-
return obj;
|
|
1065
|
-
},
|
|
1066
|
-
fromPartial(object) {
|
|
1067
|
-
const message = createBaseCompressedNonExistenceProof();
|
|
1068
|
-
message.key = object.key ?? new Uint8Array();
|
|
1069
|
-
message.left = (object.left !== undefined && object.left !== null)
|
|
1070
|
-
? CompressedExistenceProof.fromPartial(object.left)
|
|
1071
|
-
: undefined;
|
|
1072
|
-
message.right = (object.right !== undefined && object.right !== null)
|
|
1073
|
-
? CompressedExistenceProof.fromPartial(object.right)
|
|
1074
|
-
: undefined;
|
|
1075
|
-
return message;
|
|
1076
|
-
},
|
|
1077
|
-
};
|
|
1078
|
-
var globalThis = (() => {
|
|
1079
|
-
if (typeof globalThis !== "undefined") {
|
|
1080
|
-
return globalThis;
|
|
1081
|
-
}
|
|
1082
|
-
if (typeof self !== "undefined") {
|
|
1083
|
-
return self;
|
|
1084
|
-
}
|
|
1085
|
-
if (typeof window !== "undefined") {
|
|
1086
|
-
return window;
|
|
1087
|
-
}
|
|
1088
|
-
if (typeof global !== "undefined") {
|
|
1089
|
-
return global;
|
|
1090
|
-
}
|
|
1091
|
-
throw "Unable to locate global object";
|
|
1092
|
-
})();
|
|
1093
|
-
function bytesFromBase64(b64) {
|
|
1094
|
-
if (globalThis.Buffer) {
|
|
1095
|
-
return Uint8Array.from(globalThis.Buffer.from(b64, "base64"));
|
|
1096
|
-
}
|
|
1097
|
-
else {
|
|
1098
|
-
const bin = globalThis.atob(b64);
|
|
1099
|
-
const arr = new Uint8Array(bin.length);
|
|
1100
|
-
for (let i = 0; i < bin.length; ++i) {
|
|
1101
|
-
arr[i] = bin.charCodeAt(i);
|
|
1102
|
-
}
|
|
1103
|
-
return arr;
|
|
1104
|
-
}
|
|
1105
|
-
}
|
|
1106
|
-
function base64FromBytes(arr) {
|
|
1107
|
-
if (globalThis.Buffer) {
|
|
1108
|
-
return globalThis.Buffer.from(arr).toString("base64");
|
|
1109
|
-
}
|
|
1110
|
-
else {
|
|
1111
|
-
const bin = [];
|
|
1112
|
-
arr.forEach((byte) => {
|
|
1113
|
-
bin.push(String.fromCharCode(byte));
|
|
1114
|
-
});
|
|
1115
|
-
return globalThis.btoa(bin.join(""));
|
|
1116
|
-
}
|
|
1117
|
-
}
|
|
1118
|
-
function isSet(value) {
|
|
1119
|
-
return value !== null && value !== undefined;
|
|
1120
|
-
}
|