@polkadot/types-codec 9.14.1 → 10.0.1
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/abstract/Array.js +140 -155
- package/abstract/Base.js +95 -112
- package/abstract/Int.js +212 -220
- package/abstract/Object.js +34 -45
- package/abstract/index.js +3 -6
- package/base/Compact.js +149 -165
- package/base/DoNotConstruct.js +61 -64
- package/base/Enum.js +345 -382
- package/base/Int.js +14 -18
- package/base/Null.js +71 -82
- package/base/Option.js +217 -226
- package/base/Result.js +54 -67
- package/base/Tuple.js +96 -101
- package/base/UInt.js +11 -15
- package/base/Vec.js +84 -89
- package/base/VecAny.js +8 -12
- package/base/VecFixed.js +59 -70
- package/base/index.js +12 -15
- package/bundle.js +7 -10
- package/cjs/abstract/Array.js +138 -159
- package/cjs/abstract/Base.js +96 -117
- package/cjs/abstract/Int.js +215 -238
- package/cjs/abstract/Object.js +30 -49
- package/cjs/abstract/index.js +8 -25
- package/cjs/base/Compact.js +151 -173
- package/cjs/base/DoNotConstruct.js +63 -70
- package/cjs/base/Enum.js +350 -396
- package/cjs/base/Int.js +16 -24
- package/cjs/base/Null.js +70 -86
- package/cjs/base/Option.js +220 -234
- package/cjs/base/Result.js +56 -71
- package/cjs/base/Tuple.js +103 -109
- package/cjs/base/UInt.js +13 -19
- package/cjs/base/Vec.js +94 -101
- package/cjs/base/VecAny.js +10 -16
- package/cjs/base/VecFixed.js +66 -79
- package/cjs/base/index.js +26 -88
- package/cjs/bundle.js +11 -86
- package/cjs/detectOther.js +2 -10
- package/cjs/detectPackage.js +6 -11
- package/cjs/extended/BTreeMap.js +10 -16
- package/cjs/extended/BTreeSet.js +162 -178
- package/cjs/extended/BitVec.js +70 -77
- package/cjs/extended/Bytes.js +59 -62
- package/cjs/extended/HashMap.js +10 -16
- package/cjs/extended/Linkage.js +50 -60
- package/cjs/extended/Map.js +176 -181
- package/cjs/extended/OptionBool.js +65 -68
- package/cjs/extended/Range.js +37 -46
- package/cjs/extended/RangeInclusive.js +13 -21
- package/cjs/extended/Type.js +14 -22
- package/cjs/extended/U8aFixed.js +33 -43
- package/cjs/extended/WrapperKeepOpaque.js +99 -99
- package/cjs/extended/WrapperOpaque.js +19 -28
- package/cjs/extended/index.js +31 -108
- package/cjs/index.js +3 -15
- package/cjs/native/Bool.js +101 -116
- package/cjs/native/Date.js +125 -151
- package/cjs/native/Float.js +95 -114
- package/cjs/native/Json.js +102 -124
- package/cjs/native/Raw.js +128 -150
- package/cjs/native/Set.js +200 -220
- package/cjs/native/Struct.data.js +2 -9
- package/cjs/native/Struct.js +238 -251
- package/cjs/native/Text.js +137 -149
- package/cjs/native/index.js +21 -78
- package/cjs/packageInfo.js +2 -16
- package/cjs/primitive/F32.js +8 -11
- package/cjs/primitive/F64.js +8 -11
- package/cjs/primitive/I128.js +8 -11
- package/cjs/primitive/I16.js +8 -11
- package/cjs/primitive/I256.js +8 -11
- package/cjs/primitive/I32.js +8 -11
- package/cjs/primitive/I64.js +8 -11
- package/cjs/primitive/I8.js +8 -11
- package/cjs/primitive/U128.js +8 -11
- package/cjs/primitive/U16.js +8 -11
- package/cjs/primitive/U256.js +8 -11
- package/cjs/primitive/U32.js +8 -11
- package/cjs/primitive/U64.js +8 -11
- package/cjs/primitive/U8.js +8 -11
- package/cjs/primitive/USize.js +7 -13
- package/cjs/primitive/index.js +47 -199
- package/cjs/types/codec.js +2 -1
- package/cjs/types/helpers.js +2 -1
- package/cjs/types/index.js +6 -48
- package/cjs/types/interfaces.js +2 -1
- package/cjs/types/registry.js +2 -1
- package/cjs/utils/compareArray.js +12 -17
- package/cjs/utils/compareMap.js +23 -26
- package/cjs/utils/compareSet.js +17 -23
- package/cjs/utils/decodeU8a.js +63 -74
- package/cjs/utils/index.js +24 -91
- package/cjs/utils/mapToTypeMap.js +13 -18
- package/cjs/utils/sanitize.js +198 -204
- package/cjs/utils/sortValues.js +39 -49
- package/cjs/utils/typeToConstructor.js +8 -11
- package/cjs/utils/typesToMap.js +10 -16
- package/cjs/utils/util.js +6 -11
- package/detectOther.js +0 -5
- package/detectPackage.js +2 -7
- package/extended/BTreeMap.js +8 -11
- package/extended/BTreeSet.js +159 -171
- package/extended/BitVec.js +63 -70
- package/extended/Bytes.js +56 -57
- package/extended/HashMap.js +8 -11
- package/extended/Linkage.js +46 -51
- package/extended/Map.js +173 -173
- package/extended/OptionBool.js +62 -62
- package/extended/Range.js +31 -39
- package/extended/RangeInclusive.js +11 -16
- package/extended/Type.js +12 -17
- package/extended/U8aFixed.js +30 -36
- package/extended/WrapperKeepOpaque.js +92 -91
- package/extended/WrapperOpaque.js +17 -23
- package/extended/index.js +14 -17
- package/index.js +2 -5
- package/native/Bool.js +102 -111
- package/native/Date.js +126 -144
- package/native/Float.js +94 -107
- package/native/Json.js +104 -114
- package/native/Raw.js +130 -146
- package/native/Set.js +194 -209
- package/native/Struct.data.js +0 -3
- package/native/Struct.js +233 -241
- package/native/Text.js +135 -143
- package/native/index.js +8 -11
- package/package.json +8 -5
- package/packageInfo.js +1 -11
- package/primitive/F32.js +3 -7
- package/primitive/F64.js +3 -7
- package/primitive/I128.js +3 -7
- package/primitive/I16.js +3 -7
- package/primitive/I256.js +3 -7
- package/primitive/I32.js +3 -7
- package/primitive/I64.js +3 -7
- package/primitive/I8.js +3 -7
- package/primitive/U128.js +3 -7
- package/primitive/U16.js +3 -7
- package/primitive/U256.js +3 -7
- package/primitive/U32.js +3 -7
- package/primitive/U64.js +3 -7
- package/primitive/U8.js +3 -7
- package/primitive/USize.js +5 -9
- package/primitive/index.js +15 -18
- package/types/index.js +4 -7
- package/utils/compareArray.js +7 -11
- package/utils/compareMap.js +18 -19
- package/utils/compareSet.js +12 -16
- package/utils/decodeU8a.js +54 -61
- package/utils/index.js +9 -12
- package/utils/mapToTypeMap.js +9 -13
- package/utils/sanitize.js +182 -185
- package/utils/sortValues.js +32 -36
- package/utils/typeToConstructor.js +3 -4
- package/utils/typesToMap.js +5 -8
- package/utils/util.js +1 -4
package/cjs/extended/BTreeSet.js
CHANGED
|
@@ -1,42 +1,36 @@
|
|
|
1
1
|
"use strict";
|
|
2
|
-
|
|
3
|
-
Object.defineProperty(exports, "__esModule", {
|
|
4
|
-
value: true
|
|
5
|
-
});
|
|
2
|
+
var _BTreeSet_ValClass;
|
|
3
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
6
4
|
exports.BTreeSet = void 0;
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
const l = (0, _util.logger)('BTreeSet');
|
|
13
|
-
|
|
5
|
+
const tslib_1 = require("tslib");
|
|
6
|
+
const util_1 = require("@polkadot/util");
|
|
7
|
+
const utils_1 = require("../utils");
|
|
8
|
+
const l = (0, util_1.logger)('BTreeSet');
|
|
14
9
|
/** @internal */
|
|
15
10
|
function decodeSetFromU8a(registry, ValClass, u8a) {
|
|
16
|
-
|
|
17
|
-
|
|
18
|
-
|
|
19
|
-
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
|
|
11
|
+
const output = new Set();
|
|
12
|
+
const [offset, count] = (0, util_1.compactFromU8aLim)(u8a);
|
|
13
|
+
const result = new Array(count);
|
|
14
|
+
const [decodedLength] = (0, utils_1.decodeU8aVec)(registry, result, u8a, offset, ValClass);
|
|
15
|
+
for (let i = 0; i < count; i++) {
|
|
16
|
+
output.add(result[i]);
|
|
17
|
+
}
|
|
18
|
+
return [ValClass, output, decodedLength];
|
|
24
19
|
}
|
|
25
|
-
|
|
26
20
|
/** @internal */
|
|
27
21
|
function decodeSetFromSet(registry, ValClass, value) {
|
|
28
|
-
|
|
29
|
-
|
|
30
|
-
|
|
31
|
-
|
|
32
|
-
|
|
33
|
-
|
|
34
|
-
|
|
35
|
-
|
|
36
|
-
|
|
37
|
-
|
|
22
|
+
const output = new Set();
|
|
23
|
+
value.forEach((val) => {
|
|
24
|
+
try {
|
|
25
|
+
output.add((val instanceof ValClass) ? val : new ValClass(registry, val));
|
|
26
|
+
}
|
|
27
|
+
catch (error) {
|
|
28
|
+
l.error('Failed to decode key or value:', error.message);
|
|
29
|
+
throw error;
|
|
30
|
+
}
|
|
31
|
+
});
|
|
32
|
+
return [ValClass, output, 0];
|
|
38
33
|
}
|
|
39
|
-
|
|
40
34
|
/**
|
|
41
35
|
* Decode input to pass into constructor.
|
|
42
36
|
*
|
|
@@ -52,153 +46,143 @@ function decodeSetFromSet(registry, ValClass, value) {
|
|
|
52
46
|
* @internal
|
|
53
47
|
*/
|
|
54
48
|
function decodeSet(registry, valType, value) {
|
|
55
|
-
|
|
56
|
-
|
|
57
|
-
|
|
58
|
-
|
|
59
|
-
|
|
60
|
-
|
|
61
|
-
|
|
62
|
-
|
|
63
|
-
|
|
49
|
+
const ValClass = (0, utils_1.typeToConstructor)(registry, valType);
|
|
50
|
+
if (!value) {
|
|
51
|
+
return [ValClass, new Set(), 0];
|
|
52
|
+
}
|
|
53
|
+
else if ((0, util_1.isU8a)(value) || (0, util_1.isHex)(value)) {
|
|
54
|
+
return decodeSetFromU8a(registry, ValClass, (0, util_1.u8aToU8a)(value));
|
|
55
|
+
}
|
|
56
|
+
else if (Array.isArray(value) || value instanceof Set) {
|
|
57
|
+
return decodeSetFromSet(registry, ValClass, value);
|
|
58
|
+
}
|
|
59
|
+
throw new Error('BTreeSet: cannot decode type');
|
|
64
60
|
}
|
|
65
61
|
class BTreeSet extends Set {
|
|
66
|
-
|
|
67
|
-
|
|
68
|
-
|
|
69
|
-
|
|
70
|
-
|
|
71
|
-
|
|
72
|
-
|
|
73
|
-
|
|
74
|
-
|
|
75
|
-
|
|
76
|
-
|
|
77
|
-
|
|
78
|
-
|
|
79
|
-
|
|
80
|
-
|
|
81
|
-
|
|
82
|
-
|
|
83
|
-
|
|
84
|
-
|
|
85
|
-
|
|
86
|
-
|
|
87
|
-
|
|
88
|
-
|
|
89
|
-
|
|
90
|
-
|
|
91
|
-
|
|
92
|
-
|
|
93
|
-
|
|
94
|
-
|
|
95
|
-
|
|
96
|
-
|
|
97
|
-
|
|
98
|
-
|
|
99
|
-
|
|
100
|
-
|
|
101
|
-
|
|
102
|
-
|
|
103
|
-
|
|
104
|
-
|
|
105
|
-
|
|
106
|
-
|
|
107
|
-
|
|
108
|
-
|
|
109
|
-
|
|
110
|
-
|
|
111
|
-
|
|
112
|
-
|
|
113
|
-
|
|
114
|
-
|
|
115
|
-
|
|
116
|
-
|
|
117
|
-
|
|
118
|
-
|
|
119
|
-
|
|
120
|
-
|
|
121
|
-
|
|
122
|
-
|
|
123
|
-
|
|
124
|
-
|
|
125
|
-
|
|
126
|
-
|
|
127
|
-
|
|
128
|
-
|
|
129
|
-
|
|
130
|
-
|
|
131
|
-
|
|
132
|
-
|
|
133
|
-
|
|
134
|
-
|
|
135
|
-
|
|
136
|
-
|
|
137
|
-
|
|
138
|
-
|
|
139
|
-
|
|
140
|
-
|
|
141
|
-
|
|
142
|
-
|
|
143
|
-
|
|
144
|
-
|
|
145
|
-
|
|
146
|
-
|
|
147
|
-
|
|
148
|
-
|
|
149
|
-
|
|
150
|
-
|
|
151
|
-
|
|
152
|
-
|
|
153
|
-
|
|
154
|
-
|
|
155
|
-
|
|
156
|
-
|
|
157
|
-
|
|
158
|
-
|
|
159
|
-
|
|
160
|
-
|
|
161
|
-
|
|
162
|
-
|
|
163
|
-
|
|
164
|
-
|
|
165
|
-
|
|
166
|
-
|
|
167
|
-
|
|
168
|
-
|
|
169
|
-
|
|
170
|
-
|
|
171
|
-
|
|
172
|
-
|
|
173
|
-
|
|
174
|
-
|
|
175
|
-
|
|
176
|
-
|
|
177
|
-
|
|
178
|
-
|
|
179
|
-
|
|
180
|
-
|
|
181
|
-
|
|
182
|
-
|
|
183
|
-
|
|
184
|
-
|
|
185
|
-
|
|
186
|
-
|
|
187
|
-
|
|
188
|
-
|
|
189
|
-
|
|
190
|
-
* @description Encodes the value as a Uint8Array as per the SCALE specifications
|
|
191
|
-
* @param isBare true when the value has none of the type-specific prefixes (internal)
|
|
192
|
-
*/
|
|
193
|
-
toU8a(isBare) {
|
|
194
|
-
const encoded = new Array();
|
|
195
|
-
if (!isBare) {
|
|
196
|
-
encoded.push((0, _util.compactToU8a)(this.size));
|
|
197
|
-
}
|
|
198
|
-
for (const v of this.values()) {
|
|
199
|
-
encoded.push(v.toU8a(isBare));
|
|
200
|
-
}
|
|
201
|
-
return (0, _util.u8aConcatStrict)(encoded);
|
|
202
|
-
}
|
|
62
|
+
constructor(registry, valType, rawValue) {
|
|
63
|
+
const [ValClass, values, decodedLength] = decodeSet(registry, valType, rawValue);
|
|
64
|
+
super((0, utils_1.sortSet)(values));
|
|
65
|
+
_BTreeSet_ValClass.set(this, void 0);
|
|
66
|
+
this.registry = registry;
|
|
67
|
+
this.initialU8aLength = decodedLength;
|
|
68
|
+
tslib_1.__classPrivateFieldSet(this, _BTreeSet_ValClass, ValClass, "f");
|
|
69
|
+
}
|
|
70
|
+
static with(valType) {
|
|
71
|
+
return class extends BTreeSet {
|
|
72
|
+
constructor(registry, value) {
|
|
73
|
+
super(registry, valType, value);
|
|
74
|
+
}
|
|
75
|
+
};
|
|
76
|
+
}
|
|
77
|
+
/**
|
|
78
|
+
* @description The length of the value when encoded as a Uint8Array
|
|
79
|
+
*/
|
|
80
|
+
get encodedLength() {
|
|
81
|
+
let len = (0, util_1.compactToU8a)(this.size).length;
|
|
82
|
+
for (const v of this.values()) {
|
|
83
|
+
len += v.encodedLength;
|
|
84
|
+
}
|
|
85
|
+
return len;
|
|
86
|
+
}
|
|
87
|
+
/**
|
|
88
|
+
* @description Returns a hash of the value
|
|
89
|
+
*/
|
|
90
|
+
get hash() {
|
|
91
|
+
return this.registry.hash(this.toU8a());
|
|
92
|
+
}
|
|
93
|
+
/**
|
|
94
|
+
* @description Checks if the value is an empty value
|
|
95
|
+
*/
|
|
96
|
+
get isEmpty() {
|
|
97
|
+
return this.size === 0;
|
|
98
|
+
}
|
|
99
|
+
/**
|
|
100
|
+
* @description The actual set values as a string[]
|
|
101
|
+
*/
|
|
102
|
+
get strings() {
|
|
103
|
+
return [...super.values()].map((v) => v.toString());
|
|
104
|
+
}
|
|
105
|
+
/**
|
|
106
|
+
* @description Compares the value of the input to see if there is a match
|
|
107
|
+
*/
|
|
108
|
+
eq(other) {
|
|
109
|
+
return (0, utils_1.compareSet)(this, other);
|
|
110
|
+
}
|
|
111
|
+
/**
|
|
112
|
+
* @description Returns a breakdown of the hex encoding for this Codec
|
|
113
|
+
*/
|
|
114
|
+
inspect() {
|
|
115
|
+
const inner = new Array();
|
|
116
|
+
for (const v of this.values()) {
|
|
117
|
+
inner.push(v.inspect());
|
|
118
|
+
}
|
|
119
|
+
return {
|
|
120
|
+
inner,
|
|
121
|
+
outer: [(0, util_1.compactToU8a)(this.size)]
|
|
122
|
+
};
|
|
123
|
+
}
|
|
124
|
+
/**
|
|
125
|
+
* @description Returns a hex string representation of the value. isLe returns a LE (number-only) representation
|
|
126
|
+
*/
|
|
127
|
+
toHex() {
|
|
128
|
+
return (0, util_1.u8aToHex)(this.toU8a());
|
|
129
|
+
}
|
|
130
|
+
/**
|
|
131
|
+
* @description Converts the Object to to a human-friendly JSON, with additional fields, expansion and formatting of information
|
|
132
|
+
*/
|
|
133
|
+
toHuman(isExtended) {
|
|
134
|
+
const json = [];
|
|
135
|
+
for (const v of this.values()) {
|
|
136
|
+
json.push(v.toHuman(isExtended));
|
|
137
|
+
}
|
|
138
|
+
return json;
|
|
139
|
+
}
|
|
140
|
+
/**
|
|
141
|
+
* @description Converts the Object to JSON, typically used for RPC transfers
|
|
142
|
+
*/
|
|
143
|
+
toJSON() {
|
|
144
|
+
const json = [];
|
|
145
|
+
for (const v of this.values()) {
|
|
146
|
+
json.push(v.toJSON());
|
|
147
|
+
}
|
|
148
|
+
return json;
|
|
149
|
+
}
|
|
150
|
+
/**
|
|
151
|
+
* @description Returns the base runtime type name for this instance
|
|
152
|
+
*/
|
|
153
|
+
toRawType() {
|
|
154
|
+
return `BTreeSet<${this.registry.getClassName(tslib_1.__classPrivateFieldGet(this, _BTreeSet_ValClass, "f")) || new (tslib_1.__classPrivateFieldGet(this, _BTreeSet_ValClass, "f"))(this.registry).toRawType()}>`;
|
|
155
|
+
}
|
|
156
|
+
/**
|
|
157
|
+
* @description Converts the value in a best-fit primitive form
|
|
158
|
+
*/
|
|
159
|
+
toPrimitive() {
|
|
160
|
+
const json = [];
|
|
161
|
+
for (const v of this.values()) {
|
|
162
|
+
json.push(v.toPrimitive());
|
|
163
|
+
}
|
|
164
|
+
return json;
|
|
165
|
+
}
|
|
166
|
+
/**
|
|
167
|
+
* @description Returns the string representation of the value
|
|
168
|
+
*/
|
|
169
|
+
toString() {
|
|
170
|
+
return (0, util_1.stringify)(this.toJSON());
|
|
171
|
+
}
|
|
172
|
+
/**
|
|
173
|
+
* @description Encodes the value as a Uint8Array as per the SCALE specifications
|
|
174
|
+
* @param isBare true when the value has none of the type-specific prefixes (internal)
|
|
175
|
+
*/
|
|
176
|
+
toU8a(isBare) {
|
|
177
|
+
const encoded = new Array();
|
|
178
|
+
if (!isBare) {
|
|
179
|
+
encoded.push((0, util_1.compactToU8a)(this.size));
|
|
180
|
+
}
|
|
181
|
+
for (const v of this.values()) {
|
|
182
|
+
encoded.push(v.toU8a(isBare));
|
|
183
|
+
}
|
|
184
|
+
return (0, util_1.u8aConcatStrict)(encoded);
|
|
185
|
+
}
|
|
203
186
|
}
|
|
204
|
-
exports.BTreeSet = BTreeSet;
|
|
187
|
+
exports.BTreeSet = BTreeSet;
|
|
188
|
+
_BTreeSet_ValClass = new WeakMap();
|
package/cjs/extended/BitVec.js
CHANGED
|
@@ -1,92 +1,85 @@
|
|
|
1
1
|
"use strict";
|
|
2
|
-
|
|
3
|
-
Object.defineProperty(exports, "__esModule", {
|
|
4
|
-
value: true
|
|
5
|
-
});
|
|
2
|
+
var _BitVec_decodedLength, _BitVec_isMsb;
|
|
3
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
6
4
|
exports.BitVec = void 0;
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
// SPDX-License-Identifier: Apache-2.0
|
|
11
|
-
|
|
5
|
+
const tslib_1 = require("tslib");
|
|
6
|
+
const util_1 = require("@polkadot/util");
|
|
7
|
+
const Raw_1 = require("../native/Raw");
|
|
12
8
|
/** @internal */
|
|
13
9
|
function decodeBitVecU8a(value) {
|
|
14
|
-
|
|
15
|
-
|
|
16
|
-
|
|
17
|
-
|
|
18
|
-
|
|
19
|
-
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
|
|
24
|
-
return [length, value.subarray(offset, total)];
|
|
10
|
+
if (!value || !value.length) {
|
|
11
|
+
return [0, new Uint8Array()];
|
|
12
|
+
}
|
|
13
|
+
// handle all other Uint8Array inputs, these do have a length prefix which is the number of bits encoded
|
|
14
|
+
const [offset, length] = (0, util_1.compactFromU8aLim)(value);
|
|
15
|
+
const total = offset + Math.ceil(length / 8);
|
|
16
|
+
if (total > value.length) {
|
|
17
|
+
throw new Error(`BitVec: required length less than remainder, expected at least ${total}, found ${value.length}`);
|
|
18
|
+
}
|
|
19
|
+
return [length, value.subarray(offset, total)];
|
|
25
20
|
}
|
|
26
|
-
|
|
27
21
|
/** @internal */
|
|
28
22
|
function decodeBitVec(value) {
|
|
29
|
-
|
|
30
|
-
|
|
31
|
-
|
|
32
|
-
|
|
33
|
-
|
|
23
|
+
if (Array.isArray(value) || (0, util_1.isString)(value)) {
|
|
24
|
+
const u8a = (0, util_1.u8aToU8a)(value);
|
|
25
|
+
return [u8a.length / 8, u8a];
|
|
26
|
+
}
|
|
27
|
+
return decodeBitVecU8a(value);
|
|
34
28
|
}
|
|
35
|
-
|
|
36
29
|
/**
|
|
37
30
|
* @name BitVec
|
|
38
31
|
* @description
|
|
39
32
|
* A BitVec that represents an array of bits. The bits are however stored encoded. The difference between this
|
|
40
33
|
* and a normal Bytes would be that the length prefix indicates the number of bits encoded, not the bytes
|
|
41
34
|
*/
|
|
42
|
-
class BitVec extends
|
|
43
|
-
|
|
44
|
-
|
|
45
|
-
|
|
46
|
-
|
|
47
|
-
|
|
48
|
-
|
|
49
|
-
|
|
50
|
-
|
|
51
|
-
|
|
52
|
-
|
|
53
|
-
|
|
54
|
-
|
|
55
|
-
|
|
56
|
-
|
|
57
|
-
|
|
58
|
-
|
|
59
|
-
|
|
60
|
-
|
|
61
|
-
|
|
62
|
-
|
|
63
|
-
|
|
64
|
-
|
|
65
|
-
|
|
66
|
-
|
|
67
|
-
|
|
68
|
-
|
|
69
|
-
|
|
70
|
-
|
|
71
|
-
|
|
72
|
-
|
|
73
|
-
|
|
74
|
-
|
|
75
|
-
|
|
76
|
-
|
|
77
|
-
|
|
78
|
-
|
|
79
|
-
|
|
80
|
-
|
|
81
|
-
|
|
82
|
-
|
|
83
|
-
|
|
84
|
-
|
|
85
|
-
|
|
86
|
-
|
|
87
|
-
|
|
88
|
-
|
|
89
|
-
|
|
90
|
-
}
|
|
35
|
+
class BitVec extends Raw_1.Raw {
|
|
36
|
+
// In lieu of having the Msb/Lsb identifiers passed through, we default to assuming
|
|
37
|
+
// we are dealing with Lsb, which is the default (as of writing) BitVec format used
|
|
38
|
+
// in the Polkadot code (this only affects the toHuman displays)
|
|
39
|
+
constructor(registry, value, isMsb = false) {
|
|
40
|
+
const [decodedLength, u8a] = decodeBitVec(value);
|
|
41
|
+
super(registry, u8a);
|
|
42
|
+
_BitVec_decodedLength.set(this, void 0);
|
|
43
|
+
_BitVec_isMsb.set(this, void 0);
|
|
44
|
+
tslib_1.__classPrivateFieldSet(this, _BitVec_decodedLength, decodedLength, "f");
|
|
45
|
+
tslib_1.__classPrivateFieldSet(this, _BitVec_isMsb, isMsb, "f");
|
|
46
|
+
}
|
|
47
|
+
/**
|
|
48
|
+
* @description The length of the value when encoded as a Uint8Array
|
|
49
|
+
*/
|
|
50
|
+
get encodedLength() {
|
|
51
|
+
return this.length + (0, util_1.compactToU8a)(tslib_1.__classPrivateFieldGet(this, _BitVec_decodedLength, "f")).length;
|
|
52
|
+
}
|
|
53
|
+
/**
|
|
54
|
+
* @description Returns a breakdown of the hex encoding for this Codec
|
|
55
|
+
*/
|
|
56
|
+
inspect() {
|
|
57
|
+
return {
|
|
58
|
+
outer: [(0, util_1.compactToU8a)(tslib_1.__classPrivateFieldGet(this, _BitVec_decodedLength, "f")), super.toU8a()]
|
|
59
|
+
};
|
|
60
|
+
}
|
|
61
|
+
toHuman() {
|
|
62
|
+
return `0b${[...this.toU8a(true)]
|
|
63
|
+
.map((d) => `00000000${d.toString(2)}`.slice(-8))
|
|
64
|
+
.map((s) => tslib_1.__classPrivateFieldGet(this, _BitVec_isMsb, "f") ? s : s.split('').reverse().join(''))
|
|
65
|
+
.join('_')}`;
|
|
66
|
+
}
|
|
67
|
+
/**
|
|
68
|
+
* @description Returns the base runtime type name for this instance
|
|
69
|
+
*/
|
|
70
|
+
toRawType() {
|
|
71
|
+
return 'BitVec';
|
|
72
|
+
}
|
|
73
|
+
/**
|
|
74
|
+
* @description Encodes the value as a Uint8Array as per the SCALE specifications
|
|
75
|
+
* @param isBare true when the value has none of the type-specific prefixes (internal)
|
|
76
|
+
*/
|
|
77
|
+
toU8a(isBare) {
|
|
78
|
+
const bitVec = super.toU8a();
|
|
79
|
+
return isBare
|
|
80
|
+
? bitVec
|
|
81
|
+
: (0, util_1.u8aConcatStrict)([(0, util_1.compactToU8a)(tslib_1.__classPrivateFieldGet(this, _BitVec_decodedLength, "f")), bitVec]);
|
|
82
|
+
}
|
|
91
83
|
}
|
|
92
|
-
exports.BitVec = BitVec;
|
|
84
|
+
exports.BitVec = BitVec;
|
|
85
|
+
_BitVec_decodedLength = new WeakMap(), _BitVec_isMsb = new WeakMap();
|