@aeternity/aepp-sdk 9.0.1 → 10.0.0-beta.1

package/es/utils/mptree.js

@@ -1,15 +1,3 @@
-import _slicedToArray from "@babel/runtime-corejs3/helpers/slicedToArray";
-import _classCallCheck from "@babel/runtime-corejs3/helpers/classCallCheck";
-import _createClass from "@babel/runtime-corejs3/helpers/createClass";
-import _Object$fromEntries from "@babel/runtime-corejs3/core-js-stable/object/from-entries";
-import _mapInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/map";
-import _forEachInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/for-each";
-import _Object$entries from "@babel/runtime-corejs3/core-js-stable/object/entries";
-import _filterInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/filter";
-import _sliceInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/slice";
-import _parseInt from "@babel/runtime-corejs3/core-js-stable/parse-int";
-import _includesInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/includes";
-
 /*
  * ISC License (ISC)
  * Copyright (c) 2021 aeternity developers
@@ -36,53 +24,41 @@ var NodeType;
   NodeType[NodeType["Leaf"] = 2] = "Leaf";
 })(NodeType || (NodeType = {}));
 
-var MPTree = /*#__PURE__*/function () {
+export default class MPTree {
+  static nodeHash(node) {
+    return Buffer.from(hash(rlpEncode(node))).toString('hex');
+  }
   /**
    * Deserialize Merkle Patricia Tree
    * @rtype (binary: Array) => MPTree
    * @param {Array} binary - Binary
    * @return {MPTree} Merkle Patricia Tree
    */
-  function MPTree(binary) {
-    var _context,
-        _context2,
-        _this = this;
 
-    _classCallCheck(this, MPTree);
 
+  constructor(binary) {
     this.rootHash = binary[0].toString('hex');
-    this.nodes = _Object$fromEntries(_mapInstanceProperty(_context = binary[1]).call(_context, function (node) {
-      return [node[0].toString('hex'), node[1]];
-    }));
+    this.nodes = Object.fromEntries(binary[1].map(node => [node[0].toString('hex'), node[1]]));
     if (this.nodes[this.rootHash] === undefined) throw new Error('Can\'t find a node by root hash');
-
-    _forEachInstanceProperty(_context2 = _Object$entries(this.nodes)).call(_context2, function (_ref) {
-      var _context3, _context4;
-
-      var _ref2 = _slicedToArray(_ref, 2),
-          key = _ref2[0],
-          node = _ref2[1];
-
+    Object.entries(this.nodes).forEach(_ref => {
+      let [key, node] = _ref;
       if (MPTree.nodeHash(node) !== key) throw new Error('Node hash is not equal to provided one');
-
-      var _MPTree$parseNode = MPTree.parseNode(node),
-          type = _MPTree$parseNode.type,
-          payload = _MPTree$parseNode.payload;
+      const {
+        type,
+        payload
+      } = MPTree.parseNode(node);
 
       switch (type) {
         case NodeType.Branch:
-          _forEachInstanceProperty(_context3 = _filterInstanceProperty(_context4 = _sliceInstanceProperty(payload).call(payload, 0, 16)).call(_context4, function (n) {
-            return n.length;
-          })).call(_context3, function (n) {
-            if (_this.nodes[n.toString('hex')] === undefined) {
+          payload.slice(0, 16).filter(n => n.length).forEach(n => {
+            if (this.nodes[n.toString('hex')] === undefined) {
               throw new Error('Can\'t find a node by hash in branch node');
             }
           });
-
           break;
 
         case NodeType.Extension:
-          if (_this.nodes[payload[0].toString('hex')] === undefined) {
+          if (this.nodes[payload[0].toString('hex')] === undefined) {
             throw new Error('Can\'t find a node by hash in extension node');
           }
 
@@ -90,109 +66,87 @@ var MPTree = /*#__PURE__*/function () {
     });
   }
 
-  _createClass(MPTree, [{
-    key: "isEqual",
-    value: function isEqual(tree) {
-      return this.rootHash === tree.rootHash;
-    }
-  }, {
-    key: "serialize",
-    value:
-    /**
-     * Serialize Merkle Patricia Tree
-     * @rtype () => Array
-     * @return {Array} Binary
-     */
-    function serialize() {
-      var _context5;
-
-      return [Buffer.from(this.rootHash, 'hex'), _mapInstanceProperty(_context5 = _Object$entries(this.nodes)).call(_context5, function (_ref3) {
-        var _ref4 = _slicedToArray(_ref3, 2),
-            mptHash = _ref4[0],
-            value = _ref4[1];
-
-        return [Buffer.from(mptHash, 'hex'), value];
-      })];
-    }
-    /**
-     * Retrieve value from Merkle Patricia Tree
-     * @rtype (key: String) => Buffer
-     * @param {String} key - The key of the element to retrieve
-     * @return {Buffer} Value associated to the specified key
-     */
-
-  }, {
-    key: "get",
-    value: function get(key) {
-      var searchFrom = this.rootHash;
-
-      while (true) {
-        var _MPTree$parseNode2 = MPTree.parseNode(this.nodes[searchFrom]),
-            type = _MPTree$parseNode2.type,
-            payload = _MPTree$parseNode2.payload,
-            path = _MPTree$parseNode2.path;
-
-        switch (type) {
-          case NodeType.Branch:
-            if (key.length === 0) return payload[16];
-            searchFrom = payload[_parseInt(key[0], 16)].toString('hex');
-            key = key.substr(1);
-            break;
-
-          case NodeType.Extension:
-            if (key.substr(0, path === null || path === void 0 ? void 0 : path.length) !== path) return undefined;
-            searchFrom = payload[0].toString('hex');
-            key = key.substr(path.length);
-            break;
-
-          case NodeType.Leaf:
-            if (path !== key) return undefined;
-            return payload[0];
-        }
-      }
-    }
-  }], [{
-    key: "nodeHash",
-    value: function nodeHash(node) {
-      return Buffer.from(hash(rlpEncode(node))).toString('hex');
-    }
-  }, {
-    key: "parseNode",
-    value: function parseNode(node) {
-      switch (node.length) {
-        case 17:
+  isEqual(tree) {
+    return this.rootHash === tree.rootHash;
+  }
+
+  static parseNode(node) {
+    switch (node.length) {
+      case 17:
+        return {
+          type: NodeType.Branch,
+          payload: node,
+          path: null
+        };
+
+      case 2:
+        {
+          const path = node[0].toString('hex');
+          const nibble = parseInt(path[0], 16);
+          if (nibble > 3) throw new Error(`Unknown path nibble: ${nibble}`);
+          const type = nibble <= 1 ? NodeType.Extension : NodeType.Leaf;
+          const slice = [0, 2].includes(nibble) ? 2 : 1;
           return {
-            type: NodeType.Branch,
-            payload: node,
-            path: null
+            type,
+            payload: [node[1]],
+            path: path.slice(slice)
           };
+        }
 
-        case 2:
-          {
-            var _context6;
+      default:
+        throw new Error(`Unknown node length: ${node.length}`);
+    }
+  }
+  /**
+   * Serialize Merkle Patricia Tree
+   * @rtype () => Array
+   * @return {Array} Binary
+   */
 
-            var path = node[0].toString('hex');
 
-            var nibble = _parseInt(path[0], 16);
+  serialize() {
+    return [Buffer.from(this.rootHash, 'hex'), Object.entries(this.nodes).map(_ref2 => {
+      let [mptHash, value] = _ref2;
+      return [Buffer.from(mptHash, 'hex'), value];
+    })];
+  }
+  /**
+   * Retrieve value from Merkle Patricia Tree
+   * @rtype (key: String) => Buffer
+   * @param {String} key - The key of the element to retrieve
+   * @return {Buffer} Value associated to the specified key
+   */
 
-            if (nibble > 3) throw new Error("Unknown path nibble: ".concat(nibble));
-            var type = nibble <= 1 ? NodeType.Extension : NodeType.Leaf;
-            var slice = _includesInstanceProperty(_context6 = [0, 2]).call(_context6, nibble) ? 2 : 1;
-            return {
-              type: type,
-              payload: [node[1]],
-              path: _sliceInstanceProperty(path).call(path, slice)
-            };
-          }
 
-        default:
-          throw new Error("Unknown node length: ".concat(node.length));
+  get(key) {
+    let searchFrom = this.rootHash;
+
+    while (true) {
+      const {
+        type,
+        payload,
+        path
+      } = MPTree.parseNode(this.nodes[searchFrom]);
+
+      switch (type) {
+        case NodeType.Branch:
+          if (key.length === 0) return payload[16];
+          searchFrom = payload[parseInt(key[0], 16)].toString('hex');
+          key = key.substr(1);
+          break;
+
+        case NodeType.Extension:
+          if (key.substr(0, path === null || path === void 0 ? void 0 : path.length) !== path) return undefined;
+          searchFrom = payload[0].toString('hex');
+          key = key.substr(path.length);
+          break;
+
+        case NodeType.Leaf:
+          if (path !== key) return undefined;
+          return payload[0];
       }
     }
-  }]);
-
-  return MPTree;
-}();
+  }
 
-export { MPTree as default };
+}
 //# sourceMappingURL=mptree.js.map

package/es/utils/mptree.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/utils/mptree.ts"],"names":["encode","rlpEncode","hash","NodeType","MPTree","binary","rootHash","toString","nodes","node","undefined","Error","key","nodeHash","parseNode","type","payload","Branch","n","length","Extension","tree","Buffer","from","mptHash","value","searchFrom","path","substr","Leaf","nibble","slice"],"mappings":";;;;;;;;;;;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAEA,SAASA,MAAM,IAAIC,SAAnB,QAAoC,KAApC;AAEA,SAASC,IAAT,QAAqB,aAArB;IAEKC,Q;;WAAAA,Q;AAAAA,EAAAA,Q,CAAAA,Q;AAAAA,EAAAA,Q,CAAAA,Q;AAAAA,EAAAA,Q,CAAAA,Q;GAAAA,Q,KAAAA,Q;;IAQgBC,M;AAQnB;AACF;AACA;AACA;AACA;AACA;AACE,kBAAaC,MAAb,EAAmC;AAAA;AAAA;AAAA;;AAAA;;AACjC,SAAKC,QAAL,GAAgBD,MAAM,CAAC,CAAD,CAAN,CAAUE,QAAV,CAAmB,KAAnB,CAAhB;AACA,SAAKC,KAAL,GAAa,oBACX,gCAAAH,MAAM,CAAC,CAAD,CAAN,iBAAc,UAACI,IAAD;AAAA,aAAU,CAACA,IAAI,CAAC,CAAD,CAAJ,CAAQF,QAAR,CAAiB,KAAjB,CAAD,EAA0BE,IAAI,CAAC,CAAD,CAA9B,CAAV;AAAA,KAAd,CADW,CAAb;AAIA,QAAI,KAAKD,KAAL,CAAW,KAAKF,QAAhB,MAA8BI,SAAlC,EAA6C,MAAM,IAAIC,KAAJ,CAAU,iCAAV,CAAN;;AAC7C,yDAAe,KAAKH,KAApB,mBAAmC,gBAAiB;AAAA;;AAAA;AAAA,UAAfI,GAAe;AAAA,UAAVH,IAAU;;AAClD,UAAIL,MAAM,CAACS,QAAP,CAAgBJ,IAAhB,MAA0BG,GAA9B,EAAmC,MAAM,IAAID,KAAJ,CAAU,wCAAV,CAAN;;AACnC,8BAA0BP,MAAM,CAACU,SAAP,CAAiBL,IAAjB,CAA1B;AAAA,UAAQM,IAAR,qBAAQA,IAAR;AAAA,UAAcC,OAAd,qBAAcA,OAAd;;AACA,cAAQD,IAAR;AACE,aAAKZ,QAAQ,CAACc,MAAd;AACE,0GAAAD,OAAO,MAAP,CAAAA,OAAO,EACE,CADF,EACK,EADL,CAAP,kBAEU,UAAAE,CAAC;AAAA,mBAAIA,CAAC,CAACC,MAAN;AAAA,WAFX,mBAGW,UAACD,CAAD,EAAO;AACd,gBAAI,KAAI,CAACV,KAAL,CAAWU,CAAC,CAACX,QAAF,CAAW,KAAX,CAAX,MAAkCG,SAAtC,EAAiD;AAC/C,oBAAM,IAAIC,KAAJ,CAAU,2CAAV,CAAN;AACD;AACF,WAPH;;AAQA;;AACF,aAAKR,QAAQ,CAACiB,SAAd;AACE,cAAI,KAAI,CAACZ,KAAL,CAAWQ,OAAO,CAAC,CAAD,CAAP,CAAWT,QAAX,CAAoB,KAApB,CAAX,MAA2CG,SAA/C,EAA0D;AACxD,kBAAM,IAAIC,KAAJ,CAAU,8CAAV,CAAN;AACD;;AAdL;AAgBD,KAnBD;AAoBD;;;;WAED,iBAASU,IAAT,EAAgC;AAC9B,aAAO,KAAKf,QAAL,KAAkBe,IAAI,CAACf,QAA9B;AACD;;;;AAmBD;AACF;AACA;AACA;AACA;AACE,yBAA2B;AAAA;;AACzB,aAAO,CACLgB,MAAM,CAACC,IAAP,CAAY,KAAKjB,QAAjB,EAA2B,KAA3B,CADK,EAEL,iDAAe,KAAKE,KAApB,mBAA+B;AAAA;AAAA,YAAEgB,OAAF;AAAA,YAAWC,KAAX;;AAAA,eAAuB,CACpDH,MAAM,CAACC,IAAP,CAAYC,OAAZ,EAAqB,KAArB,CADoD,EAEpDC,KAFoD,CAAvB;AAAA,OAA/B,CAFK,CAAP;AAOD;AAED;AACF;AACA;AACA;AACA;AACA;;;;WACE,aAAKb,GAAL,EAAsC;AACpC,UAAIc,UAAU,GAAG,KAAKpB,QAAtB;;AACA,aAAO,IAAP,EAAa;AACX,iCAAgCF,MAAM,CAACU,SAAP,CAAiB,KAAKN,KAAL,CAAWkB,UAAX,CAAjB,CAAhC;AAAA,YAAQX,IAAR,sBAAQA,IAAR;AAAA,YAAcC,OAAd,sBAAcA,OAAd;AAAA,YAAuBW,IAAvB,sBAAuBA,IAAvB;;AACA,gBAAQZ,IAAR;AACE,eAAKZ,QAAQ,CAACc,MAAd;AACE,gBAAIL,GAAG,CAACO,MAAJ,KAAe,CAAnB,EAAsB,OAAOH,OAAO,CAAC,EAAD,CAAd;AACtBU,YAAAA,UAAU,GAAGV,OAAO,CAAC,UAASJ,GAAG,CAAC,CAAD,CAAZ,EAAiB,EAAjB,CAAD,CAAP,CAA8BL,QAA9B,CAAuC,KAAvC,CAAb;AACAK,YAAAA,GAAG,GAAGA,GAAG,CAACgB,MAAJ,CAAW,CAAX,CAAN;AACA;;AACF,eAAKzB,QAAQ,CAACiB,SAAd;AACE,gBAAIR,GAAG,CAACgB,MAAJ,CAAW,CAAX,EAAcD,IAAd,aAAcA,IAAd,uBAAcA,IAAI,CAAER,MAApB,MAAgCQ,IAApC,EAA0C,OAAOjB,SAAP;AAC1CgB,YAAAA,UAAU,GAAGV,OAAO,CAAC,CAAD,CAAP,CAAWT,QAAX,CAAoB,KAApB,CAAb;AACAK,YAAAA,GAAG,GAAGA,GAAG,CAACgB,MAAJ,CAAWD,IAAI,CAACR,MAAhB,CAAN;AACA;;AACF,eAAKhB,QAAQ,CAAC0B,IAAd;AACE,gBAAIF,IAAI,KAAKf,GAAb,EAAkB,OAAOF,SAAP;AAClB,mBAAOM,OAAO,CAAC,CAAD,CAAd;AAbJ;AAeD;AACF;;;WArGD,kBAAyBP,IAAzB,EAA8C;AAC5C,aAAOa,MAAM,CAACC,IAAP,CAAYrB,IAAI,CAACD,SAAS,CAACQ,IAAD,CAAV,CAAhB,EAAmCF,QAAnC,CAA4C,KAA5C,CAAP;AACD;;;WAyCD,mBAA0BE,IAA1B,EAAsG;AACpG,cAAQA,IAAI,CAACU,MAAb;AACE,aAAK,EAAL;AACE,iBAAO;AAAEJ,YAAAA,IAAI,EAAEZ,QAAQ,CAACc,MAAjB;AAAyBD,YAAAA,OAAO,EAAEP,IAAlC;AAAwCkB,YAAAA,IAAI,EAAE;AAA9C,WAAP;;AACF,aAAK,CAAL;AAAQ;AAAA;;AACN,gBAAMA,IAAI,GAAGlB,IAAI,CAAC,CAAD,CAAJ,CAAQF,QAAR,CAAiB,KAAjB,CAAb;;AACA,gBAAMuB,MAAM,GAAG,UAASH,IAAI,CAAC,CAAD,CAAb,EAAkB,EAAlB,CAAf;;AACA,gBAAIG,MAAM,GAAG,CAAb,EAAgB,MAAM,IAAInB,KAAJ,gCAAkCmB,MAAlC,EAAN;AAChB,gBAAMf,IAAI,GAAGe,MAAM,IAAI,CAAV,GAAc3B,QAAQ,CAACiB,SAAvB,GAAmCjB,QAAQ,CAAC0B,IAAzD;AACA,gBAAME,KAAK,GAAG,uCAAC,CAAD,EAAI,CAAJ,mBAAgBD,MAAhB,IAA0B,CAA1B,GAA8B,CAA5C;AACA,mBAAO;AAAEf,cAAAA,IAAI,EAAJA,IAAF;AAAQC,cAAAA,OAAO,EAAE,CAACP,IAAI,CAAC,CAAD,CAAL,CAAjB;AAA4BkB,cAAAA,IAAI,EAAE,uBAAAA,IAAI,MAAJ,CAAAA,IAAI,EAAOI,KAAP;AAAtC,aAAP;AACD;;AACD;AACE,gBAAM,IAAIpB,KAAJ,gCAAkCF,IAAI,CAACU,MAAvC,EAAN;AAZJ;AAcD;;;;;;SA9DkBf,M","sourcesContent":["/*\n * ISC License (ISC)\n * Copyright (c) 2021 aeternity developers\n *\n *  Permission to use, copy, modify, and/or distribute this software for any\n *  purpose with or without fee is hereby granted, provided that the above\n *  copyright notice and this permission notice appear in all copies.\n *\n *  THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\n *  REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\n *  AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\n *  INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\n *  LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\n *  OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\n *  PERFORMANCE OF THIS SOFTWARE.\n */\n\nimport { encode as rlpEncode } from 'rlp'\nimport type { Input } from 'rlp'\nimport { hash } from './crypto-ts'\n\nenum NodeType {\n  Branch,\n  Extension,\n  Leaf\n}\n\nexport type MPTreeBinary = [Buffer, Array<[Buffer, Buffer[]]>]\n\nexport default class MPTree {\n  private readonly rootHash: string\n  private readonly nodes: { [key: string]: Buffer[] }\n\n  private static nodeHash (node: Input): string {\n    return Buffer.from(hash(rlpEncode(node))).toString('hex')\n  }\n\n  /**\n   * Deserialize Merkle Patricia Tree\n   * @rtype (binary: Array) => MPTree\n   * @param {Array} binary - Binary\n   * @return {MPTree} Merkle Patricia Tree\n   */\n  constructor (binary: MPTreeBinary) {\n    this.rootHash = binary[0].toString('hex')\n    this.nodes = Object.fromEntries(\n      binary[1].map((node) => [node[0].toString('hex'), node[1]])\n    )\n\n    if (this.nodes[this.rootHash] === undefined) throw new Error('Can\\'t find a node by root hash')\n    Object.entries(this.nodes).forEach(([key, node]) => {\n      if (MPTree.nodeHash(node) !== key) throw new Error('Node hash is not equal to provided one')\n      const { type, payload } = MPTree.parseNode(node)\n      switch (type) {\n        case NodeType.Branch:\n          payload\n            .slice(0, 16)\n            .filter(n => n.length)\n            .forEach((n) => {\n              if (this.nodes[n.toString('hex')] === undefined) {\n                throw new Error('Can\\'t find a node by hash in branch node')\n              }\n            })\n          break\n        case NodeType.Extension:\n          if (this.nodes[payload[0].toString('hex')] === undefined) {\n            throw new Error('Can\\'t find a node by hash in extension node')\n          }\n      }\n    })\n  }\n\n  isEqual (tree: MPTree): boolean {\n    return this.rootHash === tree.rootHash\n  }\n\n  private static parseNode (node: Buffer[]): { type: NodeType, payload: Buffer[], path: string | null } {\n    switch (node.length) {\n      case 17:\n        return { type: NodeType.Branch, payload: node, path: null }\n      case 2: {\n        const path = node[0].toString('hex')\n        const nibble = parseInt(path[0], 16)\n        if (nibble > 3) throw new Error(`Unknown path nibble: ${nibble}`)\n        const type = nibble <= 1 ? NodeType.Extension : NodeType.Leaf\n        const slice = [0, 2].includes(nibble) ? 2 : 1\n        return { type, payload: [node[1]], path: path.slice(slice) }\n      }\n      default:\n        throw new Error(`Unknown node length: ${node.length}`)\n    }\n  }\n\n  /**\n   * Serialize Merkle Patricia Tree\n   * @rtype () => Array\n   * @return {Array} Binary\n   */\n  serialize (): MPTreeBinary {\n    return [\n      Buffer.from(this.rootHash, 'hex'),\n      Object.entries(this.nodes).map(([mptHash, value]) => ([\n        Buffer.from(mptHash, 'hex'),\n        value\n      ]))\n    ]\n  }\n\n  /**\n   * Retrieve value from Merkle Patricia Tree\n   * @rtype (key: String) => Buffer\n   * @param {String} key - The key of the element to retrieve\n   * @return {Buffer} Value associated to the specified key\n   */\n  get (key: string): Buffer | undefined {\n    let searchFrom = this.rootHash\n    while (true) {\n      const { type, payload, path } = MPTree.parseNode(this.nodes[searchFrom])\n      switch (type) {\n        case NodeType.Branch:\n          if (key.length === 0) return payload[16]\n          searchFrom = payload[parseInt(key[0], 16)].toString('hex')\n          key = key.substr(1)\n          break\n        case NodeType.Extension:\n          if (key.substr(0, path?.length) !== path) return undefined\n          searchFrom = payload[0].toString('hex')\n          key = key.substr(path.length)\n          break\n        case NodeType.Leaf:\n          if (path !== key) return undefined\n          return payload[0]\n      }\n    }\n  }\n}\n"],"file":"mptree.js"}
+{"version":3,"sources":["../../src/utils/mptree.ts"],"names":["encode","rlpEncode","hash","NodeType","MPTree","nodeHash","node","Buffer","from","toString","constructor","binary","rootHash","nodes","Object","fromEntries","map","undefined","Error","entries","forEach","key","type","payload","parseNode","Branch","slice","filter","n","length","Extension","isEqual","tree","path","nibble","parseInt","Leaf","includes","serialize","mptHash","value","get","searchFrom","substr"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAEA,SAASA,MAAM,IAAIC,SAAnB,QAAoC,KAApC;AAEA,SAASC,IAAT,QAAqB,aAArB;IAEKC,Q;;WAAAA,Q;AAAAA,EAAAA,Q,CAAAA,Q;AAAAA,EAAAA,Q,CAAAA,Q;AAAAA,EAAAA,Q,CAAAA,Q;GAAAA,Q,KAAAA,Q;;AAQL,eAAe,MAAMC,MAAN,CAAa;AAIH,SAARC,QAAQ,CAAEC,IAAF,EAAuB;AAC5C,WAAOC,MAAM,CAACC,IAAP,CAAYN,IAAI,CAACD,SAAS,CAACK,IAAD,CAAV,CAAhB,EAAmCG,QAAnC,CAA4C,KAA5C,CAAP;AACD;AAED;AACF;AACA;AACA;AACA;AACA;;;AACEC,EAAAA,WAAW,CAAEC,MAAF,EAAwB;AACjC,SAAKC,QAAL,GAAgBD,MAAM,CAAC,CAAD,CAAN,CAAUF,QAAV,CAAmB,KAAnB,CAAhB;AACA,SAAKI,KAAL,GAAaC,MAAM,CAACC,WAAP,CACXJ,MAAM,CAAC,CAAD,CAAN,CAAUK,GAAV,CAAeV,IAAD,IAAU,CAACA,IAAI,CAAC,CAAD,CAAJ,CAAQG,QAAR,CAAiB,KAAjB,CAAD,EAA0BH,IAAI,CAAC,CAAD,CAA9B,CAAxB,CADW,CAAb;AAIA,QAAI,KAAKO,KAAL,CAAW,KAAKD,QAAhB,MAA8BK,SAAlC,EAA6C,MAAM,IAAIC,KAAJ,CAAU,iCAAV,CAAN;AAC7CJ,IAAAA,MAAM,CAACK,OAAP,CAAe,KAAKN,KAApB,EAA2BO,OAA3B,CAAmC,QAAiB;AAAA,UAAhB,CAACC,GAAD,EAAMf,IAAN,CAAgB;AAClD,UAAIF,MAAM,CAACC,QAAP,CAAgBC,IAAhB,MAA0Be,GAA9B,EAAmC,MAAM,IAAIH,KAAJ,CAAU,wCAAV,CAAN;AACnC,YAAM;AAAEI,QAAAA,IAAF;AAAQC,QAAAA;AAAR,UAAoBnB,MAAM,CAACoB,SAAP,CAAiBlB,IAAjB,CAA1B;;AACA,cAAQgB,IAAR;AACE,aAAKnB,QAAQ,CAACsB,MAAd;AACEF,UAAAA,OAAO,CACJG,KADH,CACS,CADT,EACY,EADZ,EAEGC,MAFH,CAEUC,CAAC,IAAIA,CAAC,CAACC,MAFjB,EAGGT,OAHH,CAGYQ,CAAD,IAAO;AACd,gBAAI,KAAKf,KAAL,CAAWe,CAAC,CAACnB,QAAF,CAAW,KAAX,CAAX,MAAkCQ,SAAtC,EAAiD;AAC/C,oBAAM,IAAIC,KAAJ,CAAU,2CAAV,CAAN;AACD;AACF,WAPH;AAQA;;AACF,aAAKf,QAAQ,CAAC2B,SAAd;AACE,cAAI,KAAKjB,KAAL,CAAWU,OAAO,CAAC,CAAD,CAAP,CAAWd,QAAX,CAAoB,KAApB,CAAX,MAA2CQ,SAA/C,EAA0D;AACxD,kBAAM,IAAIC,KAAJ,CAAU,8CAAV,CAAN;AACD;;AAdL;AAgBD,KAnBD;AAoBD;;AAEDa,EAAAA,OAAO,CAAEC,IAAF,EAAyB;AAC9B,WAAO,KAAKpB,QAAL,KAAkBoB,IAAI,CAACpB,QAA9B;AACD;;AAEuB,SAATY,SAAS,CAAElB,IAAF,EAA8E;AACpG,YAAQA,IAAI,CAACuB,MAAb;AACE,WAAK,EAAL;AACE,eAAO;AAAEP,UAAAA,IAAI,EAAEnB,QAAQ,CAACsB,MAAjB;AAAyBF,UAAAA,OAAO,EAAEjB,IAAlC;AAAwC2B,UAAAA,IAAI,EAAE;AAA9C,SAAP;;AACF,WAAK,CAAL;AAAQ;AACN,gBAAMA,IAAI,GAAG3B,IAAI,CAAC,CAAD,CAAJ,CAAQG,QAAR,CAAiB,KAAjB,CAAb;AACA,gBAAMyB,MAAM,GAAGC,QAAQ,CAACF,IAAI,CAAC,CAAD,CAAL,EAAU,EAAV,CAAvB;AACA,cAAIC,MAAM,GAAG,CAAb,EAAgB,MAAM,IAAIhB,KAAJ,CAAW,wBAAuBgB,MAAO,EAAzC,CAAN;AAChB,gBAAMZ,IAAI,GAAGY,MAAM,IAAI,CAAV,GAAc/B,QAAQ,CAAC2B,SAAvB,GAAmC3B,QAAQ,CAACiC,IAAzD;AACA,gBAAMV,KAAK,GAAG,CAAC,CAAD,EAAI,CAAJ,EAAOW,QAAP,CAAgBH,MAAhB,IAA0B,CAA1B,GAA8B,CAA5C;AACA,iBAAO;AAAEZ,YAAAA,IAAF;AAAQC,YAAAA,OAAO,EAAE,CAACjB,IAAI,CAAC,CAAD,CAAL,CAAjB;AAA4B2B,YAAAA,IAAI,EAAEA,IAAI,CAACP,KAAL,CAAWA,KAAX;AAAlC,WAAP;AACD;;AACD;AACE,cAAM,IAAIR,KAAJ,CAAW,wBAAuBZ,IAAI,CAACuB,MAAO,EAA9C,CAAN;AAZJ;AAcD;AAED;AACF;AACA;AACA;AACA;;;AACES,EAAAA,SAAS,GAAkB;AACzB,WAAO,CACL/B,MAAM,CAACC,IAAP,CAAY,KAAKI,QAAjB,EAA2B,KAA3B,CADK,EAELE,MAAM,CAACK,OAAP,CAAe,KAAKN,KAApB,EAA2BG,GAA3B,CAA+B;AAAA,UAAC,CAACuB,OAAD,EAAUC,KAAV,CAAD;AAAA,aAAuB,CACpDjC,MAAM,CAACC,IAAP,CAAY+B,OAAZ,EAAqB,KAArB,CADoD,EAEpDC,KAFoD,CAAvB;AAAA,KAA/B,CAFK,CAAP;AAOD;AAED;AACF;AACA;AACA;AACA;AACA;;;AACEC,EAAAA,GAAG,CAAEpB,GAAF,EAAmC;AACpC,QAAIqB,UAAU,GAAG,KAAK9B,QAAtB;;AACA,WAAO,IAAP,EAAa;AACX,YAAM;AAAEU,QAAAA,IAAF;AAAQC,QAAAA,OAAR;AAAiBU,QAAAA;AAAjB,UAA0B7B,MAAM,CAACoB,SAAP,CAAiB,KAAKX,KAAL,CAAW6B,UAAX,CAAjB,CAAhC;;AACA,cAAQpB,IAAR;AACE,aAAKnB,QAAQ,CAACsB,MAAd;AACE,cAAIJ,GAAG,CAACQ,MAAJ,KAAe,CAAnB,EAAsB,OAAON,OAAO,CAAC,EAAD,CAAd;AACtBmB,UAAAA,UAAU,GAAGnB,OAAO,CAACY,QAAQ,CAACd,GAAG,CAAC,CAAD,CAAJ,EAAS,EAAT,CAAT,CAAP,CAA8BZ,QAA9B,CAAuC,KAAvC,CAAb;AACAY,UAAAA,GAAG,GAAGA,GAAG,CAACsB,MAAJ,CAAW,CAAX,CAAN;AACA;;AACF,aAAKxC,QAAQ,CAAC2B,SAAd;AACE,cAAIT,GAAG,CAACsB,MAAJ,CAAW,CAAX,EAAcV,IAAd,aAAcA,IAAd,uBAAcA,IAAI,CAAEJ,MAApB,MAAgCI,IAApC,EAA0C,OAAOhB,SAAP;AAC1CyB,UAAAA,UAAU,GAAGnB,OAAO,CAAC,CAAD,CAAP,CAAWd,QAAX,CAAoB,KAApB,CAAb;AACAY,UAAAA,GAAG,GAAGA,GAAG,CAACsB,MAAJ,CAAWV,IAAI,CAACJ,MAAhB,CAAN;AACA;;AACF,aAAK1B,QAAQ,CAACiC,IAAd;AACE,cAAIH,IAAI,KAAKZ,GAAb,EAAkB,OAAOJ,SAAP;AAClB,iBAAOM,OAAO,CAAC,CAAD,CAAd;AAbJ;AAeD;AACF;;AAzGyB","sourcesContent":["/*\n * ISC License (ISC)\n * Copyright (c) 2021 aeternity developers\n *\n *  Permission to use, copy, modify, and/or distribute this software for any\n *  purpose with or without fee is hereby granted, provided that the above\n *  copyright notice and this permission notice appear in all copies.\n *\n *  THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\n *  REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\n *  AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\n *  INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\n *  LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\n *  OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\n *  PERFORMANCE OF THIS SOFTWARE.\n */\n\nimport { encode as rlpEncode } from 'rlp'\nimport type { Input } from 'rlp'\nimport { hash } from './crypto-ts'\n\nenum NodeType {\n  Branch,\n  Extension,\n  Leaf\n}\n\nexport type MPTreeBinary = [Buffer, Array<[Buffer, Buffer[]]>]\n\nexport default class MPTree {\n  private readonly rootHash: string\n  private readonly nodes: { [key: string]: Buffer[] }\n\n  private static nodeHash (node: Input): string {\n    return Buffer.from(hash(rlpEncode(node))).toString('hex')\n  }\n\n  /**\n   * Deserialize Merkle Patricia Tree\n   * @rtype (binary: Array) => MPTree\n   * @param {Array} binary - Binary\n   * @return {MPTree} Merkle Patricia Tree\n   */\n  constructor (binary: MPTreeBinary) {\n    this.rootHash = binary[0].toString('hex')\n    this.nodes = Object.fromEntries(\n      binary[1].map((node) => [node[0].toString('hex'), node[1]])\n    )\n\n    if (this.nodes[this.rootHash] === undefined) throw new Error('Can\\'t find a node by root hash')\n    Object.entries(this.nodes).forEach(([key, node]) => {\n      if (MPTree.nodeHash(node) !== key) throw new Error('Node hash is not equal to provided one')\n      const { type, payload } = MPTree.parseNode(node)\n      switch (type) {\n        case NodeType.Branch:\n          payload\n            .slice(0, 16)\n            .filter(n => n.length)\n            .forEach((n) => {\n              if (this.nodes[n.toString('hex')] === undefined) {\n                throw new Error('Can\\'t find a node by hash in branch node')\n              }\n            })\n          break\n        case NodeType.Extension:\n          if (this.nodes[payload[0].toString('hex')] === undefined) {\n            throw new Error('Can\\'t find a node by hash in extension node')\n          }\n      }\n    })\n  }\n\n  isEqual (tree: MPTree): boolean {\n    return this.rootHash === tree.rootHash\n  }\n\n  private static parseNode (node: Buffer[]): { type: NodeType, payload: Buffer[], path: string | null } {\n    switch (node.length) {\n      case 17:\n        return { type: NodeType.Branch, payload: node, path: null }\n      case 2: {\n        const path = node[0].toString('hex')\n        const nibble = parseInt(path[0], 16)\n        if (nibble > 3) throw new Error(`Unknown path nibble: ${nibble}`)\n        const type = nibble <= 1 ? NodeType.Extension : NodeType.Leaf\n        const slice = [0, 2].includes(nibble) ? 2 : 1\n        return { type, payload: [node[1]], path: path.slice(slice) }\n      }\n      default:\n        throw new Error(`Unknown node length: ${node.length}`)\n    }\n  }\n\n  /**\n   * Serialize Merkle Patricia Tree\n   * @rtype () => Array\n   * @return {Array} Binary\n   */\n  serialize (): MPTreeBinary {\n    return [\n      Buffer.from(this.rootHash, 'hex'),\n      Object.entries(this.nodes).map(([mptHash, value]) => ([\n        Buffer.from(mptHash, 'hex'),\n        value\n      ]))\n    ]\n  }\n\n  /**\n   * Retrieve value from Merkle Patricia Tree\n   * @rtype (key: String) => Buffer\n   * @param {String} key - The key of the element to retrieve\n   * @return {Buffer} Value associated to the specified key\n   */\n  get (key: string): Buffer | undefined {\n    let searchFrom = this.rootHash\n    while (true) {\n      const { type, payload, path } = MPTree.parseNode(this.nodes[searchFrom])\n      switch (type) {\n        case NodeType.Branch:\n          if (key.length === 0) return payload[16]\n          searchFrom = payload[parseInt(key[0], 16)].toString('hex')\n          key = key.substr(1)\n          break\n        case NodeType.Extension:\n          if (key.substr(0, path?.length) !== path) return undefined\n          searchFrom = payload[0].toString('hex')\n          key = key.substr(path.length)\n          break\n        case NodeType.Leaf:\n          if (path !== key) return undefined\n          return payload[0]\n      }\n    }\n  }\n}\n"],"file":"mptree.js"}

package/es/utils/other.js

@@ -1,52 +1,7 @@
-import _slicedToArray from "@babel/runtime-corejs3/helpers/slicedToArray";
-import _typeof from "@babel/runtime-corejs3/helpers/typeof";
-import _asyncToGenerator from "@babel/runtime-corejs3/helpers/asyncToGenerator";
-import _regeneratorRuntime from "@babel/runtime-corejs3/regenerator";
-import _Promise from "@babel/runtime-corejs3/core-js-stable/promise";
-import _setTimeout from "@babel/runtime-corejs3/core-js-stable/set-timeout";
-import _Object$fromEntries from "@babel/runtime-corejs3/core-js-stable/object/from-entries";
-import _mapInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/map";
-import _Object$entries from "@babel/runtime-corejs3/core-js-stable/object/entries";
-import _filterInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/filter";
-import _Array$isArray from "@babel/runtime-corejs3/core-js-stable/array/is-array";
-import _bindInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/bind";
 import { snakeToPascal, pascalToSnake } from './string';
-export var pause = /*#__PURE__*/function () {
-  var _ref = _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime.mark(function _callee(duration) {
-    return _regeneratorRuntime.wrap(function _callee$(_context) {
-      while (1) {
-        switch (_context.prev = _context.next) {
-          case 0:
-            _context.next = 2;
-            return new _Promise(function (resolve) {
-              return _setTimeout(resolve, duration);
-            });
-
-          case 2:
-            return _context.abrupt("return", _context.sent);
-
-          case 3:
-          case "end":
-            return _context.stop();
-        }
-      }
-    }, _callee);
-  }));
-
-  return function pause(_x) {
-    return _ref.apply(this, arguments);
-  };
-}();
-export var mapObject = function mapObject(object, fn) {
-  var _context2;
-
-  return _Object$fromEntries(_mapInstanceProperty(_context2 = _Object$entries(object)).call(_context2, fn));
-};
-export var filterObject = function filterObject(object, fn) {
-  var _context3;
-
-  return _Object$fromEntries(_filterInstanceProperty(_context3 = _Object$entries(object)).call(_context3, fn));
-};
+export const pause = async duration => await new Promise(resolve => setTimeout(resolve, duration));
+export const mapObject = (object, fn) => Object.fromEntries(Object.entries(object).map(fn));
+export const filterObject = (object, fn) => Object.fromEntries(Object.entries(object).filter(fn));
 /**
  * Key traversal metafunction
  * @static
@@ -57,16 +12,11 @@ export var filterObject = function filterObject(object, fn) {
  * @return {Object} Transformed object
  */
 
-export var traverseKeys = function traverseKeys(fn, object) {
-  if (_typeof(object) !== 'object' || object === null) return object;
-  if (_Array$isArray(object)) return _mapInstanceProperty(object).call(object, function (i) {
-    return traverseKeys(fn, i);
-  });
-  return mapObject(object, function (_ref2) {
-    var _ref3 = _slicedToArray(_ref2, 2),
-        key = _ref3[0],
-        value = _ref3[1];
-
+export const traverseKeys = (fn, object) => {
+  if (typeof object !== 'object' || object === null) return object;
+  if (Array.isArray(object)) return object.map(i => traverseKeys(fn, i));
+  return mapObject(object, _ref => {
+    let [key, value] = _ref;
     return [fn(key), traverseKeys(fn, value)];
   });
 };
@@ -79,7 +29,7 @@ export var traverseKeys = function traverseKeys(fn, object) {
  * @see pascalToSnake
  */
 
-export var snakizeKeys = _bindInstanceProperty(traverseKeys).call(traverseKeys, null, pascalToSnake);
+export const snakizeKeys = traverseKeys.bind(null, pascalToSnake);
 /**
  * PascalCase key traversal
  * @static
@@ -89,5 +39,5 @@ export var snakizeKeys = _bindInstanceProperty(traverseKeys).call(traverseKeys,
  * @see snakeToPascal
  */
 
-export var pascalizeKeys = _bindInstanceProperty(traverseKeys).call(traverseKeys, null, snakeToPascal);
+export const pascalizeKeys = traverseKeys.bind(null, snakeToPascal);
 //# sourceMappingURL=other.js.map

package/es/utils/other.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/utils/other.ts"],"names":["snakeToPascal","pascalToSnake","pause","duration","resolve","mapObject","object","fn","filterObject","traverseKeys","i","key","value","snakizeKeys","pascalizeKeys"],"mappings":";;;;;;;;;;;;AAAA,SAASA,aAAT,EAAwBC,aAAxB,QAA6C,UAA7C;AAEA,OAAO,IAAMC,KAAK;AAAA,sEAAG,iBAAOC,QAAP;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,mBACb,aAAY,UAAAC,OAAO;AAAA,qBAAI,YAAWA,OAAX,EAAoBD,QAApB,CAAJ;AAAA,aAAnB,CADa;;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAAH;;AAAA,kBAALD,KAAK;AAAA;AAAA;AAAA,GAAX;AAGP,OAAO,IAAMG,SAAS,GAAG,SAAZA,SAAY,CACvBC,MADuB,EAEvBC,EAFuB;AAAA;;AAAA,SAGZ,oBAAmB,iDAAeD,MAAf,mBAA2BC,EAA3B,CAAnB,CAHY;AAAA,CAAlB;AAKP,OAAO,IAAMC,YAAY,GAAG,SAAfA,YAAe,CAC1BF,MAD0B,EAE1BC,EAF0B;AAAA;;AAAA,SAGf,oBAAmB,oDAAeD,MAAf,mBAA8BC,EAA9B,CAAnB,CAHe;AAAA,CAArB;AAKP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,OAAO,IAAME,YAAY,GAAG,SAAfA,YAAe,CAACF,EAAD,EAAeD,MAAf,EAAoC;AAC9D,MAAI,QAAOA,MAAP,MAAkB,QAAlB,IAA8BA,MAAM,KAAK,IAA7C,EAAmD,OAAOA,MAAP;AACnD,MAAI,eAAcA,MAAd,CAAJ,EAA2B,OAAO,qBAAAA,MAAM,MAAN,CAAAA,MAAM,EAAK,UAAAI,CAAC;AAAA,WAAID,YAAY,CAACF,EAAD,EAAKG,CAAL,CAAhB;AAAA,GAAN,CAAb;AAC3B,SAAOL,SAAS,CAACC,MAAD,EAAS;AAAA;AAAA,QAAEK,GAAF;AAAA,QAAOC,KAAP;;AAAA,WAAiC,CACxDL,EAAE,CAACI,GAAD,CADsD,EAC/CF,YAAY,CAACF,EAAD,EAAKK,KAAL,CADmC,CAAjC;AAAA,GAAT,CAAhB;AAGD,CANM;AAQP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,OAAO,IAAMC,WAAW,GAAG,sBAAAJ,YAAY,MAAZ,CAAAA,YAAY,EAAM,IAAN,EAAYR,aAAZ,CAAhC;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,OAAO,IAAMa,aAAa,GAAG,sBAAAL,YAAY,MAAZ,CAAAA,YAAY,EAAM,IAAN,EAAYT,aAAZ,CAAlC","sourcesContent":["import { snakeToPascal, pascalToSnake } from './string'\n\nexport const pause = async (duration: number): Promise<undefined> =>\n  await new Promise(resolve => setTimeout(resolve, duration))\n\nexport const mapObject = (\n  object: object,\n  fn: (value: [string, any], index: number, array: Array<[string, any]>) => Array<[string, any]>\n): object => Object.fromEntries(Object.entries(object).map(fn))\n\nexport const filterObject = (\n  object: object,\n  fn: (value: [string, any], index: number, array: Array<[string, any]>) => boolean\n): object => Object.fromEntries(Object.entries(object).filter(fn))\n\n/**\n * Key traversal metafunction\n * @static\n * @function\n * @rtype (fn: (s: String) => String) => (o: Object) => Object\n * @param {Function} fn - Key transformation function\n * @param {Object} object - Object to traverse\n * @return {Object} Transformed object\n */\nexport const traverseKeys = (fn: Function, object: any): any => {\n  if (typeof object !== 'object' || object === null) return object\n  if (Array.isArray(object)) return object.map(i => traverseKeys(fn, i))\n  return mapObject(object, ([key, value]: [string, any]) => [\n    fn(key), traverseKeys(fn, value)\n  ])\n}\n\n/**\n * snake_case key traversal\n * @static\n * @rtype (o: Object) => Object\n * @param {Object} object - Object to traverse\n * @return {Object} Transformed object\n * @see pascalToSnake\n */\nexport const snakizeKeys = traverseKeys.bind(null, pascalToSnake)\n\n/**\n * PascalCase key traversal\n * @static\n * @rtype (o: Object) => Object\n * @param {Object} object - Object to traverse\n * @return {Object} Transformed object\n * @see snakeToPascal\n */\nexport const pascalizeKeys = traverseKeys.bind(null, snakeToPascal)\n"],"file":"other.js"}
+{"version":3,"sources":["../../src/utils/other.ts"],"names":["snakeToPascal","pascalToSnake","pause","duration","Promise","resolve","setTimeout","mapObject","object","fn","Object","fromEntries","entries","map","filterObject","filter","traverseKeys","Array","isArray","i","key","value","snakizeKeys","bind","pascalizeKeys"],"mappings":"AAAA,SAASA,aAAT,EAAwBC,aAAxB,QAA6C,UAA7C;AAEA,OAAO,MAAMC,KAAK,GAAG,MAAOC,QAAP,IACnB,MAAM,IAAIC,OAAJ,CAAYC,OAAO,IAAIC,UAAU,CAACD,OAAD,EAAUF,QAAV,CAAjC,CADD;AAGP,OAAO,MAAMI,SAAS,GAAG,CACvBC,MADuB,EAEvBC,EAFuB,KAGZC,MAAM,CAACC,WAAP,CAAmBD,MAAM,CAACE,OAAP,CAAeJ,MAAf,EAAuBK,GAAvB,CAA2BJ,EAA3B,CAAnB,CAHN;AAKP,OAAO,MAAMK,YAAY,GAAG,CAC1BN,MAD0B,EAE1BC,EAF0B,KAGfC,MAAM,CAACC,WAAP,CAAmBD,MAAM,CAACE,OAAP,CAAeJ,MAAf,EAAuBO,MAAvB,CAA8BN,EAA9B,CAAnB,CAHN;AAKP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,OAAO,MAAMO,YAAY,GAAG,CAACP,EAAD,EAAeD,MAAf,KAAoC;AAC9D,MAAI,OAAOA,MAAP,KAAkB,QAAlB,IAA8BA,MAAM,KAAK,IAA7C,EAAmD,OAAOA,MAAP;AACnD,MAAIS,KAAK,CAACC,OAAN,CAAcV,MAAd,CAAJ,EAA2B,OAAOA,MAAM,CAACK,GAAP,CAAWM,CAAC,IAAIH,YAAY,CAACP,EAAD,EAAKU,CAAL,CAA5B,CAAP;AAC3B,SAAOZ,SAAS,CAACC,MAAD,EAAS;AAAA,QAAC,CAACY,GAAD,EAAMC,KAAN,CAAD;AAAA,WAAiC,CACxDZ,EAAE,CAACW,GAAD,CADsD,EAC/CJ,YAAY,CAACP,EAAD,EAAKY,KAAL,CADmC,CAAjC;AAAA,GAAT,CAAhB;AAGD,CANM;AAQP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,OAAO,MAAMC,WAAW,GAAGN,YAAY,CAACO,IAAb,CAAkB,IAAlB,EAAwBtB,aAAxB,CAApB;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,OAAO,MAAMuB,aAAa,GAAGR,YAAY,CAACO,IAAb,CAAkB,IAAlB,EAAwBvB,aAAxB,CAAtB","sourcesContent":["import { snakeToPascal, pascalToSnake } from './string'\n\nexport const pause = async (duration: number): Promise<void> =>\n  await new Promise(resolve => setTimeout(resolve, duration))\n\nexport const mapObject = (\n  object: object,\n  fn: (value: [string, any], index: number, array: Array<[string, any]>) => Array<[string, any]>\n): object => Object.fromEntries(Object.entries(object).map(fn))\n\nexport const filterObject = (\n  object: object,\n  fn: (value: [string, any], index: number, array: Array<[string, any]>) => boolean\n): object => Object.fromEntries(Object.entries(object).filter(fn))\n\n/**\n * Key traversal metafunction\n * @static\n * @function\n * @rtype (fn: (s: String) => String) => (o: Object) => Object\n * @param {Function} fn - Key transformation function\n * @param {Object} object - Object to traverse\n * @return {Object} Transformed object\n */\nexport const traverseKeys = (fn: Function, object: any): any => {\n  if (typeof object !== 'object' || object === null) return object\n  if (Array.isArray(object)) return object.map(i => traverseKeys(fn, i))\n  return mapObject(object, ([key, value]: [string, any]) => [\n    fn(key), traverseKeys(fn, value)\n  ])\n}\n\n/**\n * snake_case key traversal\n * @static\n * @rtype (o: Object) => Object\n * @param {Object} object - Object to traverse\n * @return {Object} Transformed object\n * @see pascalToSnake\n */\nexport const snakizeKeys = traverseKeys.bind(null, pascalToSnake)\n\n/**\n * PascalCase key traversal\n * @static\n * @rtype (o: Object) => Object\n * @param {Object} object - Object to traverse\n * @return {Object} Transformed object\n * @see snakeToPascal\n */\nexport const pascalizeKeys = traverseKeys.bind(null, snakeToPascal)\n"],"file":"other.js"}

package/es/utils/semver-satisfies.js

@@ -1,35 +1,16 @@
-import _toConsumableArray from "@babel/runtime-corejs3/helpers/toConsumableArray";
-import _mapInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/map";
-import _concatInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/concat";
-import _reduceInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/reduce";
-import _reverseInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/reverse";
 export default function (version, geVersion, ltVersion) {
-  var _context2;
+  const getComponents = v => v.split(/[-+]/)[0].split('.').map(i => +i);
 
-  var getComponents = function getComponents(v) {
-    var _context;
+  const versionComponents = getComponents(version);
+  const geComponents = getComponents(geVersion);
+  const ltComponents = getComponents(ltVersion);
+  const base = Math.max(...versionComponents, ...geComponents, ...ltComponents) + 1;
 
-    return _mapInstanceProperty(_context = v.split('-')[0].split('.')).call(_context, function (i) {
-      return +i;
-    });
-  };
+  const componentsToNumber = components => components.reverse().reduce((acc, n, idx) => acc + n * Math.pow(base, idx), 0);
 
-  var versionComponents = getComponents(version);
-  var geComponents = getComponents(geVersion);
-  var ltComponents = getComponents(ltVersion);
-  var base = Math.max.apply(Math, _concatInstanceProperty(_context2 = _toConsumableArray(versionComponents)).call(_context2, _toConsumableArray(geComponents), _toConsumableArray(ltComponents))) + 1;
-
-  var componentsToNumber = function componentsToNumber(components) {
-    var _context3;
-
-    return _reduceInstanceProperty(_context3 = _reverseInstanceProperty(components).call(components)).call(_context3, function (acc, n, idx) {
-      return acc + n * Math.pow(base, idx);
-    }, 0);
-  };
-
-  var vNumber = componentsToNumber(versionComponents);
-  var geNumber = componentsToNumber(geComponents);
-  var ltNumber = componentsToNumber(ltComponents);
+  const vNumber = componentsToNumber(versionComponents);
+  const geNumber = componentsToNumber(geComponents);
+  const ltNumber = componentsToNumber(ltComponents);
   return vNumber >= geNumber && vNumber < ltNumber;
 }
 //# sourceMappingURL=semver-satisfies.js.map

package/es/utils/semver-satisfies.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/utils/semver-satisfies.ts"],"names":["version","geVersion","ltVersion","getComponents","v","split","i","versionComponents","geComponents","ltComponents","base","Math","max","componentsToNumber","components","acc","n","idx","pow","vNumber","geNumber","ltNumber"],"mappings":";;;;;AAAA,eAAe,UAAUA,OAAV,EAA2BC,SAA3B,EAA8CC,SAA9C,EAA0E;AAAA;;AACvF,MAAMC,aAAa,GAAG,SAAhBA,aAAgB,CAACC,CAAD;AAAA;;AAAA,WAAyB,gCAAAA,CAAC,CAC7CC,KAD4C,CACtC,GADsC,EACjC,CADiC,EAC9BA,KAD8B,CACxB,GADwB,kBACf,UAAAC,CAAC;AAAA,aAAI,CAACA,CAAL;AAAA,KADc,CAAzB;AAAA,GAAtB;;AAGA,MAAMC,iBAAiB,GAAGJ,aAAa,CAACH,OAAD,CAAvC;AACA,MAAMQ,YAAY,GAAGL,aAAa,CAACF,SAAD,CAAlC;AACA,MAAMQ,YAAY,GAAGN,aAAa,CAACD,SAAD,CAAlC;AAEA,MAAMQ,IAAI,GAAGC,IAAI,CAACC,GAAL,OAAAD,IAAI,yDAAQJ,iBAAR,sCAA8BC,YAA9B,sBAA+CC,YAA/C,GAAJ,GAAmE,CAAhF;;AACA,MAAMI,kBAAkB,GAAG,SAArBA,kBAAqB,CAACC,UAAD;AAAA;;AAAA,WAAkC,6DAAAA,UAAU,MAAV,CAAAA,UAAU,OAAV,YACnD,UAACC,GAAD,EAAMC,CAAN,EAASC,GAAT;AAAA,aAAiBF,GAAG,GAAGC,CAAC,GAAGL,IAAI,CAACO,GAAL,CAASR,IAAT,EAAeO,GAAf,CAA3B;AAAA,KADmD,EACH,CADG,CAAlC;AAAA,GAA3B;;AAGA,MAAME,OAAO,GAAGN,kBAAkB,CAACN,iBAAD,CAAlC;AACA,MAAMa,QAAQ,GAAGP,kBAAkB,CAACL,YAAD,CAAnC;AACA,MAAMa,QAAQ,GAAGR,kBAAkB,CAACJ,YAAD,CAAnC;AACA,SAAOU,OAAO,IAAIC,QAAX,IAAuBD,OAAO,GAAGE,QAAxC;AACD","sourcesContent":["export default function (version: string, geVersion: string, ltVersion: string): boolean {\n  const getComponents = (v: string): number[] => v\n    .split('-')[0].split('.').map(i => +i)\n\n  const versionComponents = getComponents(version)\n  const geComponents = getComponents(geVersion)\n  const ltComponents = getComponents(ltVersion)\n\n  const base = Math.max(...versionComponents, ...geComponents, ...ltComponents) + 1\n  const componentsToNumber = (components: number[]): number => components.reverse()\n    .reduce((acc, n, idx) => acc + n * Math.pow(base, idx), 0)\n\n  const vNumber = componentsToNumber(versionComponents)\n  const geNumber = componentsToNumber(geComponents)\n  const ltNumber = componentsToNumber(ltComponents)\n  return vNumber >= geNumber && vNumber < ltNumber\n}\n"],"file":"semver-satisfies.js"}
+{"version":3,"sources":["../../src/utils/semver-satisfies.ts"],"names":["version","geVersion","ltVersion","getComponents","v","split","map","i","versionComponents","geComponents","ltComponents","base","Math","max","componentsToNumber","components","reverse","reduce","acc","n","idx","pow","vNumber","geNumber","ltNumber"],"mappings":"AAAA,eAAe,UAAUA,OAAV,EAA2BC,SAA3B,EAA8CC,SAA9C,EAA0E;AACvF,QAAMC,aAAa,GAAIC,CAAD,IAAyBA,CAAC,CAC7CC,KAD4C,CACtC,MADsC,EAC9B,CAD8B,EAC3BA,KAD2B,CACrB,GADqB,EAChBC,GADgB,CACZC,CAAC,IAAI,CAACA,CADM,CAA/C;;AAGA,QAAMC,iBAAiB,GAAGL,aAAa,CAACH,OAAD,CAAvC;AACA,QAAMS,YAAY,GAAGN,aAAa,CAACF,SAAD,CAAlC;AACA,QAAMS,YAAY,GAAGP,aAAa,CAACD,SAAD,CAAlC;AAEA,QAAMS,IAAI,GAAGC,IAAI,CAACC,GAAL,CAAS,GAAGL,iBAAZ,EAA+B,GAAGC,YAAlC,EAAgD,GAAGC,YAAnD,IAAmE,CAAhF;;AACA,QAAMI,kBAAkB,GAAIC,UAAD,IAAkCA,UAAU,CAACC,OAAX,GAC1DC,MAD0D,CACnD,CAACC,GAAD,EAAMC,CAAN,EAASC,GAAT,KAAiBF,GAAG,GAAGC,CAAC,GAAGP,IAAI,CAACS,GAAL,CAASV,IAAT,EAAeS,GAAf,CADwB,EACH,CADG,CAA7D;;AAGA,QAAME,OAAO,GAAGR,kBAAkB,CAACN,iBAAD,CAAlC;AACA,QAAMe,QAAQ,GAAGT,kBAAkB,CAACL,YAAD,CAAnC;AACA,QAAMe,QAAQ,GAAGV,kBAAkB,CAACJ,YAAD,CAAnC;AACA,SAAOY,OAAO,IAAIC,QAAX,IAAuBD,OAAO,GAAGE,QAAxC;AACD","sourcesContent":["export default function (version: string, geVersion: string, ltVersion: string): boolean {\n  const getComponents = (v: string): number[] => v\n    .split(/[-+]/)[0].split('.').map(i => +i)\n\n  const versionComponents = getComponents(version)\n  const geComponents = getComponents(geVersion)\n  const ltComponents = getComponents(ltVersion)\n\n  const base = Math.max(...versionComponents, ...geComponents, ...ltComponents) + 1\n  const componentsToNumber = (components: number[]): number => components.reverse()\n    .reduce((acc, n, idx) => acc + n * Math.pow(base, idx), 0)\n\n  const vNumber = componentsToNumber(versionComponents)\n  const geNumber = componentsToNumber(geComponents)\n  const ltNumber = componentsToNumber(ltComponents)\n  return vNumber >= geNumber && vNumber < ltNumber\n}\n"],"file":"semver-satisfies.js"}

package/es/utils/string.js

@@ -1,6 +1,3 @@
-import _indexOfInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/index-of";
-import _sliceInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instance/slice";
-
 /*
  * ISC License (ISC)
  * Copyright 2018 aeternity developers
@@ -25,9 +22,7 @@ import _sliceInstanceProperty from "@babel/runtime-corejs3/core-js-stable/instan
  * @return {String} Converted string
  */
 export function snakeToPascal(s) {
-  return s.replace(/_./g, function (match) {
-    return match[1].toUpperCase();
-  });
+  return s.replace(/_./g, match => match[1].toUpperCase());
 }
 /**
  * Convert string from PascalCase to snake_case
@@ -37,9 +32,7 @@ export function snakeToPascal(s) {
  */
 
 export function pascalToSnake(s) {
-  return s.replace(/[A-Z]/g, function (match) {
-    return "_".concat(match.toLowerCase());
-  });
+  return s.replace(/[A-Z]/g, match => `_${match.toLowerCase()}`);
 }
 /**
  * Check whether a string is valid hex.
@@ -58,9 +51,7 @@ export function isHex(str) {
 
 export function isBase64(str) {
   if (str.length % 4 > 0 || /[^0-9a-z+/=]/i.test(str)) return false;
-
-  var index = _indexOfInstanceProperty(str).call(str, '=');
-
-  return index === -1 || /={1,2}/.test(_sliceInstanceProperty(str).call(str, index));
+  const index = str.indexOf('=');
+  return index === -1 || /={1,2}/.test(str.slice(index));
 }
 //# sourceMappingURL=string.js.map

package/es/utils/string.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/utils/string.ts"],"names":["snakeToPascal","s","replace","match","toUpperCase","pascalToSnake","toLowerCase","isHex","str","length","test","isBase64","index"],"mappings":";;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASA,aAAT,CAAwBC,CAAxB,EAA2C;AAChD,SAAOA,CAAC,CAACC,OAAF,CAAU,KAAV,EAAiB,UAAAC,KAAK;AAAA,WAAIA,KAAK,CAAC,CAAD,CAAL,CAASC,WAAT,EAAJ;AAAA,GAAtB,CAAP;AACD;AAED;AACA;AACA;AACA;AACA;AACA;;AACA,OAAO,SAASC,aAAT,CAAwBJ,CAAxB,EAA2C;AAChD,SAAOA,CAAC,CAACC,OAAF,CAAU,QAAV,EAAoB,UAAAC,KAAK;AAAA,sBAAQA,KAAK,CAACG,WAAN,EAAR;AAAA,GAAzB,CAAP;AACD;AAED;AACA;AACA;AACA;AACA;;AACA,OAAO,SAASC,KAAT,CAAgBC,GAAhB,EAAsC;AAC3C,SAAOA,GAAG,CAACC,MAAJ,GAAa,CAAb,KAAmB,CAAnB,IAAwB,eAAeC,IAAf,CAAoBF,GAApB,CAA/B;AACD;AAED;AACA;AACA;AACA;AACA;;AACA,OAAO,SAASG,QAAT,CAAmBH,GAAnB,EAAyC;AAC9C,MAAIA,GAAG,CAACC,MAAJ,GAAa,CAAb,GAAiB,CAAjB,IAAsB,gBAAgBC,IAAhB,CAAqBF,GAArB,CAA1B,EAAqD,OAAO,KAAP;;AACrD,MAAMI,KAAK,GAAG,yBAAAJ,GAAG,MAAH,CAAAA,GAAG,EAAS,GAAT,CAAjB;;AACA,SAAOI,KAAK,KAAK,CAAC,CAAX,IAAgB,SAASF,IAAT,CAAc,uBAAAF,GAAG,MAAH,CAAAA,GAAG,EAAOI,KAAP,CAAjB,CAAvB;AACD","sourcesContent":["/*\n * ISC License (ISC)\n * Copyright 2018 aeternity developers\n *\n *  Permission to use, copy, modify, and/or distribute this software for any\n *  purpose with or without fee is hereby granted, provided that the above\n *  copyright notice and this permission notice appear in all copies.\n *\n *  THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\n *  REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\n *  AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\n *  INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\n *  LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\n *  OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\n *  PERFORMANCE OF THIS SOFTWARE.\n */\n\n/**\n * Convert string from snake_case to PascalCase\n * @rtype (s: String) => String\n * @param {String} s - String to convert\n * @return {String} Converted string\n */\nexport function snakeToPascal (s: string): string {\n  return s.replace(/_./g, match => match[1].toUpperCase())\n}\n\n/**\n * Convert string from PascalCase to snake_case\n * @rtype (s: String) => String\n * @param {String} s - String to convert\n * @return {String} Converted string\n */\nexport function pascalToSnake (s: string): string {\n  return s.replace(/[A-Z]/g, match => `_${match.toLowerCase()}`)\n}\n\n/**\n * Check whether a string is valid hex.\n * @param {string} str String to validate.\n * @return {boolean} True if the string is valid hex, false otherwise.\n */\nexport function isHex (str: string): boolean {\n  return str.length % 2 === 0 && /^[0-9a-f]+$/i.test(str)\n}\n\n/**\n * Check whether a string is valid base-64.\n * @param {string} str String to validate.\n * @return {boolean} True if the string is valid base-64, false otherwise.\n */\nexport function isBase64 (str: string): boolean {\n  if (str.length % 4 > 0 || /[^0-9a-z+/=]/i.test(str)) return false\n  const index = str.indexOf('=')\n  return index === -1 || /={1,2}/.test(str.slice(index))\n}\n"],"file":"string.js"}
+{"version":3,"sources":["../../src/utils/string.ts"],"names":["snakeToPascal","s","replace","match","toUpperCase","pascalToSnake","toLowerCase","isHex","str","length","test","isBase64","index","indexOf","slice"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASA,aAAT,CAAwBC,CAAxB,EAA2C;AAChD,SAAOA,CAAC,CAACC,OAAF,CAAU,KAAV,EAAiBC,KAAK,IAAIA,KAAK,CAAC,CAAD,CAAL,CAASC,WAAT,EAA1B,CAAP;AACD;AAED;AACA;AACA;AACA;AACA;AACA;;AACA,OAAO,SAASC,aAAT,CAAwBJ,CAAxB,EAA2C;AAChD,SAAOA,CAAC,CAACC,OAAF,CAAU,QAAV,EAAoBC,KAAK,IAAK,IAAGA,KAAK,CAACG,WAAN,EAAoB,EAArD,CAAP;AACD;AAED;AACA;AACA;AACA;AACA;;AACA,OAAO,SAASC,KAAT,CAAgBC,GAAhB,EAAsC;AAC3C,SAAOA,GAAG,CAACC,MAAJ,GAAa,CAAb,KAAmB,CAAnB,IAAwB,eAAeC,IAAf,CAAoBF,GAApB,CAA/B;AACD;AAED;AACA;AACA;AACA;AACA;;AACA,OAAO,SAASG,QAAT,CAAmBH,GAAnB,EAAyC;AAC9C,MAAIA,GAAG,CAACC,MAAJ,GAAa,CAAb,GAAiB,CAAjB,IAAsB,gBAAgBC,IAAhB,CAAqBF,GAArB,CAA1B,EAAqD,OAAO,KAAP;AACrD,QAAMI,KAAK,GAAGJ,GAAG,CAACK,OAAJ,CAAY,GAAZ,CAAd;AACA,SAAOD,KAAK,KAAK,CAAC,CAAX,IAAgB,SAASF,IAAT,CAAcF,GAAG,CAACM,KAAJ,CAAUF,KAAV,CAAd,CAAvB;AACD","sourcesContent":["/*\n * ISC License (ISC)\n * Copyright 2018 aeternity developers\n *\n *  Permission to use, copy, modify, and/or distribute this software for any\n *  purpose with or without fee is hereby granted, provided that the above\n *  copyright notice and this permission notice appear in all copies.\n *\n *  THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\n *  REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\n *  AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\n *  INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\n *  LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\n *  OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\n *  PERFORMANCE OF THIS SOFTWARE.\n */\n\n/**\n * Convert string from snake_case to PascalCase\n * @rtype (s: String) => String\n * @param {String} s - String to convert\n * @return {String} Converted string\n */\nexport function snakeToPascal (s: string): string {\n  return s.replace(/_./g, match => match[1].toUpperCase())\n}\n\n/**\n * Convert string from PascalCase to snake_case\n * @rtype (s: String) => String\n * @param {String} s - String to convert\n * @return {String} Converted string\n */\nexport function pascalToSnake (s: string): string {\n  return s.replace(/[A-Z]/g, match => `_${match.toLowerCase()}`)\n}\n\n/**\n * Check whether a string is valid hex.\n * @param {string} str String to validate.\n * @return {boolean} True if the string is valid hex, false otherwise.\n */\nexport function isHex (str: string): boolean {\n  return str.length % 2 === 0 && /^[0-9a-f]+$/i.test(str)\n}\n\n/**\n * Check whether a string is valid base-64.\n * @param {string} str String to validate.\n * @return {boolean} True if the string is valid base-64, false otherwise.\n */\nexport function isBase64 (str: string): boolean {\n  if (str.length % 4 > 0 || /[^0-9a-z+/=]/i.test(str)) return false\n  const index = str.indexOf('=')\n  return index === -1 || /={1,2}/.test(str.slice(index))\n}\n"],"file":"string.js"}