@aeternity/aepp-sdk 13.0.0-alpha.0 → 13.0.0-beta.0

package/es/utils/mptree.mjs

@@ -1,143 +0,0 @@
-import _buffer from "buffer";
-const {
-  Buffer: _Buffer
-} = _buffer;
-/*
- * ISC License (ISC)
- * Copyright (c) 2021 aeternity developers
- *
- *  Permission to use, copy, modify, and/or distribute this software for any
- *  purpose with or without fee is hereby granted, provided that the above
- *  copyright notice and this permission notice appear in all copies.
- *
- *  THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
- *  REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
- *  AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
- *  INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
- *  LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
- *  OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
- *  PERFORMANCE OF THIS SOFTWARE.
- */
-
-/* eslint-disable default-case */
-import _rlp from 'rlp';
-const {
-  encode: rlpEncode
-} = _rlp;
-import { hash } from "./crypto.mjs";
-import { MerkleTreeHashMismatchError, MissingNodeInTreeError, UnknownPathNibbleError, UnknownNodeLengthError } from "./errors.mjs";
-var NodeType;
-(function (NodeType) {
-  NodeType[NodeType["Branch"] = 0] = "Branch";
-  NodeType[NodeType["Extension"] = 1] = "Extension";
-  NodeType[NodeType["Leaf"] = 2] = "Leaf";
-})(NodeType || (NodeType = {}));
-export default class MPTree {
-  static nodeHash(node) {
-    return _Buffer.from(hash(rlpEncode(node))).toString('hex');
-  }
-
-  /**
-   * Deserialize Merkle Patricia Tree
-   * @param binary - Binary
-   * @returns Merkle Patricia Tree
-   */
-  constructor(binary) {
-    this.rootHash = binary[0].toString('hex');
-    this.nodes = Object.fromEntries(binary[1].map(node => [node[0].toString('hex'), node[1]]));
-    if (this.nodes[this.rootHash] === undefined) throw new MissingNodeInTreeError('Can\'t find a node by root hash');
-    Object.entries(this.nodes).forEach(_ref => {
-      let [key, node] = _ref;
-      if (MPTree.nodeHash(node) !== key) throw new MerkleTreeHashMismatchError();
-      const {
-        type,
-        payload
-      } = MPTree.parseNode(node);
-      switch (type) {
-        case NodeType.Branch:
-          payload.slice(0, 16).filter(n => n.length).forEach(n => {
-            if (this.nodes[n.toString('hex')] === undefined) {
-              throw new MissingNodeInTreeError('Can\'t find a node by hash in branch node');
-            }
-          });
-          break;
-        case NodeType.Extension:
-          if (this.nodes[payload[0].toString('hex')] === undefined) {
-            throw new MissingNodeInTreeError('Can\'t find a node by hash in extension node');
-          }
-      }
-    });
-  }
-  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 nibble = node[0][0] >> 4; // eslint-disable-line no-bitwise
-          if (nibble > 3) throw new UnknownPathNibbleError(nibble);
-          const type = nibble <= 1 ? NodeType.Extension : NodeType.Leaf;
-          const slice = [0, 2].includes(nibble) ? 2 : 1;
-          return {
-            type,
-            payload: [node[1]],
-            path: node[0].toString('hex').slice(slice)
-          };
-        }
-      default:
-        throw new UnknownNodeLengthError(node.length);
-    }
-  }
-
-  /**
-   * Serialize Merkle Patricia Tree
-   * @returns Binary
-   */
-  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
-   * @param _key - The key of the element to retrieve
-   * @returns Value associated to the specified key
-   */
-  get(_key) {
-    let searchFrom = this.rootHash;
-    let key = _key;
-    while (true) {
-      // eslint-disable-line no-constant-condition
-      const {
-        type,
-        payload,
-        path
-      } = MPTree.parseNode(this.nodes[searchFrom]);
-      switch (type) {
-        case NodeType.Branch:
-          if (key.length === 0) return payload[16];
-          searchFrom = payload[+`0x${key[0]}`].toString('hex');
-          key = key.substring(1);
-          break;
-        case NodeType.Extension:
-          if (key.substring(0, path === null || path === void 0 ? void 0 : path.length) !== path) return undefined;
-          searchFrom = payload[0].toString('hex');
-          key = key.substring(path.length);
-          break;
-        case NodeType.Leaf:
-          if (path !== key) return undefined;
-          return payload[0];
-      }
-    }
-  }
-}
-//# sourceMappingURL=mptree.mjs.map

package/es/utils/mptree.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"mptree.mjs","names":["hash","MerkleTreeHashMismatchError","MissingNodeInTreeError","UnknownPathNibbleError","UnknownNodeLengthError","NodeType","MPTree","nodeHash","node","from","rlpEncode","toString","constructor","binary","rootHash","nodes","Object","fromEntries","map","undefined","entries","forEach","key","type","payload","parseNode","Branch","slice","filter","n","length","Extension","isEqual","tree","path","nibble","Leaf","includes","serialize","mptHash","value","get","_key","searchFrom","substring"],"sources":["../../src/utils/mptree.ts"],"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\n/* eslint-disable default-case */\nimport { encode as rlpEncode } from 'rlp';\nimport type { Input } from 'rlp';\nimport { hash } from './crypto';\nimport {\n  MerkleTreeHashMismatchError,\n  MissingNodeInTreeError,\n  UnknownPathNibbleError,\n  UnknownNodeLengthError,\n} from './errors';\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\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   * @param binary - Binary\n   * @returns 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 MissingNodeInTreeError('Can\\'t find a node by root hash');\n    Object.entries(this.nodes).forEach(([key, node]) => {\n      if (MPTree.nodeHash(node) !== key) throw new MerkleTreeHashMismatchError();\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 MissingNodeInTreeError('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 MissingNodeInTreeError('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[]): {\n    type: NodeType;\n    payload: Buffer[];\n    path: string | null;\n  } {\n    switch (node.length) {\n      case 17:\n        return { type: NodeType.Branch, payload: node, path: null };\n      case 2: {\n        const nibble = node[0][0] >> 4; // eslint-disable-line no-bitwise\n        if (nibble > 3) throw new UnknownPathNibbleError(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: node[0].toString('hex').slice(slice) };\n      }\n      default:\n        throw new UnknownNodeLengthError(node.length);\n    }\n  }\n\n  /**\n   * Serialize Merkle Patricia Tree\n   * @returns 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   * @param _key - The key of the element to retrieve\n   * @returns Value associated to the specified key\n   */\n  get(_key: string): Buffer | undefined {\n    let searchFrom = this.rootHash;\n    let key = _key;\n    while (true) { // eslint-disable-line no-constant-condition\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[+`0x${key[0]}`].toString('hex');\n          key = key.substring(1);\n          break;\n        case NodeType.Extension:\n          if (key.substring(0, path?.length) !== path) return undefined;\n          searchFrom = payload[0].toString('hex');\n          key = key.substring(path.length);\n          break;\n        case NodeType.Leaf:\n          if (path !== key) return undefined;\n          return payload[0];\n      }\n    }\n  }\n}\n"],"mappings":";;;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,iBAAoC,KAAK;AAAC;EAAA;AAAA;AAAA,SAEjCA,IAAI;AAAA,SAEXC,2BAA2B,EAC3BC,sBAAsB,EACtBC,sBAAsB,EACtBC,sBAAsB;AAAA,IAGnBC,QAAQ;AAAA,WAARA,QAAQ;EAARA,QAAQ,CAARA,QAAQ;EAARA,QAAQ,CAARA,QAAQ;EAARA,QAAQ,CAARA,QAAQ;AAAA,GAARA,QAAQ,KAARA,QAAQ;AAQb,eAAe,MAAMC,MAAM,CAAC;EAK1B,OAAeC,QAAQ,CAACC,IAAW,EAAU;IAC3C,OAAO,QAAOC,IAAI,CAACT,IAAI,CAACU,SAAS,CAACF,IAAI,CAAC,CAAC,CAAC,CAACG,QAAQ,CAAC,KAAK,CAAC;EAC3D;;EAEA;AACF;AACA;AACA;AACA;EACEC,WAAW,CAACC,MAAoB,EAAE;IAChC,IAAI,CAACC,QAAQ,GAAGD,MAAM,CAAC,CAAC,CAAC,CAACF,QAAQ,CAAC,KAAK,CAAC;IACzC,IAAI,CAACI,KAAK,GAAGC,MAAM,CAACC,WAAW,CAC7BJ,MAAM,CAAC,CAAC,CAAC,CAACK,GAAG,CAAEV,IAAI,IAAK,CAACA,IAAI,CAAC,CAAC,CAAC,CAACG,QAAQ,CAAC,KAAK,CAAC,EAAEH,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAC5D;IAED,IAAI,IAAI,CAACO,KAAK,CAAC,IAAI,CAACD,QAAQ,CAAC,KAAKK,SAAS,EAAE,MAAM,IAAIjB,sBAAsB,CAAC,iCAAiC,CAAC;IAChHc,MAAM,CAACI,OAAO,CAAC,IAAI,CAACL,KAAK,CAAC,CAACM,OAAO,CAAC,QAAiB;MAAA,IAAhB,CAACC,GAAG,EAAEd,IAAI,CAAC;MAC7C,IAAIF,MAAM,CAACC,QAAQ,CAACC,IAAI,CAAC,KAAKc,GAAG,EAAE,MAAM,IAAIrB,2BAA2B,EAAE;MAC1E,MAAM;QAAEsB,IAAI;QAAEC;MAAQ,CAAC,GAAGlB,MAAM,CAACmB,SAAS,CAACjB,IAAI,CAAC;MAChD,QAAQe,IAAI;QACV,KAAKlB,QAAQ,CAACqB,MAAM;UAClBF,OAAO,CACJG,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CACZC,MAAM,CAAEC,CAAC,IAAKA,CAAC,CAACC,MAAM,CAAC,CACvBT,OAAO,CAAEQ,CAAC,IAAK;YACd,IAAI,IAAI,CAACd,KAAK,CAACc,CAAC,CAAClB,QAAQ,CAAC,KAAK,CAAC,CAAC,KAAKQ,SAAS,EAAE;cAC/C,MAAM,IAAIjB,sBAAsB,CAAC,2CAA2C,CAAC;YAC/E;UACF,CAAC,CAAC;UACJ;QACF,KAAKG,QAAQ,CAAC0B,SAAS;UACrB,IAAI,IAAI,CAAChB,KAAK,CAACS,OAAO,CAAC,CAAC,CAAC,CAACb,QAAQ,CAAC,KAAK,CAAC,CAAC,KAAKQ,SAAS,EAAE;YACxD,MAAM,IAAIjB,sBAAsB,CAAC,8CAA8C,CAAC;UAClF;MAAC;IAEP,CAAC,CAAC;EACJ;EAEA8B,OAAO,CAACC,IAAY,EAAW;IAC7B,OAAO,IAAI,CAACnB,QAAQ,KAAKmB,IAAI,CAACnB,QAAQ;EACxC;EAEA,OAAeW,SAAS,CAACjB,IAAc,EAIrC;IACA,QAAQA,IAAI,CAACsB,MAAM;MACjB,KAAK,EAAE;QACL,OAAO;UAAEP,IAAI,EAAElB,QAAQ,CAACqB,MAAM;UAAEF,OAAO,EAAEhB,IAAI;UAAE0B,IAAI,EAAE;QAAK,CAAC;MAC7D,KAAK,CAAC;QAAE;UACN,MAAMC,MAAM,GAAG3B,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;UAChC,IAAI2B,MAAM,GAAG,CAAC,EAAE,MAAM,IAAIhC,sBAAsB,CAACgC,MAAM,CAAC;UACxD,MAAMZ,IAAI,GAAGY,MAAM,IAAI,CAAC,GAAG9B,QAAQ,CAAC0B,SAAS,GAAG1B,QAAQ,CAAC+B,IAAI;UAC7D,MAAMT,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAACU,QAAQ,CAACF,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;UAC7C,OAAO;YAAEZ,IAAI;YAAEC,OAAO,EAAE,CAAChB,IAAI,CAAC,CAAC,CAAC,CAAC;YAAE0B,IAAI,EAAE1B,IAAI,CAAC,CAAC,CAAC,CAACG,QAAQ,CAAC,KAAK,CAAC,CAACgB,KAAK,CAACA,KAAK;UAAE,CAAC;QACjF;MACA;QACE,MAAM,IAAIvB,sBAAsB,CAACI,IAAI,CAACsB,MAAM,CAAC;IAAC;EAEpD;;EAEA;AACF;AACA;AACA;EACEQ,SAAS,GAAiB;IACxB,OAAO,CACL,QAAO7B,IAAI,CAAC,IAAI,CAACK,QAAQ,EAAE,KAAK,CAAC,EACjCE,MAAM,CAACI,OAAO,CAAC,IAAI,CAACL,KAAK,CAAC,CAACG,GAAG,CAAC;MAAA,IAAC,CAACqB,OAAO,EAAEC,KAAK,CAAC;MAAA,OAAM,CACpD,QAAO/B,IAAI,CAAC8B,OAAO,EAAE,KAAK,CAAC,EAC3BC,KAAK,CACN;IAAA,CAAC,CAAC,CACJ;EACH;;EAEA;AACF;AACA;AACA;AACA;EACEC,GAAG,CAACC,IAAY,EAAsB;IACpC,IAAIC,UAAU,GAAG,IAAI,CAAC7B,QAAQ;IAC9B,IAAIQ,GAAG,GAAGoB,IAAI;IACd,OAAO,IAAI,EAAE;MAAE;MACb,MAAM;QAAEnB,IAAI;QAAEC,OAAO;QAAEU;MAAK,CAAC,GAAG5B,MAAM,CAACmB,SAAS,CAAC,IAAI,CAACV,KAAK,CAAC4B,UAAU,CAAC,CAAC;MACxE,QAAQpB,IAAI;QACV,KAAKlB,QAAQ,CAACqB,MAAM;UAClB,IAAIJ,GAAG,CAACQ,MAAM,KAAK,CAAC,EAAE,OAAON,OAAO,CAAC,EAAE,CAAC;UACxCmB,UAAU,GAAGnB,OAAO,CAAC,CAAE,KAAIF,GAAG,CAAC,CAAC,CAAE,EAAC,CAAC,CAACX,QAAQ,CAAC,KAAK,CAAC;UACpDW,GAAG,GAAGA,GAAG,CAACsB,SAAS,CAAC,CAAC,CAAC;UACtB;QACF,KAAKvC,QAAQ,CAAC0B,SAAS;UACrB,IAAIT,GAAG,CAACsB,SAAS,CAAC,CAAC,EAAEV,IAAI,aAAJA,IAAI,uBAAJA,IAAI,CAAEJ,MAAM,CAAC,KAAKI,IAAI,EAAE,OAAOf,SAAS;UAC7DwB,UAAU,GAAGnB,OAAO,CAAC,CAAC,CAAC,CAACb,QAAQ,CAAC,KAAK,CAAC;UACvCW,GAAG,GAAGA,GAAG,CAACsB,SAAS,CAACV,IAAI,CAACJ,MAAM,CAAC;UAChC;QACF,KAAKzB,QAAQ,CAAC+B,IAAI;UAChB,IAAIF,IAAI,KAAKZ,GAAG,EAAE,OAAOH,SAAS;UAClC,OAAOK,OAAO,CAAC,CAAC,CAAC;MAAC;IAExB;EACF;AACF"}