postchain-client 2.0.0 → 2.0.1

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;

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

@@ -1,82 +0,0 @@
-"use strict";
-var BinaryTreeFactory = require('../binarytreefactory').BinaryTreeFactory;
-var MerkleProofTreeFactory = require('./merkleprooftreefactory').MerkleProofTreeFactory;
-var MerkleHashCalculator = require('../merklehashcalculator').MerkleHashCalculator;
-var MerkleProofTree = require('./merkleprooftree').MerkleProofTree;
-var MerkleProofElement = require('./merkleprooftree').MerkleProofElement;
-var ProofHashedLeaf = require('./merkleprooftree').ProofHashedLeaf;
-var ProofValueLeaf = require('./merkleprooftree').ProofValueLeaf;
-var ProofNode = require('./merkleprooftree').ProofNode;
-var MerkleHashSummary = require('./merklehashcarrier').MerkleHashSummary;
-/**
- *
- * @param {BinaryTreeFactory} treeFactory
- * @param {MerkleProofTreeFactory} proofFactory
- */
-function MerkleHashSummaryFactory(treeFactory, proofFactory) {
-    this.treeFactory = treeFactory;
-    this.proofFactory = proofFactory;
-}
-/**
- * @param {any} value
- * @param {MerkleHashCalculator} calculator
- */
-MerkleHashSummaryFactory.prototype.calculateMerkleRoot = function (value, calculator, merkleHashVersion) {
-    var binaryTree = this.treeFactory.build(value, merkleHashVersion);
-    var proofTree = this.proofFactory.buildFromBinaryTree(binaryTree, calculator);
-    return this.calculateMerkleRootOfTree(proofTree, calculator);
-};
-/**
- * @param {MerkleProofTree} value
- * @param {MerkleHashCalculator} calculator
- */
-MerkleHashSummaryFactory.prototype.calculateMerkleTreeRoot = function (tree, calculator, merkleHashVersion) {
-    return this.calculateMerkleRootOfTree(tree, calculator, merkleHashVersion);
-};
-/**
- * @param {MerkleProofTree} proofTree
- * @param {MerkleHashCalculator} calculator
- */
-MerkleHashSummaryFactory.prototype.calculateMerkleRootOfTree = function (proofTree, calculator, merkleHashVersion) {
-    var calculatedSummary = this.calculateMerkleRootInternal(proofTree.root, calculator, merkleHashVersion);
-    return new MerkleHashSummary(calculatedSummary);
-};
-/**
- * @param {MerkleProofElement} currentElement
- * @param {MerkleHashCalculator} calculator
- */
-MerkleHashSummaryFactory.prototype.calculateMerkleRootInternal = function (currentElement, calculator, merkleHashVersion) {
-    if (currentElement instanceof ProofHashedLeaf) {
-        return currentElement.merkleHash;
-    }
-    else if (currentElement instanceof ProofValueLeaf) {
-        var value = currentElement.content;
-        if (calculator.isContainerProofValueLeaf(value)) {
-            // We have a container value to prove, so need to convert the value to a binary tree, and THEN hash it
-            var merkleProofTree = this.buildProofTree(value, calculator, merkleHashVersion);
-            return this.calculateMerkleRootInternal(merkleProofTree.root, calculator, merkleHashVersion);
-        }
-        else {
-            // This is a primitive value, just hash it
-            return calculator.calculateLeafHash(value, merkleHashVersion);
-        }
-    }
-    else if (currentElement instanceof ProofNode) {
-        var left = this.calculateMerkleRootInternal(currentElement.left, calculator, merkleHashVersion);
-        var right = this.calculateMerkleRootInternal(currentElement.right, calculator, merkleHashVersion);
-        return calculator.calculateNodeHash(currentElement.prefix, left, right);
-    }
-    else {
-        throw new Error("Should have handled this type? " + typeof currentElement);
-    }
-};
-/**
- * @param {any} value
- * @param {MerkleHashCalculator} calculator
- */
-MerkleHashSummaryFactory.prototype.buildProofTree = function (value, calculator, merkleHashVersion) {
-    var root = this.treeFactory.build(value, merkleHashVersion);
-    return this.proofFactory.buildFromBinaryTree(root, calculator);
-};
-module.exports = { MerkleHashSummaryFactory };
-//# sourceMappingURL=merklehashsummaryfactory.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"merklehashsummaryfactory.js","sourceRoot":"","sources":["../../../../src/merkle/proof/merklehashsummaryfactory.js"],"names":[],"mappings":";AAAA,IAAI,iBAAiB,GAAG,OAAO,CAAC,sBAAsB,CAAC,CAAC,iBAAiB,CAAA;AACzE,IAAI,sBAAsB,GAAG,OAAO,CAAC,0BAA0B,CAAC,CAAC,sBAAsB,CAAA;AACvF,IAAI,oBAAoB,GAAG,OAAO,CAAC,yBAAyB,CAAC,CAAC,oBAAoB,CAAA;AAClF,IAAI,eAAe,GAAI,OAAO,CAAC,mBAAmB,CAAC,CAAC,eAAe,CAAA;AACnE,IAAI,kBAAkB,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAAC,kBAAkB,CAAA;AACxE,IAAI,eAAe,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAAC,eAAe,CAAA;AAClE,IAAI,cAAc,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAAC,cAAc,CAAA;AAChE,IAAI,SAAS,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAAC,SAAS,CAAA;AACtD,IAAI,iBAAiB,GAAG,OAAO,CAAC,qBAAqB,CAAC,CAAC,iBAAiB,CAAA;AAExE;;;;GAIG;AACH,SAAS,wBAAwB,CAAC,WAAW,EAAE,YAAY;IACzD,IAAI,CAAC,WAAW,GAAG,WAAW,CAAA;IAC9B,IAAI,CAAC,YAAY,GAAG,YAAY,CAAA;AAClC,CAAC;AAED;;;GAGG;AACH,wBAAwB,CAAC,SAAS,CAAC,mBAAmB,GAAG,UAAS,KAAK,EAAE,UAAU,EAAE,iBAAiB;IACpG,IAAI,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,KAAK,EAAE,iBAAiB,CAAC,CAAA;IACjE,IAAI,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,mBAAmB,CAAC,UAAU,EAAE,UAAU,CAAC,CAAA;IAE7E,OAAO,IAAI,CAAC,yBAAyB,CAAC,SAAS,EAAE,UAAU,CAAC,CAAA;AAC9D,CAAC,CAAA;AAED;;;GAGG;AACH,wBAAwB,CAAC,SAAS,CAAC,uBAAuB,GAAG,UAAS,IAAI,EAAE,UAAU,EAAE,iBAAiB;IACvG,OAAO,IAAI,CAAC,yBAAyB,CAAC,IAAI,EAAE,UAAU,EAAE,iBAAiB,CAAC,CAAA;AAC5E,CAAC,CAAA;AAED;;;GAGG;AACH,wBAAwB,CAAC,SAAS,CAAC,yBAAyB,GAAG,UAAS,SAAS,EAAE,UAAU,EAAE,iBAAiB;IAC9G,IAAI,iBAAiB,GAAG,IAAI,CAAC,2BAA2B,CAAC,SAAS,CAAC,IAAI,EAAE,UAAU,EAAE,iBAAiB,CAAC,CAAA;IACvG,OAAO,IAAI,iBAAiB,CAAC,iBAAiB,CAAC,CAAA;AACjD,CAAC,CAAA;AAED;;;GAGG;AACH,wBAAwB,CAAC,SAAS,CAAC,2BAA2B,GAAG,UAAS,cAAc,EAAE,UAAU,EAAE,iBAAiB;IACrH,IAAI,cAAc,YAAY,eAAe,EAAE,CAAC;QAC9C,OAAO,cAAc,CAAC,UAAU,CAAA;IAClC,CAAC;SAAM,IAAI,cAAc,YAAY,cAAc,EAAE,CAAC;QACpD,IAAI,KAAK,GAAG,cAAc,CAAC,OAAO,CAAA;QAClC,IAAI,UAAU,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAAE,CAAC;YAChD,sGAAsG;YACtG,IAAI,eAAe,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,UAAU,EAAE,iBAAiB,CAAC,CAAA;YAC/E,OAAO,IAAI,CAAC,2BAA2B,CAAC,eAAe,CAAC,IAAI,EAAE,UAAU,EAAE,iBAAiB,CAAC,CAAA;QAC9F,CAAC;aAAM,CAAC;YACN,0CAA0C;YAC1C,OAAO,UAAU,CAAC,iBAAiB,CAAC,KAAK,EAAE,iBAAiB,CAAC,CAAA;QAC/D,CAAC;IACH,CAAC;SAAM,IAAI,cAAc,YAAY,SAAS,EAAE,CAAC;QAC/C,IAAI,IAAI,GAAG,IAAI,CAAC,2BAA2B,CAAC,cAAc,CAAC,IAAI,EAAE,UAAU,EAAE,iBAAiB,CAAG,CAAA;QACjG,IAAI,KAAK,GAAG,IAAI,CAAC,2BAA2B,CAAC,cAAc,CAAC,KAAK,EAAE,UAAU,EAAE,iBAAiB,CAAC,CAAA;QACjG,OAAO,UAAU,CAAC,iBAAiB,CAAC,cAAc,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;IACzE,CAAC;SAAM,CAAC;QACN,MAAM,IAAI,KAAK,CAAC,iCAAiC,GAAG,OAAO,cAAc,CAAC,CAAA;IAC5E,CAAC;AACH,CAAC,CAAA;AAED;;;GAGG;AACH,wBAAwB,CAAC,SAAS,CAAC,cAAc,GAAG,UAAS,KAAK,EAAE,UAAU,EAAE,iBAAiB;IAC/F,IAAI,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,KAAK,EAAE,iBAAiB,CAAC,CAAA;IAC3D,OAAO,IAAI,CAAC,YAAY,CAAC,mBAAmB,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;AAChE,CAAC,CAAA;AAED,MAAM,CAAC,OAAO,GAAG,EAAC,wBAAwB,EAAC,CAAA"}

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

@@ -1,36 +0,0 @@
-/**
- * Calculates the merkle root hash of the structure.
- *
- * @param {any} value
- * @param {MerkleHashCalculator} calculator describes the method we use for hashing and serialization
- * @return the merkle root hash (32 bytes) of the data structure.
- */
-export function merkleHash(value: any, calculator: MerkleHashCalculator, merkleHashVersion: any): Buffer;
-/**
- *
- * @param {MerkleProofTree} tree
- * @param {MerkleHashCalculator} calculator
- */
-export function merkleTreeHash(tree: MerkleProofTree, calculator: MerkleHashCalculator, merkleHashVersion: any): Buffer;
-/**
- * Calculates the merkle root hash of the structure
- *
- * @param {any} value
- * @param {MerkleHashCalculator} calculator describes the method we use for hashing and serialization
- * @return the merkle root hash summary
- */
-export function merkleHashSummary(value: any, calculator: MerkleHashCalculator, merkleHashVersion: any): import("./merklehashcarrier").MerkleHashSummary;
-/**
- *
- * @param {any} value
- * @param {PathSet} pathSet
- * @param {MerkleHashCalculator} calculator
- * @param {number} merkleHashVersion
-*/
-export function generateProof(value: any, pathSet: PathSet, calculator: MerkleHashCalculator, merkleHashVersion: number): MerkleProofTree;
-import MerkleHashCalculator_1 = require("../merklehashcalculator");
-import MerkleHashCalculator = MerkleHashCalculator_1.MerkleHashCalculator;
-import MerkleProofTree_1 = require("./merkleprooftree");
-import MerkleProofTree = MerkleProofTree_1.MerkleProofTree;
-import PathSet_1 = require("../path");
-import PathSet = PathSet_1.PathSet;

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

@@ -1,61 +0,0 @@
-"use strict";
-var MerkleHashCalculator = require('../merklehashcalculator').MerkleHashCalculator;
-var MerkleHashSummaryFactory = require('./merklehashsummaryfactory').MerkleHashSummaryFactory;
-var BinaryTreeFactory = require('../binarytreefactory').BinaryTreeFactory;
-var MerkleProofTreeFactory = require('./merkleprooftreefactory').MerkleProofTreeFactory;
-var treeFactory = new BinaryTreeFactory();
-var proofFactory = new MerkleProofTreeFactory();
-var PathSet = require('../path').PathSet;
-var MerkleProofTree = require('./merkleprooftree').MerkleProofTree;
-/**
- * Calculates the merkle root hash of the structure.
- *
- * @param {any} value
- * @param {MerkleHashCalculator} calculator describes the method we use for hashing and serialization
- * @return the merkle root hash (32 bytes) of the data structure.
- */
-function merkleHash(value, calculator, merkleHashVersion) {
-    return merkleHashSummary(value, calculator, merkleHashVersion).merkleHash;
-}
-/**
- *
- * @param {MerkleProofTree} tree
- * @param {MerkleHashCalculator} calculator
- */
-function merkleTreeHash(tree, calculator, merkleHashVersion) {
-    return merkleProofHashSummary(tree, calculator, merkleHashVersion).merkleHash;
-}
-/**
- * Calculates the merkle root hash of the structure
- *
- * @param {any} value
- * @param {MerkleHashCalculator} calculator describes the method we use for hashing and serialization
- * @return the merkle root hash summary
- */
-function merkleHashSummary(value, calculator, merkleHashVersion) {
-    var summaryFactory = new MerkleHashSummaryFactory(treeFactory, proofFactory);
-    return summaryFactory.calculateMerkleRoot(value, calculator, merkleHashVersion);
-}
-/**
- *
- * @param {MerkleProofTree} tree
- * @param {MerkleHashCalculator} calculator
- * @param {number} merkleHashVersion
- */
-function merkleProofHashSummary(tree, calculator, merkleHashVersion) {
-    var summaryFactory = new MerkleHashSummaryFactory(treeFactory, proofFactory);
-    return summaryFactory.calculateMerkleTreeRoot(tree, calculator, merkleHashVersion);
-}
-/**
- *
- * @param {any} value
- * @param {PathSet} pathSet
- * @param {MerkleHashCalculator} calculator
- * @param {number} merkleHashVersion
-*/
-function generateProof(value, pathSet, calculator, merkleHashVersion) {
-    var binaryTree = treeFactory.buildWithPath(value, pathSet, merkleHashVersion);
-    return proofFactory.buildFromBinaryTree(binaryTree, calculator);
-}
-module.exports = { merkleHash, merkleTreeHash, merkleHashSummary, generateProof };
-//# sourceMappingURL=merkleproof.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"merkleproof.js","sourceRoot":"","sources":["../../../../src/merkle/proof/merkleproof.js"],"names":[],"mappings":"AAAA,YAAY,CAAA;AAEZ,IAAI,oBAAoB,GAAG,OAAO,CAAC,yBAAyB,CAAC,CAAC,oBAAoB,CAAA;AAClF,IAAI,wBAAwB,GAAG,OAAO,CAAC,4BAA4B,CAAC,CAAC,wBAAwB,CAAA;AAC7F,IAAI,iBAAiB,GAAG,OAAO,CAAC,sBAAsB,CAAC,CAAC,iBAAiB,CAAA;AACzE,IAAI,sBAAsB,GAAG,OAAO,CAAC,0BAA0B,CAAC,CAAC,sBAAsB,CAAA;AACvF,IAAI,WAAW,GAAG,IAAI,iBAAiB,EAAE,CAAA;AACzC,IAAI,YAAY,GAAG,IAAI,sBAAsB,EAAE,CAAA;AAC/C,IAAI,OAAO,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,OAAO,CAAA;AACxC,IAAI,eAAe,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAAC,eAAe,CAAA;AAElE;;;;;;GAMG;AACH,SAAS,UAAU,CAAC,KAAK,EAAE,UAAU,EAAE,iBAAiB;IACtD,OAAO,iBAAiB,CAAC,KAAK,EAAE,UAAU,EAAE,iBAAiB,CAAC,CAAC,UAAU,CAAA;AAC3E,CAAC;AAED;;;;GAIG;AACH,SAAS,cAAc,CAAC,IAAI,EAAE,UAAU,EAAE,iBAAiB;IACzD,OAAO,sBAAsB,CAAC,IAAI,EAAE,UAAU,EAAE,iBAAiB,CAAC,CAAC,UAAU,CAAA;AAC/E,CAAC;AAED;;;;;;GAMG;AACH,SAAS,iBAAiB,CAAC,KAAK,EAAE,UAAU,EAAE,iBAAiB;IAC7D,IAAI,cAAc,GAAG,IAAI,wBAAwB,CAAC,WAAW,EAAE,YAAY,CAAC,CAAA;IAC5E,OAAO,cAAc,CAAC,mBAAmB,CAAC,KAAK,EAAE,UAAU,EAAE,iBAAiB,CAAC,CAAA;AACjF,CAAC;AAED;;;;;GAKG;AACH,SAAS,sBAAsB,CAAC,IAAI,EAAE,UAAU,EAAE,iBAAiB;IACjE,IAAI,cAAc,GAAG,IAAI,wBAAwB,CAAC,WAAW,EAAE,YAAY,CAAC,CAAA;IAC5E,OAAO,cAAc,CAAC,uBAAuB,CAAC,IAAI,EAAE,UAAU,EAAE,iBAAiB,CAAC,CAAA;AACpF,CAAC;AAED;;;;;;EAME;AACF,SAAS,aAAa,CAAC,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,iBAAiB;IAClE,IAAI,UAAU,GAAG,WAAW,CAAC,aAAa,CAAC,KAAK,EAAE,OAAO,EAAE,iBAAiB,CAAC,CAAA;IAC7E,OAAO,YAAY,CAAC,mBAAmB,CAAC,UAAU,EAAE,UAAU,CAAC,CAAA;AACjE,CAAC;AAED,MAAM,CAAC,OAAO,GAAG,EAAC,UAAU,EAAE,cAAc,EAAE,iBAAiB,EAAE,aAAa,EAAC,CAAA"}