@pezkuwi/types-codec 16.5.5 → 16.5.6

package/LICENSE

@@ -0,0 +1,201 @@
+                              Apache License
+                        Version 2.0, January 2004
+                    http://www.apache.org/licenses/
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+1. Definitions.
+
+  "License" shall mean the terms and conditions for use, reproduction,
+  and distribution as defined by Sections 1 through 9 of this document.
+
+  "Licensor" shall mean the copyright owner or entity authorized by
+  the copyright owner that is granting the License.
+
+  "Legal Entity" shall mean the union of the acting entity and all
+  other entities that control, are controlled by, or are under common
+  control with that entity. For the purposes of this definition,
+  "control" means (i) the power, direct or indirect, to cause the
+  direction or management of such entity, whether by contract or
+  otherwise, or (ii) ownership of fifty percent (50%) or more of the
+  outstanding shares, or (iii) beneficial ownership of such entity.
+
+  "You" (or "Your") shall mean an individual or Legal Entity
+  exercising permissions granted by this License.
+
+  "Source" form shall mean the preferred form for making modifications,
+  including but not limited to software source code, documentation
+  source, and configuration files.
+
+  "Object" form shall mean any form resulting from mechanical
+  transformation or translation of a Source form, including but
+  not limited to compiled object code, generated documentation,
+  and conversions to other media types.
+
+  "Work" shall mean the work of authorship, whether in Source or
+  Object form, made available under the License, as indicated by a
+  copyright notice that is included in or attached to the work
+  (an example is provided in the Appendix below).
+
+  "Derivative Works" shall mean any work, whether in Source or Object
+  form, that is based on (or derived from) the Work and for which the
+  editorial revisions, annotations, elaborations, or other modifications
+  represent, as a whole, an original work of authorship. For the purposes
+  of this License, Derivative Works shall not include works that remain
+  separable from, or merely link (or bind by name) to the interfaces of,
+  the Work and Derivative Works thereof.
+
+  "Contribution" shall mean any work of authorship, including
+  the original version of the Work and any modifications or additions
+  to that Work or Derivative Works thereof, that is intentionally
+  submitted to Licensor for inclusion in the Work by the copyright owner
+  or by an individual or Legal Entity authorized to submit on behalf of
+  the copyright owner. For the purposes of this definition, "submitted"
+  means any form of electronic, verbal, or written communication sent
+  to the Licensor or its representatives, including but not limited to
+  communication on electronic mailing lists, source code control systems,
+  and issue tracking systems that are managed by, or on behalf of, the
+  Licensor for the purpose of discussing and improving the Work, but
+  excluding communication that is conspicuously marked or otherwise
+  designated in writing by the copyright owner as "Not a Contribution."
+
+  "Contributor" shall mean Licensor and any individual or Legal Entity
+  on behalf of whom a Contribution has been received by Licensor and
+  subsequently incorporated within the Work.
+
+2. Grant of Copyright License. Subject to the terms and conditions of
+  this License, each Contributor hereby grants to You a perpetual,
+  worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+  copyright license to reproduce, prepare Derivative Works of,
+  publicly display, publicly perform, sublicense, and distribute the
+  Work and such Derivative Works in Source or Object form.
+
+3. Grant of Patent License. Subject to the terms and conditions of
+  this License, each Contributor hereby grants to You a perpetual,
+  worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+  (except as stated in this section) patent license to make, have made,
+  use, offer to sell, sell, import, and otherwise transfer the Work,
+  where such license applies only to those patent claims licensable
+  by such Contributor that are necessarily infringed by their
+  Contribution(s) alone or by combination of their Contribution(s)
+  with the Work to which such Contribution(s) was submitted. If You
+  institute patent litigation against any entity (including a
+  cross-claim or counterclaim in a lawsuit) alleging that the Work
+  or a Contribution incorporated within the Work constitutes direct
+  or contributory patent infringement, then any patent licenses
+  granted to You under this License for that Work shall terminate
+  as of the date such litigation is filed.
+
+4. Redistribution. You may reproduce and distribute copies of the
+  Work or Derivative Works thereof in any medium, with or without
+  modifications, and in Source or Object form, provided that You
+  meet the following conditions:
+
+  (a) You must give any other recipients of the Work or
+      Derivative Works a copy of this License; and
+
+  (b) You must cause any modified files to carry prominent notices
+      stating that You changed the files; and
+
+  (c) You must retain, in the Source form of any Derivative Works
+      that You distribute, all copyright, patent, trademark, and
+      attribution notices from the Source form of the Work,
+      excluding those notices that do not pertain to any part of
+      the Derivative Works; and
+
+  (d) If the Work includes a "NOTICE" text file as part of its
+      distribution, then any Derivative Works that You distribute must
+      include a readable copy of the attribution notices contained
+      within such NOTICE file, excluding those notices that do not
+      pertain to any part of the Derivative Works, in at least one
+      of the following places: within a NOTICE text file distributed
+      as part of the Derivative Works; within the Source form or
+      documentation, if provided along with the Derivative Works; or,
+      within a display generated by the Derivative Works, if and
+      wherever such third-party notices normally appear. The contents
+      of the NOTICE file are for informational purposes only and
+      do not modify the License. You may add Your own attribution
+      notices within Derivative Works that You distribute, alongside
+      or as an addendum to the NOTICE text from the Work, provided
+      that such additional attribution notices cannot be construed
+      as modifying the License.
+
+  You may add Your own copyright statement to Your modifications and
+  may provide additional or different license terms and conditions
+  for use, reproduction, or distribution of Your modifications, or
+  for any such Derivative Works as a whole, provided Your use,
+  reproduction, and distribution of the Work otherwise complies with
+  the conditions stated in this License.
+
+5. Submission of Contributions. Unless You explicitly state otherwise,
+  any Contribution intentionally submitted for inclusion in the Work
+  by You to the Licensor shall be under the terms and conditions of
+  this License, without any additional terms or conditions.
+  Notwithstanding the above, nothing herein shall supersede or modify
+  the terms of any separate license agreement you may have executed
+  with Licensor regarding such Contributions.
+
+6. Trademarks. This License does not grant permission to use the trade
+  names, trademarks, service marks, or product names of the Licensor,
+  except as required for reasonable and customary use in describing the
+  origin of the Work and reproducing the content of the NOTICE file.
+
+7. Disclaimer of Warranty. Unless required by applicable law or
+  agreed to in writing, Licensor provides the Work (and each
+  Contributor provides its Contributions) on an "AS IS" BASIS,
+  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+  implied, including, without limitation, any warranties or conditions
+  of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+  PARTICULAR PURPOSE. You are solely responsible for determining the
+  appropriateness of using or redistributing the Work and assume any
+  risks associated with Your exercise of permissions under this License.
+
+8. Limitation of Liability. In no event and under no legal theory,
+  whether in tort (including negligence), contract, or otherwise,
+  unless required by applicable law (such as deliberate and grossly
+  negligent acts) or agreed to in writing, shall any Contributor be
+  liable to You for damages, including any direct, indirect, special,
+  incidental, or consequential damages of any character arising as a
+  result of this License or out of the use or inability to use the
+  Work (including but not limited to damages for loss of goodwill,
+  work stoppage, computer failure or malfunction, or any and all
+  other commercial damages or losses), even if such Contributor
+  has been advised of the possibility of such damages.
+
+9. Accepting Warranty or Additional Liability. While redistributing
+  the Work or Derivative Works thereof, You may choose to offer,
+  and charge a fee for, acceptance of support, warranty, indemnity,
+  or other liability obligations and/or rights consistent with this
+  License. However, in accepting such obligations, You may act only
+  on Your own behalf and on Your sole responsibility, not on behalf
+  of any other Contributor, and only if You agree to indemnify,
+  defend, and hold each Contributor harmless for any liability
+  incurred by, or claims asserted against, such Contributor by reason
+  of your accepting any such warranty or additional liability.
+
+END OF TERMS AND CONDITIONS
+
+APPENDIX: How to apply the Apache License to your work.
+
+  To apply the Apache License to your work, attach the following
+  boilerplate notice, with the fields enclosed by brackets "[]"
+  replaced with your own identifying information. (Don't include
+  the brackets!)  The text should be enclosed in the appropriate
+  comment syntax for the file format. We also recommend that a
+  file or class name and description of purpose be included on the
+  same "printed page" as the copyright notice for easier
+  identification within third-party archives.
+
+Copyright [yyyy] [name of copyright owner]
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+    http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.

package/abstract/Array.js

@@ -0,0 +1,166 @@
+import { compactToU8a, u8aConcatStrict, u8aToHex } from '@pezkuwi/util';
+import { compareArray } from '../utils/compareArray.js';
+/**
+ * @name AbstractArray
+ * @description
+ * This manages codec arrays. It is an extension to Array, providing
+ * specific encoding/decoding on top of the base type.
+ * @noInheritDoc
+ */
+export class AbstractArray extends Array {
+    registry;
+    createdAtHash;
+    initialU8aLength;
+    isStorageFallback;
+    /**
+     * @description This ensures that operators such as clice, filter, map, etc. return
+     * new Array instances (without this we need to apply overrides)
+     */
+    static get [Symbol.species]() {
+        return Array;
+    }
+    constructor(registry, length) {
+        super(length);
+        this.registry = registry;
+    }
+    /**
+     * @description The length of the value when encoded as a Uint8Array
+     */
+    get encodedLength() {
+        // We need to loop through all entries since they may have a variable length themselves,
+        // e.g. when a Vec or Compact is contained withing, it has a variable length based on data
+        const count = this.length;
+        let total = compactToU8a(count).length;
+        for (let i = 0; i < count; i++) {
+            total += this[i].encodedLength;
+        }
+        return total;
+    }
+    /**
+     * @description returns a hash of the contents
+     */
+    get hash() {
+        return this.registry.hash(this.toU8a());
+    }
+    /**
+     * @description Checks if the value is an empty value
+     */
+    get isEmpty() {
+        return this.length === 0;
+    }
+    /**
+     * @description The length of the value
+     */
+    get length() {
+        // only included here since we ignore inherited docs
+        return super.length;
+    }
+    /**
+     * @description Compares the value of the input to see if there is a match
+     */
+    eq(other) {
+        return compareArray(this, other);
+    }
+    /**
+     * @description Returns a breakdown of the hex encoding for this Codec
+     */
+    inspect() {
+        return {
+            inner: this.inspectInner(),
+            outer: [compactToU8a(this.length)]
+        };
+    }
+    /**
+     * @internal
+     * @description Internal per-item inspection of internal values
+     */
+    inspectInner() {
+        const count = this.length;
+        const inner = new Array(count);
+        for (let i = 0; i < count; i++) {
+            inner[i] = this[i].inspect();
+        }
+        return inner;
+    }
+    /**
+     * @description Converts the Object to an standard JavaScript Array
+     */
+    toArray() {
+        return Array.from(this);
+    }
+    /**
+     * @description Returns a hex string representation of the value
+     */
+    toHex() {
+        return u8aToHex(this.toU8a());
+    }
+    /**
+     * @description Converts the Object to to a human-friendly JSON, with additional fields, expansion and formatting of information
+     */
+    toHuman(isExtended, disableAscii) {
+        const count = this.length;
+        const result = new Array(count);
+        for (let i = 0; i < count; i++) {
+            result[i] = this[i] && this[i].toHuman(isExtended, disableAscii);
+        }
+        return result;
+    }
+    /**
+     * @description Converts the Object to JSON, typically used for RPC transfers
+     */
+    toJSON() {
+        const count = this.length;
+        const result = new Array(count);
+        for (let i = 0; i < count; i++) {
+            // We actually log inside the U8a decoding and use JSON.stringify(...), which
+            // means that the Vec may be partially populated (same applies to toHuman, same check)
+            result[i] = this[i] && this[i].toJSON();
+        }
+        return result;
+    }
+    /**
+     * @description Converts the value in a best-fit primitive form
+     */
+    toPrimitive(disableAscii) {
+        const count = this.length;
+        const result = new Array(count);
+        for (let i = 0; i < count; i++) {
+            result[i] = this[i] && this[i].toPrimitive(disableAscii);
+        }
+        return result;
+    }
+    /**
+     * @description Returns the string representation of the value
+     */
+    toString() {
+        const count = this.length;
+        const result = new Array(count);
+        for (let i = 0; i < count; i++) {
+            result[i] = this[i].toString();
+        }
+        return `[${result.join(', ')}]`;
+    }
+    /**
+     * @description Encodes the value as a Uint8Array as per the SCALE specifications
+     * @param isBare true when the value has none of the type-specific prefixes (internal)
+     */
+    toU8a(isBare) {
+        const encoded = this.toU8aInner();
+        return isBare
+            ? u8aConcatStrict(encoded)
+            : u8aConcatStrict([compactToU8a(this.length), ...encoded]);
+    }
+    /**
+     * @internal
+     * @description Internal per-item SCALE encoding of contained values
+     * @param isBare true when the value has none of the type-specific prefixes (internal)
+     */
+    toU8aInner(isBare) {
+        const count = this.length;
+        const encoded = new Array(count);
+        for (let i = 0; i < count; i++) {
+            encoded[i] = this[i].toU8a(isBare);
+        }
+        return encoded;
+    }
+}

package/abstract/Base.js

@@ -0,0 +1,101 @@
+/**
+ * @name Base
+ * @description A type extends the Base class, when it holds a value
+ */
+export class AbstractBase {
+    registry;
+    createdAtHash;
+    initialU8aLength;
+    isStorageFallback;
+    #raw;
+    constructor(registry, value, initialU8aLength) {
+        this.initialU8aLength = initialU8aLength;
+        this.#raw = value;
+        this.registry = registry;
+    }
+    /**
+     * @description The length of the value when encoded as a Uint8Array
+     */
+    get encodedLength() {
+        return this.toU8a().length;
+    }
+    /**
+     * @description returns a hash of the contents
+     */
+    get hash() {
+        return this.registry.hash(this.toU8a());
+    }
+    /**
+     * @description returns the inner (wrapped value)
+     */
+    get inner() {
+        return this.#raw;
+    }
+    /**
+     * @description Checks if the value is an empty value
+     */
+    get isEmpty() {
+        return this.#raw.isEmpty;
+    }
+    /**
+     * @description Compares the value of the input to see if there is a match
+     */
+    eq(other) {
+        return this.#raw.eq(other);
+    }
+    /**
+     * @description Returns a breakdown of the hex encoding for this Codec
+     */
+    inspect() {
+        return this.#raw.inspect();
+    }
+    /**
+     * @description Returns a hex string representation of the value. isLe returns a LE (number-only) representation
+     */
+    toHex(isLe) {
+        return this.#raw.toHex(isLe);
+    }
+    /**
+     * @description Converts the Object to to a human-friendly JSON, with additional fields, expansion and formatting of information
+     */
+    toHuman(isExtended, disableAscii) {
+        return this.#raw.toHuman(isExtended, disableAscii);
+    }
+    /**
+     * @description Converts the Object to JSON, typically used for RPC transfers
+     */
+    toJSON() {
+        return this.#raw.toJSON();
+    }
+    /**
+     * @description Converts the value in a best-fit primitive form
+     */
+    toPrimitive(disableAscii) {
+        return this.#raw.toPrimitive(disableAscii);
+    }
+    /**
+     * @description Returns the string representation of the value
+     */
+    toString() {
+        return this.#raw.toString();
+    }
+    /**
+     * @description Encodes the value as a Uint8Array as per the SCALE specifications
+     * @param isBare true when the value has none of the type-specific prefixes (internal)
+     */
+    toU8a(isBare) {
+        return this.#raw.toU8a(isBare);
+    }
+    /**
+     * @description Returns the inner wrapped value (equivalent to valueOf)
+     */
+    unwrap() {
+        return this.#raw;
+    }
+    /**
+     * @description Returns the inner wrapped value
+     */
+    valueOf() {
+        return this.#raw;
+    }
+}

package/abstract/Int.js

@@ -0,0 +1,226 @@
+import { BN, BN_BILLION, BN_HUNDRED, BN_MILLION, BN_QUINTILL, bnToBn, bnToHex, bnToU8a, formatBalance, formatNumber, hexToBn, isBigInt, isBn, isFunction, isHex, isNumber, isObject, isString, isU8a, u8aToBn, u8aToNumber } from '@pezkuwi/util';
+export const DEFAULT_UINT_BITS = 64;
+const MAX_NUMBER_BITS = 52;
+const MUL_P = new BN(1_00_00);
+const FORMATTERS = [
+    ['Perquintill', BN_QUINTILL],
+    ['Perbill', BN_BILLION],
+    ['Permill', BN_MILLION],
+    ['Percent', BN_HUNDRED]
+];
+function isToBn(value) {
+    return isFunction(value.toBn);
+}
+function toPercentage(value, divisor) {
+    return `${(value.mul(MUL_P).div(divisor).toNumber() / 100).toFixed(2)}%`;
+}
+/** @internal */
+function decodeAbstractInt(value, isNegative) {
+    if (isNumber(value)) {
+        if (!Number.isInteger(value) || value > Number.MAX_SAFE_INTEGER || value < Number.MIN_SAFE_INTEGER) {
+            throw new Error('Number needs to be an integer <= Number.MAX_SAFE_INTEGER, i.e. 2 ^ 53 - 1');
+        }
+        return value;
+    }
+    else if (isString(value)) {
+        if (isHex(value, -1, true)) {
+            return hexToBn(value, { isLe: false, isNegative }).toString();
+        }
+        if (value.includes('.') || value.includes(',') || value.includes('e')) {
+            throw new Error('String should not contain decimal points or scientific notation');
+        }
+        return value;
+    }
+    else if (isBn(value) || isBigInt(value)) {
+        return value.toString();
+    }
+    else if (isObject(value)) {
+        if (isToBn(value)) {
+            return value.toBn().toString();
+        }
+        // Allow the construction from an object with a single top-level key. This means that
+        // single key objects can be treated equivalently to numbers, assuming they meet the
+        // specific requirements. (This is useful in Weights 1.5 where Objects are compact)
+        const keys = Object.keys(value);
+        if (keys.length !== 1) {
+            throw new Error('Unable to construct number from multi-key object');
+        }
+        return decodeAbstractInt(value[keys[0]], isNegative);
+    }
+    else if (!value) {
+        return 0;
+    }
+    throw new Error(`Unable to create BN from unknown type ${typeof value}`);
+}
+/**
+ * @name AbstractInt
+ * @ignore
+ * @noInheritDoc
+ */
+export class AbstractInt extends BN {
+    registry;
+    encodedLength;
+    isUnsigned;
+    createdAtHash;
+    initialU8aLength;
+    isStorageFallback;
+    #bitLength;
+    constructor(registry, value = 0, bitLength = DEFAULT_UINT_BITS, isSigned = false) {
+        // Construct via a string/number, which will be passed in the BN constructor.
+        // It would be ideal to actually return a BN, but there is an issue:
+        // https://github.com/indutny/bn.js/issues/206
+        super(
+        // shortcut isU8a as used in SCALE decoding
+        isU8a(value)
+            ? bitLength <= 48
+                ? u8aToNumber(value.subarray(0, bitLength / 8), { isNegative: isSigned })
+                : u8aToBn(value.subarray(0, bitLength / 8), { isLe: true, isNegative: isSigned }).toString()
+            : decodeAbstractInt(value, isSigned));
+        this.registry = registry;
+        this.#bitLength = bitLength;
+        this.encodedLength = this.#bitLength / 8;
+        this.initialU8aLength = this.#bitLength / 8;
+        this.isUnsigned = !isSigned;
+        const isNegative = this.isNeg();
+        const maxBits = bitLength - (isSigned && !isNegative ? 1 : 0);
+        if (isNegative && !isSigned) {
+            throw new Error(`${this.toRawType()}: Negative number passed to unsigned type`);
+        }
+        else if (super.bitLength() > maxBits) {
+            throw new Error(`${this.toRawType()}: Input too large. Found input with ${super.bitLength()} bits, expected ${maxBits}`);
+        }
+    }
+    /**
+     * @description returns a hash of the contents
+     */
+    get hash() {
+        return this.registry.hash(this.toU8a());
+    }
+    /**
+     * @description Checks if the value is a zero value (align elsewhere)
+     */
+    get isEmpty() {
+        return this.isZero();
+    }
+    /**
+     * @description Returns the number of bits in the value
+     */
+    bitLength() {
+        return this.#bitLength;
+    }
+    /**
+     * @description Compares the value of the input to see if there is a match
+     */
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    eq(other) {
+        // Here we are actually overriding the built-in .eq to take care of both
+        // number and BN inputs (no `.eqn` needed) - numbers will be converted
+        return super.eq(isHex(other)
+            ? hexToBn(other.toString(), { isLe: false, isNegative: !this.isUnsigned })
+            : bnToBn(other));
+    }
+    /**
+     * @description Returns a breakdown of the hex encoding for this Codec
+     */
+    inspect() {
+        return {
+            outer: [this.toU8a()]
+        };
+    }
+    /**
+     * @description True if this value is the max of the type
+     */
+    isMax() {
+        const u8a = this.toU8a().filter((b) => b === 0xff);
+        return u8a.length === (this.#bitLength / 8);
+    }
+    /**
+     * @description Returns a BigInt representation of the number
+     */
+    toBigInt() {
+        return BigInt(this.toString());
+    }
+    /**
+     * @description Returns the BN representation of the number. (Compatibility)
+     */
+    toBn() {
+        return this;
+    }
+    /**
+     * @description Returns a hex string representation of the value
+     */
+    toHex(isLe = false) {
+        // For display/JSON, this is BE, for compare, use isLe
+        return bnToHex(this, {
+            bitLength: this.bitLength(),
+            isLe,
+            isNegative: !this.isUnsigned
+        });
+    }
+    /**
+     * @description Converts the Object to to a human-friendly JSON, with additional fields, expansion and formatting of information
+     */
+    toHuman(_isExpanded) {
+        const rawType = this.toRawType();
+        if (rawType === 'Balance') {
+            return this.isMax()
+                ? 'everything'
+                // FIXME In the case of multiples we need some way of detecting which instance this belongs
+                // to. as it stands we will always format (incorrectly) against the first token defined
+                : formatBalance(this, { decimals: this.registry.chainDecimals[0], withSi: true, withUnit: this.registry.chainTokens[0] });
+        }
+        const [, divisor] = FORMATTERS.find(([type]) => type === rawType) || [];
+        return divisor
+            ? toPercentage(this, divisor)
+            : formatNumber(this);
+    }
+    /**
+     * @description Converts the Object to JSON, typically used for RPC transfers
+     */
+    toJSON(onlyHex = false) {
+        // FIXME this return type should by string | number, however BN returns string
+        // Options here are
+        //   - super.bitLength() - the actual used bits, use hex when close to MAX_SAFE_INTEGER
+        //   - this.#bitLength - the max used bits, use hex when larger than native Rust type
+        return onlyHex || (this.#bitLength > 128) || (super.bitLength() > MAX_NUMBER_BITS)
+            ? this.toHex()
+            : this.toNumber();
+    }
+    /**
+     * @description Returns the value in a primitive form, either number when <= 52 bits, or string otherwise
+     */
+    toPrimitive() {
+        return super.bitLength() > MAX_NUMBER_BITS
+            ? this.toString()
+            : this.toNumber();
+    }
+    /**
+     * @description Returns the base runtime type name for this instance
+     */
+    toRawType() {
+        // NOTE In the case of balances, which have a special meaning on the UI
+        // and can be interpreted differently, return a specific value for it so
+        // underlying it always matches (no matter which length it actually is)
+        return this instanceof this.registry.createClassUnsafe('Balance')
+            ? 'Balance'
+            : `${this.isUnsigned ? 'u' : 'i'}${this.bitLength()}`;
+    }
+    /**
+     * @description Returns the string representation of the value
+     * @param base The base to use for the conversion
+     */
+    toString(base) {
+        // only included here since we do not inherit docs
+        return super.toString(base);
+    }
+    /**
+     * @description Encodes the value as a Uint8Array as per the SCALE specifications
+     */
+    toU8a(_isBare) {
+        return bnToU8a(this, {
+            bitLength: this.bitLength(),
+            isLe: true,
+            isNegative: !this.isUnsigned
+        });
+    }
+}