@polkadot/types-codec 6.12.2-2

package/utils/sortValues.cjs

@@ -0,0 +1,89 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sortAsc = sortAsc;
+exports.sortMap = sortMap;
+exports.sortSet = sortSet;
+
+var _util = require("@polkadot/util");
+
+// Copyright 2017-2021 @polkadot/types-codec authors & contributors
+// SPDX-License-Identifier: Apache-2.0
+
+/** @internal **/
+function isArrayLike(arg) {
+  return arg instanceof Uint8Array || Array.isArray(arg);
+}
+/** @internal **/
+
+
+function isCodec(arg) {
+  return (0, _util.isFunction)(arg && arg.toU8a);
+}
+/** @internal **/
+
+
+function isEnum(arg) {
+  return isCodec(arg) && (0, _util.isNumber)(arg.index) && isCodec(arg.value);
+}
+/** @internal */
+
+
+function isNumberLike(arg) {
+  return (0, _util.isNumber)(arg) || (0, _util.isBn)(arg) || (0, _util.isBigInt)(arg);
+}
+/** @internal */
+
+
+function sortArray(a, b) {
+  // Vec, Tuple, Bytes etc.
+  let sortRes = 0;
+  const minLen = Math.min(a.length, b.length);
+
+  for (let i = 0; i < minLen; ++i) {
+    sortRes = sortAsc(a[i], b[i]);
+
+    if (sortRes !== 0) {
+      return sortRes;
+    }
+  }
+
+  return a.length - b.length;
+}
+/**
+* Sort keys/values of BTreeSet/BTreeMap in ascending order for encoding compatibility with Rust's BTreeSet/BTreeMap
+* (https://doc.rust-lang.org/stable/std/collections/struct.BTreeSet.html)
+* (https://doc.rust-lang.org/stable/std/collections/struct.BTreeMap.html)
+*/
+
+
+function sortAsc(a, b) {
+  if (isNumberLike(a) && isNumberLike(b)) {
+    return (0, _util.bnToBn)(a).cmp((0, _util.bnToBn)(b));
+  } else if (a instanceof Map && b instanceof Map) {
+    return sortAsc(Array.from(a.values()), Array.from(b.values()));
+  } else if (isEnum(a) && isEnum(b)) {
+    return sortAsc(a.index, b.index) || sortAsc(a.value, b.value);
+  } else if (isArrayLike(a) && isArrayLike(b)) {
+    return sortArray(a, b);
+  } else if (isCodec(a) && isCodec(b)) {
+    // Text, Bool etc.
+    return sortAsc(a.toU8a(true), b.toU8a(true));
+  }
+
+  throw new Error(`Attempting to sort unrecognized values: ${(0, _util.stringify)(a)} (typeof ${typeof a}) <-> ${(0, _util.stringify)(b)} (typeof ${typeof b})`);
+}
+
+function sortSet(set) {
+  return new Set(Array.from(set).sort(sortAsc));
+}
+
+function sortMap(map) {
+  return new Map(Array.from(map.entries()).sort((_ref, _ref2) => {
+    let [keyA] = _ref;
+    let [keyB] = _ref2;
+    return sortAsc(keyA, keyB);
+  }));
+}

package/utils/sortValues.d.ts

@@ -0,0 +1,13 @@
+/// <reference types="bn.js" />
+import type { BN } from '@polkadot/util';
+import type { Codec } from '../types';
+declare type SortArg = Codec | Codec[] | number[] | BN | bigint | number | Uint8Array;
+/**
+* Sort keys/values of BTreeSet/BTreeMap in ascending order for encoding compatibility with Rust's BTreeSet/BTreeMap
+* (https://doc.rust-lang.org/stable/std/collections/struct.BTreeSet.html)
+* (https://doc.rust-lang.org/stable/std/collections/struct.BTreeMap.html)
+*/
+export declare function sortAsc<V extends SortArg = Codec>(a: V, b: V): number;
+export declare function sortSet<V extends Codec = Codec>(set: Set<V>): Set<V>;
+export declare function sortMap<K extends Codec = Codec, V extends Codec = Codec>(map: Map<K, V>): Map<K, V>;
+export {};

package/utils/sortValues.js

@@ -0,0 +1,73 @@
+// Copyright 2017-2021 @polkadot/types-codec authors & contributors
+// SPDX-License-Identifier: Apache-2.0
+import { bnToBn, isBigInt, isBn, isFunction, isNumber, stringify } from '@polkadot/util';
+
+/** @internal **/
+function isArrayLike(arg) {
+  return arg instanceof Uint8Array || Array.isArray(arg);
+}
+/** @internal **/
+
+
+function isCodec(arg) {
+  return isFunction(arg && arg.toU8a);
+}
+/** @internal **/
+
+
+function isEnum(arg) {
+  return isCodec(arg) && isNumber(arg.index) && isCodec(arg.value);
+}
+/** @internal */
+
+
+function isNumberLike(arg) {
+  return isNumber(arg) || isBn(arg) || isBigInt(arg);
+}
+/** @internal */
+
+
+function sortArray(a, b) {
+  // Vec, Tuple, Bytes etc.
+  let sortRes = 0;
+  const minLen = Math.min(a.length, b.length);
+
+  for (let i = 0; i < minLen; ++i) {
+    sortRes = sortAsc(a[i], b[i]);
+
+    if (sortRes !== 0) {
+      return sortRes;
+    }
+  }
+
+  return a.length - b.length;
+}
+/**
+* Sort keys/values of BTreeSet/BTreeMap in ascending order for encoding compatibility with Rust's BTreeSet/BTreeMap
+* (https://doc.rust-lang.org/stable/std/collections/struct.BTreeSet.html)
+* (https://doc.rust-lang.org/stable/std/collections/struct.BTreeMap.html)
+*/
+
+
+export function sortAsc(a, b) {
+  if (isNumberLike(a) && isNumberLike(b)) {
+    return bnToBn(a).cmp(bnToBn(b));
+  } else if (a instanceof Map && b instanceof Map) {
+    return sortAsc(Array.from(a.values()), Array.from(b.values()));
+  } else if (isEnum(a) && isEnum(b)) {
+    return sortAsc(a.index, b.index) || sortAsc(a.value, b.value);
+  } else if (isArrayLike(a) && isArrayLike(b)) {
+    return sortArray(a, b);
+  } else if (isCodec(a) && isCodec(b)) {
+    // Text, Bool etc.
+    return sortAsc(a.toU8a(true), b.toU8a(true));
+  }
+
+  throw new Error(`Attempting to sort unrecognized values: ${stringify(a)} (typeof ${typeof a}) <-> ${stringify(b)} (typeof ${typeof b})`);
+}
+export function sortSet(set) {
+  return new Set(Array.from(set).sort(sortAsc));
+}
+export function sortMap(map) {
+  return new Map(Array.from(map.entries()).sort(([keyA], [keyB]) => sortAsc(keyA, keyB)));
+}

package/utils/typeToConstructor.cjs

@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.typeToConstructor = typeToConstructor;
+
+var _util = require("@polkadot/util");
+
+// Copyright 2017-2021 @polkadot/types-codec authors & contributors
+// SPDX-License-Identifier: Apache-2.0
+function typeToConstructor(registry, type) {
+  return (0, _util.isString)(type) ? registry.createClassUnsafe(type) : type;
+}

package/utils/typeToConstructor.d.ts

@@ -0,0 +1,2 @@
+import type { Codec, CodecClass, CodecRegistry } from '../types';
+export declare function typeToConstructor<T extends Codec = Codec>(registry: CodecRegistry, type: string | CodecClass<T>): CodecClass<T>;

package/utils/typeToConstructor.js

@@ -0,0 +1,6 @@
+// Copyright 2017-2021 @polkadot/types-codec authors & contributors
+// SPDX-License-Identifier: Apache-2.0
+import { isString } from '@polkadot/util';
+export function typeToConstructor(registry, type) {
+  return isString(type) ? registry.createClassUnsafe(type) : type;
+}

package/utils/typesToMap.cjs

@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.typesToMap = typesToMap;
+
+// Copyright 2017-2021 @polkadot/types-codec authors & contributors
+// SPDX-License-Identifier: Apache-2.0
+function typesToMap(registry, Types) {
+  const entries = Object.entries(Types);
+  const result = {};
+
+  for (let i = 0; i < entries.length; i++) {
+    const [key, Type] = entries[i];
+    result[key] = registry.getClassName(Type) || new Type(registry).toRawType();
+  }
+
+  return result;
+}

package/utils/typesToMap.d.ts

@@ -0,0 +1,2 @@
+import type { CodecClass, CodecRegistry } from '../types';
+export declare function typesToMap(registry: CodecRegistry, Types: Record<string, CodecClass>): Record<string, string>;

package/utils/typesToMap.js

@@ -0,0 +1,13 @@
+// Copyright 2017-2021 @polkadot/types-codec authors & contributors
+// SPDX-License-Identifier: Apache-2.0
+export function typesToMap(registry, Types) {
+  const entries = Object.entries(Types);
+  const result = {};
+
+  for (let i = 0; i < entries.length; i++) {
+    const [key, Type] = entries[i];
+    result[key] = registry.getClassName(Type) || new Type(registry).toRawType();
+  }
+
+  return result;
+}

package/utils/util.cjs

@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.hasEq = hasEq;
+
+var _util = require("@polkadot/util");
+
+// Copyright 2017-2021 @polkadot/types-codec authors & contributors
+// SPDX-License-Identifier: Apache-2.0
+function hasEq(o) {
+  // eslint-disable-next-line @typescript-eslint/no-unsafe-member-access
+  return (0, _util.isFunction)(o.eq);
+}

package/utils/util.d.ts

@@ -0,0 +1,3 @@
+export declare function hasEq(o: unknown): o is {
+    eq: (other: unknown) => boolean;
+};

package/utils/util.js

@@ -0,0 +1,7 @@
+// Copyright 2017-2021 @polkadot/types-codec authors & contributors
+// SPDX-License-Identifier: Apache-2.0
+import { isFunction } from '@polkadot/util';
+export function hasEq(o) {
+  // eslint-disable-next-line @typescript-eslint/no-unsafe-member-access
+  return isFunction(o.eq);
+}