diff --git a/.gitignore b/.gitignore
index a49e4a2..31d760f 100644
--- a/.gitignore
+++ b/.gitignore
@@ -1,4 +1,20 @@
-.idea/
+# Compile time directories
+node_modules
+/temp
+/coverage
+/dist
+/typings
+
+# Editor configuration
+.vscode
+.settings
+.idea
+
+# Logs and compressed files
+*.log
+*.tgz
+
+# Demos
 collections.js.map
 demo/CollectionsDemo/app.js.map
 demo/packages/
@@ -71,14 +87,3 @@ coverage
 
 # node-waf configuration
 .lock-wscript
-
-.vscode/
-.settings/
-coverage/
-node_modules
-temp/
-/typings
-*.log
-*.tgz
-
-./dist
\ No newline at end of file
diff --git a/dist/lib/BSTree.d.ts b/dist/lib/BSTree.d.ts
deleted file mode 100644
index 168977d..0000000
--- a/dist/lib/BSTree.d.ts
+++ /dev/null
@@ -1,175 +0,0 @@
-import * as util from './util';
-export default class BSTree<T> {
-    private root;
-    private compare;
-    private nElements;
-    /**
-     * Creates an empty binary search tree.
-     * @class <p>A binary search tree is a binary tree in which each
-     * internal node stores an element such that the elements stored in the
-     * left subtree are less than it and the elements
-     * stored in the right subtree are greater.</p>
-     * <p>Formally, a binary search tree is a node-based binary tree data structure which
-     * has the following properties:</p>
-     * <ul>
-     * <li>The left subtree of a node contains only nodes with elements less
-     * than the node's element</li>
-     * <li>The right subtree of a node contains only nodes with elements greater
-     * than the node's element</li>
-     * <li>Both the left and right subtrees must also be binary search trees.</li>
-     * </ul>
-     * <p>If the inserted elements are custom objects a compare function must
-     * be provided at construction time, otherwise the <=, === and >= operators are
-     * used to compare elements. Example:</p>
-     * <pre>
-     * function compare(a, b) {
-     *  if (a is less than b by some ordering criterion) {
-     *     return -1;
-     *  } if (a is greater than b by the ordering criterion) {
-     *     return 1;
-     *  }
-     *  // a must be equal to b
-     *  return 0;
-     * }
-     * </pre>
-     * @constructor
-     * @param {function(Object,Object):number=} compareFunction optional
-     * function used to compare two elements. Must return a negative integer,
-     * zero, or a positive integer as the first argument is less than, equal to,
-     * or greater than the second.
-     */
-    constructor(compareFunction?: util.ICompareFunction<T>);
-    /**
-     * Adds the specified element to this tree if it is not already present.
-     * @param {Object} element the element to insert.
-     * @return {boolean} true if this tree did not already contain the specified element.
-     */
-    add(element: T): boolean;
-    /**
-     * Removes all of the elements from this tree.
-     */
-    clear(): void;
-    /**
-     * Returns true if this tree contains no elements.
-     * @return {boolean} true if this tree contains no elements.
-     */
-    isEmpty(): boolean;
-    /**
-     * Returns the number of elements in this tree.
-     * @return {number} the number of elements in this tree.
-     */
-    size(): number;
-    /**
-     * Returns true if this tree contains the specified element.
-     * @param {Object} element element to search for.
-     * @return {boolean} true if this tree contains the specified element,
-     * false otherwise.
-     */
-    contains(element: T): boolean;
-    /**
-     * Removes the specified element from this tree if it is present.
-     * @return {boolean} true if this tree contained the specified element.
-     */
-    remove(element: T): boolean;
-    /**
-     * Executes the provided function once for each element present in this tree in
-     * in-order.
-     * @param {function(Object):*} callback function to execute, it is invoked with one
-     * argument: the element value, to break the iteration you can optionally return false.
-     */
-    inorderTraversal(callback: util.ILoopFunction<T>): void;
-    /**
-     * Executes the provided function once for each element present in this tree in pre-order.
-     * @param {function(Object):*} callback function to execute, it is invoked with one
-     * argument: the element value, to break the iteration you can optionally return false.
-     */
-    preorderTraversal(callback: util.ILoopFunction<T>): void;
-    /**
-     * Executes the provided function once for each element present in this tree in post-order.
-     * @param {function(Object):*} callback function to execute, it is invoked with one
-     * argument: the element value, to break the iteration you can optionally return false.
-     */
-    postorderTraversal(callback: util.ILoopFunction<T>): void;
-    /**
-     * Executes the provided function once for each element present in this tree in
-     * level-order.
-     * @param {function(Object):*} callback function to execute, it is invoked with one
-     * argument: the element value, to break the iteration you can optionally return false.
-     */
-    levelTraversal(callback: util.ILoopFunction<T>): void;
-    /**
-     * Returns the minimum element of this tree.
-     * @return {*} the minimum element of this tree or undefined if this tree is
-     * is empty.
-     */
-    minimum(): T;
-    /**
-     * Returns the maximum element of this tree.
-     * @return {*} the maximum element of this tree or undefined if this tree is
-     * is empty.
-     */
-    maximum(): T;
-    /**
-     * Executes the provided function once for each element present in this tree in inorder.
-     * Equivalent to inorderTraversal.
-     * @param {function(Object):*} callback function to execute, it is
-     * invoked with one argument: the element value, to break the iteration you can
-     * optionally return false.
-     */
-    forEach(callback: util.ILoopFunction<T>): void;
-    /**
-     * Returns an array containing all of the elements in this tree in in-order.
-     * @return {Array} an array containing all of the elements in this tree in in-order.
-     */
-    toArray(): T[];
-    /**
-     * Returns the height of this tree.
-     * @return {number} the height of this tree or -1 if is empty.
-     */
-    height(): number;
-    /**
-    * @private
-    */
-    private searchNode(node, element);
-    /**
-    * @private
-    */
-    private transplant(n1, n2);
-    /**
-    * @private
-    */
-    private removeNode(node);
-    /**
-    * @private
-    */
-    private inorderTraversalAux(node, callback, signal);
-    /**
-    * @private
-    */
-    private levelTraversalAux(node, callback);
-    /**
-    * @private
-    */
-    private preorderTraversalAux(node, callback, signal);
-    /**
-    * @private
-    */
-    private postorderTraversalAux(node, callback, signal);
-    /**
-    * @private
-    */
-    private minimumAux(node);
-    /**
-    * @private
-    */
-    private maximumAux(node);
-    /**
-      * @private
-      */
-    private heightAux(node);
-    private insertNode(node);
-    /**
-    * @private
-    */
-    private createNode(element);
-}
diff --git a/dist/lib/BSTree.js b/dist/lib/BSTree.js
deleted file mode 100644
index ff5072d..0000000
--- a/dist/lib/BSTree.js
+++ /dev/null
@@ -1,400 +0,0 @@
-"use strict";
-var util = require('./util');
-var Queue_1 = require('./Queue');
-var BSTree = (function () {
-    /**
-     * Creates an empty binary search tree.
-     * @class <p>A binary search tree is a binary tree in which each
-     * internal node stores an element such that the elements stored in the
-     * left subtree are less than it and the elements
-     * stored in the right subtree are greater.</p>
-     * <p>Formally, a binary search tree is a node-based binary tree data structure which
-     * has the following properties:</p>
-     * <ul>
-     * <li>The left subtree of a node contains only nodes with elements less
-     * than the node's element</li>
-     * <li>The right subtree of a node contains only nodes with elements greater
-     * than the node's element</li>
-     * <li>Both the left and right subtrees must also be binary search trees.</li>
-     * </ul>
-     * <p>If the inserted elements are custom objects a compare function must
-     * be provided at construction time, otherwise the <=, === and >= operators are
-     * used to compare elements. Example:</p>
-     * <pre>
-     * function compare(a, b) {
-     *  if (a is less than b by some ordering criterion) {
-     *     return -1;
-     *  } if (a is greater than b by the ordering criterion) {
-     *     return 1;
-     *  }
-     *  // a must be equal to b
-     *  return 0;
-     * }
-     * </pre>
-     * @constructor
-     * @param {function(Object,Object):number=} compareFunction optional
-     * function used to compare two elements. Must return a negative integer,
-     * zero, or a positive integer as the first argument is less than, equal to,
-     * or greater than the second.
-     */
-    function BSTree(compareFunction) {
-        this.root = null;
-        this.compare = compareFunction || util.defaultCompare;
-        this.nElements = 0;
-    }
-    /**
-     * Adds the specified element to this tree if it is not already present.
-     * @param {Object} element the element to insert.
-     * @return {boolean} true if this tree did not already contain the specified element.
-     */
-    BSTree.prototype.add = function (element) {
-        if (util.isUndefined(element)) {
-            return false;
-        }
-        if (this.insertNode(this.createNode(element)) !== null) {
-            this.nElements++;
-            return true;
-        }
-        return false;
-    };
-    /**
-     * Removes all of the elements from this tree.
-     */
-    BSTree.prototype.clear = function () {
-        this.root = null;
-        this.nElements = 0;
-    };
-    /**
-     * Returns true if this tree contains no elements.
-     * @return {boolean} true if this tree contains no elements.
-     */
-    BSTree.prototype.isEmpty = function () {
-        return this.nElements === 0;
-    };
-    /**
-     * Returns the number of elements in this tree.
-     * @return {number} the number of elements in this tree.
-     */
-    BSTree.prototype.size = function () {
-        return this.nElements;
-    };
-    /**
-     * Returns true if this tree contains the specified element.
-     * @param {Object} element element to search for.
-     * @return {boolean} true if this tree contains the specified element,
-     * false otherwise.
-     */
-    BSTree.prototype.contains = function (element) {
-        if (util.isUndefined(element)) {
-            return false;
-        }
-        return this.searchNode(this.root, element) !== null;
-    };
-    /**
-     * Removes the specified element from this tree if it is present.
-     * @return {boolean} true if this tree contained the specified element.
-     */
-    BSTree.prototype.remove = function (element) {
-        var node = this.searchNode(this.root, element);
-        if (node === null) {
-            return false;
-        }
-        this.removeNode(node);
-        this.nElements--;
-        return true;
-    };
-    /**
-     * Executes the provided function once for each element present in this tree in
-     * in-order.
-     * @param {function(Object):*} callback function to execute, it is invoked with one
-     * argument: the element value, to break the iteration you can optionally return false.
-     */
-    BSTree.prototype.inorderTraversal = function (callback) {
-        this.inorderTraversalAux(this.root, callback, {
-            stop: false
-        });
-    };
-    /**
-     * Executes the provided function once for each element present in this tree in pre-order.
-     * @param {function(Object):*} callback function to execute, it is invoked with one
-     * argument: the element value, to break the iteration you can optionally return false.
-     */
-    BSTree.prototype.preorderTraversal = function (callback) {
-        this.preorderTraversalAux(this.root, callback, {
-            stop: false
-        });
-    };
-    /**
-     * Executes the provided function once for each element present in this tree in post-order.
-     * @param {function(Object):*} callback function to execute, it is invoked with one
-     * argument: the element value, to break the iteration you can optionally return false.
-     */
-    BSTree.prototype.postorderTraversal = function (callback) {
-        this.postorderTraversalAux(this.root, callback, {
-            stop: false
-        });
-    };
-    /**
-     * Executes the provided function once for each element present in this tree in
-     * level-order.
-     * @param {function(Object):*} callback function to execute, it is invoked with one
-     * argument: the element value, to break the iteration you can optionally return false.
-     */
-    BSTree.prototype.levelTraversal = function (callback) {
-        this.levelTraversalAux(this.root, callback);
-    };
-    /**
-     * Returns the minimum element of this tree.
-     * @return {*} the minimum element of this tree or undefined if this tree is
-     * is empty.
-     */
-    BSTree.prototype.minimum = function () {
-        if (this.isEmpty()) {
-            return undefined;
-        }
-        return this.minimumAux(this.root).element;
-    };
-    /**
-     * Returns the maximum element of this tree.
-     * @return {*} the maximum element of this tree or undefined if this tree is
-     * is empty.
-     */
-    BSTree.prototype.maximum = function () {
-        if (this.isEmpty()) {
-            return undefined;
-        }
-        return this.maximumAux(this.root).element;
-    };
-    /**
-     * Executes the provided function once for each element present in this tree in inorder.
-     * Equivalent to inorderTraversal.
-     * @param {function(Object):*} callback function to execute, it is
-     * invoked with one argument: the element value, to break the iteration you can
-     * optionally return false.
-     */
-    BSTree.prototype.forEach = function (callback) {
-        this.inorderTraversal(callback);
-    };
-    /**
-     * Returns an array containing all of the elements in this tree in in-order.
-     * @return {Array} an array containing all of the elements in this tree in in-order.
-     */
-    BSTree.prototype.toArray = function () {
-        var array = [];
-        this.inorderTraversal(function (element) {
-            array.push(element);
-            return true;
-        });
-        return array;
-    };
-    /**
-     * Returns the height of this tree.
-     * @return {number} the height of this tree or -1 if is empty.
-     */
-    BSTree.prototype.height = function () {
-        return this.heightAux(this.root);
-    };
-    /**
-    * @private
-    */
-    BSTree.prototype.searchNode = function (node, element) {
-        var cmp = null;
-        while (node !== null && cmp !== 0) {
-            cmp = this.compare(element, node.element);
-            if (cmp < 0) {
-                node = node.leftCh;
-            }
-            else if (cmp > 0) {
-                node = node.rightCh;
-            }
-        }
-        return node;
-    };
-    /**
-    * @private
-    */
-    BSTree.prototype.transplant = function (n1, n2) {
-        if (n1.parent === null) {
-            this.root = n2;
-        }
-        else if (n1 === n1.parent.leftCh) {
-            n1.parent.leftCh = n2;
-        }
-        else {
-            n1.parent.rightCh = n2;
-        }
-        if (n2 !== null) {
-            n2.parent = n1.parent;
-        }
-    };
-    /**
-    * @private
-    */
-    BSTree.prototype.removeNode = function (node) {
-        if (node.leftCh === null) {
-            this.transplant(node, node.rightCh);
-        }
-        else if (node.rightCh === null) {
-            this.transplant(node, node.leftCh);
-        }
-        else {
-            var y = this.minimumAux(node.rightCh);
-            if (y.parent !== node) {
-                this.transplant(y, y.rightCh);
-                y.rightCh = node.rightCh;
-                y.rightCh.parent = y;
-            }
-            this.transplant(node, y);
-            y.leftCh = node.leftCh;
-            y.leftCh.parent = y;
-        }
-    };
-    /**
-    * @private
-    */
-    BSTree.prototype.inorderTraversalAux = function (node, callback, signal) {
-        if (node === null || signal.stop) {
-            return;
-        }
-        this.inorderTraversalAux(node.leftCh, callback, signal);
-        if (signal.stop) {
-            return;
-        }
-        signal.stop = callback(node.element) === false;
-        if (signal.stop) {
-            return;
-        }
-        this.inorderTraversalAux(node.rightCh, callback, signal);
-    };
-    /**
-    * @private
-    */
-    BSTree.prototype.levelTraversalAux = function (node, callback) {
-        var queue = new Queue_1.default();
-        if (node !== null) {
-            queue.enqueue(node);
-        }
-        while (!queue.isEmpty()) {
-            node = queue.dequeue();
-            if (callback(node.element) === false) {
-                return;
-            }
-            if (node.leftCh !== null) {
-                queue.enqueue(node.leftCh);
-            }
-            if (node.rightCh !== null) {
-                queue.enqueue(node.rightCh);
-            }
-        }
-    };
-    /**
-    * @private
-    */
-    BSTree.prototype.preorderTraversalAux = function (node, callback, signal) {
-        if (node === null || signal.stop) {
-            return;
-        }
-        signal.stop = callback(node.element) === false;
-        if (signal.stop) {
-            return;
-        }
-        this.preorderTraversalAux(node.leftCh, callback, signal);
-        if (signal.stop) {
-            return;
-        }
-        this.preorderTraversalAux(node.rightCh, callback, signal);
-    };
-    /**
-    * @private
-    */
-    BSTree.prototype.postorderTraversalAux = function (node, callback, signal) {
-        if (node === null || signal.stop) {
-            return;
-        }
-        this.postorderTraversalAux(node.leftCh, callback, signal);
-        if (signal.stop) {
-            return;
-        }
-        this.postorderTraversalAux(node.rightCh, callback, signal);
-        if (signal.stop) {
-            return;
-        }
-        signal.stop = callback(node.element) === false;
-    };
-    /**
-    * @private
-    */
-    BSTree.prototype.minimumAux = function (node) {
-        while (node.leftCh !== null) {
-            node = node.leftCh;
-        }
-        return node;
-    };
-    /**
-    * @private
-    */
-    BSTree.prototype.maximumAux = function (node) {
-        while (node.rightCh !== null) {
-            node = node.rightCh;
-        }
-        return node;
-    };
-    /**
-      * @private
-      */
-    BSTree.prototype.heightAux = function (node) {
-        if (node === null) {
-            return -1;
-        }
-        return Math.max(this.heightAux(node.leftCh), this.heightAux(node.rightCh)) + 1;
-    };
-    /*
-    * @private
-    */
-    BSTree.prototype.insertNode = function (node) {
-        var parent = null;
-        var position = this.root;
-        var cmp = null;
-        while (position !== null) {
-            cmp = this.compare(node.element, position.element);
-            if (cmp === 0) {
-                return null;
-            }
-            else if (cmp < 0) {
-                parent = position;
-                position = position.leftCh;
-            }
-            else {
-                parent = position;
-                position = position.rightCh;
-            }
-        }
-        node.parent = parent;
-        if (parent === null) {
-            // tree is empty
-            this.root = node;
-        }
-        else if (this.compare(node.element, parent.element) < 0) {
-            parent.leftCh = node;
-        }
-        else {
-            parent.rightCh = node;
-        }
-        return node;
-    };
-    /**
-    * @private
-    */
-    BSTree.prototype.createNode = function (element) {
-        return {
-            element: element,
-            leftCh: null,
-            rightCh: null,
-            parent: null
-        };
-    };
-    return BSTree;
-}());
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.default = BSTree;
-//# sourceMappingURL=BSTree.js.map
\ No newline at end of file
diff --git a/dist/lib/BSTree.js.map b/dist/lib/BSTree.js.map
deleted file mode 100644
index 5897a3b..0000000
--- a/dist/lib/BSTree.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"BSTree.js","sourceRoot":"","sources":["../../src/lib/BSTree.ts"],"names":[],"mappings":";AAAA,IAAY,IAAI,WAAM,QAAQ,CAAC,CAAA;AAC/B,sBAAkB,SAAS,CAAC,CAAA;AAQ5B;IAKI;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAkCG;IACH,gBAAY,eAA0C;QAClD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,OAAO,GAAG,eAAe,IAAI,IAAI,CAAC,cAAc,CAAC;QACtD,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACvB,CAAC;IAED;;;;OAIG;IACH,oBAAG,GAAH,UAAI,OAAU;QACV,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QAED,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;YACrD,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,MAAM,CAAC,IAAI,CAAC;QAChB,CAAC;QACD,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,sBAAK,GAAL;QACI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACvB,CAAC;IAED;;;OAGG;IACH,wBAAO,GAAP;QACI,MAAM,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,CAAC;IAChC,CAAC;IAED;;;OAGG;IACH,qBAAI,GAAJ;QACI,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC;IAC1B,CAAC;IAED;;;;;OAKG;IACH,yBAAQ,GAAR,UAAS,OAAU;QACf,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,KAAK,IAAI,CAAC;IACxD,CAAC;IAED;;;OAGG;IACH,uBAAM,GAAN,UAAO,OAAU;QACb,IAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACjD,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QACD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,MAAM,CAAC,IAAI,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACH,iCAAgB,GAAhB,UAAiB,QAA+B;QAC5C,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,EAAE;YAC1C,IAAI,EAAE,KAAK;SACd,CAAC,CAAC;IACP,CAAC;IAED;;;;OAIG;IACH,kCAAiB,GAAjB,UAAkB,QAA+B;QAC7C,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,EAAE;YAC3C,IAAI,EAAE,KAAK;SACd,CAAC,CAAC;IACP,CAAC;IAED;;;;OAIG;IACH,mCAAkB,GAAlB,UAAmB,QAA+B;QAC9C,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,EAAE;YAC5C,IAAI,EAAE,KAAK;SACd,CAAC,CAAC;IACP,CAAC;IAED;;;;;OAKG;IACH,+BAAc,GAAd,UAAe,QAA+B;QAC1C,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAChD,CAAC;IAED;;;;OAIG;IACH,wBAAO,GAAP;QACI,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;YACjB,MAAM,CAAC,SAAS,CAAC;QACrB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC;IAC9C,CAAC;IAED;;;;OAIG;IACH,wBAAO,GAAP;QACI,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;YACjB,MAAM,CAAC,SAAS,CAAC;QACrB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC;IAC9C,CAAC;IAED;;;;;;OAMG;IACH,wBAAO,GAAP,UAAQ,QAA+B;QACnC,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IACpC,CAAC;IAED;;;OAGG;IACH,wBAAO,GAAP;QACI,IAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,UAAS,OAAU;YACrC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC;QAChB,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,uBAAM,GAAN;QACI,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;IAED;;MAEE;IACM,2BAAU,GAAlB,UAAmB,IAAmB,EAAE,OAAU;QAC9C,IAAI,GAAG,GAAW,IAAI,CAAC;QACvB,OAAO,IAAI,KAAK,IAAI,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;YAChC,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;YAC1C,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;gBACV,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;YACvB,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;gBACjB,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC;YACxB,CAAC;QACL,CAAC;QACD,MAAM,CAAC,IAAI,CAAC;IAChB,CAAC;IAED;;MAEE;IACM,2BAAU,GAAlB,UAAmB,EAAiB,EAAE,EAAiB;QACnD,EAAE,CAAC,CAAC,EAAE,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC;YACrB,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;QACnB,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;YACjC,EAAE,CAAC,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;QAC1B,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,EAAE,CAAC,MAAM,CAAC,OAAO,GAAG,EAAE,CAAC;QAC3B,CAAC;QACD,EAAE,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC;YACd,EAAE,CAAC,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC;QAC1B,CAAC;IACL,CAAC;IAED;;MAEE;IACM,2BAAU,GAAlB,UAAmB,IAAmB;QAClC,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC;YACvB,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QACxC,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC;YAC/B,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACvC,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,IAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACxC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC;gBACpB,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;gBAC9B,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;gBACzB,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;YACzB,CAAC;YACD,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACzB,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YACvB,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,CAAC;IACL,CAAC;IAED;;MAEE;IACM,oCAAmB,GAA3B,UAA4B,IAAmB,EAAE,QAA+B,EAAE,MAA0B;QACxG,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC;QACX,CAAC;QACD,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QACxD,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YACd,MAAM,CAAC;QACX,CAAC;QACD,MAAM,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,CAAC;QAC/C,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YACd,MAAM,CAAC;QACX,CAAC;QACD,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;IAC7D,CAAC;IAED;;MAEE;IACM,kCAAiB,GAAzB,UAA0B,IAAmB,EAAE,QAA+B;QAC1E,IAAM,KAAK,GAAG,IAAI,eAAK,EAAiB,CAAC;QACzC,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC;YAChB,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;QACD,OAAO,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YACtB,IAAI,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;YACvB,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC;gBACnC,MAAM,CAAC;YACX,CAAC;YACD,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC;gBACvB,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC/B,CAAC;YACD,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC;gBACxB,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAChC,CAAC;QACL,CAAC;IACL,CAAC;IAED;;MAEE;IACM,qCAAoB,GAA5B,UAA6B,IAAmB,EAAE,QAA+B,EAAE,MAA0B;QACzG,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC;QACX,CAAC;QACD,MAAM,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,CAAC;QAC/C,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YACd,MAAM,CAAC;QACX,CAAC;QACD,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QACzD,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YACd,MAAM,CAAC;QACX,CAAC;QACD,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;IAC9D,CAAC;IACD;;MAEE;IACM,sCAAqB,GAA7B,UAA8B,IAAmB,EAAE,QAA+B,EAAE,MAA0B;QAC1G,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC;QACX,CAAC;QACD,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QAC1D,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YACd,MAAM,CAAC;QACX,CAAC;QACD,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QAC3D,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YACd,MAAM,CAAC;QACX,CAAC;QACD,MAAM,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,CAAC;IACnD,CAAC;IAED;;MAEE;IACM,2BAAU,GAAlB,UAAmB,IAAmB;QAClC,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;YAC1B,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;QACvB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC;IAChB,CAAC;IAED;;MAEE;IACM,2BAAU,GAAlB,UAAmB,IAAmB;QAClC,OAAO,IAAI,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;YAC3B,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC;QACxB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC;IAChB,CAAC;IAED;;QAEI;IACI,0BAAS,GAAjB,UAAkB,IAAmB;QACjC,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,CAAC,CAAC,CAAC;QACd,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC;IACnF,CAAC;IAED;;MAEE;IACM,2BAAU,GAAlB,UAAmB,IAAmB;QAElC,IAAI,MAAM,GAAQ,IAAI,CAAC;QACvB,IAAI,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC;QACzB,IAAI,GAAG,GAAW,IAAI,CAAC;QACvB,OAAO,QAAQ,KAAK,IAAI,EAAE,CAAC;YACvB,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,OAAO,CAAC,CAAC;YACnD,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACZ,MAAM,CAAC,IAAI,CAAC;YAChB,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;gBACjB,MAAM,GAAG,QAAQ,CAAC;gBAClB,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC;YAC/B,CAAC;YAAC,IAAI,CAAC,CAAC;gBACJ,MAAM,GAAG,QAAQ,CAAC;gBAClB,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC;YAChC,CAAC;QACL,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,EAAE,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC;YAClB,gBAAgB;YAChB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACrB,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACxD,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC;QACzB,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC;QAC1B,CAAC;QACD,MAAM,CAAC,IAAI,CAAC;IAChB,CAAC;IAED;;MAEE;IACM,2BAAU,GAAlB,UAAmB,OAAU;QACzB,MAAM,CAAC;YACH,OAAO,EAAE,OAAO;YAChB,MAAM,EAAE,IAAI;YACZ,OAAO,EAAE,IAAI;YACb,MAAM,EAAE,IAAI;SACf,CAAC;IACN,CAAC;IAEL,aAAC;AAAD,CAAC,AAhaD,IAgaC;AAhaD;wBAgaC,CAAA"}
\ No newline at end of file
diff --git a/dist/lib/Bag.d.ts b/dist/lib/Bag.d.ts
deleted file mode 100644
index 9229dce..0000000
--- a/dist/lib/Bag.d.ts
+++ /dev/null
@@ -1,91 +0,0 @@
-import * as util from './util';
-import Set from './Set';
-export default class Bag<T> {
-    private toStrF;
-    private dictionary;
-    private nElements;
-    /**
-     * Creates an empty bag.
-     * @class <p>A bag is a special kind of set in which members are
-     * allowed to appear more than once.</p>
-     * <p>If the inserted elements are custom objects a function
-     * which converts elements to unique strings must be provided. Example:</p>
-     *
-     * <pre>
-     * function petToString(pet) {
-     *  return pet.name;
-     * }
-     * </pre>
-     *
-     * @constructor
-     * @param {function(Object):string=} toStrFunction optional function used
-     * to convert elements to strings. If the elements aren't strings or if toString()
-     * is not appropriate, a custom function which receives an object and returns a
-     * unique string must be provided.
-     */
-    constructor(toStrFunction?: (item: T) => string);
-    /**
-    * Adds nCopies of the specified object to this bag.
-    * @param {Object} element element to add.
-    * @param {number=} nCopies the number of copies to add, if this argument is
-    * undefined 1 copy is added.
-    * @return {boolean} true unless element is undefined.
-    */
-    add(element: T, nCopies?: number): boolean;
-    /**
-    * Counts the number of copies of the specified object in this bag.
-    * @param {Object} element the object to search for..
-    * @return {number} the number of copies of the object, 0 if not found
-    */
-    count(element: T): number;
-    /**
-     * Returns true if this bag contains the specified element.
-     * @param {Object} element element to search for.
-     * @return {boolean} true if this bag contains the specified element,
-     * false otherwise.
-     */
-    contains(element: T): boolean;
-    /**
-    * Removes nCopies of the specified object to this bag.
-    * If the number of copies to remove is greater than the actual number
-    * of copies in the Bag, all copies are removed.
-    * @param {Object} element element to remove.
-    * @param {number=} nCopies the number of copies to remove, if this argument is
-    * undefined 1 copy is removed.
-    * @return {boolean} true if at least 1 element was removed.
-    */
-    remove(element: T, nCopies?: number): boolean;
-    /**
-     * Returns an array containing all of the elements in this big in arbitrary order,
-     * including multiple copies.
-     * @return {Array} an array containing all of the elements in this bag.
-     */
-    toArray(): T[];
-    /**
-     * Returns a set of unique elements in this bag.
-     * @return {collections.Set<T>} a set of unique elements in this bag.
-     */
-    toSet(): Set<T>;
-    /**
-     * Executes the provided function once for each element
-     * present in this bag, including multiple copies.
-     * @param {function(Object):*} callback function to execute, it is
-     * invoked with one argument: the element. To break the iteration you can
-     * optionally return false.
-     */
-    forEach(callback: util.ILoopFunction<T>): void;
-    /**
-     * Returns the number of elements in this bag.
-     * @return {number} the number of elements in this bag.
-     */
-    size(): number;
-    /**
-     * Returns true if this bag contains no elements.
-     * @return {boolean} true if this bag contains no elements.
-     */
-    isEmpty(): boolean;
-    /**
-     * Removes all of the elements from this bag.
-     */
-    clear(): void;
-}
diff --git a/dist/lib/Bag.js b/dist/lib/Bag.js
deleted file mode 100644
index 2b904b3..0000000
--- a/dist/lib/Bag.js
+++ /dev/null
@@ -1,185 +0,0 @@
-"use strict";
-var util = require('./util');
-var Dictionary_1 = require('./Dictionary');
-var Set_1 = require('./Set');
-var Bag = (function () {
-    /**
-     * Creates an empty bag.
-     * @class <p>A bag is a special kind of set in which members are
-     * allowed to appear more than once.</p>
-     * <p>If the inserted elements are custom objects a function
-     * which converts elements to unique strings must be provided. Example:</p>
-     *
-     * <pre>
-     * function petToString(pet) {
-     *  return pet.name;
-     * }
-     * </pre>
-     *
-     * @constructor
-     * @param {function(Object):string=} toStrFunction optional function used
-     * to convert elements to strings. If the elements aren't strings or if toString()
-     * is not appropriate, a custom function which receives an object and returns a
-     * unique string must be provided.
-     */
-    function Bag(toStrFunction) {
-        this.toStrF = toStrFunction || util.defaultToString;
-        this.dictionary = new Dictionary_1.default(this.toStrF);
-        this.nElements = 0;
-    }
-    /**
-    * Adds nCopies of the specified object to this bag.
-    * @param {Object} element element to add.
-    * @param {number=} nCopies the number of copies to add, if this argument is
-    * undefined 1 copy is added.
-    * @return {boolean} true unless element is undefined.
-    */
-    Bag.prototype.add = function (element, nCopies) {
-        if (nCopies === void 0) { nCopies = 1; }
-        if (util.isUndefined(element) || nCopies <= 0) {
-            return false;
-        }
-        if (!this.contains(element)) {
-            var node = {
-                value: element,
-                copies: nCopies
-            };
-            this.dictionary.setValue(element, node);
-        }
-        else {
-            this.dictionary.getValue(element).copies += nCopies;
-        }
-        this.nElements += nCopies;
-        return true;
-    };
-    /**
-    * Counts the number of copies of the specified object in this bag.
-    * @param {Object} element the object to search for..
-    * @return {number} the number of copies of the object, 0 if not found
-    */
-    Bag.prototype.count = function (element) {
-        if (!this.contains(element)) {
-            return 0;
-        }
-        else {
-            return this.dictionary.getValue(element).copies;
-        }
-    };
-    /**
-     * Returns true if this bag contains the specified element.
-     * @param {Object} element element to search for.
-     * @return {boolean} true if this bag contains the specified element,
-     * false otherwise.
-     */
-    Bag.prototype.contains = function (element) {
-        return this.dictionary.containsKey(element);
-    };
-    /**
-    * Removes nCopies of the specified object to this bag.
-    * If the number of copies to remove is greater than the actual number
-    * of copies in the Bag, all copies are removed.
-    * @param {Object} element element to remove.
-    * @param {number=} nCopies the number of copies to remove, if this argument is
-    * undefined 1 copy is removed.
-    * @return {boolean} true if at least 1 element was removed.
-    */
-    Bag.prototype.remove = function (element, nCopies) {
-        if (nCopies === void 0) { nCopies = 1; }
-        if (util.isUndefined(element) || nCopies <= 0) {
-            return false;
-        }
-        if (!this.contains(element)) {
-            return false;
-        }
-        else {
-            var node = this.dictionary.getValue(element);
-            if (nCopies > node.copies) {
-                this.nElements -= node.copies;
-            }
-            else {
-                this.nElements -= nCopies;
-            }
-            node.copies -= nCopies;
-            if (node.copies <= 0) {
-                this.dictionary.remove(element);
-            }
-            return true;
-        }
-    };
-    /**
-     * Returns an array containing all of the elements in this big in arbitrary order,
-     * including multiple copies.
-     * @return {Array} an array containing all of the elements in this bag.
-     */
-    Bag.prototype.toArray = function () {
-        var a = [];
-        var values = this.dictionary.values();
-        for (var _i = 0, values_1 = values; _i < values_1.length; _i++) {
-            var node = values_1[_i];
-            var element = node.value;
-            var copies = node.copies;
-            for (var j = 0; j < copies; j++) {
-                a.push(element);
-            }
-        }
-        return a;
-    };
-    /**
-     * Returns a set of unique elements in this bag.
-     * @return {collections.Set<T>} a set of unique elements in this bag.
-     */
-    Bag.prototype.toSet = function () {
-        var toret = new Set_1.default(this.toStrF);
-        var elements = this.dictionary.values();
-        for (var _i = 0, elements_1 = elements; _i < elements_1.length; _i++) {
-            var ele = elements_1[_i];
-            var value = ele.value;
-            toret.add(value);
-        }
-        return toret;
-    };
-    /**
-     * Executes the provided function once for each element
-     * present in this bag, including multiple copies.
-     * @param {function(Object):*} callback function to execute, it is
-     * invoked with one argument: the element. To break the iteration you can
-     * optionally return false.
-     */
-    Bag.prototype.forEach = function (callback) {
-        this.dictionary.forEach(function (k, v) {
-            var value = v.value;
-            var copies = v.copies;
-            for (var i = 0; i < copies; i++) {
-                if (callback(value) === false) {
-                    return false;
-                }
-            }
-            return true;
-        });
-    };
-    /**
-     * Returns the number of elements in this bag.
-     * @return {number} the number of elements in this bag.
-     */
-    Bag.prototype.size = function () {
-        return this.nElements;
-    };
-    /**
-     * Returns true if this bag contains no elements.
-     * @return {boolean} true if this bag contains no elements.
-     */
-    Bag.prototype.isEmpty = function () {
-        return this.nElements === 0;
-    };
-    /**
-     * Removes all of the elements from this bag.
-     */
-    Bag.prototype.clear = function () {
-        this.nElements = 0;
-        this.dictionary.clear();
-    };
-    return Bag;
-}());
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.default = Bag; // End of bag
-//# sourceMappingURL=Bag.js.map
\ No newline at end of file
diff --git a/dist/lib/Bag.js.map b/dist/lib/Bag.js.map
deleted file mode 100644
index 728157b..0000000
--- a/dist/lib/Bag.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"Bag.js","sourceRoot":"","sources":["../../src/lib/Bag.ts"],"names":[],"mappings":";AAAA,IAAY,IAAI,WAAM,QAAQ,CAAC,CAAA;AAC/B,2BAAuB,cAAc,CAAC,CAAA;AACtC,oBAAgB,OAAO,CAAC,CAAA;AAExB;IAMI;;;;;;;;;;;;;;;;;;OAkBG;IACH,aAAY,aAAmC;QAC3C,IAAI,CAAC,MAAM,GAAG,aAAa,IAAI,IAAI,CAAC,eAAe,CAAC;QACpD,IAAI,CAAC,UAAU,GAAG,IAAI,oBAAU,CAAS,IAAI,CAAC,MAAM,CAAC,CAAC;QACtD,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACvB,CAAC;IAGD;;;;;;MAME;IACF,iBAAG,GAAH,UAAI,OAAU,EAAE,OAAmB;QAAnB,uBAAmB,GAAnB,WAAmB;QAE/B,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,IAAI,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QAED,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAM,IAAI,GAAG;gBACT,KAAK,EAAE,OAAO;gBACd,MAAM,EAAE,OAAO;aAClB,CAAC;YACF,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC5C,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,MAAM,IAAI,OAAO,CAAC;QACxD,CAAC;QACD,IAAI,CAAC,SAAS,IAAI,OAAO,CAAC;QAC1B,MAAM,CAAC,IAAI,CAAC;IAChB,CAAC;IAED;;;;MAIE;IACF,mBAAK,GAAL,UAAM,OAAU;QAEZ,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,CAAC,CAAC;QACb,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;QACpD,CAAC;IACL,CAAC;IAED;;;;;OAKG;IACH,sBAAQ,GAAR,UAAS,OAAU;QACf,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;IAChD,CAAC;IAED;;;;;;;;MAQE;IACF,oBAAM,GAAN,UAAO,OAAU,EAAE,OAAmB;QAAnB,uBAAmB,GAAnB,WAAmB;QAElC,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,IAAI,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QAED,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,IAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YAC/C,EAAE,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;gBACxB,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC;YAClC,CAAC;YAAC,IAAI,CAAC,CAAC;gBACJ,IAAI,CAAC,SAAS,IAAI,OAAO,CAAC;YAC9B,CAAC;YACD,IAAI,CAAC,MAAM,IAAI,OAAO,CAAC;YACvB,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC;gBACnB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACpC,CAAC;YACD,MAAM,CAAC,IAAI,CAAC;QAChB,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,qBAAO,GAAP;QACI,IAAM,CAAC,GAAa,EAAE,CAAC;QACvB,IAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;QACxC,GAAG,CAAC,CAAe,UAAM,EAAN,iBAAM,EAAN,oBAAM,EAAN,IAAM,CAAC;YAArB,IAAM,IAAI,eAAA;YACX,IAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC;YAC3B,IAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACpB,CAAC;SACJ;QACD,MAAM,CAAC,CAAC,CAAC;IACb,CAAC;IAED;;;OAGG;IACH,mBAAK,GAAL;QACI,IAAM,KAAK,GAAG,IAAI,aAAG,CAAI,IAAI,CAAC,MAAM,CAAC,CAAC;QACtC,IAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;QAC1C,GAAG,CAAC,CAAc,UAAQ,EAAR,qBAAQ,EAAR,sBAAQ,EAAR,IAAQ,CAAC;YAAtB,IAAM,GAAG,iBAAA;YACV,IAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;YACxB,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;SACpB;QACD,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED;;;;;;OAMG;IACH,qBAAO,GAAP,UAAQ,QAA+B;QACnC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,UAAS,CAAC,EAAE,CAAC;YACjC,IAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;YACtB,IAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;YACxB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,EAAE,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC;oBAC5B,MAAM,CAAC,KAAK,CAAC;gBACjB,CAAC;YACL,CAAC;YACD,MAAM,CAAC,IAAI,CAAC;QAChB,CAAC,CAAC,CAAC;IACP,CAAC;IACD;;;OAGG;IACH,kBAAI,GAAJ;QACI,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,qBAAO,GAAP;QACI,MAAM,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,mBAAK,GAAL;QACI,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnB,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;IAC5B,CAAC;IAEL,UAAC;AAAD,CAAC,AA7LD,IA6LC;AA7LD;qBA6LC,CAAA,CAAA,aAAa"}
\ No newline at end of file
diff --git a/dist/lib/Dictionary.d.ts b/dist/lib/Dictionary.d.ts
deleted file mode 100644
index 84e446e..0000000
--- a/dist/lib/Dictionary.d.ts
+++ /dev/null
@@ -1,114 +0,0 @@
-export interface IDictionaryPair<K, V> {
-    key: K;
-    value: V;
-}
-export default class Dictionary<K, V> {
-    /**
-     * Object holding the key-value pairs.
-     * @type {Object}
-     * @private
-     */
-    protected table: {
-        [key: string]: IDictionaryPair<K, V>;
-    };
-    /**
-     * Number of elements in the list.
-     * @type {number}
-     * @private
-     */
-    protected nElements: number;
-    /**
-     * Function used to convert keys to strings.
-     * @type {function(Object):string}
-     * @protected
-     */
-    protected toStr: (key: K) => string;
-    /**
-     * Creates an empty dictionary.
-     * @class <p>Dictionaries map keys to values; each key can map to at most one value.
-     * This implementation accepts any kind of objects as keys.</p>
-     *
-     * <p>If the keys are custom objects a function which converts keys to unique
-     * strings must be provided. Example:</p>
-     * <pre>
-     * function petToString(pet) {
-     *  return pet.name;
-     * }
-     * </pre>
-     * @constructor
-     * @param {function(Object):string=} toStrFunction optional function used
-     * to convert keys to strings. If the keys aren't strings or if toString()
-     * is not appropriate, a custom function which receives a key and returns a
-     * unique string must be provided.
-     */
-    constructor(toStrFunction?: (key: K) => string);
-    /**
-     * Returns the value to which this dictionary maps the specified key.
-     * Returns undefined if this dictionary contains no mapping for this key.
-     * @param {Object} key key whose associated value is to be returned.
-     * @return {*} the value to which this dictionary maps the specified key or
-     * undefined if the map contains no mapping for this key.
-     */
-    getValue(key: K): V;
-    /**
-     * Associates the specified value with the specified key in this dictionary.
-     * If the dictionary previously contained a mapping for this key, the old
-     * value is replaced by the specified value.
-     * @param {Object} key key with which the specified value is to be
-     * associated.
-     * @param {Object} value value to be associated with the specified key.
-     * @return {*} previous value associated with the specified key, or undefined if
-     * there was no mapping for the key or if the key/value are undefined.
-     */
-    setValue(key: K, value: V): V;
-    /**
-     * Removes the mapping for this key from this dictionary if it is present.
-     * @param {Object} key key whose mapping is to be removed from the
-     * dictionary.
-     * @return {*} previous value associated with specified key, or undefined if
-     * there was no mapping for key.
-     */
-    remove(key: K): V;
-    /**
-     * Returns an array containing all of the keys in this dictionary.
-     * @return {Array} an array containing all of the keys in this dictionary.
-     */
-    keys(): K[];
-    /**
-     * Returns an array containing all of the values in this dictionary.
-     * @return {Array} an array containing all of the values in this dictionary.
-     */
-    values(): V[];
-    /**
-    * Executes the provided function once for each key-value pair
-    * present in this dictionary.
-    * @param {function(Object,Object):*} callback function to execute, it is
-    * invoked with two arguments: key and value. To break the iteration you can
-    * optionally return false.
-    */
-    forEach(callback: (key: K, value: V) => any): void;
-    /**
-     * Returns true if this dictionary contains a mapping for the specified key.
-     * @param {Object} key key whose presence in this dictionary is to be
-     * tested.
-     * @return {boolean} true if this dictionary contains a mapping for the
-     * specified key.
-     */
-    containsKey(key: K): boolean;
-    /**
-    * Removes all mappings from this dictionary.
-    * @this {collections.Dictionary}
-    */
-    clear(): void;
-    /**
-     * Returns the number of keys in this dictionary.
-     * @return {number} the number of key-value mappings in this dictionary.
-     */
-    size(): number;
-    /**
-     * Returns true if this dictionary contains no mappings.
-     * @return {boolean} true if this dictionary contains no mappings.
-     */
-    isEmpty(): boolean;
-    toString(): string;
-}
diff --git a/dist/lib/Dictionary.js b/dist/lib/Dictionary.js
deleted file mode 100644
index 21a0895..0000000
--- a/dist/lib/Dictionary.js
+++ /dev/null
@@ -1,177 +0,0 @@
-"use strict";
-var util = require('./util');
-var Dictionary = (function () {
-    /**
-     * Creates an empty dictionary.
-     * @class <p>Dictionaries map keys to values; each key can map to at most one value.
-     * This implementation accepts any kind of objects as keys.</p>
-     *
-     * <p>If the keys are custom objects a function which converts keys to unique
-     * strings must be provided. Example:</p>
-     * <pre>
-     * function petToString(pet) {
-     *  return pet.name;
-     * }
-     * </pre>
-     * @constructor
-     * @param {function(Object):string=} toStrFunction optional function used
-     * to convert keys to strings. If the keys aren't strings or if toString()
-     * is not appropriate, a custom function which receives a key and returns a
-     * unique string must be provided.
-     */
-    function Dictionary(toStrFunction) {
-        this.table = {};
-        this.nElements = 0;
-        this.toStr = toStrFunction || util.defaultToString;
-    }
-    /**
-     * Returns the value to which this dictionary maps the specified key.
-     * Returns undefined if this dictionary contains no mapping for this key.
-     * @param {Object} key key whose associated value is to be returned.
-     * @return {*} the value to which this dictionary maps the specified key or
-     * undefined if the map contains no mapping for this key.
-     */
-    Dictionary.prototype.getValue = function (key) {
-        var pair = this.table['$' + this.toStr(key)];
-        if (util.isUndefined(pair)) {
-            return undefined;
-        }
-        return pair.value;
-    };
-    /**
-     * Associates the specified value with the specified key in this dictionary.
-     * If the dictionary previously contained a mapping for this key, the old
-     * value is replaced by the specified value.
-     * @param {Object} key key with which the specified value is to be
-     * associated.
-     * @param {Object} value value to be associated with the specified key.
-     * @return {*} previous value associated with the specified key, or undefined if
-     * there was no mapping for the key or if the key/value are undefined.
-     */
-    Dictionary.prototype.setValue = function (key, value) {
-        if (util.isUndefined(key) || util.isUndefined(value)) {
-            return undefined;
-        }
-        var ret;
-        var k = '$' + this.toStr(key);
-        var previousElement = this.table[k];
-        if (util.isUndefined(previousElement)) {
-            this.nElements++;
-            ret = undefined;
-        }
-        else {
-            ret = previousElement.value;
-        }
-        this.table[k] = {
-            key: key,
-            value: value
-        };
-        return ret;
-    };
-    /**
-     * Removes the mapping for this key from this dictionary if it is present.
-     * @param {Object} key key whose mapping is to be removed from the
-     * dictionary.
-     * @return {*} previous value associated with specified key, or undefined if
-     * there was no mapping for key.
-     */
-    Dictionary.prototype.remove = function (key) {
-        var k = '$' + this.toStr(key);
-        var previousElement = this.table[k];
-        if (!util.isUndefined(previousElement)) {
-            delete this.table[k];
-            this.nElements--;
-            return previousElement.value;
-        }
-        return undefined;
-    };
-    /**
-     * Returns an array containing all of the keys in this dictionary.
-     * @return {Array} an array containing all of the keys in this dictionary.
-     */
-    Dictionary.prototype.keys = function () {
-        var array = [];
-        for (var name_1 in this.table) {
-            if (util.has(this.table, name_1)) {
-                var pair = this.table[name_1];
-                array.push(pair.key);
-            }
-        }
-        return array;
-    };
-    /**
-     * Returns an array containing all of the values in this dictionary.
-     * @return {Array} an array containing all of the values in this dictionary.
-     */
-    Dictionary.prototype.values = function () {
-        var array = [];
-        for (var name_2 in this.table) {
-            if (util.has(this.table, name_2)) {
-                var pair = this.table[name_2];
-                array.push(pair.value);
-            }
-        }
-        return array;
-    };
-    /**
-    * Executes the provided function once for each key-value pair
-    * present in this dictionary.
-    * @param {function(Object,Object):*} callback function to execute, it is
-    * invoked with two arguments: key and value. To break the iteration you can
-    * optionally return false.
-    */
-    Dictionary.prototype.forEach = function (callback) {
-        for (var name_3 in this.table) {
-            if (util.has(this.table, name_3)) {
-                var pair = this.table[name_3];
-                var ret = callback(pair.key, pair.value);
-                if (ret === false) {
-                    return;
-                }
-            }
-        }
-    };
-    /**
-     * Returns true if this dictionary contains a mapping for the specified key.
-     * @param {Object} key key whose presence in this dictionary is to be
-     * tested.
-     * @return {boolean} true if this dictionary contains a mapping for the
-     * specified key.
-     */
-    Dictionary.prototype.containsKey = function (key) {
-        return !util.isUndefined(this.getValue(key));
-    };
-    /**
-    * Removes all mappings from this dictionary.
-    * @this {collections.Dictionary}
-    */
-    Dictionary.prototype.clear = function () {
-        this.table = {};
-        this.nElements = 0;
-    };
-    /**
-     * Returns the number of keys in this dictionary.
-     * @return {number} the number of key-value mappings in this dictionary.
-     */
-    Dictionary.prototype.size = function () {
-        return this.nElements;
-    };
-    /**
-     * Returns true if this dictionary contains no mappings.
-     * @return {boolean} true if this dictionary contains no mappings.
-     */
-    Dictionary.prototype.isEmpty = function () {
-        return this.nElements <= 0;
-    };
-    Dictionary.prototype.toString = function () {
-        var toret = '{';
-        this.forEach(function (k, v) {
-            toret += "\n\t" + k + " : " + v;
-        });
-        return toret + '\n}';
-    };
-    return Dictionary;
-}());
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.default = Dictionary; // End of dictionary
-//# sourceMappingURL=Dictionary.js.map
\ No newline at end of file
diff --git a/dist/lib/Dictionary.js.map b/dist/lib/Dictionary.js.map
deleted file mode 100644
index 064192d..0000000
--- a/dist/lib/Dictionary.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"Dictionary.js","sourceRoot":"","sources":["../../src/lib/Dictionary.ts"],"names":[],"mappings":";AAAA,IAAY,IAAI,WAAM,QAAQ,CAAC,CAAA;AAS/B;IAyBI;;;;;;;;;;;;;;;;;OAiBG;IACH,oBAAY,aAAkC;QAC1C,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,aAAa,IAAI,IAAI,CAAC,eAAe,CAAC;IACvD,CAAC;IAGD;;;;;;OAMG;IACH,6BAAQ,GAAR,UAAS,GAAM;QACX,IAAM,IAAI,GAA0B,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QACtE,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,CAAC,SAAS,CAAC;QACrB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;IACtB,CAAC;IAGD;;;;;;;;;OASG;IACH,6BAAQ,GAAR,UAAS,GAAM,EAAE,KAAQ;QAErB,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACnD,MAAM,CAAC,SAAS,CAAC;QACrB,CAAC;QAED,IAAI,GAAM,CAAC;QACX,IAAM,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAChC,IAAM,eAAe,GAA0B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7D,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;YACpC,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,GAAG,GAAG,SAAS,CAAC;QACpB,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,GAAG,GAAG,eAAe,CAAC,KAAK,CAAC;QAChC,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG;YACZ,GAAG,EAAE,GAAG;YACR,KAAK,EAAE,KAAK;SACf,CAAC;QACF,MAAM,CAAC,GAAG,CAAC;IACf,CAAC;IAED;;;;;;OAMG;IACH,2BAAM,GAAN,UAAO,GAAM;QACT,IAAM,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAChC,IAAM,eAAe,GAA0B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7D,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;YACrC,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,MAAM,CAAC,eAAe,CAAC,KAAK,CAAC;QACjC,CAAC;QACD,MAAM,CAAC,SAAS,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,yBAAI,GAAJ;QACI,IAAM,KAAK,GAAQ,EAAE,CAAC;QACtB,GAAG,CAAC,CAAC,IAAM,MAAI,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC5B,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,MAAI,CAAC,CAAC,CAAC,CAAC;gBAC7B,IAAM,IAAI,GAA0B,IAAI,CAAC,KAAK,CAAC,MAAI,CAAC,CAAC;gBACrD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACzB,CAAC;QACL,CAAC;QACD,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,2BAAM,GAAN;QACI,IAAM,KAAK,GAAQ,EAAE,CAAC;QACtB,GAAG,CAAC,CAAC,IAAM,MAAI,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC5B,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,MAAI,CAAC,CAAC,CAAC,CAAC;gBAC7B,IAAM,IAAI,GAA0B,IAAI,CAAC,KAAK,CAAC,MAAI,CAAC,CAAC;gBACrD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3B,CAAC;QACL,CAAC;QACD,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED;;;;;;MAME;IACF,4BAAO,GAAP,UAAQ,QAAmC;QACvC,GAAG,CAAC,CAAC,IAAM,MAAI,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC5B,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,MAAI,CAAC,CAAC,CAAC,CAAC;gBAC7B,IAAM,IAAI,GAA0B,IAAI,CAAC,KAAK,CAAC,MAAI,CAAC,CAAC;gBACrD,IAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC3C,EAAE,CAAC,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC;oBAChB,MAAM,CAAC;gBACX,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED;;;;;;OAMG;IACH,gCAAW,GAAX,UAAY,GAAM;QACd,MAAM,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;IACjD,CAAC;IAED;;;MAGE;IACF,0BAAK,GAAL;QACI,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACvB,CAAC;IAED;;;OAGG;IACH,yBAAI,GAAJ;QACI,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,4BAAO,GAAP;QACI,MAAM,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC;IAC/B,CAAC;IAED,6BAAQ,GAAR;QACI,IAAI,KAAK,GAAG,GAAG,CAAC;QAChB,IAAI,CAAC,OAAO,CAAC,UAAC,CAAC,EAAE,CAAC;YACd,KAAK,IAAI,SAAO,CAAC,WAAM,CAAG,CAAC;QAC/B,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;IACzB,CAAC;IACL,iBAAC;AAAD,CAAC,AAhND,IAgNC;AAhND;4BAgNC,CAAA,CAAC,oBAAoB"}
\ No newline at end of file
diff --git a/dist/lib/FactoryDictionary.d.ts b/dist/lib/FactoryDictionary.d.ts
deleted file mode 100644
index 9ddeac2..0000000
--- a/dist/lib/FactoryDictionary.d.ts
+++ /dev/null
@@ -1,58 +0,0 @@
-import Dictionary from './Dictionary';
-export default class FactoryDictionary<K, V> extends Dictionary<K, V> {
-    /**
-     * Factory to create default values.
-     * @type {function(Object):string}
-     * @protected
-     */
-    protected defaultFactoryFunction: () => V;
-    /**
-     * Creates an empty dictionary.
-     * @class <p>Dictionaries map keys to values; each key can map to at most one value.
-     * This implementation accepts any kind of objects as keys.</p>
-     *
-     * <p>The default factory function should return a new object of the provided
-     * type. Example:</p>
-     * <pre>
-     * function petFactory() {
-     *  return new Pet();
-     * }
-     * </pre>
-     *
-     * <p>If the keys are custom objects a function which converts keys to unique
-     * strings must be provided. Example:</p>
-     * <pre>
-     * function petToString(pet) {
-     *  return pet.name;
-     * }
-     * </pre>
-     * @constructor
-     * @param {function():V=} defaultFactoryFunction function used to create a
-     * default object.
-     * @param {function(Object):string=} toStrFunction optional function used
-     * to convert keys to strings. If the keys aren't strings or if toString()
-     * is not appropriate, a custom function which receives a key and returns a
-     * unique string must be provided.
-     */
-    constructor(defaultFactoryFunction: () => V, toStrFunction?: (key: K) => string);
-    /**
-     * Associates the specified default value with the specified key in this dictionary,
-     * if it didn't contain the key yet. If the key existed, the existing value will be used.
-     * @param {Object} key key with which the specified value is to be
-     * associated.
-     * @param {Object} defaultValue default value to be associated with the specified key.
-     * @return {*} previous value associated with the specified key, or the default value,
-     * if the key didn't exist yet.
-     */
-    setDefault(key: K, defaultValue: V): V;
-    /**
-     * Returns the value to which this dictionary maps the specified key.
-     * Returns a default value created by the factory passed in the constructor,
-     * if this dictionary contains no mapping for this key. The missing key will
-     * automatically be added to the dictionary.
-     * @param {Object} key key whose associated value is to be returned.
-     * @return {*} the value to which this dictionary maps the specified key or
-     * a default value if the map contains no mapping for this key.
-     */
-    getValue(key: K): V;
-}
diff --git a/dist/lib/FactoryDictionary.js b/dist/lib/FactoryDictionary.js
deleted file mode 100644
index f78a533..0000000
--- a/dist/lib/FactoryDictionary.js
+++ /dev/null
@@ -1,76 +0,0 @@
-"use strict";
-var __extends = (this && this.__extends) || function (d, b) {
-    for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p];
-    function __() { this.constructor = d; }
-    d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
-};
-var Dictionary_1 = require('./Dictionary');
-var util = require('./util');
-var FactoryDictionary = (function (_super) {
-    __extends(FactoryDictionary, _super);
-    /**
-     * Creates an empty dictionary.
-     * @class <p>Dictionaries map keys to values; each key can map to at most one value.
-     * This implementation accepts any kind of objects as keys.</p>
-     *
-     * <p>The default factory function should return a new object of the provided
-     * type. Example:</p>
-     * <pre>
-     * function petFactory() {
-     *  return new Pet();
-     * }
-     * </pre>
-     *
-     * <p>If the keys are custom objects a function which converts keys to unique
-     * strings must be provided. Example:</p>
-     * <pre>
-     * function petToString(pet) {
-     *  return pet.name;
-     * }
-     * </pre>
-     * @constructor
-     * @param {function():V=} defaultFactoryFunction function used to create a
-     * default object.
-     * @param {function(Object):string=} toStrFunction optional function used
-     * to convert keys to strings. If the keys aren't strings or if toString()
-     * is not appropriate, a custom function which receives a key and returns a
-     * unique string must be provided.
-     */
-    function FactoryDictionary(defaultFactoryFunction, toStrFunction) {
-        _super.call(this, toStrFunction);
-        this.defaultFactoryFunction = defaultFactoryFunction;
-    }
-    /**
-     * Associates the specified default value with the specified key in this dictionary,
-     * if it didn't contain the key yet. If the key existed, the existing value will be used.
-     * @param {Object} key key with which the specified value is to be
-     * associated.
-     * @param {Object} defaultValue default value to be associated with the specified key.
-     * @return {*} previous value associated with the specified key, or the default value,
-     * if the key didn't exist yet.
-     */
-    FactoryDictionary.prototype.setDefault = function (key, defaultValue) {
-        var currentValue = _super.prototype.getValue.call(this, key);
-        if (util.isUndefined(currentValue)) {
-            this.setValue(key, defaultValue);
-            return defaultValue;
-        }
-        return currentValue;
-    };
-    /**
-     * Returns the value to which this dictionary maps the specified key.
-     * Returns a default value created by the factory passed in the constructor,
-     * if this dictionary contains no mapping for this key. The missing key will
-     * automatically be added to the dictionary.
-     * @param {Object} key key whose associated value is to be returned.
-     * @return {*} the value to which this dictionary maps the specified key or
-     * a default value if the map contains no mapping for this key.
-     */
-    FactoryDictionary.prototype.getValue = function (key) {
-        return this.setDefault(key, this.defaultFactoryFunction());
-    };
-    return FactoryDictionary;
-}(Dictionary_1.default));
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.default = FactoryDictionary;
-//# sourceMappingURL=FactoryDictionary.js.map
\ No newline at end of file
diff --git a/dist/lib/FactoryDictionary.js.map b/dist/lib/FactoryDictionary.js.map
deleted file mode 100644
index 20ba3f9..0000000
--- a/dist/lib/FactoryDictionary.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"FactoryDictionary.js","sourceRoot":"","sources":["../../src/lib/FactoryDictionary.ts"],"names":[],"mappings":";;;;;;AAAA,2BAAuB,cAAc,CAAC,CAAA;AACtC,IAAY,IAAI,WAAM,QAAQ,CAAC,CAAA;AAE/B;IAAqD,qCAAgB;IASjE;;;;;;;;;;;;;;;;;;;;;;;;;;;OA2BG;IACH,2BAAY,sBAA+B,EAAE,aAAkC;QAC3E,kBAAM,aAAa,CAAC,CAAC;QAErB,IAAI,CAAC,sBAAsB,GAAG,sBAAsB,CAAC;IACzD,CAAC;IAGD;;;;;;;;OAQG;IACH,sCAAU,GAAV,UAAW,GAAM,EAAE,YAAe;QAC9B,IAAM,YAAY,GAAM,gBAAK,CAAC,QAAQ,YAAC,GAAG,CAAC,CAAC;QAE5C,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACjC,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;YAEjC,MAAM,CAAC,YAAY,CAAC;QACxB,CAAC;QAED,MAAM,CAAC,YAAY,CAAC;IACxB,CAAC;IAED;;;;;;;;OAQG;IACH,oCAAQ,GAAR,UAAS,GAAM;QACX,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,sBAAsB,EAAE,CAAC,CAAC;IAC/D,CAAC;IACL,wBAAC;AAAD,CAAC,AA7ED,CAAqD,oBAAU,GA6E9D;AA7ED;mCA6EC,CAAA"}
\ No newline at end of file
diff --git a/dist/lib/Heap.d.ts b/dist/lib/Heap.d.ts
deleted file mode 100644
index f2c7632..0000000
--- a/dist/lib/Heap.d.ts
+++ /dev/null
@@ -1,151 +0,0 @@
-import * as collections from './util';
-export default class Heap<T> {
-    /**
-     * Array used to store the elements od the heap.
-     * @type {Array.<Object>}
-     * @private
-     */
-    private data;
-    /**
-     * Function used to compare elements.
-     * @type {function(Object,Object):number}
-     * @private
-     */
-    private compare;
-    /**
-     * Creates an empty Heap.
-     * @class
-     * <p>A heap is a binary tree, where the nodes maintain the heap property:
-     * each node is smaller than each of its children and therefore a MinHeap
-     * This implementation uses an array to store elements.</p>
-     * <p>If the inserted elements are custom objects a compare function must be provided,
-     *  at construction time, otherwise the <=, === and >= operators are
-     * used to compare elements. Example:</p>
-     *
-     * <pre>
-     * function compare(a, b) {
-     *  if (a is less than b by some ordering criterion) {
-     *     return -1;
-     *  } if (a is greater than b by the ordering criterion) {
-     *     return 1;
-     *  }
-     *  // a must be equal to b
-     *  return 0;
-     * }
-     * </pre>
-     *
-     * <p>If a Max-Heap is wanted (greater elements on top) you can a provide a
-     * reverse compare function to accomplish that behavior. Example:</p>
-     *
-     * <pre>
-     * function reverseCompare(a, b) {
-     *  if (a is less than b by some ordering criterion) {
-     *     return 1;
-     *  } if (a is greater than b by the ordering criterion) {
-     *     return -1;
-     *  }
-     *  // a must be equal to b
-     *  return 0;
-     * }
-     * </pre>
-     *
-     * @constructor
-     * @param {function(Object,Object):number=} compareFunction optional
-     * function used to compare two elements. Must return a negative integer,
-     * zero, or a positive integer as the first argument is less than, equal to,
-     * or greater than the second.
-     */
-    constructor(compareFunction?: collections.ICompareFunction<T>);
-    /**
-     * Returns the index of the left child of the node at the given index.
-     * @param {number} nodeIndex The index of the node to get the left child
-     * for.
-     * @return {number} The index of the left child.
-     * @private
-     */
-    private leftChildIndex(nodeIndex);
-    /**
-     * Returns the index of the right child of the node at the given index.
-     * @param {number} nodeIndex The index of the node to get the right child
-     * for.
-     * @return {number} The index of the right child.
-     * @private
-     */
-    private rightChildIndex(nodeIndex);
-    /**
-     * Returns the index of the parent of the node at the given index.
-     * @param {number} nodeIndex The index of the node to get the parent for.
-     * @return {number} The index of the parent.
-     * @private
-     */
-    private parentIndex(nodeIndex);
-    /**
-     * Returns the index of the smaller child node (if it exists).
-     * @param {number} leftChild left child index.
-     * @param {number} rightChild right child index.
-     * @return {number} the index with the minimum value or -1 if it doesn't
-     * exists.
-     * @private
-     */
-    private minIndex(leftChild, rightChild);
-    /**
-     * Moves the node at the given index up to its proper place in the heap.
-     * @param {number} index The index of the node to move up.
-     * @private
-     */
-    private siftUp(index);
-    /**
-     * Moves the node at the given index down to its proper place in the heap.
-     * @param {number} nodeIndex The index of the node to move down.
-     * @private
-     */
-    private siftDown(nodeIndex);
-    /**
-     * Retrieves but does not remove the root element of this heap.
-     * @return {*} The value at the root of the heap. Returns undefined if the
-     * heap is empty.
-     */
-    peek(): T;
-    /**
-     * Adds the given element into the heap.
-     * @param {*} element the element.
-     * @return true if the element was added or fals if it is undefined.
-     */
-    add(element: T): boolean;
-    /**
-     * Retrieves and removes the root element of this heap.
-     * @return {*} The value removed from the root of the heap. Returns
-     * undefined if the heap is empty.
-     */
-    removeRoot(): T;
-    /**
-     * Returns true if this heap contains the specified element.
-     * @param {Object} element element to search for.
-     * @return {boolean} true if this Heap contains the specified element, false
-     * otherwise.
-     */
-    contains(element: T): boolean;
-    /**
-     * Returns the number of elements in this heap.
-     * @return {number} the number of elements in this heap.
-     */
-    size(): number;
-    /**
-     * Checks if this heap is empty.
-     * @return {boolean} true if and only if this heap contains no items; false
-     * otherwise.
-     */
-    isEmpty(): boolean;
-    /**
-     * Removes all of the elements from this heap.
-     */
-    clear(): void;
-    /**
-     * Executes the provided function once for each element present in this heap in
-     * no particular order.
-     * @param {function(Object):*} callback function to execute, it is
-     * invoked with one argument: the element value, to break the iteration you can
-     * optionally return false.
-     */
-    forEach(callback: collections.ILoopFunction<T>): void;
-}
diff --git a/dist/lib/Heap.js b/dist/lib/Heap.js
deleted file mode 100644
index 7202daa..0000000
--- a/dist/lib/Heap.js
+++ /dev/null
@@ -1,227 +0,0 @@
-"use strict";
-var collections = require('./util');
-var arrays = require('./arrays');
-var Heap = (function () {
-    /**
-     * Creates an empty Heap.
-     * @class
-     * <p>A heap is a binary tree, where the nodes maintain the heap property:
-     * each node is smaller than each of its children and therefore a MinHeap
-     * This implementation uses an array to store elements.</p>
-     * <p>If the inserted elements are custom objects a compare function must be provided,
-     *  at construction time, otherwise the <=, === and >= operators are
-     * used to compare elements. Example:</p>
-     *
-     * <pre>
-     * function compare(a, b) {
-     *  if (a is less than b by some ordering criterion) {
-     *     return -1;
-     *  } if (a is greater than b by the ordering criterion) {
-     *     return 1;
-     *  }
-     *  // a must be equal to b
-     *  return 0;
-     * }
-     * </pre>
-     *
-     * <p>If a Max-Heap is wanted (greater elements on top) you can a provide a
-     * reverse compare function to accomplish that behavior. Example:</p>
-     *
-     * <pre>
-     * function reverseCompare(a, b) {
-     *  if (a is less than b by some ordering criterion) {
-     *     return 1;
-     *  } if (a is greater than b by the ordering criterion) {
-     *     return -1;
-     *  }
-     *  // a must be equal to b
-     *  return 0;
-     * }
-     * </pre>
-     *
-     * @constructor
-     * @param {function(Object,Object):number=} compareFunction optional
-     * function used to compare two elements. Must return a negative integer,
-     * zero, or a positive integer as the first argument is less than, equal to,
-     * or greater than the second.
-     */
-    function Heap(compareFunction) {
-        /**
-         * Array used to store the elements od the heap.
-         * @type {Array.<Object>}
-         * @private
-         */
-        this.data = [];
-        this.compare = compareFunction || collections.defaultCompare;
-    }
-    /**
-     * Returns the index of the left child of the node at the given index.
-     * @param {number} nodeIndex The index of the node to get the left child
-     * for.
-     * @return {number} The index of the left child.
-     * @private
-     */
-    Heap.prototype.leftChildIndex = function (nodeIndex) {
-        return (2 * nodeIndex) + 1;
-    };
-    /**
-     * Returns the index of the right child of the node at the given index.
-     * @param {number} nodeIndex The index of the node to get the right child
-     * for.
-     * @return {number} The index of the right child.
-     * @private
-     */
-    Heap.prototype.rightChildIndex = function (nodeIndex) {
-        return (2 * nodeIndex) + 2;
-    };
-    /**
-     * Returns the index of the parent of the node at the given index.
-     * @param {number} nodeIndex The index of the node to get the parent for.
-     * @return {number} The index of the parent.
-     * @private
-     */
-    Heap.prototype.parentIndex = function (nodeIndex) {
-        return Math.floor((nodeIndex - 1) / 2);
-    };
-    /**
-     * Returns the index of the smaller child node (if it exists).
-     * @param {number} leftChild left child index.
-     * @param {number} rightChild right child index.
-     * @return {number} the index with the minimum value or -1 if it doesn't
-     * exists.
-     * @private
-     */
-    Heap.prototype.minIndex = function (leftChild, rightChild) {
-        if (rightChild >= this.data.length) {
-            if (leftChild >= this.data.length) {
-                return -1;
-            }
-            else {
-                return leftChild;
-            }
-        }
-        else {
-            if (this.compare(this.data[leftChild], this.data[rightChild]) <= 0) {
-                return leftChild;
-            }
-            else {
-                return rightChild;
-            }
-        }
-    };
-    /**
-     * Moves the node at the given index up to its proper place in the heap.
-     * @param {number} index The index of the node to move up.
-     * @private
-     */
-    Heap.prototype.siftUp = function (index) {
-        var parent = this.parentIndex(index);
-        while (index > 0 && this.compare(this.data[parent], this.data[index]) > 0) {
-            arrays.swap(this.data, parent, index);
-            index = parent;
-            parent = this.parentIndex(index);
-        }
-    };
-    /**
-     * Moves the node at the given index down to its proper place in the heap.
-     * @param {number} nodeIndex The index of the node to move down.
-     * @private
-     */
-    Heap.prototype.siftDown = function (nodeIndex) {
-        //smaller child index
-        var min = this.minIndex(this.leftChildIndex(nodeIndex), this.rightChildIndex(nodeIndex));
-        while (min >= 0 && this.compare(this.data[nodeIndex], this.data[min]) > 0) {
-            arrays.swap(this.data, min, nodeIndex);
-            nodeIndex = min;
-            min = this.minIndex(this.leftChildIndex(nodeIndex), this.rightChildIndex(nodeIndex));
-        }
-    };
-    /**
-     * Retrieves but does not remove the root element of this heap.
-     * @return {*} The value at the root of the heap. Returns undefined if the
-     * heap is empty.
-     */
-    Heap.prototype.peek = function () {
-        if (this.data.length > 0) {
-            return this.data[0];
-        }
-        else {
-            return undefined;
-        }
-    };
-    /**
-     * Adds the given element into the heap.
-     * @param {*} element the element.
-     * @return true if the element was added or fals if it is undefined.
-     */
-    Heap.prototype.add = function (element) {
-        if (collections.isUndefined(element)) {
-            return undefined;
-        }
-        this.data.push(element);
-        this.siftUp(this.data.length - 1);
-        return true;
-    };
-    /**
-     * Retrieves and removes the root element of this heap.
-     * @return {*} The value removed from the root of the heap. Returns
-     * undefined if the heap is empty.
-     */
-    Heap.prototype.removeRoot = function () {
-        if (this.data.length > 0) {
-            var obj = this.data[0];
-            this.data[0] = this.data[this.data.length - 1];
-            this.data.splice(this.data.length - 1, 1);
-            if (this.data.length > 0) {
-                this.siftDown(0);
-            }
-            return obj;
-        }
-        return undefined;
-    };
-    /**
-     * Returns true if this heap contains the specified element.
-     * @param {Object} element element to search for.
-     * @return {boolean} true if this Heap contains the specified element, false
-     * otherwise.
-     */
-    Heap.prototype.contains = function (element) {
-        var equF = collections.compareToEquals(this.compare);
-        return arrays.contains(this.data, element, equF);
-    };
-    /**
-     * Returns the number of elements in this heap.
-     * @return {number} the number of elements in this heap.
-     */
-    Heap.prototype.size = function () {
-        return this.data.length;
-    };
-    /**
-     * Checks if this heap is empty.
-     * @return {boolean} true if and only if this heap contains no items; false
-     * otherwise.
-     */
-    Heap.prototype.isEmpty = function () {
-        return this.data.length <= 0;
-    };
-    /**
-     * Removes all of the elements from this heap.
-     */
-    Heap.prototype.clear = function () {
-        this.data.length = 0;
-    };
-    /**
-     * Executes the provided function once for each element present in this heap in
-     * no particular order.
-     * @param {function(Object):*} callback function to execute, it is
-     * invoked with one argument: the element value, to break the iteration you can
-     * optionally return false.
-     */
-    Heap.prototype.forEach = function (callback) {
-        arrays.forEach(this.data, callback);
-    };
-    return Heap;
-}());
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.default = Heap;
-//# sourceMappingURL=Heap.js.map
\ No newline at end of file
diff --git a/dist/lib/Heap.js.map b/dist/lib/Heap.js.map
deleted file mode 100644
index 3b155e7..0000000
--- a/dist/lib/Heap.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"Heap.js","sourceRoot":"","sources":["../../src/lib/Heap.ts"],"names":[],"mappings":";AAAA,IAAY,WAAW,WAAM,QAAQ,CAAC,CAAA;AACtC,IAAY,MAAM,WAAM,UAAU,CAAC,CAAA;AAEnC;IAaI;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA0CG;IACH,cAAY,eAAiD;QAvD7D;;;;WAIG;QACK,SAAI,GAAQ,EAAE,CAAC;QAmDnB,IAAI,CAAC,OAAO,GAAG,eAAe,IAAI,WAAW,CAAC,cAAc,CAAC;IACjE,CAAC;IAED;;;;;;OAMG;IACK,6BAAc,GAAtB,UAAuB,SAAiB;QACpC,MAAM,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC;IACD;;;;;;OAMG;IACK,8BAAe,GAAvB,UAAwB,SAAiB;QACrC,MAAM,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC;IACD;;;;;OAKG;IACK,0BAAW,GAAnB,UAAoB,SAAiB;QACjC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC3C,CAAC;IACD;;;;;;;OAOG;IACK,uBAAQ,GAAhB,UAAiB,SAAiB,EAAE,UAAkB;QAElD,EAAE,CAAC,CAAC,UAAU,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;YACjC,EAAE,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;gBAChC,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,CAAC;YAAC,IAAI,CAAC,CAAC;gBACJ,MAAM,CAAC,SAAS,CAAC;YACrB,CAAC;QACL,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACjE,MAAM,CAAC,SAAS,CAAC;YACrB,CAAC;YAAC,IAAI,CAAC,CAAC;gBACJ,MAAM,CAAC,UAAU,CAAC;YACtB,CAAC;QACL,CAAC;IACL,CAAC;IACD;;;;OAIG;IACK,qBAAM,GAAd,UAAe,KAAa;QAExB,IAAI,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QACrC,OAAO,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;YACxE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;YACtC,KAAK,GAAG,MAAM,CAAC;YACf,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QACrC,CAAC;IACL,CAAC;IACD;;;;OAIG;IACK,uBAAQ,GAAhB,UAAiB,SAAiB;QAE9B,qBAAqB;QACrB,IAAI,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,EAClD,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,CAAC;QAErC,OAAO,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,EAChD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;YACvC,SAAS,GAAG,GAAG,CAAC;YAChB,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,EAC9C,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,CAAC;QACzC,CAAC;IACL,CAAC;IACD;;;;OAIG;IACH,mBAAI,GAAJ;QAEI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,MAAM,CAAC,SAAS,CAAC;QACrB,CAAC;IACL,CAAC;IACD;;;;OAIG;IACH,kBAAG,GAAH,UAAI,OAAU;QACV,EAAE,CAAC,CAAC,WAAW,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,CAAC,SAAS,CAAC;QACrB,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACxB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAClC,MAAM,CAAC,IAAI,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACH,yBAAU,GAAV;QAEI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;YACvB,IAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC/C,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;gBACvB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACrB,CAAC;YACD,MAAM,CAAC,GAAG,CAAC;QACf,CAAC;QACD,MAAM,CAAC,SAAS,CAAC;IACrB,CAAC;IACD;;;;;OAKG;IACH,uBAAQ,GAAR,UAAS,OAAU;QACf,IAAM,IAAI,GAAG,WAAW,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACvD,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;IACrD,CAAC;IACD;;;OAGG;IACH,mBAAI,GAAJ;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAC5B,CAAC;IACD;;;;OAIG;IACH,sBAAO,GAAP;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;IACjC,CAAC;IACD;;OAEG;IACH,oBAAK,GAAL;QACI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IACzB,CAAC;IAED;;;;;;OAMG;IACH,sBAAO,GAAP,UAAQ,QAAsC;QAC1C,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IACxC,CAAC;IACL,WAAC;AAAD,CAAC,AAzOD,IAyOC;AAzOD;sBAyOC,CAAA"}
\ No newline at end of file
diff --git a/dist/lib/LinkedDictionary.d.ts b/dist/lib/LinkedDictionary.d.ts
deleted file mode 100644
index 299a571..0000000
--- a/dist/lib/LinkedDictionary.d.ts
+++ /dev/null
@@ -1,81 +0,0 @@
-import { default as Dictionary } from './Dictionary';
-export default class LinkedDictionary<K, V> extends Dictionary<K, V> {
-    private head;
-    private tail;
-    constructor(toStrFunction?: (key: K) => string);
-    /**
-     * Inserts the new node to the 'tail' of the list, updating the
-     * neighbors, and moving 'this.tail' (the End of List indicator) that
-     * to the end.
-     */
-    private appendToTail(entry);
-    /**
-     * Retrieves a linked dictionary from the table internally
-     */
-    private getLinkedDictionaryPair(key);
-    /**
-     * Returns the value to which this dictionary maps the specified key.
-     * Returns undefined if this dictionary contains no mapping for this key.
-     * @param {Object} key key whose associated value is to be returned.
-     * @return {*} the value to which this dictionary maps the specified key or
-     * undefined if the map contains no mapping for this key.
-     */
-    getValue(key: K): V;
-    /**
-     * Removes the mapping for this key from this dictionary if it is present.
-     * Also, if a value is present for this key, the entry is removed from the
-     * insertion ordering.
-     * @param {Object} key key whose mapping is to be removed from the
-     * dictionary.
-     * @return {*} previous value associated with specified key, or undefined if
-     * there was no mapping for key.
-     */
-    remove(key: K): V;
-    /**
-    * Removes all mappings from this LinkedDictionary.
-    * @this {collections.LinkedDictionary}
-    */
-    clear(): void;
-    /**
-     * Internal function used when updating an existing KeyValue pair.
-     * It places the new value indexed by key into the table, but maintains
-     * its place in the linked ordering.
-     */
-    private replace(oldPair, newPair);
-    /**
-     * Associates the specified value with the specified key in this dictionary.
-     * If the dictionary previously contained a mapping for this key, the old
-     * value is replaced by the specified value.
-     * Updating of a key that already exists maintains its place in the
-     * insertion order into the map.
-     * @param {Object} key key with which the specified value is to be
-     * associated.
-     * @param {Object} value value to be associated with the specified key.
-     * @return {*} previous value associated with the specified key, or undefined if
-     * there was no mapping for the key or if the key/value are undefined.
-     */
-    setValue(key: K, value: V): V;
-    /**
-     * Returns an array containing all of the keys in this LinkedDictionary, ordered
-     * by insertion order.
-     * @return {Array} an array containing all of the keys in this LinkedDictionary,
-     * ordered by insertion order.
-     */
-    keys(): K[];
-    /**
-     * Returns an array containing all of the values in this LinkedDictionary, ordered by
-     * insertion order.
-     * @return {Array} an array containing all of the values in this LinkedDictionary,
-     * ordered by insertion order.
-     */
-    values(): V[];
-    /**
-    * Executes the provided function once for each key-value pair
-    * present in this LinkedDictionary. It is done in the order of insertion
-    * into the LinkedDictionary
-    * @param {function(Object,Object):*} callback function to execute, it is
-    * invoked with two arguments: key and value. To break the iteration you can
-    * optionally return false.
-    */
-    forEach(callback: (key: K, value: V) => any): void;
-}
diff --git a/dist/lib/LinkedDictionary.js b/dist/lib/LinkedDictionary.js
deleted file mode 100644
index 29efb5b..0000000
--- a/dist/lib/LinkedDictionary.js
+++ /dev/null
@@ -1,218 +0,0 @@
-"use strict";
-var __extends = (this && this.__extends) || function (d, b) {
-    for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p];
-    function __() { this.constructor = d; }
-    d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
-};
-var Dictionary_1 = require('./Dictionary');
-var util = require('./util');
-/**
- * This class is used by the LinkedDictionary Internally
- * Has to be a class, not an interface, because it needs to have
- * the 'unlink' function defined.
- */
-var LinkedDictionaryPair = (function () {
-    function LinkedDictionaryPair(key, value) {
-        this.key = key;
-        this.value = value;
-    }
-    LinkedDictionaryPair.prototype.unlink = function () {
-        this.prev.next = this.next;
-        this.next.prev = this.prev;
-    };
-    return LinkedDictionaryPair;
-}());
-var LinkedDictionary = (function (_super) {
-    __extends(LinkedDictionary, _super);
-    function LinkedDictionary(toStrFunction) {
-        _super.call(this, toStrFunction);
-        this.head = new LinkedDictionaryPair(null, null);
-        this.tail = new LinkedDictionaryPair(null, null);
-        this.head.next = this.tail;
-        this.tail.prev = this.head;
-    }
-    /**
-     * Inserts the new node to the 'tail' of the list, updating the
-     * neighbors, and moving 'this.tail' (the End of List indicator) that
-     * to the end.
-     */
-    LinkedDictionary.prototype.appendToTail = function (entry) {
-        var lastNode = this.tail.prev;
-        lastNode.next = entry;
-        entry.prev = lastNode;
-        entry.next = this.tail;
-        this.tail.prev = entry;
-    };
-    /**
-     * Retrieves a linked dictionary from the table internally
-     */
-    LinkedDictionary.prototype.getLinkedDictionaryPair = function (key) {
-        if (util.isUndefined(key)) {
-            return undefined;
-        }
-        var k = '$' + this.toStr(key);
-        var pair = (this.table[k]);
-        return pair;
-    };
-    /**
-     * Returns the value to which this dictionary maps the specified key.
-     * Returns undefined if this dictionary contains no mapping for this key.
-     * @param {Object} key key whose associated value is to be returned.
-     * @return {*} the value to which this dictionary maps the specified key or
-     * undefined if the map contains no mapping for this key.
-     */
-    LinkedDictionary.prototype.getValue = function (key) {
-        var pair = this.getLinkedDictionaryPair(key);
-        if (!util.isUndefined(pair)) {
-            return pair.value;
-        }
-        return undefined;
-    };
-    /**
-     * Removes the mapping for this key from this dictionary if it is present.
-     * Also, if a value is present for this key, the entry is removed from the
-     * insertion ordering.
-     * @param {Object} key key whose mapping is to be removed from the
-     * dictionary.
-     * @return {*} previous value associated with specified key, or undefined if
-     * there was no mapping for key.
-     */
-    LinkedDictionary.prototype.remove = function (key) {
-        var pair = this.getLinkedDictionaryPair(key);
-        if (!util.isUndefined(pair)) {
-            _super.prototype.remove.call(this, key); // This will remove it from the table
-            pair.unlink(); // This will unlink it from the chain
-            return pair.value;
-        }
-        return undefined;
-    };
-    /**
-    * Removes all mappings from this LinkedDictionary.
-    * @this {collections.LinkedDictionary}
-    */
-    LinkedDictionary.prototype.clear = function () {
-        _super.prototype.clear.call(this);
-        this.head.next = this.tail;
-        this.tail.prev = this.head;
-    };
-    /**
-     * Internal function used when updating an existing KeyValue pair.
-     * It places the new value indexed by key into the table, but maintains
-     * its place in the linked ordering.
-     */
-    LinkedDictionary.prototype.replace = function (oldPair, newPair) {
-        var k = '$' + this.toStr(newPair.key);
-        // set the new Pair's links to existingPair's links
-        newPair.next = oldPair.next;
-        newPair.prev = oldPair.prev;
-        // Delete Existing Pair from the table, unlink it from chain.
-        // As a result, the nElements gets decremented by this operation
-        this.remove(oldPair.key);
-        // Link new Pair in place of where oldPair was,
-        // by pointing the old pair's neighbors to it.
-        newPair.prev.next = newPair;
-        newPair.next.prev = newPair;
-        this.table[k] = newPair;
-        // To make up for the fact that the number of elements was decremented,
-        // We need to increase it by one.
-        ++this.nElements;
-    };
-    /**
-     * Associates the specified value with the specified key in this dictionary.
-     * If the dictionary previously contained a mapping for this key, the old
-     * value is replaced by the specified value.
-     * Updating of a key that already exists maintains its place in the
-     * insertion order into the map.
-     * @param {Object} key key with which the specified value is to be
-     * associated.
-     * @param {Object} value value to be associated with the specified key.
-     * @return {*} previous value associated with the specified key, or undefined if
-     * there was no mapping for the key or if the key/value are undefined.
-     */
-    LinkedDictionary.prototype.setValue = function (key, value) {
-        if (util.isUndefined(key) || util.isUndefined(value)) {
-            return undefined;
-        }
-        var existingPair = this.getLinkedDictionaryPair(key);
-        var newPair = new LinkedDictionaryPair(key, value);
-        var k = '$' + this.toStr(key);
-        // If there is already an element for that key, we
-        // keep it's place in the LinkedList
-        if (!util.isUndefined(existingPair)) {
-            this.replace(existingPair, newPair);
-            return existingPair.value;
-        }
-        else {
-            this.appendToTail(newPair);
-            this.table[k] = newPair;
-            ++this.nElements;
-            return undefined;
-        }
-    };
-    /**
-     * Returns an array containing all of the keys in this LinkedDictionary, ordered
-     * by insertion order.
-     * @return {Array} an array containing all of the keys in this LinkedDictionary,
-     * ordered by insertion order.
-     */
-    LinkedDictionary.prototype.keys = function () {
-        var array = [];
-        this.forEach(function (key, value) {
-            array.push(key);
-        });
-        return array;
-    };
-    /**
-     * Returns an array containing all of the values in this LinkedDictionary, ordered by
-     * insertion order.
-     * @return {Array} an array containing all of the values in this LinkedDictionary,
-     * ordered by insertion order.
-     */
-    LinkedDictionary.prototype.values = function () {
-        var array = [];
-        this.forEach(function (key, value) {
-            array.push(value);
-        });
-        return array;
-    };
-    /**
-    * Executes the provided function once for each key-value pair
-    * present in this LinkedDictionary. It is done in the order of insertion
-    * into the LinkedDictionary
-    * @param {function(Object,Object):*} callback function to execute, it is
-    * invoked with two arguments: key and value. To break the iteration you can
-    * optionally return false.
-    */
-    LinkedDictionary.prototype.forEach = function (callback) {
-        var crawlNode = this.head.next;
-        while (crawlNode.next != null) {
-            var ret = callback(crawlNode.key, crawlNode.value);
-            if (ret === false) {
-                return;
-            }
-            crawlNode = crawlNode.next;
-        }
-    };
-    return LinkedDictionary;
-}(Dictionary_1.default));
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.default = LinkedDictionary; // End of LinkedDictionary
-// /**
-//  * Returns true if this dictionary is equal to the given dictionary.
-//  * Two dictionaries are equal if they contain the same mappings.
-//  * @param {collections.Dictionary} other the other dictionary.
-//  * @param {function(Object,Object):boolean=} valuesEqualFunction optional
-//  * function used to check if two values are equal.
-//  * @return {boolean} true if this dictionary is equal to the given dictionary.
-//  */
-// collections.Dictionary.prototype.equals = function(other,valuesEqualFunction) {
-// 	const eqF = valuesEqualFunction || collections.defaultEquals;
-// 	if(!(other instanceof collections.Dictionary)){
-// 		return false;
-// 	}
-// 	if(this.size() !== other.size()){
-// 		return false;
-// 	}
-// 	return this.equalsAux(this.firstNode,other.firstNode,eqF);
-// }
-//# sourceMappingURL=LinkedDictionary.js.map
\ No newline at end of file
diff --git a/dist/lib/LinkedDictionary.js.map b/dist/lib/LinkedDictionary.js.map
deleted file mode 100644
index 004af19..0000000
--- a/dist/lib/LinkedDictionary.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"LinkedDictionary.js","sourceRoot":"","sources":["../../src/lib/LinkedDictionary.ts"],"names":[],"mappings":";;;;;;AAAA,2BAAqD,cAAc,CAAC,CAAA;AAEpE,IAAY,IAAI,WAAM,QAAQ,CAAC,CAAA;AAE/B;;;;GAIG;AACH;IAII,8BAAmB,GAAM,EAAS,KAAQ;QAAvB,QAAG,GAAH,GAAG,CAAG;QAAS,UAAK,GAAL,KAAK,CAAG;IAAI,CAAC;IAE/C,qCAAM,GAAN;QACI,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAC3B,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IAC/B,CAAC;IACL,2BAAC;AAAD,CAAC,AAVD,IAUC;AAED;IAAoD,oCAAgB;IAIhE,0BAAY,aAAkC;QAC1C,kBAAM,aAAa,CAAC,CAAC;QACrB,IAAI,CAAC,IAAI,GAAG,IAAI,oBAAoB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACjD,IAAI,CAAC,IAAI,GAAG,IAAI,oBAAoB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACjD,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAC3B,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IAC/B,CAAC;IAED;;;;OAIG;IACK,uCAAY,GAApB,UAAqB,KAAiC;QAClD,IAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;QAChC,QAAQ,CAAC,IAAI,GAAG,KAAK,CAAC;QACtB,KAAK,CAAC,IAAI,GAAG,QAAQ,CAAC;QACtB,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;IAC3B,CAAC;IAED;;OAEG;IACK,kDAAuB,GAA/B,UAAgC,GAAM;QAClC,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACxB,MAAM,CAAC,SAAS,CAAC;QACrB,CAAC;QACD,IAAM,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAChC,IAAM,IAAI,GAA+B,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,MAAM,CAAC,IAAI,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACH,mCAAQ,GAAR,UAAS,GAAM;QACX,IAAM,IAAI,GAAG,IAAI,CAAC,uBAAuB,CAAC,GAAG,CAAC,CAAC;QAC/C,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;QACtB,CAAC;QACD,MAAM,CAAC,SAAS,CAAC;IACrB,CAAC;IAED;;;;;;;;OAQG;IACH,iCAAM,GAAN,UAAO,GAAM;QACT,IAAM,IAAI,GAAG,IAAI,CAAC,uBAAuB,CAAC,GAAG,CAAC,CAAC;QAC/C,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC1B,gBAAK,CAAC,MAAM,YAAC,GAAG,CAAC,CAAC,CAAC,qCAAqC;YACxD,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,qCAAqC;YACpD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;QACtB,CAAC;QACD,MAAM,CAAC,SAAS,CAAC;IACrB,CAAC;IAED;;;MAGE;IACF,gCAAK,GAAL;QACI,gBAAK,CAAC,KAAK,WAAE,CAAC;QACd,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAC3B,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IAC/B,CAAC;IAED;;;;OAIG;IACK,kCAAO,GAAf,UAAgB,OAAmC,EAAE,OAAmC;QACpF,IAAM,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAExC,mDAAmD;QACnD,OAAO,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;QAC5B,OAAO,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;QAE5B,6DAA6D;QAC7D,gEAAgE;QAChE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAEzB,+CAA+C;QAC/C,8CAA8C;QAC9C,OAAO,CAAC,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;QAC5B,OAAO,CAAC,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;QAE5B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;QAExB,uEAAuE;QACvE,iCAAiC;QACjC,EAAE,IAAI,CAAC,SAAS,CAAC;IAErB,CAAC;IAED;;;;;;;;;;;OAWG;IACH,mCAAQ,GAAR,UAAS,GAAM,EAAE,KAAQ;QAErB,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACnD,MAAM,CAAC,SAAS,CAAC;QACrB,CAAC;QAED,IAAM,YAAY,GAAG,IAAI,CAAC,uBAAuB,CAAC,GAAG,CAAC,CAAC;QACvD,IAAM,OAAO,GAAG,IAAI,oBAAoB,CAAO,GAAG,EAAE,KAAK,CAAC,CAAC;QAE3D,IAAM,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAEhC,kDAAkD;QAClD,oCAAoC;QACpC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;YAEpC,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC;QAC9B,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;YAC3B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;YACxB,EAAE,IAAI,CAAC,SAAS,CAAC;YAEjB,MAAM,CAAC,SAAS,CAAC;QACrB,CAAC;IAEL,CAAC;IAED;;;;;OAKG;IACH,+BAAI,GAAJ;QACI,IAAM,KAAK,GAAQ,EAAE,CAAC;QACtB,IAAI,CAAC,OAAO,CAAC,UAAC,GAAG,EAAE,KAAK;YACpB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED;;;;;OAKG;IACH,iCAAM,GAAN;QACI,IAAM,KAAK,GAAQ,EAAE,CAAC;QACtB,IAAI,CAAC,OAAO,CAAC,UAAC,GAAG,EAAE,KAAK;YACpB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtB,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED;;;;;;;MAOE;IACF,kCAAO,GAAP,UAAQ,QAAmC;QACvC,IAAI,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;QAC/B,OAAO,SAAS,CAAC,IAAI,IAAI,IAAI,EAAE,CAAC;YAC5B,IAAM,GAAG,GAAG,QAAQ,CAAC,SAAS,CAAC,GAAG,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC;YACrD,EAAE,CAAC,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC;gBAChB,MAAM,CAAC;YACX,CAAC;YACD,SAAS,GAAG,SAAS,CAAC,IAAI,CAAC;QAC/B,CAAC;IACL,CAAC;IAEL,uBAAC;AAAD,CAAC,AApMD,CAAoD,oBAAU,GAoM7D;AApMD;kCAoMC,CAAA,CAAC,0BAA0B;AAC5B,MAAM;AACN,uEAAuE;AACvE,mEAAmE;AACnE,iEAAiE;AACjE,4EAA4E;AAC5E,qDAAqD;AACrD,iFAAiF;AACjF,MAAM;AACN,kFAAkF;AAClF,iEAAiE;AACjE,mDAAmD;AACnD,kBAAkB;AAClB,KAAK;AACL,qCAAqC;AACrC,kBAAkB;AAClB,KAAK;AACL,8DAA8D;AAC9D,IAAI"}
\ No newline at end of file
diff --git a/dist/lib/LinkedList.d.ts b/dist/lib/LinkedList.d.ts
deleted file mode 100644
index 6888940..0000000
--- a/dist/lib/LinkedList.d.ts
+++ /dev/null
@@ -1,179 +0,0 @@
-import * as util from './util';
-export interface ILinkedListNode<T> {
-    element: T;
-    next: ILinkedListNode<T>;
-}
-export default class LinkedList<T> {
-    /**
-    * First node in the list
-    * @type {Object}
-    * @private
-    */
-    firstNode: ILinkedListNode<T>;
-    /**
-    * Last node in the list
-    * @type {Object}
-    * @private
-    */
-    private lastNode;
-    /**
-    * Number of elements in the list
-    * @type {number}
-    * @private
-    */
-    private nElements;
-    /**
-    * Creates an empty Linked List.
-    * @class A linked list is a data structure consisting of a group of nodes
-    * which together represent a sequence.
-    * @constructor
-    */
-    constructor();
-    /**
-    * Adds an element to this list.
-    * @param {Object} item element to be added.
-    * @param {number=} index optional index to add the element. If no index is specified
-    * the element is added to the end of this list.
-    * @return {boolean} true if the element was added or false if the index is invalid
-    * or if the element is undefined.
-    */
-    add(item: T, index?: number): boolean;
-    /**
-    * Returns the first element in this list.
-    * @return {*} the first element of the list or undefined if the list is
-    * empty.
-    */
-    first(): T;
-    /**
-    * Returns the last element in this list.
-    * @return {*} the last element in the list or undefined if the list is
-    * empty.
-    */
-    last(): T;
-    /**
-     * Returns the element at the specified position in this list.
-     * @param {number} index desired index.
-     * @return {*} the element at the given index or undefined if the index is
-     * out of bounds.
-     */
-    elementAtIndex(index: number): T;
-    /**
-     * Returns the index in this list of the first occurrence of the
-     * specified element, or -1 if the List does not contain this element.
-     * <p>If the elements inside this list are
-     * not comparable with the === operator a custom equals function should be
-     * provided to perform searches, the function must receive two arguments and
-     * return true if they are equal, false otherwise. Example:</p>
-     *
-     * <pre>
-     * const petsAreEqualByName = function(pet1, pet2) {
-     *  return pet1.name === pet2.name;
-     * }
-     * </pre>
-     * @param {Object} item element to search for.
-     * @param {function(Object,Object):boolean=} equalsFunction Optional
-     * function used to check if two elements are equal.
-     * @return {number} the index in this list of the first occurrence
-     * of the specified element, or -1 if this list does not contain the
-     * element.
-     */
-    indexOf(item: T, equalsFunction?: util.IEqualsFunction<T>): number;
-    /**
-       * Returns true if this list contains the specified element.
-       * <p>If the elements inside the list are
-       * not comparable with the === operator a custom equals function should be
-       * provided to perform searches, the function must receive two arguments and
-       * return true if they are equal, false otherwise. Example:</p>
-       *
-       * <pre>
-       * const petsAreEqualByName = function(pet1, pet2) {
-       *  return pet1.name === pet2.name;
-       * }
-       * </pre>
-       * @param {Object} item element to search for.
-       * @param {function(Object,Object):boolean=} equalsFunction Optional
-       * function used to check if two elements are equal.
-       * @return {boolean} true if this list contains the specified element, false
-       * otherwise.
-       */
-    contains(item: T, equalsFunction?: util.IEqualsFunction<T>): boolean;
-    /**
-     * Removes the first occurrence of the specified element in this list.
-     * <p>If the elements inside the list are
-     * not comparable with the === operator a custom equals function should be
-     * provided to perform searches, the function must receive two arguments and
-     * return true if they are equal, false otherwise. Example:</p>
-     *
-     * <pre>
-     * const petsAreEqualByName = function(pet1, pet2) {
-     *  return pet1.name === pet2.name;
-     * }
-     * </pre>
-     * @param {Object} item element to be removed from this list, if present.
-     * @return {boolean} true if the list contained the specified element.
-     */
-    remove(item: T, equalsFunction?: util.IEqualsFunction<T>): boolean;
-    /**
-     * Removes all of the elements from this list.
-     */
-    clear(): void;
-    /**
-     * Returns true if this list is equal to the given list.
-     * Two lists are equal if they have the same elements in the same order.
-     * @param {LinkedList} other the other list.
-     * @param {function(Object,Object):boolean=} equalsFunction optional
-     * function used to check if two elements are equal. If the elements in the lists
-     * are custom objects you should provide a function, otherwise
-     * the === operator is used to check equality between elements.
-     * @return {boolean} true if this list is equal to the given list.
-     */
-    equals(other: LinkedList<T>, equalsFunction?: util.IEqualsFunction<T>): boolean;
-    /**
-    * @private
-    */
-    private equalsAux(n1, n2, eqF);
-    /**
-     * Removes the element at the specified position in this list.
-     * @param {number} index given index.
-     * @return {*} removed element or undefined if the index is out of bounds.
-     */
-    removeElementAtIndex(index: number): T;
-    /**
-     * Executes the provided function once for each element present in this list in order.
-     * @param {function(Object):*} callback function to execute, it is
-     * invoked with one argument: the element value, to break the iteration you can
-     * optionally return false.
-     */
-    forEach(callback: util.ILoopFunction<T>): void;
-    /**
-     * Reverses the order of the elements in this linked list (makes the last
-     * element first, and the first element last).
-     */
-    reverse(): void;
-    /**
-     * Returns an array containing all of the elements in this list in proper
-     * sequence.
-     * @return {Array.<*>} an array containing all of the elements in this list,
-     * in proper sequence.
-     */
-    toArray(): T[];
-    /**
-     * Returns the number of elements in this list.
-     * @return {number} the number of elements in this list.
-     */
-    size(): number;
-    /**
-     * Returns true if this list contains no elements.
-     * @return {boolean} true if this list contains no elements.
-     */
-    isEmpty(): boolean;
-    toString(): string;
-    /**
-     * @private
-     */
-    private nodeAtIndex(index);
-    /**
-     * @private
-     */
-    private createNode(item);
-}
diff --git a/dist/lib/LinkedList.js b/dist/lib/LinkedList.js
deleted file mode 100644
index 27923df..0000000
--- a/dist/lib/LinkedList.js
+++ /dev/null
@@ -1,378 +0,0 @@
-"use strict";
-var util = require('./util');
-var arrays = require('./arrays');
-var LinkedList = (function () {
-    /**
-    * Creates an empty Linked List.
-    * @class A linked list is a data structure consisting of a group of nodes
-    * which together represent a sequence.
-    * @constructor
-    */
-    function LinkedList() {
-        /**
-        * First node in the list
-        * @type {Object}
-        * @private
-        */
-        this.firstNode = null;
-        /**
-        * Last node in the list
-        * @type {Object}
-        * @private
-        */
-        this.lastNode = null;
-        /**
-        * Number of elements in the list
-        * @type {number}
-        * @private
-        */
-        this.nElements = 0;
-    }
-    /**
-    * Adds an element to this list.
-    * @param {Object} item element to be added.
-    * @param {number=} index optional index to add the element. If no index is specified
-    * the element is added to the end of this list.
-    * @return {boolean} true if the element was added or false if the index is invalid
-    * or if the element is undefined.
-    */
-    LinkedList.prototype.add = function (item, index) {
-        if (util.isUndefined(index)) {
-            index = this.nElements;
-        }
-        if (index < 0 || index > this.nElements || util.isUndefined(item)) {
-            return false;
-        }
-        var newNode = this.createNode(item);
-        if (this.nElements === 0) {
-            // First node in the list.
-            this.firstNode = newNode;
-            this.lastNode = newNode;
-        }
-        else if (index === this.nElements) {
-            // Insert at the end.
-            this.lastNode.next = newNode;
-            this.lastNode = newNode;
-        }
-        else if (index === 0) {
-            // Change first node.
-            newNode.next = this.firstNode;
-            this.firstNode = newNode;
-        }
-        else {
-            var prev = this.nodeAtIndex(index - 1);
-            newNode.next = prev.next;
-            prev.next = newNode;
-        }
-        this.nElements++;
-        return true;
-    };
-    /**
-    * Returns the first element in this list.
-    * @return {*} the first element of the list or undefined if the list is
-    * empty.
-    */
-    LinkedList.prototype.first = function () {
-        if (this.firstNode !== null) {
-            return this.firstNode.element;
-        }
-        return undefined;
-    };
-    /**
-    * Returns the last element in this list.
-    * @return {*} the last element in the list or undefined if the list is
-    * empty.
-    */
-    LinkedList.prototype.last = function () {
-        if (this.lastNode !== null) {
-            return this.lastNode.element;
-        }
-        return undefined;
-    };
-    /**
-     * Returns the element at the specified position in this list.
-     * @param {number} index desired index.
-     * @return {*} the element at the given index or undefined if the index is
-     * out of bounds.
-     */
-    LinkedList.prototype.elementAtIndex = function (index) {
-        var node = this.nodeAtIndex(index);
-        if (node === null) {
-            return undefined;
-        }
-        return node.element;
-    };
-    /**
-     * Returns the index in this list of the first occurrence of the
-     * specified element, or -1 if the List does not contain this element.
-     * <p>If the elements inside this list are
-     * not comparable with the === operator a custom equals function should be
-     * provided to perform searches, the function must receive two arguments and
-     * return true if they are equal, false otherwise. Example:</p>
-     *
-     * <pre>
-     * const petsAreEqualByName = function(pet1, pet2) {
-     *  return pet1.name === pet2.name;
-     * }
-     * </pre>
-     * @param {Object} item element to search for.
-     * @param {function(Object,Object):boolean=} equalsFunction Optional
-     * function used to check if two elements are equal.
-     * @return {number} the index in this list of the first occurrence
-     * of the specified element, or -1 if this list does not contain the
-     * element.
-     */
-    LinkedList.prototype.indexOf = function (item, equalsFunction) {
-        var equalsF = equalsFunction || util.defaultEquals;
-        if (util.isUndefined(item)) {
-            return -1;
-        }
-        var currentNode = this.firstNode;
-        var index = 0;
-        while (currentNode !== null) {
-            if (equalsF(currentNode.element, item)) {
-                return index;
-            }
-            index++;
-            currentNode = currentNode.next;
-        }
-        return -1;
-    };
-    /**
-       * Returns true if this list contains the specified element.
-       * <p>If the elements inside the list are
-       * not comparable with the === operator a custom equals function should be
-       * provided to perform searches, the function must receive two arguments and
-       * return true if they are equal, false otherwise. Example:</p>
-       *
-       * <pre>
-       * const petsAreEqualByName = function(pet1, pet2) {
-       *  return pet1.name === pet2.name;
-       * }
-       * </pre>
-       * @param {Object} item element to search for.
-       * @param {function(Object,Object):boolean=} equalsFunction Optional
-       * function used to check if two elements are equal.
-       * @return {boolean} true if this list contains the specified element, false
-       * otherwise.
-       */
-    LinkedList.prototype.contains = function (item, equalsFunction) {
-        return (this.indexOf(item, equalsFunction) >= 0);
-    };
-    /**
-     * Removes the first occurrence of the specified element in this list.
-     * <p>If the elements inside the list are
-     * not comparable with the === operator a custom equals function should be
-     * provided to perform searches, the function must receive two arguments and
-     * return true if they are equal, false otherwise. Example:</p>
-     *
-     * <pre>
-     * const petsAreEqualByName = function(pet1, pet2) {
-     *  return pet1.name === pet2.name;
-     * }
-     * </pre>
-     * @param {Object} item element to be removed from this list, if present.
-     * @return {boolean} true if the list contained the specified element.
-     */
-    LinkedList.prototype.remove = function (item, equalsFunction) {
-        var equalsF = equalsFunction || util.defaultEquals;
-        if (this.nElements < 1 || util.isUndefined(item)) {
-            return false;
-        }
-        var previous = null;
-        var currentNode = this.firstNode;
-        while (currentNode !== null) {
-            if (equalsF(currentNode.element, item)) {
-                if (currentNode === this.firstNode) {
-                    this.firstNode = this.firstNode.next;
-                    if (currentNode === this.lastNode) {
-                        this.lastNode = null;
-                    }
-                }
-                else if (currentNode === this.lastNode) {
-                    this.lastNode = previous;
-                    previous.next = currentNode.next;
-                    currentNode.next = null;
-                }
-                else {
-                    previous.next = currentNode.next;
-                    currentNode.next = null;
-                }
-                this.nElements--;
-                return true;
-            }
-            previous = currentNode;
-            currentNode = currentNode.next;
-        }
-        return false;
-    };
-    /**
-     * Removes all of the elements from this list.
-     */
-    LinkedList.prototype.clear = function () {
-        this.firstNode = null;
-        this.lastNode = null;
-        this.nElements = 0;
-    };
-    /**
-     * Returns true if this list is equal to the given list.
-     * Two lists are equal if they have the same elements in the same order.
-     * @param {LinkedList} other the other list.
-     * @param {function(Object,Object):boolean=} equalsFunction optional
-     * function used to check if two elements are equal. If the elements in the lists
-     * are custom objects you should provide a function, otherwise
-     * the === operator is used to check equality between elements.
-     * @return {boolean} true if this list is equal to the given list.
-     */
-    LinkedList.prototype.equals = function (other, equalsFunction) {
-        var eqF = equalsFunction || util.defaultEquals;
-        if (!(other instanceof LinkedList)) {
-            return false;
-        }
-        if (this.size() !== other.size()) {
-            return false;
-        }
-        return this.equalsAux(this.firstNode, other.firstNode, eqF);
-    };
-    /**
-    * @private
-    */
-    LinkedList.prototype.equalsAux = function (n1, n2, eqF) {
-        while (n1 !== null) {
-            if (!eqF(n1.element, n2.element)) {
-                return false;
-            }
-            n1 = n1.next;
-            n2 = n2.next;
-        }
-        return true;
-    };
-    /**
-     * Removes the element at the specified position in this list.
-     * @param {number} index given index.
-     * @return {*} removed element or undefined if the index is out of bounds.
-     */
-    LinkedList.prototype.removeElementAtIndex = function (index) {
-        if (index < 0 || index >= this.nElements) {
-            return undefined;
-        }
-        var element;
-        if (this.nElements === 1) {
-            //First node in the list.
-            element = this.firstNode.element;
-            this.firstNode = null;
-            this.lastNode = null;
-        }
-        else {
-            var previous = this.nodeAtIndex(index - 1);
-            if (previous === null) {
-                element = this.firstNode.element;
-                this.firstNode = this.firstNode.next;
-            }
-            else if (previous.next === this.lastNode) {
-                element = this.lastNode.element;
-                this.lastNode = previous;
-            }
-            if (previous !== null) {
-                element = previous.next.element;
-                previous.next = previous.next.next;
-            }
-        }
-        this.nElements--;
-        return element;
-    };
-    /**
-     * Executes the provided function once for each element present in this list in order.
-     * @param {function(Object):*} callback function to execute, it is
-     * invoked with one argument: the element value, to break the iteration you can
-     * optionally return false.
-     */
-    LinkedList.prototype.forEach = function (callback) {
-        var currentNode = this.firstNode;
-        while (currentNode !== null) {
-            if (callback(currentNode.element) === false) {
-                break;
-            }
-            currentNode = currentNode.next;
-        }
-    };
-    /**
-     * Reverses the order of the elements in this linked list (makes the last
-     * element first, and the first element last).
-     */
-    LinkedList.prototype.reverse = function () {
-        var previous = null;
-        var current = this.firstNode;
-        var temp = null;
-        while (current !== null) {
-            temp = current.next;
-            current.next = previous;
-            previous = current;
-            current = temp;
-        }
-        temp = this.firstNode;
-        this.firstNode = this.lastNode;
-        this.lastNode = temp;
-    };
-    /**
-     * Returns an array containing all of the elements in this list in proper
-     * sequence.
-     * @return {Array.<*>} an array containing all of the elements in this list,
-     * in proper sequence.
-     */
-    LinkedList.prototype.toArray = function () {
-        var array = [];
-        var currentNode = this.firstNode;
-        while (currentNode !== null) {
-            array.push(currentNode.element);
-            currentNode = currentNode.next;
-        }
-        return array;
-    };
-    /**
-     * Returns the number of elements in this list.
-     * @return {number} the number of elements in this list.
-     */
-    LinkedList.prototype.size = function () {
-        return this.nElements;
-    };
-    /**
-     * Returns true if this list contains no elements.
-     * @return {boolean} true if this list contains no elements.
-     */
-    LinkedList.prototype.isEmpty = function () {
-        return this.nElements <= 0;
-    };
-    LinkedList.prototype.toString = function () {
-        return arrays.toString(this.toArray());
-    };
-    /**
-     * @private
-     */
-    LinkedList.prototype.nodeAtIndex = function (index) {
-        if (index < 0 || index >= this.nElements) {
-            return null;
-        }
-        if (index === (this.nElements - 1)) {
-            return this.lastNode;
-        }
-        var node = this.firstNode;
-        for (var i = 0; i < index; i++) {
-            node = node.next;
-        }
-        return node;
-    };
-    /**
-     * @private
-     */
-    LinkedList.prototype.createNode = function (item) {
-        return {
-            element: item,
-            next: null
-        };
-    };
-    return LinkedList;
-}());
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.default = LinkedList; // End of linked list
-//# sourceMappingURL=LinkedList.js.map
\ No newline at end of file
diff --git a/dist/lib/LinkedList.js.map b/dist/lib/LinkedList.js.map
deleted file mode 100644
index 0a604f3..0000000
--- a/dist/lib/LinkedList.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"LinkedList.js","sourceRoot":"","sources":["../../src/lib/LinkedList.ts"],"names":[],"mappings":";AAAA,IAAY,IAAI,WAAM,QAAQ,CAAC,CAAA;AAC/B,IAAY,MAAM,WAAM,UAAU,CAAC,CAAA;AAQnC;IAsBI;;;;;MAKE;IACF;QA1BA;;;;UAIE;QACK,cAAS,GAAuB,IAAI,CAAC;QAC5C;;;;UAIE;QACM,aAAQ,GAAuB,IAAI,CAAC;QAE5C;;;;UAIE;QACM,cAAS,GAAG,CAAC,CAAC;IAQN,CAAC;IAEjB;;;;;;;MAOE;IACF,wBAAG,GAAH,UAAI,IAAO,EAAE,KAAc;QACvB,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1B,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC;QAC3B,CAAC;QACD,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChE,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QACD,IAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACtC,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC;YACvB,0BAA0B;YAC1B,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC;YACzB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QAC5B,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;YAClC,qBAAqB;YACrB,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,OAAO,CAAC;YAC7B,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QAC5B,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC;YACrB,qBAAqB;YACrB,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;YAC9B,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC;QAC7B,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,IAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YACzC,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACzB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;QACxB,CAAC;QACD,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,MAAM,CAAC,IAAI,CAAC;IAChB,CAAC;IAED;;;;MAIE;IACF,0BAAK,GAAL;QAEI,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,KAAK,IAAI,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;QAClC,CAAC;QACD,MAAM,CAAC,SAAS,CAAC;IACrB,CAAC;IAED;;;;MAIE;IACF,yBAAI,GAAJ;QAEI,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC;YACzB,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;QACjC,CAAC;QACD,MAAM,CAAC,SAAS,CAAC;IACrB,CAAC;IAED;;;;;OAKG;IACH,mCAAc,GAAd,UAAe,KAAa;QAExB,IAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QACrC,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,SAAS,CAAC;QACrB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC;IACxB,CAAC;IAED;;;;;;;;;;;;;;;;;;;OAmBG;IACH,4BAAO,GAAP,UAAQ,IAAO,EAAE,cAAwC;QAErD,IAAM,OAAO,GAAG,cAAc,IAAI,IAAI,CAAC,aAAa,CAAC;QACrD,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,CAAC,CAAC,CAAC,CAAC;QACd,CAAC;QACD,IAAI,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC;QACjC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,OAAO,WAAW,KAAK,IAAI,EAAE,CAAC;YAC1B,EAAE,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;gBACrC,MAAM,CAAC,KAAK,CAAC;YACjB,CAAC;YACD,KAAK,EAAE,CAAC;YACR,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;QACnC,CAAC;QACD,MAAM,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;IAGD;;;;;;;;;;;;;;;;;SAiBK;IACL,6BAAQ,GAAR,UAAS,IAAO,EAAE,cAAwC;QACtD,MAAM,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC;IACrD,CAAC;IAED;;;;;;;;;;;;;;OAcG;IACH,2BAAM,GAAN,UAAO,IAAO,EAAE,cAAwC;QACpD,IAAM,OAAO,GAAG,cAAc,IAAI,IAAI,CAAC,aAAa,CAAC;QACrD,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC/C,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QACD,IAAI,QAAQ,GAAuB,IAAI,CAAC;QACxC,IAAI,WAAW,GAAuB,IAAI,CAAC,SAAS,CAAC;QAErD,OAAO,WAAW,KAAK,IAAI,EAAE,CAAC;YAC1B,EAAE,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;gBAErC,EAAE,CAAC,CAAC,WAAW,KAAK,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;oBACjC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;oBACrC,EAAE,CAAC,CAAC,WAAW,KAAK,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;wBAChC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;oBACzB,CAAC;gBACL,CAAC;gBAAC,IAAI,CAAC,EAAE,CAAC,CAAC,WAAW,KAAK,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;oBACvC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;oBACzB,QAAQ,CAAC,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC;oBACjC,WAAW,CAAC,IAAI,GAAG,IAAI,CAAC;gBAC5B,CAAC;gBAAC,IAAI,CAAC,CAAC;oBACJ,QAAQ,CAAC,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC;oBACjC,WAAW,CAAC,IAAI,GAAG,IAAI,CAAC;gBAC5B,CAAC;gBACD,IAAI,CAAC,SAAS,EAAE,CAAC;gBACjB,MAAM,CAAC,IAAI,CAAC;YAChB,CAAC;YACD,QAAQ,GAAG,WAAW,CAAC;YACvB,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;QACnC,CAAC;QACD,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,0BAAK,GAAL;QACI,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;QACtB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACvB,CAAC;IAED;;;;;;;;;OASG;IACH,2BAAM,GAAN,UAAO,KAAoB,EAAE,cAAwC;QACjE,IAAM,GAAG,GAAG,cAAc,IAAI,IAAI,CAAC,aAAa,CAAC;QACjD,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,YAAY,UAAU,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QACD,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;IAChE,CAAC;IAED;;MAEE;IACM,8BAAS,GAAjB,UAAkB,EAAsB,EAAE,EAAsB,EAAE,GAA4B;QAC1F,OAAO,EAAE,KAAK,IAAI,EAAE,CAAC;YACjB,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC/B,MAAM,CAAC,KAAK,CAAC;YACjB,CAAC;YACD,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC;YACb,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC;QACjB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACH,yCAAoB,GAApB,UAAqB,KAAa;QAC9B,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,SAAS,CAAC;QACrB,CAAC;QACD,IAAI,OAAU,CAAC;QACf,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC;YACvB,yBAAyB;YACzB,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;YACjC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;YACtB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACzB,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,IAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YAC7C,EAAE,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC;gBACpB,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;gBACjC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;YACzC,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,KAAK,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;gBACzC,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;gBAChC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;YAC7B,CAAC;YACD,EAAE,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC;gBACpB,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC;gBAChC,QAAQ,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;YACvC,CAAC;QACL,CAAC;QACD,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,MAAM,CAAC,OAAO,CAAC;IACnB,CAAC;IAED;;;;;OAKG;IACH,4BAAO,GAAP,UAAQ,QAA+B;QACnC,IAAI,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC;QACjC,OAAO,WAAW,KAAK,IAAI,EAAE,CAAC;YAC1B,EAAE,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,OAAO,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC;gBAC1C,KAAK,CAAC;YACV,CAAC;YACD,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;QACnC,CAAC;IACL,CAAC;IAED;;;OAGG;IACH,4BAAO,GAAP;QACI,IAAI,QAAQ,GAAuB,IAAI,CAAC;QACxC,IAAI,OAAO,GAAuB,IAAI,CAAC,SAAS,CAAC;QACjD,IAAI,IAAI,GAAuB,IAAI,CAAC;QACpC,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;YACtB,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;YACpB,OAAO,CAAC,IAAI,GAAG,QAAQ,CAAC;YACxB,QAAQ,GAAG,OAAO,CAAC;YACnB,OAAO,GAAG,IAAI,CAAC;QACnB,CAAC;QACD,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;QACtB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC/B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;IACzB,CAAC;IAED;;;;;OAKG;IACH,4BAAO,GAAP;QACI,IAAM,KAAK,GAAQ,EAAE,CAAC;QACtB,IAAI,WAAW,GAAuB,IAAI,CAAC,SAAS,CAAC;QACrD,OAAO,WAAW,KAAK,IAAI,EAAE,CAAC;YAC1B,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;YAChC,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;QACnC,CAAC;QACD,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,yBAAI,GAAJ;QACI,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,4BAAO,GAAP;QACI,MAAM,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC;IAC/B,CAAC;IAED,6BAAQ,GAAR;QACI,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;IAC3C,CAAC;IAED;;OAEG;IACK,gCAAW,GAAnB,UAAoB,KAAa;QAE7B,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC;QAChB,CAAC;QACD,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC;QACzB,CAAC;QACD,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;QAC1B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACrB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,+BAAU,GAAlB,UAAmB,IAAO;QACtB,MAAM,CAAC;YACH,OAAO,EAAE,IAAI;YACb,IAAI,EAAE,IAAI;SACb,CAAC;IACN,CAAC;IACL,iBAAC;AAAD,CAAC,AAxYD,IAwYC;AAxYD;4BAwYC,CAAA,CAAC,qBAAqB"}
\ No newline at end of file
diff --git a/dist/lib/MultiDictionary.d.ts b/dist/lib/MultiDictionary.d.ts
deleted file mode 100644
index 93f8bb6..0000000
--- a/dist/lib/MultiDictionary.d.ts
+++ /dev/null
@@ -1,104 +0,0 @@
-import * as util from './util';
-export default class MultiDictionary<K, V> {
-    private dict;
-    private equalsF;
-    private allowDuplicate;
-    /**
-     * Creates an empty multi dictionary.
-     * @class <p>A multi dictionary is a special kind of dictionary that holds
-     * multiple values against each key. Setting a value into the dictionary will
-     * add the value to an array at that key. Getting a key will return an array,
-     * holding all the values set to that key.
-     * You can configure to allow duplicates in the values.
-     * This implementation accepts any kind of objects as keys.</p>
-     *
-     * <p>If the keys are custom objects a function which converts keys to strings must be
-     * provided. Example:</p>
-     *
-     * <pre>
-     * function petToString(pet) {
-       *  return pet.name;
-       * }
-     * </pre>
-     * <p>If the values are custom objects a function to check equality between values
-     * must be provided. Example:</p>
-     *
-     * <pre>
-     * function petsAreEqualByAge(pet1,pet2) {
-       *  return pet1.age===pet2.age;
-       * }
-     * </pre>
-     * @constructor
-     * @param {function(Object):string=} toStrFunction optional function
-     * to convert keys to strings. If the keys aren't strings or if toString()
-     * is not appropriate, a custom function which receives a key and returns a
-     * unique string must be provided.
-     * @param {function(Object,Object):boolean=} valuesEqualsFunction optional
-     * function to check if two values are equal.
-     *
-     * @param allowDuplicateValues
-     */
-    constructor(toStrFunction?: (key: K) => string, valuesEqualsFunction?: util.IEqualsFunction<V>, allowDuplicateValues?: boolean);
-    /**
-    * Returns an array holding the values to which this dictionary maps
-    * the specified key.
-    * Returns an empty array if this dictionary contains no mappings for this key.
-    * @param {Object} key key whose associated values are to be returned.
-    * @return {Array} an array holding the values to which this dictionary maps
-    * the specified key.
-    */
-    getValue(key: K): V[];
-    /**
-     * Adds the value to the array associated with the specified key, if
-     * it is not already present.
-     * @param {Object} key key with which the specified value is to be
-     * associated.
-     * @param {Object} value the value to add to the array at the key
-     * @return {boolean} true if the value was not already associated with that key.
-     */
-    setValue(key: K, value: V): boolean;
-    /**
-     * Removes the specified values from the array of values associated with the
-     * specified key. If a value isn't given, all values associated with the specified
-     * key are removed.
-     * @param {Object} key key whose mapping is to be removed from the
-     * dictionary.
-     * @param {Object=} value optional argument to specify the value to remove
-     * from the array associated with the specified key.
-     * @return {*} true if the dictionary changed, false if the key doesn't exist or
-     * if the specified value isn't associated with the specified key.
-     */
-    remove(key: K, value?: V): boolean;
-    /**
-     * Returns an array containing all of the keys in this dictionary.
-     * @return {Array} an array containing all of the keys in this dictionary.
-     */
-    keys(): K[];
-    /**
-     * Returns an array containing all of the values in this dictionary.
-     * @return {Array} an array containing all of the values in this dictionary.
-     */
-    values(): V[];
-    /**
-     * Returns true if this dictionary at least one value associatted the specified key.
-     * @param {Object} key key whose presence in this dictionary is to be
-     * tested.
-     * @return {boolean} true if this dictionary at least one value associatted
-     * the specified key.
-     */
-    containsKey(key: K): boolean;
-    /**
-     * Removes all mappings from this dictionary.
-     */
-    clear(): void;
-    /**
-     * Returns the number of keys in this dictionary.
-     * @return {number} the number of key-value mappings in this dictionary.
-     */
-    size(): number;
-    /**
-     * Returns true if this dictionary contains no mappings.
-     * @return {boolean} true if this dictionary contains no mappings.
-     */
-    isEmpty(): boolean;
-}
diff --git a/dist/lib/MultiDictionary.js b/dist/lib/MultiDictionary.js
deleted file mode 100644
index 38d16cb..0000000
--- a/dist/lib/MultiDictionary.js
+++ /dev/null
@@ -1,169 +0,0 @@
-"use strict";
-var util = require('./util');
-var Dictionary_1 = require('./Dictionary');
-var arrays = require('./arrays');
-var MultiDictionary = (function () {
-    /**
-     * Creates an empty multi dictionary.
-     * @class <p>A multi dictionary is a special kind of dictionary that holds
-     * multiple values against each key. Setting a value into the dictionary will
-     * add the value to an array at that key. Getting a key will return an array,
-     * holding all the values set to that key.
-     * You can configure to allow duplicates in the values.
-     * This implementation accepts any kind of objects as keys.</p>
-     *
-     * <p>If the keys are custom objects a function which converts keys to strings must be
-     * provided. Example:</p>
-     *
-     * <pre>
-     * function petToString(pet) {
-       *  return pet.name;
-       * }
-     * </pre>
-     * <p>If the values are custom objects a function to check equality between values
-     * must be provided. Example:</p>
-     *
-     * <pre>
-     * function petsAreEqualByAge(pet1,pet2) {
-       *  return pet1.age===pet2.age;
-       * }
-     * </pre>
-     * @constructor
-     * @param {function(Object):string=} toStrFunction optional function
-     * to convert keys to strings. If the keys aren't strings or if toString()
-     * is not appropriate, a custom function which receives a key and returns a
-     * unique string must be provided.
-     * @param {function(Object,Object):boolean=} valuesEqualsFunction optional
-     * function to check if two values are equal.
-     *
-     * @param allowDuplicateValues
-     */
-    function MultiDictionary(toStrFunction, valuesEqualsFunction, allowDuplicateValues) {
-        if (allowDuplicateValues === void 0) { allowDuplicateValues = false; }
-        this.dict = new Dictionary_1.default(toStrFunction);
-        this.equalsF = valuesEqualsFunction || util.defaultEquals;
-        this.allowDuplicate = allowDuplicateValues;
-    }
-    /**
-    * Returns an array holding the values to which this dictionary maps
-    * the specified key.
-    * Returns an empty array if this dictionary contains no mappings for this key.
-    * @param {Object} key key whose associated values are to be returned.
-    * @return {Array} an array holding the values to which this dictionary maps
-    * the specified key.
-    */
-    MultiDictionary.prototype.getValue = function (key) {
-        var values = this.dict.getValue(key);
-        if (util.isUndefined(values)) {
-            return [];
-        }
-        return arrays.copy(values);
-    };
-    /**
-     * Adds the value to the array associated with the specified key, if
-     * it is not already present.
-     * @param {Object} key key with which the specified value is to be
-     * associated.
-     * @param {Object} value the value to add to the array at the key
-     * @return {boolean} true if the value was not already associated with that key.
-     */
-    MultiDictionary.prototype.setValue = function (key, value) {
-        if (util.isUndefined(key) || util.isUndefined(value)) {
-            return false;
-        }
-        if (!this.containsKey(key)) {
-            this.dict.setValue(key, [value]);
-            return true;
-        }
-        var array = this.dict.getValue(key);
-        if (!this.allowDuplicate) {
-            if (arrays.contains(array, value, this.equalsF)) {
-                return false;
-            }
-        }
-        array.push(value);
-        return true;
-    };
-    /**
-     * Removes the specified values from the array of values associated with the
-     * specified key. If a value isn't given, all values associated with the specified
-     * key are removed.
-     * @param {Object} key key whose mapping is to be removed from the
-     * dictionary.
-     * @param {Object=} value optional argument to specify the value to remove
-     * from the array associated with the specified key.
-     * @return {*} true if the dictionary changed, false if the key doesn't exist or
-     * if the specified value isn't associated with the specified key.
-     */
-    MultiDictionary.prototype.remove = function (key, value) {
-        if (util.isUndefined(value)) {
-            var v = this.dict.remove(key);
-            return !util.isUndefined(v);
-        }
-        var array = this.dict.getValue(key);
-        if (arrays.remove(array, value, this.equalsF)) {
-            if (array.length === 0) {
-                this.dict.remove(key);
-            }
-            return true;
-        }
-        return false;
-    };
-    /**
-     * Returns an array containing all of the keys in this dictionary.
-     * @return {Array} an array containing all of the keys in this dictionary.
-     */
-    MultiDictionary.prototype.keys = function () {
-        return this.dict.keys();
-    };
-    /**
-     * Returns an array containing all of the values in this dictionary.
-     * @return {Array} an array containing all of the values in this dictionary.
-     */
-    MultiDictionary.prototype.values = function () {
-        var values = this.dict.values();
-        var array = [];
-        for (var _i = 0, values_1 = values; _i < values_1.length; _i++) {
-            var v = values_1[_i];
-            for (var _a = 0, v_1 = v; _a < v_1.length; _a++) {
-                var w = v_1[_a];
-                array.push(w);
-            }
-        }
-        return array;
-    };
-    /**
-     * Returns true if this dictionary at least one value associatted the specified key.
-     * @param {Object} key key whose presence in this dictionary is to be
-     * tested.
-     * @return {boolean} true if this dictionary at least one value associatted
-     * the specified key.
-     */
-    MultiDictionary.prototype.containsKey = function (key) {
-        return this.dict.containsKey(key);
-    };
-    /**
-     * Removes all mappings from this dictionary.
-     */
-    MultiDictionary.prototype.clear = function () {
-        this.dict.clear();
-    };
-    /**
-     * Returns the number of keys in this dictionary.
-     * @return {number} the number of key-value mappings in this dictionary.
-     */
-    MultiDictionary.prototype.size = function () {
-        return this.dict.size();
-    };
-    /**
-     * Returns true if this dictionary contains no mappings.
-     * @return {boolean} true if this dictionary contains no mappings.
-     */
-    MultiDictionary.prototype.isEmpty = function () {
-        return this.dict.isEmpty();
-    };
-    return MultiDictionary;
-}());
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.default = MultiDictionary; // end of multi dictionary
-//# sourceMappingURL=MultiDictionary.js.map
\ No newline at end of file
diff --git a/dist/lib/MultiDictionary.js.map b/dist/lib/MultiDictionary.js.map
deleted file mode 100644
index b0dbe9f..0000000
--- a/dist/lib/MultiDictionary.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"MultiDictionary.js","sourceRoot":"","sources":["../../src/lib/MultiDictionary.ts"],"names":[],"mappings":";AAAA,IAAY,IAAI,WAAM,QAAQ,CAAC,CAAA;AAC/B,2BAAuB,cAAc,CAAC,CAAA;AACtC,IAAY,MAAM,WAAM,UAAU,CAAC,CAAA;AAEnC;IAUI;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAkCG;IACH,yBAAY,aAAkC,EAAE,oBAA8C,EAAE,oBAA4B;QAA5B,oCAA4B,GAA5B,4BAA4B;QACxH,IAAI,CAAC,IAAI,GAAG,IAAI,oBAAU,CAAc,aAAa,CAAC,CAAC;QACvD,IAAI,CAAC,OAAO,GAAG,oBAAoB,IAAI,IAAI,CAAC,aAAa,CAAC;QAC1D,IAAI,CAAC,cAAc,GAAG,oBAAoB,CAAC;IAC/C,CAAC;IACD;;;;;;;MAOE;IACF,kCAAQ,GAAR,UAAS,GAAM;QACX,IAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QACvC,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,EAAE,CAAC;QACd,CAAC;QACD,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC/B,CAAC;IAED;;;;;;;OAOG;IACH,kCAAQ,GAAR,UAAS,GAAM,EAAE,KAAQ;QAErB,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACnD,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QACD,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,IAAI,CAAC;QAChB,CAAC;QACD,IAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QACtC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC;YACvB,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC9C,MAAM,CAAC,KAAK,CAAC;YACjB,CAAC;QACL,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClB,MAAM,CAAC,IAAI,CAAC;IAChB,CAAC;IAED;;;;;;;;;;OAUG;IACH,gCAAM,GAAN,UAAO,GAAM,EAAE,KAAS;QACpB,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAChC,MAAM,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC;QACD,IAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QACtC,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC5C,EAAE,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;gBACrB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAC1B,CAAC;YACD,MAAM,CAAC,IAAI,CAAC;QAChB,CAAC;QACD,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,8BAAI,GAAJ;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5B,CAAC;IAED;;;OAGG;IACH,gCAAM,GAAN;QACI,IAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;QAClC,IAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,GAAG,CAAC,CAAY,UAAM,EAAN,iBAAM,EAAN,oBAAM,EAAN,IAAM,CAAC;YAAlB,IAAM,CAAC,eAAA;YACR,GAAG,CAAC,CAAY,UAAC,EAAD,OAAC,EAAD,eAAC,EAAD,IAAC,CAAC;gBAAb,IAAM,CAAC,UAAA;gBACR,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;aACjB;SACJ;QACD,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED;;;;;;OAMG;IACH,qCAAW,GAAX,UAAY,GAAM;QACd,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACtC,CAAC;IAED;;OAEG;IACH,+BAAK,GAAL;QACI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IAED;;;OAGG;IACH,8BAAI,GAAJ;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5B,CAAC;IAED;;;OAGG;IACH,iCAAO,GAAP;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;IAC/B,CAAC;IACL,sBAAC;AAAD,CAAC,AA/KD,IA+KC;AA/KD;iCA+KC,CAAA,CAAA,0BAA0B"}
\ No newline at end of file
diff --git a/dist/lib/MultiRootTree.d.ts b/dist/lib/MultiRootTree.d.ts
deleted file mode 100644
index 751200e..0000000
--- a/dist/lib/MultiRootTree.d.ts
+++ /dev/null
@@ -1,49 +0,0 @@
-export declare enum Direction {
-    BEFORE = 0,
-    AFTER = 1,
-    INSIDE_AT_END = 2,
-    INSIDE_AT_START = 3,
-}
-export default class MultiRootTree {
-    rootIds: Array<string>;
-    nodes: {
-        [id: string]: Array<string>;
-    };
-    constructor(rootIds?: Array<string>, nodes?: {
-        [id: string]: Array<string>;
-    });
-    getRootIds(): string[];
-    getNodes(): {
-        [id: string]: string[];
-    };
-    getObject(): {
-        rootIds: string[];
-        nodes: {
-            [id: string]: string[];
-        };
-    };
-    moveIdBeforeId(moveId: string, beforeId: string): void;
-    moveIdAfterId(moveId: string, afterId: string): void;
-    moveIdIntoId(moveId: string, insideId: string, atStart?: boolean): void;
-    deleteId(id: string): void;
-    insertIdBeforeId(beforeId: string, insertId: string): void;
-    insertIdAfterId(belowId: string, insertId: string): void;
-    insertIdIntoId(insideId: string, insertId: string): void;
-    insertIdIntoRoot(id: string, position?: number): void;
-    insertIdIntoNode(nodeKey: string, id: string, position?: number): void;
-    private moveId(moveId, beforeId, direction);
-    private swapArrayElements(arr, indexA, indexB);
-    private rootDeleteId(id);
-    private nodeAndSubNodesDelete(nodeKey);
-    private nodeRefrencesDelete(id);
-    private nodeDelete(nodeKey);
-    private findRootId(id);
-    private findNodeId(nodeKey, id);
-    private findNode(nodeKey);
-    private nodeInsertAtStart(nodeKey, id);
-    private nodeInsertAtEnd(nodeKey, id);
-    private rootDelete(index);
-    private nodeDeleteAtIndex(nodeKey, index);
-    private rootInsertAtStart(id);
-    private rootInsertAtEnd(id);
-}
diff --git a/dist/lib/MultiRootTree.js b/dist/lib/MultiRootTree.js
deleted file mode 100644
index 806a5ff..0000000
--- a/dist/lib/MultiRootTree.js
+++ /dev/null
@@ -1,330 +0,0 @@
-"use strict";
-(function (Direction) {
-    Direction[Direction["BEFORE"] = 0] = "BEFORE";
-    Direction[Direction["AFTER"] = 1] = "AFTER";
-    Direction[Direction["INSIDE_AT_END"] = 2] = "INSIDE_AT_END";
-    Direction[Direction["INSIDE_AT_START"] = 3] = "INSIDE_AT_START";
-})(exports.Direction || (exports.Direction = {}));
-var Direction = exports.Direction;
-var MultiRootTree = (function () {
-    function MultiRootTree(rootIds, nodes) {
-        if (rootIds === void 0) { rootIds = []; }
-        if (nodes === void 0) { nodes = {}; }
-        this.rootIds = rootIds;
-        this.nodes = nodes;
-    }
-    MultiRootTree.prototype.getRootIds = function () {
-        var clone = this.rootIds.slice();
-        return clone;
-    };
-    MultiRootTree.prototype.getNodes = function () {
-        var clone = {};
-        for (var nodeKey in this.nodes) {
-            if (this.nodes.hasOwnProperty(nodeKey)) {
-                clone[nodeKey] = this.nodes[nodeKey].slice();
-            }
-        }
-        return clone;
-    };
-    MultiRootTree.prototype.getObject = function () {
-        return {
-            rootIds: this.getRootIds(),
-            nodes: this.getNodes(),
-        };
-    };
-    MultiRootTree.prototype.moveIdBeforeId = function (moveId, beforeId) {
-        return this.moveId(moveId, beforeId, Direction.BEFORE);
-    };
-    MultiRootTree.prototype.moveIdAfterId = function (moveId, afterId) {
-        return this.moveId(moveId, afterId, Direction.AFTER);
-    };
-    MultiRootTree.prototype.moveIdIntoId = function (moveId, insideId, atStart) {
-        if (atStart === void 0) { atStart = true; }
-        if (atStart) {
-            return this.moveId(moveId, insideId, Direction.INSIDE_AT_START);
-        }
-        else {
-            return this.moveId(moveId, insideId, Direction.INSIDE_AT_END);
-        }
-    };
-    MultiRootTree.prototype.deleteId = function (id) {
-        this.rootDeleteId(id);
-        this.nodeAndSubNodesDelete(id);
-        this.nodeRefrencesDelete(id);
-    };
-    MultiRootTree.prototype.insertIdBeforeId = function (beforeId, insertId) {
-        var foundRootIdIndex = this.findRootId(beforeId);
-        if (foundRootIdIndex > -1) {
-            this.insertIdIntoRoot(insertId, foundRootIdIndex);
-        }
-        for (var nodeKey in this.nodes) {
-            if (this.nodes.hasOwnProperty(nodeKey)) {
-                var foundNodeIdIndex = this.findNodeId(nodeKey, beforeId);
-                if (foundNodeIdIndex > -1) {
-                    this.insertIdIntoNode(nodeKey, insertId, foundNodeIdIndex);
-                }
-            }
-        }
-    };
-    MultiRootTree.prototype.insertIdAfterId = function (belowId, insertId) {
-        var foundRootIdIndex = this.findRootId(belowId);
-        if (foundRootIdIndex > -1) {
-            this.insertIdIntoRoot(insertId, foundRootIdIndex + 1);
-        }
-        for (var nodeKey in this.nodes) {
-            if (this.nodes.hasOwnProperty(nodeKey)) {
-                var foundNodeIdIndex = this.findNodeId(nodeKey, belowId);
-                if (foundNodeIdIndex > -1) {
-                    this.insertIdIntoNode(nodeKey, insertId, foundNodeIdIndex + 1);
-                }
-            }
-        }
-    };
-    MultiRootTree.prototype.insertIdIntoId = function (insideId, insertId) {
-        this.nodeInsertAtEnd(insideId, insertId);
-        this.nodes[insertId] = [];
-    };
-    MultiRootTree.prototype.insertIdIntoRoot = function (id, position) {
-        if (position === undefined) {
-            this.rootInsertAtEnd(id);
-        }
-        else {
-            if (position < 0) {
-                var length_1 = this.rootIds.length;
-                this.rootIds.splice((position + length_1 + 1), 0, id);
-            }
-            else {
-                this.rootIds.splice(position, 0, id);
-            }
-        }
-        this.nodes[id] = this.nodes[id] || [];
-    };
-    MultiRootTree.prototype.insertIdIntoNode = function (nodeKey, id, position) {
-        this.nodes[nodeKey] = this.nodes[nodeKey] || [];
-        this.nodes[id] = this.nodes[id] || [];
-        if (position === undefined) {
-            this.nodeInsertAtEnd(nodeKey, id);
-        }
-        else {
-            if (position < 0) {
-                var length_2 = this.nodes[nodeKey].length;
-                this.nodes[nodeKey].splice((position + length_2 + 1), 0, id);
-            }
-            else {
-                this.nodes[nodeKey].splice(position, 0, id);
-            }
-        }
-    };
-    MultiRootTree.prototype.moveId = function (moveId, beforeId, direction) {
-        var sourceId = moveId;
-        var sourceRootIndex = this.findRootId(sourceId);
-        var sourceNodeKey;
-        var sourceNodeIdIndex;
-        if (this.nodes[beforeId]) {
-            sourceNodeKey = beforeId;
-        }
-        for (var nodeKey in this.nodes) {
-            if (this.nodes.hasOwnProperty(nodeKey)) {
-                sourceNodeIdIndex = this.findNodeId(nodeKey, beforeId);
-                break;
-            }
-        }
-        // got all
-        var targetId = beforeId;
-        var targetRootIndex = this.findRootId(targetId);
-        var targetNodeKey;
-        var targetNodeIdIndex;
-        if (this.nodes[beforeId]) {
-            targetNodeKey = beforeId;
-        }
-        for (var nodeKey in this.nodes) {
-            if (this.nodes.hasOwnProperty(nodeKey)) {
-                targetNodeIdIndex = this.findNodeId(nodeKey, beforeId);
-                break;
-            }
-        }
-        // got all
-        if (sourceRootIndex > -1) {
-            if (targetRootIndex > -1) {
-                this.rootDelete(sourceRootIndex);
-                switch (direction) {
-                    case Direction.BEFORE:
-                        this.insertIdIntoRoot(sourceId, targetRootIndex);
-                        break;
-                    case Direction.AFTER:
-                        this.insertIdIntoRoot(sourceId, targetRootIndex + 1);
-                        break;
-                    case Direction.INSIDE_AT_START:
-                        this.nodeInsertAtStart(targetId, sourceId);
-                        break;
-                    case Direction.INSIDE_AT_END:
-                        this.nodeInsertAtEnd(targetId, sourceId);
-                        break;
-                }
-            }
-            else {
-                // moving root (source) ABOVE node (target)
-                // will remove one entry from roots
-                this.rootDelete(sourceRootIndex);
-                for (var nodeKey in this.nodes) {
-                    if (this.nodes.hasOwnProperty(nodeKey)) {
-                        var index = this.findNodeId(nodeKey, targetId);
-                        if (index > -1) {
-                            switch (direction) {
-                                case Direction.BEFORE:
-                                    this.insertIdIntoNode(nodeKey, sourceId, index);
-                                    break;
-                                case Direction.AFTER:
-                                    this.insertIdIntoNode(nodeKey, sourceId, index + 1);
-                                    break;
-                                case Direction.INSIDE_AT_START:
-                                    this.nodeInsertAtStart(targetId, sourceId);
-                                    break;
-                                case Direction.INSIDE_AT_END:
-                                    this.nodeInsertAtEnd(targetId, sourceId);
-                                    break;
-                            }
-                            break;
-                        }
-                    }
-                }
-            }
-        }
-        else {
-            if (targetRootIndex > -1) {
-                // moving node (source) ABOVE root (target)
-                // delete source id from each node
-                for (var nodeKey in this.nodes) {
-                    if (this.nodes.hasOwnProperty(nodeKey)) {
-                        var index = this.findNodeId(nodeKey, sourceId);
-                        if (index > -1) {
-                            // this.nodeInsertId(nodeKey, sourceId, index);
-                            this.nodeDeleteAtIndex(nodeKey, index);
-                            break;
-                        }
-                    }
-                }
-                switch (direction) {
-                    case Direction.BEFORE:
-                        this.insertIdIntoRoot(sourceId, targetRootIndex);
-                        break;
-                    case Direction.AFTER:
-                        this.insertIdIntoRoot(sourceId, targetRootIndex + 1);
-                        break;
-                    case Direction.INSIDE_AT_START:
-                        this.nodeInsertAtStart(targetId, sourceId);
-                        break;
-                    case Direction.INSIDE_AT_END:
-                        this.nodeInsertAtEnd(targetId, sourceId);
-                        break;
-                }
-            }
-            else {
-                // moving node (source) ABOVE node (target)
-                // delete source id from each node
-                for (var nodeKey in this.nodes) {
-                    if (this.nodes.hasOwnProperty(nodeKey)) {
-                        var index = this.findNodeId(nodeKey, sourceId);
-                        if (index > -1) {
-                            this.nodeDeleteAtIndex(nodeKey, index);
-                            break;
-                        }
-                    }
-                }
-                for (var nodeKey in this.nodes) {
-                    if (this.nodes.hasOwnProperty(nodeKey)) {
-                        var index = this.findNodeId(nodeKey, targetId);
-                        if (index > -1) {
-                            switch (direction) {
-                                case Direction.BEFORE:
-                                    this.insertIdIntoNode(nodeKey, sourceId, index);
-                                    break;
-                                case Direction.AFTER:
-                                    this.insertIdIntoNode(nodeKey, sourceId, index + 1);
-                                    break;
-                                case Direction.INSIDE_AT_START:
-                                    this.nodeInsertAtStart(targetId, sourceId);
-                                    break;
-                                case Direction.INSIDE_AT_END:
-                                    this.nodeInsertAtEnd(targetId, sourceId);
-                                    break;
-                            }
-                            break;
-                        }
-                    }
-                }
-            }
-        }
-    };
-    MultiRootTree.prototype.swapArrayElements = function (arr, indexA, indexB) {
-        var temp = arr[indexA];
-        arr[indexA] = arr[indexB];
-        arr[indexB] = temp;
-        return arr;
-    };
-    ;
-    MultiRootTree.prototype.rootDeleteId = function (id) {
-        var index = this.findRootId(id);
-        if (index > -1) {
-            this.rootDelete(index);
-        }
-    };
-    MultiRootTree.prototype.nodeAndSubNodesDelete = function (nodeKey) {
-        var toDeleteLater = [];
-        for (var i = 0; i < this.nodes[nodeKey].length; i++) {
-            var id = this.nodes[nodeKey][i];
-            this.nodeAndSubNodesDelete(id);
-            toDeleteLater.push(nodeKey);
-        }
-        this.nodeDelete(nodeKey);
-        for (var i = 0; i < toDeleteLater.length; i++) {
-            this.nodeDelete(toDeleteLater[i]);
-        }
-    };
-    MultiRootTree.prototype.nodeRefrencesDelete = function (id) {
-        for (var nodeKey in this.nodes) {
-            if (this.nodes.hasOwnProperty(nodeKey)) {
-                for (var i = 0; i < this.nodes[nodeKey].length; i++) {
-                    var targetId = this.nodes[nodeKey][i];
-                    if (targetId === id) {
-                        this.nodeDeleteAtIndex(nodeKey, i);
-                    }
-                }
-            }
-        }
-    };
-    MultiRootTree.prototype.nodeDelete = function (nodeKey) {
-        delete this.nodes[nodeKey];
-    };
-    MultiRootTree.prototype.findRootId = function (id) {
-        return this.rootIds.indexOf(id);
-    };
-    MultiRootTree.prototype.findNodeId = function (nodeKey, id) {
-        return this.nodes[nodeKey].indexOf(id);
-    };
-    MultiRootTree.prototype.findNode = function (nodeKey) {
-        return this.nodes[nodeKey];
-    };
-    MultiRootTree.prototype.nodeInsertAtStart = function (nodeKey, id) {
-        this.nodes[nodeKey].unshift(id);
-    };
-    MultiRootTree.prototype.nodeInsertAtEnd = function (nodeKey, id) {
-        this.nodes[nodeKey].push(id);
-    };
-    MultiRootTree.prototype.rootDelete = function (index) {
-        this.rootIds.splice(index, 1);
-    };
-    MultiRootTree.prototype.nodeDeleteAtIndex = function (nodeKey, index) {
-        this.nodes[nodeKey].splice(index, 1);
-    };
-    MultiRootTree.prototype.rootInsertAtStart = function (id) {
-        this.rootIds.unshift(id);
-    };
-    MultiRootTree.prototype.rootInsertAtEnd = function (id) {
-        this.rootIds.push(id);
-    };
-    return MultiRootTree;
-}());
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.default = MultiRootTree;
-//# sourceMappingURL=MultiRootTree.js.map
\ No newline at end of file
diff --git a/dist/lib/MultiRootTree.js.map b/dist/lib/MultiRootTree.js.map
deleted file mode 100644
index 1ed138d..0000000
--- a/dist/lib/MultiRootTree.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"MultiRootTree.js","sourceRoot":"","sources":["../../src/lib/MultiRootTree.ts"],"names":[],"mappings":";AACA,WAAY,SAAS;IACjB,6CAAM,CAAA;IACN,2CAAK,CAAA;IACL,2DAAa,CAAA;IACb,+DAAe,CAAA;AACnB,CAAC,EALW,iBAAS,KAAT,iBAAS,QAKpB;AALD,IAAY,SAAS,GAAT,iBAKX,CAAA;AAED;IAKI,uBAAY,OAA2B,EAAE,KAA2C;QAAxE,uBAA2B,GAA3B,YAA2B;QAAE,qBAA2C,GAA3C,UAA2C;QAChF,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACvB,CAAC;IAED,kCAAU,GAAV;QACI,IAAI,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACjC,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED,gCAAQ,GAAR;QACI,IAAI,KAAK,GAAoC,EAAE,CAAC;QAChD,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACrC,KAAK,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC;YACjD,CAAC;QACL,CAAC;QAED,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED,iCAAS,GAAT;QACI,MAAM,CAAC;YACH,OAAO,EAAE,IAAI,CAAC,UAAU,EAAE;YAC1B,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE;SACzB,CAAC;IACN,CAAC;IAED,sCAAc,GAAd,UAAe,MAAc,EAAE,QAAgB;QAC3C,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;IAC3D,CAAC;IAED,qCAAa,GAAb,UAAc,MAAc,EAAE,OAAe;QACzC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC;IACzD,CAAC;IAED,oCAAY,GAAZ,UAAa,MAAc,EAAE,QAAgB,EAAE,OAAc;QAAd,uBAAc,GAAd,cAAc;QACzD,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YACV,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,EAAE,SAAS,CAAC,eAAe,CAAC,CAAC;QACpE,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,EAAE,SAAS,CAAC,aAAa,CAAC,CAAC;QAClE,CAAC;IACL,CAAC;IAGD,gCAAQ,GAAR,UAAS,EAAU;QACf,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;QACtB,IAAI,CAAC,qBAAqB,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;IACjC,CAAC;IAED,wCAAgB,GAAhB,UAAiB,QAAgB,EAAE,QAAgB;QAC/C,IAAI,gBAAgB,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QACjD,EAAE,CAAC,CAAC,gBAAgB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,gBAAgB,CAAC,CAAC;QACtD,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACrC,IAAI,gBAAgB,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;gBAC1D,EAAE,CAAC,CAAC,gBAAgB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;oBACxB,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,QAAQ,EAAE,gBAAgB,CAAC,CAAC;gBAC/D,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,uCAAe,GAAf,UAAgB,OAAe,EAAE,QAAgB;QAC7C,IAAI,gBAAgB,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QAChD,EAAE,CAAC,CAAC,gBAAgB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,gBAAgB,GAAG,CAAC,CAAC,CAAC;QAC1D,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACrC,IAAI,gBAAgB,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;gBACzD,EAAE,CAAC,CAAC,gBAAgB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;oBACxB,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,QAAQ,EAAE,gBAAgB,GAAG,CAAC,CAAC,CAAC;gBACnE,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,sCAAc,GAAd,UAAe,QAAgB,EAAE,QAAgB;QAC7C,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACzC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;IAC9B,CAAC;IAED,wCAAgB,GAAhB,UAAiB,EAAU,EAAE,QAAiB;QAC1C,EAAE,CAAC,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC;YACzB,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;QAC7B,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,EAAE,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;gBACf,IAAM,QAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;gBACnC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,QAAQ,GAAG,QAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YACxD,CAAC;YAAC,IAAI,CAAC,CAAC;gBACJ,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YACzC,CAAC;QACL,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;IAC1C,CAAC;IAED,wCAAgB,GAAhB,UAAiB,OAAe,EAAE,EAAU,EAAE,QAAiB;QAC3D,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QAChD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QACtC,EAAE,CAAC,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC;YACzB,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACtC,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,EAAE,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;gBACf,IAAM,QAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;gBAC1C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,QAAQ,GAAG,QAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YAC/D,CAAC;YAAC,IAAI,CAAC,CAAC;gBACJ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YAChD,CAAC;QACL,CAAC;IACL,CAAC;IAEO,8BAAM,GAAd,UAAe,MAAc,EAAE,QAAgB,EAAE,SAAoB;QAEjE,IAAI,QAAQ,GAAG,MAAM,CAAC;QACtB,IAAM,eAAe,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QAClD,IAAI,aAAqB,CAAC;QAC1B,IAAI,iBAAyB,CAAC;QAE9B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACvB,aAAa,GAAG,QAAQ,CAAC;QAC7B,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACrC,iBAAiB,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;gBACvD,KAAK,CAAC;YACV,CAAC;QACL,CAAC;QAED,UAAU;QAEV,IAAI,QAAQ,GAAG,QAAQ,CAAC;QACxB,IAAM,eAAe,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QAClD,IAAI,aAAqB,CAAC;QAC1B,IAAI,iBAAyB,CAAC;QAE9B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACvB,aAAa,GAAG,QAAQ,CAAC;QAC7B,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACrC,iBAAiB,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;gBACvD,KAAK,CAAC;YACV,CAAC;QACL,CAAC;QAED,UAAU;QAEV,EAAE,CAAC,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACvB,EAAE,CAAC,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACvB,IAAI,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC;gBAEjC,MAAM,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;oBAChB,KAAK,SAAS,CAAC,MAAM;wBACjB,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC;wBACjD,KAAK,CAAC;oBACV,KAAK,SAAS,CAAC,KAAK;wBAChB,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,eAAe,GAAG,CAAC,CAAC,CAAC;wBACrD,KAAK,CAAC;oBACV,KAAK,SAAS,CAAC,eAAe;wBAC1B,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;wBAC3C,KAAK,CAAC;oBACV,KAAK,SAAS,CAAC,aAAa;wBACxB,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;wBACzC,KAAK,CAAC;gBACd,CAAC;YACL,CAAC;YAAC,IAAI,CAAC,CAAC;gBACJ,2CAA2C;gBAE3C,mCAAmC;gBACnC,IAAI,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC;gBAEjC,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;oBAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBACrC,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;wBAC/C,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;4BACb,MAAM,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;gCAChB,KAAK,SAAS,CAAC,MAAM;oCACjB,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;oCAChD,KAAK,CAAC;gCACV,KAAK,SAAS,CAAC,KAAK;oCAChB,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,QAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;oCACpD,KAAK,CAAC;gCACV,KAAK,SAAS,CAAC,eAAe;oCAC1B,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;oCAC3C,KAAK,CAAC;gCACV,KAAK,SAAS,CAAC,aAAa;oCACxB,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;oCACzC,KAAK,CAAC;4BACd,CAAC;4BACD,KAAK,CAAC;wBACV,CAAC;oBACL,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,EAAE,CAAC,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACvB,2CAA2C;gBAE3C,kCAAkC;gBAClC,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;oBAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBACrC,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;wBAC/C,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;4BACb,+CAA+C;4BAC/C,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;4BACvC,KAAK,CAAC;wBACV,CAAC;oBACL,CAAC;gBACL,CAAC;gBAED,MAAM,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;oBAChB,KAAK,SAAS,CAAC,MAAM;wBACjB,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC;wBACjD,KAAK,CAAC;oBACV,KAAK,SAAS,CAAC,KAAK;wBAChB,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,eAAe,GAAG,CAAC,CAAC,CAAC;wBACrD,KAAK,CAAC;oBACV,KAAK,SAAS,CAAC,eAAe;wBAC1B,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;wBAC3C,KAAK,CAAC;oBACV,KAAK,SAAS,CAAC,aAAa;wBACxB,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;wBACzC,KAAK,CAAC;gBACd,CAAC;YAEL,CAAC;YAAC,IAAI,CAAC,CAAC;gBACJ,2CAA2C;gBAE3C,kCAAkC;gBAClC,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;oBAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBACrC,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;wBAC/C,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;4BACb,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;4BACvC,KAAK,CAAC;wBACV,CAAC;oBACL,CAAC;gBACL,CAAC;gBAED,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;oBAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBACrC,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;wBAC/C,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;4BACb,MAAM,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;gCAChB,KAAK,SAAS,CAAC,MAAM;oCACjB,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;oCAChD,KAAK,CAAC;gCACV,KAAK,SAAS,CAAC,KAAK;oCAChB,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,QAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;oCACpD,KAAK,CAAC;gCACV,KAAK,SAAS,CAAC,eAAe;oCAC1B,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;oCAC3C,KAAK,CAAC;gCACV,KAAK,SAAS,CAAC,aAAa;oCACxB,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;oCACzC,KAAK,CAAC;4BACd,CAAC;4BACD,KAAK,CAAC;wBACV,CAAC;oBACL,CAAC;gBACL,CAAC;YAEL,CAAC;QACL,CAAC;IACL,CAAC;IAEO,yCAAiB,GAAzB,UAA0B,GAAe,EAAE,MAAc,EAAE,MAAc;QACrE,IAAI,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;QACvB,GAAG,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;QAC1B,GAAG,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;QACnB,MAAM,CAAC,GAAG,CAAC;IACf,CAAC;;IAEO,oCAAY,GAApB,UAAqB,EAAU;QAC3B,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QAChC,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACb,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAC3B,CAAC;IACL,CAAC;IAEO,6CAAqB,GAA7B,UAA8B,OAAe;QACzC,IAAI,aAAa,GAAkB,EAAE,CAAC;QACtC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,CAAC,qBAAqB,CAAC,EAAE,CAAC,CAAC;YAC/B,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAChC,CAAC;QAED,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACzB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC;IACL,CAAC;IAEO,2CAAmB,GAA3B,UAA4B,EAAU;QAClC,GAAG,CAAC,CAAC,IAAI,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACrC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAClD,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;oBACtC,EAAE,CAAC,CAAC,QAAQ,KAAK,EAAE,CAAC,CAAC,CAAC;wBAClB,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;oBACvC,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAEO,kCAAU,GAAlB,UAAmB,OAAe;QAC9B,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC/B,CAAC;IAGO,kCAAU,GAAlB,UAAmB,EAAU;QACzB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACpC,CAAC;IAEO,kCAAU,GAAlB,UAAmB,OAAe,EAAE,EAAU;QAC1C,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC3C,CAAC;IAEO,gCAAQ,GAAhB,UAAiB,OAAe;QAC5B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC/B,CAAC;IAGO,yCAAiB,GAAzB,UAA0B,OAAe,EAAE,EAAU;QACjD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACpC,CAAC;IAEO,uCAAe,GAAvB,UAAwB,OAAe,EAAE,EAAU;QAC/C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjC,CAAC;IAEO,kCAAU,GAAlB,UAAmB,KAAa;QAC5B,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAClC,CAAC;IAEO,yCAAiB,GAAzB,UAA0B,OAAe,EAAE,KAAa;QACpD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACzC,CAAC;IAEO,yCAAiB,GAAzB,UAA0B,EAAU;QAChC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC;IAEO,uCAAe,GAAvB,UAAwB,EAAU;QAC9B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC1B,CAAC;IACL,oBAAC;AAAD,CAAC,AA1WD,IA0WC;AA1WD;+BA0WC,CAAA"}
\ No newline at end of file
diff --git a/dist/lib/PriorityQueue.d.ts b/dist/lib/PriorityQueue.d.ts
deleted file mode 100644
index 5427c52..0000000
--- a/dist/lib/PriorityQueue.d.ts
+++ /dev/null
@@ -1,82 +0,0 @@
-import * as util from './util';
-export default class PriorityQueue<T> {
-    private heap;
-    /**
-     * Creates an empty priority queue.
-     * @class <p>In a priority queue each element is associated with a "priority",
-     * elements are dequeued in highest-priority-first order (the elements with the
-     * highest priority are dequeued first). Priority Queues are implemented as heaps.
-     * If the inserted elements are custom objects a compare function must be provided,
-     * otherwise the <=, === and >= operators are used to compare object priority.</p>
-     * <pre>
-     * function compare(a, b) {
-     *  if (a is less than b by some ordering criterion) {
-     *     return -1;
-     *  } if (a is greater than b by the ordering criterion) {
-     *     return 1;
-     *  }
-     *  // a must be equal to b
-     *  return 0;
-     * }
-     * </pre>
-     * @constructor
-     * @param {function(Object,Object):number=} compareFunction optional
-     * function used to compare two element priorities. Must return a negative integer,
-     * zero, or a positive integer as the first argument is less than, equal to,
-     * or greater than the second.
-     */
-    constructor(compareFunction?: util.ICompareFunction<T>);
-    /**
-     * Inserts the specified element into this priority queue.
-     * @param {Object} element the element to insert.
-     * @return {boolean} true if the element was inserted, or false if it is undefined.
-     */
-    enqueue(element: T): boolean;
-    /**
-     * Inserts the specified element into this priority queue.
-     * @param {Object} element the element to insert.
-     * @return {boolean} true if the element was inserted, or false if it is undefined.
-     */
-    add(element: T): boolean;
-    /**
-     * Retrieves and removes the highest priority element of this queue.
-     * @return {*} the the highest priority element of this queue,
-     *  or undefined if this queue is empty.
-     */
-    dequeue(): T;
-    /**
-     * Retrieves, but does not remove, the highest priority element of this queue.
-     * @return {*} the highest priority element of this queue, or undefined if this queue is empty.
-     */
-    peek(): T;
-    /**
-     * Returns true if this priority queue contains the specified element.
-     * @param {Object} element element to search for.
-     * @return {boolean} true if this priority queue contains the specified element,
-     * false otherwise.
-     */
-    contains(element: T): boolean;
-    /**
-     * Checks if this priority queue is empty.
-     * @return {boolean} true if and only if this priority queue contains no items; false
-     * otherwise.
-     */
-    isEmpty(): boolean;
-    /**
-     * Returns the number of elements in this priority queue.
-     * @return {number} the number of elements in this priority queue.
-     */
-    size(): number;
-    /**
-     * Removes all of the elements from this priority queue.
-     */
-    clear(): void;
-    /**
-     * Executes the provided function once for each element present in this queue in
-     * no particular order.
-     * @param {function(Object):*} callback function to execute, it is
-     * invoked with one argument: the element value, to break the iteration you can
-     * optionally return false.
-     */
-    forEach(callback: util.ILoopFunction<T>): void;
-}
diff --git a/dist/lib/PriorityQueue.js b/dist/lib/PriorityQueue.js
deleted file mode 100644
index 8dc57a3..0000000
--- a/dist/lib/PriorityQueue.js
+++ /dev/null
@@ -1,112 +0,0 @@
-"use strict";
-var util = require('./util');
-var Heap_1 = require('./Heap');
-var PriorityQueue = (function () {
-    /**
-     * Creates an empty priority queue.
-     * @class <p>In a priority queue each element is associated with a "priority",
-     * elements are dequeued in highest-priority-first order (the elements with the
-     * highest priority are dequeued first). Priority Queues are implemented as heaps.
-     * If the inserted elements are custom objects a compare function must be provided,
-     * otherwise the <=, === and >= operators are used to compare object priority.</p>
-     * <pre>
-     * function compare(a, b) {
-     *  if (a is less than b by some ordering criterion) {
-     *     return -1;
-     *  } if (a is greater than b by the ordering criterion) {
-     *     return 1;
-     *  }
-     *  // a must be equal to b
-     *  return 0;
-     * }
-     * </pre>
-     * @constructor
-     * @param {function(Object,Object):number=} compareFunction optional
-     * function used to compare two element priorities. Must return a negative integer,
-     * zero, or a positive integer as the first argument is less than, equal to,
-     * or greater than the second.
-     */
-    function PriorityQueue(compareFunction) {
-        this.heap = new Heap_1.default(util.reverseCompareFunction(compareFunction));
-    }
-    /**
-     * Inserts the specified element into this priority queue.
-     * @param {Object} element the element to insert.
-     * @return {boolean} true if the element was inserted, or false if it is undefined.
-     */
-    PriorityQueue.prototype.enqueue = function (element) {
-        return this.heap.add(element);
-    };
-    /**
-     * Inserts the specified element into this priority queue.
-     * @param {Object} element the element to insert.
-     * @return {boolean} true if the element was inserted, or false if it is undefined.
-     */
-    PriorityQueue.prototype.add = function (element) {
-        return this.heap.add(element);
-    };
-    /**
-     * Retrieves and removes the highest priority element of this queue.
-     * @return {*} the the highest priority element of this queue,
-     *  or undefined if this queue is empty.
-     */
-    PriorityQueue.prototype.dequeue = function () {
-        if (this.heap.size() !== 0) {
-            var el = this.heap.peek();
-            this.heap.removeRoot();
-            return el;
-        }
-        return undefined;
-    };
-    /**
-     * Retrieves, but does not remove, the highest priority element of this queue.
-     * @return {*} the highest priority element of this queue, or undefined if this queue is empty.
-     */
-    PriorityQueue.prototype.peek = function () {
-        return this.heap.peek();
-    };
-    /**
-     * Returns true if this priority queue contains the specified element.
-     * @param {Object} element element to search for.
-     * @return {boolean} true if this priority queue contains the specified element,
-     * false otherwise.
-     */
-    PriorityQueue.prototype.contains = function (element) {
-        return this.heap.contains(element);
-    };
-    /**
-     * Checks if this priority queue is empty.
-     * @return {boolean} true if and only if this priority queue contains no items; false
-     * otherwise.
-     */
-    PriorityQueue.prototype.isEmpty = function () {
-        return this.heap.isEmpty();
-    };
-    /**
-     * Returns the number of elements in this priority queue.
-     * @return {number} the number of elements in this priority queue.
-     */
-    PriorityQueue.prototype.size = function () {
-        return this.heap.size();
-    };
-    /**
-     * Removes all of the elements from this priority queue.
-     */
-    PriorityQueue.prototype.clear = function () {
-        this.heap.clear();
-    };
-    /**
-     * Executes the provided function once for each element present in this queue in
-     * no particular order.
-     * @param {function(Object):*} callback function to execute, it is
-     * invoked with one argument: the element value, to break the iteration you can
-     * optionally return false.
-     */
-    PriorityQueue.prototype.forEach = function (callback) {
-        this.heap.forEach(callback);
-    };
-    return PriorityQueue;
-}());
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.default = PriorityQueue; // end of priority queue
-//# sourceMappingURL=PriorityQueue.js.map
\ No newline at end of file
diff --git a/dist/lib/PriorityQueue.js.map b/dist/lib/PriorityQueue.js.map
deleted file mode 100644
index 853d65b..0000000
--- a/dist/lib/PriorityQueue.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"PriorityQueue.js","sourceRoot":"","sources":["../../src/lib/PriorityQueue.ts"],"names":[],"mappings":";AAAA,IAAY,IAAI,WAAM,QAAQ,CAAC,CAAA;AAC/B,qBAAiB,QAAQ,CAAC,CAAA;AAE1B;IAGI;;;;;;;;;;;;;;;;;;;;;;;OAuBG;IACH,uBAAY,eAA0C;QAClD,IAAI,CAAC,IAAI,GAAG,IAAI,cAAI,CAAI,IAAI,CAAC,sBAAsB,CAAC,eAAe,CAAC,CAAC,CAAC;IAC1E,CAAC;IAED;;;;OAIG;IACH,+BAAO,GAAP,UAAQ,OAAU;QACd,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAClC,CAAC;IAED;;;;OAIG;IACH,2BAAG,GAAH,UAAI,OAAU;QACV,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAClC,CAAC;IAED;;;;OAIG;IACH,+BAAO,GAAP;QACI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;YACzB,IAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YAC5B,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YACvB,MAAM,CAAC,EAAE,CAAC;QACd,CAAC;QACD,MAAM,CAAC,SAAS,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,4BAAI,GAAJ;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5B,CAAC;IAED;;;;;OAKG;IACH,gCAAQ,GAAR,UAAS,OAAU;QACf,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IACvC,CAAC;IAED;;;;OAIG;IACH,+BAAO,GAAP;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;IAC/B,CAAC;IAED;;;OAGG;IACH,4BAAI,GAAJ;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,6BAAK,GAAL;QACI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IAED;;;;;;OAMG;IACH,+BAAO,GAAP,UAAQ,QAA+B;QACnC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAChC,CAAC;IAEL,oBAAC;AAAD,CAAC,AApHD,IAoHC;AApHD;+BAoHC,CAAA,CAAC,wBAAwB"}
\ No newline at end of file
diff --git a/dist/lib/Queue.d.ts b/dist/lib/Queue.d.ts
deleted file mode 100644
index 827b9f2..0000000
--- a/dist/lib/Queue.d.ts
+++ /dev/null
@@ -1,81 +0,0 @@
-import * as util from './util';
-export default class Queue<T> {
-    /**
-     * List containing the elements.
-     * @type collections.LinkedList
-     * @private
-     */
-    private list;
-    /**
-     * Creates an empty queue.
-     * @class A queue is a First-In-First-Out (FIFO) data structure, the first
-     * element added to the queue will be the first one to be removed. This
-     * implementation uses a linked list as a container.
-     * @constructor
-     */
-    constructor();
-    /**
-     * Inserts the specified element into the end of this queue.
-     * @param {Object} elem the element to insert.
-     * @return {boolean} true if the element was inserted, or false if it is undefined.
-     */
-    enqueue(elem: T): boolean;
-    /**
-     * Inserts the specified element into the end of this queue.
-     * @param {Object} elem the element to insert.
-     * @return {boolean} true if the element was inserted, or false if it is undefined.
-     */
-    add(elem: T): boolean;
-    /**
-     * Retrieves and removes the head of this queue.
-     * @return {*} the head of this queue, or undefined if this queue is empty.
-     */
-    dequeue(): T;
-    /**
-     * Retrieves, but does not remove, the head of this queue.
-     * @return {*} the head of this queue, or undefined if this queue is empty.
-     */
-    peek(): T;
-    /**
-     * Returns the number of elements in this queue.
-     * @return {number} the number of elements in this queue.
-     */
-    size(): number;
-    /**
-     * Returns true if this queue contains the specified element.
-     * <p>If the elements inside this stack are
-     * not comparable with the === operator, a custom equals function should be
-     * provided to perform searches, the function must receive two arguments and
-     * return true if they are equal, false otherwise. Example:</p>
-     *
-     * <pre>
-     * const petsAreEqualByName (pet1, pet2) {
-     *  return pet1.name === pet2.name;
-     * }
-     * </pre>
-     * @param {Object} elem element to search for.
-     * @param {function(Object,Object):boolean=} equalsFunction optional
-     * function to check if two elements are equal.
-     * @return {boolean} true if this queue contains the specified element,
-     * false otherwise.
-     */
-    contains(elem: T, equalsFunction?: util.IEqualsFunction<T>): boolean;
-    /**
-     * Checks if this queue is empty.
-     * @return {boolean} true if and only if this queue contains no items; false
-     * otherwise.
-     */
-    isEmpty(): boolean;
-    /**
-     * Removes all of the elements from this queue.
-     */
-    clear(): void;
-    /**
-     * Executes the provided function once for each element present in this queue in
-     * FIFO order.
-     * @param {function(Object):*} callback function to execute, it is
-     * invoked with one argument: the element value, to break the iteration you can
-     * optionally return false.
-     */
-    forEach(callback: util.ILoopFunction<T>): void;
-}
diff --git a/dist/lib/Queue.js b/dist/lib/Queue.js
deleted file mode 100644
index e24d87a..0000000
--- a/dist/lib/Queue.js
+++ /dev/null
@@ -1,108 +0,0 @@
-"use strict";
-var LinkedList_1 = require('./LinkedList');
-var Queue = (function () {
-    /**
-     * Creates an empty queue.
-     * @class A queue is a First-In-First-Out (FIFO) data structure, the first
-     * element added to the queue will be the first one to be removed. This
-     * implementation uses a linked list as a container.
-     * @constructor
-     */
-    function Queue() {
-        this.list = new LinkedList_1.default();
-    }
-    /**
-     * Inserts the specified element into the end of this queue.
-     * @param {Object} elem the element to insert.
-     * @return {boolean} true if the element was inserted, or false if it is undefined.
-     */
-    Queue.prototype.enqueue = function (elem) {
-        return this.list.add(elem);
-    };
-    /**
-     * Inserts the specified element into the end of this queue.
-     * @param {Object} elem the element to insert.
-     * @return {boolean} true if the element was inserted, or false if it is undefined.
-     */
-    Queue.prototype.add = function (elem) {
-        return this.list.add(elem);
-    };
-    /**
-     * Retrieves and removes the head of this queue.
-     * @return {*} the head of this queue, or undefined if this queue is empty.
-     */
-    Queue.prototype.dequeue = function () {
-        if (this.list.size() !== 0) {
-            var el = this.list.first();
-            this.list.removeElementAtIndex(0);
-            return el;
-        }
-        return undefined;
-    };
-    /**
-     * Retrieves, but does not remove, the head of this queue.
-     * @return {*} the head of this queue, or undefined if this queue is empty.
-     */
-    Queue.prototype.peek = function () {
-        if (this.list.size() !== 0) {
-            return this.list.first();
-        }
-        return undefined;
-    };
-    /**
-     * Returns the number of elements in this queue.
-     * @return {number} the number of elements in this queue.
-     */
-    Queue.prototype.size = function () {
-        return this.list.size();
-    };
-    /**
-     * Returns true if this queue contains the specified element.
-     * <p>If the elements inside this stack are
-     * not comparable with the === operator, a custom equals function should be
-     * provided to perform searches, the function must receive two arguments and
-     * return true if they are equal, false otherwise. Example:</p>
-     *
-     * <pre>
-     * const petsAreEqualByName (pet1, pet2) {
-     *  return pet1.name === pet2.name;
-     * }
-     * </pre>
-     * @param {Object} elem element to search for.
-     * @param {function(Object,Object):boolean=} equalsFunction optional
-     * function to check if two elements are equal.
-     * @return {boolean} true if this queue contains the specified element,
-     * false otherwise.
-     */
-    Queue.prototype.contains = function (elem, equalsFunction) {
-        return this.list.contains(elem, equalsFunction);
-    };
-    /**
-     * Checks if this queue is empty.
-     * @return {boolean} true if and only if this queue contains no items; false
-     * otherwise.
-     */
-    Queue.prototype.isEmpty = function () {
-        return this.list.size() <= 0;
-    };
-    /**
-     * Removes all of the elements from this queue.
-     */
-    Queue.prototype.clear = function () {
-        this.list.clear();
-    };
-    /**
-     * Executes the provided function once for each element present in this queue in
-     * FIFO order.
-     * @param {function(Object):*} callback function to execute, it is
-     * invoked with one argument: the element value, to break the iteration you can
-     * optionally return false.
-     */
-    Queue.prototype.forEach = function (callback) {
-        this.list.forEach(callback);
-    };
-    return Queue;
-}());
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.default = Queue; // End of queue
-//# sourceMappingURL=Queue.js.map
\ No newline at end of file
diff --git a/dist/lib/Queue.js.map b/dist/lib/Queue.js.map
deleted file mode 100644
index 610e9a9..0000000
--- a/dist/lib/Queue.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"Queue.js","sourceRoot":"","sources":["../../src/lib/Queue.ts"],"names":[],"mappings":";AACA,2BAAuB,cAAc,CAAC,CAAA;AAGtC;IASI;;;;;;OAMG;IACH;QACI,IAAI,CAAC,IAAI,GAAG,IAAI,oBAAU,EAAK,CAAC;IACpC,CAAC;IAGD;;;;OAIG;IACH,uBAAO,GAAP,UAAQ,IAAO;QACX,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;IACD;;;;OAIG;IACH,mBAAG,GAAH,UAAI,IAAO;QACP,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;IACD;;;OAGG;IACH,uBAAO,GAAP;QACI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;YACzB,IAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YAC7B,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,CAAC,EAAE,CAAC;QACd,CAAC;QACD,MAAM,CAAC,SAAS,CAAC;IACrB,CAAC;IACD;;;OAGG;IACH,oBAAI,GAAJ;QAEI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;QAC7B,CAAC;QACD,MAAM,CAAC,SAAS,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,oBAAI,GAAJ;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5B,CAAC;IAED;;;;;;;;;;;;;;;;;OAiBG;IACH,wBAAQ,GAAR,UAAS,IAAO,EAAE,cAAwC;QACtD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;IACpD,CAAC;IAED;;;;OAIG;IACH,uBAAO,GAAP;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACjC,CAAC;IAED;;OAEG;IACH,qBAAK,GAAL;QACI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IAED;;;;;;OAMG;IACH,uBAAO,GAAP,UAAQ,QAA+B;QACnC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAChC,CAAC;IAEL,YAAC;AAAD,CAAC,AAtHD,IAsHC;AAtHD;uBAsHC,CAAA,CAAC,eAAe"}
\ No newline at end of file
diff --git a/dist/lib/Set.d.ts b/dist/lib/Set.d.ts
deleted file mode 100644
index c6e87d7..0000000
--- a/dist/lib/Set.d.ts
+++ /dev/null
@@ -1,93 +0,0 @@
-import * as util from './util';
-export default class Set<T> {
-    private dictionary;
-    /**
-     * Creates an empty set.
-     * @class <p>A set is a data structure that contains no duplicate items.</p>
-     * <p>If the inserted elements are custom objects a function
-     * which converts elements to strings must be provided. Example:</p>
-     *
-     * <pre>
-     * function petToString(pet) {
-     *  return pet.name;
-     * }
-     * </pre>
-     *
-     * @constructor
-     * @param {function(Object):string=} toStringFunction optional function used
-     * to convert elements to strings. If the elements aren't strings or if toString()
-     * is not appropriate, a custom function which receives a onject and returns a
-     * unique string must be provided.
-     */
-    constructor(toStringFunction?: (item: T) => string);
-    /**
-     * Returns true if this set contains the specified element.
-     * @param {Object} element element to search for.
-     * @return {boolean} true if this set contains the specified element,
-     * false otherwise.
-     */
-    contains(element: T): boolean;
-    /**
-     * Adds the specified element to this set if it is not already present.
-     * @param {Object} element the element to insert.
-     * @return {boolean} true if this set did not already contain the specified element.
-     */
-    add(element: T): boolean;
-    /**
-     * Performs an intersecion between this an another set.
-     * Removes all values that are not present this set and the given set.
-     * @param {collections.Set} otherSet other set.
-     */
-    intersection(otherSet: Set<T>): void;
-    /**
-     * Performs a union between this an another set.
-     * Adds all values from the given set to this set.
-     * @param {collections.Set} otherSet other set.
-     */
-    union(otherSet: Set<T>): void;
-    /**
-     * Performs a difference between this an another set.
-     * Removes from this set all the values that are present in the given set.
-     * @param {collections.Set} otherSet other set.
-     */
-    difference(otherSet: Set<T>): void;
-    /**
-     * Checks whether the given set contains all the elements in this set.
-     * @param {collections.Set} otherSet other set.
-     * @return {boolean} true if this set is a subset of the given set.
-     */
-    isSubsetOf(otherSet: Set<T>): boolean;
-    /**
-     * Removes the specified element from this set if it is present.
-     * @return {boolean} true if this set contained the specified element.
-     */
-    remove(element: T): boolean;
-    /**
-     * Executes the provided function once for each element
-     * present in this set.
-     * @param {function(Object):*} callback function to execute, it is
-     * invoked with one arguments: the element. To break the iteration you can
-     * optionally return false.
-     */
-    forEach(callback: util.ILoopFunction<T>): void;
-    /**
-     * Returns an array containing all of the elements in this set in arbitrary order.
-     * @return {Array} an array containing all of the elements in this set.
-     */
-    toArray(): T[];
-    /**
-     * Returns true if this set contains no elements.
-     * @return {boolean} true if this set contains no elements.
-     */
-    isEmpty(): boolean;
-    /**
-     * Returns the number of elements in this set.
-     * @return {number} the number of elements in this set.
-     */
-    size(): number;
-    /**
-     * Removes all of the elements from this set.
-     */
-    clear(): void;
-    toString(): string;
-}
diff --git a/dist/lib/Set.js b/dist/lib/Set.js
deleted file mode 100644
index 1ca81a1..0000000
--- a/dist/lib/Set.js
+++ /dev/null
@@ -1,169 +0,0 @@
-"use strict";
-var util = require('./util');
-var arrays = require('./arrays');
-var Dictionary_1 = require('./Dictionary');
-var Set = (function () {
-    /**
-     * Creates an empty set.
-     * @class <p>A set is a data structure that contains no duplicate items.</p>
-     * <p>If the inserted elements are custom objects a function
-     * which converts elements to strings must be provided. Example:</p>
-     *
-     * <pre>
-     * function petToString(pet) {
-     *  return pet.name;
-     * }
-     * </pre>
-     *
-     * @constructor
-     * @param {function(Object):string=} toStringFunction optional function used
-     * to convert elements to strings. If the elements aren't strings or if toString()
-     * is not appropriate, a custom function which receives a onject and returns a
-     * unique string must be provided.
-     */
-    function Set(toStringFunction) {
-        this.dictionary = new Dictionary_1.default(toStringFunction);
-    }
-    /**
-     * Returns true if this set contains the specified element.
-     * @param {Object} element element to search for.
-     * @return {boolean} true if this set contains the specified element,
-     * false otherwise.
-     */
-    Set.prototype.contains = function (element) {
-        return this.dictionary.containsKey(element);
-    };
-    /**
-     * Adds the specified element to this set if it is not already present.
-     * @param {Object} element the element to insert.
-     * @return {boolean} true if this set did not already contain the specified element.
-     */
-    Set.prototype.add = function (element) {
-        if (this.contains(element) || util.isUndefined(element)) {
-            return false;
-        }
-        else {
-            this.dictionary.setValue(element, element);
-            return true;
-        }
-    };
-    /**
-     * Performs an intersecion between this an another set.
-     * Removes all values that are not present this set and the given set.
-     * @param {collections.Set} otherSet other set.
-     */
-    Set.prototype.intersection = function (otherSet) {
-        var set = this;
-        this.forEach(function (element) {
-            if (!otherSet.contains(element)) {
-                set.remove(element);
-            }
-            return true;
-        });
-    };
-    /**
-     * Performs a union between this an another set.
-     * Adds all values from the given set to this set.
-     * @param {collections.Set} otherSet other set.
-     */
-    Set.prototype.union = function (otherSet) {
-        var set = this;
-        otherSet.forEach(function (element) {
-            set.add(element);
-            return true;
-        });
-    };
-    /**
-     * Performs a difference between this an another set.
-     * Removes from this set all the values that are present in the given set.
-     * @param {collections.Set} otherSet other set.
-     */
-    Set.prototype.difference = function (otherSet) {
-        var set = this;
-        otherSet.forEach(function (element) {
-            set.remove(element);
-            return true;
-        });
-    };
-    /**
-     * Checks whether the given set contains all the elements in this set.
-     * @param {collections.Set} otherSet other set.
-     * @return {boolean} true if this set is a subset of the given set.
-     */
-    Set.prototype.isSubsetOf = function (otherSet) {
-        if (this.size() > otherSet.size()) {
-            return false;
-        }
-        var isSub = true;
-        this.forEach(function (element) {
-            if (!otherSet.contains(element)) {
-                isSub = false;
-                return false;
-            }
-            return true;
-        });
-        return isSub;
-    };
-    /**
-     * Removes the specified element from this set if it is present.
-     * @return {boolean} true if this set contained the specified element.
-     */
-    Set.prototype.remove = function (element) {
-        if (!this.contains(element)) {
-            return false;
-        }
-        else {
-            this.dictionary.remove(element);
-            return true;
-        }
-    };
-    /**
-     * Executes the provided function once for each element
-     * present in this set.
-     * @param {function(Object):*} callback function to execute, it is
-     * invoked with one arguments: the element. To break the iteration you can
-     * optionally return false.
-     */
-    Set.prototype.forEach = function (callback) {
-        this.dictionary.forEach(function (k, v) {
-            return callback(v);
-        });
-    };
-    /**
-     * Returns an array containing all of the elements in this set in arbitrary order.
-     * @return {Array} an array containing all of the elements in this set.
-     */
-    Set.prototype.toArray = function () {
-        return this.dictionary.values();
-    };
-    /**
-     * Returns true if this set contains no elements.
-     * @return {boolean} true if this set contains no elements.
-     */
-    Set.prototype.isEmpty = function () {
-        return this.dictionary.isEmpty();
-    };
-    /**
-     * Returns the number of elements in this set.
-     * @return {number} the number of elements in this set.
-     */
-    Set.prototype.size = function () {
-        return this.dictionary.size();
-    };
-    /**
-     * Removes all of the elements from this set.
-     */
-    Set.prototype.clear = function () {
-        this.dictionary.clear();
-    };
-    /*
-    * Provides a string representation for display
-    */
-    Set.prototype.toString = function () {
-        return arrays.toString(this.toArray());
-    };
-    return Set;
-}());
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.default = Set; // end of Set
-//# sourceMappingURL=Set.js.map
\ No newline at end of file
diff --git a/dist/lib/Set.js.map b/dist/lib/Set.js.map
deleted file mode 100644
index 4ccceb8..0000000
--- a/dist/lib/Set.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"Set.js","sourceRoot":"","sources":["../../src/lib/Set.ts"],"names":[],"mappings":";AAAA,IAAY,IAAI,WAAM,QAAQ,CAAC,CAAA;AAE/B,IAAY,MAAM,WAAM,UAAU,CAAC,CAAA;AAEnC,2BAAuB,cAAc,CAAC,CAAA;AAEtC;IAGI;;;;;;;;;;;;;;;;;OAiBG;IACH,aAAY,gBAAsC;QAC9C,IAAI,CAAC,UAAU,GAAG,IAAI,oBAAU,CAAS,gBAAgB,CAAC,CAAC;IAC/D,CAAC;IAID;;;;;OAKG;IACH,sBAAQ,GAAR,UAAS,OAAU;QACf,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;IAChD,CAAC;IAED;;;;OAIG;IACH,iBAAG,GAAH,UAAI,OAAU;QACV,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAC3C,MAAM,CAAC,IAAI,CAAC;QAChB,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,0BAAY,GAAZ,UAAa,QAAgB;QACzB,IAAM,GAAG,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,OAAO,CAAC,UAAS,OAAU;YAC5B,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC9B,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACxB,CAAC;YACD,MAAM,CAAC,IAAI,CAAC;QAChB,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;OAIG;IACH,mBAAK,GAAL,UAAM,QAAgB;QAClB,IAAM,GAAG,GAAG,IAAI,CAAC;QACjB,QAAQ,CAAC,OAAO,CAAC,UAAS,OAAU;YAChC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACjB,MAAM,CAAC,IAAI,CAAC;QAChB,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;OAIG;IACH,wBAAU,GAAV,UAAW,QAAgB;QACvB,IAAM,GAAG,GAAG,IAAI,CAAC;QACjB,QAAQ,CAAC,OAAO,CAAC,UAAS,OAAU;YAChC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC;QAChB,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;OAIG;IACH,wBAAU,GAAV,UAAW,QAAgB;QAEvB,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QAED,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,OAAO,CAAC,UAAS,OAAO;YACzB,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC9B,KAAK,GAAG,KAAK,CAAC;gBACd,MAAM,CAAC,KAAK,CAAC;YACjB,CAAC;YACD,MAAM,CAAC,IAAI,CAAC;QAChB,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,oBAAM,GAAN,UAAO,OAAU;QACb,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAChC,MAAM,CAAC,IAAI,CAAC;QAChB,CAAC;IACL,CAAC;IAED;;;;;;OAMG;IACH,qBAAO,GAAP,UAAQ,QAA+B;QACnC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,UAAS,CAAC,EAAE,CAAC;YACjC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;OAGG;IACH,qBAAO,GAAP;QACI,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;IACpC,CAAC;IAED;;;OAGG;IACH,qBAAO,GAAP;QACI,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC;IACrC,CAAC;IAED;;;OAGG;IACH,kBAAI,GAAJ;QACI,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC;IAClC,CAAC;IAED;;OAEG;IACH,mBAAK,GAAL;QACI,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;IAC5B,CAAC;IAED;;MAEE;IACF,sBAAQ,GAAR;QACI,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;IAC3C,CAAC;IACL,UAAC;AAAD,CAAC,AAjLD,IAiLC;AAjLD;qBAiLC,CAAA,CAAA,aAAa"}
\ No newline at end of file
diff --git a/dist/lib/Stack.d.ts b/dist/lib/Stack.d.ts
deleted file mode 100644
index 9e5e0d6..0000000
--- a/dist/lib/Stack.d.ts
+++ /dev/null
@@ -1,84 +0,0 @@
-import * as util from './util';
-export default class Stack<T> {
-    /**
-     * List containing the elements.
-     * @type collections.LinkedList
-     * @private
-     */
-    private list;
-    /**
-     * Creates an empty Stack.
-     * @class A Stack is a Last-In-First-Out (LIFO) data structure, the last
-     * element added to the stack will be the first one to be removed. This
-     * implementation uses a linked list as a container.
-     * @constructor
-     */
-    constructor();
-    /**
-     * Pushes an item onto the top of this stack.
-     * @param {Object} elem the element to be pushed onto this stack.
-     * @return {boolean} true if the element was pushed or false if it is undefined.
-     */
-    push(elem: T): boolean;
-    /**
-     * Pushes an item onto the top of this stack.
-     * @param {Object} elem the element to be pushed onto this stack.
-     * @return {boolean} true if the element was pushed or false if it is undefined.
-     */
-    add(elem: T): boolean;
-    /**
-     * Removes the object at the top of this stack and returns that object.
-     * @return {*} the object at the top of this stack or undefined if the
-     * stack is empty.
-     */
-    pop(): T;
-    /**
-     * Looks at the object at the top of this stack without removing it from the
-     * stack.
-     * @return {*} the object at the top of this stack or undefined if the
-     * stack is empty.
-     */
-    peek(): T;
-    /**
-     * Returns the number of elements in this stack.
-     * @return {number} the number of elements in this stack.
-     */
-    size(): number;
-    /**
-     * Returns true if this stack contains the specified element.
-     * <p>If the elements inside this stack are
-     * not comparable with the === operator, a custom equals function should be
-     * provided to perform searches, the function must receive two arguments and
-     * return true if they are equal, false otherwise. Example:</p>
-     *
-     * <pre>
-     * const petsAreEqualByName (pet1, pet2) {
-     *  return pet1.name === pet2.name;
-     * }
-     * </pre>
-     * @param {Object} elem element to search for.
-     * @param {function(Object,Object):boolean=} equalsFunction optional
-     * function to check if two elements are equal.
-     * @return {boolean} true if this stack contains the specified element,
-     * false otherwise.
-     */
-    contains(elem: T, equalsFunction?: util.IEqualsFunction<T>): boolean;
-    /**
-     * Checks if this stack is empty.
-     * @return {boolean} true if and only if this stack contains no items; false
-     * otherwise.
-     */
-    isEmpty(): boolean;
-    /**
-     * Removes all of the elements from this stack.
-     */
-    clear(): void;
-    /**
-     * Executes the provided function once for each element present in this stack in
-     * LIFO order.
-     * @param {function(Object):*} callback function to execute, it is
-     * invoked with one argument: the element value, to break the iteration you can
-     * optionally return false.
-     */
-    forEach(callback: util.ILoopFunction<T>): void;
-}
diff --git a/dist/lib/Stack.js b/dist/lib/Stack.js
deleted file mode 100644
index 5dc9772..0000000
--- a/dist/lib/Stack.js
+++ /dev/null
@@ -1,103 +0,0 @@
-"use strict";
-var LinkedList_1 = require('./LinkedList');
-var Stack = (function () {
-    /**
-     * Creates an empty Stack.
-     * @class A Stack is a Last-In-First-Out (LIFO) data structure, the last
-     * element added to the stack will be the first one to be removed. This
-     * implementation uses a linked list as a container.
-     * @constructor
-     */
-    function Stack() {
-        this.list = new LinkedList_1.default();
-    }
-    /**
-     * Pushes an item onto the top of this stack.
-     * @param {Object} elem the element to be pushed onto this stack.
-     * @return {boolean} true if the element was pushed or false if it is undefined.
-     */
-    Stack.prototype.push = function (elem) {
-        return this.list.add(elem, 0);
-    };
-    /**
-     * Pushes an item onto the top of this stack.
-     * @param {Object} elem the element to be pushed onto this stack.
-     * @return {boolean} true if the element was pushed or false if it is undefined.
-     */
-    Stack.prototype.add = function (elem) {
-        return this.list.add(elem, 0);
-    };
-    /**
-     * Removes the object at the top of this stack and returns that object.
-     * @return {*} the object at the top of this stack or undefined if the
-     * stack is empty.
-     */
-    Stack.prototype.pop = function () {
-        return this.list.removeElementAtIndex(0);
-    };
-    /**
-     * Looks at the object at the top of this stack without removing it from the
-     * stack.
-     * @return {*} the object at the top of this stack or undefined if the
-     * stack is empty.
-     */
-    Stack.prototype.peek = function () {
-        return this.list.first();
-    };
-    /**
-     * Returns the number of elements in this stack.
-     * @return {number} the number of elements in this stack.
-     */
-    Stack.prototype.size = function () {
-        return this.list.size();
-    };
-    /**
-     * Returns true if this stack contains the specified element.
-     * <p>If the elements inside this stack are
-     * not comparable with the === operator, a custom equals function should be
-     * provided to perform searches, the function must receive two arguments and
-     * return true if they are equal, false otherwise. Example:</p>
-     *
-     * <pre>
-     * const petsAreEqualByName (pet1, pet2) {
-     *  return pet1.name === pet2.name;
-     * }
-     * </pre>
-     * @param {Object} elem element to search for.
-     * @param {function(Object,Object):boolean=} equalsFunction optional
-     * function to check if two elements are equal.
-     * @return {boolean} true if this stack contains the specified element,
-     * false otherwise.
-     */
-    Stack.prototype.contains = function (elem, equalsFunction) {
-        return this.list.contains(elem, equalsFunction);
-    };
-    /**
-     * Checks if this stack is empty.
-     * @return {boolean} true if and only if this stack contains no items; false
-     * otherwise.
-     */
-    Stack.prototype.isEmpty = function () {
-        return this.list.isEmpty();
-    };
-    /**
-     * Removes all of the elements from this stack.
-     */
-    Stack.prototype.clear = function () {
-        this.list.clear();
-    };
-    /**
-     * Executes the provided function once for each element present in this stack in
-     * LIFO order.
-     * @param {function(Object):*} callback function to execute, it is
-     * invoked with one argument: the element value, to break the iteration you can
-     * optionally return false.
-     */
-    Stack.prototype.forEach = function (callback) {
-        this.list.forEach(callback);
-    };
-    return Stack;
-}());
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.default = Stack; // End of stack
-//# sourceMappingURL=Stack.js.map
\ No newline at end of file
diff --git a/dist/lib/Stack.js.map b/dist/lib/Stack.js.map
deleted file mode 100644
index 0fc6f22..0000000
--- a/dist/lib/Stack.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"Stack.js","sourceRoot":"","sources":["../../src/lib/Stack.ts"],"names":[],"mappings":";AAAA,2BAAuB,cAAc,CAAC,CAAA;AAGtC;IAOI;;;;;;OAMG;IACH;QACI,IAAI,CAAC,IAAI,GAAG,IAAI,oBAAU,EAAK,CAAC;IACpC,CAAC;IAED;;;;OAIG;IACH,oBAAI,GAAJ,UAAK,IAAO;QACR,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAClC,CAAC;IACD;;;;OAIG;IACH,mBAAG,GAAH,UAAI,IAAO;QACP,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAClC,CAAC;IACD;;;;OAIG;IACH,mBAAG,GAAH;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC;IACD;;;;;OAKG;IACH,oBAAI,GAAJ;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IAC7B,CAAC;IACD;;;OAGG;IACH,oBAAI,GAAJ;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5B,CAAC;IAED;;;;;;;;;;;;;;;;;OAiBG;IACH,wBAAQ,GAAR,UAAS,IAAO,EAAE,cAAwC;QACtD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;IACpD,CAAC;IACD;;;;OAIG;IACH,uBAAO,GAAP;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;IAC/B,CAAC;IACD;;OAEG;IACH,qBAAK,GAAL;QACI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IAED;;;;;;OAMG;IACH,uBAAO,GAAP,UAAQ,QAA+B;QACnC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAChC,CAAC;IACL,YAAC;AAAD,CAAC,AAzGD,IAyGC;AAzGD;uBAyGC,CAAA,CAAC,eAAe"}
\ No newline at end of file
diff --git a/dist/lib/arrays.d.ts b/dist/lib/arrays.d.ts
deleted file mode 100644
index 5c402ee..0000000
--- a/dist/lib/arrays.d.ts
+++ /dev/null
@@ -1,88 +0,0 @@
-import * as util from './util';
-/**
- * Returns the position of the first occurrence of the specified item
- * within the specified array.4
- * @param {*} array the array in which to search the element.
- * @param {Object} item the element to search.
- * @param {function(Object,Object):boolean=} equalsFunction optional function used to
- * check equality between 2 elements.
- * @return {number} the position of the first occurrence of the specified element
- * within the specified array, or -1 if not found.
- */
-export declare function indexOf<T>(array: T[], item: T, equalsFunction?: util.IEqualsFunction<T>): number;
-/**
- * Returns the position of the last occurrence of the specified element
- * within the specified array.
- * @param {*} array the array in which to search the element.
- * @param {Object} item the element to search.
- * @param {function(Object,Object):boolean=} equalsFunction optional function used to
- * check equality between 2 elements.
- * @return {number} the position of the last occurrence of the specified element
- * within the specified array or -1 if not found.
- */
-export declare function lastIndexOf<T>(array: T[], item: T, equalsFunction?: util.IEqualsFunction<T>): number;
-/**
- * Returns true if the specified array contains the specified element.
- * @param {*} array the array in which to search the element.
- * @param {Object} item the element to search.
- * @param {function(Object,Object):boolean=} equalsFunction optional function to
- * check equality between 2 elements.
- * @return {boolean} true if the specified array contains the specified element.
- */
-export declare function contains<T>(array: T[], item: T, equalsFunction?: util.IEqualsFunction<T>): boolean;
-/**
- * Removes the first ocurrence of the specified element from the specified array.
- * @param {*} array the array in which to search element.
- * @param {Object} item the element to search.
- * @param {function(Object,Object):boolean=} equalsFunction optional function to
- * check equality between 2 elements.
- * @return {boolean} true if the array changed after this call.
- */
-export declare function remove<T>(array: T[], item: T, equalsFunction?: util.IEqualsFunction<T>): boolean;
-/**
- * Returns the number of elements in the specified array equal
- * to the specified object.
- * @param {Array} array the array in which to determine the frequency of the element.
- * @param {Object} item the element whose frequency is to be determined.
- * @param {function(Object,Object):boolean=} equalsFunction optional function used to
- * check equality between 2 elements.
- * @return {number} the number of elements in the specified array
- * equal to the specified object.
- */
-export declare function frequency<T>(array: T[], item: T, equalsFunction?: util.IEqualsFunction<T>): number;
-/**
- * Returns true if the two specified arrays are equal to one another.
- * Two arrays are considered equal if both arrays contain the same number
- * of elements, and all corresponding pairs of elements in the two
- * arrays are equal and are in the same order.
- * @param {Array} array1 one array to be tested for equality.
- * @param {Array} array2 the other array to be tested for equality.
- * @param {function(Object,Object):boolean=} equalsFunction optional function used to
- * check equality between elemements in the arrays.
- * @return {boolean} true if the two arrays are equal
- */
-export declare function equals<T>(array1: T[], array2: T[], equalsFunction?: util.IEqualsFunction<T>): boolean;
-/**
- * Returns shallow a copy of the specified array.
- * @param {*} array the array to copy.
- * @return {Array} a copy of the specified array
- */
-export declare function copy<T>(array: T[]): T[];
-/**
- * Swaps the elements at the specified positions in the specified array.
- * @param {Array} array The array in which to swap elements.
- * @param {number} i the index of one element to be swapped.
- * @param {number} j the index of the other element to be swapped.
- * @return {boolean} true if the array is defined and the indexes are valid.
- */
-export declare function swap<T>(array: T[], i: number, j: number): boolean;
-export declare function toString<T>(array: T[]): string;
-/**
- * Executes the provided function once for each element present in this array
- * starting from index 0 to length - 1.
- * @param {Array} array The array in which to iterate.
- * @param {function(Object):*} callback function to execute, it is
- * invoked with one argument: the element value, to break the iteration you can
- * optionally return false.
- */
-export declare function forEach<T>(array: T[], callback: util.ILoopFunction<T>): void;
diff --git a/dist/lib/arrays.js b/dist/lib/arrays.js
deleted file mode 100644
index 09866ff..0000000
--- a/dist/lib/arrays.js
+++ /dev/null
@@ -1,168 +0,0 @@
-"use strict";
-var util = require('./util');
-/**
- * Returns the position of the first occurrence of the specified item
- * within the specified array.4
- * @param {*} array the array in which to search the element.
- * @param {Object} item the element to search.
- * @param {function(Object,Object):boolean=} equalsFunction optional function used to
- * check equality between 2 elements.
- * @return {number} the position of the first occurrence of the specified element
- * within the specified array, or -1 if not found.
- */
-function indexOf(array, item, equalsFunction) {
-    var equals = equalsFunction || util.defaultEquals;
-    var length = array.length;
-    for (var i = 0; i < length; i++) {
-        if (equals(array[i], item)) {
-            return i;
-        }
-    }
-    return -1;
-}
-exports.indexOf = indexOf;
-/**
- * Returns the position of the last occurrence of the specified element
- * within the specified array.
- * @param {*} array the array in which to search the element.
- * @param {Object} item the element to search.
- * @param {function(Object,Object):boolean=} equalsFunction optional function used to
- * check equality between 2 elements.
- * @return {number} the position of the last occurrence of the specified element
- * within the specified array or -1 if not found.
- */
-function lastIndexOf(array, item, equalsFunction) {
-    var equals = equalsFunction || util.defaultEquals;
-    var length = array.length;
-    for (var i = length - 1; i >= 0; i--) {
-        if (equals(array[i], item)) {
-            return i;
-        }
-    }
-    return -1;
-}
-exports.lastIndexOf = lastIndexOf;
-/**
- * Returns true if the specified array contains the specified element.
- * @param {*} array the array in which to search the element.
- * @param {Object} item the element to search.
- * @param {function(Object,Object):boolean=} equalsFunction optional function to
- * check equality between 2 elements.
- * @return {boolean} true if the specified array contains the specified element.
- */
-function contains(array, item, equalsFunction) {
-    return indexOf(array, item, equalsFunction) >= 0;
-}
-exports.contains = contains;
-/**
- * Removes the first ocurrence of the specified element from the specified array.
- * @param {*} array the array in which to search element.
- * @param {Object} item the element to search.
- * @param {function(Object,Object):boolean=} equalsFunction optional function to
- * check equality between 2 elements.
- * @return {boolean} true if the array changed after this call.
- */
-function remove(array, item, equalsFunction) {
-    var index = indexOf(array, item, equalsFunction);
-    if (index < 0) {
-        return false;
-    }
-    array.splice(index, 1);
-    return true;
-}
-exports.remove = remove;
-/**
- * Returns the number of elements in the specified array equal
- * to the specified object.
- * @param {Array} array the array in which to determine the frequency of the element.
- * @param {Object} item the element whose frequency is to be determined.
- * @param {function(Object,Object):boolean=} equalsFunction optional function used to
- * check equality between 2 elements.
- * @return {number} the number of elements in the specified array
- * equal to the specified object.
- */
-function frequency(array, item, equalsFunction) {
-    var equals = equalsFunction || util.defaultEquals;
-    var length = array.length;
-    var freq = 0;
-    for (var i = 0; i < length; i++) {
-        if (equals(array[i], item)) {
-            freq++;
-        }
-    }
-    return freq;
-}
-exports.frequency = frequency;
-/**
- * Returns true if the two specified arrays are equal to one another.
- * Two arrays are considered equal if both arrays contain the same number
- * of elements, and all corresponding pairs of elements in the two
- * arrays are equal and are in the same order.
- * @param {Array} array1 one array to be tested for equality.
- * @param {Array} array2 the other array to be tested for equality.
- * @param {function(Object,Object):boolean=} equalsFunction optional function used to
- * check equality between elemements in the arrays.
- * @return {boolean} true if the two arrays are equal
- */
-function equals(array1, array2, equalsFunction) {
-    var equals = equalsFunction || util.defaultEquals;
-    if (array1.length !== array2.length) {
-        return false;
-    }
-    var length = array1.length;
-    for (var i = 0; i < length; i++) {
-        if (!equals(array1[i], array2[i])) {
-            return false;
-        }
-    }
-    return true;
-}
-exports.equals = equals;
-/**
- * Returns shallow a copy of the specified array.
- * @param {*} array the array to copy.
- * @return {Array} a copy of the specified array
- */
-function copy(array) {
-    return array.concat();
-}
-exports.copy = copy;
-/**
- * Swaps the elements at the specified positions in the specified array.
- * @param {Array} array The array in which to swap elements.
- * @param {number} i the index of one element to be swapped.
- * @param {number} j the index of the other element to be swapped.
- * @return {boolean} true if the array is defined and the indexes are valid.
- */
-function swap(array, i, j) {
-    if (i < 0 || i >= array.length || j < 0 || j >= array.length) {
-        return false;
-    }
-    var temp = array[i];
-    array[i] = array[j];
-    array[j] = temp;
-    return true;
-}
-exports.swap = swap;
-function toString(array) {
-    return '[' + array.toString() + ']';
-}
-exports.toString = toString;
-/**
- * Executes the provided function once for each element present in this array
- * starting from index 0 to length - 1.
- * @param {Array} array The array in which to iterate.
- * @param {function(Object):*} callback function to execute, it is
- * invoked with one argument: the element value, to break the iteration you can
- * optionally return false.
- */
-function forEach(array, callback) {
-    for (var _i = 0, array_1 = array; _i < array_1.length; _i++) {
-        var ele = array_1[_i];
-        if (callback(ele) === false) {
-            return;
-        }
-    }
-}
-exports.forEach = forEach;
-//# sourceMappingURL=arrays.js.map
\ No newline at end of file
diff --git a/dist/lib/arrays.js.map b/dist/lib/arrays.js.map
deleted file mode 100644
index 6baed1e..0000000
--- a/dist/lib/arrays.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"arrays.js","sourceRoot":"","sources":["../../src/lib/arrays.ts"],"names":[],"mappings":";AAAA,IAAY,IAAI,WAAM,QAAQ,CAAC,CAAA;AAE/B;;;;;;;;;GASG;AACH,iBAA2B,KAAU,EAAE,IAAO,EAAE,cAAwC;IACpF,IAAM,MAAM,GAAG,cAAc,IAAI,IAAI,CAAC,aAAa,CAAC;IACpD,IAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,CAAC,CAAC,CAAC;QACb,CAAC;IACL,CAAC;IACD,MAAM,CAAC,CAAC,CAAC,CAAC;AACd,CAAC;AATe,eAAO,UAStB,CAAA;AAED;;;;;;;;;GASG;AACH,qBAA+B,KAAU,EAAE,IAAO,EAAE,cAAwC;IACxF,IAAM,MAAM,GAAG,cAAc,IAAI,IAAI,CAAC,aAAa,CAAC;IACpD,IAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,CAAC,CAAC,CAAC;QACb,CAAC;IACL,CAAC;IACD,MAAM,CAAC,CAAC,CAAC,CAAC;AACd,CAAC;AATe,mBAAW,cAS1B,CAAA;AAED;;;;;;;GAOG;AACH,kBAA4B,KAAU,EAAE,IAAO,EAAE,cAAwC;IACrF,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,cAAc,CAAC,IAAI,CAAC,CAAC;AACrD,CAAC;AAFe,gBAAQ,WAEvB,CAAA;AAGD;;;;;;;GAOG;AACH,gBAA0B,KAAU,EAAE,IAAO,EAAE,cAAwC;IACnF,IAAM,KAAK,GAAG,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC;IACnD,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IACD,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACvB,MAAM,CAAC,IAAI,CAAC;AAChB,CAAC;AAPe,cAAM,SAOrB,CAAA;AAED;;;;;;;;;GASG;AACH,mBAA6B,KAAU,EAAE,IAAO,EAAE,cAAwC;IACtF,IAAM,MAAM,GAAG,cAAc,IAAI,IAAI,CAAC,aAAa,CAAC;IACpD,IAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,EAAE,CAAC;QACX,CAAC;IACL,CAAC;IACD,MAAM,CAAC,IAAI,CAAC;AAChB,CAAC;AAVe,iBAAS,YAUxB,CAAA;AAED;;;;;;;;;;GAUG;AACH,gBAA0B,MAAW,EAAE,MAAW,EAAE,cAAwC;IACxF,IAAM,MAAM,GAAG,cAAc,IAAI,IAAI,CAAC,aAAa,CAAC;IAEpD,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QAClC,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IACD,IAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;IAC7B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC;IACL,CAAC;IACD,MAAM,CAAC,IAAI,CAAC;AAChB,CAAC;AAbe,cAAM,SAarB,CAAA;AAED;;;;GAIG;AACH,cAAwB,KAAU;IAC9B,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;AAC1B,CAAC;AAFe,YAAI,OAEnB,CAAA;AAED;;;;;;GAMG;AACH,cAAwB,KAAU,EAAE,CAAS,EAAE,CAAS;IACpD,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QAC3D,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IACD,IAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACtB,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACpB,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IAChB,MAAM,CAAC,IAAI,CAAC;AAChB,CAAC;AARe,YAAI,OAQnB,CAAA;AAED,kBAA4B,KAAU;IAClC,MAAM,CAAC,GAAG,GAAG,KAAK,CAAC,QAAQ,EAAE,GAAG,GAAG,CAAC;AACxC,CAAC;AAFe,gBAAQ,WAEvB,CAAA;AAED;;;;;;;GAOG;AACH,iBAA2B,KAAU,EAAE,QAA+B;IAClE,GAAG,CAAC,CAAc,UAAK,EAAL,eAAK,EAAL,mBAAK,EAAL,IAAK,CAAC;QAAnB,IAAM,GAAG,cAAA;QACV,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC;QACX,CAAC;KACJ;AACL,CAAC;AANe,eAAO,UAMtB,CAAA"}
\ No newline at end of file
diff --git a/dist/lib/index.d.ts b/dist/lib/index.d.ts
deleted file mode 100644
index f9a7292..0000000
--- a/dist/lib/index.d.ts
+++ /dev/null
@@ -1,18 +0,0 @@
-import * as _arrays from './arrays';
-export declare var arrays: typeof _arrays;
-export { default as Bag } from './Bag';
-export { default as BSTree } from './BSTree';
-export { default as Dictionary } from './Dictionary';
-export { default as Heap } from './Heap';
-export { default as LinkedDictionary } from './LinkedDictionary';
-export { default as LinkedList } from './LinkedList';
-export { default as MultiDictionary } from './MultiDictionary';
-export { default as FactoryDictionary } from './FactoryDictionary';
-export { default as DefaultDictionary } from './FactoryDictionary';
-export { default as Queue } from './Queue';
-export { default as PriorityQueue } from './PriorityQueue';
-export { default as Set } from './Set';
-export { default as Stack } from './Stack';
-export { default as MultiRootTree } from './MultiRootTree';
-import * as _util from './util';
-export declare var util: typeof _util;
diff --git a/dist/lib/index.js b/dist/lib/index.js
deleted file mode 100644
index cdcee04..0000000
--- a/dist/lib/index.js
+++ /dev/null
@@ -1,40 +0,0 @@
-"use strict";
-// Copyright 2013 Basarat Ali Syed. All Rights Reserved.
-//
-// Licensed under MIT open source license http://opensource.org/licenses/MIT
-//
-// Orginal javascript code was by Mauricio Santos
-//
-var _arrays = require('./arrays');
-exports.arrays = _arrays;
-var Bag_1 = require('./Bag');
-exports.Bag = Bag_1.default;
-var BSTree_1 = require('./BSTree');
-exports.BSTree = BSTree_1.default;
-var Dictionary_1 = require('./Dictionary');
-exports.Dictionary = Dictionary_1.default;
-var Heap_1 = require('./Heap');
-exports.Heap = Heap_1.default;
-var LinkedDictionary_1 = require('./LinkedDictionary');
-exports.LinkedDictionary = LinkedDictionary_1.default;
-var LinkedList_1 = require('./LinkedList');
-exports.LinkedList = LinkedList_1.default;
-var MultiDictionary_1 = require('./MultiDictionary');
-exports.MultiDictionary = MultiDictionary_1.default;
-var FactoryDictionary_1 = require('./FactoryDictionary');
-exports.FactoryDictionary = FactoryDictionary_1.default;
-var FactoryDictionary_2 = require('./FactoryDictionary');
-exports.DefaultDictionary = FactoryDictionary_2.default;
-var Queue_1 = require('./Queue');
-exports.Queue = Queue_1.default;
-var PriorityQueue_1 = require('./PriorityQueue');
-exports.PriorityQueue = PriorityQueue_1.default;
-var Set_1 = require('./Set');
-exports.Set = Set_1.default;
-var Stack_1 = require('./Stack');
-exports.Stack = Stack_1.default;
-var MultiRootTree_1 = require('./MultiRootTree');
-exports.MultiRootTree = MultiRootTree_1.default;
-var _util = require('./util');
-exports.util = _util;
-//# sourceMappingURL=index.js.map
\ No newline at end of file
diff --git a/dist/lib/index.js.map b/dist/lib/index.js.map
deleted file mode 100644
index f083d56..0000000
--- a/dist/lib/index.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/lib/index.ts"],"names":[],"mappings":";AAAA,wDAAwD;AACxD,EAAE;AACF,4EAA4E;AAC5E,EAAE;AACF,iDAAiD;AACjD,EAAE;AACF,IAAY,OAAO,WAAM,UAAU,CAAC,CAAA;AACzB,cAAM,GAAG,OAAO,CAAC;AAC5B,oBAA6B,OAAO,CAAC;AAA7B,4BAA6B;AACrC,uBAAgC,UAAU,CAAC;AAAnC,kCAAmC;AAC3C,2BAAoC,cAAc,CAAC;AAA3C,0CAA2C;AACnD,qBAA8B,QAAQ,CAAC;AAA/B,8BAA+B;AACvC,iCAA0C,oBAAoB,CAAC;AAAvD,sDAAuD;AAC/D,2BAAoC,cAAc,CAAC;AAA3C,0CAA2C;AACnD,gCAAyC,mBAAmB,CAAC;AAArD,oDAAqD;AAC7D,kCAA2C,qBAAqB,CAAC;AAAzD,wDAAyD;AACjE,kCAA2C,qBAAqB,CAAC;AAAzD,wDAAyD;AACjE,sBAA+B,SAAS,CAAC;AAAjC,gCAAiC;AACzC,8BAAuC,iBAAiB,CAAC;AAAjD,gDAAiD;AACzD,oBAA6B,OAAO,CAAC;AAA7B,4BAA6B;AACrC,sBAA+B,SAAS,CAAC;AAAjC,gCAAiC;AACzC,8BAAuC,iBAAiB,CAAC;AAAjD,gDAAiD;AACzD,IAAY,KAAK,WAAM,QAAQ,CAAC,CAAA;AACrB,YAAI,GAAG,KAAK,CAAC"}
\ No newline at end of file
diff --git a/dist/lib/umd.js b/dist/lib/umd.js
deleted file mode 100644
index 386521c..0000000
--- a/dist/lib/umd.js
+++ /dev/null
@@ -1,3040 +0,0 @@
-(function(f) {
-    if (typeof exports === "object" && typeof module !== "undefined") {
-        module.exports = f()
-    } else if (typeof define === "function" && define.amd) {
-        define([], f)
-    } else {
-        var g;
-        if (typeof window !== "undefined") {
-            g = window
-        } else if (typeof global !== "undefined") {
-            g = global
-        } else if (typeof self !== "undefined") {
-            g = self
-        } else {
-            g = this
-        }
-        g.listComponent = f()
-    }
-})(function() {
-        var define, module, exports;
-require=(function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})({1:[function(require,module,exports){
-"use strict";
-var util = require('./util');
-var Queue_1 = require('./Queue');
-var BSTree = (function () {
-    /**
-     * Creates an empty binary search tree.
-     * @class <p>A binary search tree is a binary tree in which each
-     * internal node stores an element such that the elements stored in the
-     * left subtree are less than it and the elements
-     * stored in the right subtree are greater.</p>
-     * <p>Formally, a binary search tree is a node-based binary tree data structure which
-     * has the following properties:</p>
-     * <ul>
-     * <li>The left subtree of a node contains only nodes with elements less
-     * than the node's element</li>
-     * <li>The right subtree of a node contains only nodes with elements greater
-     * than the node's element</li>
-     * <li>Both the left and right subtrees must also be binary search trees.</li>
-     * </ul>
-     * <p>If the inserted elements are custom objects a compare function must
-     * be provided at construction time, otherwise the <=, === and >= operators are
-     * used to compare elements. Example:</p>
-     * <pre>
-     * function compare(a, b) {
-     *  if (a is less than b by some ordering criterion) {
-     *     return -1;
-     *  } if (a is greater than b by the ordering criterion) {
-     *     return 1;
-     *  }
-     *  // a must be equal to b
-     *  return 0;
-     * }
-     * </pre>
-     * @constructor
-     * @param {function(Object,Object):number=} compareFunction optional
-     * function used to compare two elements. Must return a negative integer,
-     * zero, or a positive integer as the first argument is less than, equal to,
-     * or greater than the second.
-     */
-    function BSTree(compareFunction) {
-        this.root = null;
-        this.compare = compareFunction || util.defaultCompare;
-        this.nElements = 0;
-    }
-    /**
-     * Adds the specified element to this tree if it is not already present.
-     * @param {Object} element the element to insert.
-     * @return {boolean} true if this tree did not already contain the specified element.
-     */
-    BSTree.prototype.add = function (element) {
-        if (util.isUndefined(element)) {
-            return false;
-        }
-        if (this.insertNode(this.createNode(element)) !== null) {
-            this.nElements++;
-            return true;
-        }
-        return false;
-    };
-    /**
-     * Removes all of the elements from this tree.
-     */
-    BSTree.prototype.clear = function () {
-        this.root = null;
-        this.nElements = 0;
-    };
-    /**
-     * Returns true if this tree contains no elements.
-     * @return {boolean} true if this tree contains no elements.
-     */
-    BSTree.prototype.isEmpty = function () {
-        return this.nElements === 0;
-    };
-    /**
-     * Returns the number of elements in this tree.
-     * @return {number} the number of elements in this tree.
-     */
-    BSTree.prototype.size = function () {
-        return this.nElements;
-    };
-    /**
-     * Returns true if this tree contains the specified element.
-     * @param {Object} element element to search for.
-     * @return {boolean} true if this tree contains the specified element,
-     * false otherwise.
-     */
-    BSTree.prototype.contains = function (element) {
-        if (util.isUndefined(element)) {
-            return false;
-        }
-        return this.searchNode(this.root, element) !== null;
-    };
-    /**
-     * Removes the specified element from this tree if it is present.
-     * @return {boolean} true if this tree contained the specified element.
-     */
-    BSTree.prototype.remove = function (element) {
-        var node = this.searchNode(this.root, element);
-        if (node === null) {
-            return false;
-        }
-        this.removeNode(node);
-        this.nElements--;
-        return true;
-    };
-    /**
-     * Executes the provided function once for each element present in this tree in
-     * in-order.
-     * @param {function(Object):*} callback function to execute, it is invoked with one
-     * argument: the element value, to break the iteration you can optionally return false.
-     */
-    BSTree.prototype.inorderTraversal = function (callback) {
-        this.inorderTraversalAux(this.root, callback, {
-            stop: false
-        });
-    };
-    /**
-     * Executes the provided function once for each element present in this tree in pre-order.
-     * @param {function(Object):*} callback function to execute, it is invoked with one
-     * argument: the element value, to break the iteration you can optionally return false.
-     */
-    BSTree.prototype.preorderTraversal = function (callback) {
-        this.preorderTraversalAux(this.root, callback, {
-            stop: false
-        });
-    };
-    /**
-     * Executes the provided function once for each element present in this tree in post-order.
-     * @param {function(Object):*} callback function to execute, it is invoked with one
-     * argument: the element value, to break the iteration you can optionally return false.
-     */
-    BSTree.prototype.postorderTraversal = function (callback) {
-        this.postorderTraversalAux(this.root, callback, {
-            stop: false
-        });
-    };
-    /**
-     * Executes the provided function once for each element present in this tree in
-     * level-order.
-     * @param {function(Object):*} callback function to execute, it is invoked with one
-     * argument: the element value, to break the iteration you can optionally return false.
-     */
-    BSTree.prototype.levelTraversal = function (callback) {
-        this.levelTraversalAux(this.root, callback);
-    };
-    /**
-     * Returns the minimum element of this tree.
-     * @return {*} the minimum element of this tree or undefined if this tree is
-     * is empty.
-     */
-    BSTree.prototype.minimum = function () {
-        if (this.isEmpty()) {
-            return undefined;
-        }
-        return this.minimumAux(this.root).element;
-    };
-    /**
-     * Returns the maximum element of this tree.
-     * @return {*} the maximum element of this tree or undefined if this tree is
-     * is empty.
-     */
-    BSTree.prototype.maximum = function () {
-        if (this.isEmpty()) {
-            return undefined;
-        }
-        return this.maximumAux(this.root).element;
-    };
-    /**
-     * Executes the provided function once for each element present in this tree in inorder.
-     * Equivalent to inorderTraversal.
-     * @param {function(Object):*} callback function to execute, it is
-     * invoked with one argument: the element value, to break the iteration you can
-     * optionally return false.
-     */
-    BSTree.prototype.forEach = function (callback) {
-        this.inorderTraversal(callback);
-    };
-    /**
-     * Returns an array containing all of the elements in this tree in in-order.
-     * @return {Array} an array containing all of the elements in this tree in in-order.
-     */
-    BSTree.prototype.toArray = function () {
-        var array = [];
-        this.inorderTraversal(function (element) {
-            array.push(element);
-            return true;
-        });
-        return array;
-    };
-    /**
-     * Returns the height of this tree.
-     * @return {number} the height of this tree or -1 if is empty.
-     */
-    BSTree.prototype.height = function () {
-        return this.heightAux(this.root);
-    };
-    /**
-    * @private
-    */
-    BSTree.prototype.searchNode = function (node, element) {
-        var cmp = null;
-        while (node !== null && cmp !== 0) {
-            cmp = this.compare(element, node.element);
-            if (cmp < 0) {
-                node = node.leftCh;
-            }
-            else if (cmp > 0) {
-                node = node.rightCh;
-            }
-        }
-        return node;
-    };
-    /**
-    * @private
-    */
-    BSTree.prototype.transplant = function (n1, n2) {
-        if (n1.parent === null) {
-            this.root = n2;
-        }
-        else if (n1 === n1.parent.leftCh) {
-            n1.parent.leftCh = n2;
-        }
-        else {
-            n1.parent.rightCh = n2;
-        }
-        if (n2 !== null) {
-            n2.parent = n1.parent;
-        }
-    };
-    /**
-    * @private
-    */
-    BSTree.prototype.removeNode = function (node) {
-        if (node.leftCh === null) {
-            this.transplant(node, node.rightCh);
-        }
-        else if (node.rightCh === null) {
-            this.transplant(node, node.leftCh);
-        }
-        else {
-            var y = this.minimumAux(node.rightCh);
-            if (y.parent !== node) {
-                this.transplant(y, y.rightCh);
-                y.rightCh = node.rightCh;
-                y.rightCh.parent = y;
-            }
-            this.transplant(node, y);
-            y.leftCh = node.leftCh;
-            y.leftCh.parent = y;
-        }
-    };
-    /**
-    * @private
-    */
-    BSTree.prototype.inorderTraversalAux = function (node, callback, signal) {
-        if (node === null || signal.stop) {
-            return;
-        }
-        this.inorderTraversalAux(node.leftCh, callback, signal);
-        if (signal.stop) {
-            return;
-        }
-        signal.stop = callback(node.element) === false;
-        if (signal.stop) {
-            return;
-        }
-        this.inorderTraversalAux(node.rightCh, callback, signal);
-    };
-    /**
-    * @private
-    */
-    BSTree.prototype.levelTraversalAux = function (node, callback) {
-        var queue = new Queue_1.default();
-        if (node !== null) {
-            queue.enqueue(node);
-        }
-        while (!queue.isEmpty()) {
-            node = queue.dequeue();
-            if (callback(node.element) === false) {
-                return;
-            }
-            if (node.leftCh !== null) {
-                queue.enqueue(node.leftCh);
-            }
-            if (node.rightCh !== null) {
-                queue.enqueue(node.rightCh);
-            }
-        }
-    };
-    /**
-    * @private
-    */
-    BSTree.prototype.preorderTraversalAux = function (node, callback, signal) {
-        if (node === null || signal.stop) {
-            return;
-        }
-        signal.stop = callback(node.element) === false;
-        if (signal.stop) {
-            return;
-        }
-        this.preorderTraversalAux(node.leftCh, callback, signal);
-        if (signal.stop) {
-            return;
-        }
-        this.preorderTraversalAux(node.rightCh, callback, signal);
-    };
-    /**
-    * @private
-    */
-    BSTree.prototype.postorderTraversalAux = function (node, callback, signal) {
-        if (node === null || signal.stop) {
-            return;
-        }
-        this.postorderTraversalAux(node.leftCh, callback, signal);
-        if (signal.stop) {
-            return;
-        }
-        this.postorderTraversalAux(node.rightCh, callback, signal);
-        if (signal.stop) {
-            return;
-        }
-        signal.stop = callback(node.element) === false;
-    };
-    /**
-    * @private
-    */
-    BSTree.prototype.minimumAux = function (node) {
-        while (node.leftCh !== null) {
-            node = node.leftCh;
-        }
-        return node;
-    };
-    /**
-    * @private
-    */
-    BSTree.prototype.maximumAux = function (node) {
-        while (node.rightCh !== null) {
-            node = node.rightCh;
-        }
-        return node;
-    };
-    /**
-      * @private
-      */
-    BSTree.prototype.heightAux = function (node) {
-        if (node === null) {
-            return -1;
-        }
-        return Math.max(this.heightAux(node.leftCh), this.heightAux(node.rightCh)) + 1;
-    };
-    /*
-    * @private
-    */
-    BSTree.prototype.insertNode = function (node) {
-        var parent = null;
-        var position = this.root;
-        var cmp = null;
-        while (position !== null) {
-            cmp = this.compare(node.element, position.element);
-            if (cmp === 0) {
-                return null;
-            }
-            else if (cmp < 0) {
-                parent = position;
-                position = position.leftCh;
-            }
-            else {
-                parent = position;
-                position = position.rightCh;
-            }
-        }
-        node.parent = parent;
-        if (parent === null) {
-            // tree is empty
-            this.root = node;
-        }
-        else if (this.compare(node.element, parent.element) < 0) {
-            parent.leftCh = node;
-        }
-        else {
-            parent.rightCh = node;
-        }
-        return node;
-    };
-    /**
-    * @private
-    */
-    BSTree.prototype.createNode = function (element) {
-        return {
-            element: element,
-            leftCh: null,
-            rightCh: null,
-            parent: null
-        };
-    };
-    return BSTree;
-}());
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.default = BSTree;
-
-},{"./Queue":11,"./util":15}],2:[function(require,module,exports){
-"use strict";
-var util = require('./util');
-var Dictionary_1 = require('./Dictionary');
-var Set_1 = require('./Set');
-var Bag = (function () {
-    /**
-     * Creates an empty bag.
-     * @class <p>A bag is a special kind of set in which members are
-     * allowed to appear more than once.</p>
-     * <p>If the inserted elements are custom objects a function
-     * which converts elements to unique strings must be provided. Example:</p>
-     *
-     * <pre>
-     * function petToString(pet) {
-     *  return pet.name;
-     * }
-     * </pre>
-     *
-     * @constructor
-     * @param {function(Object):string=} toStrFunction optional function used
-     * to convert elements to strings. If the elements aren't strings or if toString()
-     * is not appropriate, a custom function which receives an object and returns a
-     * unique string must be provided.
-     */
-    function Bag(toStrFunction) {
-        this.toStrF = toStrFunction || util.defaultToString;
-        this.dictionary = new Dictionary_1.default(this.toStrF);
-        this.nElements = 0;
-    }
-    /**
-    * Adds nCopies of the specified object to this bag.
-    * @param {Object} element element to add.
-    * @param {number=} nCopies the number of copies to add, if this argument is
-    * undefined 1 copy is added.
-    * @return {boolean} true unless element is undefined.
-    */
-    Bag.prototype.add = function (element, nCopies) {
-        if (nCopies === void 0) { nCopies = 1; }
-        if (util.isUndefined(element) || nCopies <= 0) {
-            return false;
-        }
-        if (!this.contains(element)) {
-            var node = {
-                value: element,
-                copies: nCopies
-            };
-            this.dictionary.setValue(element, node);
-        }
-        else {
-            this.dictionary.getValue(element).copies += nCopies;
-        }
-        this.nElements += nCopies;
-        return true;
-    };
-    /**
-    * Counts the number of copies of the specified object in this bag.
-    * @param {Object} element the object to search for..
-    * @return {number} the number of copies of the object, 0 if not found
-    */
-    Bag.prototype.count = function (element) {
-        if (!this.contains(element)) {
-            return 0;
-        }
-        else {
-            return this.dictionary.getValue(element).copies;
-        }
-    };
-    /**
-     * Returns true if this bag contains the specified element.
-     * @param {Object} element element to search for.
-     * @return {boolean} true if this bag contains the specified element,
-     * false otherwise.
-     */
-    Bag.prototype.contains = function (element) {
-        return this.dictionary.containsKey(element);
-    };
-    /**
-    * Removes nCopies of the specified object to this bag.
-    * If the number of copies to remove is greater than the actual number
-    * of copies in the Bag, all copies are removed.
-    * @param {Object} element element to remove.
-    * @param {number=} nCopies the number of copies to remove, if this argument is
-    * undefined 1 copy is removed.
-    * @return {boolean} true if at least 1 element was removed.
-    */
-    Bag.prototype.remove = function (element, nCopies) {
-        if (nCopies === void 0) { nCopies = 1; }
-        if (util.isUndefined(element) || nCopies <= 0) {
-            return false;
-        }
-        if (!this.contains(element)) {
-            return false;
-        }
-        else {
-            var node = this.dictionary.getValue(element);
-            if (nCopies > node.copies) {
-                this.nElements -= node.copies;
-            }
-            else {
-                this.nElements -= nCopies;
-            }
-            node.copies -= nCopies;
-            if (node.copies <= 0) {
-                this.dictionary.remove(element);
-            }
-            return true;
-        }
-    };
-    /**
-     * Returns an array containing all of the elements in this big in arbitrary order,
-     * including multiple copies.
-     * @return {Array} an array containing all of the elements in this bag.
-     */
-    Bag.prototype.toArray = function () {
-        var a = [];
-        var values = this.dictionary.values();
-        for (var _i = 0, values_1 = values; _i < values_1.length; _i++) {
-            var node = values_1[_i];
-            var element = node.value;
-            var copies = node.copies;
-            for (var j = 0; j < copies; j++) {
-                a.push(element);
-            }
-        }
-        return a;
-    };
-    /**
-     * Returns a set of unique elements in this bag.
-     * @return {collections.Set<T>} a set of unique elements in this bag.
-     */
-    Bag.prototype.toSet = function () {
-        var toret = new Set_1.default(this.toStrF);
-        var elements = this.dictionary.values();
-        for (var _i = 0, elements_1 = elements; _i < elements_1.length; _i++) {
-            var ele = elements_1[_i];
-            var value = ele.value;
-            toret.add(value);
-        }
-        return toret;
-    };
-    /**
-     * Executes the provided function once for each element
-     * present in this bag, including multiple copies.
-     * @param {function(Object):*} callback function to execute, it is
-     * invoked with one argument: the element. To break the iteration you can
-     * optionally return false.
-     */
-    Bag.prototype.forEach = function (callback) {
-        this.dictionary.forEach(function (k, v) {
-            var value = v.value;
-            var copies = v.copies;
-            for (var i = 0; i < copies; i++) {
-                if (callback(value) === false) {
-                    return false;
-                }
-            }
-            return true;
-        });
-    };
-    /**
-     * Returns the number of elements in this bag.
-     * @return {number} the number of elements in this bag.
-     */
-    Bag.prototype.size = function () {
-        return this.nElements;
-    };
-    /**
-     * Returns true if this bag contains no elements.
-     * @return {boolean} true if this bag contains no elements.
-     */
-    Bag.prototype.isEmpty = function () {
-        return this.nElements === 0;
-    };
-    /**
-     * Removes all of the elements from this bag.
-     */
-    Bag.prototype.clear = function () {
-        this.nElements = 0;
-        this.dictionary.clear();
-    };
-    return Bag;
-}());
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.default = Bag; // End of bag
-
-},{"./Dictionary":3,"./Set":12,"./util":15}],3:[function(require,module,exports){
-"use strict";
-var util = require('./util');
-var Dictionary = (function () {
-    /**
-     * Creates an empty dictionary.
-     * @class <p>Dictionaries map keys to values; each key can map to at most one value.
-     * This implementation accepts any kind of objects as keys.</p>
-     *
-     * <p>If the keys are custom objects a function which converts keys to unique
-     * strings must be provided. Example:</p>
-     * <pre>
-     * function petToString(pet) {
-     *  return pet.name;
-     * }
-     * </pre>
-     * @constructor
-     * @param {function(Object):string=} toStrFunction optional function used
-     * to convert keys to strings. If the keys aren't strings or if toString()
-     * is not appropriate, a custom function which receives a key and returns a
-     * unique string must be provided.
-     */
-    function Dictionary(toStrFunction) {
-        this.table = {};
-        this.nElements = 0;
-        this.toStr = toStrFunction || util.defaultToString;
-    }
-    /**
-     * Returns the value to which this dictionary maps the specified key.
-     * Returns undefined if this dictionary contains no mapping for this key.
-     * @param {Object} key key whose associated value is to be returned.
-     * @return {*} the value to which this dictionary maps the specified key or
-     * undefined if the map contains no mapping for this key.
-     */
-    Dictionary.prototype.getValue = function (key) {
-        var pair = this.table['$' + this.toStr(key)];
-        if (util.isUndefined(pair)) {
-            return undefined;
-        }
-        return pair.value;
-    };
-    /**
-     * Associates the specified value with the specified key in this dictionary.
-     * If the dictionary previously contained a mapping for this key, the old
-     * value is replaced by the specified value.
-     * @param {Object} key key with which the specified value is to be
-     * associated.
-     * @param {Object} value value to be associated with the specified key.
-     * @return {*} previous value associated with the specified key, or undefined if
-     * there was no mapping for the key or if the key/value are undefined.
-     */
-    Dictionary.prototype.setValue = function (key, value) {
-        if (util.isUndefined(key) || util.isUndefined(value)) {
-            return undefined;
-        }
-        var ret;
-        var k = '$' + this.toStr(key);
-        var previousElement = this.table[k];
-        if (util.isUndefined(previousElement)) {
-            this.nElements++;
-            ret = undefined;
-        }
-        else {
-            ret = previousElement.value;
-        }
-        this.table[k] = {
-            key: key,
-            value: value
-        };
-        return ret;
-    };
-    /**
-     * Removes the mapping for this key from this dictionary if it is present.
-     * @param {Object} key key whose mapping is to be removed from the
-     * dictionary.
-     * @return {*} previous value associated with specified key, or undefined if
-     * there was no mapping for key.
-     */
-    Dictionary.prototype.remove = function (key) {
-        var k = '$' + this.toStr(key);
-        var previousElement = this.table[k];
-        if (!util.isUndefined(previousElement)) {
-            delete this.table[k];
-            this.nElements--;
-            return previousElement.value;
-        }
-        return undefined;
-    };
-    /**
-     * Returns an array containing all of the keys in this dictionary.
-     * @return {Array} an array containing all of the keys in this dictionary.
-     */
-    Dictionary.prototype.keys = function () {
-        var array = [];
-        for (var name_1 in this.table) {
-            if (util.has(this.table, name_1)) {
-                var pair = this.table[name_1];
-                array.push(pair.key);
-            }
-        }
-        return array;
-    };
-    /**
-     * Returns an array containing all of the values in this dictionary.
-     * @return {Array} an array containing all of the values in this dictionary.
-     */
-    Dictionary.prototype.values = function () {
-        var array = [];
-        for (var name_2 in this.table) {
-            if (util.has(this.table, name_2)) {
-                var pair = this.table[name_2];
-                array.push(pair.value);
-            }
-        }
-        return array;
-    };
-    /**
-    * Executes the provided function once for each key-value pair
-    * present in this dictionary.
-    * @param {function(Object,Object):*} callback function to execute, it is
-    * invoked with two arguments: key and value. To break the iteration you can
-    * optionally return false.
-    */
-    Dictionary.prototype.forEach = function (callback) {
-        for (var name_3 in this.table) {
-            if (util.has(this.table, name_3)) {
-                var pair = this.table[name_3];
-                var ret = callback(pair.key, pair.value);
-                if (ret === false) {
-                    return;
-                }
-            }
-        }
-    };
-    /**
-     * Returns true if this dictionary contains a mapping for the specified key.
-     * @param {Object} key key whose presence in this dictionary is to be
-     * tested.
-     * @return {boolean} true if this dictionary contains a mapping for the
-     * specified key.
-     */
-    Dictionary.prototype.containsKey = function (key) {
-        return !util.isUndefined(this.getValue(key));
-    };
-    /**
-    * Removes all mappings from this dictionary.
-    * @this {collections.Dictionary}
-    */
-    Dictionary.prototype.clear = function () {
-        this.table = {};
-        this.nElements = 0;
-    };
-    /**
-     * Returns the number of keys in this dictionary.
-     * @return {number} the number of key-value mappings in this dictionary.
-     */
-    Dictionary.prototype.size = function () {
-        return this.nElements;
-    };
-    /**
-     * Returns true if this dictionary contains no mappings.
-     * @return {boolean} true if this dictionary contains no mappings.
-     */
-    Dictionary.prototype.isEmpty = function () {
-        return this.nElements <= 0;
-    };
-    Dictionary.prototype.toString = function () {
-        var toret = '{';
-        this.forEach(function (k, v) {
-            toret += "\n\t" + k + " : " + v;
-        });
-        return toret + '\n}';
-    };
-    return Dictionary;
-}());
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.default = Dictionary; // End of dictionary
-
-},{"./util":15}],4:[function(require,module,exports){
-"use strict";
-var __extends = (this && this.__extends) || function (d, b) {
-    for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p];
-    function __() { this.constructor = d; }
-    d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
-};
-var Dictionary_1 = require('./Dictionary');
-var util = require('./util');
-var FactoryDictionary = (function (_super) {
-    __extends(FactoryDictionary, _super);
-    /**
-     * Creates an empty dictionary.
-     * @class <p>Dictionaries map keys to values; each key can map to at most one value.
-     * This implementation accepts any kind of objects as keys.</p>
-     *
-     * <p>The default factory function should return a new object of the provided
-     * type. Example:</p>
-     * <pre>
-     * function petFactory() {
-     *  return new Pet();
-     * }
-     * </pre>
-     *
-     * <p>If the keys are custom objects a function which converts keys to unique
-     * strings must be provided. Example:</p>
-     * <pre>
-     * function petToString(pet) {
-     *  return pet.name;
-     * }
-     * </pre>
-     * @constructor
-     * @param {function():V=} defaultFactoryFunction function used to create a
-     * default object.
-     * @param {function(Object):string=} toStrFunction optional function used
-     * to convert keys to strings. If the keys aren't strings or if toString()
-     * is not appropriate, a custom function which receives a key and returns a
-     * unique string must be provided.
-     */
-    function FactoryDictionary(defaultFactoryFunction, toStrFunction) {
-        _super.call(this, toStrFunction);
-        this.defaultFactoryFunction = defaultFactoryFunction;
-    }
-    /**
-     * Associates the specified default value with the specified key in this dictionary,
-     * if it didn't contain the key yet. If the key existed, the existing value will be used.
-     * @param {Object} key key with which the specified value is to be
-     * associated.
-     * @param {Object} defaultValue default value to be associated with the specified key.
-     * @return {*} previous value associated with the specified key, or the default value,
-     * if the key didn't exist yet.
-     */
-    FactoryDictionary.prototype.setDefault = function (key, defaultValue) {
-        var currentValue = _super.prototype.getValue.call(this, key);
-        if (util.isUndefined(currentValue)) {
-            this.setValue(key, defaultValue);
-            return defaultValue;
-        }
-        return currentValue;
-    };
-    /**
-     * Returns the value to which this dictionary maps the specified key.
-     * Returns a default value created by the factory passed in the constructor,
-     * if this dictionary contains no mapping for this key. The missing key will
-     * automatically be added to the dictionary.
-     * @param {Object} key key whose associated value is to be returned.
-     * @return {*} the value to which this dictionary maps the specified key or
-     * a default value if the map contains no mapping for this key.
-     */
-    FactoryDictionary.prototype.getValue = function (key) {
-        return this.setDefault(key, this.defaultFactoryFunction());
-    };
-    return FactoryDictionary;
-}(Dictionary_1.default));
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.default = FactoryDictionary;
-
-},{"./Dictionary":3,"./util":15}],5:[function(require,module,exports){
-"use strict";
-var collections = require('./util');
-var arrays = require('./arrays');
-var Heap = (function () {
-    /**
-     * Creates an empty Heap.
-     * @class
-     * <p>A heap is a binary tree, where the nodes maintain the heap property:
-     * each node is smaller than each of its children and therefore a MinHeap
-     * This implementation uses an array to store elements.</p>
-     * <p>If the inserted elements are custom objects a compare function must be provided,
-     *  at construction time, otherwise the <=, === and >= operators are
-     * used to compare elements. Example:</p>
-     *
-     * <pre>
-     * function compare(a, b) {
-     *  if (a is less than b by some ordering criterion) {
-     *     return -1;
-     *  } if (a is greater than b by the ordering criterion) {
-     *     return 1;
-     *  }
-     *  // a must be equal to b
-     *  return 0;
-     * }
-     * </pre>
-     *
-     * <p>If a Max-Heap is wanted (greater elements on top) you can a provide a
-     * reverse compare function to accomplish that behavior. Example:</p>
-     *
-     * <pre>
-     * function reverseCompare(a, b) {
-     *  if (a is less than b by some ordering criterion) {
-     *     return 1;
-     *  } if (a is greater than b by the ordering criterion) {
-     *     return -1;
-     *  }
-     *  // a must be equal to b
-     *  return 0;
-     * }
-     * </pre>
-     *
-     * @constructor
-     * @param {function(Object,Object):number=} compareFunction optional
-     * function used to compare two elements. Must return a negative integer,
-     * zero, or a positive integer as the first argument is less than, equal to,
-     * or greater than the second.
-     */
-    function Heap(compareFunction) {
-        /**
-         * Array used to store the elements od the heap.
-         * @type {Array.<Object>}
-         * @private
-         */
-        this.data = [];
-        this.compare = compareFunction || collections.defaultCompare;
-    }
-    /**
-     * Returns the index of the left child of the node at the given index.
-     * @param {number} nodeIndex The index of the node to get the left child
-     * for.
-     * @return {number} The index of the left child.
-     * @private
-     */
-    Heap.prototype.leftChildIndex = function (nodeIndex) {
-        return (2 * nodeIndex) + 1;
-    };
-    /**
-     * Returns the index of the right child of the node at the given index.
-     * @param {number} nodeIndex The index of the node to get the right child
-     * for.
-     * @return {number} The index of the right child.
-     * @private
-     */
-    Heap.prototype.rightChildIndex = function (nodeIndex) {
-        return (2 * nodeIndex) + 2;
-    };
-    /**
-     * Returns the index of the parent of the node at the given index.
-     * @param {number} nodeIndex The index of the node to get the parent for.
-     * @return {number} The index of the parent.
-     * @private
-     */
-    Heap.prototype.parentIndex = function (nodeIndex) {
-        return Math.floor((nodeIndex - 1) / 2);
-    };
-    /**
-     * Returns the index of the smaller child node (if it exists).
-     * @param {number} leftChild left child index.
-     * @param {number} rightChild right child index.
-     * @return {number} the index with the minimum value or -1 if it doesn't
-     * exists.
-     * @private
-     */
-    Heap.prototype.minIndex = function (leftChild, rightChild) {
-        if (rightChild >= this.data.length) {
-            if (leftChild >= this.data.length) {
-                return -1;
-            }
-            else {
-                return leftChild;
-            }
-        }
-        else {
-            if (this.compare(this.data[leftChild], this.data[rightChild]) <= 0) {
-                return leftChild;
-            }
-            else {
-                return rightChild;
-            }
-        }
-    };
-    /**
-     * Moves the node at the given index up to its proper place in the heap.
-     * @param {number} index The index of the node to move up.
-     * @private
-     */
-    Heap.prototype.siftUp = function (index) {
-        var parent = this.parentIndex(index);
-        while (index > 0 && this.compare(this.data[parent], this.data[index]) > 0) {
-            arrays.swap(this.data, parent, index);
-            index = parent;
-            parent = this.parentIndex(index);
-        }
-    };
-    /**
-     * Moves the node at the given index down to its proper place in the heap.
-     * @param {number} nodeIndex The index of the node to move down.
-     * @private
-     */
-    Heap.prototype.siftDown = function (nodeIndex) {
-        //smaller child index
-        var min = this.minIndex(this.leftChildIndex(nodeIndex), this.rightChildIndex(nodeIndex));
-        while (min >= 0 && this.compare(this.data[nodeIndex], this.data[min]) > 0) {
-            arrays.swap(this.data, min, nodeIndex);
-            nodeIndex = min;
-            min = this.minIndex(this.leftChildIndex(nodeIndex), this.rightChildIndex(nodeIndex));
-        }
-    };
-    /**
-     * Retrieves but does not remove the root element of this heap.
-     * @return {*} The value at the root of the heap. Returns undefined if the
-     * heap is empty.
-     */
-    Heap.prototype.peek = function () {
-        if (this.data.length > 0) {
-            return this.data[0];
-        }
-        else {
-            return undefined;
-        }
-    };
-    /**
-     * Adds the given element into the heap.
-     * @param {*} element the element.
-     * @return true if the element was added or fals if it is undefined.
-     */
-    Heap.prototype.add = function (element) {
-        if (collections.isUndefined(element)) {
-            return undefined;
-        }
-        this.data.push(element);
-        this.siftUp(this.data.length - 1);
-        return true;
-    };
-    /**
-     * Retrieves and removes the root element of this heap.
-     * @return {*} The value removed from the root of the heap. Returns
-     * undefined if the heap is empty.
-     */
-    Heap.prototype.removeRoot = function () {
-        if (this.data.length > 0) {
-            var obj = this.data[0];
-            this.data[0] = this.data[this.data.length - 1];
-            this.data.splice(this.data.length - 1, 1);
-            if (this.data.length > 0) {
-                this.siftDown(0);
-            }
-            return obj;
-        }
-        return undefined;
-    };
-    /**
-     * Returns true if this heap contains the specified element.
-     * @param {Object} element element to search for.
-     * @return {boolean} true if this Heap contains the specified element, false
-     * otherwise.
-     */
-    Heap.prototype.contains = function (element) {
-        var equF = collections.compareToEquals(this.compare);
-        return arrays.contains(this.data, element, equF);
-    };
-    /**
-     * Returns the number of elements in this heap.
-     * @return {number} the number of elements in this heap.
-     */
-    Heap.prototype.size = function () {
-        return this.data.length;
-    };
-    /**
-     * Checks if this heap is empty.
-     * @return {boolean} true if and only if this heap contains no items; false
-     * otherwise.
-     */
-    Heap.prototype.isEmpty = function () {
-        return this.data.length <= 0;
-    };
-    /**
-     * Removes all of the elements from this heap.
-     */
-    Heap.prototype.clear = function () {
-        this.data.length = 0;
-    };
-    /**
-     * Executes the provided function once for each element present in this heap in
-     * no particular order.
-     * @param {function(Object):*} callback function to execute, it is
-     * invoked with one argument: the element value, to break the iteration you can
-     * optionally return false.
-     */
-    Heap.prototype.forEach = function (callback) {
-        arrays.forEach(this.data, callback);
-    };
-    return Heap;
-}());
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.default = Heap;
-
-},{"./arrays":14,"./util":15}],6:[function(require,module,exports){
-"use strict";
-var __extends = (this && this.__extends) || function (d, b) {
-    for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p];
-    function __() { this.constructor = d; }
-    d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
-};
-var Dictionary_1 = require('./Dictionary');
-var util = require('./util');
-/**
- * This class is used by the LinkedDictionary Internally
- * Has to be a class, not an interface, because it needs to have
- * the 'unlink' function defined.
- */
-var LinkedDictionaryPair = (function () {
-    function LinkedDictionaryPair(key, value) {
-        this.key = key;
-        this.value = value;
-    }
-    LinkedDictionaryPair.prototype.unlink = function () {
-        this.prev.next = this.next;
-        this.next.prev = this.prev;
-    };
-    return LinkedDictionaryPair;
-}());
-var LinkedDictionary = (function (_super) {
-    __extends(LinkedDictionary, _super);
-    function LinkedDictionary(toStrFunction) {
-        _super.call(this, toStrFunction);
-        this.head = new LinkedDictionaryPair(null, null);
-        this.tail = new LinkedDictionaryPair(null, null);
-        this.head.next = this.tail;
-        this.tail.prev = this.head;
-    }
-    /**
-     * Inserts the new node to the 'tail' of the list, updating the
-     * neighbors, and moving 'this.tail' (the End of List indicator) that
-     * to the end.
-     */
-    LinkedDictionary.prototype.appendToTail = function (entry) {
-        var lastNode = this.tail.prev;
-        lastNode.next = entry;
-        entry.prev = lastNode;
-        entry.next = this.tail;
-        this.tail.prev = entry;
-    };
-    /**
-     * Retrieves a linked dictionary from the table internally
-     */
-    LinkedDictionary.prototype.getLinkedDictionaryPair = function (key) {
-        if (util.isUndefined(key)) {
-            return undefined;
-        }
-        var k = '$' + this.toStr(key);
-        var pair = (this.table[k]);
-        return pair;
-    };
-    /**
-     * Returns the value to which this dictionary maps the specified key.
-     * Returns undefined if this dictionary contains no mapping for this key.
-     * @param {Object} key key whose associated value is to be returned.
-     * @return {*} the value to which this dictionary maps the specified key or
-     * undefined if the map contains no mapping for this key.
-     */
-    LinkedDictionary.prototype.getValue = function (key) {
-        var pair = this.getLinkedDictionaryPair(key);
-        if (!util.isUndefined(pair)) {
-            return pair.value;
-        }
-        return undefined;
-    };
-    /**
-     * Removes the mapping for this key from this dictionary if it is present.
-     * Also, if a value is present for this key, the entry is removed from the
-     * insertion ordering.
-     * @param {Object} key key whose mapping is to be removed from the
-     * dictionary.
-     * @return {*} previous value associated with specified key, or undefined if
-     * there was no mapping for key.
-     */
-    LinkedDictionary.prototype.remove = function (key) {
-        var pair = this.getLinkedDictionaryPair(key);
-        if (!util.isUndefined(pair)) {
-            _super.prototype.remove.call(this, key); // This will remove it from the table
-            pair.unlink(); // This will unlink it from the chain
-            return pair.value;
-        }
-        return undefined;
-    };
-    /**
-    * Removes all mappings from this LinkedDictionary.
-    * @this {collections.LinkedDictionary}
-    */
-    LinkedDictionary.prototype.clear = function () {
-        _super.prototype.clear.call(this);
-        this.head.next = this.tail;
-        this.tail.prev = this.head;
-    };
-    /**
-     * Internal function used when updating an existing KeyValue pair.
-     * It places the new value indexed by key into the table, but maintains
-     * its place in the linked ordering.
-     */
-    LinkedDictionary.prototype.replace = function (oldPair, newPair) {
-        var k = '$' + this.toStr(newPair.key);
-        // set the new Pair's links to existingPair's links
-        newPair.next = oldPair.next;
-        newPair.prev = oldPair.prev;
-        // Delete Existing Pair from the table, unlink it from chain.
-        // As a result, the nElements gets decremented by this operation
-        this.remove(oldPair.key);
-        // Link new Pair in place of where oldPair was,
-        // by pointing the old pair's neighbors to it.
-        newPair.prev.next = newPair;
-        newPair.next.prev = newPair;
-        this.table[k] = newPair;
-        // To make up for the fact that the number of elements was decremented,
-        // We need to increase it by one.
-        ++this.nElements;
-    };
-    /**
-     * Associates the specified value with the specified key in this dictionary.
-     * If the dictionary previously contained a mapping for this key, the old
-     * value is replaced by the specified value.
-     * Updating of a key that already exists maintains its place in the
-     * insertion order into the map.
-     * @param {Object} key key with which the specified value is to be
-     * associated.
-     * @param {Object} value value to be associated with the specified key.
-     * @return {*} previous value associated with the specified key, or undefined if
-     * there was no mapping for the key or if the key/value are undefined.
-     */
-    LinkedDictionary.prototype.setValue = function (key, value) {
-        if (util.isUndefined(key) || util.isUndefined(value)) {
-            return undefined;
-        }
-        var existingPair = this.getLinkedDictionaryPair(key);
-        var newPair = new LinkedDictionaryPair(key, value);
-        var k = '$' + this.toStr(key);
-        // If there is already an element for that key, we
-        // keep it's place in the LinkedList
-        if (!util.isUndefined(existingPair)) {
-            this.replace(existingPair, newPair);
-            return existingPair.value;
-        }
-        else {
-            this.appendToTail(newPair);
-            this.table[k] = newPair;
-            ++this.nElements;
-            return undefined;
-        }
-    };
-    /**
-     * Returns an array containing all of the keys in this LinkedDictionary, ordered
-     * by insertion order.
-     * @return {Array} an array containing all of the keys in this LinkedDictionary,
-     * ordered by insertion order.
-     */
-    LinkedDictionary.prototype.keys = function () {
-        var array = [];
-        this.forEach(function (key, value) {
-            array.push(key);
-        });
-        return array;
-    };
-    /**
-     * Returns an array containing all of the values in this LinkedDictionary, ordered by
-     * insertion order.
-     * @return {Array} an array containing all of the values in this LinkedDictionary,
-     * ordered by insertion order.
-     */
-    LinkedDictionary.prototype.values = function () {
-        var array = [];
-        this.forEach(function (key, value) {
-            array.push(value);
-        });
-        return array;
-    };
-    /**
-    * Executes the provided function once for each key-value pair
-    * present in this LinkedDictionary. It is done in the order of insertion
-    * into the LinkedDictionary
-    * @param {function(Object,Object):*} callback function to execute, it is
-    * invoked with two arguments: key and value. To break the iteration you can
-    * optionally return false.
-    */
-    LinkedDictionary.prototype.forEach = function (callback) {
-        var crawlNode = this.head.next;
-        while (crawlNode.next != null) {
-            var ret = callback(crawlNode.key, crawlNode.value);
-            if (ret === false) {
-                return;
-            }
-            crawlNode = crawlNode.next;
-        }
-    };
-    return LinkedDictionary;
-}(Dictionary_1.default));
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.default = LinkedDictionary; // End of LinkedDictionary
-// /**
-//  * Returns true if this dictionary is equal to the given dictionary.
-//  * Two dictionaries are equal if they contain the same mappings.
-//  * @param {collections.Dictionary} other the other dictionary.
-//  * @param {function(Object,Object):boolean=} valuesEqualFunction optional
-//  * function used to check if two values are equal.
-//  * @return {boolean} true if this dictionary is equal to the given dictionary.
-//  */
-// collections.Dictionary.prototype.equals = function(other,valuesEqualFunction) {
-// 	const eqF = valuesEqualFunction || collections.defaultEquals;
-// 	if(!(other instanceof collections.Dictionary)){
-// 		return false;
-// 	}
-// 	if(this.size() !== other.size()){
-// 		return false;
-// 	}
-// 	return this.equalsAux(this.firstNode,other.firstNode,eqF);
-// }
-
-},{"./Dictionary":3,"./util":15}],7:[function(require,module,exports){
-"use strict";
-var util = require('./util');
-var arrays = require('./arrays');
-var LinkedList = (function () {
-    /**
-    * Creates an empty Linked List.
-    * @class A linked list is a data structure consisting of a group of nodes
-    * which together represent a sequence.
-    * @constructor
-    */
-    function LinkedList() {
-        /**
-        * First node in the list
-        * @type {Object}
-        * @private
-        */
-        this.firstNode = null;
-        /**
-        * Last node in the list
-        * @type {Object}
-        * @private
-        */
-        this.lastNode = null;
-        /**
-        * Number of elements in the list
-        * @type {number}
-        * @private
-        */
-        this.nElements = 0;
-    }
-    /**
-    * Adds an element to this list.
-    * @param {Object} item element to be added.
-    * @param {number=} index optional index to add the element. If no index is specified
-    * the element is added to the end of this list.
-    * @return {boolean} true if the element was added or false if the index is invalid
-    * or if the element is undefined.
-    */
-    LinkedList.prototype.add = function (item, index) {
-        if (util.isUndefined(index)) {
-            index = this.nElements;
-        }
-        if (index < 0 || index > this.nElements || util.isUndefined(item)) {
-            return false;
-        }
-        var newNode = this.createNode(item);
-        if (this.nElements === 0) {
-            // First node in the list.
-            this.firstNode = newNode;
-            this.lastNode = newNode;
-        }
-        else if (index === this.nElements) {
-            // Insert at the end.
-            this.lastNode.next = newNode;
-            this.lastNode = newNode;
-        }
-        else if (index === 0) {
-            // Change first node.
-            newNode.next = this.firstNode;
-            this.firstNode = newNode;
-        }
-        else {
-            var prev = this.nodeAtIndex(index - 1);
-            newNode.next = prev.next;
-            prev.next = newNode;
-        }
-        this.nElements++;
-        return true;
-    };
-    /**
-    * Returns the first element in this list.
-    * @return {*} the first element of the list or undefined if the list is
-    * empty.
-    */
-    LinkedList.prototype.first = function () {
-        if (this.firstNode !== null) {
-            return this.firstNode.element;
-        }
-        return undefined;
-    };
-    /**
-    * Returns the last element in this list.
-    * @return {*} the last element in the list or undefined if the list is
-    * empty.
-    */
-    LinkedList.prototype.last = function () {
-        if (this.lastNode !== null) {
-            return this.lastNode.element;
-        }
-        return undefined;
-    };
-    /**
-     * Returns the element at the specified position in this list.
-     * @param {number} index desired index.
-     * @return {*} the element at the given index or undefined if the index is
-     * out of bounds.
-     */
-    LinkedList.prototype.elementAtIndex = function (index) {
-        var node = this.nodeAtIndex(index);
-        if (node === null) {
-            return undefined;
-        }
-        return node.element;
-    };
-    /**
-     * Returns the index in this list of the first occurrence of the
-     * specified element, or -1 if the List does not contain this element.
-     * <p>If the elements inside this list are
-     * not comparable with the === operator a custom equals function should be
-     * provided to perform searches, the function must receive two arguments and
-     * return true if they are equal, false otherwise. Example:</p>
-     *
-     * <pre>
-     * const petsAreEqualByName = function(pet1, pet2) {
-     *  return pet1.name === pet2.name;
-     * }
-     * </pre>
-     * @param {Object} item element to search for.
-     * @param {function(Object,Object):boolean=} equalsFunction Optional
-     * function used to check if two elements are equal.
-     * @return {number} the index in this list of the first occurrence
-     * of the specified element, or -1 if this list does not contain the
-     * element.
-     */
-    LinkedList.prototype.indexOf = function (item, equalsFunction) {
-        var equalsF = equalsFunction || util.defaultEquals;
-        if (util.isUndefined(item)) {
-            return -1;
-        }
-        var currentNode = this.firstNode;
-        var index = 0;
-        while (currentNode !== null) {
-            if (equalsF(currentNode.element, item)) {
-                return index;
-            }
-            index++;
-            currentNode = currentNode.next;
-        }
-        return -1;
-    };
-    /**
-       * Returns true if this list contains the specified element.
-       * <p>If the elements inside the list are
-       * not comparable with the === operator a custom equals function should be
-       * provided to perform searches, the function must receive two arguments and
-       * return true if they are equal, false otherwise. Example:</p>
-       *
-       * <pre>
-       * const petsAreEqualByName = function(pet1, pet2) {
-       *  return pet1.name === pet2.name;
-       * }
-       * </pre>
-       * @param {Object} item element to search for.
-       * @param {function(Object,Object):boolean=} equalsFunction Optional
-       * function used to check if two elements are equal.
-       * @return {boolean} true if this list contains the specified element, false
-       * otherwise.
-       */
-    LinkedList.prototype.contains = function (item, equalsFunction) {
-        return (this.indexOf(item, equalsFunction) >= 0);
-    };
-    /**
-     * Removes the first occurrence of the specified element in this list.
-     * <p>If the elements inside the list are
-     * not comparable with the === operator a custom equals function should be
-     * provided to perform searches, the function must receive two arguments and
-     * return true if they are equal, false otherwise. Example:</p>
-     *
-     * <pre>
-     * const petsAreEqualByName = function(pet1, pet2) {
-     *  return pet1.name === pet2.name;
-     * }
-     * </pre>
-     * @param {Object} item element to be removed from this list, if present.
-     * @return {boolean} true if the list contained the specified element.
-     */
-    LinkedList.prototype.remove = function (item, equalsFunction) {
-        var equalsF = equalsFunction || util.defaultEquals;
-        if (this.nElements < 1 || util.isUndefined(item)) {
-            return false;
-        }
-        var previous = null;
-        var currentNode = this.firstNode;
-        while (currentNode !== null) {
-            if (equalsF(currentNode.element, item)) {
-                if (currentNode === this.firstNode) {
-                    this.firstNode = this.firstNode.next;
-                    if (currentNode === this.lastNode) {
-                        this.lastNode = null;
-                    }
-                }
-                else if (currentNode === this.lastNode) {
-                    this.lastNode = previous;
-                    previous.next = currentNode.next;
-                    currentNode.next = null;
-                }
-                else {
-                    previous.next = currentNode.next;
-                    currentNode.next = null;
-                }
-                this.nElements--;
-                return true;
-            }
-            previous = currentNode;
-            currentNode = currentNode.next;
-        }
-        return false;
-    };
-    /**
-     * Removes all of the elements from this list.
-     */
-    LinkedList.prototype.clear = function () {
-        this.firstNode = null;
-        this.lastNode = null;
-        this.nElements = 0;
-    };
-    /**
-     * Returns true if this list is equal to the given list.
-     * Two lists are equal if they have the same elements in the same order.
-     * @param {LinkedList} other the other list.
-     * @param {function(Object,Object):boolean=} equalsFunction optional
-     * function used to check if two elements are equal. If the elements in the lists
-     * are custom objects you should provide a function, otherwise
-     * the === operator is used to check equality between elements.
-     * @return {boolean} true if this list is equal to the given list.
-     */
-    LinkedList.prototype.equals = function (other, equalsFunction) {
-        var eqF = equalsFunction || util.defaultEquals;
-        if (!(other instanceof LinkedList)) {
-            return false;
-        }
-        if (this.size() !== other.size()) {
-            return false;
-        }
-        return this.equalsAux(this.firstNode, other.firstNode, eqF);
-    };
-    /**
-    * @private
-    */
-    LinkedList.prototype.equalsAux = function (n1, n2, eqF) {
-        while (n1 !== null) {
-            if (!eqF(n1.element, n2.element)) {
-                return false;
-            }
-            n1 = n1.next;
-            n2 = n2.next;
-        }
-        return true;
-    };
-    /**
-     * Removes the element at the specified position in this list.
-     * @param {number} index given index.
-     * @return {*} removed element or undefined if the index is out of bounds.
-     */
-    LinkedList.prototype.removeElementAtIndex = function (index) {
-        if (index < 0 || index >= this.nElements) {
-            return undefined;
-        }
-        var element;
-        if (this.nElements === 1) {
-            //First node in the list.
-            element = this.firstNode.element;
-            this.firstNode = null;
-            this.lastNode = null;
-        }
-        else {
-            var previous = this.nodeAtIndex(index - 1);
-            if (previous === null) {
-                element = this.firstNode.element;
-                this.firstNode = this.firstNode.next;
-            }
-            else if (previous.next === this.lastNode) {
-                element = this.lastNode.element;
-                this.lastNode = previous;
-            }
-            if (previous !== null) {
-                element = previous.next.element;
-                previous.next = previous.next.next;
-            }
-        }
-        this.nElements--;
-        return element;
-    };
-    /**
-     * Executes the provided function once for each element present in this list in order.
-     * @param {function(Object):*} callback function to execute, it is
-     * invoked with one argument: the element value, to break the iteration you can
-     * optionally return false.
-     */
-    LinkedList.prototype.forEach = function (callback) {
-        var currentNode = this.firstNode;
-        while (currentNode !== null) {
-            if (callback(currentNode.element) === false) {
-                break;
-            }
-            currentNode = currentNode.next;
-        }
-    };
-    /**
-     * Reverses the order of the elements in this linked list (makes the last
-     * element first, and the first element last).
-     */
-    LinkedList.prototype.reverse = function () {
-        var previous = null;
-        var current = this.firstNode;
-        var temp = null;
-        while (current !== null) {
-            temp = current.next;
-            current.next = previous;
-            previous = current;
-            current = temp;
-        }
-        temp = this.firstNode;
-        this.firstNode = this.lastNode;
-        this.lastNode = temp;
-    };
-    /**
-     * Returns an array containing all of the elements in this list in proper
-     * sequence.
-     * @return {Array.<*>} an array containing all of the elements in this list,
-     * in proper sequence.
-     */
-    LinkedList.prototype.toArray = function () {
-        var array = [];
-        var currentNode = this.firstNode;
-        while (currentNode !== null) {
-            array.push(currentNode.element);
-            currentNode = currentNode.next;
-        }
-        return array;
-    };
-    /**
-     * Returns the number of elements in this list.
-     * @return {number} the number of elements in this list.
-     */
-    LinkedList.prototype.size = function () {
-        return this.nElements;
-    };
-    /**
-     * Returns true if this list contains no elements.
-     * @return {boolean} true if this list contains no elements.
-     */
-    LinkedList.prototype.isEmpty = function () {
-        return this.nElements <= 0;
-    };
-    LinkedList.prototype.toString = function () {
-        return arrays.toString(this.toArray());
-    };
-    /**
-     * @private
-     */
-    LinkedList.prototype.nodeAtIndex = function (index) {
-        if (index < 0 || index >= this.nElements) {
-            return null;
-        }
-        if (index === (this.nElements - 1)) {
-            return this.lastNode;
-        }
-        var node = this.firstNode;
-        for (var i = 0; i < index; i++) {
-            node = node.next;
-        }
-        return node;
-    };
-    /**
-     * @private
-     */
-    LinkedList.prototype.createNode = function (item) {
-        return {
-            element: item,
-            next: null
-        };
-    };
-    return LinkedList;
-}());
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.default = LinkedList; // End of linked list
-
-},{"./arrays":14,"./util":15}],8:[function(require,module,exports){
-"use strict";
-var util = require('./util');
-var Dictionary_1 = require('./Dictionary');
-var arrays = require('./arrays');
-var MultiDictionary = (function () {
-    /**
-     * Creates an empty multi dictionary.
-     * @class <p>A multi dictionary is a special kind of dictionary that holds
-     * multiple values against each key. Setting a value into the dictionary will
-     * add the value to an array at that key. Getting a key will return an array,
-     * holding all the values set to that key.
-     * You can configure to allow duplicates in the values.
-     * This implementation accepts any kind of objects as keys.</p>
-     *
-     * <p>If the keys are custom objects a function which converts keys to strings must be
-     * provided. Example:</p>
-     *
-     * <pre>
-     * function petToString(pet) {
-       *  return pet.name;
-       * }
-     * </pre>
-     * <p>If the values are custom objects a function to check equality between values
-     * must be provided. Example:</p>
-     *
-     * <pre>
-     * function petsAreEqualByAge(pet1,pet2) {
-       *  return pet1.age===pet2.age;
-       * }
-     * </pre>
-     * @constructor
-     * @param {function(Object):string=} toStrFunction optional function
-     * to convert keys to strings. If the keys aren't strings or if toString()
-     * is not appropriate, a custom function which receives a key and returns a
-     * unique string must be provided.
-     * @param {function(Object,Object):boolean=} valuesEqualsFunction optional
-     * function to check if two values are equal.
-     *
-     * @param allowDuplicateValues
-     */
-    function MultiDictionary(toStrFunction, valuesEqualsFunction, allowDuplicateValues) {
-        if (allowDuplicateValues === void 0) { allowDuplicateValues = false; }
-        this.dict = new Dictionary_1.default(toStrFunction);
-        this.equalsF = valuesEqualsFunction || util.defaultEquals;
-        this.allowDuplicate = allowDuplicateValues;
-    }
-    /**
-    * Returns an array holding the values to which this dictionary maps
-    * the specified key.
-    * Returns an empty array if this dictionary contains no mappings for this key.
-    * @param {Object} key key whose associated values are to be returned.
-    * @return {Array} an array holding the values to which this dictionary maps
-    * the specified key.
-    */
-    MultiDictionary.prototype.getValue = function (key) {
-        var values = this.dict.getValue(key);
-        if (util.isUndefined(values)) {
-            return [];
-        }
-        return arrays.copy(values);
-    };
-    /**
-     * Adds the value to the array associated with the specified key, if
-     * it is not already present.
-     * @param {Object} key key with which the specified value is to be
-     * associated.
-     * @param {Object} value the value to add to the array at the key
-     * @return {boolean} true if the value was not already associated with that key.
-     */
-    MultiDictionary.prototype.setValue = function (key, value) {
-        if (util.isUndefined(key) || util.isUndefined(value)) {
-            return false;
-        }
-        if (!this.containsKey(key)) {
-            this.dict.setValue(key, [value]);
-            return true;
-        }
-        var array = this.dict.getValue(key);
-        if (!this.allowDuplicate) {
-            if (arrays.contains(array, value, this.equalsF)) {
-                return false;
-            }
-        }
-        array.push(value);
-        return true;
-    };
-    /**
-     * Removes the specified values from the array of values associated with the
-     * specified key. If a value isn't given, all values associated with the specified
-     * key are removed.
-     * @param {Object} key key whose mapping is to be removed from the
-     * dictionary.
-     * @param {Object=} value optional argument to specify the value to remove
-     * from the array associated with the specified key.
-     * @return {*} true if the dictionary changed, false if the key doesn't exist or
-     * if the specified value isn't associated with the specified key.
-     */
-    MultiDictionary.prototype.remove = function (key, value) {
-        if (util.isUndefined(value)) {
-            var v = this.dict.remove(key);
-            return !util.isUndefined(v);
-        }
-        var array = this.dict.getValue(key);
-        if (arrays.remove(array, value, this.equalsF)) {
-            if (array.length === 0) {
-                this.dict.remove(key);
-            }
-            return true;
-        }
-        return false;
-    };
-    /**
-     * Returns an array containing all of the keys in this dictionary.
-     * @return {Array} an array containing all of the keys in this dictionary.
-     */
-    MultiDictionary.prototype.keys = function () {
-        return this.dict.keys();
-    };
-    /**
-     * Returns an array containing all of the values in this dictionary.
-     * @return {Array} an array containing all of the values in this dictionary.
-     */
-    MultiDictionary.prototype.values = function () {
-        var values = this.dict.values();
-        var array = [];
-        for (var _i = 0, values_1 = values; _i < values_1.length; _i++) {
-            var v = values_1[_i];
-            for (var _a = 0, v_1 = v; _a < v_1.length; _a++) {
-                var w = v_1[_a];
-                array.push(w);
-            }
-        }
-        return array;
-    };
-    /**
-     * Returns true if this dictionary at least one value associatted the specified key.
-     * @param {Object} key key whose presence in this dictionary is to be
-     * tested.
-     * @return {boolean} true if this dictionary at least one value associatted
-     * the specified key.
-     */
-    MultiDictionary.prototype.containsKey = function (key) {
-        return this.dict.containsKey(key);
-    };
-    /**
-     * Removes all mappings from this dictionary.
-     */
-    MultiDictionary.prototype.clear = function () {
-        this.dict.clear();
-    };
-    /**
-     * Returns the number of keys in this dictionary.
-     * @return {number} the number of key-value mappings in this dictionary.
-     */
-    MultiDictionary.prototype.size = function () {
-        return this.dict.size();
-    };
-    /**
-     * Returns true if this dictionary contains no mappings.
-     * @return {boolean} true if this dictionary contains no mappings.
-     */
-    MultiDictionary.prototype.isEmpty = function () {
-        return this.dict.isEmpty();
-    };
-    return MultiDictionary;
-}());
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.default = MultiDictionary; // end of multi dictionary
-
-},{"./Dictionary":3,"./arrays":14,"./util":15}],9:[function(require,module,exports){
-"use strict";
-(function (Direction) {
-    Direction[Direction["BEFORE"] = 0] = "BEFORE";
-    Direction[Direction["AFTER"] = 1] = "AFTER";
-    Direction[Direction["INSIDE_AT_END"] = 2] = "INSIDE_AT_END";
-    Direction[Direction["INSIDE_AT_START"] = 3] = "INSIDE_AT_START";
-})(exports.Direction || (exports.Direction = {}));
-var Direction = exports.Direction;
-var MultiRootTree = (function () {
-    function MultiRootTree(rootIds, nodes) {
-        if (rootIds === void 0) { rootIds = []; }
-        if (nodes === void 0) { nodes = {}; }
-        this.rootIds = rootIds;
-        this.nodes = nodes;
-    }
-    MultiRootTree.prototype.getRootIds = function () {
-        var clone = this.rootIds.slice();
-        return clone;
-    };
-    MultiRootTree.prototype.getNodes = function () {
-        var clone = {};
-        for (var nodeKey in this.nodes) {
-            if (this.nodes.hasOwnProperty(nodeKey)) {
-                clone[nodeKey] = this.nodes[nodeKey].slice();
-            }
-        }
-        return clone;
-    };
-    MultiRootTree.prototype.getObject = function () {
-        return {
-            rootIds: this.getRootIds(),
-            nodes: this.getNodes(),
-        };
-    };
-    MultiRootTree.prototype.moveIdBeforeId = function (moveId, beforeId) {
-        return this.moveId(moveId, beforeId, Direction.BEFORE);
-    };
-    MultiRootTree.prototype.moveIdAfterId = function (moveId, afterId) {
-        return this.moveId(moveId, afterId, Direction.AFTER);
-    };
-    MultiRootTree.prototype.moveIdIntoId = function (moveId, insideId, atStart) {
-        if (atStart === void 0) { atStart = true; }
-        if (atStart) {
-            return this.moveId(moveId, insideId, Direction.INSIDE_AT_START);
-        }
-        else {
-            return this.moveId(moveId, insideId, Direction.INSIDE_AT_END);
-        }
-    };
-    MultiRootTree.prototype.deleteId = function (id) {
-        this.rootDeleteId(id);
-        this.nodeAndSubNodesDelete(id);
-        this.nodeRefrencesDelete(id);
-    };
-    MultiRootTree.prototype.insertIdBeforeId = function (beforeId, insertId) {
-        var foundRootIdIndex = this.findRootId(beforeId);
-        if (foundRootIdIndex > -1) {
-            this.insertIdIntoRoot(insertId, foundRootIdIndex);
-        }
-        for (var nodeKey in this.nodes) {
-            if (this.nodes.hasOwnProperty(nodeKey)) {
-                var foundNodeIdIndex = this.findNodeId(nodeKey, beforeId);
-                if (foundNodeIdIndex > -1) {
-                    this.insertIdIntoNode(nodeKey, insertId, foundNodeIdIndex);
-                }
-            }
-        }
-    };
-    MultiRootTree.prototype.insertIdAfterId = function (belowId, insertId) {
-        var foundRootIdIndex = this.findRootId(belowId);
-        if (foundRootIdIndex > -1) {
-            this.insertIdIntoRoot(insertId, foundRootIdIndex + 1);
-        }
-        for (var nodeKey in this.nodes) {
-            if (this.nodes.hasOwnProperty(nodeKey)) {
-                var foundNodeIdIndex = this.findNodeId(nodeKey, belowId);
-                if (foundNodeIdIndex > -1) {
-                    this.insertIdIntoNode(nodeKey, insertId, foundNodeIdIndex + 1);
-                }
-            }
-        }
-    };
-    MultiRootTree.prototype.insertIdIntoId = function (insideId, insertId) {
-        this.nodeInsertAtEnd(insideId, insertId);
-        this.nodes[insertId] = [];
-    };
-    MultiRootTree.prototype.insertIdIntoRoot = function (id, position) {
-        if (position === undefined) {
-            this.rootInsertAtEnd(id);
-        }
-        else {
-            if (position < 0) {
-                var length_1 = this.rootIds.length;
-                this.rootIds.splice((position + length_1 + 1), 0, id);
-            }
-            else {
-                this.rootIds.splice(position, 0, id);
-            }
-        }
-        this.nodes[id] = this.nodes[id] || [];
-    };
-    MultiRootTree.prototype.insertIdIntoNode = function (nodeKey, id, position) {
-        this.nodes[nodeKey] = this.nodes[nodeKey] || [];
-        this.nodes[id] = this.nodes[id] || [];
-        if (position === undefined) {
-            this.nodeInsertAtEnd(nodeKey, id);
-        }
-        else {
-            if (position < 0) {
-                var length_2 = this.nodes[nodeKey].length;
-                this.nodes[nodeKey].splice((position + length_2 + 1), 0, id);
-            }
-            else {
-                this.nodes[nodeKey].splice(position, 0, id);
-            }
-        }
-    };
-    MultiRootTree.prototype.moveId = function (moveId, beforeId, direction) {
-        var sourceId = moveId;
-        var sourceRootIndex = this.findRootId(sourceId);
-        var sourceNodeKey;
-        var sourceNodeIdIndex;
-        if (this.nodes[beforeId]) {
-            sourceNodeKey = beforeId;
-        }
-        for (var nodeKey in this.nodes) {
-            if (this.nodes.hasOwnProperty(nodeKey)) {
-                sourceNodeIdIndex = this.findNodeId(nodeKey, beforeId);
-                break;
-            }
-        }
-        // got all
-        var targetId = beforeId;
-        var targetRootIndex = this.findRootId(targetId);
-        var targetNodeKey;
-        var targetNodeIdIndex;
-        if (this.nodes[beforeId]) {
-            targetNodeKey = beforeId;
-        }
-        for (var nodeKey in this.nodes) {
-            if (this.nodes.hasOwnProperty(nodeKey)) {
-                targetNodeIdIndex = this.findNodeId(nodeKey, beforeId);
-                break;
-            }
-        }
-        // got all
-        if (sourceRootIndex > -1) {
-            if (targetRootIndex > -1) {
-                this.rootDelete(sourceRootIndex);
-                switch (direction) {
-                    case Direction.BEFORE:
-                        this.insertIdIntoRoot(sourceId, targetRootIndex);
-                        break;
-                    case Direction.AFTER:
-                        this.insertIdIntoRoot(sourceId, targetRootIndex + 1);
-                        break;
-                    case Direction.INSIDE_AT_START:
-                        this.nodeInsertAtStart(targetId, sourceId);
-                        break;
-                    case Direction.INSIDE_AT_END:
-                        this.nodeInsertAtEnd(targetId, sourceId);
-                        break;
-                }
-            }
-            else {
-                // moving root (source) ABOVE node (target)
-                // will remove one entry from roots
-                this.rootDelete(sourceRootIndex);
-                for (var nodeKey in this.nodes) {
-                    if (this.nodes.hasOwnProperty(nodeKey)) {
-                        var index = this.findNodeId(nodeKey, targetId);
-                        if (index > -1) {
-                            switch (direction) {
-                                case Direction.BEFORE:
-                                    this.insertIdIntoNode(nodeKey, sourceId, index);
-                                    break;
-                                case Direction.AFTER:
-                                    this.insertIdIntoNode(nodeKey, sourceId, index + 1);
-                                    break;
-                                case Direction.INSIDE_AT_START:
-                                    this.nodeInsertAtStart(targetId, sourceId);
-                                    break;
-                                case Direction.INSIDE_AT_END:
-                                    this.nodeInsertAtEnd(targetId, sourceId);
-                                    break;
-                            }
-                            break;
-                        }
-                    }
-                }
-            }
-        }
-        else {
-            if (targetRootIndex > -1) {
-                // moving node (source) ABOVE root (target)
-                // delete source id from each node
-                for (var nodeKey in this.nodes) {
-                    if (this.nodes.hasOwnProperty(nodeKey)) {
-                        var index = this.findNodeId(nodeKey, sourceId);
-                        if (index > -1) {
-                            // this.nodeInsertId(nodeKey, sourceId, index);
-                            this.nodeDeleteAtIndex(nodeKey, index);
-                            break;
-                        }
-                    }
-                }
-                switch (direction) {
-                    case Direction.BEFORE:
-                        this.insertIdIntoRoot(sourceId, targetRootIndex);
-                        break;
-                    case Direction.AFTER:
-                        this.insertIdIntoRoot(sourceId, targetRootIndex + 1);
-                        break;
-                    case Direction.INSIDE_AT_START:
-                        this.nodeInsertAtStart(targetId, sourceId);
-                        break;
-                    case Direction.INSIDE_AT_END:
-                        this.nodeInsertAtEnd(targetId, sourceId);
-                        break;
-                }
-            }
-            else {
-                // moving node (source) ABOVE node (target)
-                // delete source id from each node
-                for (var nodeKey in this.nodes) {
-                    if (this.nodes.hasOwnProperty(nodeKey)) {
-                        var index = this.findNodeId(nodeKey, sourceId);
-                        if (index > -1) {
-                            this.nodeDeleteAtIndex(nodeKey, index);
-                            break;
-                        }
-                    }
-                }
-                for (var nodeKey in this.nodes) {
-                    if (this.nodes.hasOwnProperty(nodeKey)) {
-                        var index = this.findNodeId(nodeKey, targetId);
-                        if (index > -1) {
-                            switch (direction) {
-                                case Direction.BEFORE:
-                                    this.insertIdIntoNode(nodeKey, sourceId, index);
-                                    break;
-                                case Direction.AFTER:
-                                    this.insertIdIntoNode(nodeKey, sourceId, index + 1);
-                                    break;
-                                case Direction.INSIDE_AT_START:
-                                    this.nodeInsertAtStart(targetId, sourceId);
-                                    break;
-                                case Direction.INSIDE_AT_END:
-                                    this.nodeInsertAtEnd(targetId, sourceId);
-                                    break;
-                            }
-                            break;
-                        }
-                    }
-                }
-            }
-        }
-    };
-    MultiRootTree.prototype.swapArrayElements = function (arr, indexA, indexB) {
-        var temp = arr[indexA];
-        arr[indexA] = arr[indexB];
-        arr[indexB] = temp;
-        return arr;
-    };
-    ;
-    MultiRootTree.prototype.rootDeleteId = function (id) {
-        var index = this.findRootId(id);
-        if (index > -1) {
-            this.rootDelete(index);
-        }
-    };
-    MultiRootTree.prototype.nodeAndSubNodesDelete = function (nodeKey) {
-        var toDeleteLater = [];
-        for (var i = 0; i < this.nodes[nodeKey].length; i++) {
-            var id = this.nodes[nodeKey][i];
-            this.nodeAndSubNodesDelete(id);
-            toDeleteLater.push(nodeKey);
-        }
-        this.nodeDelete(nodeKey);
-        for (var i = 0; i < toDeleteLater.length; i++) {
-            this.nodeDelete(toDeleteLater[i]);
-        }
-    };
-    MultiRootTree.prototype.nodeRefrencesDelete = function (id) {
-        for (var nodeKey in this.nodes) {
-            if (this.nodes.hasOwnProperty(nodeKey)) {
-                for (var i = 0; i < this.nodes[nodeKey].length; i++) {
-                    var targetId = this.nodes[nodeKey][i];
-                    if (targetId === id) {
-                        this.nodeDeleteAtIndex(nodeKey, i);
-                    }
-                }
-            }
-        }
-    };
-    MultiRootTree.prototype.nodeDelete = function (nodeKey) {
-        delete this.nodes[nodeKey];
-    };
-    MultiRootTree.prototype.findRootId = function (id) {
-        return this.rootIds.indexOf(id);
-    };
-    MultiRootTree.prototype.findNodeId = function (nodeKey, id) {
-        return this.nodes[nodeKey].indexOf(id);
-    };
-    MultiRootTree.prototype.findNode = function (nodeKey) {
-        return this.nodes[nodeKey];
-    };
-    MultiRootTree.prototype.nodeInsertAtStart = function (nodeKey, id) {
-        this.nodes[nodeKey].unshift(id);
-    };
-    MultiRootTree.prototype.nodeInsertAtEnd = function (nodeKey, id) {
-        this.nodes[nodeKey].push(id);
-    };
-    MultiRootTree.prototype.rootDelete = function (index) {
-        this.rootIds.splice(index, 1);
-    };
-    MultiRootTree.prototype.nodeDeleteAtIndex = function (nodeKey, index) {
-        this.nodes[nodeKey].splice(index, 1);
-    };
-    MultiRootTree.prototype.rootInsertAtStart = function (id) {
-        this.rootIds.unshift(id);
-    };
-    MultiRootTree.prototype.rootInsertAtEnd = function (id) {
-        this.rootIds.push(id);
-    };
-    return MultiRootTree;
-}());
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.default = MultiRootTree;
-
-},{}],10:[function(require,module,exports){
-"use strict";
-var util = require('./util');
-var Heap_1 = require('./Heap');
-var PriorityQueue = (function () {
-    /**
-     * Creates an empty priority queue.
-     * @class <p>In a priority queue each element is associated with a "priority",
-     * elements are dequeued in highest-priority-first order (the elements with the
-     * highest priority are dequeued first). Priority Queues are implemented as heaps.
-     * If the inserted elements are custom objects a compare function must be provided,
-     * otherwise the <=, === and >= operators are used to compare object priority.</p>
-     * <pre>
-     * function compare(a, b) {
-     *  if (a is less than b by some ordering criterion) {
-     *     return -1;
-     *  } if (a is greater than b by the ordering criterion) {
-     *     return 1;
-     *  }
-     *  // a must be equal to b
-     *  return 0;
-     * }
-     * </pre>
-     * @constructor
-     * @param {function(Object,Object):number=} compareFunction optional
-     * function used to compare two element priorities. Must return a negative integer,
-     * zero, or a positive integer as the first argument is less than, equal to,
-     * or greater than the second.
-     */
-    function PriorityQueue(compareFunction) {
-        this.heap = new Heap_1.default(util.reverseCompareFunction(compareFunction));
-    }
-    /**
-     * Inserts the specified element into this priority queue.
-     * @param {Object} element the element to insert.
-     * @return {boolean} true if the element was inserted, or false if it is undefined.
-     */
-    PriorityQueue.prototype.enqueue = function (element) {
-        return this.heap.add(element);
-    };
-    /**
-     * Inserts the specified element into this priority queue.
-     * @param {Object} element the element to insert.
-     * @return {boolean} true if the element was inserted, or false if it is undefined.
-     */
-    PriorityQueue.prototype.add = function (element) {
-        return this.heap.add(element);
-    };
-    /**
-     * Retrieves and removes the highest priority element of this queue.
-     * @return {*} the the highest priority element of this queue,
-     *  or undefined if this queue is empty.
-     */
-    PriorityQueue.prototype.dequeue = function () {
-        if (this.heap.size() !== 0) {
-            var el = this.heap.peek();
-            this.heap.removeRoot();
-            return el;
-        }
-        return undefined;
-    };
-    /**
-     * Retrieves, but does not remove, the highest priority element of this queue.
-     * @return {*} the highest priority element of this queue, or undefined if this queue is empty.
-     */
-    PriorityQueue.prototype.peek = function () {
-        return this.heap.peek();
-    };
-    /**
-     * Returns true if this priority queue contains the specified element.
-     * @param {Object} element element to search for.
-     * @return {boolean} true if this priority queue contains the specified element,
-     * false otherwise.
-     */
-    PriorityQueue.prototype.contains = function (element) {
-        return this.heap.contains(element);
-    };
-    /**
-     * Checks if this priority queue is empty.
-     * @return {boolean} true if and only if this priority queue contains no items; false
-     * otherwise.
-     */
-    PriorityQueue.prototype.isEmpty = function () {
-        return this.heap.isEmpty();
-    };
-    /**
-     * Returns the number of elements in this priority queue.
-     * @return {number} the number of elements in this priority queue.
-     */
-    PriorityQueue.prototype.size = function () {
-        return this.heap.size();
-    };
-    /**
-     * Removes all of the elements from this priority queue.
-     */
-    PriorityQueue.prototype.clear = function () {
-        this.heap.clear();
-    };
-    /**
-     * Executes the provided function once for each element present in this queue in
-     * no particular order.
-     * @param {function(Object):*} callback function to execute, it is
-     * invoked with one argument: the element value, to break the iteration you can
-     * optionally return false.
-     */
-    PriorityQueue.prototype.forEach = function (callback) {
-        this.heap.forEach(callback);
-    };
-    return PriorityQueue;
-}());
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.default = PriorityQueue; // end of priority queue
-
-},{"./Heap":5,"./util":15}],11:[function(require,module,exports){
-"use strict";
-var LinkedList_1 = require('./LinkedList');
-var Queue = (function () {
-    /**
-     * Creates an empty queue.
-     * @class A queue is a First-In-First-Out (FIFO) data structure, the first
-     * element added to the queue will be the first one to be removed. This
-     * implementation uses a linked list as a container.
-     * @constructor
-     */
-    function Queue() {
-        this.list = new LinkedList_1.default();
-    }
-    /**
-     * Inserts the specified element into the end of this queue.
-     * @param {Object} elem the element to insert.
-     * @return {boolean} true if the element was inserted, or false if it is undefined.
-     */
-    Queue.prototype.enqueue = function (elem) {
-        return this.list.add(elem);
-    };
-    /**
-     * Inserts the specified element into the end of this queue.
-     * @param {Object} elem the element to insert.
-     * @return {boolean} true if the element was inserted, or false if it is undefined.
-     */
-    Queue.prototype.add = function (elem) {
-        return this.list.add(elem);
-    };
-    /**
-     * Retrieves and removes the head of this queue.
-     * @return {*} the head of this queue, or undefined if this queue is empty.
-     */
-    Queue.prototype.dequeue = function () {
-        if (this.list.size() !== 0) {
-            var el = this.list.first();
-            this.list.removeElementAtIndex(0);
-            return el;
-        }
-        return undefined;
-    };
-    /**
-     * Retrieves, but does not remove, the head of this queue.
-     * @return {*} the head of this queue, or undefined if this queue is empty.
-     */
-    Queue.prototype.peek = function () {
-        if (this.list.size() !== 0) {
-            return this.list.first();
-        }
-        return undefined;
-    };
-    /**
-     * Returns the number of elements in this queue.
-     * @return {number} the number of elements in this queue.
-     */
-    Queue.prototype.size = function () {
-        return this.list.size();
-    };
-    /**
-     * Returns true if this queue contains the specified element.
-     * <p>If the elements inside this stack are
-     * not comparable with the === operator, a custom equals function should be
-     * provided to perform searches, the function must receive two arguments and
-     * return true if they are equal, false otherwise. Example:</p>
-     *
-     * <pre>
-     * const petsAreEqualByName (pet1, pet2) {
-     *  return pet1.name === pet2.name;
-     * }
-     * </pre>
-     * @param {Object} elem element to search for.
-     * @param {function(Object,Object):boolean=} equalsFunction optional
-     * function to check if two elements are equal.
-     * @return {boolean} true if this queue contains the specified element,
-     * false otherwise.
-     */
-    Queue.prototype.contains = function (elem, equalsFunction) {
-        return this.list.contains(elem, equalsFunction);
-    };
-    /**
-     * Checks if this queue is empty.
-     * @return {boolean} true if and only if this queue contains no items; false
-     * otherwise.
-     */
-    Queue.prototype.isEmpty = function () {
-        return this.list.size() <= 0;
-    };
-    /**
-     * Removes all of the elements from this queue.
-     */
-    Queue.prototype.clear = function () {
-        this.list.clear();
-    };
-    /**
-     * Executes the provided function once for each element present in this queue in
-     * FIFO order.
-     * @param {function(Object):*} callback function to execute, it is
-     * invoked with one argument: the element value, to break the iteration you can
-     * optionally return false.
-     */
-    Queue.prototype.forEach = function (callback) {
-        this.list.forEach(callback);
-    };
-    return Queue;
-}());
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.default = Queue; // End of queue
-
-},{"./LinkedList":7}],12:[function(require,module,exports){
-"use strict";
-var util = require('./util');
-var arrays = require('./arrays');
-var Dictionary_1 = require('./Dictionary');
-var Set = (function () {
-    /**
-     * Creates an empty set.
-     * @class <p>A set is a data structure that contains no duplicate items.</p>
-     * <p>If the inserted elements are custom objects a function
-     * which converts elements to strings must be provided. Example:</p>
-     *
-     * <pre>
-     * function petToString(pet) {
-     *  return pet.name;
-     * }
-     * </pre>
-     *
-     * @constructor
-     * @param {function(Object):string=} toStringFunction optional function used
-     * to convert elements to strings. If the elements aren't strings or if toString()
-     * is not appropriate, a custom function which receives a onject and returns a
-     * unique string must be provided.
-     */
-    function Set(toStringFunction) {
-        this.dictionary = new Dictionary_1.default(toStringFunction);
-    }
-    /**
-     * Returns true if this set contains the specified element.
-     * @param {Object} element element to search for.
-     * @return {boolean} true if this set contains the specified element,
-     * false otherwise.
-     */
-    Set.prototype.contains = function (element) {
-        return this.dictionary.containsKey(element);
-    };
-    /**
-     * Adds the specified element to this set if it is not already present.
-     * @param {Object} element the element to insert.
-     * @return {boolean} true if this set did not already contain the specified element.
-     */
-    Set.prototype.add = function (element) {
-        if (this.contains(element) || util.isUndefined(element)) {
-            return false;
-        }
-        else {
-            this.dictionary.setValue(element, element);
-            return true;
-        }
-    };
-    /**
-     * Performs an intersecion between this an another set.
-     * Removes all values that are not present this set and the given set.
-     * @param {collections.Set} otherSet other set.
-     */
-    Set.prototype.intersection = function (otherSet) {
-        var set = this;
-        this.forEach(function (element) {
-            if (!otherSet.contains(element)) {
-                set.remove(element);
-            }
-            return true;
-        });
-    };
-    /**
-     * Performs a union between this an another set.
-     * Adds all values from the given set to this set.
-     * @param {collections.Set} otherSet other set.
-     */
-    Set.prototype.union = function (otherSet) {
-        var set = this;
-        otherSet.forEach(function (element) {
-            set.add(element);
-            return true;
-        });
-    };
-    /**
-     * Performs a difference between this an another set.
-     * Removes from this set all the values that are present in the given set.
-     * @param {collections.Set} otherSet other set.
-     */
-    Set.prototype.difference = function (otherSet) {
-        var set = this;
-        otherSet.forEach(function (element) {
-            set.remove(element);
-            return true;
-        });
-    };
-    /**
-     * Checks whether the given set contains all the elements in this set.
-     * @param {collections.Set} otherSet other set.
-     * @return {boolean} true if this set is a subset of the given set.
-     */
-    Set.prototype.isSubsetOf = function (otherSet) {
-        if (this.size() > otherSet.size()) {
-            return false;
-        }
-        var isSub = true;
-        this.forEach(function (element) {
-            if (!otherSet.contains(element)) {
-                isSub = false;
-                return false;
-            }
-            return true;
-        });
-        return isSub;
-    };
-    /**
-     * Removes the specified element from this set if it is present.
-     * @return {boolean} true if this set contained the specified element.
-     */
-    Set.prototype.remove = function (element) {
-        if (!this.contains(element)) {
-            return false;
-        }
-        else {
-            this.dictionary.remove(element);
-            return true;
-        }
-    };
-    /**
-     * Executes the provided function once for each element
-     * present in this set.
-     * @param {function(Object):*} callback function to execute, it is
-     * invoked with one arguments: the element. To break the iteration you can
-     * optionally return false.
-     */
-    Set.prototype.forEach = function (callback) {
-        this.dictionary.forEach(function (k, v) {
-            return callback(v);
-        });
-    };
-    /**
-     * Returns an array containing all of the elements in this set in arbitrary order.
-     * @return {Array} an array containing all of the elements in this set.
-     */
-    Set.prototype.toArray = function () {
-        return this.dictionary.values();
-    };
-    /**
-     * Returns true if this set contains no elements.
-     * @return {boolean} true if this set contains no elements.
-     */
-    Set.prototype.isEmpty = function () {
-        return this.dictionary.isEmpty();
-    };
-    /**
-     * Returns the number of elements in this set.
-     * @return {number} the number of elements in this set.
-     */
-    Set.prototype.size = function () {
-        return this.dictionary.size();
-    };
-    /**
-     * Removes all of the elements from this set.
-     */
-    Set.prototype.clear = function () {
-        this.dictionary.clear();
-    };
-    /*
-    * Provides a string representation for display
-    */
-    Set.prototype.toString = function () {
-        return arrays.toString(this.toArray());
-    };
-    return Set;
-}());
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.default = Set; // end of Set
-
-},{"./Dictionary":3,"./arrays":14,"./util":15}],13:[function(require,module,exports){
-"use strict";
-var LinkedList_1 = require('./LinkedList');
-var Stack = (function () {
-    /**
-     * Creates an empty Stack.
-     * @class A Stack is a Last-In-First-Out (LIFO) data structure, the last
-     * element added to the stack will be the first one to be removed. This
-     * implementation uses a linked list as a container.
-     * @constructor
-     */
-    function Stack() {
-        this.list = new LinkedList_1.default();
-    }
-    /**
-     * Pushes an item onto the top of this stack.
-     * @param {Object} elem the element to be pushed onto this stack.
-     * @return {boolean} true if the element was pushed or false if it is undefined.
-     */
-    Stack.prototype.push = function (elem) {
-        return this.list.add(elem, 0);
-    };
-    /**
-     * Pushes an item onto the top of this stack.
-     * @param {Object} elem the element to be pushed onto this stack.
-     * @return {boolean} true if the element was pushed or false if it is undefined.
-     */
-    Stack.prototype.add = function (elem) {
-        return this.list.add(elem, 0);
-    };
-    /**
-     * Removes the object at the top of this stack and returns that object.
-     * @return {*} the object at the top of this stack or undefined if the
-     * stack is empty.
-     */
-    Stack.prototype.pop = function () {
-        return this.list.removeElementAtIndex(0);
-    };
-    /**
-     * Looks at the object at the top of this stack without removing it from the
-     * stack.
-     * @return {*} the object at the top of this stack or undefined if the
-     * stack is empty.
-     */
-    Stack.prototype.peek = function () {
-        return this.list.first();
-    };
-    /**
-     * Returns the number of elements in this stack.
-     * @return {number} the number of elements in this stack.
-     */
-    Stack.prototype.size = function () {
-        return this.list.size();
-    };
-    /**
-     * Returns true if this stack contains the specified element.
-     * <p>If the elements inside this stack are
-     * not comparable with the === operator, a custom equals function should be
-     * provided to perform searches, the function must receive two arguments and
-     * return true if they are equal, false otherwise. Example:</p>
-     *
-     * <pre>
-     * const petsAreEqualByName (pet1, pet2) {
-     *  return pet1.name === pet2.name;
-     * }
-     * </pre>
-     * @param {Object} elem element to search for.
-     * @param {function(Object,Object):boolean=} equalsFunction optional
-     * function to check if two elements are equal.
-     * @return {boolean} true if this stack contains the specified element,
-     * false otherwise.
-     */
-    Stack.prototype.contains = function (elem, equalsFunction) {
-        return this.list.contains(elem, equalsFunction);
-    };
-    /**
-     * Checks if this stack is empty.
-     * @return {boolean} true if and only if this stack contains no items; false
-     * otherwise.
-     */
-    Stack.prototype.isEmpty = function () {
-        return this.list.isEmpty();
-    };
-    /**
-     * Removes all of the elements from this stack.
-     */
-    Stack.prototype.clear = function () {
-        this.list.clear();
-    };
-    /**
-     * Executes the provided function once for each element present in this stack in
-     * LIFO order.
-     * @param {function(Object):*} callback function to execute, it is
-     * invoked with one argument: the element value, to break the iteration you can
-     * optionally return false.
-     */
-    Stack.prototype.forEach = function (callback) {
-        this.list.forEach(callback);
-    };
-    return Stack;
-}());
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.default = Stack; // End of stack
-
-},{"./LinkedList":7}],14:[function(require,module,exports){
-"use strict";
-var util = require('./util');
-/**
- * Returns the position of the first occurrence of the specified item
- * within the specified array.4
- * @param {*} array the array in which to search the element.
- * @param {Object} item the element to search.
- * @param {function(Object,Object):boolean=} equalsFunction optional function used to
- * check equality between 2 elements.
- * @return {number} the position of the first occurrence of the specified element
- * within the specified array, or -1 if not found.
- */
-function indexOf(array, item, equalsFunction) {
-    var equals = equalsFunction || util.defaultEquals;
-    var length = array.length;
-    for (var i = 0; i < length; i++) {
-        if (equals(array[i], item)) {
-            return i;
-        }
-    }
-    return -1;
-}
-exports.indexOf = indexOf;
-/**
- * Returns the position of the last occurrence of the specified element
- * within the specified array.
- * @param {*} array the array in which to search the element.
- * @param {Object} item the element to search.
- * @param {function(Object,Object):boolean=} equalsFunction optional function used to
- * check equality between 2 elements.
- * @return {number} the position of the last occurrence of the specified element
- * within the specified array or -1 if not found.
- */
-function lastIndexOf(array, item, equalsFunction) {
-    var equals = equalsFunction || util.defaultEquals;
-    var length = array.length;
-    for (var i = length - 1; i >= 0; i--) {
-        if (equals(array[i], item)) {
-            return i;
-        }
-    }
-    return -1;
-}
-exports.lastIndexOf = lastIndexOf;
-/**
- * Returns true if the specified array contains the specified element.
- * @param {*} array the array in which to search the element.
- * @param {Object} item the element to search.
- * @param {function(Object,Object):boolean=} equalsFunction optional function to
- * check equality between 2 elements.
- * @return {boolean} true if the specified array contains the specified element.
- */
-function contains(array, item, equalsFunction) {
-    return indexOf(array, item, equalsFunction) >= 0;
-}
-exports.contains = contains;
-/**
- * Removes the first ocurrence of the specified element from the specified array.
- * @param {*} array the array in which to search element.
- * @param {Object} item the element to search.
- * @param {function(Object,Object):boolean=} equalsFunction optional function to
- * check equality between 2 elements.
- * @return {boolean} true if the array changed after this call.
- */
-function remove(array, item, equalsFunction) {
-    var index = indexOf(array, item, equalsFunction);
-    if (index < 0) {
-        return false;
-    }
-    array.splice(index, 1);
-    return true;
-}
-exports.remove = remove;
-/**
- * Returns the number of elements in the specified array equal
- * to the specified object.
- * @param {Array} array the array in which to determine the frequency of the element.
- * @param {Object} item the element whose frequency is to be determined.
- * @param {function(Object,Object):boolean=} equalsFunction optional function used to
- * check equality between 2 elements.
- * @return {number} the number of elements in the specified array
- * equal to the specified object.
- */
-function frequency(array, item, equalsFunction) {
-    var equals = equalsFunction || util.defaultEquals;
-    var length = array.length;
-    var freq = 0;
-    for (var i = 0; i < length; i++) {
-        if (equals(array[i], item)) {
-            freq++;
-        }
-    }
-    return freq;
-}
-exports.frequency = frequency;
-/**
- * Returns true if the two specified arrays are equal to one another.
- * Two arrays are considered equal if both arrays contain the same number
- * of elements, and all corresponding pairs of elements in the two
- * arrays are equal and are in the same order.
- * @param {Array} array1 one array to be tested for equality.
- * @param {Array} array2 the other array to be tested for equality.
- * @param {function(Object,Object):boolean=} equalsFunction optional function used to
- * check equality between elemements in the arrays.
- * @return {boolean} true if the two arrays are equal
- */
-function equals(array1, array2, equalsFunction) {
-    var equals = equalsFunction || util.defaultEquals;
-    if (array1.length !== array2.length) {
-        return false;
-    }
-    var length = array1.length;
-    for (var i = 0; i < length; i++) {
-        if (!equals(array1[i], array2[i])) {
-            return false;
-        }
-    }
-    return true;
-}
-exports.equals = equals;
-/**
- * Returns shallow a copy of the specified array.
- * @param {*} array the array to copy.
- * @return {Array} a copy of the specified array
- */
-function copy(array) {
-    return array.concat();
-}
-exports.copy = copy;
-/**
- * Swaps the elements at the specified positions in the specified array.
- * @param {Array} array The array in which to swap elements.
- * @param {number} i the index of one element to be swapped.
- * @param {number} j the index of the other element to be swapped.
- * @return {boolean} true if the array is defined and the indexes are valid.
- */
-function swap(array, i, j) {
-    if (i < 0 || i >= array.length || j < 0 || j >= array.length) {
-        return false;
-    }
-    var temp = array[i];
-    array[i] = array[j];
-    array[j] = temp;
-    return true;
-}
-exports.swap = swap;
-function toString(array) {
-    return '[' + array.toString() + ']';
-}
-exports.toString = toString;
-/**
- * Executes the provided function once for each element present in this array
- * starting from index 0 to length - 1.
- * @param {Array} array The array in which to iterate.
- * @param {function(Object):*} callback function to execute, it is
- * invoked with one argument: the element value, to break the iteration you can
- * optionally return false.
- */
-function forEach(array, callback) {
-    for (var _i = 0, array_1 = array; _i < array_1.length; _i++) {
-        var ele = array_1[_i];
-        if (callback(ele) === false) {
-            return;
-        }
-    }
-}
-exports.forEach = forEach;
-
-},{"./util":15}],15:[function(require,module,exports){
-"use strict";
-var _hasOwnProperty = Object.prototype.hasOwnProperty;
-exports.has = function (obj, prop) {
-    return _hasOwnProperty.call(obj, prop);
-};
-/**
- * Default function to compare element order.
- * @function
- */
-function defaultCompare(a, b) {
-    if (a < b) {
-        return -1;
-    }
-    else if (a === b) {
-        return 0;
-    }
-    else {
-        return 1;
-    }
-}
-exports.defaultCompare = defaultCompare;
-/**
- * Default function to test equality.
- * @function
- */
-function defaultEquals(a, b) {
-    return a === b;
-}
-exports.defaultEquals = defaultEquals;
-/**
- * Default function to convert an object to a string.
- * @function
- */
-function defaultToString(item) {
-    if (item === null) {
-        return 'COLLECTION_NULL';
-    }
-    else if (isUndefined(item)) {
-        return 'COLLECTION_UNDEFINED';
-    }
-    else if (isString(item)) {
-        return '$s' + item;
-    }
-    else {
-        return '$o' + item.toString();
-    }
-}
-exports.defaultToString = defaultToString;
-/**
-* Joins all the properies of the object using the provided join string
-*/
-function makeString(item, join) {
-    if (join === void 0) { join = ','; }
-    if (item === null) {
-        return 'COLLECTION_NULL';
-    }
-    else if (isUndefined(item)) {
-        return 'COLLECTION_UNDEFINED';
-    }
-    else if (isString(item)) {
-        return item.toString();
-    }
-    else {
-        var toret = '{';
-        var first = true;
-        for (var prop in item) {
-            if (exports.has(item, prop)) {
-                if (first) {
-                    first = false;
-                }
-                else {
-                    toret = toret + join;
-                }
-                toret = toret + prop + ':' + item[prop];
-            }
-        }
-        return toret + '}';
-    }
-}
-exports.makeString = makeString;
-/**
- * Checks if the given argument is a function.
- * @function
- */
-function isFunction(func) {
-    return (typeof func) === 'function';
-}
-exports.isFunction = isFunction;
-/**
- * Checks if the given argument is undefined.
- * @function
- */
-function isUndefined(obj) {
-    return (typeof obj) === 'undefined';
-}
-exports.isUndefined = isUndefined;
-/**
- * Checks if the given argument is a string.
- * @function
- */
-function isString(obj) {
-    return Object.prototype.toString.call(obj) === '[object String]';
-}
-exports.isString = isString;
-/**
- * Reverses a compare function.
- * @function
- */
-function reverseCompareFunction(compareFunction) {
-    if (!isFunction(compareFunction)) {
-        return function (a, b) {
-            if (a < b) {
-                return 1;
-            }
-            else if (a === b) {
-                return 0;
-            }
-            else {
-                return -1;
-            }
-        };
-    }
-    else {
-        return function (d, v) {
-            return compareFunction(d, v) * -1;
-        };
-    }
-}
-exports.reverseCompareFunction = reverseCompareFunction;
-/**
- * Returns an equal function given a compare function.
- * @function
- */
-function compareToEquals(compareFunction) {
-    return function (a, b) {
-        return compareFunction(a, b) === 0;
-    };
-}
-exports.compareToEquals = compareToEquals;
-
-},{}],"typescript-collections":[function(require,module,exports){
-"use strict";
-// Copyright 2013 Basarat Ali Syed. All Rights Reserved.
-//
-// Licensed under MIT open source license http://opensource.org/licenses/MIT
-//
-// Orginal javascript code was by Mauricio Santos
-//
-var _arrays = require('./arrays');
-exports.arrays = _arrays;
-var Bag_1 = require('./Bag');
-exports.Bag = Bag_1.default;
-var BSTree_1 = require('./BSTree');
-exports.BSTree = BSTree_1.default;
-var Dictionary_1 = require('./Dictionary');
-exports.Dictionary = Dictionary_1.default;
-var Heap_1 = require('./Heap');
-exports.Heap = Heap_1.default;
-var LinkedDictionary_1 = require('./LinkedDictionary');
-exports.LinkedDictionary = LinkedDictionary_1.default;
-var LinkedList_1 = require('./LinkedList');
-exports.LinkedList = LinkedList_1.default;
-var MultiDictionary_1 = require('./MultiDictionary');
-exports.MultiDictionary = MultiDictionary_1.default;
-var FactoryDictionary_1 = require('./FactoryDictionary');
-exports.FactoryDictionary = FactoryDictionary_1.default;
-var FactoryDictionary_2 = require('./FactoryDictionary');
-exports.DefaultDictionary = FactoryDictionary_2.default;
-var Queue_1 = require('./Queue');
-exports.Queue = Queue_1.default;
-var PriorityQueue_1 = require('./PriorityQueue');
-exports.PriorityQueue = PriorityQueue_1.default;
-var Set_1 = require('./Set');
-exports.Set = Set_1.default;
-var Stack_1 = require('./Stack');
-exports.Stack = Stack_1.default;
-var MultiRootTree_1 = require('./MultiRootTree');
-exports.MultiRootTree = MultiRootTree_1.default;
-var _util = require('./util');
-exports.util = _util;
-
-},{"./BSTree":1,"./Bag":2,"./Dictionary":3,"./FactoryDictionary":4,"./Heap":5,"./LinkedDictionary":6,"./LinkedList":7,"./MultiDictionary":8,"./MultiRootTree":9,"./PriorityQueue":10,"./Queue":11,"./Set":12,"./Stack":13,"./arrays":14,"./util":15}]},{},[])
-//# sourceMappingURL=data:application/json;charset=utf-8;base64,{"version":3,"sources":["node_modules/browser-pack/_prelude.js","dist/lib/BSTree.js","dist/lib/Bag.js","dist/lib/Dictionary.js","dist/lib/FactoryDictionary.js","dist/lib/Heap.js","dist/lib/LinkedDictionary.js","dist/lib/LinkedList.js","dist/lib/MultiDictionary.js","dist/lib/MultiRootTree.js","dist/lib/PriorityQueue.js","dist/lib/Queue.js","dist/lib/Set.js","dist/lib/Stack.js","dist/lib/arrays.js","dist/lib/util.js","dist/lib/index.js"],"names":[],"mappings":"AAAA;ACAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC/YA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACxLA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AChLA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC3EA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AClOA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACzNA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACzXA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACxKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACzUA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC/GA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC3GA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACxKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACtGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACvKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC3IA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA","file":"generated.js","sourceRoot":"","sourcesContent":["(function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require==\"function\"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error(\"Cannot find module '\"+o+\"'\");throw f.code=\"MODULE_NOT_FOUND\",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require==\"function\"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})","\"use strict\";\nvar util = require('./util');\nvar Queue_1 = require('./Queue');\nvar BSTree = (function () {\n    /**\n     * Creates an empty binary search tree.\n     * @class <p>A binary search tree is a binary tree in which each\n     * internal node stores an element such that the elements stored in the\n     * left subtree are less than it and the elements\n     * stored in the right subtree are greater.</p>\n     * <p>Formally, a binary search tree is a node-based binary tree data structure which\n     * has the following properties:</p>\n     * <ul>\n     * <li>The left subtree of a node contains only nodes with elements less\n     * than the node's element</li>\n     * <li>The right subtree of a node contains only nodes with elements greater\n     * than the node's element</li>\n     * <li>Both the left and right subtrees must also be binary search trees.</li>\n     * </ul>\n     * <p>If the inserted elements are custom objects a compare function must\n     * be provided at construction time, otherwise the <=, === and >= operators are\n     * used to compare elements. Example:</p>\n     * <pre>\n     * function compare(a, b) {\n     *  if (a is less than b by some ordering criterion) {\n     *     return -1;\n     *  } if (a is greater than b by the ordering criterion) {\n     *     return 1;\n     *  }\n     *  // a must be equal to b\n     *  return 0;\n     * }\n     * </pre>\n     * @constructor\n     * @param {function(Object,Object):number=} compareFunction optional\n     * function used to compare two elements. Must return a negative integer,\n     * zero, or a positive integer as the first argument is less than, equal to,\n     * or greater than the second.\n     */\n    function BSTree(compareFunction) {\n        this.root = null;\n        this.compare = compareFunction || util.defaultCompare;\n        this.nElements = 0;\n    }\n    /**\n     * Adds the specified element to this tree if it is not already present.\n     * @param {Object} element the element to insert.\n     * @return {boolean} true if this tree did not already contain the specified element.\n     */\n    BSTree.prototype.add = function (element) {\n        if (util.isUndefined(element)) {\n            return false;\n        }\n        if (this.insertNode(this.createNode(element)) !== null) {\n            this.nElements++;\n            return true;\n        }\n        return false;\n    };\n    /**\n     * Removes all of the elements from this tree.\n     */\n    BSTree.prototype.clear = function () {\n        this.root = null;\n        this.nElements = 0;\n    };\n    /**\n     * Returns true if this tree contains no elements.\n     * @return {boolean} true if this tree contains no elements.\n     */\n    BSTree.prototype.isEmpty = function () {\n        return this.nElements === 0;\n    };\n    /**\n     * Returns the number of elements in this tree.\n     * @return {number} the number of elements in this tree.\n     */\n    BSTree.prototype.size = function () {\n        return this.nElements;\n    };\n    /**\n     * Returns true if this tree contains the specified element.\n     * @param {Object} element element to search for.\n     * @return {boolean} true if this tree contains the specified element,\n     * false otherwise.\n     */\n    BSTree.prototype.contains = function (element) {\n        if (util.isUndefined(element)) {\n            return false;\n        }\n        return this.searchNode(this.root, element) !== null;\n    };\n    /**\n     * Removes the specified element from this tree if it is present.\n     * @return {boolean} true if this tree contained the specified element.\n     */\n    BSTree.prototype.remove = function (element) {\n        var node = this.searchNode(this.root, element);\n        if (node === null) {\n            return false;\n        }\n        this.removeNode(node);\n        this.nElements--;\n        return true;\n    };\n    /**\n     * Executes the provided function once for each element present in this tree in\n     * in-order.\n     * @param {function(Object):*} callback function to execute, it is invoked with one\n     * argument: the element value, to break the iteration you can optionally return false.\n     */\n    BSTree.prototype.inorderTraversal = function (callback) {\n        this.inorderTraversalAux(this.root, callback, {\n            stop: false\n        });\n    };\n    /**\n     * Executes the provided function once for each element present in this tree in pre-order.\n     * @param {function(Object):*} callback function to execute, it is invoked with one\n     * argument: the element value, to break the iteration you can optionally return false.\n     */\n    BSTree.prototype.preorderTraversal = function (callback) {\n        this.preorderTraversalAux(this.root, callback, {\n            stop: false\n        });\n    };\n    /**\n     * Executes the provided function once for each element present in this tree in post-order.\n     * @param {function(Object):*} callback function to execute, it is invoked with one\n     * argument: the element value, to break the iteration you can optionally return false.\n     */\n    BSTree.prototype.postorderTraversal = function (callback) {\n        this.postorderTraversalAux(this.root, callback, {\n            stop: false\n        });\n    };\n    /**\n     * Executes the provided function once for each element present in this tree in\n     * level-order.\n     * @param {function(Object):*} callback function to execute, it is invoked with one\n     * argument: the element value, to break the iteration you can optionally return false.\n     */\n    BSTree.prototype.levelTraversal = function (callback) {\n        this.levelTraversalAux(this.root, callback);\n    };\n    /**\n     * Returns the minimum element of this tree.\n     * @return {*} the minimum element of this tree or undefined if this tree is\n     * is empty.\n     */\n    BSTree.prototype.minimum = function () {\n        if (this.isEmpty()) {\n            return undefined;\n        }\n        return this.minimumAux(this.root).element;\n    };\n    /**\n     * Returns the maximum element of this tree.\n     * @return {*} the maximum element of this tree or undefined if this tree is\n     * is empty.\n     */\n    BSTree.prototype.maximum = function () {\n        if (this.isEmpty()) {\n            return undefined;\n        }\n        return this.maximumAux(this.root).element;\n    };\n    /**\n     * Executes the provided function once for each element present in this tree in inorder.\n     * Equivalent to inorderTraversal.\n     * @param {function(Object):*} callback function to execute, it is\n     * invoked with one argument: the element value, to break the iteration you can\n     * optionally return false.\n     */\n    BSTree.prototype.forEach = function (callback) {\n        this.inorderTraversal(callback);\n    };\n    /**\n     * Returns an array containing all of the elements in this tree in in-order.\n     * @return {Array} an array containing all of the elements in this tree in in-order.\n     */\n    BSTree.prototype.toArray = function () {\n        var array = [];\n        this.inorderTraversal(function (element) {\n            array.push(element);\n            return true;\n        });\n        return array;\n    };\n    /**\n     * Returns the height of this tree.\n     * @return {number} the height of this tree or -1 if is empty.\n     */\n    BSTree.prototype.height = function () {\n        return this.heightAux(this.root);\n    };\n    /**\n    * @private\n    */\n    BSTree.prototype.searchNode = function (node, element) {\n        var cmp = null;\n        while (node !== null && cmp !== 0) {\n            cmp = this.compare(element, node.element);\n            if (cmp < 0) {\n                node = node.leftCh;\n            }\n            else if (cmp > 0) {\n                node = node.rightCh;\n            }\n        }\n        return node;\n    };\n    /**\n    * @private\n    */\n    BSTree.prototype.transplant = function (n1, n2) {\n        if (n1.parent === null) {\n            this.root = n2;\n        }\n        else if (n1 === n1.parent.leftCh) {\n            n1.parent.leftCh = n2;\n        }\n        else {\n            n1.parent.rightCh = n2;\n        }\n        if (n2 !== null) {\n            n2.parent = n1.parent;\n        }\n    };\n    /**\n    * @private\n    */\n    BSTree.prototype.removeNode = function (node) {\n        if (node.leftCh === null) {\n            this.transplant(node, node.rightCh);\n        }\n        else if (node.rightCh === null) {\n            this.transplant(node, node.leftCh);\n        }\n        else {\n            var y = this.minimumAux(node.rightCh);\n            if (y.parent !== node) {\n                this.transplant(y, y.rightCh);\n                y.rightCh = node.rightCh;\n                y.rightCh.parent = y;\n            }\n            this.transplant(node, y);\n            y.leftCh = node.leftCh;\n            y.leftCh.parent = y;\n        }\n    };\n    /**\n    * @private\n    */\n    BSTree.prototype.inorderTraversalAux = function (node, callback, signal) {\n        if (node === null || signal.stop) {\n            return;\n        }\n        this.inorderTraversalAux(node.leftCh, callback, signal);\n        if (signal.stop) {\n            return;\n        }\n        signal.stop = callback(node.element) === false;\n        if (signal.stop) {\n            return;\n        }\n        this.inorderTraversalAux(node.rightCh, callback, signal);\n    };\n    /**\n    * @private\n    */\n    BSTree.prototype.levelTraversalAux = function (node, callback) {\n        var queue = new Queue_1.default();\n        if (node !== null) {\n            queue.enqueue(node);\n        }\n        while (!queue.isEmpty()) {\n            node = queue.dequeue();\n            if (callback(node.element) === false) {\n                return;\n            }\n            if (node.leftCh !== null) {\n                queue.enqueue(node.leftCh);\n            }\n            if (node.rightCh !== null) {\n                queue.enqueue(node.rightCh);\n            }\n        }\n    };\n    /**\n    * @private\n    */\n    BSTree.prototype.preorderTraversalAux = function (node, callback, signal) {\n        if (node === null || signal.stop) {\n            return;\n        }\n        signal.stop = callback(node.element) === false;\n        if (signal.stop) {\n            return;\n        }\n        this.preorderTraversalAux(node.leftCh, callback, signal);\n        if (signal.stop) {\n            return;\n        }\n        this.preorderTraversalAux(node.rightCh, callback, signal);\n    };\n    /**\n    * @private\n    */\n    BSTree.prototype.postorderTraversalAux = function (node, callback, signal) {\n        if (node === null || signal.stop) {\n            return;\n        }\n        this.postorderTraversalAux(node.leftCh, callback, signal);\n        if (signal.stop) {\n            return;\n        }\n        this.postorderTraversalAux(node.rightCh, callback, signal);\n        if (signal.stop) {\n            return;\n        }\n        signal.stop = callback(node.element) === false;\n    };\n    /**\n    * @private\n    */\n    BSTree.prototype.minimumAux = function (node) {\n        while (node.leftCh !== null) {\n            node = node.leftCh;\n        }\n        return node;\n    };\n    /**\n    * @private\n    */\n    BSTree.prototype.maximumAux = function (node) {\n        while (node.rightCh !== null) {\n            node = node.rightCh;\n        }\n        return node;\n    };\n    /**\n      * @private\n      */\n    BSTree.prototype.heightAux = function (node) {\n        if (node === null) {\n            return -1;\n        }\n        return Math.max(this.heightAux(node.leftCh), this.heightAux(node.rightCh)) + 1;\n    };\n    /*\n    * @private\n    */\n    BSTree.prototype.insertNode = function (node) {\n        var parent = null;\n        var position = this.root;\n        var cmp = null;\n        while (position !== null) {\n            cmp = this.compare(node.element, position.element);\n            if (cmp === 0) {\n                return null;\n            }\n            else if (cmp < 0) {\n                parent = position;\n                position = position.leftCh;\n            }\n            else {\n                parent = position;\n                position = position.rightCh;\n            }\n        }\n        node.parent = parent;\n        if (parent === null) {\n            // tree is empty\n            this.root = node;\n        }\n        else if (this.compare(node.element, parent.element) < 0) {\n            parent.leftCh = node;\n        }\n        else {\n            parent.rightCh = node;\n        }\n        return node;\n    };\n    /**\n    * @private\n    */\n    BSTree.prototype.createNode = function (element) {\n        return {\n            element: element,\n            leftCh: null,\n            rightCh: null,\n            parent: null\n        };\n    };\n    return BSTree;\n}());\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.default = BSTree;\n//# sourceMappingURL=BSTree.js.map","\"use strict\";\nvar util = require('./util');\nvar Dictionary_1 = require('./Dictionary');\nvar Set_1 = require('./Set');\nvar Bag = (function () {\n    /**\n     * Creates an empty bag.\n     * @class <p>A bag is a special kind of set in which members are\n     * allowed to appear more than once.</p>\n     * <p>If the inserted elements are custom objects a function\n     * which converts elements to unique strings must be provided. Example:</p>\n     *\n     * <pre>\n     * function petToString(pet) {\n     *  return pet.name;\n     * }\n     * </pre>\n     *\n     * @constructor\n     * @param {function(Object):string=} toStrFunction optional function used\n     * to convert elements to strings. If the elements aren't strings or if toString()\n     * is not appropriate, a custom function which receives an object and returns a\n     * unique string must be provided.\n     */\n    function Bag(toStrFunction) {\n        this.toStrF = toStrFunction || util.defaultToString;\n        this.dictionary = new Dictionary_1.default(this.toStrF);\n        this.nElements = 0;\n    }\n    /**\n    * Adds nCopies of the specified object to this bag.\n    * @param {Object} element element to add.\n    * @param {number=} nCopies the number of copies to add, if this argument is\n    * undefined 1 copy is added.\n    * @return {boolean} true unless element is undefined.\n    */\n    Bag.prototype.add = function (element, nCopies) {\n        if (nCopies === void 0) { nCopies = 1; }\n        if (util.isUndefined(element) || nCopies <= 0) {\n            return false;\n        }\n        if (!this.contains(element)) {\n            var node = {\n                value: element,\n                copies: nCopies\n            };\n            this.dictionary.setValue(element, node);\n        }\n        else {\n            this.dictionary.getValue(element).copies += nCopies;\n        }\n        this.nElements += nCopies;\n        return true;\n    };\n    /**\n    * Counts the number of copies of the specified object in this bag.\n    * @param {Object} element the object to search for..\n    * @return {number} the number of copies of the object, 0 if not found\n    */\n    Bag.prototype.count = function (element) {\n        if (!this.contains(element)) {\n            return 0;\n        }\n        else {\n            return this.dictionary.getValue(element).copies;\n        }\n    };\n    /**\n     * Returns true if this bag contains the specified element.\n     * @param {Object} element element to search for.\n     * @return {boolean} true if this bag contains the specified element,\n     * false otherwise.\n     */\n    Bag.prototype.contains = function (element) {\n        return this.dictionary.containsKey(element);\n    };\n    /**\n    * Removes nCopies of the specified object to this bag.\n    * If the number of copies to remove is greater than the actual number\n    * of copies in the Bag, all copies are removed.\n    * @param {Object} element element to remove.\n    * @param {number=} nCopies the number of copies to remove, if this argument is\n    * undefined 1 copy is removed.\n    * @return {boolean} true if at least 1 element was removed.\n    */\n    Bag.prototype.remove = function (element, nCopies) {\n        if (nCopies === void 0) { nCopies = 1; }\n        if (util.isUndefined(element) || nCopies <= 0) {\n            return false;\n        }\n        if (!this.contains(element)) {\n            return false;\n        }\n        else {\n            var node = this.dictionary.getValue(element);\n            if (nCopies > node.copies) {\n                this.nElements -= node.copies;\n            }\n            else {\n                this.nElements -= nCopies;\n            }\n            node.copies -= nCopies;\n            if (node.copies <= 0) {\n                this.dictionary.remove(element);\n            }\n            return true;\n        }\n    };\n    /**\n     * Returns an array containing all of the elements in this big in arbitrary order,\n     * including multiple copies.\n     * @return {Array} an array containing all of the elements in this bag.\n     */\n    Bag.prototype.toArray = function () {\n        var a = [];\n        var values = this.dictionary.values();\n        for (var _i = 0, values_1 = values; _i < values_1.length; _i++) {\n            var node = values_1[_i];\n            var element = node.value;\n            var copies = node.copies;\n            for (var j = 0; j < copies; j++) {\n                a.push(element);\n            }\n        }\n        return a;\n    };\n    /**\n     * Returns a set of unique elements in this bag.\n     * @return {collections.Set<T>} a set of unique elements in this bag.\n     */\n    Bag.prototype.toSet = function () {\n        var toret = new Set_1.default(this.toStrF);\n        var elements = this.dictionary.values();\n        for (var _i = 0, elements_1 = elements; _i < elements_1.length; _i++) {\n            var ele = elements_1[_i];\n            var value = ele.value;\n            toret.add(value);\n        }\n        return toret;\n    };\n    /**\n     * Executes the provided function once for each element\n     * present in this bag, including multiple copies.\n     * @param {function(Object):*} callback function to execute, it is\n     * invoked with one argument: the element. To break the iteration you can\n     * optionally return false.\n     */\n    Bag.prototype.forEach = function (callback) {\n        this.dictionary.forEach(function (k, v) {\n            var value = v.value;\n            var copies = v.copies;\n            for (var i = 0; i < copies; i++) {\n                if (callback(value) === false) {\n                    return false;\n                }\n            }\n            return true;\n        });\n    };\n    /**\n     * Returns the number of elements in this bag.\n     * @return {number} the number of elements in this bag.\n     */\n    Bag.prototype.size = function () {\n        return this.nElements;\n    };\n    /**\n     * Returns true if this bag contains no elements.\n     * @return {boolean} true if this bag contains no elements.\n     */\n    Bag.prototype.isEmpty = function () {\n        return this.nElements === 0;\n    };\n    /**\n     * Removes all of the elements from this bag.\n     */\n    Bag.prototype.clear = function () {\n        this.nElements = 0;\n        this.dictionary.clear();\n    };\n    return Bag;\n}());\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.default = Bag; // End of bag\n//# sourceMappingURL=Bag.js.map","\"use strict\";\nvar util = require('./util');\nvar Dictionary = (function () {\n    /**\n     * Creates an empty dictionary.\n     * @class <p>Dictionaries map keys to values; each key can map to at most one value.\n     * This implementation accepts any kind of objects as keys.</p>\n     *\n     * <p>If the keys are custom objects a function which converts keys to unique\n     * strings must be provided. Example:</p>\n     * <pre>\n     * function petToString(pet) {\n     *  return pet.name;\n     * }\n     * </pre>\n     * @constructor\n     * @param {function(Object):string=} toStrFunction optional function used\n     * to convert keys to strings. If the keys aren't strings or if toString()\n     * is not appropriate, a custom function which receives a key and returns a\n     * unique string must be provided.\n     */\n    function Dictionary(toStrFunction) {\n        this.table = {};\n        this.nElements = 0;\n        this.toStr = toStrFunction || util.defaultToString;\n    }\n    /**\n     * Returns the value to which this dictionary maps the specified key.\n     * Returns undefined if this dictionary contains no mapping for this key.\n     * @param {Object} key key whose associated value is to be returned.\n     * @return {*} the value to which this dictionary maps the specified key or\n     * undefined if the map contains no mapping for this key.\n     */\n    Dictionary.prototype.getValue = function (key) {\n        var pair = this.table['$' + this.toStr(key)];\n        if (util.isUndefined(pair)) {\n            return undefined;\n        }\n        return pair.value;\n    };\n    /**\n     * Associates the specified value with the specified key in this dictionary.\n     * If the dictionary previously contained a mapping for this key, the old\n     * value is replaced by the specified value.\n     * @param {Object} key key with which the specified value is to be\n     * associated.\n     * @param {Object} value value to be associated with the specified key.\n     * @return {*} previous value associated with the specified key, or undefined if\n     * there was no mapping for the key or if the key/value are undefined.\n     */\n    Dictionary.prototype.setValue = function (key, value) {\n        if (util.isUndefined(key) || util.isUndefined(value)) {\n            return undefined;\n        }\n        var ret;\n        var k = '$' + this.toStr(key);\n        var previousElement = this.table[k];\n        if (util.isUndefined(previousElement)) {\n            this.nElements++;\n            ret = undefined;\n        }\n        else {\n            ret = previousElement.value;\n        }\n        this.table[k] = {\n            key: key,\n            value: value\n        };\n        return ret;\n    };\n    /**\n     * Removes the mapping for this key from this dictionary if it is present.\n     * @param {Object} key key whose mapping is to be removed from the\n     * dictionary.\n     * @return {*} previous value associated with specified key, or undefined if\n     * there was no mapping for key.\n     */\n    Dictionary.prototype.remove = function (key) {\n        var k = '$' + this.toStr(key);\n        var previousElement = this.table[k];\n        if (!util.isUndefined(previousElement)) {\n            delete this.table[k];\n            this.nElements--;\n            return previousElement.value;\n        }\n        return undefined;\n    };\n    /**\n     * Returns an array containing all of the keys in this dictionary.\n     * @return {Array} an array containing all of the keys in this dictionary.\n     */\n    Dictionary.prototype.keys = function () {\n        var array = [];\n        for (var name_1 in this.table) {\n            if (util.has(this.table, name_1)) {\n                var pair = this.table[name_1];\n                array.push(pair.key);\n            }\n        }\n        return array;\n    };\n    /**\n     * Returns an array containing all of the values in this dictionary.\n     * @return {Array} an array containing all of the values in this dictionary.\n     */\n    Dictionary.prototype.values = function () {\n        var array = [];\n        for (var name_2 in this.table) {\n            if (util.has(this.table, name_2)) {\n                var pair = this.table[name_2];\n                array.push(pair.value);\n            }\n        }\n        return array;\n    };\n    /**\n    * Executes the provided function once for each key-value pair\n    * present in this dictionary.\n    * @param {function(Object,Object):*} callback function to execute, it is\n    * invoked with two arguments: key and value. To break the iteration you can\n    * optionally return false.\n    */\n    Dictionary.prototype.forEach = function (callback) {\n        for (var name_3 in this.table) {\n            if (util.has(this.table, name_3)) {\n                var pair = this.table[name_3];\n                var ret = callback(pair.key, pair.value);\n                if (ret === false) {\n                    return;\n                }\n            }\n        }\n    };\n    /**\n     * Returns true if this dictionary contains a mapping for the specified key.\n     * @param {Object} key key whose presence in this dictionary is to be\n     * tested.\n     * @return {boolean} true if this dictionary contains a mapping for the\n     * specified key.\n     */\n    Dictionary.prototype.containsKey = function (key) {\n        return !util.isUndefined(this.getValue(key));\n    };\n    /**\n    * Removes all mappings from this dictionary.\n    * @this {collections.Dictionary}\n    */\n    Dictionary.prototype.clear = function () {\n        this.table = {};\n        this.nElements = 0;\n    };\n    /**\n     * Returns the number of keys in this dictionary.\n     * @return {number} the number of key-value mappings in this dictionary.\n     */\n    Dictionary.prototype.size = function () {\n        return this.nElements;\n    };\n    /**\n     * Returns true if this dictionary contains no mappings.\n     * @return {boolean} true if this dictionary contains no mappings.\n     */\n    Dictionary.prototype.isEmpty = function () {\n        return this.nElements <= 0;\n    };\n    Dictionary.prototype.toString = function () {\n        var toret = '{';\n        this.forEach(function (k, v) {\n            toret += \"\\n\\t\" + k + \" : \" + v;\n        });\n        return toret + '\\n}';\n    };\n    return Dictionary;\n}());\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.default = Dictionary; // End of dictionary\n//# sourceMappingURL=Dictionary.js.map","\"use strict\";\nvar __extends = (this && this.__extends) || function (d, b) {\n    for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p];\n    function __() { this.constructor = d; }\n    d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n};\nvar Dictionary_1 = require('./Dictionary');\nvar util = require('./util');\nvar FactoryDictionary = (function (_super) {\n    __extends(FactoryDictionary, _super);\n    /**\n     * Creates an empty dictionary.\n     * @class <p>Dictionaries map keys to values; each key can map to at most one value.\n     * This implementation accepts any kind of objects as keys.</p>\n     *\n     * <p>The default factory function should return a new object of the provided\n     * type. Example:</p>\n     * <pre>\n     * function petFactory() {\n     *  return new Pet();\n     * }\n     * </pre>\n     *\n     * <p>If the keys are custom objects a function which converts keys to unique\n     * strings must be provided. Example:</p>\n     * <pre>\n     * function petToString(pet) {\n     *  return pet.name;\n     * }\n     * </pre>\n     * @constructor\n     * @param {function():V=} defaultFactoryFunction function used to create a\n     * default object.\n     * @param {function(Object):string=} toStrFunction optional function used\n     * to convert keys to strings. If the keys aren't strings or if toString()\n     * is not appropriate, a custom function which receives a key and returns a\n     * unique string must be provided.\n     */\n    function FactoryDictionary(defaultFactoryFunction, toStrFunction) {\n        _super.call(this, toStrFunction);\n        this.defaultFactoryFunction = defaultFactoryFunction;\n    }\n    /**\n     * Associates the specified default value with the specified key in this dictionary,\n     * if it didn't contain the key yet. If the key existed, the existing value will be used.\n     * @param {Object} key key with which the specified value is to be\n     * associated.\n     * @param {Object} defaultValue default value to be associated with the specified key.\n     * @return {*} previous value associated with the specified key, or the default value,\n     * if the key didn't exist yet.\n     */\n    FactoryDictionary.prototype.setDefault = function (key, defaultValue) {\n        var currentValue = _super.prototype.getValue.call(this, key);\n        if (util.isUndefined(currentValue)) {\n            this.setValue(key, defaultValue);\n            return defaultValue;\n        }\n        return currentValue;\n    };\n    /**\n     * Returns the value to which this dictionary maps the specified key.\n     * Returns a default value created by the factory passed in the constructor,\n     * if this dictionary contains no mapping for this key. The missing key will\n     * automatically be added to the dictionary.\n     * @param {Object} key key whose associated value is to be returned.\n     * @return {*} the value to which this dictionary maps the specified key or\n     * a default value if the map contains no mapping for this key.\n     */\n    FactoryDictionary.prototype.getValue = function (key) {\n        return this.setDefault(key, this.defaultFactoryFunction());\n    };\n    return FactoryDictionary;\n}(Dictionary_1.default));\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.default = FactoryDictionary;\n//# sourceMappingURL=FactoryDictionary.js.map","\"use strict\";\nvar collections = require('./util');\nvar arrays = require('./arrays');\nvar Heap = (function () {\n    /**\n     * Creates an empty Heap.\n     * @class\n     * <p>A heap is a binary tree, where the nodes maintain the heap property:\n     * each node is smaller than each of its children and therefore a MinHeap\n     * This implementation uses an array to store elements.</p>\n     * <p>If the inserted elements are custom objects a compare function must be provided,\n     *  at construction time, otherwise the <=, === and >= operators are\n     * used to compare elements. Example:</p>\n     *\n     * <pre>\n     * function compare(a, b) {\n     *  if (a is less than b by some ordering criterion) {\n     *     return -1;\n     *  } if (a is greater than b by the ordering criterion) {\n     *     return 1;\n     *  }\n     *  // a must be equal to b\n     *  return 0;\n     * }\n     * </pre>\n     *\n     * <p>If a Max-Heap is wanted (greater elements on top) you can a provide a\n     * reverse compare function to accomplish that behavior. Example:</p>\n     *\n     * <pre>\n     * function reverseCompare(a, b) {\n     *  if (a is less than b by some ordering criterion) {\n     *     return 1;\n     *  } if (a is greater than b by the ordering criterion) {\n     *     return -1;\n     *  }\n     *  // a must be equal to b\n     *  return 0;\n     * }\n     * </pre>\n     *\n     * @constructor\n     * @param {function(Object,Object):number=} compareFunction optional\n     * function used to compare two elements. Must return a negative integer,\n     * zero, or a positive integer as the first argument is less than, equal to,\n     * or greater than the second.\n     */\n    function Heap(compareFunction) {\n        /**\n         * Array used to store the elements od the heap.\n         * @type {Array.<Object>}\n         * @private\n         */\n        this.data = [];\n        this.compare = compareFunction || collections.defaultCompare;\n    }\n    /**\n     * Returns the index of the left child of the node at the given index.\n     * @param {number} nodeIndex The index of the node to get the left child\n     * for.\n     * @return {number} The index of the left child.\n     * @private\n     */\n    Heap.prototype.leftChildIndex = function (nodeIndex) {\n        return (2 * nodeIndex) + 1;\n    };\n    /**\n     * Returns the index of the right child of the node at the given index.\n     * @param {number} nodeIndex The index of the node to get the right child\n     * for.\n     * @return {number} The index of the right child.\n     * @private\n     */\n    Heap.prototype.rightChildIndex = function (nodeIndex) {\n        return (2 * nodeIndex) + 2;\n    };\n    /**\n     * Returns the index of the parent of the node at the given index.\n     * @param {number} nodeIndex The index of the node to get the parent for.\n     * @return {number} The index of the parent.\n     * @private\n     */\n    Heap.prototype.parentIndex = function (nodeIndex) {\n        return Math.floor((nodeIndex - 1) / 2);\n    };\n    /**\n     * Returns the index of the smaller child node (if it exists).\n     * @param {number} leftChild left child index.\n     * @param {number} rightChild right child index.\n     * @return {number} the index with the minimum value or -1 if it doesn't\n     * exists.\n     * @private\n     */\n    Heap.prototype.minIndex = function (leftChild, rightChild) {\n        if (rightChild >= this.data.length) {\n            if (leftChild >= this.data.length) {\n                return -1;\n            }\n            else {\n                return leftChild;\n            }\n        }\n        else {\n            if (this.compare(this.data[leftChild], this.data[rightChild]) <= 0) {\n                return leftChild;\n            }\n            else {\n                return rightChild;\n            }\n        }\n    };\n    /**\n     * Moves the node at the given index up to its proper place in the heap.\n     * @param {number} index The index of the node to move up.\n     * @private\n     */\n    Heap.prototype.siftUp = function (index) {\n        var parent = this.parentIndex(index);\n        while (index > 0 && this.compare(this.data[parent], this.data[index]) > 0) {\n            arrays.swap(this.data, parent, index);\n            index = parent;\n            parent = this.parentIndex(index);\n        }\n    };\n    /**\n     * Moves the node at the given index down to its proper place in the heap.\n     * @param {number} nodeIndex The index of the node to move down.\n     * @private\n     */\n    Heap.prototype.siftDown = function (nodeIndex) {\n        //smaller child index\n        var min = this.minIndex(this.leftChildIndex(nodeIndex), this.rightChildIndex(nodeIndex));\n        while (min >= 0 && this.compare(this.data[nodeIndex], this.data[min]) > 0) {\n            arrays.swap(this.data, min, nodeIndex);\n            nodeIndex = min;\n            min = this.minIndex(this.leftChildIndex(nodeIndex), this.rightChildIndex(nodeIndex));\n        }\n    };\n    /**\n     * Retrieves but does not remove the root element of this heap.\n     * @return {*} The value at the root of the heap. Returns undefined if the\n     * heap is empty.\n     */\n    Heap.prototype.peek = function () {\n        if (this.data.length > 0) {\n            return this.data[0];\n        }\n        else {\n            return undefined;\n        }\n    };\n    /**\n     * Adds the given element into the heap.\n     * @param {*} element the element.\n     * @return true if the element was added or fals if it is undefined.\n     */\n    Heap.prototype.add = function (element) {\n        if (collections.isUndefined(element)) {\n            return undefined;\n        }\n        this.data.push(element);\n        this.siftUp(this.data.length - 1);\n        return true;\n    };\n    /**\n     * Retrieves and removes the root element of this heap.\n     * @return {*} The value removed from the root of the heap. Returns\n     * undefined if the heap is empty.\n     */\n    Heap.prototype.removeRoot = function () {\n        if (this.data.length > 0) {\n            var obj = this.data[0];\n            this.data[0] = this.data[this.data.length - 1];\n            this.data.splice(this.data.length - 1, 1);\n            if (this.data.length > 0) {\n                this.siftDown(0);\n            }\n            return obj;\n        }\n        return undefined;\n    };\n    /**\n     * Returns true if this heap contains the specified element.\n     * @param {Object} element element to search for.\n     * @return {boolean} true if this Heap contains the specified element, false\n     * otherwise.\n     */\n    Heap.prototype.contains = function (element) {\n        var equF = collections.compareToEquals(this.compare);\n        return arrays.contains(this.data, element, equF);\n    };\n    /**\n     * Returns the number of elements in this heap.\n     * @return {number} the number of elements in this heap.\n     */\n    Heap.prototype.size = function () {\n        return this.data.length;\n    };\n    /**\n     * Checks if this heap is empty.\n     * @return {boolean} true if and only if this heap contains no items; false\n     * otherwise.\n     */\n    Heap.prototype.isEmpty = function () {\n        return this.data.length <= 0;\n    };\n    /**\n     * Removes all of the elements from this heap.\n     */\n    Heap.prototype.clear = function () {\n        this.data.length = 0;\n    };\n    /**\n     * Executes the provided function once for each element present in this heap in\n     * no particular order.\n     * @param {function(Object):*} callback function to execute, it is\n     * invoked with one argument: the element value, to break the iteration you can\n     * optionally return false.\n     */\n    Heap.prototype.forEach = function (callback) {\n        arrays.forEach(this.data, callback);\n    };\n    return Heap;\n}());\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.default = Heap;\n//# sourceMappingURL=Heap.js.map","\"use strict\";\nvar __extends = (this && this.__extends) || function (d, b) {\n    for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p];\n    function __() { this.constructor = d; }\n    d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n};\nvar Dictionary_1 = require('./Dictionary');\nvar util = require('./util');\n/**\n * This class is used by the LinkedDictionary Internally\n * Has to be a class, not an interface, because it needs to have\n * the 'unlink' function defined.\n */\nvar LinkedDictionaryPair = (function () {\n    function LinkedDictionaryPair(key, value) {\n        this.key = key;\n        this.value = value;\n    }\n    LinkedDictionaryPair.prototype.unlink = function () {\n        this.prev.next = this.next;\n        this.next.prev = this.prev;\n    };\n    return LinkedDictionaryPair;\n}());\nvar LinkedDictionary = (function (_super) {\n    __extends(LinkedDictionary, _super);\n    function LinkedDictionary(toStrFunction) {\n        _super.call(this, toStrFunction);\n        this.head = new LinkedDictionaryPair(null, null);\n        this.tail = new LinkedDictionaryPair(null, null);\n        this.head.next = this.tail;\n        this.tail.prev = this.head;\n    }\n    /**\n     * Inserts the new node to the 'tail' of the list, updating the\n     * neighbors, and moving 'this.tail' (the End of List indicator) that\n     * to the end.\n     */\n    LinkedDictionary.prototype.appendToTail = function (entry) {\n        var lastNode = this.tail.prev;\n        lastNode.next = entry;\n        entry.prev = lastNode;\n        entry.next = this.tail;\n        this.tail.prev = entry;\n    };\n    /**\n     * Retrieves a linked dictionary from the table internally\n     */\n    LinkedDictionary.prototype.getLinkedDictionaryPair = function (key) {\n        if (util.isUndefined(key)) {\n            return undefined;\n        }\n        var k = '$' + this.toStr(key);\n        var pair = (this.table[k]);\n        return pair;\n    };\n    /**\n     * Returns the value to which this dictionary maps the specified key.\n     * Returns undefined if this dictionary contains no mapping for this key.\n     * @param {Object} key key whose associated value is to be returned.\n     * @return {*} the value to which this dictionary maps the specified key or\n     * undefined if the map contains no mapping for this key.\n     */\n    LinkedDictionary.prototype.getValue = function (key) {\n        var pair = this.getLinkedDictionaryPair(key);\n        if (!util.isUndefined(pair)) {\n            return pair.value;\n        }\n        return undefined;\n    };\n    /**\n     * Removes the mapping for this key from this dictionary if it is present.\n     * Also, if a value is present for this key, the entry is removed from the\n     * insertion ordering.\n     * @param {Object} key key whose mapping is to be removed from the\n     * dictionary.\n     * @return {*} previous value associated with specified key, or undefined if\n     * there was no mapping for key.\n     */\n    LinkedDictionary.prototype.remove = function (key) {\n        var pair = this.getLinkedDictionaryPair(key);\n        if (!util.isUndefined(pair)) {\n            _super.prototype.remove.call(this, key); // This will remove it from the table\n            pair.unlink(); // This will unlink it from the chain\n            return pair.value;\n        }\n        return undefined;\n    };\n    /**\n    * Removes all mappings from this LinkedDictionary.\n    * @this {collections.LinkedDictionary}\n    */\n    LinkedDictionary.prototype.clear = function () {\n        _super.prototype.clear.call(this);\n        this.head.next = this.tail;\n        this.tail.prev = this.head;\n    };\n    /**\n     * Internal function used when updating an existing KeyValue pair.\n     * It places the new value indexed by key into the table, but maintains\n     * its place in the linked ordering.\n     */\n    LinkedDictionary.prototype.replace = function (oldPair, newPair) {\n        var k = '$' + this.toStr(newPair.key);\n        // set the new Pair's links to existingPair's links\n        newPair.next = oldPair.next;\n        newPair.prev = oldPair.prev;\n        // Delete Existing Pair from the table, unlink it from chain.\n        // As a result, the nElements gets decremented by this operation\n        this.remove(oldPair.key);\n        // Link new Pair in place of where oldPair was,\n        // by pointing the old pair's neighbors to it.\n        newPair.prev.next = newPair;\n        newPair.next.prev = newPair;\n        this.table[k] = newPair;\n        // To make up for the fact that the number of elements was decremented,\n        // We need to increase it by one.\n        ++this.nElements;\n    };\n    /**\n     * Associates the specified value with the specified key in this dictionary.\n     * If the dictionary previously contained a mapping for this key, the old\n     * value is replaced by the specified value.\n     * Updating of a key that already exists maintains its place in the\n     * insertion order into the map.\n     * @param {Object} key key with which the specified value is to be\n     * associated.\n     * @param {Object} value value to be associated with the specified key.\n     * @return {*} previous value associated with the specified key, or undefined if\n     * there was no mapping for the key or if the key/value are undefined.\n     */\n    LinkedDictionary.prototype.setValue = function (key, value) {\n        if (util.isUndefined(key) || util.isUndefined(value)) {\n            return undefined;\n        }\n        var existingPair = this.getLinkedDictionaryPair(key);\n        var newPair = new LinkedDictionaryPair(key, value);\n        var k = '$' + this.toStr(key);\n        // If there is already an element for that key, we\n        // keep it's place in the LinkedList\n        if (!util.isUndefined(existingPair)) {\n            this.replace(existingPair, newPair);\n            return existingPair.value;\n        }\n        else {\n            this.appendToTail(newPair);\n            this.table[k] = newPair;\n            ++this.nElements;\n            return undefined;\n        }\n    };\n    /**\n     * Returns an array containing all of the keys in this LinkedDictionary, ordered\n     * by insertion order.\n     * @return {Array} an array containing all of the keys in this LinkedDictionary,\n     * ordered by insertion order.\n     */\n    LinkedDictionary.prototype.keys = function () {\n        var array = [];\n        this.forEach(function (key, value) {\n            array.push(key);\n        });\n        return array;\n    };\n    /**\n     * Returns an array containing all of the values in this LinkedDictionary, ordered by\n     * insertion order.\n     * @return {Array} an array containing all of the values in this LinkedDictionary,\n     * ordered by insertion order.\n     */\n    LinkedDictionary.prototype.values = function () {\n        var array = [];\n        this.forEach(function (key, value) {\n            array.push(value);\n        });\n        return array;\n    };\n    /**\n    * Executes the provided function once for each key-value pair\n    * present in this LinkedDictionary. It is done in the order of insertion\n    * into the LinkedDictionary\n    * @param {function(Object,Object):*} callback function to execute, it is\n    * invoked with two arguments: key and value. To break the iteration you can\n    * optionally return false.\n    */\n    LinkedDictionary.prototype.forEach = function (callback) {\n        var crawlNode = this.head.next;\n        while (crawlNode.next != null) {\n            var ret = callback(crawlNode.key, crawlNode.value);\n            if (ret === false) {\n                return;\n            }\n            crawlNode = crawlNode.next;\n        }\n    };\n    return LinkedDictionary;\n}(Dictionary_1.default));\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.default = LinkedDictionary; // End of LinkedDictionary\n// /**\n//  * Returns true if this dictionary is equal to the given dictionary.\n//  * Two dictionaries are equal if they contain the same mappings.\n//  * @param {collections.Dictionary} other the other dictionary.\n//  * @param {function(Object,Object):boolean=} valuesEqualFunction optional\n//  * function used to check if two values are equal.\n//  * @return {boolean} true if this dictionary is equal to the given dictionary.\n//  */\n// collections.Dictionary.prototype.equals = function(other,valuesEqualFunction) {\n// \tconst eqF = valuesEqualFunction || collections.defaultEquals;\n// \tif(!(other instanceof collections.Dictionary)){\n// \t\treturn false;\n// \t}\n// \tif(this.size() !== other.size()){\n// \t\treturn false;\n// \t}\n// \treturn this.equalsAux(this.firstNode,other.firstNode,eqF);\n// }\n//# sourceMappingURL=LinkedDictionary.js.map","\"use strict\";\nvar util = require('./util');\nvar arrays = require('./arrays');\nvar LinkedList = (function () {\n    /**\n    * Creates an empty Linked List.\n    * @class A linked list is a data structure consisting of a group of nodes\n    * which together represent a sequence.\n    * @constructor\n    */\n    function LinkedList() {\n        /**\n        * First node in the list\n        * @type {Object}\n        * @private\n        */\n        this.firstNode = null;\n        /**\n        * Last node in the list\n        * @type {Object}\n        * @private\n        */\n        this.lastNode = null;\n        /**\n        * Number of elements in the list\n        * @type {number}\n        * @private\n        */\n        this.nElements = 0;\n    }\n    /**\n    * Adds an element to this list.\n    * @param {Object} item element to be added.\n    * @param {number=} index optional index to add the element. If no index is specified\n    * the element is added to the end of this list.\n    * @return {boolean} true if the element was added or false if the index is invalid\n    * or if the element is undefined.\n    */\n    LinkedList.prototype.add = function (item, index) {\n        if (util.isUndefined(index)) {\n            index = this.nElements;\n        }\n        if (index < 0 || index > this.nElements || util.isUndefined(item)) {\n            return false;\n        }\n        var newNode = this.createNode(item);\n        if (this.nElements === 0) {\n            // First node in the list.\n            this.firstNode = newNode;\n            this.lastNode = newNode;\n        }\n        else if (index === this.nElements) {\n            // Insert at the end.\n            this.lastNode.next = newNode;\n            this.lastNode = newNode;\n        }\n        else if (index === 0) {\n            // Change first node.\n            newNode.next = this.firstNode;\n            this.firstNode = newNode;\n        }\n        else {\n            var prev = this.nodeAtIndex(index - 1);\n            newNode.next = prev.next;\n            prev.next = newNode;\n        }\n        this.nElements++;\n        return true;\n    };\n    /**\n    * Returns the first element in this list.\n    * @return {*} the first element of the list or undefined if the list is\n    * empty.\n    */\n    LinkedList.prototype.first = function () {\n        if (this.firstNode !== null) {\n            return this.firstNode.element;\n        }\n        return undefined;\n    };\n    /**\n    * Returns the last element in this list.\n    * @return {*} the last element in the list or undefined if the list is\n    * empty.\n    */\n    LinkedList.prototype.last = function () {\n        if (this.lastNode !== null) {\n            return this.lastNode.element;\n        }\n        return undefined;\n    };\n    /**\n     * Returns the element at the specified position in this list.\n     * @param {number} index desired index.\n     * @return {*} the element at the given index or undefined if the index is\n     * out of bounds.\n     */\n    LinkedList.prototype.elementAtIndex = function (index) {\n        var node = this.nodeAtIndex(index);\n        if (node === null) {\n            return undefined;\n        }\n        return node.element;\n    };\n    /**\n     * Returns the index in this list of the first occurrence of the\n     * specified element, or -1 if the List does not contain this element.\n     * <p>If the elements inside this list are\n     * not comparable with the === operator a custom equals function should be\n     * provided to perform searches, the function must receive two arguments and\n     * return true if they are equal, false otherwise. Example:</p>\n     *\n     * <pre>\n     * const petsAreEqualByName = function(pet1, pet2) {\n     *  return pet1.name === pet2.name;\n     * }\n     * </pre>\n     * @param {Object} item element to search for.\n     * @param {function(Object,Object):boolean=} equalsFunction Optional\n     * function used to check if two elements are equal.\n     * @return {number} the index in this list of the first occurrence\n     * of the specified element, or -1 if this list does not contain the\n     * element.\n     */\n    LinkedList.prototype.indexOf = function (item, equalsFunction) {\n        var equalsF = equalsFunction || util.defaultEquals;\n        if (util.isUndefined(item)) {\n            return -1;\n        }\n        var currentNode = this.firstNode;\n        var index = 0;\n        while (currentNode !== null) {\n            if (equalsF(currentNode.element, item)) {\n                return index;\n            }\n            index++;\n            currentNode = currentNode.next;\n        }\n        return -1;\n    };\n    /**\n       * Returns true if this list contains the specified element.\n       * <p>If the elements inside the list are\n       * not comparable with the === operator a custom equals function should be\n       * provided to perform searches, the function must receive two arguments and\n       * return true if they are equal, false otherwise. Example:</p>\n       *\n       * <pre>\n       * const petsAreEqualByName = function(pet1, pet2) {\n       *  return pet1.name === pet2.name;\n       * }\n       * </pre>\n       * @param {Object} item element to search for.\n       * @param {function(Object,Object):boolean=} equalsFunction Optional\n       * function used to check if two elements are equal.\n       * @return {boolean} true if this list contains the specified element, false\n       * otherwise.\n       */\n    LinkedList.prototype.contains = function (item, equalsFunction) {\n        return (this.indexOf(item, equalsFunction) >= 0);\n    };\n    /**\n     * Removes the first occurrence of the specified element in this list.\n     * <p>If the elements inside the list are\n     * not comparable with the === operator a custom equals function should be\n     * provided to perform searches, the function must receive two arguments and\n     * return true if they are equal, false otherwise. Example:</p>\n     *\n     * <pre>\n     * const petsAreEqualByName = function(pet1, pet2) {\n     *  return pet1.name === pet2.name;\n     * }\n     * </pre>\n     * @param {Object} item element to be removed from this list, if present.\n     * @return {boolean} true if the list contained the specified element.\n     */\n    LinkedList.prototype.remove = function (item, equalsFunction) {\n        var equalsF = equalsFunction || util.defaultEquals;\n        if (this.nElements < 1 || util.isUndefined(item)) {\n            return false;\n        }\n        var previous = null;\n        var currentNode = this.firstNode;\n        while (currentNode !== null) {\n            if (equalsF(currentNode.element, item)) {\n                if (currentNode === this.firstNode) {\n                    this.firstNode = this.firstNode.next;\n                    if (currentNode === this.lastNode) {\n                        this.lastNode = null;\n                    }\n                }\n                else if (currentNode === this.lastNode) {\n                    this.lastNode = previous;\n                    previous.next = currentNode.next;\n                    currentNode.next = null;\n                }\n                else {\n                    previous.next = currentNode.next;\n                    currentNode.next = null;\n                }\n                this.nElements--;\n                return true;\n            }\n            previous = currentNode;\n            currentNode = currentNode.next;\n        }\n        return false;\n    };\n    /**\n     * Removes all of the elements from this list.\n     */\n    LinkedList.prototype.clear = function () {\n        this.firstNode = null;\n        this.lastNode = null;\n        this.nElements = 0;\n    };\n    /**\n     * Returns true if this list is equal to the given list.\n     * Two lists are equal if they have the same elements in the same order.\n     * @param {LinkedList} other the other list.\n     * @param {function(Object,Object):boolean=} equalsFunction optional\n     * function used to check if two elements are equal. If the elements in the lists\n     * are custom objects you should provide a function, otherwise\n     * the === operator is used to check equality between elements.\n     * @return {boolean} true if this list is equal to the given list.\n     */\n    LinkedList.prototype.equals = function (other, equalsFunction) {\n        var eqF = equalsFunction || util.defaultEquals;\n        if (!(other instanceof LinkedList)) {\n            return false;\n        }\n        if (this.size() !== other.size()) {\n            return false;\n        }\n        return this.equalsAux(this.firstNode, other.firstNode, eqF);\n    };\n    /**\n    * @private\n    */\n    LinkedList.prototype.equalsAux = function (n1, n2, eqF) {\n        while (n1 !== null) {\n            if (!eqF(n1.element, n2.element)) {\n                return false;\n            }\n            n1 = n1.next;\n            n2 = n2.next;\n        }\n        return true;\n    };\n    /**\n     * Removes the element at the specified position in this list.\n     * @param {number} index given index.\n     * @return {*} removed element or undefined if the index is out of bounds.\n     */\n    LinkedList.prototype.removeElementAtIndex = function (index) {\n        if (index < 0 || index >= this.nElements) {\n            return undefined;\n        }\n        var element;\n        if (this.nElements === 1) {\n            //First node in the list.\n            element = this.firstNode.element;\n            this.firstNode = null;\n            this.lastNode = null;\n        }\n        else {\n            var previous = this.nodeAtIndex(index - 1);\n            if (previous === null) {\n                element = this.firstNode.element;\n                this.firstNode = this.firstNode.next;\n            }\n            else if (previous.next === this.lastNode) {\n                element = this.lastNode.element;\n                this.lastNode = previous;\n            }\n            if (previous !== null) {\n                element = previous.next.element;\n                previous.next = previous.next.next;\n            }\n        }\n        this.nElements--;\n        return element;\n    };\n    /**\n     * Executes the provided function once for each element present in this list in order.\n     * @param {function(Object):*} callback function to execute, it is\n     * invoked with one argument: the element value, to break the iteration you can\n     * optionally return false.\n     */\n    LinkedList.prototype.forEach = function (callback) {\n        var currentNode = this.firstNode;\n        while (currentNode !== null) {\n            if (callback(currentNode.element) === false) {\n                break;\n            }\n            currentNode = currentNode.next;\n        }\n    };\n    /**\n     * Reverses the order of the elements in this linked list (makes the last\n     * element first, and the first element last).\n     */\n    LinkedList.prototype.reverse = function () {\n        var previous = null;\n        var current = this.firstNode;\n        var temp = null;\n        while (current !== null) {\n            temp = current.next;\n            current.next = previous;\n            previous = current;\n            current = temp;\n        }\n        temp = this.firstNode;\n        this.firstNode = this.lastNode;\n        this.lastNode = temp;\n    };\n    /**\n     * Returns an array containing all of the elements in this list in proper\n     * sequence.\n     * @return {Array.<*>} an array containing all of the elements in this list,\n     * in proper sequence.\n     */\n    LinkedList.prototype.toArray = function () {\n        var array = [];\n        var currentNode = this.firstNode;\n        while (currentNode !== null) {\n            array.push(currentNode.element);\n            currentNode = currentNode.next;\n        }\n        return array;\n    };\n    /**\n     * Returns the number of elements in this list.\n     * @return {number} the number of elements in this list.\n     */\n    LinkedList.prototype.size = function () {\n        return this.nElements;\n    };\n    /**\n     * Returns true if this list contains no elements.\n     * @return {boolean} true if this list contains no elements.\n     */\n    LinkedList.prototype.isEmpty = function () {\n        return this.nElements <= 0;\n    };\n    LinkedList.prototype.toString = function () {\n        return arrays.toString(this.toArray());\n    };\n    /**\n     * @private\n     */\n    LinkedList.prototype.nodeAtIndex = function (index) {\n        if (index < 0 || index >= this.nElements) {\n            return null;\n        }\n        if (index === (this.nElements - 1)) {\n            return this.lastNode;\n        }\n        var node = this.firstNode;\n        for (var i = 0; i < index; i++) {\n            node = node.next;\n        }\n        return node;\n    };\n    /**\n     * @private\n     */\n    LinkedList.prototype.createNode = function (item) {\n        return {\n            element: item,\n            next: null\n        };\n    };\n    return LinkedList;\n}());\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.default = LinkedList; // End of linked list\n//# sourceMappingURL=LinkedList.js.map","\"use strict\";\nvar util = require('./util');\nvar Dictionary_1 = require('./Dictionary');\nvar arrays = require('./arrays');\nvar MultiDictionary = (function () {\n    /**\n     * Creates an empty multi dictionary.\n     * @class <p>A multi dictionary is a special kind of dictionary that holds\n     * multiple values against each key. Setting a value into the dictionary will\n     * add the value to an array at that key. Getting a key will return an array,\n     * holding all the values set to that key.\n     * You can configure to allow duplicates in the values.\n     * This implementation accepts any kind of objects as keys.</p>\n     *\n     * <p>If the keys are custom objects a function which converts keys to strings must be\n     * provided. Example:</p>\n     *\n     * <pre>\n     * function petToString(pet) {\n       *  return pet.name;\n       * }\n     * </pre>\n     * <p>If the values are custom objects a function to check equality between values\n     * must be provided. Example:</p>\n     *\n     * <pre>\n     * function petsAreEqualByAge(pet1,pet2) {\n       *  return pet1.age===pet2.age;\n       * }\n     * </pre>\n     * @constructor\n     * @param {function(Object):string=} toStrFunction optional function\n     * to convert keys to strings. If the keys aren't strings or if toString()\n     * is not appropriate, a custom function which receives a key and returns a\n     * unique string must be provided.\n     * @param {function(Object,Object):boolean=} valuesEqualsFunction optional\n     * function to check if two values are equal.\n     *\n     * @param allowDuplicateValues\n     */\n    function MultiDictionary(toStrFunction, valuesEqualsFunction, allowDuplicateValues) {\n        if (allowDuplicateValues === void 0) { allowDuplicateValues = false; }\n        this.dict = new Dictionary_1.default(toStrFunction);\n        this.equalsF = valuesEqualsFunction || util.defaultEquals;\n        this.allowDuplicate = allowDuplicateValues;\n    }\n    /**\n    * Returns an array holding the values to which this dictionary maps\n    * the specified key.\n    * Returns an empty array if this dictionary contains no mappings for this key.\n    * @param {Object} key key whose associated values are to be returned.\n    * @return {Array} an array holding the values to which this dictionary maps\n    * the specified key.\n    */\n    MultiDictionary.prototype.getValue = function (key) {\n        var values = this.dict.getValue(key);\n        if (util.isUndefined(values)) {\n            return [];\n        }\n        return arrays.copy(values);\n    };\n    /**\n     * Adds the value to the array associated with the specified key, if\n     * it is not already present.\n     * @param {Object} key key with which the specified value is to be\n     * associated.\n     * @param {Object} value the value to add to the array at the key\n     * @return {boolean} true if the value was not already associated with that key.\n     */\n    MultiDictionary.prototype.setValue = function (key, value) {\n        if (util.isUndefined(key) || util.isUndefined(value)) {\n            return false;\n        }\n        if (!this.containsKey(key)) {\n            this.dict.setValue(key, [value]);\n            return true;\n        }\n        var array = this.dict.getValue(key);\n        if (!this.allowDuplicate) {\n            if (arrays.contains(array, value, this.equalsF)) {\n                return false;\n            }\n        }\n        array.push(value);\n        return true;\n    };\n    /**\n     * Removes the specified values from the array of values associated with the\n     * specified key. If a value isn't given, all values associated with the specified\n     * key are removed.\n     * @param {Object} key key whose mapping is to be removed from the\n     * dictionary.\n     * @param {Object=} value optional argument to specify the value to remove\n     * from the array associated with the specified key.\n     * @return {*} true if the dictionary changed, false if the key doesn't exist or\n     * if the specified value isn't associated with the specified key.\n     */\n    MultiDictionary.prototype.remove = function (key, value) {\n        if (util.isUndefined(value)) {\n            var v = this.dict.remove(key);\n            return !util.isUndefined(v);\n        }\n        var array = this.dict.getValue(key);\n        if (arrays.remove(array, value, this.equalsF)) {\n            if (array.length === 0) {\n                this.dict.remove(key);\n            }\n            return true;\n        }\n        return false;\n    };\n    /**\n     * Returns an array containing all of the keys in this dictionary.\n     * @return {Array} an array containing all of the keys in this dictionary.\n     */\n    MultiDictionary.prototype.keys = function () {\n        return this.dict.keys();\n    };\n    /**\n     * Returns an array containing all of the values in this dictionary.\n     * @return {Array} an array containing all of the values in this dictionary.\n     */\n    MultiDictionary.prototype.values = function () {\n        var values = this.dict.values();\n        var array = [];\n        for (var _i = 0, values_1 = values; _i < values_1.length; _i++) {\n            var v = values_1[_i];\n            for (var _a = 0, v_1 = v; _a < v_1.length; _a++) {\n                var w = v_1[_a];\n                array.push(w);\n            }\n        }\n        return array;\n    };\n    /**\n     * Returns true if this dictionary at least one value associatted the specified key.\n     * @param {Object} key key whose presence in this dictionary is to be\n     * tested.\n     * @return {boolean} true if this dictionary at least one value associatted\n     * the specified key.\n     */\n    MultiDictionary.prototype.containsKey = function (key) {\n        return this.dict.containsKey(key);\n    };\n    /**\n     * Removes all mappings from this dictionary.\n     */\n    MultiDictionary.prototype.clear = function () {\n        this.dict.clear();\n    };\n    /**\n     * Returns the number of keys in this dictionary.\n     * @return {number} the number of key-value mappings in this dictionary.\n     */\n    MultiDictionary.prototype.size = function () {\n        return this.dict.size();\n    };\n    /**\n     * Returns true if this dictionary contains no mappings.\n     * @return {boolean} true if this dictionary contains no mappings.\n     */\n    MultiDictionary.prototype.isEmpty = function () {\n        return this.dict.isEmpty();\n    };\n    return MultiDictionary;\n}());\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.default = MultiDictionary; // end of multi dictionary\n//# sourceMappingURL=MultiDictionary.js.map","\"use strict\";\n(function (Direction) {\n    Direction[Direction[\"BEFORE\"] = 0] = \"BEFORE\";\n    Direction[Direction[\"AFTER\"] = 1] = \"AFTER\";\n    Direction[Direction[\"INSIDE_AT_END\"] = 2] = \"INSIDE_AT_END\";\n    Direction[Direction[\"INSIDE_AT_START\"] = 3] = \"INSIDE_AT_START\";\n})(exports.Direction || (exports.Direction = {}));\nvar Direction = exports.Direction;\nvar MultiRootTree = (function () {\n    function MultiRootTree(rootIds, nodes) {\n        if (rootIds === void 0) { rootIds = []; }\n        if (nodes === void 0) { nodes = {}; }\n        this.rootIds = rootIds;\n        this.nodes = nodes;\n    }\n    MultiRootTree.prototype.getRootIds = function () {\n        var clone = this.rootIds.slice();\n        return clone;\n    };\n    MultiRootTree.prototype.getNodes = function () {\n        var clone = {};\n        for (var nodeKey in this.nodes) {\n            if (this.nodes.hasOwnProperty(nodeKey)) {\n                clone[nodeKey] = this.nodes[nodeKey].slice();\n            }\n        }\n        return clone;\n    };\n    MultiRootTree.prototype.getObject = function () {\n        return {\n            rootIds: this.getRootIds(),\n            nodes: this.getNodes(),\n        };\n    };\n    MultiRootTree.prototype.moveIdBeforeId = function (moveId, beforeId) {\n        return this.moveId(moveId, beforeId, Direction.BEFORE);\n    };\n    MultiRootTree.prototype.moveIdAfterId = function (moveId, afterId) {\n        return this.moveId(moveId, afterId, Direction.AFTER);\n    };\n    MultiRootTree.prototype.moveIdIntoId = function (moveId, insideId, atStart) {\n        if (atStart === void 0) { atStart = true; }\n        if (atStart) {\n            return this.moveId(moveId, insideId, Direction.INSIDE_AT_START);\n        }\n        else {\n            return this.moveId(moveId, insideId, Direction.INSIDE_AT_END);\n        }\n    };\n    MultiRootTree.prototype.deleteId = function (id) {\n        this.rootDeleteId(id);\n        this.nodeAndSubNodesDelete(id);\n        this.nodeRefrencesDelete(id);\n    };\n    MultiRootTree.prototype.insertIdBeforeId = function (beforeId, insertId) {\n        var foundRootIdIndex = this.findRootId(beforeId);\n        if (foundRootIdIndex > -1) {\n            this.insertIdIntoRoot(insertId, foundRootIdIndex);\n        }\n        for (var nodeKey in this.nodes) {\n            if (this.nodes.hasOwnProperty(nodeKey)) {\n                var foundNodeIdIndex = this.findNodeId(nodeKey, beforeId);\n                if (foundNodeIdIndex > -1) {\n                    this.insertIdIntoNode(nodeKey, insertId, foundNodeIdIndex);\n                }\n            }\n        }\n    };\n    MultiRootTree.prototype.insertIdAfterId = function (belowId, insertId) {\n        var foundRootIdIndex = this.findRootId(belowId);\n        if (foundRootIdIndex > -1) {\n            this.insertIdIntoRoot(insertId, foundRootIdIndex + 1);\n        }\n        for (var nodeKey in this.nodes) {\n            if (this.nodes.hasOwnProperty(nodeKey)) {\n                var foundNodeIdIndex = this.findNodeId(nodeKey, belowId);\n                if (foundNodeIdIndex > -1) {\n                    this.insertIdIntoNode(nodeKey, insertId, foundNodeIdIndex + 1);\n                }\n            }\n        }\n    };\n    MultiRootTree.prototype.insertIdIntoId = function (insideId, insertId) {\n        this.nodeInsertAtEnd(insideId, insertId);\n        this.nodes[insertId] = [];\n    };\n    MultiRootTree.prototype.insertIdIntoRoot = function (id, position) {\n        if (position === undefined) {\n            this.rootInsertAtEnd(id);\n        }\n        else {\n            if (position < 0) {\n                var length_1 = this.rootIds.length;\n                this.rootIds.splice((position + length_1 + 1), 0, id);\n            }\n            else {\n                this.rootIds.splice(position, 0, id);\n            }\n        }\n        this.nodes[id] = this.nodes[id] || [];\n    };\n    MultiRootTree.prototype.insertIdIntoNode = function (nodeKey, id, position) {\n        this.nodes[nodeKey] = this.nodes[nodeKey] || [];\n        this.nodes[id] = this.nodes[id] || [];\n        if (position === undefined) {\n            this.nodeInsertAtEnd(nodeKey, id);\n        }\n        else {\n            if (position < 0) {\n                var length_2 = this.nodes[nodeKey].length;\n                this.nodes[nodeKey].splice((position + length_2 + 1), 0, id);\n            }\n            else {\n                this.nodes[nodeKey].splice(position, 0, id);\n            }\n        }\n    };\n    MultiRootTree.prototype.moveId = function (moveId, beforeId, direction) {\n        var sourceId = moveId;\n        var sourceRootIndex = this.findRootId(sourceId);\n        var sourceNodeKey;\n        var sourceNodeIdIndex;\n        if (this.nodes[beforeId]) {\n            sourceNodeKey = beforeId;\n        }\n        for (var nodeKey in this.nodes) {\n            if (this.nodes.hasOwnProperty(nodeKey)) {\n                sourceNodeIdIndex = this.findNodeId(nodeKey, beforeId);\n                break;\n            }\n        }\n        // got all\n        var targetId = beforeId;\n        var targetRootIndex = this.findRootId(targetId);\n        var targetNodeKey;\n        var targetNodeIdIndex;\n        if (this.nodes[beforeId]) {\n            targetNodeKey = beforeId;\n        }\n        for (var nodeKey in this.nodes) {\n            if (this.nodes.hasOwnProperty(nodeKey)) {\n                targetNodeIdIndex = this.findNodeId(nodeKey, beforeId);\n                break;\n            }\n        }\n        // got all\n        if (sourceRootIndex > -1) {\n            if (targetRootIndex > -1) {\n                this.rootDelete(sourceRootIndex);\n                switch (direction) {\n                    case Direction.BEFORE:\n                        this.insertIdIntoRoot(sourceId, targetRootIndex);\n                        break;\n                    case Direction.AFTER:\n                        this.insertIdIntoRoot(sourceId, targetRootIndex + 1);\n                        break;\n                    case Direction.INSIDE_AT_START:\n                        this.nodeInsertAtStart(targetId, sourceId);\n                        break;\n                    case Direction.INSIDE_AT_END:\n                        this.nodeInsertAtEnd(targetId, sourceId);\n                        break;\n                }\n            }\n            else {\n                // moving root (source) ABOVE node (target)\n                // will remove one entry from roots\n                this.rootDelete(sourceRootIndex);\n                for (var nodeKey in this.nodes) {\n                    if (this.nodes.hasOwnProperty(nodeKey)) {\n                        var index = this.findNodeId(nodeKey, targetId);\n                        if (index > -1) {\n                            switch (direction) {\n                                case Direction.BEFORE:\n                                    this.insertIdIntoNode(nodeKey, sourceId, index);\n                                    break;\n                                case Direction.AFTER:\n                                    this.insertIdIntoNode(nodeKey, sourceId, index + 1);\n                                    break;\n                                case Direction.INSIDE_AT_START:\n                                    this.nodeInsertAtStart(targetId, sourceId);\n                                    break;\n                                case Direction.INSIDE_AT_END:\n                                    this.nodeInsertAtEnd(targetId, sourceId);\n                                    break;\n                            }\n                            break;\n                        }\n                    }\n                }\n            }\n        }\n        else {\n            if (targetRootIndex > -1) {\n                // moving node (source) ABOVE root (target)\n                // delete source id from each node\n                for (var nodeKey in this.nodes) {\n                    if (this.nodes.hasOwnProperty(nodeKey)) {\n                        var index = this.findNodeId(nodeKey, sourceId);\n                        if (index > -1) {\n                            // this.nodeInsertId(nodeKey, sourceId, index);\n                            this.nodeDeleteAtIndex(nodeKey, index);\n                            break;\n                        }\n                    }\n                }\n                switch (direction) {\n                    case Direction.BEFORE:\n                        this.insertIdIntoRoot(sourceId, targetRootIndex);\n                        break;\n                    case Direction.AFTER:\n                        this.insertIdIntoRoot(sourceId, targetRootIndex + 1);\n                        break;\n                    case Direction.INSIDE_AT_START:\n                        this.nodeInsertAtStart(targetId, sourceId);\n                        break;\n                    case Direction.INSIDE_AT_END:\n                        this.nodeInsertAtEnd(targetId, sourceId);\n                        break;\n                }\n            }\n            else {\n                // moving node (source) ABOVE node (target)\n                // delete source id from each node\n                for (var nodeKey in this.nodes) {\n                    if (this.nodes.hasOwnProperty(nodeKey)) {\n                        var index = this.findNodeId(nodeKey, sourceId);\n                        if (index > -1) {\n                            this.nodeDeleteAtIndex(nodeKey, index);\n                            break;\n                        }\n                    }\n                }\n                for (var nodeKey in this.nodes) {\n                    if (this.nodes.hasOwnProperty(nodeKey)) {\n                        var index = this.findNodeId(nodeKey, targetId);\n                        if (index > -1) {\n                            switch (direction) {\n                                case Direction.BEFORE:\n                                    this.insertIdIntoNode(nodeKey, sourceId, index);\n                                    break;\n                                case Direction.AFTER:\n                                    this.insertIdIntoNode(nodeKey, sourceId, index + 1);\n                                    break;\n                                case Direction.INSIDE_AT_START:\n                                    this.nodeInsertAtStart(targetId, sourceId);\n                                    break;\n                                case Direction.INSIDE_AT_END:\n                                    this.nodeInsertAtEnd(targetId, sourceId);\n                                    break;\n                            }\n                            break;\n                        }\n                    }\n                }\n            }\n        }\n    };\n    MultiRootTree.prototype.swapArrayElements = function (arr, indexA, indexB) {\n        var temp = arr[indexA];\n        arr[indexA] = arr[indexB];\n        arr[indexB] = temp;\n        return arr;\n    };\n    ;\n    MultiRootTree.prototype.rootDeleteId = function (id) {\n        var index = this.findRootId(id);\n        if (index > -1) {\n            this.rootDelete(index);\n        }\n    };\n    MultiRootTree.prototype.nodeAndSubNodesDelete = function (nodeKey) {\n        var toDeleteLater = [];\n        for (var i = 0; i < this.nodes[nodeKey].length; i++) {\n            var id = this.nodes[nodeKey][i];\n            this.nodeAndSubNodesDelete(id);\n            toDeleteLater.push(nodeKey);\n        }\n        this.nodeDelete(nodeKey);\n        for (var i = 0; i < toDeleteLater.length; i++) {\n            this.nodeDelete(toDeleteLater[i]);\n        }\n    };\n    MultiRootTree.prototype.nodeRefrencesDelete = function (id) {\n        for (var nodeKey in this.nodes) {\n            if (this.nodes.hasOwnProperty(nodeKey)) {\n                for (var i = 0; i < this.nodes[nodeKey].length; i++) {\n                    var targetId = this.nodes[nodeKey][i];\n                    if (targetId === id) {\n                        this.nodeDeleteAtIndex(nodeKey, i);\n                    }\n                }\n            }\n        }\n    };\n    MultiRootTree.prototype.nodeDelete = function (nodeKey) {\n        delete this.nodes[nodeKey];\n    };\n    MultiRootTree.prototype.findRootId = function (id) {\n        return this.rootIds.indexOf(id);\n    };\n    MultiRootTree.prototype.findNodeId = function (nodeKey, id) {\n        return this.nodes[nodeKey].indexOf(id);\n    };\n    MultiRootTree.prototype.findNode = function (nodeKey) {\n        return this.nodes[nodeKey];\n    };\n    MultiRootTree.prototype.nodeInsertAtStart = function (nodeKey, id) {\n        this.nodes[nodeKey].unshift(id);\n    };\n    MultiRootTree.prototype.nodeInsertAtEnd = function (nodeKey, id) {\n        this.nodes[nodeKey].push(id);\n    };\n    MultiRootTree.prototype.rootDelete = function (index) {\n        this.rootIds.splice(index, 1);\n    };\n    MultiRootTree.prototype.nodeDeleteAtIndex = function (nodeKey, index) {\n        this.nodes[nodeKey].splice(index, 1);\n    };\n    MultiRootTree.prototype.rootInsertAtStart = function (id) {\n        this.rootIds.unshift(id);\n    };\n    MultiRootTree.prototype.rootInsertAtEnd = function (id) {\n        this.rootIds.push(id);\n    };\n    return MultiRootTree;\n}());\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.default = MultiRootTree;\n//# sourceMappingURL=MultiRootTree.js.map","\"use strict\";\nvar util = require('./util');\nvar Heap_1 = require('./Heap');\nvar PriorityQueue = (function () {\n    /**\n     * Creates an empty priority queue.\n     * @class <p>In a priority queue each element is associated with a \"priority\",\n     * elements are dequeued in highest-priority-first order (the elements with the\n     * highest priority are dequeued first). Priority Queues are implemented as heaps.\n     * If the inserted elements are custom objects a compare function must be provided,\n     * otherwise the <=, === and >= operators are used to compare object priority.</p>\n     * <pre>\n     * function compare(a, b) {\n     *  if (a is less than b by some ordering criterion) {\n     *     return -1;\n     *  } if (a is greater than b by the ordering criterion) {\n     *     return 1;\n     *  }\n     *  // a must be equal to b\n     *  return 0;\n     * }\n     * </pre>\n     * @constructor\n     * @param {function(Object,Object):number=} compareFunction optional\n     * function used to compare two element priorities. Must return a negative integer,\n     * zero, or a positive integer as the first argument is less than, equal to,\n     * or greater than the second.\n     */\n    function PriorityQueue(compareFunction) {\n        this.heap = new Heap_1.default(util.reverseCompareFunction(compareFunction));\n    }\n    /**\n     * Inserts the specified element into this priority queue.\n     * @param {Object} element the element to insert.\n     * @return {boolean} true if the element was inserted, or false if it is undefined.\n     */\n    PriorityQueue.prototype.enqueue = function (element) {\n        return this.heap.add(element);\n    };\n    /**\n     * Inserts the specified element into this priority queue.\n     * @param {Object} element the element to insert.\n     * @return {boolean} true if the element was inserted, or false if it is undefined.\n     */\n    PriorityQueue.prototype.add = function (element) {\n        return this.heap.add(element);\n    };\n    /**\n     * Retrieves and removes the highest priority element of this queue.\n     * @return {*} the the highest priority element of this queue,\n     *  or undefined if this queue is empty.\n     */\n    PriorityQueue.prototype.dequeue = function () {\n        if (this.heap.size() !== 0) {\n            var el = this.heap.peek();\n            this.heap.removeRoot();\n            return el;\n        }\n        return undefined;\n    };\n    /**\n     * Retrieves, but does not remove, the highest priority element of this queue.\n     * @return {*} the highest priority element of this queue, or undefined if this queue is empty.\n     */\n    PriorityQueue.prototype.peek = function () {\n        return this.heap.peek();\n    };\n    /**\n     * Returns true if this priority queue contains the specified element.\n     * @param {Object} element element to search for.\n     * @return {boolean} true if this priority queue contains the specified element,\n     * false otherwise.\n     */\n    PriorityQueue.prototype.contains = function (element) {\n        return this.heap.contains(element);\n    };\n    /**\n     * Checks if this priority queue is empty.\n     * @return {boolean} true if and only if this priority queue contains no items; false\n     * otherwise.\n     */\n    PriorityQueue.prototype.isEmpty = function () {\n        return this.heap.isEmpty();\n    };\n    /**\n     * Returns the number of elements in this priority queue.\n     * @return {number} the number of elements in this priority queue.\n     */\n    PriorityQueue.prototype.size = function () {\n        return this.heap.size();\n    };\n    /**\n     * Removes all of the elements from this priority queue.\n     */\n    PriorityQueue.prototype.clear = function () {\n        this.heap.clear();\n    };\n    /**\n     * Executes the provided function once for each element present in this queue in\n     * no particular order.\n     * @param {function(Object):*} callback function to execute, it is\n     * invoked with one argument: the element value, to break the iteration you can\n     * optionally return false.\n     */\n    PriorityQueue.prototype.forEach = function (callback) {\n        this.heap.forEach(callback);\n    };\n    return PriorityQueue;\n}());\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.default = PriorityQueue; // end of priority queue\n//# sourceMappingURL=PriorityQueue.js.map","\"use strict\";\nvar LinkedList_1 = require('./LinkedList');\nvar Queue = (function () {\n    /**\n     * Creates an empty queue.\n     * @class A queue is a First-In-First-Out (FIFO) data structure, the first\n     * element added to the queue will be the first one to be removed. This\n     * implementation uses a linked list as a container.\n     * @constructor\n     */\n    function Queue() {\n        this.list = new LinkedList_1.default();\n    }\n    /**\n     * Inserts the specified element into the end of this queue.\n     * @param {Object} elem the element to insert.\n     * @return {boolean} true if the element was inserted, or false if it is undefined.\n     */\n    Queue.prototype.enqueue = function (elem) {\n        return this.list.add(elem);\n    };\n    /**\n     * Inserts the specified element into the end of this queue.\n     * @param {Object} elem the element to insert.\n     * @return {boolean} true if the element was inserted, or false if it is undefined.\n     */\n    Queue.prototype.add = function (elem) {\n        return this.list.add(elem);\n    };\n    /**\n     * Retrieves and removes the head of this queue.\n     * @return {*} the head of this queue, or undefined if this queue is empty.\n     */\n    Queue.prototype.dequeue = function () {\n        if (this.list.size() !== 0) {\n            var el = this.list.first();\n            this.list.removeElementAtIndex(0);\n            return el;\n        }\n        return undefined;\n    };\n    /**\n     * Retrieves, but does not remove, the head of this queue.\n     * @return {*} the head of this queue, or undefined if this queue is empty.\n     */\n    Queue.prototype.peek = function () {\n        if (this.list.size() !== 0) {\n            return this.list.first();\n        }\n        return undefined;\n    };\n    /**\n     * Returns the number of elements in this queue.\n     * @return {number} the number of elements in this queue.\n     */\n    Queue.prototype.size = function () {\n        return this.list.size();\n    };\n    /**\n     * Returns true if this queue contains the specified element.\n     * <p>If the elements inside this stack are\n     * not comparable with the === operator, a custom equals function should be\n     * provided to perform searches, the function must receive two arguments and\n     * return true if they are equal, false otherwise. Example:</p>\n     *\n     * <pre>\n     * const petsAreEqualByName (pet1, pet2) {\n     *  return pet1.name === pet2.name;\n     * }\n     * </pre>\n     * @param {Object} elem element to search for.\n     * @param {function(Object,Object):boolean=} equalsFunction optional\n     * function to check if two elements are equal.\n     * @return {boolean} true if this queue contains the specified element,\n     * false otherwise.\n     */\n    Queue.prototype.contains = function (elem, equalsFunction) {\n        return this.list.contains(elem, equalsFunction);\n    };\n    /**\n     * Checks if this queue is empty.\n     * @return {boolean} true if and only if this queue contains no items; false\n     * otherwise.\n     */\n    Queue.prototype.isEmpty = function () {\n        return this.list.size() <= 0;\n    };\n    /**\n     * Removes all of the elements from this queue.\n     */\n    Queue.prototype.clear = function () {\n        this.list.clear();\n    };\n    /**\n     * Executes the provided function once for each element present in this queue in\n     * FIFO order.\n     * @param {function(Object):*} callback function to execute, it is\n     * invoked with one argument: the element value, to break the iteration you can\n     * optionally return false.\n     */\n    Queue.prototype.forEach = function (callback) {\n        this.list.forEach(callback);\n    };\n    return Queue;\n}());\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.default = Queue; // End of queue\n//# sourceMappingURL=Queue.js.map","\"use strict\";\nvar util = require('./util');\nvar arrays = require('./arrays');\nvar Dictionary_1 = require('./Dictionary');\nvar Set = (function () {\n    /**\n     * Creates an empty set.\n     * @class <p>A set is a data structure that contains no duplicate items.</p>\n     * <p>If the inserted elements are custom objects a function\n     * which converts elements to strings must be provided. Example:</p>\n     *\n     * <pre>\n     * function petToString(pet) {\n     *  return pet.name;\n     * }\n     * </pre>\n     *\n     * @constructor\n     * @param {function(Object):string=} toStringFunction optional function used\n     * to convert elements to strings. If the elements aren't strings or if toString()\n     * is not appropriate, a custom function which receives a onject and returns a\n     * unique string must be provided.\n     */\n    function Set(toStringFunction) {\n        this.dictionary = new Dictionary_1.default(toStringFunction);\n    }\n    /**\n     * Returns true if this set contains the specified element.\n     * @param {Object} element element to search for.\n     * @return {boolean} true if this set contains the specified element,\n     * false otherwise.\n     */\n    Set.prototype.contains = function (element) {\n        return this.dictionary.containsKey(element);\n    };\n    /**\n     * Adds the specified element to this set if it is not already present.\n     * @param {Object} element the element to insert.\n     * @return {boolean} true if this set did not already contain the specified element.\n     */\n    Set.prototype.add = function (element) {\n        if (this.contains(element) || util.isUndefined(element)) {\n            return false;\n        }\n        else {\n            this.dictionary.setValue(element, element);\n            return true;\n        }\n    };\n    /**\n     * Performs an intersecion between this an another set.\n     * Removes all values that are not present this set and the given set.\n     * @param {collections.Set} otherSet other set.\n     */\n    Set.prototype.intersection = function (otherSet) {\n        var set = this;\n        this.forEach(function (element) {\n            if (!otherSet.contains(element)) {\n                set.remove(element);\n            }\n            return true;\n        });\n    };\n    /**\n     * Performs a union between this an another set.\n     * Adds all values from the given set to this set.\n     * @param {collections.Set} otherSet other set.\n     */\n    Set.prototype.union = function (otherSet) {\n        var set = this;\n        otherSet.forEach(function (element) {\n            set.add(element);\n            return true;\n        });\n    };\n    /**\n     * Performs a difference between this an another set.\n     * Removes from this set all the values that are present in the given set.\n     * @param {collections.Set} otherSet other set.\n     */\n    Set.prototype.difference = function (otherSet) {\n        var set = this;\n        otherSet.forEach(function (element) {\n            set.remove(element);\n            return true;\n        });\n    };\n    /**\n     * Checks whether the given set contains all the elements in this set.\n     * @param {collections.Set} otherSet other set.\n     * @return {boolean} true if this set is a subset of the given set.\n     */\n    Set.prototype.isSubsetOf = function (otherSet) {\n        if (this.size() > otherSet.size()) {\n            return false;\n        }\n        var isSub = true;\n        this.forEach(function (element) {\n            if (!otherSet.contains(element)) {\n                isSub = false;\n                return false;\n            }\n            return true;\n        });\n        return isSub;\n    };\n    /**\n     * Removes the specified element from this set if it is present.\n     * @return {boolean} true if this set contained the specified element.\n     */\n    Set.prototype.remove = function (element) {\n        if (!this.contains(element)) {\n            return false;\n        }\n        else {\n            this.dictionary.remove(element);\n            return true;\n        }\n    };\n    /**\n     * Executes the provided function once for each element\n     * present in this set.\n     * @param {function(Object):*} callback function to execute, it is\n     * invoked with one arguments: the element. To break the iteration you can\n     * optionally return false.\n     */\n    Set.prototype.forEach = function (callback) {\n        this.dictionary.forEach(function (k, v) {\n            return callback(v);\n        });\n    };\n    /**\n     * Returns an array containing all of the elements in this set in arbitrary order.\n     * @return {Array} an array containing all of the elements in this set.\n     */\n    Set.prototype.toArray = function () {\n        return this.dictionary.values();\n    };\n    /**\n     * Returns true if this set contains no elements.\n     * @return {boolean} true if this set contains no elements.\n     */\n    Set.prototype.isEmpty = function () {\n        return this.dictionary.isEmpty();\n    };\n    /**\n     * Returns the number of elements in this set.\n     * @return {number} the number of elements in this set.\n     */\n    Set.prototype.size = function () {\n        return this.dictionary.size();\n    };\n    /**\n     * Removes all of the elements from this set.\n     */\n    Set.prototype.clear = function () {\n        this.dictionary.clear();\n    };\n    /*\n    * Provides a string representation for display\n    */\n    Set.prototype.toString = function () {\n        return arrays.toString(this.toArray());\n    };\n    return Set;\n}());\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.default = Set; // end of Set\n//# sourceMappingURL=Set.js.map","\"use strict\";\nvar LinkedList_1 = require('./LinkedList');\nvar Stack = (function () {\n    /**\n     * Creates an empty Stack.\n     * @class A Stack is a Last-In-First-Out (LIFO) data structure, the last\n     * element added to the stack will be the first one to be removed. This\n     * implementation uses a linked list as a container.\n     * @constructor\n     */\n    function Stack() {\n        this.list = new LinkedList_1.default();\n    }\n    /**\n     * Pushes an item onto the top of this stack.\n     * @param {Object} elem the element to be pushed onto this stack.\n     * @return {boolean} true if the element was pushed or false if it is undefined.\n     */\n    Stack.prototype.push = function (elem) {\n        return this.list.add(elem, 0);\n    };\n    /**\n     * Pushes an item onto the top of this stack.\n     * @param {Object} elem the element to be pushed onto this stack.\n     * @return {boolean} true if the element was pushed or false if it is undefined.\n     */\n    Stack.prototype.add = function (elem) {\n        return this.list.add(elem, 0);\n    };\n    /**\n     * Removes the object at the top of this stack and returns that object.\n     * @return {*} the object at the top of this stack or undefined if the\n     * stack is empty.\n     */\n    Stack.prototype.pop = function () {\n        return this.list.removeElementAtIndex(0);\n    };\n    /**\n     * Looks at the object at the top of this stack without removing it from the\n     * stack.\n     * @return {*} the object at the top of this stack or undefined if the\n     * stack is empty.\n     */\n    Stack.prototype.peek = function () {\n        return this.list.first();\n    };\n    /**\n     * Returns the number of elements in this stack.\n     * @return {number} the number of elements in this stack.\n     */\n    Stack.prototype.size = function () {\n        return this.list.size();\n    };\n    /**\n     * Returns true if this stack contains the specified element.\n     * <p>If the elements inside this stack are\n     * not comparable with the === operator, a custom equals function should be\n     * provided to perform searches, the function must receive two arguments and\n     * return true if they are equal, false otherwise. Example:</p>\n     *\n     * <pre>\n     * const petsAreEqualByName (pet1, pet2) {\n     *  return pet1.name === pet2.name;\n     * }\n     * </pre>\n     * @param {Object} elem element to search for.\n     * @param {function(Object,Object):boolean=} equalsFunction optional\n     * function to check if two elements are equal.\n     * @return {boolean} true if this stack contains the specified element,\n     * false otherwise.\n     */\n    Stack.prototype.contains = function (elem, equalsFunction) {\n        return this.list.contains(elem, equalsFunction);\n    };\n    /**\n     * Checks if this stack is empty.\n     * @return {boolean} true if and only if this stack contains no items; false\n     * otherwise.\n     */\n    Stack.prototype.isEmpty = function () {\n        return this.list.isEmpty();\n    };\n    /**\n     * Removes all of the elements from this stack.\n     */\n    Stack.prototype.clear = function () {\n        this.list.clear();\n    };\n    /**\n     * Executes the provided function once for each element present in this stack in\n     * LIFO order.\n     * @param {function(Object):*} callback function to execute, it is\n     * invoked with one argument: the element value, to break the iteration you can\n     * optionally return false.\n     */\n    Stack.prototype.forEach = function (callback) {\n        this.list.forEach(callback);\n    };\n    return Stack;\n}());\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.default = Stack; // End of stack\n//# sourceMappingURL=Stack.js.map","\"use strict\";\nvar util = require('./util');\n/**\n * Returns the position of the first occurrence of the specified item\n * within the specified array.4\n * @param {*} array the array in which to search the element.\n * @param {Object} item the element to search.\n * @param {function(Object,Object):boolean=} equalsFunction optional function used to\n * check equality between 2 elements.\n * @return {number} the position of the first occurrence of the specified element\n * within the specified array, or -1 if not found.\n */\nfunction indexOf(array, item, equalsFunction) {\n    var equals = equalsFunction || util.defaultEquals;\n    var length = array.length;\n    for (var i = 0; i < length; i++) {\n        if (equals(array[i], item)) {\n            return i;\n        }\n    }\n    return -1;\n}\nexports.indexOf = indexOf;\n/**\n * Returns the position of the last occurrence of the specified element\n * within the specified array.\n * @param {*} array the array in which to search the element.\n * @param {Object} item the element to search.\n * @param {function(Object,Object):boolean=} equalsFunction optional function used to\n * check equality between 2 elements.\n * @return {number} the position of the last occurrence of the specified element\n * within the specified array or -1 if not found.\n */\nfunction lastIndexOf(array, item, equalsFunction) {\n    var equals = equalsFunction || util.defaultEquals;\n    var length = array.length;\n    for (var i = length - 1; i >= 0; i--) {\n        if (equals(array[i], item)) {\n            return i;\n        }\n    }\n    return -1;\n}\nexports.lastIndexOf = lastIndexOf;\n/**\n * Returns true if the specified array contains the specified element.\n * @param {*} array the array in which to search the element.\n * @param {Object} item the element to search.\n * @param {function(Object,Object):boolean=} equalsFunction optional function to\n * check equality between 2 elements.\n * @return {boolean} true if the specified array contains the specified element.\n */\nfunction contains(array, item, equalsFunction) {\n    return indexOf(array, item, equalsFunction) >= 0;\n}\nexports.contains = contains;\n/**\n * Removes the first ocurrence of the specified element from the specified array.\n * @param {*} array the array in which to search element.\n * @param {Object} item the element to search.\n * @param {function(Object,Object):boolean=} equalsFunction optional function to\n * check equality between 2 elements.\n * @return {boolean} true if the array changed after this call.\n */\nfunction remove(array, item, equalsFunction) {\n    var index = indexOf(array, item, equalsFunction);\n    if (index < 0) {\n        return false;\n    }\n    array.splice(index, 1);\n    return true;\n}\nexports.remove = remove;\n/**\n * Returns the number of elements in the specified array equal\n * to the specified object.\n * @param {Array} array the array in which to determine the frequency of the element.\n * @param {Object} item the element whose frequency is to be determined.\n * @param {function(Object,Object):boolean=} equalsFunction optional function used to\n * check equality between 2 elements.\n * @return {number} the number of elements in the specified array\n * equal to the specified object.\n */\nfunction frequency(array, item, equalsFunction) {\n    var equals = equalsFunction || util.defaultEquals;\n    var length = array.length;\n    var freq = 0;\n    for (var i = 0; i < length; i++) {\n        if (equals(array[i], item)) {\n            freq++;\n        }\n    }\n    return freq;\n}\nexports.frequency = frequency;\n/**\n * Returns true if the two specified arrays are equal to one another.\n * Two arrays are considered equal if both arrays contain the same number\n * of elements, and all corresponding pairs of elements in the two\n * arrays are equal and are in the same order.\n * @param {Array} array1 one array to be tested for equality.\n * @param {Array} array2 the other array to be tested for equality.\n * @param {function(Object,Object):boolean=} equalsFunction optional function used to\n * check equality between elemements in the arrays.\n * @return {boolean} true if the two arrays are equal\n */\nfunction equals(array1, array2, equalsFunction) {\n    var equals = equalsFunction || util.defaultEquals;\n    if (array1.length !== array2.length) {\n        return false;\n    }\n    var length = array1.length;\n    for (var i = 0; i < length; i++) {\n        if (!equals(array1[i], array2[i])) {\n            return false;\n        }\n    }\n    return true;\n}\nexports.equals = equals;\n/**\n * Returns shallow a copy of the specified array.\n * @param {*} array the array to copy.\n * @return {Array} a copy of the specified array\n */\nfunction copy(array) {\n    return array.concat();\n}\nexports.copy = copy;\n/**\n * Swaps the elements at the specified positions in the specified array.\n * @param {Array} array The array in which to swap elements.\n * @param {number} i the index of one element to be swapped.\n * @param {number} j the index of the other element to be swapped.\n * @return {boolean} true if the array is defined and the indexes are valid.\n */\nfunction swap(array, i, j) {\n    if (i < 0 || i >= array.length || j < 0 || j >= array.length) {\n        return false;\n    }\n    var temp = array[i];\n    array[i] = array[j];\n    array[j] = temp;\n    return true;\n}\nexports.swap = swap;\nfunction toString(array) {\n    return '[' + array.toString() + ']';\n}\nexports.toString = toString;\n/**\n * Executes the provided function once for each element present in this array\n * starting from index 0 to length - 1.\n * @param {Array} array The array in which to iterate.\n * @param {function(Object):*} callback function to execute, it is\n * invoked with one argument: the element value, to break the iteration you can\n * optionally return false.\n */\nfunction forEach(array, callback) {\n    for (var _i = 0, array_1 = array; _i < array_1.length; _i++) {\n        var ele = array_1[_i];\n        if (callback(ele) === false) {\n            return;\n        }\n    }\n}\nexports.forEach = forEach;\n//# sourceMappingURL=arrays.js.map","\"use strict\";\nvar _hasOwnProperty = Object.prototype.hasOwnProperty;\nexports.has = function (obj, prop) {\n    return _hasOwnProperty.call(obj, prop);\n};\n/**\n * Default function to compare element order.\n * @function\n */\nfunction defaultCompare(a, b) {\n    if (a < b) {\n        return -1;\n    }\n    else if (a === b) {\n        return 0;\n    }\n    else {\n        return 1;\n    }\n}\nexports.defaultCompare = defaultCompare;\n/**\n * Default function to test equality.\n * @function\n */\nfunction defaultEquals(a, b) {\n    return a === b;\n}\nexports.defaultEquals = defaultEquals;\n/**\n * Default function to convert an object to a string.\n * @function\n */\nfunction defaultToString(item) {\n    if (item === null) {\n        return 'COLLECTION_NULL';\n    }\n    else if (isUndefined(item)) {\n        return 'COLLECTION_UNDEFINED';\n    }\n    else if (isString(item)) {\n        return '$s' + item;\n    }\n    else {\n        return '$o' + item.toString();\n    }\n}\nexports.defaultToString = defaultToString;\n/**\n* Joins all the properies of the object using the provided join string\n*/\nfunction makeString(item, join) {\n    if (join === void 0) { join = ','; }\n    if (item === null) {\n        return 'COLLECTION_NULL';\n    }\n    else if (isUndefined(item)) {\n        return 'COLLECTION_UNDEFINED';\n    }\n    else if (isString(item)) {\n        return item.toString();\n    }\n    else {\n        var toret = '{';\n        var first = true;\n        for (var prop in item) {\n            if (exports.has(item, prop)) {\n                if (first) {\n                    first = false;\n                }\n                else {\n                    toret = toret + join;\n                }\n                toret = toret + prop + ':' + item[prop];\n            }\n        }\n        return toret + '}';\n    }\n}\nexports.makeString = makeString;\n/**\n * Checks if the given argument is a function.\n * @function\n */\nfunction isFunction(func) {\n    return (typeof func) === 'function';\n}\nexports.isFunction = isFunction;\n/**\n * Checks if the given argument is undefined.\n * @function\n */\nfunction isUndefined(obj) {\n    return (typeof obj) === 'undefined';\n}\nexports.isUndefined = isUndefined;\n/**\n * Checks if the given argument is a string.\n * @function\n */\nfunction isString(obj) {\n    return Object.prototype.toString.call(obj) === '[object String]';\n}\nexports.isString = isString;\n/**\n * Reverses a compare function.\n * @function\n */\nfunction reverseCompareFunction(compareFunction) {\n    if (!isFunction(compareFunction)) {\n        return function (a, b) {\n            if (a < b) {\n                return 1;\n            }\n            else if (a === b) {\n                return 0;\n            }\n            else {\n                return -1;\n            }\n        };\n    }\n    else {\n        return function (d, v) {\n            return compareFunction(d, v) * -1;\n        };\n    }\n}\nexports.reverseCompareFunction = reverseCompareFunction;\n/**\n * Returns an equal function given a compare function.\n * @function\n */\nfunction compareToEquals(compareFunction) {\n    return function (a, b) {\n        return compareFunction(a, b) === 0;\n    };\n}\nexports.compareToEquals = compareToEquals;\n//# sourceMappingURL=util.js.map","\"use strict\";\n// Copyright 2013 Basarat Ali Syed. All Rights Reserved.\n//\n// Licensed under MIT open source license http://opensource.org/licenses/MIT\n//\n// Orginal javascript code was by Mauricio Santos\n//\nvar _arrays = require('./arrays');\nexports.arrays = _arrays;\nvar Bag_1 = require('./Bag');\nexports.Bag = Bag_1.default;\nvar BSTree_1 = require('./BSTree');\nexports.BSTree = BSTree_1.default;\nvar Dictionary_1 = require('./Dictionary');\nexports.Dictionary = Dictionary_1.default;\nvar Heap_1 = require('./Heap');\nexports.Heap = Heap_1.default;\nvar LinkedDictionary_1 = require('./LinkedDictionary');\nexports.LinkedDictionary = LinkedDictionary_1.default;\nvar LinkedList_1 = require('./LinkedList');\nexports.LinkedList = LinkedList_1.default;\nvar MultiDictionary_1 = require('./MultiDictionary');\nexports.MultiDictionary = MultiDictionary_1.default;\nvar FactoryDictionary_1 = require('./FactoryDictionary');\nexports.FactoryDictionary = FactoryDictionary_1.default;\nvar FactoryDictionary_2 = require('./FactoryDictionary');\nexports.DefaultDictionary = FactoryDictionary_2.default;\nvar Queue_1 = require('./Queue');\nexports.Queue = Queue_1.default;\nvar PriorityQueue_1 = require('./PriorityQueue');\nexports.PriorityQueue = PriorityQueue_1.default;\nvar Set_1 = require('./Set');\nexports.Set = Set_1.default;\nvar Stack_1 = require('./Stack');\nexports.Stack = Stack_1.default;\nvar MultiRootTree_1 = require('./MultiRootTree');\nexports.MultiRootTree = MultiRootTree_1.default;\nvar _util = require('./util');\nexports.util = _util;\n//# sourceMappingURL=index.js.map"]}
-return require('typescript-collections');
-});
\ No newline at end of file
diff --git a/dist/lib/umd.min.js b/dist/lib/umd.min.js
deleted file mode 100644
index cdb1e48..0000000
--- a/dist/lib/umd.min.js
+++ /dev/null
@@ -1 +0,0 @@
-!function(t){if("object"==typeof exports&&"undefined"!=typeof module)module.exports=t();else if("function"==typeof define&&define.amd)define([],t);else{var e;e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof self?self:this,e.listComponent=t()}}(function(){return require=function t(e,n,i){function r(s,u){if(!n[s]){if(!e[s]){var a="function"==typeof require&&require;if(!u&&a)return a(s,!0);if(o)return o(s,!0);var h=new Error("Cannot find module '"+s+"'");throw h.code="MODULE_NOT_FOUND",h}var l=n[s]={exports:{}};e[s][0].call(l.exports,function(t){var n=e[s][1][t];return r(n?n:t)},l,l.exports,t,e,n,i)}return n[s].exports}for(var o="function"==typeof require&&require,s=0;s<i.length;s++)r(i[s]);return r}({1:[function(t,e,n){"use strict";var i=t("./util"),r=t("./Queue"),o=function(){function t(t){this.root=null,this.compare=t||i.defaultCompare,this.nElements=0}return t.prototype.add=function(t){return!i.isUndefined(t)&&(null!==this.insertNode(this.createNode(t))&&(this.nElements++,!0))},t.prototype.clear=function(){this.root=null,this.nElements=0},t.prototype.isEmpty=function(){return 0===this.nElements},t.prototype.size=function(){return this.nElements},t.prototype.contains=function(t){return!i.isUndefined(t)&&null!==this.searchNode(this.root,t)},t.prototype.remove=function(t){var e=this.searchNode(this.root,t);return null!==e&&(this.removeNode(e),this.nElements--,!0)},t.prototype.inorderTraversal=function(t){this.inorderTraversalAux(this.root,t,{stop:!1})},t.prototype.preorderTraversal=function(t){this.preorderTraversalAux(this.root,t,{stop:!1})},t.prototype.postorderTraversal=function(t){this.postorderTraversalAux(this.root,t,{stop:!1})},t.prototype.levelTraversal=function(t){this.levelTraversalAux(this.root,t)},t.prototype.minimum=function(){if(!this.isEmpty())return this.minimumAux(this.root).element},t.prototype.maximum=function(){if(!this.isEmpty())return this.maximumAux(this.root).element},t.prototype.forEach=function(t){this.inorderTraversal(t)},t.prototype.toArray=function(){var t=[];return this.inorderTraversal(function(e){return t.push(e),!0}),t},t.prototype.height=function(){return this.heightAux(this.root)},t.prototype.searchNode=function(t,e){for(var n=null;null!==t&&0!==n;)n=this.compare(e,t.element),n<0?t=t.leftCh:n>0&&(t=t.rightCh);return t},t.prototype.transplant=function(t,e){null===t.parent?this.root=e:t===t.parent.leftCh?t.parent.leftCh=e:t.parent.rightCh=e,null!==e&&(e.parent=t.parent)},t.prototype.removeNode=function(t){if(null===t.leftCh)this.transplant(t,t.rightCh);else if(null===t.rightCh)this.transplant(t,t.leftCh);else{var e=this.minimumAux(t.rightCh);e.parent!==t&&(this.transplant(e,e.rightCh),e.rightCh=t.rightCh,e.rightCh.parent=e),this.transplant(t,e),e.leftCh=t.leftCh,e.leftCh.parent=e}},t.prototype.inorderTraversalAux=function(t,e,n){null===t||n.stop||(this.inorderTraversalAux(t.leftCh,e,n),n.stop||(n.stop=e(t.element)===!1,n.stop||this.inorderTraversalAux(t.rightCh,e,n)))},t.prototype.levelTraversalAux=function(t,e){var n=new r.default;for(null!==t&&n.enqueue(t);!n.isEmpty();){if(t=n.dequeue(),e(t.element)===!1)return;null!==t.leftCh&&n.enqueue(t.leftCh),null!==t.rightCh&&n.enqueue(t.rightCh)}},t.prototype.preorderTraversalAux=function(t,e,n){null===t||n.stop||(n.stop=e(t.element)===!1,n.stop||(this.preorderTraversalAux(t.leftCh,e,n),n.stop||this.preorderTraversalAux(t.rightCh,e,n)))},t.prototype.postorderTraversalAux=function(t,e,n){null===t||n.stop||(this.postorderTraversalAux(t.leftCh,e,n),n.stop||(this.postorderTraversalAux(t.rightCh,e,n),n.stop||(n.stop=e(t.element)===!1)))},t.prototype.minimumAux=function(t){for(;null!==t.leftCh;)t=t.leftCh;return t},t.prototype.maximumAux=function(t){for(;null!==t.rightCh;)t=t.rightCh;return t},t.prototype.heightAux=function(t){return null===t?-1:Math.max(this.heightAux(t.leftCh),this.heightAux(t.rightCh))+1},t.prototype.insertNode=function(t){for(var e=null,n=this.root,i=null;null!==n;){if(i=this.compare(t.element,n.element),0===i)return null;i<0?(e=n,n=n.leftCh):(e=n,n=n.rightCh)}return t.parent=e,null===e?this.root=t:this.compare(t.element,e.element)<0?e.leftCh=t:e.rightCh=t,t},t.prototype.createNode=function(t){return{element:t,leftCh:null,rightCh:null,parent:null}},t}();Object.defineProperty(n,"__esModule",{value:!0}),n.default=o},{"./Queue":11,"./util":15}],2:[function(t,e,n){"use strict";var i=t("./util"),r=t("./Dictionary"),o=t("./Set"),s=function(){function t(t){this.toStrF=t||i.defaultToString,this.dictionary=new r.default(this.toStrF),this.nElements=0}return t.prototype.add=function(t,e){if(void 0===e&&(e=1),i.isUndefined(t)||e<=0)return!1;if(this.contains(t))this.dictionary.getValue(t).copies+=e;else{var n={value:t,copies:e};this.dictionary.setValue(t,n)}return this.nElements+=e,!0},t.prototype.count=function(t){return this.contains(t)?this.dictionary.getValue(t).copies:0},t.prototype.contains=function(t){return this.dictionary.containsKey(t)},t.prototype.remove=function(t,e){if(void 0===e&&(e=1),i.isUndefined(t)||e<=0)return!1;if(this.contains(t)){var n=this.dictionary.getValue(t);return e>n.copies?this.nElements-=n.copies:this.nElements-=e,n.copies-=e,n.copies<=0&&this.dictionary.remove(t),!0}return!1},t.prototype.toArray=function(){for(var t=[],e=this.dictionary.values(),n=0,i=e;n<i.length;n++)for(var r=i[n],o=r.value,s=r.copies,u=0;u<s;u++)t.push(o);return t},t.prototype.toSet=function(){for(var t=new o.default(this.toStrF),e=this.dictionary.values(),n=0,i=e;n<i.length;n++){var r=i[n],s=r.value;t.add(s)}return t},t.prototype.forEach=function(t){this.dictionary.forEach(function(e,n){for(var i=n.value,r=n.copies,o=0;o<r;o++)if(t(i)===!1)return!1;return!0})},t.prototype.size=function(){return this.nElements},t.prototype.isEmpty=function(){return 0===this.nElements},t.prototype.clear=function(){this.nElements=0,this.dictionary.clear()},t}();Object.defineProperty(n,"__esModule",{value:!0}),n.default=s},{"./Dictionary":3,"./Set":12,"./util":15}],3:[function(t,e,n){"use strict";var i=t("./util"),r=function(){function t(t){this.table={},this.nElements=0,this.toStr=t||i.defaultToString}return t.prototype.getValue=function(t){var e=this.table["$"+this.toStr(t)];if(!i.isUndefined(e))return e.value},t.prototype.setValue=function(t,e){if(!i.isUndefined(t)&&!i.isUndefined(e)){var n,r="$"+this.toStr(t),o=this.table[r];return i.isUndefined(o)?(this.nElements++,n=void 0):n=o.value,this.table[r]={key:t,value:e},n}},t.prototype.remove=function(t){var e="$"+this.toStr(t),n=this.table[e];if(!i.isUndefined(n))return delete this.table[e],this.nElements--,n.value},t.prototype.keys=function(){var t=[];for(var e in this.table)if(i.has(this.table,e)){var n=this.table[e];t.push(n.key)}return t},t.prototype.values=function(){var t=[];for(var e in this.table)if(i.has(this.table,e)){var n=this.table[e];t.push(n.value)}return t},t.prototype.forEach=function(t){for(var e in this.table)if(i.has(this.table,e)){var n=this.table[e],r=t(n.key,n.value);if(r===!1)return}},t.prototype.containsKey=function(t){return!i.isUndefined(this.getValue(t))},t.prototype.clear=function(){this.table={},this.nElements=0},t.prototype.size=function(){return this.nElements},t.prototype.isEmpty=function(){return this.nElements<=0},t.prototype.toString=function(){var t="{";return this.forEach(function(e,n){t+="\n\t"+e+" : "+n}),t+"\n}"},t}();Object.defineProperty(n,"__esModule",{value:!0}),n.default=r},{"./util":15}],4:[function(t,e,n){"use strict";var i=this&&this.__extends||function(t,e){function n(){this.constructor=t}for(var i in e)e.hasOwnProperty(i)&&(t[i]=e[i]);t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)},r=t("./Dictionary"),o=t("./util"),s=function(t){function e(e,n){t.call(this,n),this.defaultFactoryFunction=e}return i(e,t),e.prototype.setDefault=function(e,n){var i=t.prototype.getValue.call(this,e);return o.isUndefined(i)?(this.setValue(e,n),n):i},e.prototype.getValue=function(t){return this.setDefault(t,this.defaultFactoryFunction())},e}(r.default);Object.defineProperty(n,"__esModule",{value:!0}),n.default=s},{"./Dictionary":3,"./util":15}],5:[function(t,e,n){"use strict";var i=t("./util"),r=t("./arrays"),o=function(){function t(t){this.data=[],this.compare=t||i.defaultCompare}return t.prototype.leftChildIndex=function(t){return 2*t+1},t.prototype.rightChildIndex=function(t){return 2*t+2},t.prototype.parentIndex=function(t){return Math.floor((t-1)/2)},t.prototype.minIndex=function(t,e){return e>=this.data.length?t>=this.data.length?-1:t:this.compare(this.data[t],this.data[e])<=0?t:e},t.prototype.siftUp=function(t){for(var e=this.parentIndex(t);t>0&&this.compare(this.data[e],this.data[t])>0;)r.swap(this.data,e,t),t=e,e=this.parentIndex(t)},t.prototype.siftDown=function(t){for(var e=this.minIndex(this.leftChildIndex(t),this.rightChildIndex(t));e>=0&&this.compare(this.data[t],this.data[e])>0;)r.swap(this.data,e,t),t=e,e=this.minIndex(this.leftChildIndex(t),this.rightChildIndex(t))},t.prototype.peek=function(){return this.data.length>0?this.data[0]:void 0},t.prototype.add=function(t){if(!i.isUndefined(t))return this.data.push(t),this.siftUp(this.data.length-1),!0},t.prototype.removeRoot=function(){if(this.data.length>0){var t=this.data[0];return this.data[0]=this.data[this.data.length-1],this.data.splice(this.data.length-1,1),this.data.length>0&&this.siftDown(0),t}},t.prototype.contains=function(t){var e=i.compareToEquals(this.compare);return r.contains(this.data,t,e)},t.prototype.size=function(){return this.data.length},t.prototype.isEmpty=function(){return this.data.length<=0},t.prototype.clear=function(){this.data.length=0},t.prototype.forEach=function(t){r.forEach(this.data,t)},t}();Object.defineProperty(n,"__esModule",{value:!0}),n.default=o},{"./arrays":14,"./util":15}],6:[function(t,e,n){"use strict";var i=this&&this.__extends||function(t,e){function n(){this.constructor=t}for(var i in e)e.hasOwnProperty(i)&&(t[i]=e[i]);t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)},r=t("./Dictionary"),o=t("./util"),s=function(){function t(t,e){this.key=t,this.value=e}return t.prototype.unlink=function(){this.prev.next=this.next,this.next.prev=this.prev},t}(),u=function(t){function e(e){t.call(this,e),this.head=new s(null,null),this.tail=new s(null,null),this.head.next=this.tail,this.tail.prev=this.head}return i(e,t),e.prototype.appendToTail=function(t){var e=this.tail.prev;e.next=t,t.prev=e,t.next=this.tail,this.tail.prev=t},e.prototype.getLinkedDictionaryPair=function(t){if(!o.isUndefined(t)){var e="$"+this.toStr(t),n=this.table[e];return n}},e.prototype.getValue=function(t){var e=this.getLinkedDictionaryPair(t);if(!o.isUndefined(e))return e.value},e.prototype.remove=function(e){var n=this.getLinkedDictionaryPair(e);if(!o.isUndefined(n))return t.prototype.remove.call(this,e),n.unlink(),n.value},e.prototype.clear=function(){t.prototype.clear.call(this),this.head.next=this.tail,this.tail.prev=this.head},e.prototype.replace=function(t,e){var n="$"+this.toStr(e.key);e.next=t.next,e.prev=t.prev,this.remove(t.key),e.prev.next=e,e.next.prev=e,this.table[n]=e,++this.nElements},e.prototype.setValue=function(t,e){if(!o.isUndefined(t)&&!o.isUndefined(e)){var n=this.getLinkedDictionaryPair(t),i=new s(t,e),r="$"+this.toStr(t);return o.isUndefined(n)?(this.appendToTail(i),this.table[r]=i,void++this.nElements):(this.replace(n,i),n.value)}},e.prototype.keys=function(){var t=[];return this.forEach(function(e,n){t.push(e)}),t},e.prototype.values=function(){var t=[];return this.forEach(function(e,n){t.push(n)}),t},e.prototype.forEach=function(t){for(var e=this.head.next;null!=e.next;){var n=t(e.key,e.value);if(n===!1)return;e=e.next}},e}(r.default);Object.defineProperty(n,"__esModule",{value:!0}),n.default=u},{"./Dictionary":3,"./util":15}],7:[function(t,e,n){"use strict";var i=t("./util"),r=t("./arrays"),o=function(){function t(){this.firstNode=null,this.lastNode=null,this.nElements=0}return t.prototype.add=function(t,e){if(i.isUndefined(e)&&(e=this.nElements),e<0||e>this.nElements||i.isUndefined(t))return!1;var n=this.createNode(t);if(0===this.nElements)this.firstNode=n,this.lastNode=n;else if(e===this.nElements)this.lastNode.next=n,this.lastNode=n;else if(0===e)n.next=this.firstNode,this.firstNode=n;else{var r=this.nodeAtIndex(e-1);n.next=r.next,r.next=n}return this.nElements++,!0},t.prototype.first=function(){if(null!==this.firstNode)return this.firstNode.element},t.prototype.last=function(){if(null!==this.lastNode)return this.lastNode.element},t.prototype.elementAtIndex=function(t){var e=this.nodeAtIndex(t);if(null!==e)return e.element},t.prototype.indexOf=function(t,e){var n=e||i.defaultEquals;if(i.isUndefined(t))return-1;for(var r=this.firstNode,o=0;null!==r;){if(n(r.element,t))return o;o++,r=r.next}return-1},t.prototype.contains=function(t,e){return this.indexOf(t,e)>=0},t.prototype.remove=function(t,e){var n=e||i.defaultEquals;if(this.nElements<1||i.isUndefined(t))return!1;for(var r=null,o=this.firstNode;null!==o;){if(n(o.element,t))return o===this.firstNode?(this.firstNode=this.firstNode.next,o===this.lastNode&&(this.lastNode=null)):o===this.lastNode?(this.lastNode=r,r.next=o.next,o.next=null):(r.next=o.next,o.next=null),this.nElements--,!0;r=o,o=o.next}return!1},t.prototype.clear=function(){this.firstNode=null,this.lastNode=null,this.nElements=0},t.prototype.equals=function(e,n){var r=n||i.defaultEquals;return e instanceof t&&(this.size()===e.size()&&this.equalsAux(this.firstNode,e.firstNode,r))},t.prototype.equalsAux=function(t,e,n){for(;null!==t;){if(!n(t.element,e.element))return!1;t=t.next,e=e.next}return!0},t.prototype.removeElementAtIndex=function(t){if(!(t<0||t>=this.nElements)){var e;if(1===this.nElements)e=this.firstNode.element,this.firstNode=null,this.lastNode=null;else{var n=this.nodeAtIndex(t-1);null===n?(e=this.firstNode.element,this.firstNode=this.firstNode.next):n.next===this.lastNode&&(e=this.lastNode.element,this.lastNode=n),null!==n&&(e=n.next.element,n.next=n.next.next)}return this.nElements--,e}},t.prototype.forEach=function(t){for(var e=this.firstNode;null!==e&&t(e.element)!==!1;)e=e.next},t.prototype.reverse=function(){for(var t=null,e=this.firstNode,n=null;null!==e;)n=e.next,e.next=t,t=e,e=n;n=this.firstNode,this.firstNode=this.lastNode,this.lastNode=n},t.prototype.toArray=function(){for(var t=[],e=this.firstNode;null!==e;)t.push(e.element),e=e.next;return t},t.prototype.size=function(){return this.nElements},t.prototype.isEmpty=function(){return this.nElements<=0},t.prototype.toString=function(){return r.toString(this.toArray())},t.prototype.nodeAtIndex=function(t){if(t<0||t>=this.nElements)return null;if(t===this.nElements-1)return this.lastNode;for(var e=this.firstNode,n=0;n<t;n++)e=e.next;return e},t.prototype.createNode=function(t){return{element:t,next:null}},t}();Object.defineProperty(n,"__esModule",{value:!0}),n.default=o},{"./arrays":14,"./util":15}],8:[function(t,e,n){"use strict";var i=t("./util"),r=t("./Dictionary"),o=t("./arrays"),s=function(){function t(t,e,n){void 0===n&&(n=!1),this.dict=new r.default(t),this.equalsF=e||i.defaultEquals,this.allowDuplicate=n}return t.prototype.getValue=function(t){var e=this.dict.getValue(t);return i.isUndefined(e)?[]:o.copy(e)},t.prototype.setValue=function(t,e){if(i.isUndefined(t)||i.isUndefined(e))return!1;if(!this.containsKey(t))return this.dict.setValue(t,[e]),!0;var n=this.dict.getValue(t);return!(!this.allowDuplicate&&o.contains(n,e,this.equalsF))&&(n.push(e),!0)},t.prototype.remove=function(t,e){if(i.isUndefined(e)){var n=this.dict.remove(t);return!i.isUndefined(n)}var r=this.dict.getValue(t);return!!o.remove(r,e,this.equalsF)&&(0===r.length&&this.dict.remove(t),!0)},t.prototype.keys=function(){return this.dict.keys()},t.prototype.values=function(){for(var t=this.dict.values(),e=[],n=0,i=t;n<i.length;n++)for(var r=i[n],o=0,s=r;o<s.length;o++){var u=s[o];e.push(u)}return e},t.prototype.containsKey=function(t){return this.dict.containsKey(t)},t.prototype.clear=function(){this.dict.clear()},t.prototype.size=function(){return this.dict.size()},t.prototype.isEmpty=function(){return this.dict.isEmpty()},t}();Object.defineProperty(n,"__esModule",{value:!0}),n.default=s},{"./Dictionary":3,"./arrays":14,"./util":15}],9:[function(t,e,n){"use strict";!function(t){t[t.BEFORE=0]="BEFORE",t[t.AFTER=1]="AFTER",t[t.INSIDE_AT_END=2]="INSIDE_AT_END",t[t.INSIDE_AT_START=3]="INSIDE_AT_START"}(n.Direction||(n.Direction={}));var i=n.Direction,r=function(){function t(t,e){void 0===t&&(t=[]),void 0===e&&(e={}),this.rootIds=t,this.nodes=e}return t.prototype.getRootIds=function(){var t=this.rootIds.slice();return t},t.prototype.getNodes=function(){var t={};for(var e in this.nodes)this.nodes.hasOwnProperty(e)&&(t[e]=this.nodes[e].slice());return t},t.prototype.getObject=function(){return{rootIds:this.getRootIds(),nodes:this.getNodes()}},t.prototype.moveIdBeforeId=function(t,e){return this.moveId(t,e,i.BEFORE)},t.prototype.moveIdAfterId=function(t,e){return this.moveId(t,e,i.AFTER)},t.prototype.moveIdIntoId=function(t,e,n){return void 0===n&&(n=!0),n?this.moveId(t,e,i.INSIDE_AT_START):this.moveId(t,e,i.INSIDE_AT_END)},t.prototype.deleteId=function(t){this.rootDeleteId(t),this.nodeAndSubNodesDelete(t),this.nodeRefrencesDelete(t)},t.prototype.insertIdBeforeId=function(t,e){var n=this.findRootId(t);n>-1&&this.insertIdIntoRoot(e,n);for(var i in this.nodes)if(this.nodes.hasOwnProperty(i)){var r=this.findNodeId(i,t);r>-1&&this.insertIdIntoNode(i,e,r)}},t.prototype.insertIdAfterId=function(t,e){var n=this.findRootId(t);n>-1&&this.insertIdIntoRoot(e,n+1);for(var i in this.nodes)if(this.nodes.hasOwnProperty(i)){var r=this.findNodeId(i,t);r>-1&&this.insertIdIntoNode(i,e,r+1)}},t.prototype.insertIdIntoId=function(t,e){this.nodeInsertAtEnd(t,e),this.nodes[e]=[]},t.prototype.insertIdIntoRoot=function(t,e){if(void 0===e)this.rootInsertAtEnd(t);else if(e<0){var n=this.rootIds.length;this.rootIds.splice(e+n+1,0,t)}else this.rootIds.splice(e,0,t);this.nodes[t]=this.nodes[t]||[]},t.prototype.insertIdIntoNode=function(t,e,n){if(this.nodes[t]=this.nodes[t]||[],this.nodes[e]=this.nodes[e]||[],void 0===n)this.nodeInsertAtEnd(t,e);else if(n<0){var i=this.nodes[t].length;this.nodes[t].splice(n+i+1,0,e)}else this.nodes[t].splice(n,0,e)},t.prototype.moveId=function(t,e,n){var r,o,s=t,u=this.findRootId(s);this.nodes[e]&&(r=e);for(var a in this.nodes)if(this.nodes.hasOwnProperty(a)){o=this.findNodeId(a,e);break}var h,l,f=e,d=this.findRootId(f);this.nodes[e]&&(h=e);for(var a in this.nodes)if(this.nodes.hasOwnProperty(a)){l=this.findNodeId(a,e);break}if(u>-1)if(d>-1)switch(this.rootDelete(u),n){case i.BEFORE:this.insertIdIntoRoot(s,d);break;case i.AFTER:this.insertIdIntoRoot(s,d+1);break;case i.INSIDE_AT_START:this.nodeInsertAtStart(f,s);break;case i.INSIDE_AT_END:this.nodeInsertAtEnd(f,s)}else{this.rootDelete(u);for(var a in this.nodes)if(this.nodes.hasOwnProperty(a)){var p=this.findNodeId(a,f);if(p>-1){switch(n){case i.BEFORE:this.insertIdIntoNode(a,s,p);break;case i.AFTER:this.insertIdIntoNode(a,s,p+1);break;case i.INSIDE_AT_START:this.nodeInsertAtStart(f,s);break;case i.INSIDE_AT_END:this.nodeInsertAtEnd(f,s)}break}}}else if(d>-1){for(var a in this.nodes)if(this.nodes.hasOwnProperty(a)){var p=this.findNodeId(a,s);if(p>-1){this.nodeDeleteAtIndex(a,p);break}}switch(n){case i.BEFORE:this.insertIdIntoRoot(s,d);break;case i.AFTER:this.insertIdIntoRoot(s,d+1);break;case i.INSIDE_AT_START:this.nodeInsertAtStart(f,s);break;case i.INSIDE_AT_END:this.nodeInsertAtEnd(f,s)}}else{for(var a in this.nodes)if(this.nodes.hasOwnProperty(a)){var p=this.findNodeId(a,s);if(p>-1){this.nodeDeleteAtIndex(a,p);break}}for(var a in this.nodes)if(this.nodes.hasOwnProperty(a)){var p=this.findNodeId(a,f);if(p>-1){switch(n){case i.BEFORE:this.insertIdIntoNode(a,s,p);break;case i.AFTER:this.insertIdIntoNode(a,s,p+1);break;case i.INSIDE_AT_START:this.nodeInsertAtStart(f,s);break;case i.INSIDE_AT_END:this.nodeInsertAtEnd(f,s)}break}}}},t.prototype.swapArrayElements=function(t,e,n){var i=t[e];return t[e]=t[n],t[n]=i,t},t.prototype.rootDeleteId=function(t){var e=this.findRootId(t);e>-1&&this.rootDelete(e)},t.prototype.nodeAndSubNodesDelete=function(t){for(var e=[],n=0;n<this.nodes[t].length;n++){var i=this.nodes[t][n];this.nodeAndSubNodesDelete(i),e.push(t)}this.nodeDelete(t);for(var n=0;n<e.length;n++)this.nodeDelete(e[n])},t.prototype.nodeRefrencesDelete=function(t){for(var e in this.nodes)if(this.nodes.hasOwnProperty(e))for(var n=0;n<this.nodes[e].length;n++){var i=this.nodes[e][n];i===t&&this.nodeDeleteAtIndex(e,n)}},t.prototype.nodeDelete=function(t){delete this.nodes[t]},t.prototype.findRootId=function(t){return this.rootIds.indexOf(t)},t.prototype.findNodeId=function(t,e){return this.nodes[t].indexOf(e)},t.prototype.findNode=function(t){return this.nodes[t]},t.prototype.nodeInsertAtStart=function(t,e){this.nodes[t].unshift(e)},t.prototype.nodeInsertAtEnd=function(t,e){this.nodes[t].push(e)},t.prototype.rootDelete=function(t){this.rootIds.splice(t,1)},t.prototype.nodeDeleteAtIndex=function(t,e){this.nodes[t].splice(e,1)},t.prototype.rootInsertAtStart=function(t){this.rootIds.unshift(t)},t.prototype.rootInsertAtEnd=function(t){this.rootIds.push(t)},t}();Object.defineProperty(n,"__esModule",{value:!0}),n.default=r},{}],10:[function(t,e,n){"use strict";var i=t("./util"),r=t("./Heap"),o=function(){function t(t){this.heap=new r.default(i.reverseCompareFunction(t))}return t.prototype.enqueue=function(t){return this.heap.add(t)},t.prototype.add=function(t){return this.heap.add(t)},t.prototype.dequeue=function(){if(0!==this.heap.size()){var t=this.heap.peek();return this.heap.removeRoot(),t}},t.prototype.peek=function(){return this.heap.peek()},t.prototype.contains=function(t){return this.heap.contains(t)},t.prototype.isEmpty=function(){return this.heap.isEmpty()},t.prototype.size=function(){return this.heap.size()},t.prototype.clear=function(){this.heap.clear()},t.prototype.forEach=function(t){this.heap.forEach(t)},t}();Object.defineProperty(n,"__esModule",{value:!0}),n.default=o},{"./Heap":5,"./util":15}],11:[function(t,e,n){"use strict";var i=t("./LinkedList"),r=function(){function t(){this.list=new i.default}return t.prototype.enqueue=function(t){return this.list.add(t)},t.prototype.add=function(t){return this.list.add(t)},t.prototype.dequeue=function(){if(0!==this.list.size()){var t=this.list.first();return this.list.removeElementAtIndex(0),t}},t.prototype.peek=function(){if(0!==this.list.size())return this.list.first()},t.prototype.size=function(){return this.list.size()},t.prototype.contains=function(t,e){return this.list.contains(t,e)},t.prototype.isEmpty=function(){return this.list.size()<=0},t.prototype.clear=function(){this.list.clear()},t.prototype.forEach=function(t){this.list.forEach(t)},t}();Object.defineProperty(n,"__esModule",{value:!0}),n.default=r},{"./LinkedList":7}],12:[function(t,e,n){"use strict";var i=t("./util"),r=t("./arrays"),o=t("./Dictionary"),s=function(){function t(t){this.dictionary=new o.default(t)}return t.prototype.contains=function(t){return this.dictionary.containsKey(t)},t.prototype.add=function(t){return!this.contains(t)&&!i.isUndefined(t)&&(this.dictionary.setValue(t,t),!0)},t.prototype.intersection=function(t){var e=this;this.forEach(function(n){return t.contains(n)||e.remove(n),!0})},t.prototype.union=function(t){var e=this;t.forEach(function(t){return e.add(t),!0})},t.prototype.difference=function(t){var e=this;t.forEach(function(t){return e.remove(t),!0})},t.prototype.isSubsetOf=function(t){if(this.size()>t.size())return!1;var e=!0;return this.forEach(function(n){return!!t.contains(n)||(e=!1,!1)}),e},t.prototype.remove=function(t){return!!this.contains(t)&&(this.dictionary.remove(t),!0)},t.prototype.forEach=function(t){this.dictionary.forEach(function(e,n){return t(n)})},t.prototype.toArray=function(){return this.dictionary.values()},t.prototype.isEmpty=function(){return this.dictionary.isEmpty()},t.prototype.size=function(){return this.dictionary.size()},t.prototype.clear=function(){this.dictionary.clear()},t.prototype.toString=function(){return r.toString(this.toArray())},t}();Object.defineProperty(n,"__esModule",{value:!0}),n.default=s},{"./Dictionary":3,"./arrays":14,"./util":15}],13:[function(t,e,n){"use strict";var i=t("./LinkedList"),r=function(){function t(){this.list=new i.default}return t.prototype.push=function(t){return this.list.add(t,0)},t.prototype.add=function(t){return this.list.add(t,0)},t.prototype.pop=function(){return this.list.removeElementAtIndex(0)},t.prototype.peek=function(){return this.list.first()},t.prototype.size=function(){return this.list.size()},t.prototype.contains=function(t,e){return this.list.contains(t,e)},t.prototype.isEmpty=function(){return this.list.isEmpty()},t.prototype.clear=function(){this.list.clear()},t.prototype.forEach=function(t){this.list.forEach(t)},t}();Object.defineProperty(n,"__esModule",{value:!0}),n.default=r},{"./LinkedList":7}],14:[function(t,e,n){"use strict";function i(t,e,n){for(var i=n||p.defaultEquals,r=t.length,o=0;o<r;o++)if(i(t[o],e))return o;return-1}function r(t,e,n){for(var i=n||p.defaultEquals,r=t.length,o=r-1;o>=0;o--)if(i(t[o],e))return o;return-1}function o(t,e,n){return i(t,e,n)>=0}function s(t,e,n){var r=i(t,e,n);return!(r<0)&&(t.splice(r,1),!0)}function u(t,e,n){for(var i=n||p.defaultEquals,r=t.length,o=0,s=0;s<r;s++)i(t[s],e)&&o++;return o}function a(t,e,n){var i=n||p.defaultEquals;if(t.length!==e.length)return!1;for(var r=t.length,o=0;o<r;o++)if(!i(t[o],e[o]))return!1;return!0}function h(t){return t.concat()}function l(t,e,n){if(e<0||e>=t.length||n<0||n>=t.length)return!1;var i=t[e];return t[e]=t[n],t[n]=i,!0}function f(t){return"["+t.toString()+"]"}function d(t,e){for(var n=0,i=t;n<i.length;n++){var r=i[n];if(e(r)===!1)return}}var p=t("./util");n.indexOf=i,n.lastIndexOf=r,n.contains=o,n.remove=s,n.frequency=u,n.equals=a,n.copy=h,n.swap=l,n.toString=f,n.forEach=d},{"./util":15}],15:[function(t,e,n){"use strict";function i(t,e){return t<e?-1:t===e?0:1}function r(t,e){return t===e}function o(t){return null===t?"COLLECTION_NULL":a(t)?"COLLECTION_UNDEFINED":h(t)?"$s"+t:"$o"+t.toString()}function s(t,e){if(void 0===e&&(e=","),null===t)return"COLLECTION_NULL";if(a(t))return"COLLECTION_UNDEFINED";if(h(t))return t.toString();var i="{",r=!0;for(var o in t)n.has(t,o)&&(r?r=!1:i+=e,i=i+o+":"+t[o]);return i+"}"}function u(t){return"function"==typeof t}function a(t){return"undefined"==typeof t}function h(t){return"[object String]"===Object.prototype.toString.call(t)}function l(t){return u(t)?function(e,n){return t(e,n)*-1}:function(t,e){return t<e?1:t===e?0:-1}}function f(t){return function(e,n){return 0===t(e,n)}}var d=Object.prototype.hasOwnProperty;n.has=function(t,e){return d.call(t,e)},n.defaultCompare=i,n.defaultEquals=r,n.defaultToString=o,n.makeString=s,n.isFunction=u,n.isUndefined=a,n.isString=h,n.reverseCompareFunction=l,n.compareToEquals=f},{}],"typescript-collections":[function(t,e,n){"use strict";var i=t("./arrays");n.arrays=i;var r=t("./Bag");n.Bag=r.default;var o=t("./BSTree");n.BSTree=o.default;var s=t("./Dictionary");n.Dictionary=s.default;var u=t("./Heap");n.Heap=u.default;var a=t("./LinkedDictionary");n.LinkedDictionary=a.default;var h=t("./LinkedList");n.LinkedList=h.default;var l=t("./MultiDictionary");n.MultiDictionary=l.default;var f=t("./FactoryDictionary");n.FactoryDictionary=f.default;var d=t("./FactoryDictionary");n.DefaultDictionary=d.default;var p=t("./Queue");n.Queue=p.default;var c=t("./PriorityQueue");n.PriorityQueue=c.default;var y=t("./Set");n.Set=y.default;var v=t("./Stack");n.Stack=v.default;var m=t("./MultiRootTree");n.MultiRootTree=m.default;var E=t("./util");n.util=E},{"./BSTree":1,"./Bag":2,"./Dictionary":3,"./FactoryDictionary":4,"./Heap":5,"./LinkedDictionary":6,"./LinkedList":7,"./MultiDictionary":8,"./MultiRootTree":9,"./PriorityQueue":10,"./Queue":11,"./Set":12,"./Stack":13,"./arrays":14,"./util":15}]},{},[]),require("typescript-collections")});
\ No newline at end of file
diff --git a/dist/lib/util.d.ts b/dist/lib/util.d.ts
deleted file mode 100644
index 55d1571..0000000
--- a/dist/lib/util.d.ts
+++ /dev/null
@@ -1,66 +0,0 @@
-export declare const has: (obj: any, prop: any) => any;
-/**
-* Function signature for comparing
-* <0 means a is smaller
-* = 0 means they are equal
-* >0 means a is larger
-*/
-export interface ICompareFunction<T> {
-    (a: T, b: T): number;
-}
-/**
-* Function signature for checking equality
-*/
-export interface IEqualsFunction<T> {
-    (a: T, b: T): boolean;
-}
-/**
-* Function signature for Iterations. Return false to break from loop
-*/
-export interface ILoopFunction<T> {
-    (a: T): boolean | void;
-}
-/**
- * Default function to compare element order.
- * @function
- */
-export declare function defaultCompare<T>(a: T, b: T): number;
-/**
- * Default function to test equality.
- * @function
- */
-export declare function defaultEquals<T>(a: T, b: T): boolean;
-/**
- * Default function to convert an object to a string.
- * @function
- */
-export declare function defaultToString(item: any): string;
-/**
-* Joins all the properies of the object using the provided join string
-*/
-export declare function makeString<T>(item: T, join?: string): string;
-/**
- * Checks if the given argument is a function.
- * @function
- */
-export declare function isFunction(func: any): boolean;
-/**
- * Checks if the given argument is undefined.
- * @function
- */
-export declare function isUndefined(obj: any): boolean;
-/**
- * Checks if the given argument is a string.
- * @function
- */
-export declare function isString(obj: any): boolean;
-/**
- * Reverses a compare function.
- * @function
- */
-export declare function reverseCompareFunction<T>(compareFunction: ICompareFunction<T>): ICompareFunction<T>;
-/**
- * Returns an equal function given a compare function.
- * @function
- */
-export declare function compareToEquals<T>(compareFunction: ICompareFunction<T>): IEqualsFunction<T>;
diff --git a/dist/lib/util.js b/dist/lib/util.js
deleted file mode 100644
index 4c17215..0000000
--- a/dist/lib/util.js
+++ /dev/null
@@ -1,140 +0,0 @@
-"use strict";
-var _hasOwnProperty = Object.prototype.hasOwnProperty;
-exports.has = function (obj, prop) {
-    return _hasOwnProperty.call(obj, prop);
-};
-/**
- * Default function to compare element order.
- * @function
- */
-function defaultCompare(a, b) {
-    if (a < b) {
-        return -1;
-    }
-    else if (a === b) {
-        return 0;
-    }
-    else {
-        return 1;
-    }
-}
-exports.defaultCompare = defaultCompare;
-/**
- * Default function to test equality.
- * @function
- */
-function defaultEquals(a, b) {
-    return a === b;
-}
-exports.defaultEquals = defaultEquals;
-/**
- * Default function to convert an object to a string.
- * @function
- */
-function defaultToString(item) {
-    if (item === null) {
-        return 'COLLECTION_NULL';
-    }
-    else if (isUndefined(item)) {
-        return 'COLLECTION_UNDEFINED';
-    }
-    else if (isString(item)) {
-        return '$s' + item;
-    }
-    else {
-        return '$o' + item.toString();
-    }
-}
-exports.defaultToString = defaultToString;
-/**
-* Joins all the properies of the object using the provided join string
-*/
-function makeString(item, join) {
-    if (join === void 0) { join = ','; }
-    if (item === null) {
-        return 'COLLECTION_NULL';
-    }
-    else if (isUndefined(item)) {
-        return 'COLLECTION_UNDEFINED';
-    }
-    else if (isString(item)) {
-        return item.toString();
-    }
-    else {
-        var toret = '{';
-        var first = true;
-        for (var prop in item) {
-            if (exports.has(item, prop)) {
-                if (first) {
-                    first = false;
-                }
-                else {
-                    toret = toret + join;
-                }
-                toret = toret + prop + ':' + item[prop];
-            }
-        }
-        return toret + '}';
-    }
-}
-exports.makeString = makeString;
-/**
- * Checks if the given argument is a function.
- * @function
- */
-function isFunction(func) {
-    return (typeof func) === 'function';
-}
-exports.isFunction = isFunction;
-/**
- * Checks if the given argument is undefined.
- * @function
- */
-function isUndefined(obj) {
-    return (typeof obj) === 'undefined';
-}
-exports.isUndefined = isUndefined;
-/**
- * Checks if the given argument is a string.
- * @function
- */
-function isString(obj) {
-    return Object.prototype.toString.call(obj) === '[object String]';
-}
-exports.isString = isString;
-/**
- * Reverses a compare function.
- * @function
- */
-function reverseCompareFunction(compareFunction) {
-    if (!isFunction(compareFunction)) {
-        return function (a, b) {
-            if (a < b) {
-                return 1;
-            }
-            else if (a === b) {
-                return 0;
-            }
-            else {
-                return -1;
-            }
-        };
-    }
-    else {
-        return function (d, v) {
-            return compareFunction(d, v) * -1;
-        };
-    }
-}
-exports.reverseCompareFunction = reverseCompareFunction;
-/**
- * Returns an equal function given a compare function.
- * @function
- */
-function compareToEquals(compareFunction) {
-    return function (a, b) {
-        return compareFunction(a, b) === 0;
-    };
-}
-exports.compareToEquals = compareToEquals;
-//# sourceMappingURL=util.js.map
\ No newline at end of file
diff --git a/dist/lib/util.js.map b/dist/lib/util.js.map
deleted file mode 100644
index 92f9206..0000000
--- a/dist/lib/util.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"util.js","sourceRoot":"","sources":["../../src/lib/util.ts"],"names":[],"mappings":";AAAA,IAAM,eAAe,GAAG,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC;AAC3C,WAAG,GAAG,UAAS,GAAQ,EAAE,IAAS;IAC3C,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;AAC3C,CAAC,CAAC;AA0BF;;;GAGG;AACH,wBAAkC,CAAI,EAAE,CAAI;IACxC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACR,MAAM,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;IAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,CAAC,CAAC;IACb,CAAC;IAAC,IAAI,CAAC,CAAC;QACJ,MAAM,CAAC,CAAC,CAAC;IACb,CAAC;AACL,CAAC;AARe,sBAAc,iBAQ7B,CAAA;AAED;;;GAGG;AACH,uBAAiC,CAAI,EAAE,CAAI;IACvC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC;AACnB,CAAC;AAFe,qBAAa,gBAE5B,CAAA;AAED;;;GAGG;AACH,yBAAgC,IAAS;IACrC,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC;QAChB,MAAM,CAAC,iBAAiB,CAAC;IAC7B,CAAC;IAAC,IAAI,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,CAAC,sBAAsB,CAAC;IAClC,CAAC;IAAC,IAAI,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC;IACvB,CAAC;IAAC,IAAI,CAAC,CAAC;QACJ,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;IAClC,CAAC;AACL,CAAC;AAVe,uBAAe,kBAU9B,CAAA;AAED;;EAEE;AACF,oBAA8B,IAAO,EAAE,IAAkB;IAAlB,oBAAkB,GAAlB,UAAkB;IACrD,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC;QAChB,MAAM,CAAC,iBAAiB,CAAC;IAC7B,CAAC;IAAC,IAAI,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,CAAC,sBAAsB,CAAC;IAClC,CAAC;IAAC,IAAI,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;IAC3B,CAAC;IAAC,IAAI,CAAC,CAAC;QACJ,IAAI,KAAK,GAAG,GAAG,CAAC;QAChB,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,GAAG,CAAC,CAAC,IAAM,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC;YACtB,EAAE,CAAC,CAAC,WAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;gBAClB,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;oBACR,KAAK,GAAG,KAAK,CAAC;gBAClB,CAAC;gBAAC,IAAI,CAAC,CAAC;oBACJ,KAAK,GAAG,KAAK,GAAG,IAAI,CAAC;gBACzB,CAAC;gBACD,KAAK,GAAG,KAAK,GAAG,IAAI,GAAG,GAAG,GAAS,IAAK,CAAC,IAAI,CAAC,CAAC;YACnD,CAAC;QACL,CAAC;QACD,MAAM,CAAC,KAAK,GAAG,GAAG,CAAC;IACvB,CAAC;AACL,CAAC;AAtBe,kBAAU,aAsBzB,CAAA;AAED;;;GAGG;AACH,oBAA2B,IAAS;IAChC,MAAM,CAAC,CAAC,OAAO,IAAI,CAAC,KAAK,UAAU,CAAC;AACxC,CAAC;AAFe,kBAAU,aAEzB,CAAA;AAED;;;GAGG;AACH,qBAA4B,GAAQ;IAChC,MAAM,CAAC,CAAC,OAAO,GAAG,CAAC,KAAK,WAAW,CAAC;AACxC,CAAC;AAFe,mBAAW,cAE1B,CAAA;AAED;;;GAGG;AACH,kBAAyB,GAAQ;IAC7B,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,iBAAiB,CAAC;AACrE,CAAC;AAFe,gBAAQ,WAEvB,CAAA;AAED;;;GAGG;AACH,gCAA0C,eAAoC;IAC1E,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,CAAC,UAAS,CAAC,EAAE,CAAC;YAChB,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACR,MAAM,CAAC,CAAC,CAAC;YACb,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACjB,MAAM,CAAC,CAAC,CAAC;YACb,CAAC;YAAC,IAAI,CAAC,CAAC;gBACJ,MAAM,CAAC,CAAC,CAAC,CAAC;YACd,CAAC;QACL,CAAC,CAAC;IACN,CAAC;IAAC,IAAI,CAAC,CAAC;QACJ,MAAM,CAAC,UAAS,CAAI,EAAE,CAAI;YACtB,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,CAAC,CAAC;IACN,CAAC;AACL,CAAC;AAhBe,8BAAsB,yBAgBrC,CAAA;AAED;;;GAGG;AACH,yBAAmC,eAAoC;IACnE,MAAM,CAAC,UAAS,CAAI,EAAE,CAAI;QACtB,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IACvC,CAAC,CAAC;AACN,CAAC;AAJe,uBAAe,kBAI9B,CAAA"}
\ No newline at end of file
diff --git a/dist/test/arraysTest.d.ts b/dist/test/arraysTest.d.ts
deleted file mode 100644
index e69de29..0000000
diff --git a/dist/test/arraysTest.js b/dist/test/arraysTest.js
deleted file mode 100644
index e46e458..0000000
--- a/dist/test/arraysTest.js
+++ /dev/null
@@ -1,253 +0,0 @@
-"use strict";
-var collections = require('../lib/index');
-var chai_1 = require('chai');
-describe('Arrays', function () {
-    it('IndexOf returns the right position', function () {
-        var a = [1, 8, 10];
-        chai_1.expect(collections.arrays.indexOf(a, 1)).equals(0);
-        chai_1.expect(collections.arrays.indexOf(a, 8)).equals(1);
-        chai_1.expect(collections.arrays.indexOf(a, 10)).equals(2);
-        chai_1.expect(collections.arrays.indexOf(a, 11)).equals(-1);
-        chai_1.expect(collections.arrays.indexOf([], 8)).equals(-1);
-    });
-    it('IndexOf with custom equals function returns the right position', function () {
-        var b = {
-            val: 1
-        };
-        var c = {
-            val: 8
-        };
-        var d = {
-            val: 10
-        };
-        var e = {
-            val: 11
-        };
-        var a = [b, c, d];
-        var eq = function (arg1, arg2) {
-            return arg1.val === arg2.val;
-        };
-        chai_1.expect(collections.arrays.indexOf(a, {
-            val: 1
-        })).equals(-1);
-        chai_1.expect(collections.arrays.indexOf(a, {
-            val: 1
-        }, eq)).equals(0);
-        chai_1.expect(collections.arrays.indexOf(a, c, eq)).equals(1);
-        chai_1.expect(collections.arrays.indexOf(a, {
-            val: 10
-        }, eq)).equals(2);
-        chai_1.expect(collections.arrays.indexOf(a, e, eq)).equals(-1);
-        chai_1.expect(collections.arrays.indexOf([], b)).equals(-1);
-    });
-    it('lastIndexOf returns the right position', function () {
-        var a = [1, 8, 8, 8, 10, 10];
-        chai_1.expect(collections.arrays.lastIndexOf(a, 1)).equals(0);
-        chai_1.expect(collections.arrays.lastIndexOf(a, 8)).equals(3);
-        chai_1.expect(collections.arrays.lastIndexOf(a, 10)).equals(5);
-        chai_1.expect(collections.arrays.lastIndexOf(a, 11)).equals(-1);
-        chai_1.expect(collections.arrays.lastIndexOf([], 8)).equals(-1);
-    });
-    it('lastIndexOf with custom equals function returns the right position', function () {
-        var b = {
-            val: 1
-        };
-        var c = {
-            val: 8
-        };
-        var d = {
-            val: 10
-        };
-        var e = {
-            val: 11
-        };
-        var a = [b, b, c, d];
-        var eq = function (arg1, arg2) {
-            return arg1.val === arg2.val;
-        };
-        chai_1.expect(collections.arrays.lastIndexOf(a, {
-            val: 1
-        })).equals(-1);
-        chai_1.expect(collections.arrays.lastIndexOf(a, {
-            val: 1
-        }, eq)).equals(1);
-    });
-    it('Contains existing elements', function () {
-        var a = [1, 8, 8, 8, 10, 10];
-        chai_1.expect(collections.arrays.contains(a, 1)).equals(true);
-        chai_1.expect(collections.arrays.contains(a, 8)).equals(true);
-        chai_1.expect(collections.arrays.contains(a, 10)).equals(true);
-        chai_1.expect(collections.arrays.contains(a, 11)).equals(false);
-        chai_1.expect(collections.arrays.contains([], 8)).equals(false);
-    });
-    it('Contains existing elements with custom equals function', function () {
-        var b = {
-            val: 1
-        };
-        var c = {
-            val: 8
-        };
-        var d = {
-            val: 10
-        };
-        var e = {
-            val: 11
-        };
-        var a = [b, b, c, d];
-        var eq = function (arg1, arg2) {
-            return arg1.val === arg2.val;
-        };
-        chai_1.expect(collections.arrays.contains(a, {
-            val: 1
-        })).equals(false);
-        chai_1.expect(collections.arrays.contains(a, {
-            val: 1
-        }, eq)).equals(true);
-        chai_1.expect(collections.arrays.contains(a, {
-            val: 8
-        }, eq)).equals(true);
-        chai_1.expect(collections.arrays.contains(a, {
-            val: 10
-        }, eq)).equals(true);
-        chai_1.expect(collections.arrays.contains(a, {
-            val: 11
-        }, eq)).equals(false);
-        chai_1.expect(collections.arrays.contains([], {
-            val: 11
-        }, eq)).equals(false);
-    });
-    it('Gives the right frequency', function () {
-        var a = [1, 8, 8, 8, 10, 10];
-        chai_1.expect(collections.arrays.frequency(a, 1)).equals(1);
-        chai_1.expect(collections.arrays.frequency(a, 8)).equals(3);
-        chai_1.expect(collections.arrays.frequency(a, 10)).equals(2);
-        chai_1.expect(collections.arrays.frequency(a, 11)).equals(0);
-    });
-    it('Gives the right frequency with custom equals', function () {
-        var b = {
-            val: 1
-        };
-        var c = {
-            val: 8
-        };
-        var d = {
-            val: 10
-        };
-        var e = {
-            val: 11
-        };
-        var a = [b, b, c, d];
-        var eq = function (arg1, arg2) {
-            return arg1.val === arg2.val;
-        };
-        chai_1.expect(collections.arrays.frequency(a, {
-            val: 1
-        })).equals(0);
-        chai_1.expect(collections.arrays.frequency(a, {
-            val: 1
-        }, eq)).equals(2);
-        chai_1.expect(collections.arrays.frequency(a, {
-            val: 8
-        }, eq)).equals(1);
-    });
-    it('Equal arrays are equal', function () {
-        var a = [1, 8, 8, 8, 10, 10];
-        var b = [1, 8, 8, 8, 10, 10];
-        var c = [1, 8, 5, 8, 10, 10];
-        var d = [1, 8, 8, 8, 10];
-        chai_1.expect(collections.arrays.equals(a, a)).equals(true);
-        chai_1.expect(collections.arrays.equals(a, b)).equals(true);
-        chai_1.expect(collections.arrays.equals(a, [])).equals(false);
-        chai_1.expect(collections.arrays.equals(a, c)).equals(false);
-        chai_1.expect(collections.arrays.equals(a, d)).equals(false);
-        chai_1.expect(collections.arrays.equals(a, [])).equals(false);
-    });
-    it('Equal arrays are equal with custom equals function', function () {
-        var a = [{
-                val: 8
-            }];
-        var b = [{
-                val: 8
-            }];
-        var eq = function (arg1, arg2) {
-            return arg1.val === arg2.val;
-        };
-        chai_1.expect(collections.arrays.equals(a, a)).equals(true);
-        chai_1.expect(collections.arrays.equals(a, a, eq)).equals(true);
-        chai_1.expect(collections.arrays.equals(a, b, eq)).equals(true);
-        chai_1.expect(collections.arrays.equals(a, b)).equals(false);
-    });
-    it('Removes elements', function () {
-        var a = [];
-        chai_1.expect(collections.arrays.remove(a, 1)).equals(false);
-        a = [4, 9, 9, 10];
-        chai_1.expect(collections.arrays.remove(a, 9)).equals(true);
-        chai_1.expect(collections.arrays.indexOf(a, 9)).equals(1);
-        chai_1.expect(collections.arrays.indexOf(a, 10)).equals(2);
-        chai_1.expect(collections.arrays.remove(a, 9)).equals(true);
-        chai_1.expect(collections.arrays.remove(a, 9)).equals(false);
-        chai_1.expect(collections.arrays.remove(a, 9)).equals(false);
-    });
-    it('Removes elements with custom equals function', function () {
-        var c = {
-            val: 8
-        };
-        var d = {
-            val: 10
-        };
-        var eq = function (arg1, arg2) {
-            return arg1.val === arg2.val;
-        };
-        var a = [c, d];
-        chai_1.expect(collections.arrays.remove(a, {
-            val: 10
-        })).equals(false);
-        chai_1.expect(collections.arrays.remove(a, {
-            val: 10
-        }, eq)).equals(true);
-    });
-    it('For each gives the right ordering', function () {
-        var a = [];
-        collections.arrays.forEach(a, function (e) {
-            chai_1.expect(true).equals(false); // should not enter here
-        });
-        for (var i = 0; i < 10; i++) {
-            a.push(i);
-        }
-        var i = 0;
-        collections.arrays.forEach(a, function (e) {
-            chai_1.expect(e).equals(i);
-            i++;
-        });
-    });
-    it('For each can be interrupted', function () {
-        var a = [];
-        var b = [];
-        for (var i = 0; i < 5; i++) {
-            a.push(i);
-        }
-        collections.arrays.forEach(a, function (e) {
-            b.push(e);
-            if (e === 3) {
-                return false;
-            }
-        });
-        chai_1.expect([0, 1, 2, 3]).to.deep.equal(b);
-    });
-    it('Copies existing arrays', function () {
-        var a = [1, 8, 8, 8, 10, 10];
-        var b = collections.arrays.copy(a);
-        chai_1.expect(collections.arrays.equals(a, b)).equals(true);
-        chai_1.expect(a === b).equals(false);
-    });
-    it('Swaps elements', function () {
-        var a = [1, 8, 8, 8, 10, 10];
-        chai_1.expect(collections.arrays.swap(a, 0, 5)).equals(true);
-        chai_1.expect(a[0]).equals(10);
-        chai_1.expect(a[5]).equals(1);
-        chai_1.expect(collections.arrays.swap(a, 0, 6)).equals(false);
-        chai_1.expect(collections.arrays.swap(a, 7, 2)).equals(false);
-        chai_1.expect(collections.arrays.swap(a, -1, 9)).equals(false);
-    });
-});
-//# sourceMappingURL=arraysTest.js.map
\ No newline at end of file
diff --git a/dist/test/arraysTest.js.map b/dist/test/arraysTest.js.map
deleted file mode 100644
index 992d4b3..0000000
--- a/dist/test/arraysTest.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"arraysTest.js","sourceRoot":"","sources":["../../src/test/arraysTest.ts"],"names":[],"mappings":";AAAA,IAAY,WAAW,WAAM,cAAc,CAAC,CAAA;AAG5C,qBAAqB,MAAM,CAAC,CAAA;AAE5B,QAAQ,CAAC,QAAQ,EACb;IAEI,EAAE,CAAC,oCAAoC,EACnC;QACI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QACnB,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACnD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACnD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACpD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAE,CAAC,CAAC,CAAC;QACtD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAE,CAAC,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,gEAAgE,EAC/D;QACI,IAAI,CAAC,GAAG;YACJ,GAAG,EAAE,CAAC;SACT,CAAC;QACF,IAAI,CAAC,GAAG;YACJ,GAAG,EAAE,CAAC;SACT,CAAC;QACF,IAAI,CAAC,GAAG;YACJ,GAAG,EAAE,EAAE;SACV,CAAC;QACF,IAAI,CAAC,GAAG;YACJ,GAAG,EAAE,EAAE;SACV,CAAC;QACF,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAElB,IAAI,EAAE,GAAG,UAAS,IAAS,EAAE,IAAS;YAClC,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC;QACjC,CAAC,CAAC;QAEF,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE;YACjC,GAAG,EAAE,CAAC;SACT,CAAC,CAAC,CAAC,MAAM,CAAC,CAAE,CAAC,CAAC,CAAC;QAChB,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE;YACjC,GAAG,EAAE,CAAC;SACT,EACG,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACnB,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACvD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE;YACjC,GAAG,EAAE,EAAE;SACV,EACG,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACnB,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAE,CAAC,CAAC,CAAC;QACzD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAE,CAAC,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,wCAAwC,EACvC;QACI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7B,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACvD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACvD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACxD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAE,CAAC,CAAC,CAAC;QAC1D,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAE,CAAC,CAAC,CAAC;IAC9D,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,oEAAoE,EACnE;QACI,IAAI,CAAC,GAAG;YACJ,GAAG,EAAE,CAAC;SACT,CAAC;QACF,IAAI,CAAC,GAAG;YACJ,GAAG,EAAE,CAAC;SACT,CAAC;QACF,IAAI,CAAC,GAAG;YACJ,GAAG,EAAE,EAAE;SACV,CAAC;QACF,IAAI,CAAC,GAAG;YACJ,GAAG,EAAE,EAAE;SACV,CAAC;QACF,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAErB,IAAI,EAAE,GAAG,UAAS,IAAS,EAAE,IAAS;YAClC,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC;QACjC,CAAC,CAAC;QAEF,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE;YACrC,GAAG,EAAE,CAAC;SACT,CAAC,CAAC,CAAC,MAAM,CAAC,CAAE,CAAC,CAAC,CAAC;QAChB,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE;YACrC,GAAG,EAAE,CAAC;SACT,EACG,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,4BAA4B,EAC3B;QACI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7B,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACxD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACzD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,wDAAwD,EACvD;QACI,IAAI,CAAC,GAAG;YACJ,GAAG,EAAE,CAAC;SACT,CAAC;QACF,IAAI,CAAC,GAAG;YACJ,GAAG,EAAE,CAAC;SACT,CAAC;QACF,IAAI,CAAC,GAAG;YACJ,GAAG,EAAE,EAAE;SACV,CAAC;QACF,IAAI,CAAC,GAAG;YACJ,GAAG,EAAE,EAAE;SACV,CAAC;QACF,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAErB,IAAI,EAAE,GAAG,UAAS,IAAS,EAAE,IAAS;YAClC,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC;QACjC,CAAC,CAAC;QAEF,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE;YAClC,GAAG,EAAE,CAAC;SACT,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAClB,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE;YAClC,GAAG,EAAE,CAAC;SACT,EACG,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACtB,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE;YAClC,GAAG,EAAE,CAAC;SACT,EACG,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACtB,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE;YAClC,GAAG,EAAE,EAAE;SACV,EACG,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACtB,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE;YAClC,GAAG,EAAE,EAAE;SACV,EACG,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACvB,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE;YACnC,GAAG,EAAE,EAAE;SACV,EACG,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,2BAA2B,EAC1B;QACI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7B,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACrD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACrD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACtD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,8CAA8C,EAC7C;QACI,IAAI,CAAC,GAAG;YACJ,GAAG,EAAE,CAAC;SACT,CAAC;QACF,IAAI,CAAC,GAAG;YACJ,GAAG,EAAE,CAAC;SACT,CAAC;QACF,IAAI,CAAC,GAAG;YACJ,GAAG,EAAE,EAAE;SACV,CAAC;QACF,IAAI,CAAC,GAAG;YACJ,GAAG,EAAE,EAAE;SACV,CAAC;QACF,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAErB,IAAI,EAAE,GAAG,UAAS,IAAS,EAAE,IAAS;YAClC,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC;QACjC,CAAC,CAAC;QACF,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE;YACnC,GAAG,EAAE,CAAC;SACT,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACd,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE;YACnC,GAAG,EAAE,CAAC;SACT,EACG,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACnB,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE;YACnC,GAAG,EAAE,CAAC;SACT,EACG,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,wBAAwB,EACvB;QACI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7B,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7B,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7B,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAEzB,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACvD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACtD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACtD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,oDAAoD,EACnD;QACI,IAAI,CAAC,GAAG,CAAC;gBACL,GAAG,EAAE,CAAC;aACT,CAAC,CAAC;QACH,IAAI,CAAC,GAAG,CAAC;gBACL,GAAG,EAAE,CAAC;aACT,CAAC,CAAC;QAEH,IAAI,EAAE,GAAG,UAAS,IAAS,EAAE,IAAS;YAClC,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC;QACjC,CAAC,CAAC;QAEF,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACzD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACzD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,kBAAkB,EACjB;QACI,IAAI,CAAC,GAAQ,EAAE,CAAC;QAChB,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACtD,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAClB,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACnD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACpD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACtD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,8CAA8C,EAC7C;QACI,IAAI,CAAC,GAAG;YACJ,GAAG,EAAE,CAAC;SACT,CAAC;QACF,IAAI,CAAC,GAAG;YACJ,GAAG,EAAE,EAAE;SACV,CAAC;QACF,IAAI,EAAE,GAAG,UAAS,IAAS,EAAE,IAAS;YAClC,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC;QACjC,CAAC,CAAC;QAEF,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACf,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE;YAChC,GAAG,EAAE,EAAE;SACV,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAClB,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE;YAChC,GAAG,EAAE,EAAE;SACV,EACG,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,mCAAmC,EAClC;QACI,IAAI,CAAC,GAAQ,EAAE,CAAC;QAChB,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,UAAS,CAAC;YACpC,aAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,wBAAwB;QACxD,CAAC,CAAC,CAAC;QAEH,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1B,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,UAAS,CAAC;YACpC,aAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC,EAAE,CAAC;QACR,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,6BAA6B,EAC5B;QACI,IAAI,CAAC,GAAQ,EAAE,CAAC;QAChB,IAAI,CAAC,GAAQ,EAAE,CAAC;QAChB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,CAAC;QACD,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,UAAS,CAAC;YACpC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACV,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACV,MAAM,CAAC,KAAK,CAAC;YACjB,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,aAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,wBAAwB,EACvB;QACI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7B,IAAI,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnC,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrD,aAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,gBAAgB,EACf;QACI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7B,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACtD,aAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACxB,aAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACvB,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACvD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACvD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;AAEX,CAAC,CAAC,CAAC"}
\ No newline at end of file
diff --git a/dist/test/bagTest.d.ts b/dist/test/bagTest.d.ts
deleted file mode 100644
index e69de29..0000000
diff --git a/dist/test/bagTest.js b/dist/test/bagTest.js
deleted file mode 100644
index 71f1432..0000000
--- a/dist/test/bagTest.js
+++ /dev/null
@@ -1,214 +0,0 @@
-"use strict";
-var collections = require('../lib/index');
-var chai_1 = require('chai');
-describe('Bag', function () {
-    var bag;
-    beforeEach(function () {
-        bag = new collections.Bag();
-    });
-    var toStringF = function (f) {
-        return f.description;
-    };
-    it('Gives the right size', function () {
-        bag.add('a');
-        bag.add('b');
-        bag.add('c');
-        chai_1.expect(bag.size()).equals(3);
-        bag.add('d');
-        chai_1.expect(bag.size()).equals(4);
-        bag.remove('d');
-        chai_1.expect(bag.size()).equals(3);
-        bag.clear();
-        bag.add('a');
-        bag.add('b');
-        bag.add('c');
-        chai_1.expect(bag.size()).equals(3);
-        bag.add('d');
-        chai_1.expect(bag.size()).equals(4);
-        bag.remove('d');
-        chai_1.expect(bag.size()).equals(3);
-    });
-    it('Gives the right size with duplicated elements', function () {
-        bag.add('a');
-        bag.add('a');
-        bag.add('b');
-        bag.add('b');
-        bag.add('c');
-        chai_1.expect(bag.size()).equals(5);
-        bag.remove('b');
-        bag.remove('a');
-        chai_1.expect(bag.size()).equals(3);
-        bag.remove('a');
-        bag.remove('b');
-        bag.remove('c');
-        chai_1.expect(bag.size()).equals(0);
-    });
-    it('Contains existing elements', function () {
-        bag.add('a');
-        bag.add('b');
-        bag.add('c');
-        bag.add('c');
-        bag.add('d');
-        chai_1.expect(bag.contains('a')).equals(true);
-        chai_1.expect(bag.contains('b')).equals(true);
-        chai_1.expect(bag.contains('c')).equals(true);
-        chai_1.expect(bag.contains('d')).equals(true);
-        chai_1.expect(bag.contains('e')).equals(false);
-        bag.remove('c');
-        chai_1.expect(bag.contains('c')).equals(true);
-        bag.remove('c');
-        chai_1.expect(bag.contains('c')).equals(false);
-        bag.clear();
-        bag.add(1);
-        bag.add(2);
-        chai_1.expect(bag.contains(1)).equals(true);
-        chai_1.expect(bag.contains(2)).equals(true);
-        chai_1.expect(bag.contains(3)).equals(false);
-    });
-    it('Contains existing elements with custom toString function', function () {
-        bag = new collections.Bag(toStringF);
-        var fn1 = function () { };
-        fn1.description = 'fn1';
-        chai_1.expect(bag.contains(fn1)).equals(false);
-        bag.add(fn1);
-        chai_1.expect(bag.contains(fn1)).equals(true);
-        var fn2 = function () { };
-        fn2.description = 'fn2';
-        chai_1.expect(bag.contains(fn2)).equals(false);
-        bag.add(fn2);
-        bag.add(fn2);
-        chai_1.expect(bag.contains(fn2)).equals(true);
-        chai_1.expect(bag.size()).equals(3);
-        bag.remove(fn2);
-        chai_1.expect(bag.contains(fn2)).equals(true);
-        bag.remove(fn2);
-        chai_1.expect(bag.contains(fn2)).equals(false);
-    });
-    it('An empty bag is empty', function () {
-        chai_1.expect(bag.isEmpty()).equals(true);
-        bag.add(1);
-        bag.add(1);
-        chai_1.expect(bag.isEmpty()).equals(false);
-        bag.remove(1);
-        chai_1.expect(bag.isEmpty()).equals(false);
-        bag.remove(1);
-        chai_1.expect(bag.isEmpty()).equals(true);
-    });
-    it('Adds', function () {
-        chai_1.expect(bag.add('a')).equals(true);
-        chai_1.expect(bag.add('b')).equals(true);
-        chai_1.expect(bag.contains('a')).equals(true);
-        chai_1.expect(bag.contains('b')).equals(true);
-        chai_1.expect(bag.add('b')).equals(true);
-        chai_1.expect(bag.contains('b')).equals(true);
-        chai_1.expect(bag.add(null)).equals(true);
-        chai_1.expect(bag.contains(null)).equals(true);
-        chai_1.expect(bag.add(null)).equals(true);
-        chai_1.expect(bag.contains(undefined)).equals(false);
-        chai_1.expect(bag.add(undefined)).equals(false);
-        chai_1.expect(bag.contains(undefined)).equals(false);
-    });
-    it('Adds multiple copies', function () {
-        chai_1.expect(bag.add('a', 1)).equals(true);
-        chai_1.expect(bag.add('a')).equals(true);
-        chai_1.expect(bag.add('b', 3)).equals(true);
-        chai_1.expect(bag.contains('a')).equals(true);
-        chai_1.expect(bag.contains('b')).equals(true);
-        chai_1.expect(bag.add('b')).equals(true);
-        chai_1.expect(bag.count('a')).equals(2);
-        chai_1.expect(bag.count('b')).equals(4);
-        bag.remove('a');
-        bag.remove('a');
-        chai_1.expect(bag.count('a')).equals(0);
-    });
-    it('Removes', function () {
-        chai_1.expect(bag.add('a')).equals(true);
-        chai_1.expect(bag.add('a')).equals(true);
-        chai_1.expect(bag.add('b')).equals(true);
-        chai_1.expect(bag.remove('a')).equals(true);
-        chai_1.expect(bag.remove('a')).equals(true);
-        chai_1.expect(bag.size()).equals(1);
-        chai_1.expect(bag.remove('b')).equals(true);
-        chai_1.expect(bag.size()).equals(0);
-    });
-    it('Removes multiple copies', function () {
-        chai_1.expect(bag.add('a', 1)).equals(true);
-        chai_1.expect(bag.add('a')).equals(true);
-        chai_1.expect(bag.add('b', 3)).equals(true);
-        chai_1.expect(bag.remove('b', 2)).equals(true);
-        chai_1.expect(bag.count('b')).equals(1);
-        chai_1.expect(bag.remove('b', 1)).equals(true);
-        chai_1.expect(bag.count('b')).equals(0);
-        chai_1.expect(bag.remove('a', 2)).equals(true);
-        chai_1.expect(bag.count('a')).equals(0);
-        chai_1.expect(bag.add('c', 3)).equals(true);
-        chai_1.expect(bag.remove('c', 5)).equals(true);
-        chai_1.expect(bag.count('a')).equals(0);
-        chai_1.expect(bag.size()).equals(0);
-    });
-    it('Clear removes all elements', function () {
-        chai_1.expect(bag.add('b', 3)).equals(true);
-        bag.clear();
-        chai_1.expect(bag.count('b')).equals(0);
-        chai_1.expect(bag.size()).equals(0);
-    });
-    it('Converts to an array', function () {
-        var arr = bag.toArray();
-        chai_1.expect(arr.length).equals(0);
-        chai_1.expect(bag.add('b', 3)).equals(true);
-        chai_1.expect(bag.add('a', 2)).equals(true);
-        chai_1.expect(bag.add('c')).equals(true);
-        arr = bag.toArray();
-        chai_1.expect(collections.arrays.frequency(arr, 'b')).equals(3);
-        chai_1.expect(collections.arrays.frequency(arr, 'a')).equals(2);
-        chai_1.expect(collections.arrays.frequency(arr, 'c')).equals(1);
-    });
-    it('Converts to a set', function () {
-        var set = bag.toSet();
-        chai_1.expect(set.size()).equals(0);
-        chai_1.expect(bag.add('b', 3)).equals(true);
-        chai_1.expect(bag.add('a', 2)).equals(true);
-        chai_1.expect(bag.add('c')).equals(true);
-        set = bag.toSet();
-        chai_1.expect(set.contains('b')).equals(true);
-        chai_1.expect(set.contains('a')).equals(true);
-        chai_1.expect(set.contains('c')).equals(true);
-    });
-    it('For each gives all the elements', function () {
-        bag.forEach(function (e) {
-            chai_1.expect(false).equals(true);
-        });
-        var a = [1, 5, 5, 6];
-        bag.add(1);
-        bag.add(5);
-        bag.add(5);
-        bag.add(6);
-        bag.forEach(function (e) {
-            chai_1.expect(collections.arrays.contains(a, e)).equals(true);
-        });
-        var count = 0;
-        bag.forEach(function (e) {
-            chai_1.expect(collections.arrays.contains(a, e)).equals(true);
-            if (e === 5) {
-                count++;
-                bag.remove(e);
-            }
-        });
-        chai_1.expect(count).equals(2);
-        chai_1.expect(bag.contains(5)).equals(false);
-        chai_1.expect(bag.contains(1)).equals(true);
-        chai_1.expect(bag.contains(6)).equals(true);
-    });
-    it('For each can be interrupted', function () {
-        for (var i = 0; i < 5; i++) {
-            bag.add(i);
-        }
-        var t = 0;
-        bag.forEach(function (e) {
-            t++;
-            return false;
-        });
-        chai_1.expect(t).equals(1);
-    });
-});
-//# sourceMappingURL=bagTest.js.map
\ No newline at end of file
diff --git a/dist/test/bagTest.js.map b/dist/test/bagTest.js.map
deleted file mode 100644
index 00d83e5..0000000
--- a/dist/test/bagTest.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"bagTest.js","sourceRoot":"","sources":["../../src/test/bagTest.ts"],"names":[],"mappings":";AAAA,IAAY,WAAW,WAAM,cAAc,CAAC,CAAA;AAG5C,qBAAqB,MAAM,CAAC,CAAA;AAE5B,QAAQ,CAAC,KAAK,EACV;IAEI,IAAI,GAAyB,CAAC;IAE9B,UAAU,CAAC;QACP,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAI,SAAS,GAAQ,UAAS,CAAM;QAChC,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC;IACzB,CAAC,CAAC;IAEF,EAAE,CAAC,sBAAsB,EACrB;QACI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,aAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7B,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,aAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7B,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAChB,aAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7B,GAAG,CAAC,KAAK,EAAE,CAAC;QAEZ,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,aAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7B,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,aAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7B,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAChB,aAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,+CAA+C,EAC9C;QACI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,aAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7B,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAChB,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAChB,aAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7B,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAChB,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAChB,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAChB,aAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,4BAA4B,EAC3B;QACI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAEb,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACxC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAChB,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAChB,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACxC,GAAG,CAAC,KAAK,EAAE,CAAC;QACZ,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,0DAA0D,EACzD;QACI,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACrC,IAAI,GAAG,GAAQ,cAAa,CAAC,CAAC;QAC9B,GAAG,CAAC,WAAW,GAAG,KAAK,CAAC;QACxB,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACxC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,IAAI,GAAG,GAAQ,cAAa,CAAC,CAAC;QAC9B,GAAG,CAAC,WAAW,GAAG,KAAK,CAAC;QACxB,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACxC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7B,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAChB,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAChB,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,uBAAuB,EACtB;QACI,aAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACnC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,aAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACpC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACd,aAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACpC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACd,aAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,MAAM,EACL;QACI,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClC,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACnC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACxC,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACnC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC9C,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACzC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IACP,EAAE,CAAC,sBAAsB,EACrB;QACI,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrC,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClC,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClC,aAAM,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACjC,aAAM,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACjC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAChB,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAChB,aAAM,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,SAAS,EACR;QACI,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClC,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClC,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClC,aAAM,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrC,aAAM,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrC,aAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7B,aAAM,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrC,aAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,yBAAyB,EACxB;QACI,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrC,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClC,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrC,aAAM,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACxC,aAAM,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACjC,aAAM,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACxC,aAAM,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACjC,aAAM,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACxC,aAAM,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACjC,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrC,aAAM,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACxC,aAAM,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACjC,aAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,4BAA4B,EAC3B;QACI,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrC,GAAG,CAAC,KAAK,EAAE,CAAC;QACZ,aAAM,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACjC,aAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,sBAAsB,EACrB;QACI,IAAI,GAAG,GAAG,GAAG,CAAC,OAAO,EAAE,CAAC;QACxB,aAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7B,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrC,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrC,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClC,GAAG,GAAG,GAAG,CAAC,OAAO,EAAE,CAAC;QACpB,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,mBAAmB,EAClB;QACI,IAAI,GAAG,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC;QACtB,aAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7B,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrC,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrC,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClC,GAAG,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC;QAClB,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,iCAAiC,EAChC;QACI,GAAG,CAAC,OAAO,CAAC,UAAS,CAAC;YAClB,aAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACrB,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,OAAO,CAAC,UAAS,CAAC;YAClB,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC3D,CAAC,CAAC,CAAC;QAEH,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,GAAG,CAAC,OAAO,CAAC,UAAS,CAAC;YAClB,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACvD,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACV,KAAK,EAAE,CAAC;gBACR,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAClB,CAAC;QACL,CAAC,CAAC,CAAC;QACH,aAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACxB,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACtC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,6BAA6B,EAC5B;QACI,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACf,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,GAAG,CAAC,OAAO,CAAC,UAAS,CAAC;YAClB,CAAC,EAAE,CAAC;YACJ,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC,CAAC,CAAC;QACH,aAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC,CAAC,CAAC;AACX,CAAC,CAAC,CAAC"}
\ No newline at end of file
diff --git a/dist/test/bsTreeTest.d.ts b/dist/test/bsTreeTest.d.ts
deleted file mode 100644
index e69de29..0000000
diff --git a/dist/test/bsTreeTest.js b/dist/test/bsTreeTest.js
deleted file mode 100644
index 35672b0..0000000
--- a/dist/test/bsTreeTest.js
+++ /dev/null
@@ -1,288 +0,0 @@
-"use strict";
-var collections = require('../lib/index');
-var chai_1 = require('chai');
-describe('Binary Search Tree', function () {
-    var tree = null;
-    beforeEach(function () {
-        tree = new collections.BSTree();
-    });
-    var createTree1 = function () {
-        tree.add('b');
-        tree.add('a');
-        tree.add('c');
-    };
-    var createTree2 = function () {
-        tree.add('f');
-        tree.add('b');
-        tree.add('a');
-        tree.add('d');
-        tree.add('c');
-        tree.add('e');
-        tree.add('g');
-        tree.add('i');
-        tree.add('h');
-    };
-    it('Gives the right size', function () {
-        createTree1();
-        chai_1.expect(tree.size()).equals(3);
-        tree.add('d');
-        chai_1.expect(tree.size()).equals(4);
-        tree.remove('d');
-        tree.remove('d');
-        chai_1.expect(tree.size()).equals(3);
-        tree.remove('b');
-        tree.remove('b');
-        chai_1.expect(tree.size()).equals(2);
-        tree.remove('c');
-        tree.remove('c');
-        chai_1.expect(tree.size()).equals(1);
-        tree.remove('a');
-        tree.remove('a');
-        chai_1.expect(tree.size()).equals(0);
-        tree.clear();
-        chai_1.expect(tree.size()).equals(0);
-        createTree1();
-        chai_1.expect(tree.size()).equals(3);
-        tree.add('d');
-        chai_1.expect(tree.size()).equals(4);
-        tree.remove('d');
-        chai_1.expect(tree.size()).equals(3);
-        tree.add('c');
-        chai_1.expect(tree.size()).equals(3);
-    });
-    it('Clears removes all elements', function () {
-        createTree1();
-        tree.clear();
-        chai_1.expect(tree.contains('a')).equals(false);
-    });
-    it('Gives the right height', function () {
-        createTree1();
-        chai_1.expect(tree.height()).equals(1);
-    });
-    it('Gives the right height 2', function () {
-        createTree2();
-        chai_1.expect(tree.height()).equals(3);
-    });
-    it('Gives the right height on empty tree', function () {
-        chai_1.expect(tree.height()).equals(-1);
-    });
-    it('Gives the maximum element 1', function () {
-        createTree1();
-        chai_1.expect(tree.maximum()).equals('c');
-    });
-    it('Gives the maximum element 2', function () {
-        createTree2();
-        chai_1.expect(tree.maximum()).equals('i');
-    });
-    it('Gives the maximum element on empty tree', function () {
-        chai_1.expect(tree.maximum()).equals(undefined);
-    });
-    it('Gives the minimum element 1', function () {
-        createTree1();
-        chai_1.expect(tree.minimum()).equals('a');
-    });
-    it('Gives the minimum element 2', function () {
-        createTree2();
-        chai_1.expect(tree.minimum()).equals('a');
-    });
-    it('Gives the minimum element on empty tree', function () {
-        chai_1.expect(tree.minimum()).equals(undefined);
-    });
-    it('Contains existing elements', function () {
-        createTree1();
-        chai_1.expect(tree.contains('a')).equals(true);
-        chai_1.expect(tree.contains('b')).equals(true);
-        chai_1.expect(tree.contains('c')).equals(true);
-        chai_1.expect(tree.contains('e')).equals(false);
-        tree.remove('a');
-        chai_1.expect(tree.contains('a')).equals(false);
-        chai_1.expect(tree.contains('b')).equals(true);
-        chai_1.expect(tree.contains('c')).equals(true);
-        tree.clear();
-        tree.add(3);
-        tree.add(2);
-        tree.add(4);
-        tree.add(1);
-        chai_1.expect(tree.contains(1)).equals(true);
-        chai_1.expect(tree.contains(2)).equals(true);
-        chai_1.expect(tree.contains(3)).equals(true);
-        chai_1.expect(tree.contains(4)).equals(true);
-        chai_1.expect(tree.contains(5)).equals(false);
-    });
-    it('An empty tree is empty', function () {
-        chai_1.expect(tree.isEmpty()).equals(true);
-        tree.add(1);
-        chai_1.expect(tree.isEmpty()).equals(false);
-        tree.remove(1);
-        chai_1.expect(tree.isEmpty()).equals(true);
-    });
-    it('Adds', function () {
-        chai_1.expect(tree.add('b')).equals(true);
-        chai_1.expect(tree.add('a')).equals(true);
-        chai_1.expect(tree.contains('a')).equals(true);
-        chai_1.expect(tree.contains('b')).equals(true);
-        chai_1.expect(tree.add('b')).equals(false);
-        chai_1.expect(tree.contains('b')).equals(true);
-        chai_1.expect(tree.add(null)).equals(true);
-        chai_1.expect(tree.contains(null)).equals(true);
-        chai_1.expect(tree.add(null)).equals(false);
-        chai_1.expect(tree.contains(undefined)).equals(false);
-        chai_1.expect(tree.add(undefined)).equals(false);
-        chai_1.expect(tree.contains(undefined)).equals(false);
-    });
-    it('Removes a leaf', function () {
-        createTree2();
-        tree.remove('c');
-        var array = ['a', 'b', 'd', 'e', 'f', 'g', 'h', 'i'];
-        var b = [];
-        tree.inorderTraversal(function (element) {
-            b.push(element);
-        });
-        chai_1.expect(array).to.deep.equal(b);
-    });
-    it('Removes a node with one children', function () {
-        createTree2();
-        tree.remove('i');
-        var array = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h'];
-        var b = [];
-        tree.inorderTraversal(function (element) {
-            b.push(element);
-        });
-        chai_1.expect(array).to.deep.equal(b);
-    });
-    it('Removes a node with two children', function () {
-        createTree2();
-        tree.remove('b');
-        var array = ['a', 'c', 'd', 'e', 'f', 'g', 'h', 'i'];
-        var b = [];
-        tree.inorderTraversal(function (element) {
-            b.push(element);
-        });
-        chai_1.expect(array).to.deep.equal(b);
-    });
-    it('Removes root', function () {
-        createTree2();
-        tree.remove('f');
-        var array = ['a', 'b', 'c', 'd', 'e', 'g', 'h', 'i'];
-        var b = [];
-        tree.inorderTraversal(function (element) {
-            b.push(element);
-        });
-        chai_1.expect(array).to.deep.equal(b);
-    });
-    it('Inorder traversal gives the right ordering', function () {
-        createTree2();
-        var array = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i'];
-        var b = [];
-        tree.inorderTraversal(function (element) {
-            b.push(element);
-        });
-        chai_1.expect(array).to.deep.equal(b);
-    });
-    it('Inorder traversal cen be interrupted', function () {
-        createTree2();
-        var array = ['a', 'b', 'c', 'd'];
-        var b = [];
-        tree.inorderTraversal(function (element) {
-            b.push(element);
-            if (element === 'd') {
-                return false;
-            }
-        });
-        chai_1.expect(array).to.deep.equal(b);
-    });
-    it('Preorder traversal gives the right ordering', function () {
-        createTree2();
-        var array = ['f', 'b', 'a', 'd', 'c', 'e', 'g', 'i', 'h'];
-        var b = [];
-        tree.preorderTraversal(function (element) {
-            b.push(element);
-        });
-        chai_1.expect(array).to.deep.equal(b);
-    });
-    it('Preorder traversal can be interrupted', function () {
-        createTree2();
-        var array = ['f', 'b', 'a'];
-        var b = [];
-        tree.preorderTraversal(function (element) {
-            b.push(element);
-            if (element === 'a') {
-                return false;
-            }
-        });
-        chai_1.expect(array).to.deep.equal(b);
-    });
-    it('Level traversal gives the right ordering', function () {
-        createTree2();
-        var array = ['f', 'b', 'g', 'a', 'd', 'i', 'c', 'e', 'h'];
-        var b = [];
-        tree.levelTraversal(function (element) {
-            b.push(element);
-        });
-        chai_1.expect(array).to.deep.equal(b);
-    });
-    it('Level traversal can be interrupted', function () {
-        createTree2();
-        var array = ['f', 'b', 'g', 'a', 'd', 'i'];
-        var b = [];
-        tree.levelTraversal(function (element) {
-            b.push(element);
-            if (element === 'i') {
-                return false;
-            }
-        });
-        chai_1.expect(array).to.deep.equal(b);
-    });
-    it('Postorter traversal gives the right ordering', function () {
-        createTree2();
-        var array = ['a', 'c', 'e', 'd', 'b', 'h', 'i', 'g', 'f'];
-        var b = [];
-        tree.postorderTraversal(function (element) {
-            b.push(element);
-        });
-        chai_1.expect(array).to.deep.equal(b);
-    });
-    it('Postorter traversal can be interrupted', function () {
-        createTree2();
-        var array = ['a', 'c', 'e', 'd', 'b'];
-        var b = [];
-        tree.postorderTraversal(function (element) {
-            b.push(element);
-            if (element === 'b') {
-                return false;
-            }
-        });
-        chai_1.expect(array).to.deep.equal(b);
-    });
-    it('For each gives the right ordering', function () {
-        createTree2();
-        var array = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i'];
-        var b = [];
-        tree.forEach(function (element) {
-            b.push(element);
-        });
-        chai_1.expect(array).to.deep.equal(b);
-    });
-    it('For each can be interrupted', function () {
-        createTree2();
-        var array = ['a', 'b', 'c', 'd'];
-        var b = [];
-        tree.forEach(function (element) {
-            b.push(element);
-            if (element === 'd') {
-                return false;
-            }
-        });
-        chai_1.expect(array).to.deep.equal(b);
-    });
-    it('toArray gives the right ordering', function () {
-        createTree2();
-        var array = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i'];
-        var b = tree.toArray();
-        chai_1.expect(array).to.deep.equal(b);
-    });
-    it('Empty tree returns an empty array', function () {
-        chai_1.expect(tree.toArray()).to.deep.equal([]);
-    });
-});
-//# sourceMappingURL=bsTreeTest.js.map
\ No newline at end of file
diff --git a/dist/test/bsTreeTest.js.map b/dist/test/bsTreeTest.js.map
deleted file mode 100644
index 751341d..0000000
--- a/dist/test/bsTreeTest.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"bsTreeTest.js","sourceRoot":"","sources":["../../src/test/bsTreeTest.ts"],"names":[],"mappings":";AAAA,IAAY,WAAW,WAAM,cAAc,CAAC,CAAA;AAG5C,qBAAqB,MAAM,CAAC,CAAA;AAE5B,QAAQ,CAAC,oBAAoB,EACzB;IAEI,IAAI,IAAI,GAAQ,IAAI,CAAC;IAErB,UAAU,CAAC;QACP,IAAI,GAAG,IAAI,WAAW,CAAC,MAAM,EAAE,CAAC;IACpC,CAAC,CAAC,CAAC;IACH,IAAI,WAAW,GAAG;QACd,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAClB,CAAC,CAAC;IACF,IAAI,WAAW,GAAG;QACd,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAClB,CAAC,CAAC;IAEF,EAAE,CAAC,sBAAsB,EACrB;QACI,WAAW,EAAE,CAAC;QACd,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAE9B,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,WAAW,EAAE,CAAC;QACd,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,6BAA6B,EAC5B;QACI,WAAW,EAAE,CAAC;QACd,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,wBAAwB,EACvB;QACI,WAAW,EAAE,CAAC;QACd,aAAM,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,0BAA0B,EACzB;QACI,WAAW,EAAE,CAAC;QACd,aAAM,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,sCAAsC,EACrC;QACI,aAAM,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAE,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,6BAA6B,EAC5B;QACI,WAAW,EAAE,CAAC;QACd,aAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,6BAA6B,EAC5B;QACI,WAAW,EAAE,CAAC;QACd,aAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,yCAAyC,EACxC;QACI,aAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,6BAA6B,EAC5B;QACI,WAAW,EAAE,CAAC;QACd,aAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,6BAA6B,EAC5B;QACI,WAAW,EAAE,CAAC;QACd,aAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,yCAAyC,EACxC;QACI,aAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,4BAA4B,EAC3B;QACI,WAAW,EAAE,CAAC;QAEd,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACxC,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACxC,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACxC,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACzC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACzC,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACxC,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAExC,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACtC,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACtC,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACtC,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACtC,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,wBAAwB,EACvB;QACI,aAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,aAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACrC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACf,aAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,MAAM,EACL;QACI,aAAM,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACnC,aAAM,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACnC,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACxC,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACxC,aAAM,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACpC,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACxC,aAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACpC,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACzC,aAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACrC,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC/C,aAAM,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC1C,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,gBAAgB,EACf;QACI,WAAW,EAAE,CAAC;QACd,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACrD,IAAI,CAAC,GAAQ,EAAE,CAAC;QAChB,IAAI,CAAC,gBAAgB,CAAC,UAAS,OAAY;YACvC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACpB,CAAC,CAAC,CAAC;QACH,aAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,kCAAkC,EACjC;QACI,WAAW,EAAE,CAAC;QACd,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACrD,IAAI,CAAC,GAAQ,EAAE,CAAC;QAChB,IAAI,CAAC,gBAAgB,CAAC,UAAS,OAAY;YACvC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACpB,CAAC,CAAC,CAAC;QACH,aAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,kCAAkC,EACjC;QACI,WAAW,EAAE,CAAC;QACd,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACrD,IAAI,CAAC,GAAQ,EAAE,CAAC;QAChB,IAAI,CAAC,gBAAgB,CAAC,UAAS,OAAY;YACvC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACpB,CAAC,CAAC,CAAC;QACH,aAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,cAAc,EACb;QACI,WAAW,EAAE,CAAC;QACd,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACrD,IAAI,CAAC,GAAQ,EAAE,CAAC;QAChB,IAAI,CAAC,gBAAgB,CAAC,UAAS,OAAY;YACvC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACpB,CAAC,CAAC,CAAC;QACH,aAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,4CAA4C,EAC3C;QACI,WAAW,EAAE,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC1D,IAAI,CAAC,GAAQ,EAAE,CAAC;QAChB,IAAI,CAAC,gBAAgB,CAAC,UAAS,OAAY;YACvC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACpB,CAAC,CAAC,CAAC;QACH,aAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,sCAAsC,EACrC;QACI,WAAW,EAAE,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACjC,IAAI,CAAC,GAAQ,EAAE,CAAC;QAChB,IAAI,CAAC,gBAAgB,CAAC,UAAS,OAAY;YACvC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAChB,EAAE,CAAC,CAAC,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC;gBAClB,MAAM,CAAC,KAAK,CAAC;YACjB,CAAC;QACL,CAAC,CAAC,CAAC;QACH,aAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,6CAA6C,EAC5C;QACI,WAAW,EAAE,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC1D,IAAI,CAAC,GAAQ,EAAE,CAAC;QAChB,IAAI,CAAC,iBAAiB,CAAC,UAAS,OAAY;YACxC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACpB,CAAC,CAAC,CAAC;QACH,aAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,uCAAuC,EACtC;QACI,WAAW,EAAE,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC5B,IAAI,CAAC,GAAQ,EAAE,CAAC;QAChB,IAAI,CAAC,iBAAiB,CAAC,UAAS,OAAY;YACxC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAChB,EAAE,CAAC,CAAC,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC;gBAClB,MAAM,CAAC,KAAK,CAAC;YACjB,CAAC;QACL,CAAC,CAAC,CAAC;QACH,aAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,0CAA0C,EACzC;QACI,WAAW,EAAE,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC1D,IAAI,CAAC,GAAQ,EAAE,CAAC;QAChB,IAAI,CAAC,cAAc,CAAC,UAAS,OAAY;YACrC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACpB,CAAC,CAAC,CAAC;QACH,aAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,oCAAoC,EACnC;QACI,WAAW,EAAE,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC3C,IAAI,CAAC,GAAQ,EAAE,CAAC;QAChB,IAAI,CAAC,cAAc,CAAC,UAAS,OAAY;YACrC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAChB,EAAE,CAAC,CAAC,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC;gBAClB,MAAM,CAAC,KAAK,CAAC;YACjB,CAAC;QACL,CAAC,CAAC,CAAC;QACH,aAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,8CAA8C,EAC7C;QACI,WAAW,EAAE,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC1D,IAAI,CAAC,GAAQ,EAAE,CAAC;QAChB,IAAI,CAAC,kBAAkB,CAAC,UAAS,OAAY;YACzC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACpB,CAAC,CAAC,CAAC;QACH,aAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,wCAAwC,EACvC;QACI,WAAW,EAAE,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACtC,IAAI,CAAC,GAAQ,EAAE,CAAC;QAChB,IAAI,CAAC,kBAAkB,CAAC,UAAS,OAAY;YACzC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAChB,EAAE,CAAC,CAAC,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC;gBAClB,MAAM,CAAC,KAAK,CAAC;YACjB,CAAC;QACL,CAAC,CAAC,CAAC;QACH,aAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,mCAAmC,EAClC;QACI,WAAW,EAAE,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC1D,IAAI,CAAC,GAAQ,EAAE,CAAC;QAChB,IAAI,CAAC,OAAO,CAAC,UAAS,OAAY;YAC9B,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACpB,CAAC,CAAC,CAAC;QACH,aAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,6BAA6B,EAC5B;QACI,WAAW,EAAE,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACjC,IAAI,CAAC,GAAQ,EAAE,CAAC;QAChB,IAAI,CAAC,OAAO,CAAC,UAAS,OAAY;YAC9B,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAChB,EAAE,CAAC,CAAC,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC;gBAClB,MAAM,CAAC,KAAK,CAAC;YACjB,CAAC;QACL,CAAC,CAAC,CAAC;QACH,aAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,kCAAkC,EACjC;QACI,WAAW,EAAE,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC1D,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;QACvB,aAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,mCAAmC,EAClC;QACI,aAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;AAEX,CAAC,CAAC,CAAC"}
\ No newline at end of file
diff --git a/dist/test/dictionaryTest.d.ts b/dist/test/dictionaryTest.d.ts
deleted file mode 100644
index e69de29..0000000
diff --git a/dist/test/dictionaryTest.js b/dist/test/dictionaryTest.js
deleted file mode 100644
index 1955259..0000000
--- a/dist/test/dictionaryTest.js
+++ /dev/null
@@ -1,155 +0,0 @@
-"use strict";
-var collections = require('../lib/index');
-var chai_1 = require('chai');
-describe('Dictionary', function () {
-    var dict = null;
-    var elems = 100;
-    var elemKeys = [];
-    for (var i = 0; i < elems; i++) {
-        elemKeys[i] = '' + i;
-    }
-    // Test with some potentially problematic keys
-    elemKeys[2] = 'hasOwnProperty';
-    elemKeys[4] = '__proto__';
-    elemKeys[6] = '';
-    beforeEach(function () {
-        dict = new collections.Dictionary();
-    });
-    it('Maps keys to values with string keys', function () {
-        chai_1.expect(dict.getValue('sd')).equals(undefined);
-        // test with string keys
-        for (var i = 0; i < elems; i++) {
-            chai_1.expect(dict.setValue(elemKeys[i], i + 1)).equals(undefined);
-        }
-        chai_1.expect(dict.size()).equals(elems);
-        for (var i = 0; i < elems; i++) {
-            chai_1.expect(dict.getValue(elemKeys[i])).equals(i + 1);
-        }
-        dict.setValue('a', 5);
-        chai_1.expect(dict.getValue('a')).equals(5);
-        chai_1.expect(dict.setValue('a', 21)).equals(5);
-        chai_1.expect(dict.size()).equals(elems + 1);
-        chai_1.expect(dict.getValue('a')).equals(21);
-    });
-    it('Maps keys to values with number keys', function () {
-        // test with number keys
-        for (var i = 0; i < elems; i++) {
-            chai_1.expect(dict.setValue(i, i + 1)).equals(undefined);
-        }
-        for (var i = 0; i < elems; i++) {
-            chai_1.expect(dict.getValue(i)).equals(i + 1);
-        }
-    });
-    it('Maps keys to values with custom keys', function () {
-        var ts = function (obj) {
-            return obj.s;
-        };
-        dict = new collections.Dictionary(ts);
-        chai_1.expect(dict.getValue('sd')).equals(undefined);
-        for (var i = 0; i < elems; i++) {
-            var o = {};
-            o.s = elemKeys[i];
-            chai_1.expect(dict.setValue(o, i + 1)).equals(undefined);
-        }
-        for (var i = 0; i < elems; i++) {
-            var d = {};
-            d.s = elemKeys[i];
-            chai_1.expect(dict.getValue(d)).equals(i + 1);
-        }
-    });
-    it('Removes existing elements from the dictionary', function () {
-        chai_1.expect(dict.remove('1')).equals(undefined);
-        for (var i = 0; i < elems; i++) {
-            chai_1.expect(dict.setValue(elemKeys[i], i + 1)).equals(undefined);
-        }
-        chai_1.expect(dict.size()).equals(elems);
-        for (var i = 0; i < elems; i++) {
-            chai_1.expect(dict.remove(elemKeys[i])).equals(i + 1);
-            chai_1.expect(dict.getValue(elemKeys[i])).equals(undefined);
-            chai_1.expect(dict.remove(elemKeys[i])).equals(undefined);
-        }
-        chai_1.expect(dict.size()).equals(0);
-    });
-    it('An empty dictionary is empty', function () {
-        chai_1.expect(dict.isEmpty()).equals(true);
-        dict.setValue('1', 1);
-        chai_1.expect(dict.isEmpty()).equals(false);
-        dict.remove('1');
-        chai_1.expect(dict.isEmpty()).equals(true);
-    });
-    it('Clear removes all elements', function () {
-        dict.clear();
-        dict.setValue(1, 1);
-        dict.clear();
-        chai_1.expect(dict.isEmpty()).equals(true);
-        chai_1.expect(dict.getValue(1)).equals(undefined);
-    });
-    it('Contains existing keys', function () {
-        chai_1.expect(dict.containsKey(0)).equals(false);
-        for (var i = 0; i < 10; i++) {
-            dict.setValue(elemKeys[i], i);
-            chai_1.expect(dict.containsKey(elemKeys[i])).equals(true);
-        }
-        ;
-        for (var i = 0; i < 10; i++) {
-            dict.remove(elemKeys[i]);
-            chai_1.expect(dict.containsKey(elemKeys[i])).equals(false);
-        }
-        ;
-    });
-    it('Gives the right size', function () {
-        chai_1.expect(dict.size()).equals(0);
-        for (var i = 0; i < 10; i++) {
-            dict.setValue(elemKeys[i], i);
-            chai_1.expect(dict.size()).equals(i + 1);
-        }
-        ;
-    });
-    it('Gives all the stored keys', function () {
-        var k = [];
-        for (var i = 0; i < elems; i++) {
-            var keys = dict.keys();
-            k.sort();
-            keys.sort();
-            chai_1.expect(collections.arrays.equals(k, keys)).equals(true);
-            dict.setValue(elemKeys[i], i);
-            k.push(elemKeys[i]);
-        }
-    });
-    it('Gives all the stored values', function () {
-        var v = [];
-        for (var i = 0; i < elems; i++) {
-            var values = dict.values();
-            v.sort();
-            values.sort();
-            chai_1.expect(collections.arrays.equals(v, values)).equals(true);
-            dict.setValue(elemKeys[i], i);
-            v.push(i);
-        }
-    });
-    it('For each gives all the pairs', function () {
-        for (var i = 0; i < elems; i++) {
-            dict.setValue(elemKeys[i], i);
-        }
-        var keys = dict.keys();
-        var values = dict.values();
-        dict.forEach(function (k, v) {
-            chai_1.expect(collections.arrays.remove(keys, k)).equals(true);
-            chai_1.expect(collections.arrays.remove(values, v)).equals(true);
-        });
-        chai_1.expect(keys.length).equals(0);
-        chai_1.expect(values.length).equals(0);
-    });
-    it('For each can be interrupted', function () {
-        for (var i = 0; i < elems; i++) {
-            dict.setValue(elemKeys[i], i);
-        }
-        var t = 0;
-        dict.forEach(function (k, v) {
-            t++;
-            return false;
-        });
-        chai_1.expect(t).equals(1);
-    });
-});
-//# sourceMappingURL=dictionaryTest.js.map
\ No newline at end of file
diff --git a/dist/test/dictionaryTest.js.map b/dist/test/dictionaryTest.js.map
deleted file mode 100644
index f6cdecd..0000000
--- a/dist/test/dictionaryTest.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"dictionaryTest.js","sourceRoot":"","sources":["../../src/test/dictionaryTest.ts"],"names":[],"mappings":";AAAA,IAAY,WAAW,WAAM,cAAc,CAAC,CAAA;AAG5C,qBAAqB,MAAM,CAAC,CAAA;AAE5B,QAAQ,CAAC,YAAY,EACjB;IAEI,IAAI,IAAI,GAAQ,IAAI,CAAC;IACrB,IAAI,KAAK,GAAG,GAAG,CAAC;IAChB,IAAI,QAAQ,GAAQ,EAAE,CAAC;IACvB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACzB,CAAC;IACD,8CAA8C;IAC9C,QAAQ,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC;IAC/B,QAAQ,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC;IAC1B,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;IAEjB,UAAU,CAAC;QACP,IAAI,GAAG,IAAI,WAAW,CAAC,UAAU,EAAE,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EACrC;QAEI,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAE9C,wBAAwB;QACxB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAChE,CAAC;QACD,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAElC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACrD,CAAC;QAED,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACtB,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACrC,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzC,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACtC,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAG1C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,sCAAsC,EACrC;QAEI,wBAAwB;QACxB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACtD,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3C,CAAC;IACL,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,sCAAsC,EACrC;QAEI,IAAI,EAAE,GAAG,UAAS,GAAQ;YACtB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;QACjB,CAAC,CAAC;QACF,IAAI,GAAG,IAAI,WAAW,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QACtC,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAE9C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,GAAQ,EAAE,CAAC;YAChB,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAClB,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACtD,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,GAAQ,EAAE,CAAC;YAChB,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAClB,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3C,CAAC;IACL,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,+CAA+C,EAC9C;QAEI,aAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAC3C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAChE,CAAC;QACD,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAElC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,aAAM,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC/C,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YACrD,aAAM,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACvD,CAAC;QACD,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,8BAA8B,EAC7B;QAEI,aAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACtB,aAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACrC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,aAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,4BAA4B,EAC3B;QACI,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpB,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,aAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACpC,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,wBAAwB,EACvB;QAEI,aAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC1C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1B,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9B,aAAM,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvD,CAAC;QAAA,CAAC;QACF,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,aAAM,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACxD,CAAC;QAAA,CAAC;IACN,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,sBAAsB,EACrB;QAEI,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1B,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9B,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,CAAC;QAAA,CAAC;IAEN,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,2BAA2B,EAC1B;QACI,IAAI,CAAC,GAAQ,EAAE,CAAC;QAChB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YACvB,CAAC,CAAC,IAAI,EAAE,CAAC;YACT,IAAI,CAAC,IAAI,EAAE,CAAC;YACZ,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACxD,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9B,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC;IACL,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,6BAA6B,EAC5B;QACI,IAAI,CAAC,GAAQ,EAAE,CAAC;QAChB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAC3B,CAAC,CAAC,IAAI,EAAE,CAAC;YACT,MAAM,CAAC,IAAI,EAAE,CAAC;YACd,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC1D,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9B,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,CAAC;IACL,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,8BAA8B,EAC7B;QACI,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClC,CAAC;QACD,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QACvB,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC3B,IAAI,CAAC,OAAO,CAAC,UAAS,CAAM,EAAE,CAAM;YAChC,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACxD,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC9D,CAAC,CAAC,CAAC;QACH,aAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,aAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAGP,EAAE,CAAC,6BAA6B,EAC5B;QACI,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClC,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,CAAC,OAAO,CAAC,UAAS,CAAM,EAAE,CAAM;YAChC,CAAC,EAAE,CAAC;YACJ,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC,CAAC,CAAC;QACH,aAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC,CAAC,CAAC;AAEX,CAAC,CAAC,CAAC"}
\ No newline at end of file
diff --git a/dist/test/factoryDictionaryTest.d.ts b/dist/test/factoryDictionaryTest.d.ts
deleted file mode 100644
index e69de29..0000000
diff --git a/dist/test/factoryDictionaryTest.js b/dist/test/factoryDictionaryTest.js
deleted file mode 100644
index 2ff862f..0000000
--- a/dist/test/factoryDictionaryTest.js
+++ /dev/null
@@ -1,22 +0,0 @@
-"use strict";
-var collections = require('../lib/index');
-var chai_1 = require('chai');
-describe('Factory Dictionary', function () {
-    var dict = null;
-    var defaultValue = [];
-    beforeEach(function () {
-        dict = new collections.FactoryDictionary(function () { return []; });
-    });
-    it('Uses the default value only when necessary', function () {
-        chai_1.expect(dict.setDefault('a', defaultValue)).to.deep.equal(defaultValue);
-        var key = 'b';
-        dict.setValue(key, []);
-        chai_1.expect(dict.setDefault(key, defaultValue)).to.not.equal(defaultValue);
-    });
-    it('Automatically creates a key with a default value if it doesn\'t exist', function () {
-        var key = 'a';
-        chai_1.expect(dict.getValue(key)).to.deep.equal(defaultValue);
-        chai_1.expect(dict.containsKey(key)).equals(true);
-    });
-});
-//# sourceMappingURL=factoryDictionaryTest.js.map
\ No newline at end of file
diff --git a/dist/test/factoryDictionaryTest.js.map b/dist/test/factoryDictionaryTest.js.map
deleted file mode 100644
index e2c9f78..0000000
--- a/dist/test/factoryDictionaryTest.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"factoryDictionaryTest.js","sourceRoot":"","sources":["../../src/test/factoryDictionaryTest.ts"],"names":[],"mappings":";AAAA,IAAY,WAAW,WAAM,cAAc,CAAC,CAAA;AAG5C,qBAAqB,MAAM,CAAC,CAAA;AAE5B,QAAQ,CAAC,oBAAoB,EACzB;IAEI,IAAI,IAAI,GAAQ,IAAI,CAAC;IACrB,IAAI,YAAY,GAAe,EAAE,CAAC;IAElC,UAAU,CAAC;QACP,IAAI,GAAG,IAAI,WAAW,CAAC,iBAAiB,CAAC,cAAM,OAAA,EAAE,EAAF,CAAE,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4CAA4C,EAC3C;QACI,aAAM,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QAEvE,IAAI,GAAG,GAAW,GAAG,CAAC;QAEtB,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACvB,aAAM,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;IAC1E,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,uEAAuE,EACtE;QACI,IAAI,GAAG,GAAW,GAAG,CAAC;QAEtB,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QACvD,aAAM,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;AAEX,CAAC,CAAC,CAAC"}
\ No newline at end of file
diff --git a/dist/test/heapTest.d.ts b/dist/test/heapTest.d.ts
deleted file mode 100644
index e69de29..0000000
diff --git a/dist/test/heapTest.js b/dist/test/heapTest.js
deleted file mode 100644
index 860aab1..0000000
--- a/dist/test/heapTest.js
+++ /dev/null
@@ -1,186 +0,0 @@
-"use strict";
-var collections = require('../lib/index');
-var chai_1 = require('chai');
-describe('Heap', function () {
-    var heap = null;
-    beforeEach(function () {
-        heap = new collections.Heap();
-    });
-    var createHeap1 = function () {
-        heap.add(0);
-        heap.add(1);
-        heap.add(2);
-        heap.add(3);
-    };
-    var createHeap2 = function () {
-        heap.add(1);
-        heap.add(3);
-        heap.add(0);
-        heap.add(2);
-    };
-    var createHeap3 = function () {
-        heap.add('a');
-        heap.add('b');
-        heap.add('c');
-        heap.add('d');
-    };
-    var createHeap4 = function () {
-        heap.add('b');
-        heap.add('d');
-        heap.add('a');
-        heap.add('c');
-    };
-    var createHeap5 = function () {
-        heap.add({ val: 'b' });
-        heap.add({ val: 'd' });
-        heap.add({ val: 'a' });
-        heap.add({ val: 'c' });
-    };
-    function customCompare(a, b) {
-        if (a.val < b.val) {
-            return -1;
-        }
-        else if (a.val === b.val) {
-            return 0;
-        }
-        else {
-            return 1;
-        }
-    }
-    it('Gives the right size 1', function () {
-        createHeap1();
-        chai_1.expect(heap.size()).equals(4);
-        heap.removeRoot();
-        chai_1.expect(heap.size()).equals(3);
-    });
-    it('Gives the right size 2', function () {
-        createHeap1();
-        heap.removeRoot();
-        heap.removeRoot();
-        heap.removeRoot();
-        heap.removeRoot();
-        chai_1.expect(heap.size()).equals(0);
-    });
-    it('Gives the right size with strings', function () {
-        createHeap3();
-        heap.removeRoot();
-        heap.removeRoot();
-        heap.removeRoot();
-        heap.removeRoot();
-        chai_1.expect(heap.size()).equals(0);
-    });
-    it('Peeks the lowest element', function () {
-        createHeap1();
-        chai_1.expect(heap.peek()).equals(0);
-        heap.clear();
-        chai_1.expect(heap.peek()).equals(undefined);
-    });
-    it('Peeks the lowest element 2', function () {
-        createHeap2();
-        chai_1.expect(heap.peek()).equals(0);
-    });
-    it('Peeks the lowest element with strings', function () {
-        createHeap3();
-        chai_1.expect(heap.peek()).equals('a');
-    });
-    it('Peeks the lowest element with strings 2', function () {
-        createHeap4();
-        chai_1.expect(heap.peek()).equals('a');
-    });
-    it('Peeks the lowest element with custom objects', function () {
-        heap = new collections.Heap(customCompare);
-        createHeap5();
-        chai_1.expect(heap.peek().val).equals('a');
-    });
-    it('Removes root', function () {
-        createHeap1();
-        chai_1.expect(heap.removeRoot()).equals(0);
-        chai_1.expect(heap.removeRoot()).equals(1);
-        chai_1.expect(heap.removeRoot()).equals(2);
-        chai_1.expect(heap.removeRoot()).equals(3);
-    });
-    it('Removes root 2', function () {
-        createHeap2();
-        heap.add(1);
-        chai_1.expect(heap.removeRoot()).equals(0);
-        chai_1.expect(heap.removeRoot()).equals(1);
-        chai_1.expect(heap.removeRoot()).equals(1);
-        chai_1.expect(heap.removeRoot()).equals(2);
-        chai_1.expect(heap.removeRoot()).equals(3);
-    });
-    it('Removes root with custom objects', function () {
-        heap = new collections.Heap(customCompare);
-        createHeap5();
-        chai_1.expect(heap.removeRoot().val).equals('a');
-        chai_1.expect(heap.removeRoot().val).equals('b');
-        chai_1.expect(heap.removeRoot().val).equals('c');
-        chai_1.expect(heap.removeRoot().val).equals('d');
-    });
-    it('Adds and peeks', function () {
-        heap.add(3);
-        chai_1.expect(heap.peek()).equals(3);
-        heap.add(2);
-        chai_1.expect(heap.peek()).equals(2);
-        heap.add(1);
-        chai_1.expect(heap.peek()).equals(1);
-        heap.add(0);
-        chai_1.expect(heap.peek()).equals(0);
-    });
-    it('Adds and peeks 2', function () {
-        heap.add(1);
-        chai_1.expect(heap.peek()).equals(1);
-        heap.add(3);
-        chai_1.expect(heap.peek()).equals(1);
-        heap.add(0);
-        chai_1.expect(heap.peek()).equals(0);
-        heap.add(2);
-        chai_1.expect(heap.peek()).equals(0);
-    });
-    it('An empty heap is empty', function () {
-        chai_1.expect(heap.isEmpty()).equals(true);
-        createHeap1();
-        for (var i = 0; i < heap.size(); i++) {
-            chai_1.expect(heap.isEmpty()).equals(false);
-            heap.removeRoot();
-        }
-    });
-    it('Clear removes all elements', function () {
-        heap.clear();
-        createHeap1();
-        heap.clear();
-        chai_1.expect(heap.isEmpty()).equals(true);
-        chai_1.expect(heap.peek()).equals(undefined);
-    });
-    it('Contains inserted elements', function () {
-        createHeap1();
-        for (var i = 0; i < 4; i++) {
-            chai_1.expect(heap.contains(i)).equals(true);
-        }
-        chai_1.expect(heap.contains(i)).equals(false);
-    });
-    it('For each gives the right elements', function () {
-        heap.forEach(function (e) {
-            chai_1.expect(true).equals(false); // should not enter here
-        });
-        createHeap1();
-        var elements = [];
-        heap.forEach(function (e) {
-            elements.push(e);
-        });
-        chai_1.expect(collections.arrays.contains(elements, 0)).equals(true);
-        chai_1.expect(collections.arrays.contains(elements, 1)).equals(true);
-        chai_1.expect(collections.arrays.contains(elements, 2)).equals(true);
-        chai_1.expect(collections.arrays.contains(elements, 3)).equals(true);
-        chai_1.expect(collections.arrays.contains(elements, 4)).equals(false);
-    });
-    it('For each can be interrupted', function () {
-        createHeap1();
-        var elements = [];
-        heap.forEach(function (e) {
-            elements.push(e);
-            return false;
-        });
-        chai_1.expect(elements.length).equals(1);
-    });
-});
-//# sourceMappingURL=heapTest.js.map
\ No newline at end of file
diff --git a/dist/test/heapTest.js.map b/dist/test/heapTest.js.map
deleted file mode 100644
index dfcb9b4..0000000
--- a/dist/test/heapTest.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"heapTest.js","sourceRoot":"","sources":["../../src/test/heapTest.ts"],"names":[],"mappings":";AAAA,IAAY,WAAW,WAAM,cAAc,CAAC,CAAA;AAG5C,qBAAqB,MAAM,CAAC,CAAA;AAE5B,QAAQ,CAAC,MAAM,EACX;IAEI,IAAI,IAAI,GAAQ,IAAI,CAAC;IAErB,UAAU,CAAC;QACP,IAAI,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAI,WAAW,GAAG;QACd,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC,CAAC;IAEF,IAAI,WAAW,GAAG;QACd,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC,CAAC;IAEF,IAAI,WAAW,GAAG;QACd,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAClB,CAAC,CAAC;IAEF,IAAI,WAAW,GAAG;QACd,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAClB,CAAC,CAAC;IAEF,IAAI,WAAW,GAAG;QACd,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QACvB,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QACvB,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QACvB,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IAC3B,CAAC,CAAC;IAEF,uBAAuB,CAAM,EAAE,CAAM;QACjC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,CAAC,CAAC,CAAC;QACd,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACzB,MAAM,CAAC,CAAC,CAAC;QACb,CAAC;QAAC,IAAI,CAAC,CAAC;YACJ,MAAM,CAAC,CAAC,CAAC;QACb,CAAC;IACL,CAAC;IAED,EAAE,CAAC,wBAAwB,EACvB;QACI,WAAW,EAAE,CAAC;QACd,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,UAAU,EAAE,CAAC;QAClB,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,wBAAwB,EACvB;QACI,WAAW,EAAE,CAAC;QACd,IAAI,CAAC,UAAU,EAAE,CAAC;QAClB,IAAI,CAAC,UAAU,EAAE,CAAC;QAClB,IAAI,CAAC,UAAU,EAAE,CAAC;QAClB,IAAI,CAAC,UAAU,EAAE,CAAC;QAClB,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,mCAAmC,EAClC;QACI,WAAW,EAAE,CAAC;QACd,IAAI,CAAC,UAAU,EAAE,CAAC;QAClB,IAAI,CAAC,UAAU,EAAE,CAAC;QAClB,IAAI,CAAC,UAAU,EAAE,CAAC;QAClB,IAAI,CAAC,UAAU,EAAE,CAAC;QAClB,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,0BAA0B,EACzB;QACI,WAAW,EAAE,CAAC;QACd,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,4BAA4B,EAC3B;QACI,WAAW,EAAE,CAAC;QACd,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,uCAAuC,EACtC;QACI,WAAW,EAAE,CAAC;QACd,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,yCAAyC,EACxC;QACI,WAAW,EAAE,CAAC;QACd,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,8CAA8C,EAC7C;QACI,IAAI,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC3C,WAAW,EAAE,CAAC;QACd,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,cAAc,EACb;QACI,WAAW,EAAE,CAAC;QACd,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACpC,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACpC,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACpC,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,gBAAgB,EACf;QACI,WAAW,EAAE,CAAC;QACd,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACpC,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACpC,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACpC,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACpC,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,kCAAkC,EACjC;QACI,IAAI,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC3C,WAAW,EAAE,CAAC;QACd,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC1C,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC1C,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC1C,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,gBAAgB,EACf;QACI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,kBAAkB,EACjB;QACI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,wBAAwB,EACvB;QACI,aAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACpC,WAAW,EAAE,CAAC;QACd,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,aAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACrC,IAAI,CAAC,UAAU,EAAE,CAAC;QACtB,CAAC;IACL,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,4BAA4B,EAC3B;QACI,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,WAAW,EAAE,CAAC;QACd,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,aAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACpC,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,4BAA4B,EAC3B;QACI,WAAW,EAAE,CAAC;QACd,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC1C,CAAC;QACD,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,mCAAmC,EAClC;QAEI,IAAI,CAAC,OAAO,CAAC,UAAS,CAAM;YACxB,aAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,wBAAwB;QACxD,CAAC,CAAC,CAAC;QACH,WAAW,EAAE,CAAC;QAEd,IAAI,QAAQ,GAAQ,EAAE,CAAC;QACvB,IAAI,CAAC,OAAO,CAAC,UAAS,CAAM;YACxB,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC,CAAC,CAAC;QAEH,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC9D,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC9D,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC9D,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC9D,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACnE,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,6BAA6B,EAC5B;QACI,WAAW,EAAE,CAAC;QACd,IAAI,QAAQ,GAAQ,EAAE,CAAC;QACvB,IAAI,CAAC,OAAO,CAAC,UAAS,CAAM;YACxB,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjB,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC,CAAC,CAAC;QACH,aAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;AACX,CAAC,CAAC,CAAC"}
\ No newline at end of file
diff --git a/dist/test/linkedListTest.d.ts b/dist/test/linkedListTest.d.ts
deleted file mode 100644
index e69de29..0000000
diff --git a/dist/test/linkedListTest.js b/dist/test/linkedListTest.js
deleted file mode 100644
index b3f8a04..0000000
--- a/dist/test/linkedListTest.js
+++ /dev/null
@@ -1,328 +0,0 @@
-"use strict";
-var collections = require('../lib/index');
-var chai_1 = require('chai');
-describe('Linked List', function () {
-    var list = null;
-    var elems = 100;
-    var equals = function (a, b) {
-        return a.el === b.el;
-    };
-    beforeEach(function () {
-        list = new collections.LinkedList();
-    });
-    it('Inserts elements', function () {
-        chai_1.expect(list.first()).equals(undefined);
-        chai_1.expect(list.last()).equals(undefined);
-        chai_1.expect(list.size()).equals(0);
-        for (var i = 0; i < elems; i++) {
-            list.add(i);
-            chai_1.expect(list.first()).equals(0);
-            chai_1.expect(list.last()).equals(i);
-            if (i === 0) {
-                chai_1.expect(list.first()).equals(list.last());
-            }
-            chai_1.expect(list.size()).equals(i + 1);
-        }
-    });
-    it('Reverses the list 1', function () {
-        list.add(1);
-        list.add(2);
-        list.add(3);
-        list.reverse();
-        chai_1.expect(list.elementAtIndex(0)).equals(3);
-        chai_1.expect(list.elementAtIndex(1)).equals(2);
-        chai_1.expect(list.elementAtIndex(2)).equals(1);
-    });
-    it('Reverses the list 2', function () {
-        list.add(1);
-        list.add(2);
-        list.reverse();
-        chai_1.expect(list.elementAtIndex(0)).equals(2);
-        chai_1.expect(list.elementAtIndex(1)).equals(1);
-    });
-    it('Reverses the list 2', function () {
-        list.add(1);
-        list.reverse();
-        chai_1.expect(list.elementAtIndex(0)).equals(1);
-        chai_1.expect(list.elementAtIndex(1)).equals(undefined);
-    });
-    it('Clear removes all elements', function () {
-        for (var i = 0; i < elems; i++) {
-            list.add(i);
-        }
-        list.clear();
-        chai_1.expect(list.first()).equals(undefined);
-        chai_1.expect(list.last()).equals(undefined);
-        chai_1.expect(list.size()).equals(0);
-    });
-    it('Gives the right size', function () {
-        chai_1.expect(list.size()).equals(0);
-        list.add(1);
-        chai_1.expect(list.size()).equals(1);
-        list.add(1);
-        chai_1.expect(list.size()).equals(2);
-    });
-    it('Inserts an element to specified index', function () {
-        chai_1.expect(list.elementAtIndex(-1)).equals(undefined);
-        chai_1.expect(list.elementAtIndex(0)).equals(undefined);
-        chai_1.expect(list.elementAtIndex(1)).equals(undefined);
-        for (var i = 0; i < elems; i++) {
-            list.add(i);
-            chai_1.expect(list.elementAtIndex(list.size() - 1)).equals(i);
-            chai_1.expect(list.elementAtIndex(i)).equals(i);
-            for (var j = 0; j < i; j++) {
-                chai_1.expect(list.elementAtIndex(j)).equals(j);
-            }
-        }
-    });
-    it('Two equal lists are equal', function () {
-        list.add(1);
-        list.add(2);
-        var list2 = new collections.LinkedList();
-        list2.add(1);
-        list2.add(2);
-        chai_1.expect(list.equals(list2)).equals(true);
-        list2.clear();
-        list2.add(2);
-        list2.add(1);
-        chai_1.expect(list.equals(list2)).equals(false);
-        chai_1.expect(list.equals([1, 2])).equals(false);
-    });
-    it('Doesn\'t insert elements to invalid indexes', function () {
-        chai_1.expect(list.add(0, 1)).equals(false);
-        chai_1.expect(list.size() === 0).equals(true);
-        chai_1.expect(list.first()).equals(undefined);
-        chai_1.expect(list.last()).equals(undefined);
-    });
-    it('Inserts elements to the last index', function () {
-        for (var i = 0; i < elems; i++) {
-            chai_1.expect(list.add(i, i)).equals(true);
-            chai_1.expect(list.elementAtIndex(i)).equals(i);
-            chai_1.expect(list.first()).equals(0);
-            chai_1.expect(list.last()).equals(i);
-            if (i === 0) {
-                chai_1.expect(list.first()).equals(list.last());
-            }
-            chai_1.expect(list.size()).equals(i + 1);
-        }
-    });
-    it('Inserts elements at the first index', function () {
-        for (var j = 0; j < elems; j++) {
-            for (var i = 0; i < j; i++) {
-                list.add(i);
-            }
-            list.add(-i, 0);
-            chai_1.expect(list.elementAtIndex(0)).equals(-i);
-            chai_1.expect(list.first()).equals(-i);
-        }
-    });
-    it('Inserts elements to custom index', function () {
-        for (var j = 0; j < elems; j++) {
-            list.add(j);
-        }
-        list.add(-100, elems / 2);
-        chai_1.expect(list.elementAtIndex(elems / 2)).equals(-100);
-    });
-    it('Finds elements with indexOf', function () {
-        chai_1.expect(list.indexOf(0)).equals(-1);
-        for (var j = 0; j < elems; j++) {
-            list.add(j + 1);
-            chai_1.expect(list.indexOf(j + 1)).equals(j);
-            chai_1.expect(list.indexOf(-100)).equals(-1);
-        }
-        for (var j = 0; j < elems; j++) {
-            chai_1.expect(list.indexOf(j + 1)).equals(j);
-            chai_1.expect(list.indexOf(-100)).equals(-1);
-        }
-    });
-    it('Finds elements with indexOf and custom equals function', function () {
-        chai_1.expect(list.indexOf({
-            el: 1
-        }, equals)).equals(-1);
-        for (var j = 0; j < elems; j++) {
-            list.add({
-                el: j + 1
-            });
-            chai_1.expect(list.indexOf({
-                el: j + 1
-            }, equals)).equals(j);
-            chai_1.expect(list.indexOf({
-                el: -200
-            }, equals)).equals(-1);
-        }
-        for (var j = 0; j < elems; j++) {
-            chai_1.expect(list.indexOf({
-                el: j + 1
-            }, equals)).equals(j);
-            chai_1.expect(list.indexOf({
-                el: -200
-            }, equals)).equals(-1);
-        }
-    });
-    it('Removes elements', function () {
-        chai_1.expect(list.remove(1)).equals(false);
-        chai_1.expect(list.size() === 0).equals(true);
-        chai_1.expect(list.last()).equals(undefined);
-        chai_1.expect(list.first()).equals(undefined);
-        for (var i = 0; i < elems; i++) {
-            list.add(i);
-            chai_1.expect(list.remove(i)).equals(true);
-            chai_1.expect(list.size() === 0).equals(true);
-            chai_1.expect(list.last()).equals(undefined);
-            chai_1.expect(list.first()).equals(undefined);
-        }
-        list.add(1);
-        list.add(2);
-        chai_1.expect(list.remove(1)).equals(true);
-        chai_1.expect(list.size() === 1).equals(true);
-        chai_1.expect(list.first()).equals(2);
-        chai_1.expect(list.last()).equals(2);
-        list.clear();
-        list.add(1);
-        list.add(2);
-        list.add(3);
-        list.add(4);
-        chai_1.expect(list.remove(2)).equals(true);
-        chai_1.expect(list.size() === 3).equals(true);
-        chai_1.expect(list.first()).equals(1);
-        chai_1.expect(list.last()).equals(4);
-        chai_1.expect(list.elementAtIndex(0)).equals(1);
-        chai_1.expect(list.elementAtIndex(1)).equals(3);
-        chai_1.expect(list.elementAtIndex(2)).equals(4);
-        chai_1.expect(list.elementAtIndex(3)).equals(undefined);
-        list.clear();
-        for (var i = 0; i < elems; i++) {
-            list.add(i);
-        }
-        var half = elems / 2;
-        list.remove(elems / 2);
-        for (var i = 0; i < elems; i++) {
-            if (i === (half)) {
-                chai_1.expect(list.indexOf(i)).equals(-1);
-            }
-            else if (i < half) {
-                chai_1.expect(list.indexOf(i)).equals(i);
-            }
-            else if (i > half) {
-                chai_1.expect(list.indexOf(i)).equals(i - 1);
-            }
-        }
-        chai_1.expect(list.size() === (elems - 1)).equals(true);
-    });
-    it('Doesn\'t remove non existing elements', function () {
-        chai_1.expect(list.remove(5)).equals(false);
-        chai_1.expect(list.size()).equals(0);
-        list.add(1);
-        list.add(2);
-        list.add(3);
-        list.add(4);
-        chai_1.expect(list.remove(5)).equals(false);
-        chai_1.expect(list.size()).equals(4);
-    });
-    it('Removes elements with custom equals', function () {
-        chai_1.expect(list.remove({ el: 1 })).equals(false);
-        for (var i = 0; i < elems; i++) {
-            list.add({ el: i });
-        }
-        for (var i = 0; i < elems; i++) {
-            chai_1.expect(list.remove({ el: i })).equals(false);
-            chai_1.expect(list.remove({ el: i }, equals)).equals(true);
-        }
-    });
-    it('Removes elements at specified index', function () {
-        chai_1.expect(list.removeElementAtIndex(0)).equals(undefined);
-        chai_1.expect(list.removeElementAtIndex(-1)).equals(undefined);
-        chai_1.expect(list.removeElementAtIndex(1)).equals(undefined);
-        chai_1.expect(list.size() === 0).equals(true);
-        list.add(1);
-        chai_1.expect(list.removeElementAtIndex(-1)).equals(undefined);
-        chai_1.expect(list.removeElementAtIndex(1)).equals(undefined);
-        chai_1.expect(list.size() === 1).equals(true);
-        chai_1.expect(list.removeElementAtIndex(0)).equals(1);
-        chai_1.expect(list.size() === 0).equals(true);
-        chai_1.expect(list.first()).equals(undefined);
-        chai_1.expect(list.last()).equals(undefined);
-        chai_1.expect(list.elementAtIndex(0)).equals(undefined);
-        list.add(1);
-        list.add(2);
-        chai_1.expect(list.removeElementAtIndex(0)).equals(1);
-        chai_1.expect(list.size() === 1).equals(true);
-        chai_1.expect(list.first()).equals(2);
-        list.clear();
-        list.add(1);
-        list.add(2);
-        list.add(3);
-        chai_1.expect(list.removeElementAtIndex(2)).equals(3);
-        chai_1.expect(list.size() === 2).equals(true);
-        chai_1.expect(list.first()).equals(1);
-        chai_1.expect(list.last()).equals(2);
-        list.clear();
-        list.add(1);
-        list.add(2);
-        list.add(3);
-        list.add(4);
-        list.add(5);
-        chai_1.expect(list.removeElementAtIndex(2)).equals(3);
-        chai_1.expect(list.size() === 4).equals(true);
-        chai_1.expect(list.first()).equals(1);
-        chai_1.expect(list.last()).equals(5);
-        chai_1.expect(list.elementAtIndex(0)).equals(1);
-        chai_1.expect(list.elementAtIndex(1)).equals(2);
-        chai_1.expect(list.elementAtIndex(2)).equals(4);
-        chai_1.expect(list.elementAtIndex(3)).equals(5);
-    });
-    it('Converts the list to an array', function () {
-        chai_1.expect(list.toArray().length).equals(0);
-        list.add(5);
-        var arr = list.toArray();
-        chai_1.expect(arr[0]).equals(5);
-        chai_1.expect(arr.length).equals(1);
-        list.add(8);
-        arr = list.toArray();
-        chai_1.expect(arr[0]).equals(5);
-        chai_1.expect(arr[1]).equals(8);
-        chai_1.expect(arr.length).equals(2);
-    });
-    it('Two identical linked lists are equal', function () {
-        var list2 = new collections.LinkedList();
-        chai_1.expect(list.equals(list2)).equals(true);
-        list.add(1);
-        list.add(2);
-        chai_1.expect(list.equals(list2)).equals(false);
-        list2.add(2);
-        list2.add(1);
-        chai_1.expect(list.equals(list2)).equals(false);
-        list2.clear();
-        list2.add(1);
-        list2.add(2);
-        chai_1.expect(list.equals(list2)).equals(true);
-    });
-    it('For each gives the right ordering', function () {
-        list.forEach(function (e) {
-            chai_1.expect(true).equals(false); // should not enter here
-        });
-        for (var i = 0; i < elems; i++) {
-            list.add(i);
-        }
-        var i = 0;
-        list.forEach(function (e) {
-            chai_1.expect(e).equals(i);
-            i++;
-        });
-    });
-    it('For each can be interrupted', function () {
-        var array = [0, 1, 2, 3, 4];
-        var b = [];
-        for (var i = 0; i < elems; i++) {
-            list.add(i);
-        }
-        list.forEach(function (e) {
-            b.push(e);
-            if (e === 4) {
-                return false;
-            }
-        });
-        chai_1.expect(array).to.deep.equal(b);
-    });
-});
-//# sourceMappingURL=linkedListTest.js.map
\ No newline at end of file
diff --git a/dist/test/linkedListTest.js.map b/dist/test/linkedListTest.js.map
deleted file mode 100644
index fb13871..0000000
--- a/dist/test/linkedListTest.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"linkedListTest.js","sourceRoot":"","sources":["../../src/test/linkedListTest.ts"],"names":[],"mappings":";AAAA,IAAY,WAAW,WAAM,cAAc,CAAC,CAAA;AAG5C,qBAAqB,MAAM,CAAC,CAAA;AAE5B,QAAQ,CAAC,aAAa,EAClB;IAEI,IAAI,IAAI,GAAQ,IAAI,CAAC;IACrB,IAAI,KAAK,GAAG,GAAG,CAAC;IAEhB,IAAI,MAAM,GAAG,UAAS,CAAM,EAAE,CAAM;QAChC,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC;IACzB,CAAC,CAAC;IAEF,UAAU,CAAC;QACP,IAAI,GAAG,IAAI,WAAW,CAAC,UAAU,EAAE,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kBAAkB,EACjB;QACI,aAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACvC,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACtC,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACZ,aAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC/B,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAE9B,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACV,aAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;YAC7C,CAAC;YACD,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,CAAC;IACL,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,qBAAqB,EACpB;QACI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,aAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzC,aAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzC,aAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,qBAAqB,EACpB;QACI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,aAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzC,aAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,qBAAqB,EACpB;QACI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,aAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzC,aAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,4BAA4B,EAC3B;QACI,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC;QACD,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,aAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACvC,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACtC,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,sBAAsB,EACrB;QACI,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,uCAAuC,EACtC;QACI,aAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACnD,aAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACjD,aAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAEjD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACZ,aAAM,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACvD,aAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEzC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,aAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7C,CAAC;QACL,CAAC;IACL,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,2BAA2B,EAC1B;QACI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAEZ,IAAI,KAAK,GAAG,IAAI,WAAW,CAAC,UAAU,EAAE,CAAC;QACzC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACb,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAEb,aAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACxC,KAAK,CAAC,KAAK,EAAE,CAAC;QACd,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACb,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACb,aAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACzC,aAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAGP,EAAE,CAAC,6CAA6C,EAC5C;QACI,aAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACrC,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACvC,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAGP,EAAE,CAAC,oCAAoC,EACnC;QACI,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,aAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACpC,aAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACzC,aAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC/B,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC9B,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACV,aAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;YAC7C,CAAC;YACD,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,CAAC;IACL,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,qCAAqC,EACpC;QACI,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAE7B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACjB,aAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAE,CAAC,CAAC,CAAC;YAC3C,aAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,CAAE,CAAC,CAAC,CAAC;QACrC,CAAC;IACL,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,kCAAkC,EACjC;QACI,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,CAAE,GAAG,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAC3B,aAAM,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAE,GAAG,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAGP,EAAE,CAAC,6BAA6B,EAC5B;QACI,aAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAE,CAAC,CAAC,CAAC;QACpC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChB,aAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACtC,aAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAE,CAAC,CAAC,CAAC;QAC5C,CAAC;QACD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,aAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACtC,aAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAE,CAAC,CAAC,CAAC;QAC5C,CAAC;IACL,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,wDAAwD,EACvD;QACI,aAAM,CAAC,IAAI,CAAC,OAAO,CAAC;YAChB,EAAE,EAAE,CAAC;SACR,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAE,CAAC,CAAC,CAAC;QACxB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,GAAG,CAAC;gBACL,EAAE,EAAE,CAAC,GAAG,CAAC;aACZ,CAAC,CAAC;YACH,aAAM,CAAC,IAAI,CAAC,OAAO,CAAC;gBAChB,EAAE,EAAE,CAAC,GAAG,CAAC;aACZ,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACtB,aAAM,CAAC,IAAI,CAAC,OAAO,CAAC;gBAChB,EAAE,EAAE,CAAC,GAAG;aACX,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAE,CAAC,CAAC,CAAC;QAC5B,CAAC;QACD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,aAAM,CAAC,IAAI,CAAC,OAAO,CAAC;gBAChB,EAAE,EAAE,CAAC,GAAG,CAAC;aACZ,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACtB,aAAM,CAAC,IAAI,CAAC,OAAO,CAAC;gBAChB,EAAE,EAAE,CAAC,GAAG;aACX,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAE,CAAC,CAAC,CAAC;QAC5B,CAAC;IACL,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,kBAAkB,EACjB;QACI,aAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACrC,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACtC,aAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAEvC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACZ,aAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACpC,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACvC,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YACtC,aAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAC3C,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,aAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACpC,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,EAAE,CAAC;QAEb,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,aAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACpC,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,aAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzC,aAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzC,aAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzC,aAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACjD,IAAI,CAAC,KAAK,EAAE,CAAC;QAEb,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC;QACD,IAAI,IAAI,GAAG,KAAK,GAAG,CAAC,CAAC;QACrB,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACvB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACf,aAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAE,CAAC,CAAC,CAAC;YACxC,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;gBAClB,aAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;gBAClB,aAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1C,CAAC;QACL,CAAC;QACD,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,uCAAuC,EACtC;QACI,aAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACrC,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,aAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACrC,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,qCAAqC,EACpC;QACI,aAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC7C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QACxB,CAAC;QACD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,aAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC7C,aAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACxD,CAAC;IAEL,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,qCAAqC,EACpC;QACI,aAAM,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACvD,aAAM,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACzD,aAAM,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACvD,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAEvC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAEZ,aAAM,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACzD,aAAM,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACvD,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAEvC,aAAM,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/C,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACvC,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACtC,aAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAEjD,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,aAAM,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/C,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAE/B,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,aAAM,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/C,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,EAAE,CAAC;QAEb,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAEZ,aAAM,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/C,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAE9B,aAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzC,aAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzC,aAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzC,aAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,+BAA+B,EAC9B;QACI,aAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAExC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,GAAG,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;QACzB,aAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzB,aAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAE7B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,GAAG,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;QACrB,aAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzB,aAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzB,aAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,sCAAsC,EACrC;QACI,IAAI,KAAK,GAAG,IAAI,WAAW,CAAC,UAAU,EAAE,CAAC;QACzC,aAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAExC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,aAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACzC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACb,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACb,aAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACzC,KAAK,CAAC,KAAK,EAAE,CAAC;QACd,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACb,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACb,aAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,mCAAmC,EAClC;QAEI,IAAI,CAAC,OAAO,CAAC,UAAS,CAAM;YACxB,aAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,wBAAwB;QACxD,CAAC,CAAC,CAAC;QAEH,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,CAAC,OAAO,CAAC,UAAS,CAAM;YACxB,aAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC,EAAE,CAAC;QACR,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,6BAA6B,EAC5B;QACI,IAAI,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,GAAQ,EAAE,CAAC;QAChB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,UAAS,CAAM;YACxB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACV,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACV,MAAM,CAAC,KAAK,CAAC;YACjB,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,aAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;AAEX,CAAC,CAAC,CAAC"}
\ No newline at end of file
diff --git a/dist/test/multiDictionaryTest.d.ts b/dist/test/multiDictionaryTest.d.ts
deleted file mode 100644
index e69de29..0000000
diff --git a/dist/test/multiDictionaryTest.js b/dist/test/multiDictionaryTest.js
deleted file mode 100644
index 9221d7e..0000000
--- a/dist/test/multiDictionaryTest.js
+++ /dev/null
@@ -1,157 +0,0 @@
-"use strict";
-var collections = require('../lib/index');
-var chai_1 = require('chai');
-describe('Multi Dictionary', function () {
-    var dict = null;
-    var elems = 100;
-    beforeEach(function () {
-        dict = new collections.MultiDictionary();
-    });
-    it('Maps keys to values with string keys', function () {
-        chai_1.expect(dict.getValue('sd')).to.deep.equal([]);
-        // test with string keys
-        for (var i = 0; i < elems; i++) {
-            chai_1.expect(dict.setValue('' + i, i + 1)).equals(true);
-        }
-        chai_1.expect(dict.size()).equals(elems);
-        for (var i = 0; i < elems; i++) {
-            chai_1.expect(dict.getValue('' + i)).to.deep.equal([i + 1]);
-        }
-        dict.setValue('a', 5);
-        chai_1.expect(dict.getValue('a')).to.deep.equal([5]);
-        chai_1.expect(dict.setValue('a', 21)).equals(true);
-        chai_1.expect(dict.size()).equals(elems + 1);
-        chai_1.expect(dict.getValue('a')).to.deep.equal([5, 21]);
-    });
-    it('Maps keys to values with number keys', function () {
-        // test with number keys
-        for (var i = 0; i < elems; i++) {
-            chai_1.expect(dict.setValue(i, i + 1)).equals(true);
-        }
-        for (var i = 0; i < elems; i++) {
-            chai_1.expect(dict.getValue(i)).to.deep.equal([i + 1]);
-        }
-    });
-    it('Maps keys to values with custom keys', function () {
-        var ts = function (obj) {
-            return obj.s;
-        };
-        dict = new collections.MultiDictionary(ts);
-        chai_1.expect(dict.getValue('sd')).to.deep.equal([]);
-        for (var i = 0; i < elems; i++) {
-            var o = {};
-            o.s = '' + i;
-            chai_1.expect(dict.setValue(o, i + 1)).equals(true);
-        }
-        for (var i = 0; i < elems; i++) {
-            var d = {};
-            d.s = '' + i;
-            chai_1.expect(dict.getValue(d)).to.deep.equal([i + 1]);
-        }
-    });
-    it('Maps multiple values', function () {
-        dict.setValue('a', 5);
-        chai_1.expect(dict.getValue('a')).to.deep.equal([5]);
-        chai_1.expect(dict.setValue('a', 21)).equals(true);
-        chai_1.expect(dict.size()).equals(1);
-        chai_1.expect(dict.getValue('a')).to.deep.equal([5, 21]);
-        chai_1.expect(dict.size()).equals(1);
-        chai_1.expect(dict.setValue('a', 31)).equals(true);
-        chai_1.expect(dict.size()).equals(1);
-        chai_1.expect(dict.getValue('a')).to.deep.equal([5, 21, 31]);
-        chai_1.expect(dict.size()).equals(1);
-    });
-    it('Removes existing elements from the dictionary', function () {
-        chai_1.expect(dict.remove('1')).equals(false);
-        for (var i = 0; i < elems; i++) {
-            chai_1.expect(dict.setValue('' + i, i + 1)).equals(true);
-        }
-        chai_1.expect(dict.size()).equals(elems);
-        for (var i = 0; i < elems; i++) {
-            chai_1.expect(dict.remove('' + i)).equals(true);
-            chai_1.expect(dict.getValue('' + i)).to.deep.equal([]);
-            chai_1.expect(dict.remove('' + i)).equals(false);
-        }
-        chai_1.expect(dict.size()).equals(0);
-    });
-    it('Removes all values from a key', function () {
-        dict.setValue('a', 1);
-        dict.remove('a');
-        chai_1.expect(dict.containsKey('a')).equals(false);
-        chai_1.expect(dict.getValue('a')).to.deep.equal([]);
-        dict.setValue('a', 2);
-        dict.setValue('a', 3);
-        dict.remove('a');
-        chai_1.expect(dict.containsKey('a')).equals(false);
-        chai_1.expect(dict.getValue('a')).to.deep.equal([]);
-    });
-    it('Removes a single value from a key', function () {
-        dict.setValue('a', 1);
-        dict.remove('a', 1);
-        chai_1.expect(dict.containsKey('a')).equals(false);
-        chai_1.expect(dict.getValue('a')).to.deep.equal([]);
-        dict.setValue('a', 2);
-        dict.setValue('a', 3);
-        dict.remove('a', 3);
-        chai_1.expect(dict.containsKey('a')).equals(true);
-        chai_1.expect(dict.getValue('a')).to.deep.equal([2]);
-        dict.remove('a', 2);
-        chai_1.expect(dict.containsKey('a')).equals(false);
-        chai_1.expect(dict.getValue('a')).to.deep.equal([]);
-    });
-    it('An empty dictionary is empty', function () {
-        chai_1.expect(dict.isEmpty()).equals(true);
-        dict.setValue('1', 1);
-        chai_1.expect(dict.isEmpty()).equals(false);
-        dict.remove('1');
-        chai_1.expect(dict.isEmpty()).equals(true);
-    });
-    it('Clear removes all elements', function () {
-        dict.clear();
-        dict.setValue(1, 1);
-        dict.clear();
-        chai_1.expect(dict.isEmpty()).equals(true);
-        chai_1.expect(dict.getValue(1)).to.deep.equal([]);
-    });
-    it('Contains existing keys', function () {
-        chai_1.expect(dict.containsKey(0)).equals(false);
-        for (var i = 0; i < 10; i++) {
-            dict.setValue(i, i);
-            chai_1.expect(dict.containsKey(i)).equals(true);
-        }
-        for (var i = 0; i < 10; i++) {
-            dict.remove(i);
-            chai_1.expect(dict.containsKey(i)).equals(false);
-        }
-    });
-    it('Gives the right size', function () {
-        chai_1.expect(dict.size()).equals(0);
-        for (var i = 0; i < 10; i++) {
-            dict.setValue(i, i);
-            chai_1.expect(dict.size()).equals(i + 1);
-        }
-    });
-    it('Gives all the stored keys', function () {
-        var k = [];
-        for (var i = 0; i < elems; i++) {
-            var keys = dict.keys();
-            k.sort();
-            keys.sort();
-            chai_1.expect(k).to.deep.equal(keys);
-            dict.setValue('' + i, i);
-            k.push('' + i);
-        }
-    });
-    it('Gives all the stored values', function () {
-        var v = [];
-        for (var i = 0; i < elems; i++) {
-            var values = dict.values();
-            v.sort();
-            values.sort();
-            chai_1.expect(v).to.deep.equal(values);
-            dict.setValue('' + i, i);
-            v.push(i);
-        }
-    });
-});
-//# sourceMappingURL=multiDictionaryTest.js.map
\ No newline at end of file
diff --git a/dist/test/multiDictionaryTest.js.map b/dist/test/multiDictionaryTest.js.map
deleted file mode 100644
index b2ec484..0000000
--- a/dist/test/multiDictionaryTest.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"multiDictionaryTest.js","sourceRoot":"","sources":["../../src/test/multiDictionaryTest.ts"],"names":[],"mappings":";AAAA,IAAY,WAAW,WAAM,cAAc,CAAC,CAAA;AAG5C,qBAAqB,MAAM,CAAC,CAAA;AAE5B,QAAQ,CAAC,kBAAkB,EACvB;IAEI,IAAI,IAAI,GAAQ,IAAI,CAAC;IACrB,IAAI,KAAK,GAAG,GAAG,CAAC;IAEhB,UAAU,CAAC;QACP,IAAI,GAAG,IAAI,WAAW,CAAC,eAAe,EAAE,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EACrC;QAEI,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAE9C,wBAAwB;QACxB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACtD,CAAC;QACD,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAElC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzD,CAAC;QAED,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACtB,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC5C,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACtC,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAEtD,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,sCAAsC,EACrC;QAEI,wBAAwB;QACxB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACjD,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpD,CAAC;IACL,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,sCAAsC,EACrC;QAEI,IAAI,EAAE,GAAG,UAAS,GAAQ;YACtB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;QACjB,CAAC,CAAC;QACF,IAAI,GAAG,IAAI,WAAW,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;QAC3C,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAE9C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,GAAQ,EAAE,CAAC;YAChB,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACb,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACjD,CAAC;QAED,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,GAAQ,EAAE,CAAC;YAChB,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACb,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpD,CAAC;IACL,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,sBAAsB,EACrB;QACI,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACtB,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC5C,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAClD,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC5C,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACtD,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAElC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,+CAA+C,EAC9C;QAEI,aAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACvC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACtD,CAAC;QACD,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAElC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,aAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACzC,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAChD,aAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC9C,CAAC;QACD,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,+BAA+B,EAC9B;QACI,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,aAAM,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC5C,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC7C,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,aAAM,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC5C,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,mCAAmC,EAClC;QACI,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACpB,aAAM,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC5C,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC7C,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACpB,aAAM,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC3C,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACpB,aAAM,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC5C,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,8BAA8B,EAC7B;QAEI,aAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACtB,aAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACrC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,aAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,4BAA4B,EAC3B;QACI,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpB,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,aAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACpC,aAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,wBAAwB,EACvB;QAEI,aAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC1C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1B,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,aAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC7C,CAAC;QACD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACf,aAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC9C,CAAC;IACL,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,sBAAsB,EACrB;QAEI,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1B,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,aAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,CAAC;IACL,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,2BAA2B,EAC1B;QACI,IAAI,CAAC,GAAQ,EAAE,CAAC;QAChB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YACvB,CAAC,CAAC,IAAI,EAAE,CAAC;YACT,IAAI,CAAC,IAAI,EAAE,CAAC;YACZ,aAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC9B,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACzB,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QACnB,CAAC;IACL,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,6BAA6B,EAC5B;QACI,IAAI,CAAC,GAAQ,EAAE,CAAC;QAChB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAC3B,CAAC,CAAC,IAAI,EAAE,CAAC;YACT,MAAM,CAAC,IAAI,EAAE,CAAC;YACd,aAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAChC,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACzB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,CAAC;IACL,CAAC,CAAC,CAAC;AAEX,CAAC,CAAC,CAAC"}
\ No newline at end of file
diff --git a/dist/test/multiRootTreeTest.d.ts b/dist/test/multiRootTreeTest.d.ts
deleted file mode 100644
index e69de29..0000000
diff --git a/dist/test/multiRootTreeTest.js b/dist/test/multiRootTreeTest.js
deleted file mode 100644
index 15b3b62..0000000
--- a/dist/test/multiRootTreeTest.js
+++ /dev/null
@@ -1,531 +0,0 @@
-"use strict";
-var collections = require('../lib/index');
-var chai_1 = require('chai');
-describe('Multi Root Tree', function () {
-    var tree;
-    beforeEach(function () {
-        tree = new collections.MultiRootTree();
-    });
-    it('Constructs', function () {
-        chai_1.expect(tree.getRootIds()).to.deep.equal([]);
-        chai_1.expect(tree.getNodes()).to.deep.equal({});
-    });
-    it('Can insert one root key', function () {
-        tree.insertIdIntoRoot('1');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({ '1': [] });
-    });
-    it('Can insert 2 root keys', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('2');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1', '2']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({ '1': [], '2': [] });
-    });
-    it('Can insert root key with +1 position', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoRoot('3');
-        tree.insertIdIntoRoot('0', 1);
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1', '0', '2', '3']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({ '0': [], '1': [], '2': [], '3': [] });
-    });
-    it('Can insert root key with -1 position', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoRoot('3');
-        tree.insertIdIntoRoot('0', -1);
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1', '2', '3', '0']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({ '0': [], '1': [], '2': [], '3': [] });
-    });
-    it('Can insert root key with -2 position', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoRoot('3');
-        tree.insertIdIntoRoot('0', -2);
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1', '2', '0', '3']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({ '0': [], '1': [], '2': [], '3': [] });
-    });
-    it('Can insert a node', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoNode('1', '1.1');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({ '1': ['1.1'], '1.1': [] });
-    });
-    it('Can insert two nodes', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoNode('1', '1.1');
-        tree.insertIdIntoNode('1', '1.2');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({ '1': ['1.1', '1.2'], '1.1': [], '1.2': [] });
-    });
-    it('Can insert a root key before a root key', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('3');
-        tree.insertIdBeforeId('3', '2');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1', '2', '3']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({ '1': [], '2': [], '3': [] });
-    });
-    it('Can insert a node before a node key v1', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoNode('1', '1.1');
-        tree.insertIdIntoNode('1', '1.2');
-        tree.insertIdBeforeId('1.2', 'A');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': ['1.1', 'A', '1.2'],
-            '1.1': [], '1.2': [], 'A': []
-        });
-    });
-    it('Can insert a node before a node key v2 ', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoNode('1', '1.1');
-        tree.insertIdIntoNode('1', '1.2');
-        tree.insertIdIntoNode('1.2', '1.2.1');
-        tree.insertIdIntoNode('1.2.1', '1.2.1.1');
-        tree.insertIdIntoNode('1.2.1', '1.2.1.2');
-        tree.insertIdIntoNode('1.2.1', '1.2.1.3');
-        tree.insertIdBeforeId('1.2.1.1', 'A');
-        tree.insertIdBeforeId('1.2.1.3', 'B');
-        tree.insertIdBeforeId('1.2.1.3', 'C');
-        tree.insertIdBeforeId('1', 'D');
-        tree.insertIdBeforeId('C', 'E');
-        tree.insertIdBeforeId('1.2', 'F');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['D', '1']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': ['1.1', 'F', '1.2'],
-            '1.1': [], '1.2': ['1.2.1'],
-            '1.2.1': ['A', '1.2.1.1', '1.2.1.2', 'B', 'E', 'C', '1.2.1.3'],
-            '1.2.1.1': [], '1.2.1.2': [], '1.2.1.3': [],
-            'A': [], 'B': [], 'C': [], 'D': [], 'E': [], 'F': [],
-        });
-    });
-    it('Can insert a root key after a root key', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('3');
-        tree.insertIdAfterId('1', '2');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1', '2', '3']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({ '1': [], '2': [], '3': [] });
-    });
-    it('Can insert a node key after a node key', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoNode('1', '1.1');
-        tree.insertIdIntoNode('1', '1.2');
-        tree.insertIdIntoNode('1.2', '1.2.1');
-        tree.insertIdIntoNode('1.2.1', '1.2.1.1');
-        tree.insertIdIntoNode('1.2.1', '1.2.1.2');
-        tree.insertIdIntoNode('1.2.1', '1.2.1.3');
-        tree.insertIdAfterId('1.2.1.1', 'A');
-        tree.insertIdAfterId('1.2.1.3', 'B');
-        tree.insertIdAfterId('1.2.1.3', 'C');
-        tree.insertIdAfterId('1', 'D');
-        tree.insertIdAfterId('C', 'E');
-        tree.insertIdAfterId('1.2', 'F');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1', 'D']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': ['1.1', '1.2', 'F'],
-            '1.1': [], '1.2': ['1.2.1'],
-            '1.2.1': ['1.2.1.1', 'A', '1.2.1.2', '1.2.1.3', 'C', 'E', 'B'],
-            '1.2.1.1': [], '1.2.1.2': [], '1.2.1.3': [],
-            'A': [], 'B': [], 'C': [], 'D': [], 'E': [], 'F': [],
-        });
-    });
-    it('Can delete a key from root', function () {
-        tree.insertIdIntoRoot('1');
-        tree.deleteId('1');
-        chai_1.expect(tree.getRootIds()).to.deep.equal([]);
-        chai_1.expect(tree.getNodes()).to.deep.equal({});
-    });
-    it('Can delete a nested key', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoNode('1', '1.1');
-        tree.insertIdIntoNode('1', '1.2');
-        tree.insertIdIntoNode('1.2', '1.2.1');
-        tree.insertIdIntoNode('1.2.1', '1.2.1.1');
-        tree.insertIdIntoNode('1.2.1', '1.2.1.2');
-        tree.insertIdIntoNode('1.2.1', '1.2.1.3');
-        tree.deleteId('1.2');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1', '2']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': ['1.1'], '2': [],
-            '1.1': [],
-        });
-    });
-    it('Can delete a nested key v2', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoNode('1', '1.1');
-        tree.insertIdIntoNode('1.1', '1.1.1');
-        tree.insertIdIntoNode('1', '1.2');
-        tree.insertIdIntoNode('1.2', '1.2.1');
-        tree.insertIdIntoNode('1.2.1', '1.2.1.1');
-        tree.insertIdIntoNode('1.2.1', '1.2.1.2');
-        tree.insertIdIntoNode('1.2.1', '1.2.1.3');
-        tree.deleteId('1.2');
-        tree.deleteId('1.1.1');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1', '2']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': ['1.1'], '2': [],
-            '1.1': [],
-        });
-    });
-    it('Can delete a nested key v3', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoNode('1', '1.1');
-        tree.insertIdIntoNode('1.1', '1.1.1');
-        tree.insertIdIntoNode('1', '1.2');
-        tree.insertIdIntoNode('1.2', '1.2.1');
-        tree.insertIdIntoNode('1.2.1', '1.2.1.1');
-        tree.insertIdIntoNode('1.2.1', '1.2.1.2');
-        tree.insertIdIntoNode('1.2.1', '1.2.1.3');
-        tree.deleteId('1');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['2']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '2': [],
-        });
-    });
-    it('Can insert id inside id v1', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoId('1', '1.1');
-        tree.insertIdIntoId('1', '1.2');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': ['1.1', '1.2'],
-            '1.1': [], '1.2': []
-        });
-    });
-    it('Can insert id inside id v2', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoNode('1', '1.1');
-        tree.insertIdIntoNode('1', '1.2');
-        tree.insertIdIntoNode('1.2', '1.2.1');
-        tree.insertIdIntoNode('1.2.1', '1.2.1.1');
-        tree.insertIdIntoNode('1.2.1', '1.2.1.2');
-        tree.insertIdIntoNode('1.2.1', '1.2.1.3');
-        tree.insertIdAfterId('1.2.1.1', 'A');
-        tree.insertIdAfterId('1.2.1.3', 'B');
-        tree.insertIdAfterId('1.2.1.3', 'C');
-        tree.insertIdAfterId('1', 'D');
-        tree.insertIdAfterId('C', 'E');
-        tree.insertIdAfterId('1.2', 'F');
-        tree.insertIdIntoId('C', 'Z');
-        tree.insertIdIntoId('Z', 'X');
-        tree.insertIdIntoId('1.2', 'Y');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1', 'D']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': ['1.1', '1.2', 'F'],
-            '1.1': [], '1.2': ['1.2.1', 'Y'],
-            '1.2.1': ['1.2.1.1', 'A', '1.2.1.2', '1.2.1.3', 'C', 'E', 'B'],
-            '1.2.1.1': [], '1.2.1.2': [], '1.2.1.3': [],
-            'A': [], 'B': [], 'C': ['Z'], 'D': [], 'E': [], 'F': [], 'Z': ['X'], 'X': [], 'Y': []
-        });
-    });
-    it('Can move id before id (root to root)', function () {
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoRoot('3');
-        tree.insertIdIntoRoot('1');
-        tree.moveIdBeforeId('1', '2');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1', '2', '3']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': [], '2': [], '3': []
-        });
-    });
-    it('Can move id before id (root to node)', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoNode('1', 'A');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1', '2']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': ['A'], '2': [],
-            'A': []
-        });
-        tree.moveIdBeforeId('2', 'A');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': ['2', 'A'], '2': [],
-            'A': []
-        });
-    });
-    it('Can move id before id (root to node) v2', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoNode('2', '2.1');
-        tree.insertIdIntoNode('1', 'A');
-        tree.insertIdIntoNode('A', 'B');
-        tree.insertIdIntoNode('A', 'C');
-        tree.moveIdBeforeId('2', 'B');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': ['A'], '2': ['2.1'],
-            '2.1': [],
-            'A': ['2', 'B', 'C'], 'B': [], 'C': []
-        });
-    });
-    it('Can move id before id (node to root)', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoNode('2', '2.1');
-        tree.insertIdIntoNode('1', 'A');
-        tree.insertIdIntoNode('A', 'B');
-        tree.insertIdIntoNode('A', 'C');
-        tree.moveIdBeforeId('A', '2');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1', 'A', '2']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': [], '2': ['2.1'],
-            '2.1': [],
-            'A': ['B', 'C'], 'B': [], 'C': []
-        });
-    });
-    it('Can move id before id (node to root) v2', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoNode('2', '2.1');
-        tree.insertIdIntoNode('1', 'A');
-        tree.insertIdIntoNode('A', 'B');
-        tree.insertIdIntoNode('A', 'C');
-        tree.moveIdBeforeId('2.1', '2');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1', '2.1', '2']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': ['A'], '2': [],
-            '2.1': [],
-            'A': ['B', 'C'], 'B': [], 'C': []
-        });
-    });
-    it('Can move id before id (node to node)', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoNode('2', '2.1');
-        tree.insertIdIntoNode('1', 'A');
-        tree.insertIdIntoNode('A', 'B');
-        tree.insertIdIntoNode('A', 'C');
-        tree.moveIdBeforeId('A', '2.1');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1', '2']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': [], '2': ['A', '2.1'],
-            '2.1': [],
-            'A': ['B', 'C'], 'B': [], 'C': []
-        });
-    });
-    it('Can move id before id (node to node) v2', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoNode('2', '2.1');
-        tree.insertIdIntoNode('1', 'A');
-        tree.insertIdIntoNode('A', 'B');
-        tree.insertIdIntoNode('A', 'C');
-        tree.moveIdBeforeId('C', 'A');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1', '2']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': ['C', 'A'], '2': ['2.1'],
-            '2.1': [],
-            'A': ['B'], 'B': [], 'C': []
-        });
-    });
-    // after
-    it('Can move id after id (root to root)', function () {
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoRoot('3');
-        tree.insertIdIntoRoot('1');
-        tree.moveIdAfterId('2', '1');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['3', '1', '2']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': [], '2': [], '3': []
-        });
-    });
-    it('Can move id after id (root to node)', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoNode('1', 'A');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1', '2']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': ['A'], '2': [],
-            'A': []
-        });
-        tree.moveIdAfterId('2', 'A');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': ['A', '2'], '2': [],
-            'A': []
-        });
-    });
-    it('Can move id after id (root to node) v2', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoNode('2', '2.1');
-        tree.insertIdIntoNode('1', 'A');
-        tree.insertIdIntoNode('A', 'B');
-        tree.insertIdIntoNode('A', 'C');
-        tree.moveIdAfterId('2', 'B');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': ['A'], '2': ['2.1'],
-            '2.1': [],
-            'A': ['B', '2', 'C'], 'B': [], 'C': []
-        });
-    });
-    it('Can move id after id (node to root)', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoNode('2', '2.1');
-        tree.insertIdIntoNode('1', 'A');
-        tree.insertIdIntoNode('A', 'B');
-        tree.insertIdIntoNode('A', 'C');
-        tree.moveIdAfterId('A', '2');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1', '2', 'A']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': [], '2': ['2.1'],
-            '2.1': [],
-            'A': ['B', 'C'], 'B': [], 'C': []
-        });
-    });
-    it('Can move id after id (node to root) v2', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoNode('2', '2.1');
-        tree.insertIdIntoNode('1', 'A');
-        tree.insertIdIntoNode('A', 'B');
-        tree.insertIdIntoNode('A', 'C');
-        tree.moveIdAfterId('2.1', '2');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1', '2', '2.1']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': ['A'], '2': [],
-            '2.1': [],
-            'A': ['B', 'C'], 'B': [], 'C': []
-        });
-    });
-    it('Can move id after id (node to node)', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoNode('2', '2.1');
-        tree.insertIdIntoNode('1', 'A');
-        tree.insertIdIntoNode('A', 'B');
-        tree.insertIdIntoNode('A', 'C');
-        tree.moveIdAfterId('A', '2.1');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1', '2']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': [], '2': ['2.1', 'A'],
-            '2.1': [],
-            'A': ['B', 'C'], 'B': [], 'C': []
-        });
-    });
-    it('Can move id after id (node to node) v2', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoNode('2', '2.1');
-        tree.insertIdIntoNode('1', 'A');
-        tree.insertIdIntoNode('A', 'B');
-        tree.insertIdIntoNode('A', 'C');
-        tree.moveIdAfterId('C', 'A');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1', '2']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': ['A', 'C'], '2': ['2.1'],
-            '2.1': [],
-            'A': ['B'], 'B': [], 'C': []
-        });
-    });
-    // inside
-    it('Can move id inside id (root to root)', function () {
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoRoot('3');
-        tree.insertIdIntoRoot('1');
-        tree.moveIdIntoId('2', '1');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['3', '1']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': ['2'], '2': [], '3': []
-        });
-    });
-    //
-    it('Can move id inside id (root to node)', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoNode('1', 'A');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1', '2']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': ['A'], '2': [],
-            'A': []
-        });
-        tree.moveIdIntoId('2', 'A');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': ['A'], '2': [],
-            'A': ['2']
-        });
-    });
-    it('Can move id inside id (root to node) v2', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoNode('2', '2.1');
-        tree.insertIdIntoNode('1', 'A');
-        tree.insertIdIntoNode('A', 'B');
-        tree.insertIdIntoNode('A', 'C');
-        tree.moveIdIntoId('2', 'B');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': ['A'], '2': ['2.1'],
-            '2.1': [],
-            'A': ['B', 'C'], 'B': ['2'], 'C': []
-        });
-    });
-    it('Can move id inside id (node to root)', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoNode('2', '2.1');
-        tree.insertIdIntoNode('1', 'A');
-        tree.insertIdIntoNode('A', 'B');
-        tree.insertIdIntoNode('A', 'C');
-        tree.moveIdIntoId('A', '2');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1', '2']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': [], '2': ['A', '2.1'],
-            '2.1': [],
-            'A': ['B', 'C'], 'B': [], 'C': []
-        });
-    });
-    it('Can move id inside id (node to root) v2', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoNode('2', '2.1');
-        tree.insertIdIntoNode('1', 'A');
-        tree.insertIdIntoNode('A', 'B');
-        tree.insertIdIntoNode('A', 'C');
-        tree.moveIdIntoId('2.1', '2');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1', '2']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': ['A'], '2': ['2.1'],
-            '2.1': [],
-            'A': ['B', 'C'], 'B': [], 'C': []
-        });
-    });
-    it('Can move id inside id (node to node)', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoNode('2', '2.1');
-        tree.insertIdIntoNode('1', 'A');
-        tree.insertIdIntoNode('A', 'B');
-        tree.insertIdIntoNode('A', 'C');
-        tree.moveIdIntoId('A', '2.1');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1', '2']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': [], '2': ['2.1'],
-            '2.1': ['A'],
-            'A': ['B', 'C'], 'B': [], 'C': []
-        });
-    });
-    it('Can move id inside id (node to node) v2', function () {
-        tree.insertIdIntoRoot('1');
-        tree.insertIdIntoRoot('2');
-        tree.insertIdIntoNode('2', '2.1');
-        tree.insertIdIntoNode('1', 'A');
-        tree.insertIdIntoNode('A', 'B');
-        tree.insertIdIntoNode('A', 'C');
-        tree.moveIdIntoId('C', 'A');
-        chai_1.expect(tree.getRootIds()).to.deep.equal(['1', '2']);
-        chai_1.expect(tree.getNodes()).to.deep.equal({
-            '1': ['A'], '2': ['2.1'],
-            '2.1': [],
-            'A': ['C', 'B'], 'B': [], 'C': []
-        });
-    });
-});
-//# sourceMappingURL=multiRootTreeTest.js.map
\ No newline at end of file
diff --git a/dist/test/multiRootTreeTest.js.map b/dist/test/multiRootTreeTest.js.map
deleted file mode 100644
index 6af6ffb..0000000
--- a/dist/test/multiRootTreeTest.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"multiRootTreeTest.js","sourceRoot":"","sources":["../../src/test/multiRootTreeTest.ts"],"names":[],"mappings":";AAAA,IAAY,WAAW,WAAM,cAAc,CAAC,CAAA;AAG5C,qBAAqB,MAAM,CAAC,CAAA;AAE5B,QAAQ,CAAC,iBAAiB,EAAE;IAExB,IAAI,IAA+B,CAAC;IAEpC,UAAU,CAAC;QACP,IAAI,GAAG,IAAI,WAAW,CAAC,aAAa,EAAE,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,YAAY,EAAE;QACb,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC5C,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yBAAyB,EAAE;QAC1B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wBAAwB,EAAE;QACzB,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACpD,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC;IAChE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE;QACvC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAC9B,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC9D,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC;IAClF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE;QACvC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/B,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC9D,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC;IAClF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE;QACvC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/B,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC9D,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC;IAClF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mBAAmB,EAAE;QACpB,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;IACvE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sBAAsB,EAAE;QACvB,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;IACzF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE;QAC1C,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACzD,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC;IACzE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wCAAwC,EAAE;QACzC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAElC,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC;YACxB,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;SAChC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE;QAC1C,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACtC,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAC1C,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAC1C,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAE1C,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QACtC,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QACtC,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QACtC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAElC,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACpD,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC;YACxB,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,OAAO,CAAC;YAC3B,OAAO,EAAE,CAAC,GAAG,EAAE,SAAS,EAAE,SAAS,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,SAAS,CAAC;YAC9D,SAAS,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE;YAC3C,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;SACvD,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAMH,EAAE,CAAC,wCAAwC,EAAE;QACzC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC/B,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACzD,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC;IACzE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wCAAwC,EAAE;QACzC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACtC,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAC1C,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAC1C,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAE1C,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QACrC,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QACrC,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QACrC,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC/B,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC/B,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAEjC,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACpD,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC;YACxB,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,OAAO,CAAC;YAC3B,OAAO,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE,SAAS,EAAE,SAAS,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;YAC9D,SAAS,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE;YAC3C,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;SACvD,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4BAA4B,EAAE;QAC7B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAE3B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAEnB,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC5C,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yBAAyB,EAAE;QAC1B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACtC,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAC1C,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAC1C,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAE1C,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAErB,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACpD,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,EAAE;YACrB,KAAK,EAAE,EAAE;SACZ,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4BAA4B,EAAE;QAC7B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACtC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACtC,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAC1C,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAC1C,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAE1C,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACrB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAEvB,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACpD,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,EAAE;YACrB,KAAK,EAAE,EAAE;SACZ,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4BAA4B,EAAE;QAC7B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACtC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACtC,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAC1C,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAC1C,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAE1C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAEnB,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,EAAE;SACV,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4BAA4B,EAAE;QAC7B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAE3B,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAChC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAEhC,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC;YACnB,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE;SACvB,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4BAA4B,EAAE;QAC7B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACtC,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAC1C,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAC1C,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAC1C,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QACrC,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QACrC,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QACrC,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC/B,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC/B,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAEjC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAGhC,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACpD,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC;YACxB,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,OAAO,EAAE,GAAG,CAAC;YAChC,OAAO,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE,SAAS,EAAE,SAAS,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;YAC9D,SAAS,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE;YAC3C,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;SACxF,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE;QACvC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAE3B,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE9B,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACzD,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;SAC5B,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE;QACvC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEhC,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACpD,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE;YACnB,GAAG,EAAE,EAAE;SACV,CAAC,CAAC;QAEH,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE9B,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE;YACxB,GAAG,EAAE,EAAE;SACV,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE;QAC1C,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEhC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE9B,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC;YACxB,KAAK,EAAE,EAAE;YACT,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;SACzC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE;QACvC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAE3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEhC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE9B,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACzD,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC;YACrB,KAAK,EAAE,EAAE;YACT,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;SACpC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE;QAC1C,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAE3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEhC,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAEhC,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3D,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE;YACnB,KAAK,EAAE,EAAE;YACT,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;SACpC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE;QACvC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAE3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEhC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAEhC,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACpD,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,CAAC;YAC1B,KAAK,EAAE,EAAE;YACT,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;SACpC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE;QAC1C,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAE3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEhC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE9B,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACpD,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC;YAC7B,KAAK,EAAE,EAAE;YACT,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;SAC/B,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ;IAER,EAAE,CAAC,qCAAqC,EAAE;QACtC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAE3B,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE7B,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACzD,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;SAC5B,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qCAAqC,EAAE;QACtC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEhC,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACpD,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE;YACnB,GAAG,EAAE,EAAE;SACV,CAAC,CAAC;QAEH,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE7B,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE;YACxB,GAAG,EAAE,EAAE;SACV,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wCAAwC,EAAE;QACzC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEhC,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE7B,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC;YACxB,KAAK,EAAE,EAAE;YACT,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;SACzC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qCAAqC,EAAE;QACtC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAE3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEhC,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE7B,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACzD,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC;YACrB,KAAK,EAAE,EAAE;YACT,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;SACpC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wCAAwC,EAAE;QACzC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAE3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEhC,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAE/B,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;QAC3D,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE;YACnB,KAAK,EAAE,EAAE;YACT,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;SACpC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qCAAqC,EAAE;QACtC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAE3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEhC,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAE/B,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACpD,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,GAAG,CAAC;YAC1B,KAAK,EAAE,EAAE;YACT,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;SACpC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wCAAwC,EAAE;QACzC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAE3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEhC,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE7B,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACpD,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC;YAC7B,KAAK,EAAE,EAAE;YACT,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;SAC/B,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,SAAS;IAGT,EAAE,CAAC,sCAAsC,EAAE;QACvC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAE3B,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE5B,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACpD,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;SAC/B,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE;IACF,EAAE,CAAC,sCAAsC,EAAE;QACvC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEhC,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACpD,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE;YACnB,GAAG,EAAE,EAAE;SACV,CAAC,CAAC;QAEH,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE5B,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE;YACnB,GAAG,EAAE,CAAC,GAAG,CAAC;SACb,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE;QAC1C,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEhC,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE5B,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC;YACxB,KAAK,EAAE,EAAE;YACT,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE;SACvC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE;QACvC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAE3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEhC,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE5B,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACpD,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,CAAC;YAC1B,KAAK,EAAE,EAAE;YACT,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;SACpC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE;QAC1C,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAE3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEhC,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAE9B,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACpD,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC;YACxB,KAAK,EAAE,EAAE;YACT,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;SACpC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE;QACvC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAE3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEhC,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAE9B,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACpD,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC;YACrB,KAAK,EAAE,CAAC,GAAG,CAAC;YACZ,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;SACpC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE;QAC1C,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAE3B,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEhC,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE5B,aAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACpD,aAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC;YACxB,KAAK,EAAE,EAAE;YACT,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;SACpC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;AAEP,CAAC,CAAC,CAAC"}
\ No newline at end of file
diff --git a/dist/test/priorityQueueTest.d.ts b/dist/test/priorityQueueTest.d.ts
deleted file mode 100644
index e69de29..0000000
diff --git a/dist/test/priorityQueueTest.js b/dist/test/priorityQueueTest.js
deleted file mode 100644
index c08f392..0000000
--- a/dist/test/priorityQueueTest.js
+++ /dev/null
@@ -1,132 +0,0 @@
-"use strict";
-var collections = require('../lib/index');
-var chai_1 = require('chai');
-describe('Priority Queue', function () {
-    var queue = null;
-    beforeEach(function () {
-        queue = new collections.PriorityQueue();
-    });
-    var createPriorityQueue1 = function () {
-        queue.enqueue(0);
-        queue.enqueue(1);
-        queue.enqueue(2);
-        queue.enqueue(3);
-        return queue;
-    };
-    var createPriorityQueue2 = function () {
-        queue.enqueue(1);
-        queue.enqueue(3);
-        queue.enqueue(0);
-        queue.enqueue(2);
-        return queue;
-    };
-    it('Gives the right size', function () {
-        createPriorityQueue1();
-        chai_1.expect(queue.size()).equals(4);
-        queue.dequeue();
-        chai_1.expect(queue.size()).equals(3);
-    });
-    it('Gives the right size 2', function () {
-        createPriorityQueue2();
-        chai_1.expect(queue.size()).equals(4);
-        queue.dequeue();
-        chai_1.expect(queue.size()).equals(3);
-    });
-    it('Gives the right size 3', function () {
-        createPriorityQueue1();
-        queue.dequeue();
-        queue.dequeue();
-        queue.dequeue();
-        queue.dequeue();
-        chai_1.expect(queue.size()).equals(0);
-    });
-    it('Contains inserted elements', function () {
-        createPriorityQueue1();
-        for (var i = 0; i < 4; i++) {
-            chai_1.expect(queue.contains(i)).equals(true);
-        }
-        chai_1.expect(queue.contains(5)).equals(false);
-    });
-    it('An empty queue is empty', function () {
-        createPriorityQueue1();
-        chai_1.expect(queue.isEmpty()).equals(false);
-        queue.dequeue();
-        queue.dequeue();
-        queue.dequeue();
-        chai_1.expect(queue.isEmpty()).equals(false);
-        queue.dequeue();
-        chai_1.expect(queue.isEmpty()).equals(true);
-    });
-    it('Peeks the highest priority item', function () {
-        createPriorityQueue1();
-        chai_1.expect(queue.peek()).equals(3);
-    });
-    it('Peeks the highest priority item 2', function () {
-        createPriorityQueue2();
-        chai_1.expect(queue.peek()).equals(3);
-    });
-    it('Peeking an empty queue returns undefined', function () {
-        createPriorityQueue1();
-        queue.clear();
-        chai_1.expect(queue.peek()).equals(undefined);
-    });
-    it('Dequeues the highest priority item', function () {
-        createPriorityQueue1();
-        chai_1.expect(queue.dequeue()).equals(3);
-        chai_1.expect(queue.dequeue()).equals(2);
-        chai_1.expect(queue.dequeue()).equals(1);
-        chai_1.expect(queue.dequeue()).equals(0);
-    });
-    it('Dequeues the highest priority item 2', function () {
-        createPriorityQueue2();
-        chai_1.expect(queue.dequeue()).equals(3);
-        chai_1.expect(queue.dequeue()).equals(2);
-        chai_1.expect(queue.dequeue()).equals(1);
-        chai_1.expect(queue.dequeue()).equals(0);
-    });
-    it('Peek and enqueue are consistent', function () {
-        queue.enqueue(0);
-        chai_1.expect(queue.peek()).equals(0);
-        queue.enqueue(1);
-        chai_1.expect(queue.peek()).equals(1);
-        queue.enqueue(2);
-        chai_1.expect(queue.peek()).equals(2);
-        queue.enqueue(3);
-        chai_1.expect(queue.peek()).equals(3);
-    });
-    it('Peek and enqueue are consistent 2', function () {
-        queue.enqueue(1);
-        chai_1.expect(queue.peek()).equals(1);
-        queue.enqueue(3);
-        chai_1.expect(queue.peek()).equals(3);
-        queue.enqueue(0);
-        chai_1.expect(queue.peek()).equals(3);
-        queue.enqueue(2);
-        chai_1.expect(queue.peek()).equals(3);
-    });
-    it('For each gives the right elements', function () {
-        queue.forEach(function (e) {
-            chai_1.expect(true).equals(false); // should not enter here
-        });
-        createPriorityQueue1();
-        var elements = [];
-        queue.forEach(function (e) {
-            elements.push(e);
-        });
-        chai_1.expect(collections.arrays.contains(elements, 0)).equals(true);
-        chai_1.expect(collections.arrays.contains(elements, 1)).equals(true);
-        chai_1.expect(collections.arrays.contains(elements, 2)).equals(true);
-        chai_1.expect(collections.arrays.contains(elements, 3)).equals(true);
-        chai_1.expect(collections.arrays.contains(elements, 4)).equals(false);
-    });
-    it('For each can be interrupted', function () {
-        createPriorityQueue1();
-        var elements = [];
-        queue.forEach(function (e) {
-            elements.push(e);
-            return false;
-        });
-        chai_1.expect(elements.length).equals(1);
-    });
-});
-//# sourceMappingURL=priorityQueueTest.js.map
\ No newline at end of file
diff --git a/dist/test/priorityQueueTest.js.map b/dist/test/priorityQueueTest.js.map
deleted file mode 100644
index fa00fa1..0000000
--- a/dist/test/priorityQueueTest.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"priorityQueueTest.js","sourceRoot":"","sources":["../../src/test/priorityQueueTest.ts"],"names":[],"mappings":";AAAA,IAAY,WAAW,WAAM,cAAc,CAAC,CAAA;AAG5C,qBAAqB,MAAM,CAAC,CAAA;AAE5B,QAAQ,CAAC,gBAAgB,EACrB;IAEI,IAAI,KAAK,GAAQ,IAAI,CAAC;IAEtB,UAAU,CAAC;QACP,KAAK,GAAG,IAAI,WAAW,CAAC,aAAa,EAAE,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,IAAI,oBAAoB,GAAG;QACvB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACjB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACjB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACjB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC,CAAC;IAEF,IAAI,oBAAoB,GAAG;QACvB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACjB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACjB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACjB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC,CAAC;IAEF,EAAE,CAAC,sBAAsB,EACrB;QACI,oBAAoB,EAAE,CAAC;QACvB,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,KAAK,CAAC,OAAO,EAAE,CAAC;QAChB,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,wBAAwB,EACvB;QACI,oBAAoB,EAAE,CAAC;QACvB,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,KAAK,CAAC,OAAO,EAAE,CAAC;QAChB,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,wBAAwB,EACvB;QACI,oBAAoB,EAAE,CAAC;QACvB,KAAK,CAAC,OAAO,EAAE,CAAC;QAChB,KAAK,CAAC,OAAO,EAAE,CAAC;QAChB,KAAK,CAAC,OAAO,EAAE,CAAC;QAChB,KAAK,CAAC,OAAO,EAAE,CAAC;QAChB,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,4BAA4B,EAC3B;QACI,oBAAoB,EAAE,CAAC;QACvB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,aAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC3C,CAAC;QACD,aAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,yBAAyB,EACxB;QACI,oBAAoB,EAAE,CAAC;QACvB,aAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACtC,KAAK,CAAC,OAAO,EAAE,CAAC;QAChB,KAAK,CAAC,OAAO,EAAE,CAAC;QAChB,KAAK,CAAC,OAAO,EAAE,CAAC;QAChB,aAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACtC,KAAK,CAAC,OAAO,EAAE,CAAC;QAChB,aAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,iCAAiC,EAChC;QACI,oBAAoB,EAAE,CAAC;QACvB,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,mCAAmC,EAClC;QACI,oBAAoB,EAAE,CAAC;QACvB,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,0CAA0C,EACzC;QACI,oBAAoB,EAAE,CAAC;QACvB,KAAK,CAAC,KAAK,EAAE,CAAC;QACd,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,oCAAoC,EACnC;QACI,oBAAoB,EAAE,CAAC;QACvB,aAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAClC,aAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAClC,aAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAClC,aAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,sCAAsC,EACrC;QACI,oBAAoB,EAAE,CAAC;QACvB,aAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAClC,aAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAClC,aAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAClC,aAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,iCAAiC,EAChC;QACI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACjB,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACjB,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACjB,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACjB,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,mCAAmC,EAClC;QACI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACjB,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACjB,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACjB,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACjB,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,mCAAmC,EAClC;QAEI,KAAK,CAAC,OAAO,CAAC,UAAS,CAAM;YACzB,aAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,wBAAwB;QACxD,CAAC,CAAC,CAAC;QACH,oBAAoB,EAAE,CAAC;QAEvB,IAAI,QAAQ,GAAQ,EAAE,CAAC;QACvB,KAAK,CAAC,OAAO,CAAC,UAAS,CAAM;YACzB,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC,CAAC,CAAC;QAEH,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC9D,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC9D,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC9D,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC9D,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACnE,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,6BAA6B,EAC5B;QACI,oBAAoB,EAAE,CAAC;QACvB,IAAI,QAAQ,GAAQ,EAAE,CAAC;QACvB,KAAK,CAAC,OAAO,CAAC,UAAS,CAAM;YACzB,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjB,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC,CAAC,CAAC;QACH,aAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;AACX,CAAC,CAAC,CAAC"}
\ No newline at end of file
diff --git a/dist/test/queueTest.d.ts b/dist/test/queueTest.d.ts
deleted file mode 100644
index e69de29..0000000
diff --git a/dist/test/queueTest.js b/dist/test/queueTest.js
deleted file mode 100644
index 7f03e87..0000000
--- a/dist/test/queueTest.js
+++ /dev/null
@@ -1,82 +0,0 @@
-"use strict";
-var collections = require('../lib/index');
-var chai_1 = require('chai');
-describe('Queue', function () {
-    var queue = null;
-    beforeEach(function () {
-        queue = new collections.Queue();
-    });
-    function createQueue() {
-        queue.enqueue('a');
-        queue.enqueue('b');
-        queue.enqueue('c');
-    }
-    it('Gives the right size', function () {
-        chai_1.expect(queue.size()).equals(0);
-        createQueue();
-        chai_1.expect(queue.size()).equals(3);
-        queue.enqueue('d');
-        chai_1.expect(queue.size()).equals(4);
-        queue.dequeue();
-        chai_1.expect(queue.size()).equals(3);
-        queue.clear();
-        chai_1.expect(queue.size()).equals(0);
-    });
-    it('Enqueues', function () {
-        createQueue();
-        var head = queue.dequeue();
-        chai_1.expect(head).equals('a');
-        queue.dequeue();
-        head = queue.dequeue();
-        chai_1.expect(head).equals('c');
-        chai_1.expect(queue.isEmpty()).equals(true);
-        head = queue.dequeue();
-        chai_1.expect(head).equals(undefined);
-    });
-    it('Peeks', function () {
-        createQueue();
-        var head = queue.peek();
-        chai_1.expect(head).equals('a');
-        var head2 = queue.dequeue();
-        chai_1.expect(head).equals(head2);
-        head = queue.peek();
-        chai_1.expect(head).equals('b');
-        queue.clear();
-        head = queue.peek();
-        chai_1.expect(head).equals(undefined);
-    });
-    it('For each gives the right ordering', function () {
-        queue.forEach(function (e) {
-            chai_1.expect(true).equals(false); // should not enter here
-        });
-        for (var i = 0; i < 10; i++) {
-            queue.add(i);
-        }
-        var i = 0;
-        queue.forEach(function (e) {
-            chai_1.expect(e).equals(i);
-            i++;
-        });
-    });
-    it('For each can be interrupted', function () {
-        var array = [0, 1, 2, 3, 4];
-        var b = [];
-        for (var i = 0; i < 5; i++) {
-            queue.add(i);
-        }
-        queue.forEach(function (e) {
-            b.push(e);
-            if (e === 3) {
-                return false;
-            }
-        });
-        chai_1.expect([0, 1, 2, 3]).to.deep.equal(b);
-    });
-    it('Contains previously added items', function () {
-        createQueue();
-        chai_1.expect(queue.contains('a')).equals(true);
-        chai_1.expect(queue.contains('z')).equals(false);
-        chai_1.expect(queue.contains(undefined)).equals(false);
-    });
-});
-//# sourceMappingURL=queueTest.js.map
\ No newline at end of file
diff --git a/dist/test/queueTest.js.map b/dist/test/queueTest.js.map
deleted file mode 100644
index 7e180e2..0000000
--- a/dist/test/queueTest.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"queueTest.js","sourceRoot":"","sources":["../../src/test/queueTest.ts"],"names":[],"mappings":";AAAA,IAAY,WAAW,WAAM,cAAc,CAAC,CAAA;AAG5C,qBAAqB,MAAM,CAAC,CAAA;AAE5B,QAAQ,CAAC,OAAO,EACZ;IAEI,IAAI,KAAK,GAAQ,IAAI,CAAC;IAEtB,UAAU,CAAC;QACP,KAAK,GAAG,IAAI,WAAW,CAAC,KAAK,EAAE,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH;QACI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACnB,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACnB,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACvB,CAAC;IAED,EAAE,CAAC,sBAAsB,EACrB;QACI,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,WAAW,EAAE,CAAC;QACd,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACnB,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,KAAK,CAAC,OAAO,EAAE,CAAC;QAChB,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,KAAK,CAAC,KAAK,EAAE,CAAC;QACd,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAEnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,UAAU,EACT;QACI,WAAW,EAAE,CAAC;QACd,IAAI,IAAI,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;QAC3B,aAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACzB,KAAK,CAAC,OAAO,EAAE,CAAC;QAChB,IAAI,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;QACvB,aAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACzB,aAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;QACvB,aAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,OAAO,EACN;QACI,WAAW,EAAE,CAAC;QACd,IAAI,IAAI,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;QACxB,aAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACzB,IAAI,KAAK,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;QAC5B,aAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC3B,IAAI,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;QACpB,aAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACzB,KAAK,CAAC,KAAK,EAAE,CAAC;QACd,IAAI,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;QACpB,aAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,mCAAmC,EAClC;QAEI,KAAK,CAAC,OAAO,CAAC,UAAS,CAAM;YACzB,aAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,wBAAwB;QACxD,CAAC,CAAC,CAAC;QAEH,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1B,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjB,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,CAAC,OAAO,CAAC,UAAS,CAAM;YACzB,aAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC,EAAE,CAAC;QACR,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,6BAA6B,EAC5B;QACI,IAAI,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,GAAQ,EAAE,CAAC;QAChB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjB,CAAC;QACD,KAAK,CAAC,OAAO,CAAC,UAAS,CAAM;YACzB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACV,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACV,MAAM,CAAC,KAAK,CAAC;YACjB,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,aAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IACP,EAAE,CAAC,iCAAiC,EAChC;QACI,WAAW,EAAE,CAAC;QACd,aAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACzC,aAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC1C,aAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;AAEX,CAAC,CAAC,CAAC"}
\ No newline at end of file
diff --git a/dist/test/setTest.d.ts b/dist/test/setTest.d.ts
deleted file mode 100644
index e69de29..0000000
diff --git a/dist/test/setTest.js b/dist/test/setTest.js
deleted file mode 100644
index dacd008..0000000
--- a/dist/test/setTest.js
+++ /dev/null
@@ -1,265 +0,0 @@
-"use strict";
-var collections = require('../lib/index');
-var chai_1 = require('chai');
-describe('Set', function () {
-    var set = null;
-    it('Gives the right size', function () {
-        set = new collections.Set();
-        set.add('a');
-        set.add('b');
-        set.add('c');
-        chai_1.expect(set.size()).equals(3);
-        set.add('d');
-        chai_1.expect(set.size()).equals(4);
-        set.remove('d');
-        chai_1.expect(set.size()).equals(3);
-        set.clear();
-        set.add('a');
-        set.add('b');
-        set.add('c');
-        chai_1.expect(set.size()).equals(3);
-        set.add('d');
-        chai_1.expect(set.size()).equals(4);
-        set.remove('d');
-        chai_1.expect(set.size()).equals(3);
-        set.add('c');
-        chai_1.expect(set.size()).equals(3);
-    });
-    it('Contains existing elements', function () {
-        set = new collections.Set();
-        set.add('a');
-        set.add('b');
-        set.add('c');
-        set.add('d');
-        chai_1.expect(set.contains('a')).equals(true);
-        chai_1.expect(set.contains('b')).equals(true);
-        chai_1.expect(set.contains('c')).equals(true);
-        chai_1.expect(set.contains('d')).equals(true);
-        chai_1.expect(set.contains('e')).equals(false);
-        set.clear();
-        set.add(1);
-        set.add(2);
-        set.add(3);
-        set.add(4);
-        chai_1.expect(set.contains(1)).equals(true);
-        chai_1.expect(set.contains(2)).equals(true);
-        chai_1.expect(set.contains(3)).equals(true);
-        chai_1.expect(set.contains(4)).equals(true);
-        chai_1.expect(set.contains(5)).equals(false);
-        var toStringF = function (f) {
-            return f.description;
-        };
-        set = new collections.Set(toStringF);
-        var fn1 = function () { };
-        fn1.description = 'fn1';
-        chai_1.expect(set.contains(fn1)).equals(false);
-        set.add(fn1);
-        chai_1.expect(set.contains(fn1)).equals(true);
-        var fn2 = function () { };
-        fn2.description = 'fn2';
-        chai_1.expect(set.contains(fn2)).equals(false);
-        set.add(fn2);
-        chai_1.expect(set.contains(fn2)).equals(true);
-        chai_1.expect(set.size()).equals(2);
-    });
-    it('An empty set is empty', function () {
-        set = new collections.Set();
-        chai_1.expect(set.isEmpty()).equals(true);
-        set.add(1);
-        chai_1.expect(set.isEmpty()).equals(false);
-    });
-    it('Intersection is commutative', function () {
-        //Two empty sets
-        set = new collections.Set();
-        var set2 = new collections.Set();
-        set.intersection(set2);
-        chai_1.expect(set.isEmpty()).equals(true);
-        set2.intersection(set);
-        chai_1.expect(set2.isEmpty()).equals(true);
-        // non empty with empty
-        set = new collections.Set();
-        set2 = new collections.Set();
-        set.add(1);
-        set.add(2);
-        set.add(3);
-        set.intersection(set2);
-        chai_1.expect(set.isEmpty()).equals(true);
-        set2.intersection(set);
-        chai_1.expect(set2.isEmpty()).equals(true);
-        // non empty sets with common elements
-        set = new collections.Set();
-        set2 = new collections.Set();
-        set.add(1);
-        set.add(2);
-        set2.add(1);
-        set2.add(2);
-        set2.add(3);
-        set.intersection(set2);
-        var s1 = set.toArray().sort();
-        chai_1.expect(s1).to.deep.equal([1, 2]);
-        set = new collections.Set();
-        set.add(1);
-        set.add(2);
-        set2.intersection(set);
-        var s2 = set2.toArray().sort();
-        chai_1.expect(s2).to.deep.equal([1, 2]);
-        // non empty sets with  no common elements
-        set = new collections.Set();
-        set2 = new collections.Set();
-        set.add(1);
-        set.add(2);
-        set2.add(3);
-        set2.add(4);
-        set2.add(5);
-        set.intersection(set2);
-        chai_1.expect(set.isEmpty()).equals(true);
-        set.add(1);
-        set.add(2);
-        set2.intersection(set);
-        chai_1.expect(set2.isEmpty()).equals(true);
-    });
-    it('Union is commutative', function () {
-        set = new collections.Set();
-        var set2 = new collections.Set();
-        set.add(1);
-        set.add(2);
-        set2.add(2);
-        set2.add(4);
-        set2.add(5);
-        set.union(set2);
-        var s1 = set.toArray().sort();
-        chai_1.expect(s1).to.deep.equal([1, 2, 4, 5]);
-        set.clear();
-        set.add(1);
-        set.add(2);
-        set2.union(set);
-        var s2 = set2.toArray().sort();
-        chai_1.expect(s2).to.deep.equal([1, 2, 4, 5]);
-    });
-    it('Difference works as expected', function () {
-        //Two empty sets
-        set = new collections.Set();
-        var set2 = new collections.Set();
-        set.difference(set2);
-        chai_1.expect(set.isEmpty()).equals(true);
-        //Non empty and empty set
-        set = new collections.Set();
-        set2 = new collections.Set();
-        set.add(1);
-        set.add(2);
-        set.difference(set2);
-        var s1 = set.toArray().sort();
-        chai_1.expect(s1).to.deep.equal([1, 2]);
-        //Non empty sets with common elements
-        set = new collections.Set();
-        set2 = new collections.Set();
-        set.add(1);
-        set.add(2);
-        set.add(3);
-        set.add(4);
-        set2.add(2);
-        set2.add(3);
-        set.difference(set2);
-        s1 = set.toArray().sort();
-        chai_1.expect(s1).to.deep.equal([1, 4]);
-        // Two equal sets
-        set = new collections.Set();
-        set2 = new collections.Set();
-        set.add(1);
-        set.add(2);
-        set.add(3);
-        set2.add(1);
-        set2.add(3);
-        set2.add(2);
-        set.difference(set2);
-        chai_1.expect(set.isEmpty()).equals(true);
-        //Non empty sets with no common elements
-        set = new collections.Set();
-        set2 = new collections.Set();
-        set.add(1);
-        set.add(2);
-        set.add(3);
-        set.add(4);
-        set2.add(6);
-        set2.add(9);
-        set.difference(set2);
-        s1 = set.toArray().sort();
-        chai_1.expect(s1).to.deep.equal([1, 2, 3, 4]);
-    });
-    it('isSubsetOf works as expected', function () {
-        //Two empty sets
-        set = new collections.Set();
-        var set2 = new collections.Set();
-        chai_1.expect(set.isSubsetOf(set2)).equals(true);
-        // Two equal sets
-        set = new collections.Set();
-        set2 = new collections.Set();
-        set.add(1);
-        set.add(2);
-        set2.add(2);
-        set2.add(1);
-        chai_1.expect(set.isSubsetOf(set2)).equals(true);
-        chai_1.expect(set2.isSubsetOf(set)).equals(true);
-        //Non empty sets with common elements
-        set = new collections.Set();
-        set2 = new collections.Set();
-        set.add(1);
-        set.add(2);
-        set.add(3);
-        set.add(4);
-        set2.add(2);
-        set2.add(3);
-        chai_1.expect(set2.isSubsetOf(set)).equals(true);
-        chai_1.expect(set.isSubsetOf(set2)).equals(false);
-        //Non empty sets with no common elements
-        set = new collections.Set();
-        set2 = new collections.Set();
-        set.add(3);
-        set2.add(4);
-        chai_1.expect(set.isSubsetOf(set2)).equals(false);
-        chai_1.expect(set2.isSubsetOf(set)).equals(false);
-    });
-    it('Adds', function () {
-        set = new collections.Set();
-        chai_1.expect(set.add('a')).equals(true);
-        chai_1.expect(set.add('b')).equals(true);
-        chai_1.expect(set.contains('a')).equals(true);
-        chai_1.expect(set.contains('b')).equals(true);
-        chai_1.expect(set.add('b')).equals(false);
-        chai_1.expect(set.contains('b')).equals(true);
-        chai_1.expect(set.add(null)).equals(true);
-        chai_1.expect(set.contains(null)).equals(true);
-        chai_1.expect(set.add(null)).equals(false);
-        chai_1.expect(set.contains(undefined)).equals(false);
-        chai_1.expect(set.add(undefined)).equals(false);
-        chai_1.expect(set.contains(undefined)).equals(false);
-    });
-    it('For each gives all the elements', function () {
-        set = new collections.Set();
-        set.forEach(function (e) {
-            chai_1.expect(false).equals(true);
-        });
-        for (var i = 0; i < 100; i++) {
-            set.add(i);
-        }
-        var values = set.toArray();
-        chai_1.expect(values.length).equals(100);
-        set.forEach(function (e) {
-            chai_1.expect(collections.arrays.remove(values, e)).equals(true);
-        });
-        chai_1.expect(values.length).equals(0);
-    });
-    it('For each can be interrupted', function () {
-        set = new collections.Set();
-        for (var i = 0; i < 5; i++) {
-            set.add(i);
-        }
-        var t = 0;
-        set.forEach(function (e) {
-            t++;
-            return false;
-        });
-        chai_1.expect(t).equals(1);
-    });
-});
-//# sourceMappingURL=setTest.js.map
\ No newline at end of file
diff --git a/dist/test/setTest.js.map b/dist/test/setTest.js.map
deleted file mode 100644
index cadf3de..0000000
--- a/dist/test/setTest.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"setTest.js","sourceRoot":"","sources":["../../src/test/setTest.ts"],"names":[],"mappings":";AAAA,IAAY,WAAW,WAAM,cAAc,CAAC,CAAA;AAG5C,qBAAqB,MAAM,CAAC,CAAA;AAE5B,QAAQ,CAAC,KAAK,EACV;IAEI,IAAI,GAAG,GAAQ,IAAI,CAAC;IAEpB,EAAE,CAAC,sBAAsB,EACrB;QACI,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC5B,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,aAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7B,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,aAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7B,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAChB,aAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7B,GAAG,CAAC,KAAK,EAAE,CAAC;QAEZ,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,aAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7B,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,aAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7B,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAChB,aAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7B,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,aAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,4BAA4B,EAC3B;QACI,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC5B,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAEb,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAExC,GAAG,CAAC,KAAK,EAAE,CAAC;QACZ,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAEtC,IAAI,SAAS,GAAG,UAAS,CAAM;YAC3B,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC;QACzB,CAAC,CAAC;QAEF,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACrC,IAAI,GAAG,GAAQ,cAAa,CAAC,CAAC;QAC9B,GAAG,CAAC,WAAW,GAAG,KAAK,CAAC;QACxB,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACxC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,IAAI,GAAG,GAAQ,cAAa,CAAC,CAAC;QAC9B,GAAG,CAAC,WAAW,GAAG,KAAK,CAAC;QACxB,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACxC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACb,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,uBAAuB,EACtB;QACI,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC5B,aAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACnC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,aAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,6BAA6B,EAC5B;QACI,gBAAgB;QAChB,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC5B,IAAI,IAAI,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QACjC,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QACvB,aAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;QACvB,aAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAEpC,uBAAuB;QACvB,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC5B,IAAI,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC7B,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QACvB,aAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;QACvB,aAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAEpC,sCAAsC;QACtC,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC5B,IAAI,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC7B,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAEZ,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QACvB,IAAI,EAAE,GAAG,GAAG,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC;QAC9B,aAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACjC,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC5B,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAEX,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;QACvB,IAAI,EAAE,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC;QAC/B,aAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAEjC,0CAA0C;QAC1C,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC5B,IAAI,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC7B,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAEZ,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QACvB,aAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACnC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;QACvB,aAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,sBAAsB,EACrB;QACI,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC5B,IAAI,IAAI,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QACjC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAChB,IAAI,EAAE,GAAG,GAAG,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC;QAC9B,aAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACvC,GAAG,CAAC,KAAK,EAAE,CAAC;QACZ,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAChB,IAAI,EAAE,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC;QAC/B,aAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,8BAA8B,EAC7B;QAEI,gBAAgB;QAChB,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC5B,IAAI,IAAI,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QACjC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACrB,aAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAEnC,yBAAyB;QACzB,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC5B,IAAI,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC7B,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACrB,IAAI,EAAE,GAAG,GAAG,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC;QAC9B,aAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAEjC,qCAAqC;QACrC,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC5B,IAAI,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC7B,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACrB,EAAE,GAAG,GAAG,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC;QAC1B,aAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAEjC,iBAAiB;QACjB,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC5B,IAAI,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC7B,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACrB,aAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAEnC,wCAAwC;QACxC,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC5B,IAAI,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC7B,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACrB,EAAE,GAAG,GAAG,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC;QAC1B,aAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,8BAA8B,EAC7B;QAEI,gBAAgB;QAChB,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC5B,IAAI,IAAI,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QACjC,aAAM,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAE1C,iBAAiB;QACjB,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC5B,IAAI,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC7B,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,aAAM,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC1C,aAAM,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAE1C,qCAAqC;QACrC,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC5B,IAAI,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC7B,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,aAAM,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC1C,aAAM,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAE3C,wCAAwC;QACxC,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC5B,IAAI,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC7B,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,aAAM,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC3C,aAAM,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,MAAM,EACL;QACI,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC5B,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClC,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACnC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvC,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACnC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACxC,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACpC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC9C,aAAM,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACzC,aAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,iCAAiC,EAChC;QACI,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC5B,GAAG,CAAC,OAAO,CAAC,UAAS,CAAM;YACvB,aAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;QACH,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACf,CAAC;QACD,IAAI,MAAM,GAAG,GAAG,CAAC,OAAO,EAAE,CAAC;QAC3B,aAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAClC,GAAG,CAAC,OAAO,CAAC,UAAS,CAAM;YACvB,aAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC9D,CAAC,CAAC,CAAC;QACH,aAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,6BAA6B,EAC5B;QACI,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,EAAE,CAAC;QAC5B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACf,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,GAAG,CAAC,OAAO,CAAC,UAAS,CAAM;YACvB,CAAC,EAAE,CAAC;YACJ,MAAM,CAAC,KAAK,CAAC;QACjB,CAAC,CAAC,CAAC;QACH,aAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC,CAAC,CAAC;AACX,CAAC,CAAC,CAAC"}
\ No newline at end of file
diff --git a/dist/test/stackTest.d.ts b/dist/test/stackTest.d.ts
deleted file mode 100644
index e69de29..0000000
diff --git a/dist/test/stackTest.js b/dist/test/stackTest.js
deleted file mode 100644
index 9781559..0000000
--- a/dist/test/stackTest.js
+++ /dev/null
@@ -1,90 +0,0 @@
-"use strict";
-var collections = require('../lib/index');
-var chai_1 = require('chai');
-describe('Stack', function () {
-    var stack = null;
-    beforeEach(function () {
-        stack = new collections.Stack();
-    });
-    it('Pops', function () {
-        chai_1.expect(stack.pop()).equals(undefined);
-        stack.push(1);
-        stack.push(2);
-        stack.push(3);
-        chai_1.expect(stack.pop()).equals(3);
-        chai_1.expect(stack.pop()).equals(2);
-        chai_1.expect(stack.pop()).equals(1);
-        chai_1.expect(stack.pop()).equals(undefined);
-    });
-    it('Pushes and pops', function () {
-        stack.push(1);
-        chai_1.expect(stack.pop()).equals(1);
-        stack.push(2);
-        chai_1.expect(stack.pop()).equals(2);
-        stack.push(3);
-        chai_1.expect(stack.pop()).equals(3);
-        chai_1.expect(stack.pop()).equals(undefined);
-    });
-    it('Peeks', function () {
-        stack.push(1);
-        stack.push(2);
-        stack.push(3);
-        chai_1.expect(stack.peek()).equals(3);
-        stack.pop();
-        chai_1.expect(stack.peek()).equals(2);
-        stack.pop();
-        chai_1.expect(stack.peek()).equals(1);
-        stack.pop();
-        chai_1.expect(stack.peek()).equals(undefined);
-    });
-    it('Pushes and peeks', function () {
-        chai_1.expect(stack.peek()).equals(undefined);
-        stack.push(1);
-        chai_1.expect(stack.peek()).equals(1);
-        stack.push(2);
-        chai_1.expect(stack.peek()).equals(2);
-        stack.push(3);
-        chai_1.expect(stack.peek()).equals(3);
-    });
-    it('Gives the right size', function () {
-        chai_1.expect(stack.size()).equals(0);
-        stack.push(1);
-        stack.push(2);
-        stack.push(3);
-        chai_1.expect(stack.size()).equals(3);
-        stack.peek();
-        chai_1.expect(stack.size()).equals(3);
-        stack.pop();
-        stack.pop();
-        stack.pop();
-        chai_1.expect(stack.size()).equals(0);
-    });
-    it('For each gives the right ordering', function () {
-        stack.forEach(function (e) {
-            chai_1.expect(true).equals(false); // should not enter here
-        });
-        for (var i = 0; i < 10; i++) {
-            stack.add(i);
-        }
-        var i = 10 - 1;
-        stack.forEach(function (e) {
-            chai_1.expect(e).equals(i);
-            i--;
-        });
-    });
-    it('For each can be interrupted', function () {
-        var array = [0, 1, 2, 3, 4];
-        var b = [];
-        for (var i = 0; i < 5; i++) {
-            stack.add(i);
-        }
-        stack.forEach(function (e) {
-            b.push(e);
-            if (e === 4) {
-                return false;
-            }
-        });
-        chai_1.expect([4]).to.deep.equal(b);
-    });
-});
-//# sourceMappingURL=stackTest.js.map
\ No newline at end of file
diff --git a/dist/test/stackTest.js.map b/dist/test/stackTest.js.map
deleted file mode 100644
index eb018e0..0000000
--- a/dist/test/stackTest.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"stackTest.js","sourceRoot":"","sources":["../../src/test/stackTest.ts"],"names":[],"mappings":";AAAA,IAAY,WAAW,WAAM,cAAc,CAAC,CAAA;AAG5C,qBAAqB,MAAM,CAAC,CAAA;AAE5B,QAAQ,CAAC,OAAO,EACZ;IAEI,IAAI,KAAK,GAAQ,IAAI,CAAC;IAEtB,UAAU,CAAC;QACP,KAAK,GAAG,IAAI,WAAW,CAAC,KAAK,EAAE,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,MAAM,EACL;QACI,aAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACtC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,aAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,aAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,aAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,aAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAE1C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,iBAAiB,EAChB;QACI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,aAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,aAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,aAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,aAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,OAAO,EACN;QACI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,KAAK,CAAC,GAAG,EAAE,CAAC;QACZ,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,KAAK,CAAC,GAAG,EAAE,CAAC;QACZ,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,KAAK,CAAC,GAAG,EAAE,CAAC;QACZ,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,kBAAkB,EACjB;QACI,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACvC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,sBAAsB,EACrB;QACI,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,KAAK,CAAC,IAAI,EAAE,CAAC;QACb,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,KAAK,CAAC,GAAG,EAAE,CAAC;QACZ,KAAK,CAAC,GAAG,EAAE,CAAC;QACZ,KAAK,CAAC,GAAG,EAAE,CAAC;QACZ,aAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,mCAAmC,EAClC;QAEI,KAAK,CAAC,OAAO,CAAC,UAAS,CAAM;YACzB,aAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,wBAAwB;QACxD,CAAC,CAAC,CAAC;QAEH,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1B,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjB,CAAC;QAED,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACf,KAAK,CAAC,OAAO,CAAC,UAAS,CAAM;YACzB,aAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC,EAAE,CAAC;QACR,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEP,EAAE,CAAC,6BAA6B,EAC5B;QACI,IAAI,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,GAAQ,EAAE,CAAC;QAChB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjB,CAAC;QACD,KAAK,CAAC,OAAO,CAAC,UAAS,CAAM;YACzB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACV,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACV,MAAM,CAAC,KAAK,CAAC;YACjB,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,aAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AAEX,CAAC,CAAC,CAAC"}
\ No newline at end of file
diff --git a/dist/test/utilTest.d.ts b/dist/test/utilTest.d.ts
deleted file mode 100644
index e69de29..0000000
diff --git a/dist/test/utilTest.js b/dist/test/utilTest.js
deleted file mode 100644
index 2697193..0000000
--- a/dist/test/utilTest.js
+++ /dev/null
@@ -1,22 +0,0 @@
-"use strict";
-var Collections = require('../lib/index');
-var assert = require('assert');
-describe('util', function () {
-    var Car = (function () {
-        function Car(company, type, year) {
-            this.company = company;
-            this.type = type;
-            this.year = year;
-        }
-        Car.prototype.toString = function () {
-            // Short hand. Adds each own property 
-            return Collections.util.makeString(this);
-        };
-        return Car;
-    }());
-    it('makeString function works', function () {
-        var carStringified = new Car('BMW', 'A', 2016).toString();
-        assert.equal(carStringified, '{company:BMW,type:A,year:2016}');
-    });
-});
-//# sourceMappingURL=utilTest.js.map
\ No newline at end of file
diff --git a/dist/test/utilTest.js.map b/dist/test/utilTest.js.map
deleted file mode 100644
index 37db05e..0000000
--- a/dist/test/utilTest.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"utilTest.js","sourceRoot":"","sources":["../../src/test/utilTest.ts"],"names":[],"mappings":";AAAA,IAAY,WAAW,WAAM,cAAc,CAAC,CAAA;AAE5C,IAAO,MAAM,WAAW,QAAQ,CAAC,CAAC;AAGlC,QAAQ,CAAC,MAAM,EACX;IAEI;QACI,aAAmB,OAAe,EAAS,IAAY,EAAS,IAAY;YAAzD,YAAO,GAAP,OAAO,CAAQ;YAAS,SAAI,GAAJ,IAAI,CAAQ;YAAS,SAAI,GAAJ,IAAI,CAAQ;QAC5E,CAAC;QACD,sBAAQ,GAAR;YACI,sCAAsC;YACtC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAC7C,CAAC;QACL,UAAC;IAAD,CAAC,AAPD,IAOC;IAED,EAAE,CAAC,2BAA2B,EAC1B;QACI,IAAI,cAAc,GAAG,IAAI,GAAG,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAE1D,MAAM,CAAC,KAAK,CAAC,cAAc,EAAE,gCAAgC,CAAC,CAAC;IACnE,CAAC,CAAC,CAAC;AACX,CAAC,CAAC,CAAC"}
\ No newline at end of file
diff --git a/package.json b/package.json
index 55d8f47..ced4105 100644
--- a/package.json
+++ b/package.json
@@ -1,6 +1,6 @@
 {
     "name": "typescript-collections",
-    "version": "1.1.9",
+    "version": "1.2.0",
     "description": "A complete, fully tested data structure library written in TypeScript.",
     "main": "./dist/lib/umd.js",
     "jsnext:main": "dist/lib/index.js",
diff --git a/src/lib/MultiRootTree.ts b/src/lib/MultiRootTree.ts
index 7661f9b..5059bb3 100644
--- a/src/lib/MultiRootTree.ts
+++ b/src/lib/MultiRootTree.ts
@@ -1,11 +1,18 @@
 
-export enum Direction {
+enum Direction {
     BEFORE,
     AFTER,
     INSIDE_AT_END,
     INSIDE_AT_START,
 }
 
+export interface FlatTreeNode {
+    id: string;
+    level: number;
+    hasParent: boolean;
+    childrenCount: number;
+}
+
 export default class MultiRootTree {
 
     rootIds: Array<string>;
@@ -14,8 +21,34 @@ export default class MultiRootTree {
     constructor(rootIds: Array<string> = [], nodes: { [id: string]: Array<string> } = {}) {
         this.rootIds = rootIds;
         this.nodes = nodes;
+
+        this.initRootIds();
+        this.initNodes();
+    }
+
+    initRootIds() {
+        for (let rootId of this.rootIds) {
+            this.createEmptyNodeIfNotExist(rootId);
+        }
     }
 
+    initNodes() {
+        for (let nodeKey in this.nodes) {
+            if (this.nodes.hasOwnProperty(nodeKey)) {
+                for (let nodeListItem of this.nodes[nodeKey]) {
+                    this.createEmptyNodeIfNotExist(nodeListItem);
+                }
+            }
+        }
+    }
+
+    createEmptyNodeIfNotExist(nodeKey: string) {
+        if (!this.nodes[nodeKey]) {
+            this.nodes[nodeKey] = [];
+        }
+    }
+
+
     getRootIds() {
         let clone = this.rootIds.slice();
         return clone;
@@ -39,6 +72,59 @@ export default class MultiRootTree {
         };
     }
 
+    toObject() {
+        return this.getObject();
+    }
+
+    flatten(): Array<FlatTreeNode> {
+        const _this = this;
+        let extraPropsObject: Array<FlatTreeNode> = [];
+
+        for (let i = 0; i < this.rootIds.length; i++) {
+            const rootId = this.rootIds[i];
+            extraPropsObject.push({
+                id: rootId,
+                level: 0,
+                hasParent: false,
+                childrenCount: undefined,
+            });
+
+            traverse(rootId, this.nodes, extraPropsObject, 0);
+        }
+
+        for (let o of extraPropsObject) {
+            o.childrenCount = countChildren(o.id);
+        }
+
+        return extraPropsObject;
+
+        function countChildren(id: string) {
+            if (!_this.nodes[id]) {
+                return 0;
+            } else {
+                const childrenCount = _this.nodes[id].length;
+                return childrenCount;
+            }
+        }
+
+        function traverse(startId: string, nodes: { [id: string]: Array<string> }, returnArray: Array<any>, level = 0) {
+            if (!startId || !nodes || !returnArray || !nodes[startId]) {
+                return;
+            }
+
+            level++;
+
+            let idsList = nodes[startId];
+            for (let i = 0; i < idsList.length; i++) {
+                let id = idsList[i];
+                returnArray.push({ id, level, hasParent: true });
+                traverse(id, nodes, returnArray, level);
+            }
+
+            level--;
+        }
+    }
+
     moveIdBeforeId(moveId: string, beforeId: string) {
         return this.moveId(moveId, beforeId, Direction.BEFORE);
     }
diff --git a/src/test/multiRootTreeTest.ts b/src/test/multiRootTreeTest.ts
index e0e86a9..95484c8 100644
--- a/src/test/multiRootTreeTest.ts
+++ b/src/test/multiRootTreeTest.ts
@@ -654,6 +654,51 @@ describe('Multi Root Tree', function () {
         });
     });
 
+
+    it('Can flatten a tree', function () {
+        tree.insertIdIntoRoot('1');
+        tree.insertIdIntoRoot('2');
+
+        tree.insertIdIntoNode('1', '1.1');
+        tree.insertIdIntoNode('1.1', '1.1.1');
+        tree.insertIdIntoNode('1.1', '1.1.2');
+
+        const nodes = tree.flatten();
+
+        expect(nodes).to.deep.equal([
+            {
+                id: '1',
+                level: 0,
+                hasParent: false,
+                childrenCount: 1,
+            },
+            {
+                id: '1.1',
+                level: 1,
+                hasParent: true,
+                childrenCount: 2,
+            },
+            {
+                id: '1.1.1',
+                level: 2,
+                hasParent: true,
+                childrenCount: 0,
+            }, {
+                id: '1.1.2',
+                level: 2,
+                hasParent: true,
+                childrenCount: 0,
+            },
+            {
+                id: '2',
+                level: 0,
+                hasParent: false,
+                childrenCount: 0,
+            },
+        ]);
+    });
+
+
 });