postchain-client 1.22.0 → 2.0.1

package/built/src/merkle/merklehashcalculator.d.ts

@@ -1,37 +0,0 @@
-/// <reference types="node" />
-/**
- *
- * @param {CryptoSystem} cryptoSystem
- */
-export function MerkleHashCalculator(cryptoSystem: CryptoSystem): void;
-export class MerkleHashCalculator {
-    /**
-     *
-     * @param {CryptoSystem} cryptoSystem
-     */
-    constructor(cryptoSystem: CryptoSystem);
-    cryptoSystem: CryptoSystem;
-    /**
-     * @param {number} prefix
-     * @param {Buffer} hashLeft
-     * @param {Buffer} hashRight
-     */
-    calculateNodeHash(prefix: number, hashLeft: Buffer, hashRight: Buffer): any;
-    /**
-     * @param {*} value
-     */
-    calculateLeafHash(value: any, merkleHashVersion: any): any;
-    /**
-     * @param {number} prefix
-     * @param {Buffer} hashLeft
-     * @param {Buffer} hashRight
-     */
-    calculateNodeHashInternal(prefix: number, hashLeft: Buffer, hashRight: Buffer, hashFunc: any): any;
-    calculateHashOfValueInternal(valuetoHash: any, serializeFun: any, hashFunc: any, merkleHashVersion: any): any;
-    isContainerProofValueLeaf(value: any): boolean;
-}
-export function CryptoSystem(): void;
-export class CryptoSystem {
-    digest(buffer: any): Buffer;
-}
-import { Buffer } from "buffer";

package/built/src/merkle/merklehashcalculator.js

@@ -1,73 +0,0 @@
-"use strict";
-const { Buffer } = require('buffer');
-var serialization = require('../gtx/serialization');
-var HASH_PREFIX_LEAF = require('./binarytree').HASH_PREFIX_LEAF;
-var encryption = require('../../src/encryption/encryption');
-function CryptoSystem() { }
-CryptoSystem.prototype.digest = function (buffer) {
-    return encryption.hash256(buffer);
-};
-/**
- *
- * @param {Buffer} buffer
- * @param {CryptoSystem} cryptoSystem
- */
-function hashingFun(buffer, cryptoSystem) {
-    if (cryptoSystem === null) {
-        throw new Error("In this case we need the CryptoSystem to calculate the hash");
-    }
-    else {
-        return cryptoSystem.digest(buffer);
-    }
-}
-/**
- *
- * @param {CryptoSystem} cryptoSystem
- */
-function MerkleHashCalculator(cryptoSystem) {
-    this.cryptoSystem = cryptoSystem;
-}
-/**
- * @param {number} prefix
- * @param {Buffer} hashLeft
- * @param {Buffer} hashRight
- */
-MerkleHashCalculator.prototype.calculateNodeHash = function (prefix, hashLeft, hashRight) {
-    return this.calculateNodeHashInternal(prefix, hashLeft, hashRight, hashingFun);
-};
-/**
- * @param {*} value
- */
-MerkleHashCalculator.prototype.calculateLeafHash = function (value, merkleHashVersion) {
-    return this.calculateHashOfValueInternal(value, serialization.encodeValue, hashingFun, merkleHashVersion);
-};
-/**
- * @param {number} prefix
- * @param {Buffer} hashLeft
- * @param {Buffer} hashRight
- */
-MerkleHashCalculator.prototype.calculateNodeHashInternal = function (prefix, hashLeft, hashRight, hashFunc) {
-    var buf = Buffer.alloc(1);
-    buf.writeInt8(prefix);
-    var bufferSum = Buffer.concat([buf, hashLeft, hashRight]);
-    return hashFunc(bufferSum, this.cryptoSystem);
-};
-MerkleHashCalculator.prototype.calculateHashOfValueInternal = function (valuetoHash, serializeFun, hashFunc, merkleHashVersion) {
-    var buf = Buffer.alloc(1);
-    buf.writeInt8(HASH_PREFIX_LEAF);
-    var bufferSum = Buffer.concat([buf, serializeFun(valuetoHash)]);
-    return hashFunc(bufferSum, this.cryptoSystem, merkleHashVersion);
-};
-MerkleHashCalculator.prototype.isContainerProofValueLeaf = function (value) {
-    if (value == null) {
-        return false;
-    }
-    if (value.constructor === Array || typeof value === 'object') {
-        return true;
-    }
-    else {
-        return false;
-    }
-};
-module.exports = { MerkleHashCalculator, CryptoSystem };
-//# sourceMappingURL=merklehashcalculator.js.map

package/built/src/merkle/merklehashcalculator.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"merklehashcalculator.js","sourceRoot":"","sources":["../../../src/merkle/merklehashcalculator.js"],"names":[],"mappings":";AAAA,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;AACrC,IAAI,aAAa,GAAG,OAAO,CAAC,sBAAsB,CAAC,CAAA;AACnD,IAAI,gBAAgB,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC,gBAAgB,CAAA;AAC/D,IAAI,UAAU,GAAG,OAAO,CAAC,iCAAiC,CAAC,CAAA;AAE3D,SAAS,YAAY,KAAI,CAAC;AAC1B,YAAY,CAAC,SAAS,CAAC,MAAM,GAAG,UAAS,MAAM;IAC7C,OAAO,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;AACnC,CAAC,CAAA;AAED;;;;GAIG;AACH,SAAS,UAAU,CAAC,MAAM,EAAE,YAAY;IACtC,IAAI,YAAY,KAAK,IAAI,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,6DAA6D,CAAC,CAAA;IAChF,CAAC;SAAM,CAAC;QACN,OAAO,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;IACpC,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,oBAAoB,CAAC,YAAY;IACxC,IAAI,CAAC,YAAY,GAAG,YAAY,CAAA;AAClC,CAAC;AAED;;;;GAIG;AACH,oBAAoB,CAAC,SAAS,CAAC,iBAAiB,GAAG,UAAS,MAAM,EAAE,QAAQ,EAAE,SAAS;IACrF,OAAO,IAAI,CAAC,yBAAyB,CAAC,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,UAAU,CAAC,CAAA;AAChF,CAAC,CAAA;AAED;;GAEG;AACH,oBAAoB,CAAC,SAAS,CAAC,iBAAiB,GAAG,UAAS,KAAK,EAAE,iBAAiB;IAClF,OAAO,IAAI,CAAC,4BAA4B,CAAC,KAAK,EAAE,aAAa,CAAC,WAAW,EAAE,UAAU,EAAE,iBAAiB,CAAC,CAAA;AAC3G,CAAC,CAAA;AAED;;;;GAIG;AACH,oBAAoB,CAAC,SAAS,CAAC,yBAAyB,GAAG,UAAS,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ;IACvG,IAAI,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;IACzB,GAAG,CAAC,SAAS,CAAC,MAAM,CAAC,CAAA;IACrB,IAAI,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAA;IACzD,OAAO,QAAQ,CAAC,SAAS,EAAE,IAAI,CAAC,YAAY,CAAC,CAAA;AAC/C,CAAC,CAAA;AAED,oBAAoB,CAAC,SAAS,CAAC,4BAA4B,GAAG,UAAS,WAAW,EAAE,YAAY,EAAE,QAAQ,EAAE,iBAAiB;IAC3H,IAAI,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;IACzB,GAAG,CAAC,SAAS,CAAC,gBAAgB,CAAC,CAAA;IAC/B,IAAI,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,CAAA;IAC/D,OAAO,QAAQ,CAAC,SAAS,EAAE,IAAI,CAAC,YAAY,EAAE,iBAAiB,CAAC,CAAA;AAClE,CAAC,CAAA;AAED,oBAAoB,CAAC,SAAS,CAAC,yBAAyB,GAAG,UAAS,KAAK;IACvE,IAAI,KAAK,IAAI,IAAI,EAAE,CAAC;QAClB,OAAO,KAAK,CAAA;IACd,CAAC;IACD,IAAI,KAAK,CAAC,WAAW,KAAK,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC7D,OAAO,IAAI,CAAA;IACb,CAAC;SAAM,CAAC;QACN,OAAO,KAAK,CAAA;IACd,CAAC;AACH,CAAC,CAAA;AAED,MAAM,CAAC,OAAO,GAAG,EAAC,oBAAoB,EAAE,YAAY,EAAC,CAAC"}

package/built/src/merkle/path.d.ts

@@ -1,151 +0,0 @@
-/**
- *
- * @param {Array} pathElements
- */
-export function Path(pathElements: any[]): void;
-export class Path {
-    /**
-     *
-     * @param {Array} pathElements
-     */
-    constructor(pathElements: any[]);
-    pathElements: any[];
-    /**
-     *
-     */
-    getCurrentPathElement(): any;
-    /**
-     *
-     */
-    size(): number;
-    /**
-     *
-     */
-    tail(): Path;
-    debugString(): string;
-    /**
-     * @param {Path} other
-     */
-    equals(other: Path): boolean;
-}
-export function PathElement(previous: any): void;
-export class PathElement {
-    constructor(previous: any);
-    previous: any;
-    getSearchKey(): void;
-}
-export function PathLeafElement(previous: any): void;
-export class PathLeafElement {
-    constructor(previous: any);
-    equals(other: any): boolean;
-}
-/**
- *
- * @param {SearchablePathElement} previous
- * @param {number} index
- */
-export function ArrayPathElement(previous: SearchablePathElement, index: number): void;
-export class ArrayPathElement {
-    /**
-     *
-     * @param {SearchablePathElement} previous
-     * @param {number} index
-     */
-    constructor(previous: SearchablePathElement, index: number);
-    index: number;
-    getSearchKey(): number;
-    /**
-     * @param {ArrayPathElement} other
-     */
-    equals(other: ArrayPathElement): boolean;
-}
-export function SearchablePathElement(previous: any): void;
-export class SearchablePathElement {
-    constructor(previous: any);
-    getSearchKey(): void;
-}
-/**
- *
- * @param {SearchablePathElement} previous
- * @param {string} key
- */
-export function DictPathElement(previous: SearchablePathElement, key: string): void;
-export class DictPathElement {
-    /**
-     *
-     * @param {SearchablePathElement} previous
-     * @param {string} key
-     */
-    constructor(previous: SearchablePathElement, key: string);
-    key: string;
-    getSearchKey(): string;
-    /**
-     * @param {DictPathElement} other
-     */
-    equals(other: DictPathElement): boolean;
-}
-/**
- *
- * @param {Array} paths
- */
-export function PathSet(paths: any[]): void;
-export class PathSet {
-    /**
-     *
-     * @param {Array} paths
-     */
-    constructor(paths: any[]);
-    paths: any[];
-    /**
-     *
-     */
-    isEmpty(): boolean;
-    /**
-     *
-     */
-    getPathLeafOrElseAnyCurrentPathElement(): null;
-    /**
-     * Yeah, this might be a completely un-needed check (but it MIGHT save us later on if we forget this rule).
-     * What we are looking for here is an impossible state where two paths in the same set don't have the same parent.
-     * (Since we usually only have one path in a path set, this check should be cheap)
-     *
-     * @param {Path} currPath
-     * @param {PathElement} currElem
-     * @param {Path} prevPath
-     * @param {PathElement} prevElem
-     */
-    errorCheckUnequalParent(currPath: Path, currElem: PathElement, prevPath: Path, prevElem: PathElement): {
-        path: Path;
-        elem: PathElement;
-    };
-    /**
-     *
-     */
-    keepOnlyArrayPaths(): PathSet;
-    /**
-     *
-     */
-    keepOnlyDictPaths(): PathSet;
-    /**
-     *
-     */
-    getTailIfFirstElementIsArrayOfThisIndexFromList(index: any): PathSet;
-    /**
-     *
-     */
-    getTailIfFirstElementIsDictOfThisKeyFromList(key: any): PathSet;
-    /**
-     *
-     */
-    getTailFromList(searchKey: any, filterFunc: any): PathSet;
-}
-/**
- * @param {number} index
- * @param {Path} path
- */
-export function getTailIfFirstElementIsArrayOfThisIndex(index: number, path: Path): Path | null;
-/**
- *
- * @param {Array} arr
- */
-export function buildPathFromArray(arr: any[]): Path;

package/built/src/merkle/path.js

@@ -1,306 +0,0 @@
-"use strict";
-var util = require('../formatter');
-function PathElement(previous) {
-    this.previous = previous;
-}
-PathElement.prototype.getSearchKey = function () { };
-function PathLeafElement(previous) {
-    PathElement.call(this, previous);
-}
-PathLeafElement.prototype = Object.create(PathElement.prototype);
-PathLeafElement.prototype.constructor = PathLeafElement;
-PathLeafElement.prototype.equals = function (other) {
-    if (this === other)
-        return true;
-    if (typeof this !== typeof other)
-        return false;
-    return true;
-};
-function SearchablePathElement(previous) {
-    PathElement.call(this, previous);
-}
-SearchablePathElement.prototype = Object.create(PathElement.prototype);
-SearchablePathElement.prototype.constructor = SearchablePathElement;
-SearchablePathElement.prototype.getSearchKey = function () { };
-/**
- *
- * @param {SearchablePathElement} previous
- * @param {number} index
- */
-function ArrayPathElement(previous, index) {
-    SearchablePathElement.call(this, previous);
-    this.index = index;
-}
-ArrayPathElement.prototype = Object.create(SearchablePathElement.prototype);
-ArrayPathElement.prototype.constructor = ArrayPathElement;
-ArrayPathElement.prototype.getSearchKey = function () {
-    return this.index;
-};
-/**
- * @param {ArrayPathElement} other
- */
-ArrayPathElement.prototype.equals = function (other) {
-    if (this === other)
-        return true;
-    if (typeof this !== typeof other)
-        return false;
-    if (this.index != other.index)
-        return false;
-    return true;
-};
-/**
- *
- * @param {SearchablePathElement} previous
- * @param {string} key
- */
-function DictPathElement(previous, key) {
-    SearchablePathElement.call(this, previous);
-    this.key = key;
-}
-DictPathElement.prototype = Object.create(SearchablePathElement.prototype);
-DictPathElement.prototype.constructor = DictPathElement;
-DictPathElement.prototype.getSearchKey = function () {
-    return this.key;
-};
-/**
- * @param {DictPathElement} other
- */
-DictPathElement.prototype.equals = function (other) {
-    if (this === other)
-        return true;
-    if (typeof this !== typeof other)
-        return false;
-    if (this.key != other.key)
-        return false;
-    return true;
-};
-/**
- *
- * @param {Array} pathElements
- */
-function Path(pathElements) {
-    this.pathElements = pathElements;
-}
-/**
- *
- */
-Path.prototype.getCurrentPathElement = function () {
-    return this.pathElements[0];
-};
-/**
- *
- */
-Path.prototype.size = function () {
-    return this.pathElements.length;
-};
-/**
- *
- */
-Path.prototype.tail = function () {
-    if (this.pathElements.length == 0) {
-        throw new Error("Impossible to tail this array");
-    }
-    else {
-        var tail = this.pathElements.slice(1);
-        return new Path(tail);
-    }
-};
-Path.prototype.debugString = function () {
-    var sb = "";
-    this.pathElements.forEach(elem => {
-        if (elem instanceof SearchablePathElement) {
-            sb = sb + "-> " + elem.getSearchKey();
-        }
-        else if (elem instanceof PathLeafElement) {
-            sb = sb + "-> Leaf";
-        }
-    });
-    return sb;
-};
-/**
- * @param {Path} other
- */
-Path.prototype.equals = function (other) {
-    if (this === other)
-        return true;
-    if (typeof this != typeof other)
-        return false;
-    return this.pathElements == other.pathElements;
-};
-/**
- * @param {number} index
- * @param {Path} path
- */
-var getTailIfFirstElementIsArrayOfThisIndex = function (index, path) {
-    return getTail(index, path);
-};
-/**
- *
- * @param {string} key
- * @param {Path} path
- */
-var getTailIfFirstElementIsDictOfThisKey = function (key, path) {
-    return getTail(key, path);
-};
-/**
- *
- * @param {string|number} searchKey
- * @param {Path} path
- */
-var getTail = function (searchKey, path) {
-    if (searchKey === null) {
-        throw new Error("Have to provide a search key");
-    }
-    try {
-        var firstElement = path.pathElements[0];
-        if (firstElement instanceof SearchablePathElement) {
-            if (firstElement.getSearchKey() == searchKey) {
-                return path.tail();
-            }
-        }
-    }
-    catch (err) {
-        util.logError("Why are we dropping first element of an empty path? " + err);
-        return null;
-    }
-    return null;
-};
-/**
- *
- * @param {Array} paths
- */
-function PathSet(paths) {
-    this.paths = paths;
-}
-/**
- *
- */
-PathSet.prototype.isEmpty = function () {
-    return this.paths.length == 0;
-};
-/**
- *
- */
-PathSet.prototype.getPathLeafOrElseAnyCurrentPathElement = function () {
-    var leafElem = null;
-    var currElem = null;
-    var prev = {
-        "path": null,
-        "elem": null,
-    };
-    this.paths.forEach(path => {
-        currElem = path.getCurrentPathElement();
-        if (currElem instanceof PathLeafElement) {
-            leafElem = currElem;
-        }
-        prev = this.errorCheckUnequalParent(path, currElem, prev.path, prev.elem);
-    });
-    if (leafElem != null) {
-        return leafElem;
-    }
-    else {
-        return currElem; // It doesn't matter which one we return (Next step we will get the "previous" from this one)
-    }
-};
-/**
- * Yeah, this might be a completely un-needed check (but it MIGHT save us later on if we forget this rule).
- * What we are looking for here is an impossible state where two paths in the same set don't have the same parent.
- * (Since we usually only have one path in a path set, this check should be cheap)
- *
- * @param {Path} currPath
- * @param {PathElement} currElem
- * @param {Path} prevPath
- * @param {PathElement} prevElem
- */
-PathSet.prototype.errorCheckUnequalParent = function (currPath, currElem, prevPath, prevElem) {
-    if (prevElem != null) {
-        // weird: javascript cannot compare null == null then we have to compare each with null separately :(
-        if (currElem.previous == null && prevElem.previous == null) {
-            return {
-                "path": currPath,
-                "elem": currElem
-            };
-        }
-        else if ((currElem.previous == null && prevElem.previous != null) || (currElem.previous != null && prevElem.previous == null)) {
-            throw new Error("Something is wrong, these paths do not have the same parent. (" + currPath + ") (" + prevPath + ")");
-        }
-        else if (!currElem.previous.equals(prevElem.previous)) {
-            throw new Error("Something is wrong, these paths do not have the same parent. (" + currPath + ") (" + prevPath + ")");
-        }
-    }
-    return {
-        "path": currPath,
-        "elem": currElem
-    };
-};
-/**
- *
- */
-PathSet.prototype.keepOnlyArrayPaths = function () {
-    var filteredPaths = this.paths.filter(path => {
-        return path.pathElements[0] instanceof ArrayPathElement;
-    });
-    return new PathSet(filteredPaths);
-};
-/**
- *
- */
-PathSet.prototype.keepOnlyDictPaths = function () {
-    var filteredPaths = this.paths.filter(path => {
-        return path.pathElements[0] instanceof DictPathElement;
-    });
-    return new PathSet(filteredPaths);
-};
-/**
- *
- */
-PathSet.prototype.getTailIfFirstElementIsArrayOfThisIndexFromList = function (index) {
-    return this.getTailFromList(index, getTailIfFirstElementIsArrayOfThisIndex);
-};
-/**
- *
- */
-PathSet.prototype.getTailIfFirstElementIsDictOfThisKeyFromList = function (key) {
-    return this.getTailFromList(key, getTailIfFirstElementIsDictOfThisKey);
-};
-/**
- *
- */
-PathSet.prototype.getTailFromList = function (searchKey, filterFunc) {
-    var retPaths = new Array();
-    this.paths.forEach(path => {
-        var newPath = filterFunc(searchKey, path);
-        if (newPath != null) {
-            retPaths.push(newPath);
-        }
-    });
-    return new PathSet(retPaths);
-};
-/**
- *
- * @param {Array} arr
- */
-var buildPathFromArray = function (arr) {
-    var pathElements = new Array();
-    var lastPathElem = null;
-    arr.forEach(item => {
-        var newElem = null;
-        if (typeof item === 'number') {
-            newElem = new ArrayPathElement(lastPathElem, item);
-        }
-        else if (typeof item === 'string') {
-            newElem = new DictPathElement(lastPathElem, item);
-        }
-        else {
-            throw new Error("A path structure must only consist of Ints and Strings, not " + item);
-        }
-        pathElements.push(newElem);
-        lastPathElem = newElem;
-    });
-    var lastOne = lastPathElem;
-    pathElements.push(new PathLeafElement(lastOne));
-    return new Path(pathElements);
-};
-module.exports = { Path, PathElement, PathLeafElement, ArrayPathElement, SearchablePathElement, DictPathElement, PathSet,
-    getTailIfFirstElementIsArrayOfThisIndex, buildPathFromArray };
-//# sourceMappingURL=path.js.map

package/built/src/merkle/path.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"path.js","sourceRoot":"","sources":["../../../src/merkle/path.js"],"names":[],"mappings":"AAAA,YAAY,CAAA;AAEZ,IAAI,IAAI,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC;AAEnC,SAAS,WAAW,CAAC,QAAQ;IAC3B,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;AAC1B,CAAC;AACD,WAAW,CAAC,SAAS,CAAC,YAAY,GAAG,cAAY,CAAC,CAAA;AAElD,SAAS,eAAe,CAAC,QAAQ;IAC/B,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;AAClC,CAAC;AACD,eAAe,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,SAAS,CAAC,CAAA;AAChE,eAAe,CAAC,SAAS,CAAC,WAAW,GAAG,eAAe,CAAA;AACvD,eAAe,CAAC,SAAS,CAAC,MAAM,GAAG,UAAS,KAAK;IAC/C,IAAI,IAAI,KAAK,KAAK;QAAE,OAAO,IAAI,CAAA;IAC/B,IAAI,OAAO,IAAI,KAAK,OAAO,KAAK;QAAE,OAAO,KAAK,CAAA;IAC9C,OAAO,IAAI,CAAA;AACb,CAAC,CAAA;AAGD,SAAS,qBAAqB,CAAC,QAAQ;IACrC,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;AAClC,CAAC;AACD,qBAAqB,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,SAAS,CAAC,CAAA;AACtE,qBAAqB,CAAC,SAAS,CAAC,WAAW,GAAG,qBAAqB,CAAA;AACnE,qBAAqB,CAAC,SAAS,CAAC,YAAY,GAAG,cAAY,CAAC,CAAA;AAE5D;;;;GAIG;AACH,SAAS,gBAAgB,CAAC,QAAQ,EAAE,KAAK;IACvC,qBAAqB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;IAC1C,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;AACpB,CAAC;AACD,gBAAgB,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,qBAAqB,CAAC,SAAS,CAAC,CAAA;AAC3E,gBAAgB,CAAC,SAAS,CAAC,WAAW,GAAG,gBAAgB,CAAA;AAEzD,gBAAgB,CAAC,SAAS,CAAC,YAAY,GAAG;IACxC,OAAO,IAAI,CAAC,KAAK,CAAA;AACnB,CAAC,CAAA;AACD;;GAEG;AACH,gBAAgB,CAAC,SAAS,CAAC,MAAM,GAAG,UAAS,KAAK;IAChD,IAAI,IAAI,KAAK,KAAK;QAAE,OAAO,IAAI,CAAA;IAC/B,IAAI,OAAO,IAAI,KAAK,OAAO,KAAK;QAAE,OAAO,KAAK,CAAA;IAE9C,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK;QAAE,OAAO,KAAK,CAAA;IAC3C,OAAO,IAAI,CAAA;AACb,CAAC,CAAA;AAGD;;;;GAIG;AACH,SAAS,eAAe,CAAC,QAAQ,EAAE,GAAG;IACpC,qBAAqB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;IAC1C,IAAI,CAAC,GAAG,GAAG,GAAG,CAAA;AAChB,CAAC;AACD,eAAe,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,qBAAqB,CAAC,SAAS,CAAC,CAAA;AAC1E,eAAe,CAAC,SAAS,CAAC,WAAW,GAAG,eAAe,CAAA;AAEvD,eAAe,CAAC,SAAS,CAAC,YAAY,GAAG;IACvC,OAAO,IAAI,CAAC,GAAG,CAAA;AACjB,CAAC,CAAA;AAED;;GAEG;AACH,eAAe,CAAC,SAAS,CAAC,MAAM,GAAG,UAAS,KAAK;IAC/C,IAAI,IAAI,KAAK,KAAK;QAAE,OAAO,IAAI,CAAA;IAC/B,IAAI,OAAO,IAAI,KAAK,OAAO,KAAK;QAAE,OAAO,KAAK,CAAA;IAE9C,IAAI,IAAI,CAAC,GAAG,IAAI,KAAK,CAAC,GAAG;QAAE,OAAO,KAAK,CAAA;IACvC,OAAO,IAAI,CAAA;AACb,CAAC,CAAA;AAED;;;GAGG;AACH,SAAS,IAAI,CAAC,YAAY;IACxB,IAAI,CAAC,YAAY,GAAG,YAAY,CAAA;AAClC,CAAC;AAED;;GAEG;AACH,IAAI,CAAC,SAAS,CAAC,qBAAqB,GAAG;IACrC,OAAO,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;AAC7B,CAAC,CAAA;AAED;;GAEG;AACH,IAAI,CAAC,SAAS,CAAC,IAAI,GAAG;IACpB,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAA;AACjC,CAAC,CAAA;AACD;;GAEG;AACH,IAAI,CAAC,SAAS,CAAC,IAAI,GAAG;IACpB,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAA;IAClD,CAAC;SAAM,CAAC;QACN,IAAI,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;QACrC,OAAO,IAAI,IAAI,CAAC,IAAI,CAAC,CAAA;IACvB,CAAC;AACH,CAAC,CAAA;AAED,IAAI,CAAC,SAAS,CAAC,WAAW,GAAG;IAC3B,IAAI,EAAE,GAAG,EAAE,CAAA;IACX,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QAC/B,IAAI,IAAI,YAAY,qBAAqB,EAAE,CAAC;YAC1C,EAAE,GAAG,EAAE,GAAG,KAAK,GAAG,IAAI,CAAC,YAAY,EAAE,CAAA;QACvC,CAAC;aAAM,IAAI,IAAI,YAAY,eAAe,EAAE,CAAC;YAC3C,EAAE,GAAG,EAAE,GAAG,SAAS,CAAA;QACrB,CAAC;IACH,CAAC,CAAC,CAAA;IACF,OAAO,EAAE,CAAA;AACX,CAAC,CAAA;AACD;;GAEG;AACH,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,UAAS,KAAK;IACpC,IAAI,IAAI,KAAK,KAAK;QAAE,OAAO,IAAI,CAAA;IAC/B,IAAI,OAAO,IAAI,IAAI,OAAO,KAAK;QAAE,OAAO,KAAK,CAAA;IAE7C,OAAO,IAAI,CAAC,YAAY,IAAI,KAAK,CAAC,YAAY,CAAA;AAChD,CAAC,CAAA;AAED;;;GAGG;AACH,IAAI,uCAAuC,GAAG,UAAS,KAAK,EAAE,IAAI;IAChE,OAAO,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;AAC7B,CAAC,CAAA;AAED;;;;GAIG;AACH,IAAI,oCAAoC,GAAG,UAAS,GAAG,EAAE,IAAI;IAC3D,OAAO,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;AAC3B,CAAC,CAAA;AAED;;;;GAIG;AACH,IAAI,OAAO,GAAG,UAAS,SAAS,EAAE,IAAI;IACpC,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;QACvB,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAA;IACjD,CAAC;IAED,IAAI,CAAC;QACH,IAAI,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QACvC,IAAI,YAAY,YAAY,qBAAqB,EAAE,CAAC;YAClD,IAAI,YAAY,CAAC,YAAY,EAAE,IAAI,SAAS,EAAE,CAAC;gBAC7C,OAAO,IAAI,CAAC,IAAI,EAAE,CAAA;YACpB,CAAC;QACH,CAAC;IACH,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,QAAQ,CAAC,sDAAsD,GAAG,GAAG,CAAC,CAAA;QAC3E,OAAO,IAAI,CAAA;IACb,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC,CAAA;AAED;;;GAGG;AACH,SAAS,OAAO,CAAC,KAAK;IACpB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;AACpB,CAAC;AAED;;GAEG;AACH,OAAO,CAAC,SAAS,CAAC,OAAO,GAAG;IAC1B,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,CAAA;AAC/B,CAAC,CAAA;AAED;;GAEG;AACH,OAAO,CAAC,SAAS,CAAC,sCAAsC,GAAG;IACzD,IAAI,QAAQ,GAAG,IAAI,CAAA;IACnB,IAAI,QAAQ,GAAG,IAAI,CAAA;IACnB,IAAI,IAAI,GAAG;QACT,MAAM,EAAE,IAAI;QACZ,MAAM,EAAE,IAAI;KACb,CAAA;IACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QACxB,QAAQ,GAAG,IAAI,CAAC,qBAAqB,EAAE,CAAA;QACvC,IAAI,QAAQ,YAAY,eAAe,EAAE,CAAC;YACxC,QAAQ,GAAG,QAAQ,CAAA;QACrB,CAAC;QACD,IAAI,GAAG,IAAI,CAAC,uBAAuB,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;IAC3E,CAAC,CAAC,CAAA;IAEF,IAAI,QAAQ,IAAI,IAAI,EAAE,CAAC;QACrB,OAAO,QAAQ,CAAA;IACjB,CAAC;SAAM,CAAC;QACN,OAAO,QAAQ,CAAA,CAAC,6FAA6F;IAC/G,CAAC;AACH,CAAC,CAAA;AAED;;;;;;;;;GASG;AACH,OAAO,CAAC,SAAS,CAAC,uBAAuB,GAAG,UAAS,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ;IACzF,IAAI,QAAQ,IAAI,IAAI,EAAE,CAAC;QACrB,qGAAqG;QACrG,IAAI,QAAQ,CAAC,QAAQ,IAAI,IAAI,IAAI,QAAQ,CAAC,QAAQ,IAAI,IAAI,EAAE,CAAC;YAC3D,OAAO;gBACL,MAAM,EAAE,QAAQ;gBAChB,MAAM,EAAE,QAAQ;aACjB,CAAA;QACH,CAAC;aAAM,IAAI,CAAC,QAAQ,CAAC,QAAQ,IAAI,IAAI,IAAI,QAAQ,CAAC,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,IAAI,IAAI,IAAI,QAAQ,CAAC,QAAQ,IAAI,IAAI,CAAC,EAAE,CAAC;YAChI,MAAM,IAAI,KAAK,CAAC,gEAAgE,GAAG,QAAQ,GAAG,KAAK,GAAG,QAAQ,GAAG,GAAG,CAAC,CAAA;QACvH,CAAC;aAAM,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;YACxD,MAAM,IAAI,KAAK,CAAC,gEAAgE,GAAG,QAAQ,GAAG,KAAK,GAAG,QAAQ,GAAG,GAAG,CAAC,CAAA;QACvH,CAAC;IACH,CAAC;IACD,OAAO;QACL,MAAM,EAAE,QAAQ;QAChB,MAAM,EAAE,QAAQ;KACjB,CAAA;AACH,CAAC,CAAA;AAED;;GAEG;AACH,OAAO,CAAC,SAAS,CAAC,kBAAkB,GAAG;IACrC,IAAI,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;QAC3C,OAAO,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,YAAY,gBAAgB,CAAA;IACzD,CAAC,CAAC,CAAA;IACF,OAAO,IAAI,OAAO,CAAC,aAAa,CAAC,CAAA;AACnC,CAAC,CAAA;AAED;;GAEG;AACH,OAAO,CAAC,SAAS,CAAC,iBAAiB,GAAG;IACpC,IAAI,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;QAC3C,OAAO,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,YAAY,eAAe,CAAA;IACxD,CAAC,CAAC,CAAA;IACF,OAAO,IAAI,OAAO,CAAC,aAAa,CAAC,CAAA;AACnC,CAAC,CAAA;AAED;;GAEG;AACH,OAAO,CAAC,SAAS,CAAC,+CAA+C,GAAG,UAAS,KAAK;IAChF,OAAO,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,uCAAuC,CAAC,CAAA;AAC7E,CAAC,CAAA;AAED;;GAEG;AACH,OAAO,CAAC,SAAS,CAAC,4CAA4C,GAAG,UAAS,GAAG;IAC3E,OAAO,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,oCAAoC,CAAC,CAAA;AACxE,CAAC,CAAA;AAED;;GAEG;AACH,OAAO,CAAC,SAAS,CAAC,eAAe,GAAG,UAAS,SAAS,EAAE,UAAU;IAChE,IAAI,QAAQ,GAAG,IAAI,KAAK,EAAE,CAAA;IAC1B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QACxB,IAAI,OAAO,GAAG,UAAU,CAAC,SAAS,EAAE,IAAI,CAAC,CAAA;QACzC,IAAI,OAAO,IAAI,IAAI,EAAE,CAAC;YACpB,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QACxB,CAAC;IACH,CAAC,CAAC,CAAA;IACF,OAAO,IAAI,OAAO,CAAC,QAAQ,CAAC,CAAA;AAC9B,CAAC,CAAA;AAED;;;GAGG;AACH,IAAI,kBAAkB,GAAG,UAAS,GAAG;IACnC,IAAI,YAAY,GAAG,IAAI,KAAK,EAAE,CAAA;IAC9B,IAAI,YAAY,GAAG,IAAI,CAAA;IAEvB,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QACjB,IAAI,OAAO,GAAG,IAAI,CAAA;QAClB,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC7B,OAAO,GAAG,IAAI,gBAAgB,CAAC,YAAY,EAAE,IAAI,CAAC,CAAA;QACpD,CAAC;aAAM,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;YACpC,OAAO,GAAG,IAAI,eAAe,CAAC,YAAY,EAAE,IAAI,CAAC,CAAA;QACnD,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,KAAK,CAAC,8DAA8D,GAAG,IAAI,CAAC,CAAA;QACxF,CAAC;QACD,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QAC1B,YAAY,GAAG,OAAO,CAAA;IACxB,CAAC,CAAC,CAAA;IACF,IAAI,OAAO,GAAG,YAAY,CAAA;IAC1B,YAAY,CAAC,IAAI,CAAC,IAAI,eAAe,CAAC,OAAO,CAAC,CAAC,CAAA;IAC/C,OAAO,IAAI,IAAI,CAAC,YAAY,CAAC,CAAA;AAC/B,CAAC,CAAA;AAED,MAAM,CAAC,OAAO,GAAG,EAAC,IAAI,EAAE,WAAW,EAAE,eAAe,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,eAAe,EAAE,OAAO;IACrH,uCAAuC,EAAE,kBAAkB,EAAC,CAAA"}

package/built/src/merkle/proof/merklehashcarrier.d.ts

@@ -1,17 +0,0 @@
-/**
- *
- * @param {Buffer} merkleHash
- */
-export function MerkleHashSummary(merkleHash: Buffer): void;
-export class MerkleHashSummary {
-    /**
-     *
-     * @param {Buffer} merkleHash
-     */
-    constructor(merkleHash: Buffer);
-    merkleHash: Buffer;
-    /**
-     * @param {MerkleHashSummary} other
-     */
-    equals(other: MerkleHashSummary): boolean;
-}

package/built/src/merkle/proof/merklehashcarrier.js

@@ -1,23 +0,0 @@
-"use strict";
-/**
- *
- * @param {Buffer} merkleHash
- */
-function MerkleHashSummary(merkleHash) {
-    this.merkleHash = merkleHash;
-}
-/**
- * @param {MerkleHashSummary} other
- */
-MerkleHashSummary.prototype.equals = function (other) {
-    if (this === other)
-        return true;
-    if (typeof this != typeof other)
-        return false;
-    if (this.merkleHash.compare(other.merkleHash) === 0) {
-        return true;
-    }
-    return false;
-};
-module.exports = { MerkleHashSummary };
-//# sourceMappingURL=merklehashcarrier.js.map

package/built/src/merkle/proof/merklehashcarrier.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"merklehashcarrier.js","sourceRoot":"","sources":["../../../../src/merkle/proof/merklehashcarrier.js"],"names":[],"mappings":"AAAA,YAAY,CAAA;AAEZ;;;GAGG;AACH,SAAS,iBAAiB,CAAC,UAAU;IACnC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAA;AAC9B,CAAC;AAED;;GAEG;AACH,iBAAiB,CAAC,SAAS,CAAC,MAAM,GAAG,UAAS,KAAK;IACjD,IAAI,IAAI,KAAK,KAAK;QAAE,OAAO,IAAI,CAAA;IAC/B,IAAI,OAAO,IAAI,IAAI,OAAO,KAAK;QAAE,OAAO,KAAK,CAAA;IAE7C,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QACpD,OAAO,IAAI,CAAA;IACb,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC,CAAA;AAGD,MAAM,CAAC,OAAO,GAAG,EAAC,iBAAiB,EAAC,CAAA"}

package/built/src/merkle/proof/merklehashsummaryfactory.d.ts

@@ -1,53 +0,0 @@
-/**
- *
- * @param {BinaryTreeFactory} treeFactory
- * @param {MerkleProofTreeFactory} proofFactory
- */
-export function MerkleHashSummaryFactory(treeFactory: BinaryTreeFactory, proofFactory: MerkleProofTreeFactory): void;
-export class MerkleHashSummaryFactory {
-    /**
-     *
-     * @param {BinaryTreeFactory} treeFactory
-     * @param {MerkleProofTreeFactory} proofFactory
-     */
-    constructor(treeFactory: BinaryTreeFactory, proofFactory: MerkleProofTreeFactory);
-    treeFactory: BinaryTreeFactory;
-    proofFactory: MerkleProofTreeFactory;
-    /**
-     * @param {any} value
-     * @param {MerkleHashCalculator} calculator
-     */
-    calculateMerkleRoot(value: any, calculator: MerkleHashCalculator, merkleHashVersion: any): MerkleHashSummary;
-    /**
-     * @param {MerkleProofTree} value
-     * @param {MerkleHashCalculator} calculator
-     */
-    calculateMerkleTreeRoot(tree: any, calculator: MerkleHashCalculator, merkleHashVersion: any): MerkleHashSummary;
-    /**
-     * @param {MerkleProofTree} proofTree
-     * @param {MerkleHashCalculator} calculator
-     */
-    calculateMerkleRootOfTree(proofTree: MerkleProofTree, calculator: MerkleHashCalculator, merkleHashVersion: any): MerkleHashSummary;
-    /**
-     * @param {MerkleProofElement} currentElement
-     * @param {MerkleHashCalculator} calculator
-     */
-    calculateMerkleRootInternal(currentElement: typeof MerkleProofElement, calculator: MerkleHashCalculator, merkleHashVersion: any): any;
-    /**
-     * @param {any} value
-     * @param {MerkleHashCalculator} calculator
-     */
-    buildProofTree(value: any, calculator: MerkleHashCalculator, merkleHashVersion: any): MerkleProofTree;
-}
-import BinaryTreeFactory_1 = require("../binarytreefactory");
-import BinaryTreeFactory = BinaryTreeFactory_1.BinaryTreeFactory;
-import MerkleProofTreeFactory_1 = require("./merkleprooftreefactory");
-import MerkleProofTreeFactory = MerkleProofTreeFactory_1.MerkleProofTreeFactory;
-import MerkleHashCalculator_1 = require("../merklehashcalculator");
-import MerkleHashCalculator = MerkleHashCalculator_1.MerkleHashCalculator;
-import MerkleHashSummary_1 = require("./merklehashcarrier");
-import MerkleHashSummary = MerkleHashSummary_1.MerkleHashSummary;
-import MerkleProofTree_1 = require("./merkleprooftree");
-import MerkleProofTree = MerkleProofTree_1.MerkleProofTree;
-import MerkleProofElement_1 = require("./merkleprooftree");
-import MerkleProofElement = MerkleProofElement_1.MerkleProofElement;