diff --git a/.vscode/settings.json b/.vscode/settings.json
new file mode 100644
index 0000000..7b33e33
--- /dev/null
+++ b/.vscode/settings.json
@@ -0,0 +1,9 @@
+// 将设置放入此文件中以覆盖默认值和用户设置。
+{
+    // 定义函数的左大括号是否放置在新的一行。
+    "typescript.format.placeOpenBraceOnNewLineForFunctions": true,
+    // 定义控制块的左括号是否放置在新的一行。
+    "typescript.format.placeOpenBraceOnNewLineForControlBlocks": true,
+    "javascript.format.placeOpenBraceOnNewLineForFunctions": true,
+    "javascript.format.placeOpenBraceOnNewLineForControlBlocks": true
+}
\ No newline at end of file
diff --git a/.vscode/tasks.json b/.vscode/tasks.json
new file mode 100644
index 0000000..52606f4
--- /dev/null
+++ b/.vscode/tasks.json
@@ -0,0 +1,23 @@
+{
+    // See https://go.microsoft.com/fwlink/?LinkId=733558
+    // for the documentation about the tasks.json format
+    "version": "2.0.0",
+    "tasks": [
+        {
+            "type": "typescript",
+            "tsconfig": "lib\\tsconfig.json",
+            "option": "watch",
+            "problemMatcher": [
+                "$tsc-watch"
+            ]
+        },
+        {
+            "type": "typescript",
+            "tsconfig": "Tests\\tsconfig.json",
+            "option": "watch",
+            "problemMatcher": [
+                "$tsc-watch"
+            ]
+        }
+    ]
+}
\ No newline at end of file
diff --git a/DataStructures.js b/DataStructures.js
deleted file mode 100644
index 01cd4a8..0000000
--- a/DataStructures.js
+++ /dev/null
@@ -1,5449 +0,0 @@
-/**
- * Interface for managing a generic data structure.
- * @constructor
- * @interface
- */
-function Aggregate() {
-
-}
-
-/**
- * Returns the iterator relative to the aggregate.
- * @abstract
- * @return {Iterator} The iterator.
- */
-Aggregate.prototype.getIterator = function () {
-};
-
-/**
- * Interface for managing an iterator for an aggregate.
- * @constructor
- * @interface
- */
-function Iterator() {
-
-}
-
-/**
- * Moves the iterator to the first position of the aggregate.
- * @abstract
- * @return {void}
- */
-Iterator.prototype.first = function () {
-
-};
-
-/**
- * Moves the iterator to the next item.
- * @abstract
- * @return {void}
- */
-Iterator.prototype.next = function () {
-
-};
-
-/**
- * Moves the iterator to the last position of the aggregate.
- * @abstract
- * @return {void}
- */
-Iterator.prototype.last = function () {
-
-};
-
-/**
- * Moves the iterator to the previous item.
- * @abstract
- * @return {void}
- */
-Iterator.prototype.previous = function () {
-
-};
-
-/**
- * Checks if the iterator is out of the bounds of the aggregate.
- * @abstract
- * @return {boolean} It return true if the iterator is out of the bounds of the aggregate, otherwise false.
- */
-Iterator.prototype.isDone = function () {
-
-};
-
-/**
- * Returns the item stored at the position pointed by the iterator.
- * @abstract
- * @return {*} The item stored or undefined if it's out of the bounds.
- */
-Iterator.prototype.getItem = function () {
-
-};
-
-/**
- * Class for managing a binary search tree.
- * @constructor
- */
-function BSTree() {
-	/**
-	 * The root of the tree.
-	 * @type {BSNode|null}
-	 */
-	this.root = null;
-}
-
-/**
- * Returns the iterator relative to the aggregate.
- * @return {Iterator} The iterator.
- */
-BSTree.prototype.getIterator = function () {
-	return new BSTreeIterator(this);
-};
-
-/**
- * Inserts the item relatives to the key value in the tree.
- * @param key {number} The key to store.
- * @param item {*} The item to store.
- * @return {void}
- */
-BSTree.prototype.insert = function (key, item) {
-	var node = new BSNode(key, item);
-	var p = this.root;
-	for (var n = this.root; n;) {
-		p = n;
-		if (key < n.key)
-			n = n.left;
-		else
-			n = n.right;
-	}
-	node.parent = p;
-	if (!p)
-		this.root = node;
-	else if (key < p.key)
-		p.left = node;
-	else
-		p.right = node;
-};
-
-/**
- * Searches the item relatives to the key.
- * @param key {Number} The key to find.
- * @param [node = root] {BSNode} The node from which start the search.
- * @return {*} The item found or undefined if there isn't the key in the tree.
- */
-BSTree.prototype.search = function (key, node) {
-	node = node || this.root;
-	while (node && key !== node.key)
-		if (key < node.key)
-			node = node.left;
-		else
-			node = node.right;
-	if (node)
-		return node.item;
-	return undefined;
-};
-
-/**
- * Gets the item relatives to the minimum key stored in the tree.
- * @param [node = root] {Node} The node from which start the search.
- * @return {BSNode} The node found.
- */
-BSTree.prototype.minimum = function (node) {
-	node = node || this.root;
-	while (node && node.left)
-		node = node.left;
-	return node;
-};
-
-/**
- * Gets the item relatives to the maximum key stored in the tree.
- * @param [node = root] {Node} The node from which start the search.
- * @return {BSNode} The node found.
- */
-BSTree.prototype.maximum = function (node) {
-	node = node || this.root;
-	while (node && node.right)
-		node = node.right;
-	return node;
-};
-
-/**
- * Gets the node with the key next to the param node key.
- * @param node {BSNode} The node of which search the successor.
- * @return {BSNode} The node found.
- */
-BSTree.prototype.successor = function (node) {
-	if (node.right)
-		return this.minimum(node.right);
-	var parent = node.parent;
-	while (parent && node === parent.right) {
-		node = parent;
-		parent = parent.parent;
-	}
-	return parent;
-};
-
-/**
- * Gets the node with the key previous to the param node key.
- * @param node {BSNode} The node of which search the predecessor.
- * @return {BSNode} The node found.
- */
-BSTree.prototype.predecessor = function (node) {
-	if (node.left)
-		return this.maximum(node.left);
-	var parent = node.parent;
-	while (parent && node === parent.left) {
-		node = parent;
-		parent = parent.parent;
-	}
-	return parent;
-};
-
-/**
- * Deletes the node from the tree.
- * @param node {BSNode} The node to delete.
- * @return {void}
- */
-BSTree.prototype.deleteNode = function (node) {
-	if (!node.left && !node.right) {
-		if (node === this.root)
-			this.root = null;
-		else if (node.parent.left === node)
-			node.parent.left = null;
-		else
-			node.parent.right = null;
-	} else if (node.left && node.right) {
-		var next = this.successor(node);
-		node.key = next.key;
-		node.item = next.item;
-		if (next.parent.left === next)
-			next.parent.left = null;
-		else
-			next.parent.right = null;
-	} else {
-		if (node.right) {
-			if (node === this.root) {
-				this.root = node.right;
-				node.right.parent = null;
-			} else {
-				node.parent.right = node.right;
-				node.right.parent = node.parent;
-			}
-		} else {
-			if (node === this.root) {
-				this.root = node.left;
-				node.left.parent = null;
-			} else {
-				node.parent.left = node.left;
-				node.left.parent = node.parent;
-			}
-		}
-	}
-};
-
-/**
- * Class that implements the iterator for a binary search tree.
- * @param aggregate {BSTree} The aggregate to scan.
- * @constructor
- */
-function BSTreeIterator(aggregate) {
-	/**
-	 * The aggregate relates to this iterator.
-	 * @type {BSTree}
-	 */
-	this.aggregate = aggregate;
-
-	/**
-	 * The pointer to the position.
-	 * @type {BSNode|null}
-	 */
-	this.pointer = null;
-}
-
-/**
- * Moves the iterator to the first position of the aggregate.
- * @return {void}
- */
-BSTreeIterator.prototype.first = function () {
-	this.pointer = this.aggregate.minimum();
-};
-
-/**
- * Moves the iterator to the next item.
- * @return {void}
- */
-BSTreeIterator.prototype.next = function () {
-	this.pointer = this.aggregate.successor(this.pointer);
-};
-
-/**
- * Moves the iterator to the last position of the aggregate.
- * @return {void}
- */
-BSTreeIterator.prototype.last = function () {
-	this.pointer = this.aggregate.maximum();
-};
-
-/**
- * Moves the iterator to the previous item.
- * @return {void}
- */
-BSTreeIterator.prototype.previous = function () {
-	this.pointer = this.aggregate.predecessor(this.pointer);
-};
-
-/**
- * Checks if the iterator is out of the bounds of the aggregate.
- * @return {boolean} It return true if the iterator is out of the bounds of the aggregate, otherwise false.
- */
-BSTreeIterator.prototype.isDone = function () {
-	return !this.pointer;
-};
-
-/**
- * Returns the item stored at the position pointed by the iterator.
- * @return {*} The item stored or undefined if it's out of the bounds.
- */
-BSTreeIterator.prototype.getItem = function () {
-	return this.pointer.item;
-};
-
-/**
- * Returns the node stored at the position pointed by the iterator.
- * @return {BSNode|null} The node stored or null if it's out of the bounds.
- */
-BSTreeIterator.prototype.getNode = function () {
-	return this.pointer;
-};
-
-/**
- * Class for managing a B-Tree.
- * @param minimumDegree {number} The minimum number of keys of a node.
- * @constructor
- */
-function BTree(minimumDegree) {
-	/**
-	 * The root of the tree.
-	 * @type {BNode}
-	 */
-	this.root = new BNode();
-
-	/**
-	 * The minimum number of the keys of a node.
-	 * @type {number}
-	 */
-	this.t = minimumDegree;
-
-	/**
-	 * The number of items stored in the tree.
-	 * @type {number}
-	 */
-	this.size = 0;
-}
-
-/**
- * Returns the iterator relative to the aggregate.
- * @return {Iterator} The iterator.
- */
-BTree.prototype.getIterator = function () {
-	return new BTreeIterator(this);
-};
-
-/**
- * Inserts the item relatives to the key value in the tree.
- * @param key {number} The key to store.
- * @param item {*} The item to store.
- * @return {void}
- */
-BTree.prototype.insert = function (key, item) {
-	var node = this.root;
-	if (node.keys.length === 2 * this.t - 1) {
-		var newNode = new BNode();
-		newNode.childs.push(node);
-		this.root = newNode;
-		this.splitChild(newNode, 0);
-		node = newNode;
-	}
-	this.size++;
-	this.insertNonFull(node, key, item);
-};
-
-/**
- * Inserts the new node in the right position if the node is not full.
- * @param node {BNode} The node from which start to check the insertion.
- * @param key {number} The key to store.
- * @param item {*} The item to store.
- * @return {void}
- */
-BTree.prototype.insertNonFull = function (node, key, item) {
-	while (node) {
-		var i = node.keys.length - 1;
-		if (!node.childs.length) {
-			for (; i > -1 && key < node.keys[i]; i--) {
-				node.keys[i + 1] = node.keys[i];
-				node.items[i + 1] = node.items[i];
-			}
-			node.keys[i + 1] = key;
-			node.items[i + 1] = item;
-			return;
-		} else {
-			var j = 0;
-			i++;
-			while (j < i) {
-				var m = Math.floor((j + i) / 2);
-				if (key <= node.keys[m])
-					i = m;
-				else
-					j = m + 1;
-			}
-			if (node.childs[j].keys.length === 2 * this.t - 1) {
-				this.splitChild(node, j);
-				if (key > node.keys[j])
-					j++;
-			}
-			node = node.childs[j];
-		}
-	}
-};
-
-/**
- * Searches the item relatives to the key that satisfy the condition represented by the callback function.
- * @param key {Number} The key to find.
- * @param [node = root] {RBNode} The node from which start the search.
- * @param [callback = function(node,index){return(node.keys[index]===key);}] The condition to satisfy. The callback must accept the current node to check and optionally the position of the key.
- * @return {*} The item found or undefined if there isn't the key in the tree.
- */
-BTree.prototype.search = function (key, node, callback) {
-	node = node || this.root;
-	callback = callback || function (node, index) {
-		return node.keys[index] === key;
-	};
-	while (node) {
-		var n = node.keys.length;
-		var i = 0, j = n;
-		while (i < j) {
-			var m = Math.floor((i + j) / 2);
-			if (key <= node.keys[m])
-				j = m;
-			else
-				i = m + 1;
-		}
-		if (i < n && callback(node, i))
-			return node.items[i];
-		else if (!node.childs.length)
-			return undefined;
-		else
-			node = node.childs[i];
-	}
-};
-
-/**
- * Splits the child of the node at the position index.
- * @param node {BNode} The parent of the child to split.
- * @param index {number} The position of the child to split.
- * @return {void}
- */
-BTree.prototype.splitChild = function (node, index) {
-	var newNode = new BNode();
-	var child = node.childs[index];
-	//copy of the last t - 1 keys and items in the new node
-	for (var i = 0; i < this.t - 1; i++) {
-		newNode.keys[i] = child.keys[i + this.t];
-		newNode.items[i] = child.items[i + this.t];
-	}
-	if (child.childs.length)
-	//copy of the last t child in the new node
-		for (var j = 0; j < this.t; j++)
-			newNode.childs[j] = child.childs[j + this.t];
-	//shift the children from index + 1 position
-	for (var l = node.keys.length; l > index; l--)
-		node.childs[l + 1] = node.childs[l];
-	//set the index position as the position t of the child
-	node.childs[index + 1] = newNode;
-	//shift the keys and the items from index position
-	for (var k = node.keys.length - 1; k > index - 1; k--) {
-		node.keys[k + 1] = node.keys[k];
-		node.items[k + 1] = node.items[k];
-	}
-	node.keys[index] = child.keys[this.t - 1];
-	node.items[index] = child.items[this.t - 1];
-	//remove keys, items and child in the old node.
-	child.keys.splice(child.keys.length - this.t);
-	child.items.splice(child.items.length - this.t);
-	child.childs.splice(child.childs.length - this.t);
-};
-
-/**
- * Deletes the key from the tree.
- * @param key {*} The key to delete.
- * @return {void}
- */
-BTree.prototype.deleteKey = function (key) {
-	if (this.root.keys.length) {
-		this.deleteNonMin(this.root, key);
-		if (!this.root.keys.length && this.root.childs.length)
-			this.root = this.root.childs[0];
-		this.size--;
-	}
-};
-
-/**
- * Deletes a node that's a number of keys greater than the minimum for a node.
- * @param node {BNode} The node to delete.
- * @param key {number} The key to delete.
- * @return {void}
- */
-BTree.prototype.deleteNonMin = function (node, key) {
-	var i = 0, j = node.keys.length;
-	while (i < j) {
-		var m = Math.floor((i + j) / 2);
-		if (key <= node.keys[m])
-			j = m;
-		else
-			i = m + 1;
-	}
-	//key is in the node
-	if (i < node.keys.length && key === node.keys[i]) {
-		//the node is a leaf
-		if (!node.childs.length) {
-			//remove the key
-			for (j = i + 1; j < node.keys.length; j++) {
-				node.keys[j - 1] = node.keys[j];
-				node.items[j - 1] = node.items[j];
-			}
-			node.keys.pop();
-			node.items.pop();
-		} else {
-			//the node is not a leaf
-			//the node has the minimum number of keys
-			if (node.childs[i].length === this.t - 1) {
-				//increase the number of the keys of the node
-				this.augmentChild(node, i);
-				if (i === node.keys.length + 1)
-					i--;
-			}
-			//check if the key is moved in the child
-			if (node.keys[i] !== key)
-				this.deleteNonMin(node.childs[i], key);
-			else
-				this.deleteMax(node, i);
-		}
-		//the key is not in the node
-	} else {
-		//check if the child i has the minimum number of keys
-		if (node.childs[i].keys.length === this.t - 1) {
-			this.augmentChild(node, i);
-			if (i === node.keys.length + 2)
-				i--;
-		}
-		this.deleteNonMin(node.childs[i], key);
-	}
-};
-
-/**
- * Deletes a node that have the maximum number of keys for node.
- * @param node {BNode} The node to delete.
- * @param index {number} The key to delete in the node.
- * @return {void}
- */
-BTree.prototype.deleteMax = function (node, index) {
-	var child = node.childs[index];
-	var goAhead = true;
-	while (goAhead) {
-		if (!child.childs.length) {
-			node.keys[index] = child.keys[child.keys.length - 1];
-			node.items[index] = child.items[child.items.length - 1];
-			child.keys.pop();
-			child.items.pop();
-			goAhead = false;
-		} else {
-			var last = child.childs[child.keys.length];
-			if (last.keys.length === this.t - 1)
-				this.augmentChild(child, child.keys.length);
-			child = child.childs[child.keys.length];
-		}
-	}
-};
-
-/**
- * Augments the number of keys stored in the node preserving the order.
- * @param node {BNode} The node to delete.
- * @param index {number} The index of the position to augment.
- * @return {void}
- */
-BTree.prototype.augmentChild = function (node, index) {
-	var child = node.childs[index];
-	var brother;
-	if (index)
-		brother = node.childs[index - 1];
-	if (index && brother.keys.length > this.t - 1) {
-		if (child.childs.length) {
-			for (var j = this.keys.length + 1; j > 0; j--)
-				child.childs[j] = child.childs[j - 1];
-			child.childs[0] = brother.childs[brother.keys.length];
-			for (var i = child.keys.length; i > 0; i--) {
-				child.keys[i] = child.keys[i - 1];
-				child.items[i] = child.items[i - 1];
-			}
-			child.keys[0] = node.keys[index - 1];
-			child.items[0] = node.items[index - 1];
-			node.keys[index - 1] = brother.keys[brother.keys.length - 1];
-			node.items[index - 1] = brother.items[brother.items.length - 1];
-		}
-	} else {
-		if (index < node.keys.length)
-			brother = node.childs[index + 1];
-		if (index < node.keys.length && brother.keys.length > this.t - 1) {
-			if (brother.childs.length) {
-				child.childs[child.keys.length + 1] = brother.childs[0];
-				for (var l = 1; l < brother.keys.length + 1; l++)
-					brother.childs[l - 1] = brother.childs[l];
-				brother.childs.pop();
-			}
-			child.keys[child.keys.length] = node.keys[index];
-			child.items[child.items.length] = node.items[index];
-			node.keys[index] = brother.keys[0];
-			node.items[index] = brother.items[0];
-			for (var k = 1; k < brother.keys.length; k++) {
-				brother.keys[k - 1] = brother.keys[k];
-				brother.items[k - 1] = brother.items[k];
-			}
-			brother.keys.pop();
-			brother.items.pop();
-		} else {
-			if (index < node.keys.length) {
-				child.keys[this.t - 1] = node.keys[index];
-				child.items[this.t - 1] = node.items[index];
-				for (var m = index + 2; m < node.keys.length + 1; m++)
-					node.childs[m - 1] = node.childs[m];
-				node.childs.pop();
-				for (var n = index + 1; n < node.keys.length; n++) {
-					node.keys[n - 1] = node.keys[n];
-					node.items[n - 1] = node.items[n];
-				}
-				node.keys.pop();
-				node.items.pop();
-				if (brother.childs.length)
-					for (var y = 0; y < brother.keys.length + 1; y++)
-						child.childs[this.t + y] = brother.childs[y];
-				for (var x = 0; x < brother.keys.length; x++) {
-					child.keys[x + this.t] = brother.keys[x];
-					child.items[x + this.t] = brother.items[x];
-				}
-			} else {
-				if (brother.childs.length)
-					for (var w = 0; w < child.keys.length + 1; w++)
-						brother.childs[this.t + w] = child.childs[w];
-				brother.keys[this.t - 1] = node.keys[node.keys.length - 1];
-				brother.items[this.t - 1] = node.items[node.keys.length - 1];
-				for (var z = 0; z < child.keys.length; z++) {
-					brother.keys[z + this.t] = child.keys[z];
-					brother.items[z + this.t] = child.items[z];
-				}
-			}
-		}
-	}
-};
-
-/**
- * Checks if the tree contains the key.
- * @param key {number} The key to find.
- * @param [callback = function(node,index){return(node.keys[index]===key);}] The condition to satisfy. The callback must accept the current node to check and optionally the position of the key.
- * @return {boolean} True if the tree contains the key.
- */
-BTree.prototype.contains = function (key, callback) {
-	return this.search(key, null, callback) !== undefined;
-};
-
-/**
- * Checks if the tree contains a node that satisfy the condition represented by the callback function.
- * This method check all the tree avoiding the binary search.
- * @param callback {function} The condition to satisfy. The callback must accept the current node to check.
- * @return {boolean} True if the tree contains the node that satisfy the condition, false otherwise.
- */
-BTree.prototype.fullContains = function (callback) {
-	var key = this.minimumKey();
-	while (key !== null && !callback(this.search(key)))
-		key = this.successor(key);
-	return key !== null;
-};
-
-/**
- * Gets the key next to the param node key.
- * @param key {number} The key of which search the successor.
- * @param [node = root] The node from start the search of the successor.
- * @return {number} The key found.
- */
-BTree.prototype.successor = function (key, node) {
-	node = node || this.root;
-	var i = 0, j = node.keys.length;
-	//search the key in the node
-	while (i < j) {
-		var m = Math.floor((i + j) / 2);
-		if (key <= node.keys[m])
-			j = m;
-		else
-			i = m + 1;
-	}
-	//check if the key has been found
-	if (node.keys[i] === key)
-	//in this case the successor is the next key
-		i++;
-	//if it's a leaf
-	if (!node.childs.length) {
-		//check if the key hasn't been found
-		if (i > node.keys.length - 1)
-			return null;
-		else
-			return node.keys[i];
-	}
-	//if it's not a leaf check if the successor is in the i-child
-	var successor = this.successor(key, node.childs[i]);
-	//if it's not in the child and has been found a key then return it
-	if (successor === null && i < node.keys.length)
-		return node.keys[i];
-	//return the value of the successor even if it's null
-	return successor;
-};
-
-/**
- * Gets the key previous to the param key.
- * @param key {number} The key of which search the predecessor.
- * @param [node = root] The node from start the search of the predecessor.
- * @return {number} The key found.
- */
-BTree.prototype.predecessor = function (key, node) {
-	node = node || this.root;
-	var i = 0, j = node.keys.length;
-	//search the key in the node
-	while (i < j) {
-		var m = Math.floor((i + j) / 2);
-		if (key <= node.keys[m])
-			j = m;
-		else
-			i = m + 1;
-	}
-	i--;
-	//check if the node is a leaf
-	if (!node.childs.length) {
-		//check if a predecessor has been found
-		if (i < 0)
-			return null;
-		else
-			return node.keys[i];
-	}
-	var predecessor = this.predecessor(key, node.childs[i + 1]);
-	if (predecessor === null && key > node.keys[0]) {
-		return node.keys[i];
-	}
-	return predecessor;
-};
-
-/**
- * Gets the minimum key stored in the tree.
- * @return {number} The key found.
- */
-BTree.prototype.minimumKey = function () {
-	var node = this.root;
-	while (node.childs.length)
-		node = node.childs[0];
-	if (node)
-		return node.keys[0];
-	return null;
-};
-
-/**
- * Gets the maximum key stored in the tree.
- * @return {number} The key found.
- */
-BTree.prototype.maximumKey = function () {
-	var node = this.root;
-	while (node.childs.length)
-		node = node.childs[node.childs.length - 1];
-	if (node)
-		return node.keys[node.keys.length - 1];
-	return null;
-};
-
-/**
- * Gets the item relatives to the minimum key stored in the tree.
- * @return {number} The item found.
- */
-BTree.prototype.minimum = function () {
-	var node = this.root;
-	while (node.childs.length)
-		node = node.childs[0];
-	return node.items[0];
-};
-
-/**
- * Gets the item relatives to the maximum key stored in the tree.
- * @return {node} The item found.
- */
-BTree.prototype.maximum = function () {
-	var node = this.root;
-	while (node.childs.length)
-		node = node.childs[node.childs.length - 1];
-	return node.items[node.items.length - 1];
-};
-
-/**
- * Returns the size of the tree.
- * @return {number} The size of the tree.
- */
-BTree.prototype.getSize = function () {
-	return this.size;
-};
-
-/**
- * Checks if the tree is empty.
- * @return {boolean} True if the tree is empty, false otherwise.
- */
-BTree.prototype.isEmpty = function () {
-	return !this.size;
-};
-
-/**
- * Executes the callback function for each item of the tree.
- * This method modifies the tree so if you don't need to modify it you must return the same item of the array.
- * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
- * @return {void}
- */
-BTree.prototype.execute = function (callback) {
-	var node = arguments[1] || this.root;
-	for (var i = 0; i < node.items.length; i++)
-		node.items[i] = callback(node.items[i]);
-	for (var j = 0; j < node.childs.length; j++)
-		this.execute(callback, node.childs[j]);
-};
-
-/**
- * Removes all the items stored in the tree.
- * @return {void}
- */
-BTree.prototype.clear = function () {
-	this.root = null;
-	this.size = 0;
-};
-
-/**
- * Returns the items that satisfy the condition determined by the callback.
- * @param callback {function} The function that implements the condition.
- * @return {Array<*>} The array that contains the items that satisfy the condition.
- */
-BTree.prototype.filter = function (callback) {
-	var result = [];
-	var node = arguments[1] || this.root;
-	for (var i = 0; i < node.items.length; i++) {
-		if (node.childs.length)
-			result = result.concat(this.filter(callback, node.childs[i]));
-		if (callback(node.items[i]))
-			result.push(node.items[i]);
-	}
-	if (node.childs.length)
-		result = result.concat(this.filter(callback, node.childs[node.childs.length - 1]));
-	return result;
-};
-
-/**
- * Clones the tree into a new tree.
- * @return {BTree} The tree cloned from this tree.
- */
-BTree.prototype.clone = function () {
-	var tree = new BTree(this.t);
-	var it = this.getIterator();
-	for (it.first(); !it.isDone(); it.next()) {
-		var item = it.getItem();
-		if (item.clone)
-			item = item.clone();
-		tree.insert(it.getKey(), item);
-	}
-	return tree;
-};
-
-/**
- * Clones the tree into a new tree without cloning duplicated items.
- * @return {BTree} The tree cloned from this tree.
- */
-BTree.prototype.cloneDistinct = function () {
-	var tree = new BTree(this.t);
-	var it = this.getIterator();
-	for (it.first(); !it.isDone(); it.next()) {
-		var callback = function (item) {
-			return item === it.getItem();
-		};
-		if (!tree.fullContains(callback)) {
-			if (it.getItem().cloneDistinct)
-				tree.insert(it.getKey(), it.getItem().cloneDistinct());
-			else if (it.getItem().clone)
-				tree.insert(it.getKey(), it.getItem().clone());
-			else
-				tree.insert(it.getKey(), it.getItem());
-		}
-	}
-	return tree;
-};
-
-/**
- * Transforms the tree into an array without preserving keys.
- * @return {Array<*>} The array that represents the tree.
- */
-BTree.prototype.toArray = function () {
-	var result = [];
-	var it = this.getIterator();
-	for (it.first(); !it.isDone(); it.next())
-		result.push(it.getItem());
-	return result;
-};
-
-/**
- * Returns the first position of the item in the tree.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The first position of the item.
- */
-BTree.prototype.indexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0, key = this.minimumKey();
-	while (key !== null) {
-		if (callback(this.search(key)))
-			return i;
-		key = this.successor(key);
-		i++;
-	}
-	return -1;
-};
-
-/**
- * Returns the last position of the item in the tree.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The last position of the item.
- */
-BTree.prototype.lastIndexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = this.size - 1, key = this.maximumKey();
-	while (key !== null) {
-		if (callback(this.search(key)))
-			return i;
-		i--;
-		key = this.predecessor(key);
-	}
-	return -1;
-};
-
-/**
- * Returns all the position in which the item has been found in the tree.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {Array<number>} The positions in which the item has been found.
- */
-BTree.prototype.allIndexesOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0, key = this.minimumKey();
-	var indexes = [];
-	while (key !== null) {
-		if (callback(this.search(key)))
-			indexes.push(i);
-		i++;
-		key = this.successor(key);
-	}
-	return indexes;
-};
-
-/**
- * Returns the item at the position index.
- * @param index {number} The position of the item.
- * @return {*} The item at the position. It's undefined if index isn't in the tree bounds.
- */
-BTree.prototype.getItem = function (index) {
-	if (index < 0 || index > this.size - 1)
-		return undefined;
-	var key = this.minimum();
-	for (var i = 0; i < index; i++)
-		key = this.successor(key);
-	return this.search(key);
-};
-
-/**
- * Class that implements the iterator for a binary search tree.
- * @param aggregate {BTree} The aggregate to scan.
- * @constructor
- */
-function BTreeIterator(aggregate) {
-	/**
-	 * The aggregate relates to this iterator.
-	 * @type {BTree}
-	 */
-	this.aggregate = aggregate;
-
-	/**
-	 * The pointer to the position.
-	 * @type {number}
-	 */
-	this.pointer = null;
-}
-
-/**
- * Moves the iterator to the first position of the aggregate.
- * @return {void}
- */
-BTreeIterator.prototype.first = function () {
-	this.pointer = this.aggregate.minimumKey();
-};
-
-/**
- * Moves the iterator to the next item.
- * @return {void}
- */
-BTreeIterator.prototype.next = function () {
-	this.pointer = this.aggregate.successor(this.pointer);
-};
-
-/**
- * Moves the iterator to the last position of the aggregate.
- * @return {void}
- */
-BTreeIterator.prototype.last = function () {
-	this.pointer = this.aggregate.maximumKey();
-};
-
-/**
- * Moves the iterator to the previous item.
- * @return {void}
- */
-BTreeIterator.prototype.previous = function () {
-	this.pointer = this.aggregate.predecessor(this.pointer);
-};
-
-/**
- * Checks if the iterator is out of the bounds of the aggregate.
- * @return {boolean} It return true if the iterator is out of the bounds of the aggregate, otherwise false.
- */
-BTreeIterator.prototype.isDone = function () {
-	return this.pointer === null;
-};
-
-/**
- * Returns the item stored at the position pointed by the iterator.
- * @return {*} The item stored or undefined if it's out of the bounds.
- */
-BTreeIterator.prototype.getItem = function () {
-	return this.aggregate.search(this.pointer);
-};
-
-/**
- * Returns the key stored at the position pointed by the iterator.
- * @return {number} The key stored or null if it's out of the bounds.
- */
-BTreeIterator.prototype.getKey = function () {
-	return this.pointer;
-};
-
-/**
- * Class for managing a circular buffer.
- * @param size {Number} The size of the buffer.
- * @constructor
- */
-function CircularBuffer(size) {
-	/**
-	 * The index of the position of the head of the buffer.
-	 * @type {number}
-	 */
-	this.head = 0;
-	/**
-	 * The index of the position of the tail of the buffer.
-	 * @type {number}
-	 */
-	this.tail = 0;
-	/**
-	 * The items stored in the buffer.
-	 * @type {Array<*>}
-	 */
-	this.items = new Array(size);
-	/**
-	 * Is true if buffer is empty, false otherwise.
-	 * @type {boolean}
-	 */
-	this.empty = true;
-	/**
-	 * Is false if buffer is full, false otherwise.
-	 * @type {boolean}
-	 */
-	this.full = false;
-	/**
-	 * The size of the buffer.
-	 * @type {Number}
-	 */
-	this.size = size;
-}
-
-/**
- * Returns the iterator relative to the aggregate.
- * @return {Iterator} The iterator.
- */
-CircularBuffer.prototype.getIterator = function () {
-	return new CircularBufferIterator(this);
-};
-
-/**
- * Writes the item at the head of the buffer.
- * @param item {*} The item to write.
- * @return {void}
- */
-CircularBuffer.prototype.write = function (item) {
-	this.empty = false;
-	if (this.full)
-	//if buffer is full tail must be set forward
-		this.tail = (this.tail + 1) % this.size;
-	this.items[this.head] = item;
-	//head is set forward
-	this.head = (this.head + 1) % this.size;
-	if (this.tail === this.head)
-		this.full = true;
-};
-
-/**
- * Frees the buffer between indexes from and to.
- * If from > to, positions between from and the end of the buffer and between the start and to will be free.
- * @param from {Number} The index from which start to free (inclusive index)
- * @param to {Number} The index where stop to free (exclusive index)
- * @return {void}
- */
-CircularBuffer.prototype.free = function (from, to) {
-	if (from < 0)
-		from = 0;
-	if (from > this.size - 1)
-		from = this.size - 1;
-	if (to < 0)
-		to = 0;
-	if (to > this.size - 1)
-		to = this.size - 1;
-	//if from < to then will be free allocation between from and to
-	//otherwise will be free allocations between from and the end and between the start and to
-	for (var i = from; i < to; i = (i + 1) % this.size)
-		delete this.items[i];
-
-	//adjust the position of the tail and of the head
-	if (this.tail > from - 1 || this.tail < to)
-		if (this.tail < this.head) {
-			this.tail = (from - 1) % this.size;
-		} else {
-			this.tail = to;
-		}
-	if (this.head > from || this.head < to)
-		if (this.tail < this.head) {
-			this.head = to;
-		} else {
-			this.head = from;
-		}
-	//check if something is free
-	if (from !== to)
-		this.full = false;
-	//free could make buffer empty
-	for (var j = 0; j < this.size; j++)
-		if (this.items[j] !== undefined) {
-			this.empty = false;
-			return;
-		}
-	this.empty = true;
-};
-
-/**
- * Frees all the buffer.
- * @return {void}
- */
-CircularBuffer.prototype.freeAll = function () {
-	for (var i = 0; i < this.size; i++)
-		delete this.items[i];
-	this.empty = true;
-	this.head = 0;
-	this.tail = 0;
-};
-
-/**
- * Reads the item stored at the position index.
- * @param index {Number} The position of the item to read.
- * @return {*} The item read.
- */
-CircularBuffer.prototype.read = function (index) {
-	return this.items[index % this.size];
-};
-
-/**
- * Returns true if the buffer is empty, false otherwise.
- * @return {boolean}
- */
-CircularBuffer.prototype.isEmpty = function () {
-	return this.empty;
-};
-
-/**
- * Returns true if the buffer is full, false otherwise.
- * @return {boolean}
- */
-CircularBuffer.prototype.isFull = function () {
-	return this.full;
-};
-
-/**
- * Clones the circular buffer into a new circular buffer.
- * @return {CircularBuffer} The circular buffer cloned from this circular buffer.
- */
-CircularBuffer.prototype.clone = function () {
-	var buffer = new CircularBuffer(this.size);
-	buffer.head = this.head;
-	buffer.tail = this.tail;
-	for (var i = 0; i < this.items.length; i++)
-		buffer.items[i] = this.items[i];
-	buffer.empty = this.empty;
-	buffer.full = this.full;
-	return buffer;
-};
-
-/**
- * Resize the buffer.
- * @param size {number} The new size of the buffer.
- * @return {void}
- */
-CircularBuffer.prototype.resize = function (size) {
-	if (this.size < size) {
-		if (this.head < this.tail + 1) {
-			for (var i = 0; i < this.head; i++) {
-				this.items[(i + this.size) % size] = this.items[i];
-				delete this.items[i];
-			}
-			this.head = (this.head + this.size) % size;
-		}
-	} else if (this.size > size) {
-		if (this.head < this.tail + 1) {
-			//check if the tail is after the size
-			var start = size;
-			if (this.tail > size - 1) {
-				start = this.tail;
-				this.tail = 0;
-			}
-			//the items stored must be shift to a valid position
-			var step = this.size - start;
-			for (var j = this.head - step - 1; j > start - 1 || j < this.head - step; j--) {
-				this.items[(j + step) % this.size] = this.items[j];
-				if (!j)
-					j = this.size;
-			}
-			this.head = (this.head + step) % this.size;
-		}
-	}
-	this.size = size;
-};
-
-/**
- * Class that implements the iterator for a circular buffer.
- * @param aggregate {CircularBuffer} The aggregate to scan.
- * @constructor
- */
-function CircularBufferIterator(aggregate) {
-	/**
-	 * The aggregate relates to this iterator.
-	 * @type {CircularBuffer}
-	 */
-	this.aggregate = aggregate;
-
-	/**
-	 * The pointer to the position.
-	 * @type {number|null}
-	 */
-	this.pointer = null;
-	/**
-	 * Discriminator for full buffer
-	 * @type {bool}
-	 */
-	this.start = true;
-}
-
-/**
- * Moves the iterator to the first position of the aggregate.
- * @return {void}
- */
-CircularBufferIterator.prototype.first = function () {
-	this.pointer = this.aggregate.tail;
-	this.start = true;
-};
-
-/**
- * Moves the iterator to the next item.
- * @return {void}
- */
-CircularBufferIterator.prototype.next = function () {
-	this.pointer = (this.pointer + 1) % this.aggregate.size;
-	this.start = false;
-};
-
-/**
- * Moves the iterator to the last position of the aggregate.
- * @return {void}
- */
-CircularBufferIterator.prototype.last = function () {
-	this.pointer = (this.aggregate.head - 1) % this.aggregate.size;
-	this.start = true;
-};
-
-/**
- * Moves the iterator to the previous item.
- * @return {void}
- */
-CircularBufferIterator.prototype.previous = function () {
-	this.pointer = (this.pointer - 1) % this.aggregate.size;
-	this.start = false;
-};
-
-/**
- * Checks if the iterator is out of the bounds of the aggregate.
- * @return {boolean} It return true if the iterator is out of the bounds of the aggregate, otherwise false.
- */
-CircularBufferIterator.prototype.isDone = function () {
-	return (this.pointer === this.aggregate.head && !this.start) || (this.pointer === this.aggregate.tail - 1) % this.aggregate.size || this.aggregate.isEmpty();
-};
-
-/**
- * Returns the item stored at the position pointed by the iterator.
- * @return {*} The item stored or undefined if it's out of the bounds.
- */
-CircularBufferIterator.prototype.getItem = function () {
-	return this.aggregate.read(this.pointer);
-};
-
-/**
- * Class for managing a double linked list.
- * @param {...*} [args] The items for initializing the list.
- * @constructor
- */
-function DoubleLinkedList(args) {
-	/**
-	 * The first node of the list.
-	 * @type {DLLNode|null}
-	 */
-	this.first = null;
-	/**
-	 * The last node of the list.
-	 * @type {DLLNode|null}
-	 */
-	this.last = null;
-	/**
-	 * The length of the list.
-	 * @type {number}
-	 */
-	this.length = 0;
-	//builds the list from the parameters of the constructor
-	this.fromArray(arguments);
-}
-
-/**
- * Returns the iterator relative to the aggregate.
- * @return {Iterator} The iterator.
- */
-DoubleLinkedList.prototype.getIterator = function () {
-	return new DoubleLinkedListIterator(this);
-};
-
-/**
- * Adds an item at the head of the list.
- * @param item {*} The item to add.
- * @return {void}
- */
-DoubleLinkedList.prototype.pushFront = function (item) {
-	var node = new DLLNode(item);
-	node.next = this.first;
-	this.first = node;
-	//link the next node to the new node
-	if (node.next)
-		node.next.previous = node;
-	else
-		this.last = node;
-	this.length++;
-};
-
-/**
- * Adds an item at the tail of the list.
- * @param item {*} The item to add.
- * @return {void}
- */
-DoubleLinkedList.prototype.pushBack = function (item) {
-	var node = new DLLNode(item);
-	node.previous = this.last;
-	this.last = node;
-	//link the previous node to the new node
-	if (node.previous)
-		node.previous.next = node;
-	else
-		this.first = node;
-	this.length++;
-};
-
-/**
- * Removes the first item of the list.
- * @return {*} The item removed. It's undefined if the list is empty.
- */
-DoubleLinkedList.prototype.popFront = function () {
-	if (this.length) {
-		var node = this.first;
-		this.first = node.next;
-		if (node.next)
-			node.next.previous = null;
-		this.length--;
-		node.next = null;
-		return node.item;
-	}
-	return undefined;
-};
-
-/**
- * Removes the last item of the list.
- * @return {*} The item removed. It's undefined if the list is empty.
- */
-DoubleLinkedList.prototype.popBack = function () {
-	if (this.length) {
-		var node = this.last;
-		this.last = node.previous;
-		if (node.previous)
-			node.previous.next = null;
-		this.length--;
-		node.previous = null;
-		return node.item;
-	}
-	return undefined;
-};
-
-/**
- * Removes the first times items of the list.
- * @param times {number} The number of times to repeat the popFront method.
- * @return {*} The item removed. It's undefined if the list is empty.
- */
-DoubleLinkedList.prototype.multiPopFront = function (times) {
-	var result = [];
-	for (var i = 0; i < times && this.length; i++)
-		result.push(this.popFront());
-	return result;
-};
-
-/**
- * Removes the last times items of the list.
- * @param times {number} The number of times to repeat the popBack method.
- * @return {*} The items removed.
- */
-DoubleLinkedList.prototype.multiPopBack = function (times) {
-	var result = [];
-	for (var i = 0; i < times && this.length; i++)
-		result.push(this.popBack());
-	return result;
-};
-
-/**
- * Returns the first item of the list without remove it.
- * @return {*} The item at the top of the list. It's undefined if the list is empty.
- */
-DoubleLinkedList.prototype.peek = function () {
-	if (!this.length)
-		return undefined;
-	return this.first.item;
-};
-
-/**
- * Adds the item at the index position.
- * @param item {*} The item to add.
- * @param index {number} The position where to add the item. If index is negative, the item won't be added.
- * @return {void}
- */
-DoubleLinkedList.prototype.addAt = function (item, index) {
-	if (index < 0)
-		return;
-	if (!index) {
-		this.pushFront(item);
-		return;
-	}
-	if (index === this.length) {
-		this.pushBack(item);
-		return;
-	}
-	var node = this.first;
-	if (!node && index > 0)
-		this.pushBack(undefined);
-	for (var i = 0; i < index - 1; i++, node = node.next) {
-		if (node === this.last)
-			this.pushBack(undefined);
-	}
-	if (node === this.last)
-		this.pushBack(item);
-	else if (node === this.first)
-		this.pushFront(item);
-	else {
-		var newNode = new DLLNode(item);
-		newNode.next = node.next;
-		newNode.previous = node;
-		node.next = newNode;
-		if (newNode.next)
-			newNode.next.previous = newNode;
-		this.length++;
-	}
-};
-
-/**
- * Removes the item at the position index.
- * @param index {Number} The position of the item to remove.
- * @return {*} The item stored at the position index. It's undefined if the index is out of bounds.
- */
-DoubleLinkedList.prototype.removeAt = function (index) {
-	if (index < 0 || index > this.length - 1)
-		return undefined;
-	if (index === 0)
-		return this.popFront();
-	if (index === this.length - 1)
-		return this.popBack();
-	var node = this.first;
-	for (; index > 0; index--)
-		node = node.next;
-	//now node is the node to remove
-	node.previous.next = node.next;
-	node.next.previous = node.previous;
-	node.next = null;
-	node.previous = null;
-	this.length--;
-	return node.item;
-};
-
-/**
- * Removes the item from the list.
- * @param item {*} The item to remove.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {void}
- */
-DoubleLinkedList.prototype.remove = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var node = this.first;
-	var previous = null;
-	while (node) {
-		if (callback(node.item)) {
-			if (node === this.first)
-				this.first = node.next;
-			if (node === this.last)
-				this.last = previous;
-			if (previous) {
-				previous.next = node.next;
-				if (node.next)
-					node.next.previous = previous;
-			}
-			return;
-		}
-		previous = node;
-		node = node.next;
-	}
-};
-
-/**
- * Removes all the item from the list.
- * @param item {*} The item to remove.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {void}
- */
-DoubleLinkedList.prototype.removeAll = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var node = this.first;
-	var previous = null;
-	while (node) {
-		if (callback(node.item)) {
-			if (node === this.first)
-				this.first = node.next;
-			if (node === this.last)
-				this.last = previous;
-			if (previous) {
-				previous.next = node.next;
-				if (node.next)
-					node.next.previous = previous;
-			}
-		} else
-			previous = node;
-		node = node.next;
-	}
-};
-
-/**
- * Removes all the items stored from the from position to the to position.
- * If from > to, the method will remove all the items up to the end.
- * @param from {number} The position where start to remove the items. The from position is included.
- * @param to {number} The position where stop to remove the items. The to position is included.
- * @return {Array<*>} The items removed.
- */
-DoubleLinkedList.prototype.removeSegment = function (from, to) {
-	var result = [];
-	if (to > -1 && from < this.length) {
-		if (from === 0)
-			return this.multiPopFront(to + 1);
-		if (to === this.length - 1 || from > to)
-			return this.multiPopBack(Math.max(to - from, this.length - from)).reverse();
-		var node = this.first;
-		for (var i = 0; i < from - 1; i++)
-			node = node.next;
-		//now node is the node before the node to remove
-		//node to remove
-		var next = node.next;
-		for (var j = from; j < to + 1 && j < this.length; j++) {
-			result.push(next.item);
-			next = next.next;
-		}
-		this.length -= Math.min(to - from + 1, this.length - from);
-		node.next = next;
-		next.previous = node;
-	}
-	return result;
-};
-
-/**
- * Changes the item stored in the index position. If the index is out of bound, the node won't be updated.
- * @param index {number} The position of the node to modify.
- * @param item {*} The new item stored in the node.
- * @return {void}
- */
-DoubleLinkedList.prototype.modifyAt = function (index, item) {
-	var node = this.getNode(index);
-	if (node)
-		node.item = item;
-};
-
-/**
- * Removes all the items stored in the list.
- * @return {void}
- */
-DoubleLinkedList.prototype.clear = function () {
-	this.first = null;
-	this.last = null;
-	this.length = 0;
-};
-
-/**
- * Checks if the list contains an item that satisfy the condition represented by the callback function.
- * @param item {*} The item to find.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {boolean} True if the list contains the item that satisfy the condition, false otherwise.
- */
-DoubleLinkedList.prototype.contains = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0;
-	var node = this.first;
-	while (i < this.length && !callback(node.item)) {
-		i++;
-		node = node.next;
-	}
-	return i < this.length;
-};
-
-/**
- * Executes the callback function for each item of the stack.
- * This method modifies the list so if you don't need to modify it you must return the same item of the array.
- * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
- * @return {void}
- */
-DoubleLinkedList.prototype.execute = function (callback) {
-	var node = this.first;
-	while (node) {
-		node.item = callback(node.item);
-		node = node.next;
-	}
-};
-
-/**
- * Deletes the node from the list.
- * @param node {DLLNode} The node to delete.
- * @return {void}
- */
-DoubleLinkedList.prototype.deleteNode = function (node) {
-	if (node === this.first) {
-		this.popFront();
-		return;
-	}
-	if (node === this.last) {
-		this.popBack();
-		return;
-	}
-	node.previous.next = node.next;
-	node.next.previous = node.previous;
-	this.length--;
-};
-
-/**
- * Gets the node at the position index relative from the node.
- * @param index {Number} The index, relative to the node, of the node to return.
- * @param [node = first] {DLLNode} The node from which start the search.
- * @return {DLLNode} The node at the position index.
- */
-DoubleLinkedList.prototype.getNode = function (index, node) {
-	if (index < 0 || index > this.length - 1)
-		return undefined;
-	var m = Math.floor(this.length / 2);
-	//if the index is less than the middle, the search start from the head of the list, otherwise from the tail of the list
-	if (index < m || node) {
-		node = node || this.first;
-		for (; index > 0; index--)
-			node = node.next;
-	} else
-		for (index = this.length - index - 1, node = this.last; index > 0; index--)
-			node = node.previous;
-	return node;
-};
-
-/**
- * Gets the item at the position index.
- * @param index {Number} The position of the item.
- * @return {*}. It's undefined if index isn't in the queue bounds.
- */
-DoubleLinkedList.prototype.getItem = function (index) {
-	if (index < 0 || index > this.length - 1)
-		return undefined;
-	var node;
-	var m = Math.floor(this.length / 2);
-	if (index < m) //if the index is less than the middle, the search start from the head of the list, otherwise from the tail of the list
-		for (node = this.first; index > 0; index--)
-			node = node.next;
-	else
-		for (index = this.length - index - 1, node = this.last; index > 0; index--)
-			node = node.previous;
-	return node.item;
-};
-
-/**
- * Sorts the list using web workers.
- * Using this method is discouraged. Many web browser set a limit to the maximum number of workers instantiated.
- * The items of the list, due to web workers implementation, will be serialized so they will lost own methods.
- * @return {void}
- */
-DoubleLinkedList.prototype.parallelSort = function () {
-
-	var workers = [];
-	var _array = this.toArray();
-	console.log(_array);
-
-	function partialSort(_from, _to, _id) {
-		if (_from < _to) {
-			var m = Math.floor((_from + _to) / 2);
-			var workerLeft = new Worker("DoubleLinkedList/WorkerSort.js");
-			var workerRight = new Worker("DoubleLinkedList/WorkerSort.js");
-			workers.push(workerLeft);
-			workers.push(workerRight);
-			var length = workers.length;
-			workerLeft.postMessage({cmd: 'start', from: _from, to: m, worker: _id});
-			workerRight.postMessage({cmd: 'start', from: m + 1, to: _to, worker: _id});
-			partialSort(_from, m, length - 2);
-			partialSort(m + 1, _to, length - 1);
-			workerLeft.onmessage = function (event) {
-				var data = event.data;
-				switch (data.cmd) {
-					case 'finished':
-						workers[data.worker].postMessage({cmd: 'finished', array: _array});
-						break;
-					case 'replace':
-						_array[data.index] = data.value;
-						break;
-				}
-			};
-			workerRight.onmessage = function (event) {
-				var data = event.data;
-				switch (data.cmd) {
-					case 'finished':
-						workers[data.worker].postMessage({cmd: 'finished', array: _array});
-						break;
-					case 'replace':
-						_array[data.index] = data.value;
-						break;
-				}
-			}
-		}
-	}
-
-	var outerThis = this;
-
-	var mainWorker = new Worker("DoubleLinkedList/WorkerSort.js");
-	workers.push(mainWorker);
-	mainWorker.postMessage({cmd: 'start', from: 0, to: this.length - 1, worker: -1, array: _array});
-	mainWorker.onmessage = function (event) {
-		var data = event.data;
-		switch (data.cmd) {
-			case 'finished':
-				outerThis.fromArray(_array);
-				console.log(outerThis);
-				break;
-			case 'replace':
-				_array[data.index] = data.value;
-		}
-	};
-	partialSort(0, this.length - 1, 0);
-};
-
-/**
- * Sorts the list.
- * @param [callback = function(item){return(item);}] {function} The function invoked in order to get the value for the evaluation of the sort criteria.
- * @example
- * callback = function(item) {return -item.key;}
- * This function callback will return the opposite of the attribute key of the item. In this case the list will be sorted in descending order.
- * @return {void}
- */
-DoubleLinkedList.prototype.sort = function (callback) {
-
-	if (!callback)
-		callback = function (item) {
-			return item;
-		};
-
-	var outerThis = this;
-
-	function partialSort(from, to, fromNode, toNode) {
-		if (from < to) {
-			var m = Math.floor((from + to) / 2);
-			var mNode = outerThis.getNode(m - from, fromNode);
-			partialSort(from, m, fromNode, mNode);
-			partialSort(m + 1, to, mNode.next, toNode);
-			merge(from, m, to, fromNode);
-		}
-	}
-
-	function merge(from, m, to, fromNode) {
-		var left = [];
-		var right = [];
-		var node = fromNode;
-		for (var i = 0; i < m - from + 1; i++, node = node.next)
-			left[i] = node.item;
-		for (var j = 0; j < to - m; j++, node = node.next)
-			right[j] = node.item;
-		var x = 0, y = 0;
-		for (var k = from; k < to + 1; k++, fromNode = fromNode.next) {
-			if (y > to - m - 1 || (callback(left[x]) <= callback(right[y]) && x < m - from + 1)) {
-				fromNode.item = left[x];
-				x++;
-			} else {
-				fromNode.item = right[y];
-				y++;
-			}
-		}
-	}
-
-	partialSort(0, this.length - 1, this.first, this.last);
-};
-
-/**
- * Transforms the list into an array.
- * @return {Array<*>} The array built.
- */
-DoubleLinkedList.prototype.toArray = function () {
-	var array = [];
-	for (var node = this.first, i = 0; node; node = node.next, i++)
-		array[i] = node.item;
-	return array;
-};
-
-/**
- * Returns the length of the list.
- * @return {Number} The length of the list.
- */
-DoubleLinkedList.prototype.getLength = function () {
-	return this.length;
-};
-
-/**
- * Builds the list from the array.
- * @param array {Array<*>} The array from which build the list.
- * @return {void}
- */
-DoubleLinkedList.prototype.fromArray = function (array) {
-	var node = this.first;
-	for (var i = 0; i < Math.min(this.length, array.length); i++, node = node.next)
-		node.item = array[i];
-	if (this.length < array.length)
-		for (var j = this.length; j < array.length; j++)
-			this.pushBack(array[j]);
-	else
-		for (var k = array.length; k < this.length;)
-			this.popBack();
-};
-
-/**
- * Returns the items that satisfy the condition determined by the callback.
- * @param callback {function} The function that implements the condition.
- * @return {Array<Object>} The array that contains the items that satisfy the condition.
- */
-DoubleLinkedList.prototype.filter = function (callback) {
-	var result = [];
-	for (var node = this.first; node; node = node.next) {
-		if (callback(node.item))
-			result.push(node.item);
-	}
-	return result;
-};
-
-/**
- * Reverses the list. This method reverses only the items, not the nodes.
- * @return {void}
- */
-DoubleLinkedList.prototype.reverse = function () {
-	for (var start = this.first, end = this.last; start !== end && start.previous !== end; start = start.next, end = end.previous) {
-		var item = start.item;
-		start.item = end.item;
-		end.item = item;
-	}
-};
-
-/**
- * Checks if the list is empty.
- * @return {boolean} True if the list is empty, false otherwise.
- */
-DoubleLinkedList.prototype.isEmpty = function () {
-	return !this.length;
-};
-
-/**
- * Returns the first position of the item in the list.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The first position of the item.
- */
-DoubleLinkedList.prototype.indexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0;
-	var node = this.first;
-	while (node) {
-		if (callback(node.item))
-			return i;
-		i++;
-		node = node.next;
-	}
-	return -1;
-};
-
-/**
- * Returns the last position of the item in the list.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The last position of the item.
- */
-DoubleLinkedList.prototype.lastIndexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = this.length - 1;
-	var node = this.last;
-	while (node) {
-		if (callback(node.item))
-			return i;
-		i--;
-		node = node.previous;
-	}
-	return -1;
-};
-
-/**
- * Returns all the position in which the item has been found in the list.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {Array<number>} The positions in which the item has been found.
- */
-DoubleLinkedList.prototype.allIndexesOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0;
-	var node = this.first;
-	var indexes = [];
-	while (node) {
-		if (callback(node.item))
-			indexes.push(i);
-		i++;
-		node = node.next;
-	}
-	return indexes;
-};
-
-/**
- * Adds the list at the end of this list.
- * @param list {DoubleLinkedList} The list to join.
- * @return {void}
- */
-DoubleLinkedList.prototype.join = function (list) {
-	if (this.last)
-		this.last.next = list.first;
-	else
-		this.first = list.first;
-	if (list.first)
-		list.first.previous = this.last;
-	this.last = list.last;
-	this.length += list.length;
-};
-
-/**
- * Divides the list at the index position. The node at the index position is the first new node of the list.
- * @param index {number} The position where to divide the list.
- * @return {DoubleLinkedList} The list formed by the nodes from the index position then. If the index is out of bound, the list will be empty.
- */
-DoubleLinkedList.prototype.divide = function (index) {
-	var list = new DoubleLinkedList();
-	if (index > -1 && index < this.length) {
-		var node = this.first;
-		var previous = null;
-		for (var i = 0; i < index; i++) {
-			previous = node;
-			node = node.next;
-		}
-		if (node === this.first) {
-			list.first = this.first;
-			list.last = this.last;
-			this.first = null;
-			this.last = null;
-		} else {
-			list.first = node;
-			list.last = this.last;
-			this.last = previous;
-			previous.next = null;
-			node.previous = null;
-		}
-		list.length = this.length - index;
-		this.length = index;
-	}
-	return list;
-};
-
-/**
- * Clones the list into a new list.
- * @return {DoubleLinkedList} The list cloned from this list.
- */
-DoubleLinkedList.prototype.clone = function () {
-	var list = new DoubleLinkedList();
-	var node = this.first;
-	for (var i = 0; i < this.length; i++, node = node.next)
-		if (node.item.clone)
-			list.pushBack(node.item.clone());
-		else
-			list.pushBack(node.item);
-	return list;
-};
-
-/**
- * Clones the list into a new list without cloning duplicated items.
- * @return {DoubleLinkedList} The list cloned from this list.
- */
-DoubleLinkedList.prototype.cloneDistinct = function () {
-	var list = new DoubleLinkedList();
-	var node = this.first;
-	for (var i = 0; i < this.length; i++, node = node.next)
-		if (!list.contains(node.item))
-			if (node.item.cloneDistinct)
-				list.pushBack(node.item.cloneDistinct());
-			else if (node.item.clone)
-				list.pushBack(node.item.clone());
-			else
-				list.pushBack(node.item);
-	return list;
-};
-
-/**
- * Splits the list into lists of desired size.
- * @param size {number} The size of the lists.
- * @return {Array<DoubleLinkedList>} The lists created by splitting the list.
- */
-DoubleLinkedList.prototype.split = function (size) {
-	var length = this.length;
-	var lists = [this];
-	for (var i = size; i < length; i += size)
-		lists.push(lists[lists.length - 1].divide(size));
-	return lists;
-};
-
-/**
- * Returns the number of items that satisfy the represented by the callback function.
- * @param callback {function} The condition to satisfy.
- * @return {number} The number of items that satisfy the condition.
- */
-DoubleLinkedList.prototype.count = function (callback) {
-	var count = 0;
-	var node = this.first;
-	while (node) {
-		if (callback(node.item))
-			count++;
-		node = node.next;
-	}
-	return count;
-};
-
-/**
- * Class that implements the iterator for a double linked list.
- * @param aggregate {DoubleLinkedList} The aggregate to scan.
- * @constructor
- */
-function DoubleLinkedListIterator(aggregate) {
-	/**
-	 * The aggregate relates to this iterator.
-	 * @type {DoubleLinkedList}
-	 */
-	this.aggregate = aggregate;
-
-	/**
-	 * The pointer to the position.
-	 * @type {Node|null}
-	 */
-	this.pointer = null;
-}
-
-/**
- * Moves the iterator to the first position of the aggregate.
- * @return {void}
- */
-DoubleLinkedListIterator.prototype.first = function () {
-	this.pointer = this.aggregate.first;
-};
-
-/**
- * Moves the iterator to the next item.
- * @return {void}
- */
-DoubleLinkedListIterator.prototype.next = function () {
-	this.pointer = this.pointer.next;
-};
-
-/**
- * Moves the iterator to the last position of the aggregate.
- * @return {void}
- */
-DoubleLinkedListIterator.prototype.last = function () {
-	this.pointer = this.aggregate.last;
-};
-
-/**
- * Moves the iterator to the previous item.
- * @return {void}
- */
-DoubleLinkedListIterator.prototype.previous = function () {
-	this.pointer = this.pointer.previous;
-};
-
-/**
- * Checks if the iterator is out of the bounds of the aggregate.
- * @return {boolean} It return true if the iterator is out of the bounds of the aggregate, otherwise false.
- */
-DoubleLinkedListIterator.prototype.isDone = function () {
-	return !this.pointer;
-};
-
-/**
- * Returns the item stored at the position pointed by the iterator.
- * @abstract
- * @return {*} The item stored or undefined if it's out of the bounds.
- */
-DoubleLinkedListIterator.prototype.getItem = function () {
-	return this.pointer.item;
-};
-
-/**
- * Returns the node stored at the position pointed by the iterator.
- * @abstract
- * @return {DLLNode|null} The node stored or null if it's out of the bounds.
- */
-DoubleLinkedListIterator.prototype.getNode = function () {
-	return this.pointer;
-};
-
-/**
- * Class for managing an hash table.
- * @param size {number} The size of the table.
- * @constructor
- */
-function HashTable(size) {
-	/**
-	 * The size of the table
-	 * @type {number}
-	 */
-	this.size = size;
-
-	this.p = 1000;
-
-	this.a = Math.floor(Math.random() * this.p);
-
-	this.b = Math.floor(Math.random() * this.p);
-
-	/**
-	 * Calculate the hash of the param key.
-	 * @param key {number} The key to hash.
-	 * @return {number} The hash of the key.
-	 */
-	this.hash = function (key) {
-		return ((this.a * key + this.b) % this.p) % this.size;
-	};
-
-	/**
-	 * The items stored in the hash table.
-	 * @type {Array<DoubleLinkedList>}
-	 */
-	this.items = [];
-
-	/**
-	 * The number of keys stored in the hash table.
-	 * @type {number}
-	 */
-	this.keyLength = 0;
-
-	this.clear();
-}
-
-/**
- * Stores the item with its key.
- * @param key {number} The key relatives to the item.
- * @param item {*} The item to store.
- */
-HashTable.prototype.insert = function (key, item) {
-	this.keyLength++;
-	this.items[this.hash(key)].pushBack({key: key, item: item});
-};
-
-/**
- * Deletes the first item relatives to the key value.
- * @param key {number} The key to delete.
- * @return {void}
- */
-HashTable.prototype.deleteKey = function (key) {
-	var list = this.items[this.hash(key)];
-	var it = list.getIterator();
-	for (it.first(); !it.isDone() && it.getItem().key !== key;)
-		it.next();
-	if (!it.isDone()) {
-		list.deleteNode(it.getNode());
-		this.keyLength--;
-	}
-};
-
-/**
- * Deletes all the items relative to the key value.
- * @param key {number} The key to delete.
- * @return {void}
- */
-HashTable.prototype.deleteAllKey = function (key) {
-	var list = this.items[this.hash(key)];
-	var it = list.getIterator();
-	var keysRemoved = 0;
-	for (it.first(); !it.isDone(); it.next())
-		if (it.getItem().key === key) {
-			list.deleteNode(it.getNode());
-			keysRemoved++;
-		}
-	this.keyLength -= keysRemoved;
-};
-
-/**
- * Searches the item relative to the key value.
- * @param key {number} The key of the item to search.
- * @return {*|undefined} The item found or undefined if the key does not exist.
- */
-HashTable.prototype.search = function (key) {
-	var list = this.items[this.hash(key)];
-	var it = list.getIterator();
-	for (it.first(); !it.isDone(); it.next())
-		if (it.getItem().key === key)
-			return it.getItem().item;
-	return undefined;
-};
-
-/**
- * Checks if the hash table contains a key that satisfy the condition represented by the callback function.
- * @param key {number} The key to find.
- * @param [callback = function(k){return(k===key);}] The condition to satisfy. The callback must accept the current key to check.
- * @return {boolean} True if the hash table contains the key that satisfy the condition, false otherwise.
- */
-HashTable.prototype.containsKey = function (key, callback) {
-	callback = callback || function (k) {
-		return k === key;
-	};
-	var list = this.items[this.hash(key)];
-	var it = list.getIterator();
-	for (it.first(); !it.isDone(); it.next())
-		if (callback(it.getItem().key))
-			return true;
-	return false;
-};
-
-/**
- * Searches all the items relative to the key value.
- * @param key {number} The key of the items to search.
- * @return {Array.<*>} An array with the items found.
- */
-HashTable.prototype.searchAll = function (key) {
-	var list = this.items[this.hash(key)];
-	var it = list.getIterator();
-	var array = [];
-	for (it.first(); !it.isDone(); it.next())
-		if (it.getItem().key === key)
-			array.push(it.getItem().item);
-	return array;
-};
-
-/**
- * Returns the keys stored in the hash table.
- * @return {Array<number>} The keys stored in the table.
- */
-HashTable.prototype.getKeys = function () {
-	var keys = [];
-	for (var i = 0; i < this.size; i++) {
-		var it = this.items[i].getIterator();
-		for (it.first(); !it.isDone(); it.next())
-			keys.push(it.getItem().key);
-	}
-	return keys;
-};
-
-/**
- * Returns the items stored in the hash table.
- * @return {Array<*>} The items stored in the table.
- */
-HashTable.prototype.getItems = function () {
-	var items = [];
-	for (var i = 0; i < this.size; i++) {
-		var it = this.items[i].getIterator();
-		for (it.first(); !it.isDone(); it.next())
-			items.push(it.getItem().item);
-	}
-	return items;
-};
-
-/**
- * Removes all the keys and the items stored in the hash table.
- * @return {void}
- */
-HashTable.prototype.clear = function () {
-	this.items = [];
-	for (var i = 0; i < this.size; i++)
-		this.items[i] = new DoubleLinkedList();
-	this.keyLength = 0;
-};
-
-/**
- * Returns the number of keys stored in the hash table.
- * @return {number} The number of keys stored.
- */
-HashTable.prototype.getNumberOfKeys = function () {
-	return this.keyLength;
-};
-
-/**
- * Checks if the hash table is empty.
- * @return {boolean} True if the hash table is empty, false otherwise.
- */
-HashTable.prototype.isEmpty = function () {
-	return !this.keyLength;
-};
-
-/**
- * Executes the callback function for each item of the hash table.
- * This method modifies the hash table so if you don't need to modify it you must return the same item stored.
- * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
- * @return {void}
- */
-HashTable.prototype.execute = function (callback) {
-	for (var i = 0; i < this.size; i++)
-		this.items[i].execute(callback);
-};
-
-/**
- * Returns the items that satisfy the condition determined by the callback.
- * @param callback {function} The function that implements the condition.
- * @return {Array<*>} The array that contains the items that satisfy the condition.
- */
-HashTable.prototype.filter = function (callback) {
-	var result = [];
-	for (var i = 0; i < this.size; i++)
-		result.concat(this.items[i].filter(callback));
-	return result;
-};
-
-/**
- * Returns the size of the hash table.
- * @return {number} The size of the hash table.
- */
-HashTable.prototype.getSize = function () {
-	return this.size;
-};
-
-/**
- * Clones the hash table into a new hash table.
- * @return {HashTable} The hash table cloned from this hash table.
- */
-HashTable.prototype.clone = function () {
-	var table = new HashTable(this.size);
-	for (var i = 0; i < this.size; i++)
-		for (var node = this.items[i].first; node; node = node.next)
-			table.insert(node.key, node.item);
-	return table;
-};
-
-/**
- * Class for managing a linked list.
- * @param {...*} [args] The items for initializing the list.
- * @constructor
- */
-function LinkedList(args) {
-	/**
-	 * The first node of the list.
-	 * @type {LLNode|null}
-	 */
-	this.first = null;
-	/**
-	 * The last node of the list.
-	 * @type {LLNode|null}
-	 */
-	this.last = null;
-	/**
-	 * The length of the list.
-	 * @type {number}
-	 */
-	this.length = 0;
-	//builds the list from the parameters of the constructor
-	this.fromArray(arguments);
-}
-
-/**
- * Returns the iterator relative to the aggregate.
- * @return {Iterator} The iterator.
- */
-LinkedList.prototype.getIterator = function () {
-	return new LinkedListIterator(this);
-};
-
-/**
- * Adds an item at the head of the list.
- * @param item {*} The item to add.
- * @return {void}
- */
-LinkedList.prototype.pushFront = function (item) {
-	var node = new LLNode(item);
-	node.next = this.first;
-	this.first = node;
-	if (!this.last)
-		this.last = node;
-	this.length++;
-};
-
-/**
- * Adds an item at the tail of the list.
- * @param item {*} The item to add.
- * @return {void}
- */
-LinkedList.prototype.pushBack = function (item) {
-	var node = new LLNode(item);
-	if (this.last)
-		this.last.next = node;
-	else
-		this.first = node;
-	this.last = node;
-	this.length++;
-};
-
-/**
- * Removes the first item of the list.
- * @return {*} The item removed. It's undefined if the list is empty.
- */
-LinkedList.prototype.popFront = function () {
-	if (this.length) {
-		var node = this.first;
-		this.first = this.first.next;
-		this.length--;
-		node.next = null;
-		return node.item;
-	}
-	return undefined;
-};
-
-/**
- * Removes the last item of the list.
- * @return {*} The item removed. It's undefined if the list is empty.
- */
-LinkedList.prototype.popBack = function () {
-	if (this.length) {
-		var node = this.last;
-		var next = this.first;
-		while (next.next && next.next.next) {
-			next = next.next;
-		}
-		if (node === next)
-			this.last = null;
-		else
-			this.last = next;
-		next.next = null;
-		this.length--;
-		return node.item;
-	}
-	return undefined;
-};
-
-/**
- * Removes the first times items of the list.
- * @param times {number} The number of times to repeat the popFront method.
- * @return {*} The item removed. It's undefined if the list is empty.
- */
-LinkedList.prototype.multiPopFront = function (times) {
-	var result = [];
-	for (var i = 0; i < times && this.length; i++)
-		result.push(this.popFront());
-	return result;
-};
-
-/**
- * Removes the last times items of the list.
- * @param times {number} The number of times to repeat the popBack method.
- * @return {*} The items removed.
- */
-LinkedList.prototype.multiPopBack = function (times) {
-	var result = [];
-	for (var i = 0; i < times && this.length; i++)
-		result.push(this.popBack());
-	return result;
-};
-
-/**
- * Returns the first item of the list without remove it.
- * @return {*} The item at the top of the list. It's undefined if the list is empty.
- */
-LinkedList.prototype.peek = function () {
-	if (!this.length)
-		return undefined;
-	return this.first.item;
-};
-
-/**
- * Adds the item at the index position.
- * @param item {*} The item to add.
- * @param index {number} The position where to add the item. If index is negative, the item won't be added.
- * @return {void}
- */
-LinkedList.prototype.addAt = function (item, index) {
-	if (index < 0)
-		return;
-	if (!index) {
-		this.pushFront(item);
-		return;
-	}
-	if (index === this.length) {
-		this.pushBack(item);
-		return;
-	}
-	var node = this.first;
-	if (!node && index > 0)
-		this.pushBack(undefined);
-	for (var i = 0; i < index - 1; i++, node = node.next) {
-		if (node === this.last)
-			this.pushBack(undefined);
-	}
-	if (node === this.last)
-		this.pushBack(item);
-	else if (node === this.first)
-		this.pushFront(item);
-	else {
-		var newNode = new LLNode(item);
-		newNode.next = node.next;
-		node.next = newNode;
-		this.length++;
-	}
-};
-
-/**
- * Removes the item at the index position.
- * @param index {number} The position of the item to remove.
- * @return {*} The item stored at the position index. It's undefined if the index is out of bounds.
- */
-LinkedList.prototype.removeAt = function (index) {
-	if (index < 0 || index > this.length - 1)
-		return undefined;
-	if (index === 0)
-		return this.popFront();
-	if (index === this.length - 1)
-		return this.popBack();
-	var node = this.first;
-	for (; index > 1; index--)
-		node = node.next;
-	//now node is the node before the node to remove
-	//node to remove
-	var next = node.next;
-	node.next = next.next;
-	this.length--;
-	return next.item;
-};
-
-/**
- * Removes the item from the list.
- * @param item {*} The item to remove.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {void}
- */
-LinkedList.prototype.remove = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var node = this.first;
-	var previous = null;
-	while (node) {
-		if (callback(node.item)) {
-			if (node === this.first)
-				this.first = node.next;
-			if (node === this.last)
-				this.last = previous;
-			if (previous)
-				previous.next = node.next;
-			return;
-		}
-		previous = node;
-		node = node.next;
-	}
-};
-
-/**
- * Removes all the item from the list.
- * @param item {*} The item to remove.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {void}
- */
-LinkedList.prototype.removeAll = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var node = this.first;
-	var previous = null;
-	while (node) {
-		if (callback(node.item)) {
-			if (node === this.first)
-				this.first = node.next;
-			if (node === this.last)
-				this.last = previous;
-			if (previous)
-				previous.next = node.next;
-		} else
-			previous = node;
-		node = node.next;
-	}
-};
-
-/**
- * Removes all the items stored from the from position to the to position.
- * If from > to, the method will remove all the items up to the end.
- * @param from {number} The position where start to remove the items. The from position is included.
- * @param to {number} The position where stop to remove the items. The to position is included.
- * @return {Array<*>} The items removed.
- */
-LinkedList.prototype.removeSegment = function (from, to) {
-	var result = [];
-	if (to > -1 && from < this.length) {
-		if (from === 0)
-			return this.multiPopFront(to + 1);
-		if (to === this.length - 1 || from > to)
-			return this.multiPopBack(Math.max(to - from, this.length - from)).reverse();
-		var node = this.first;
-		for (var i = 0; i < from - 1; i++)
-			node = node.next;
-		//now node is the node before the node to remove
-		//node to remove
-		var next = node.next;
-		for (var j = from; j < to + 1 && j < this.length; j++) {
-			result.push(next.item);
-			next = next.next;
-		}
-		this.length -= Math.min(to - from + 1, this.length - from);
-		node.next = next;
-	}
-	return result;
-};
-
-/**
- * Changes the item stored in the index position. If the index is out of bound, the node won't be updated.
- * @param index {number} The position of the node to modify.
- * @param item {*} The new item stored in the node.
- * @return {void}
- */
-LinkedList.prototype.modifyAt = function (index, item) {
-	var node = this.getNode(index);
-	if (node)
-		node.item = item;
-};
-
-/**
- * Removes all the items stored in the list.
- * @return {void}
- */
-LinkedList.prototype.clear = function () {
-	this.first = null;
-	this.last = null;
-	this.length = 0;
-};
-
-/**
- * Checks if the list contains an item that satisfy the condition represented by the callback function.
- * @param item {*} The item to find.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {boolean} True if the list contains the item that satisfy the condition, false otherwise.
- */
-LinkedList.prototype.contains = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0;
-	var node = this.first;
-	while (i < this.length && !callback(node.item)) {
-		i++;
-		node = node.next;
-	}
-	return i < this.length;
-};
-
-/**
- * Executes the callback function for each item of the stack.
- * This method modifies the list so if you don't need to modify it you must return the same item of the array.
- * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
- * @return {void}
- */
-LinkedList.prototype.execute = function (callback) {
-	var node = this.first;
-	while (node) {
-		node.item = callback(node.item);
-		node = node.next;
-	}
-};
-
-/**
- * Returns the node at the position index.
- * @param index {number} The position of the node.
- * @return {LLNode} The node stored at the position index. It's undefined if index isn't in the list bounds.
- */
-LinkedList.prototype.getNode = function (index) {
-	if (index < 0 || index > this.length - 1)
-		return undefined;
-	var node = this.first;
-	for (; index > 0; index--)
-		node = node.next;
-	return node;
-};
-
-/**
- * Returns the item at the position index.
- * @param index {number} The position of the item.
- * @return {*} The item stored at the position index. It's undefined if index isn't in the list bounds.
- */
-LinkedList.prototype.getItem = function (index) {
-	if (index < 0 || index > this.length - 1)
-		return undefined;
-	var node = this.first;
-	for (; index > 0; index--)
-		node = node.next;
-	return node.item;
-};
-
-/**
- * Transforms the list into an array.
- * @return {Array<*>} The array built.
- */
-LinkedList.prototype.toArray = function () {
-	var array = [];
-	for (var node = this.first, i = 0; node; node = node.next, i++)
-		array[i] = node.item;
-	return array;
-};
-
-/**
- * Returns the length of the list.
- * @return {Number} The length of the list.
- */
-LinkedList.prototype.getLength = function () {
-	return this.length;
-};
-
-/**
- * Builds the list from the array.
- * @param array {Array<*>} The array from which build the list.
- * @return {void}
- */
-LinkedList.prototype.fromArray = function (array) {
-	var node = this.first;
-	for (var i = 0; i < Math.min(this.length, array.length); i++, node = node.next)
-		node.item = array[i];
-	if (this.length < array.length)
-		for (var j = this.length; j < array.length; j++)
-			this.pushBack(array[j]);
-	else
-		for (var k = array.length; k < this.length;)
-			this.popBack();
-};
-
-/**
- * Returns the items that satisfy the condition determined by the callback.
- * @param callback {function} The function that implements the condition.
- * @return {Array<*>} The array that contains the items that satisfy the condition.
- */
-LinkedList.prototype.filter = function (callback) {
-	var result = [];
-	for (var node = this.first; node; node = node.next) {
-		if (callback(node.item))
-			result.push(node.item);
-	}
-	return result;
-};
-
-/**
- * Checks if the list is empty.
- * @return {boolean} True if the list is empty, false otherwise.
- */
-LinkedList.prototype.isEmpty = function () {
-	return !this.length;
-};
-
-/**
- * Returns the first position of the item in the list.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The first position of the item.
- */
-LinkedList.prototype.indexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0;
-	var node = this.first;
-	while (node) {
-		if (callback(node.item))
-			return i;
-		i++;
-		node = node.next;
-	}
-	return -1;
-};
-
-/**
- * Returns the last position of the item in the list.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The last position of the item.
- */
-LinkedList.prototype.lastIndexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0;
-	var node = this.first;
-	var index = -1;
-	while (node) {
-		if (callback(node.item))
-			index = i;
-		i++;
-		node = node.next;
-	}
-	return index;
-};
-
-/**
- * Returns all the position in which the item has been found in the list.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {Array<number>} The positions in which the item has been found.
- */
-LinkedList.prototype.allIndexesOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0;
-	var node = this.first;
-	var indexes = [];
-	while (node) {
-		if (callback(node.item))
-			indexes.push(i);
-		i++;
-		node = node.next;
-	}
-	return indexes;
-};
-
-/**
- * Joins the list at the end of this list.
- * @param list {LinkedList} The list to join.
- * @return {void}
- */
-LinkedList.prototype.join = function (list) {
-	if (this.last)
-		this.last.next = list.first;
-	else
-		this.first = list.first;
-	this.last = list.last;
-	this.length += list.length;
-};
-
-/**
- * Divides the list at the index position. The node at the index position is the first new node of the list.
- * @param index {number} The position where to divide the list.
- * @return {LinkedList} The list formed by the nodes from the index position then. If the index is out of bound, the list will be empty.
- */
-LinkedList.prototype.divide = function (index) {
-	var list = new LinkedList();
-	if (index > -1 && index < this.length) {
-		var node = this.first;
-		var previous = null;
-		for (var i = 0; i < index; i++) {
-			previous = node;
-			node = node.next;
-		}
-		if (node === this.first) {
-			list.first = this.first;
-			list.last = this.last;
-			this.first = null;
-			this.last = null;
-		} else {
-			list.first = node;
-			list.last = this.last;
-			this.last = previous;
-			previous.next = null;
-		}
-		list.length = this.length - index;
-		this.length = index;
-	}
-	return list;
-};
-
-/**
- * Clones the list into a new list.
- * @return {LinkedList} The list cloned from this list.
- */
-LinkedList.prototype.clone = function () {
-	var list = new LinkedList();
-	var node = this.first;
-	for (var i = 0; i < this.length; i++, node = node.next)
-		if (node.item.clone)
-			list.pushBack(node.item.clone());
-		else
-			list.pushBack(node.item);
-	return list;
-};
-
-/**
- * Clones the list into a new list without cloning duplicated items.
- * @return {LinkedList} The list cloned from this list.
- */
-LinkedList.prototype.cloneDistinct = function () {
-	var list = new LinkedList();
-	var node = this.first;
-	for (var i = 0; i < this.length; i++, node = node.next)
-		if (!list.contains(node.item))
-			if (node.item.cloneDistinct)
-				list.pushBack(node.item.cloneDistinct());
-			else if (node.item.clone)
-				list.pushBack(node.item.clone());
-			else
-				list.pushBack(node.item);
-	return list;
-};
-
-/**
- * Splits the list into lists of desired size.
- * @param size {number} The size of the lists.
- * @return {Array<LinkedList>} The lists created by splitting the list.
- */
-LinkedList.prototype.split = function (size) {
-	var length = this.length;
-	var lists = [this];
-	for (var i = size; i < length; i += size)
-		lists.push(lists[lists.length - 1].divide(size));
-	return lists;
-};
-
-/**
- * Returns the number of items that satisfy the represented by the callback function.
- * @param callback {function} The condition to satisfy.
- * @return {number} The number of items that satisfy the condition.
- */
-LinkedList.prototype.count = function (callback) {
-	var count = 0;
-	var node = this.first;
-	while (node) {
-		if (callback(node.item))
-			count++;
-		node = node.next;
-	}
-	return count;
-};
-
-/**
- * Class that implements the iterator for a linked list.
- * @param aggregate {LinkedList} The aggregate to scan.
- * @constructor
- */
-function LinkedListIterator(aggregate) {
-	/**
-	 * The aggregate relates to this iterator.
-	 * @type {LinkedList}
-	 */
-	this.aggregate = aggregate;
-
-	/**
-	 * The pointer to the position.
-	 * @type {Node|null}
-	 */
-	this.pointer = null;
-}
-
-/**
- * Moves the iterator to the first position of the aggregate.
- * @return {void}
- */
-LinkedListIterator.prototype.first = function () {
-	this.pointer = this.aggregate.first;
-};
-
-/**
- * Moves the iterator to the next item.
- * @return {void}
- */
-LinkedListIterator.prototype.next = function () {
-	this.pointer = this.pointer.next;
-};
-
-/**
- * Moves the iterator to the last position of the aggregate.
- * @return {void}
- */
-LinkedListIterator.prototype.last = function () {
-	this.pointer = this.aggregate.last;
-};
-
-/**
- * Moves the iterator to the previous item.
- * @return {void}
- */
-LinkedListIterator.prototype.previous = function () {
-	var node = this.pointer;
-	for (this.pointer = this.first(); this.pointer.next !== node;)
-		this.next();
-};
-
-/**
- * Checks if the iterator is out of the bounds of the aggregate.
- * @return {boolean} It return true if the iterator is out of the bounds of the aggregate, otherwise false.
- */
-LinkedListIterator.prototype.isDone = function () {
-	return !this.pointer;
-};
-
-/**
- * Returns the item stored at the position pointed by the iterator.
- * @return {*} The item stored or undefined if it's out of the bounds.
- */
-LinkedListIterator.prototype.getItem = function () {
-	return this.pointer.item;
-};
-
-/**
- * Returns the node stored at the position pointed by the iterator.
- * @abstract
- * @return {Node|null} The node stored or null if it's out of the bounds.
- */
-LinkedListIterator.prototype.getNode = function () {
-	return this.pointer;
-};
-
-/**
- * Class for managing a priority queue.
- * @constructor
- */
-function PriorityQueue() {
-	/**
-	 * The list of the items in the queue.
-	 * @type {RBTreeList}
-	 */
-	this.items = new RBTreeList();
-	/**
-	 * The length of the queue.
-	 * @type {number}
-	 */
-	this.length = 0;
-}
-
-/**
- * Returns the iterator relative to the aggregate.
- * @return {Iterator} The iterator.
- */
-PriorityQueue.prototype.getIterator = function () {
-	return new PriorityQueueIterator(this);
-};
-
-/**
- * Adds the item at the tail of the queue.
- * @param priority {number} The priority of the item.
- * @param item {*} The item to add.
- * @return {void}
- */
-PriorityQueue.prototype.enqueue = function (priority, item) {
-	var queue = this.items.search(priority);
-	if (!queue) {
-		queue = new Queue();
-		this.items.insert(priority, queue);
-	}
-	queue.enqueue(item);
-	this.length++;
-};
-
-/**
- * Adds the items with the same priority at the tail of the queue.
- * @param priority {number} The priority of the items.
- * @param items {Array<*>} The items to add.
- * @return {void}
- */
-PriorityQueue.prototype.multiEnqueue = function (priority, items) {
-	for (var i = 0; i < items.length; i++)
-		this.enqueue(priority, items[i]);
-};
-
-/**
- * Removes the item at the head of the queue.
- * @return {*} The item at the head of the queue. It's undefined if the queue is empty.
- */
-PriorityQueue.prototype.dequeue = function () {
-	var node = this.items.maximum();
-	var item = undefined;
-	if (node) {
-		var queue = node.item;
-		item = queue.dequeue();
-		if (queue.isEmpty())
-			this.items.deleteNode(node);
-		this.length--;
-	}
-	return item;
-};
-
-/**
- * Removes the items at the head of the queue.
- * @param times {number} The number of times to repeat the dequeue method.
- * @return {Array<*>} The items at the head of the queue.
- */
-PriorityQueue.prototype.multiDequeue = function (times) {
-	var items = [];
-	for (var i = 0; i < times && this.length; i++)
-		items.push(this.dequeue());
-	return items;
-};
-
-/**
- * Removes the first length items from the position index.
- * @param index {number} The position where to start to remove the items.
- * @param [length = 1] {number} The number of items to remove.
- * @return {void}
- */
-PriorityQueue.prototype.remove = function (index, length) {
-	length = length || 1;
-	var it = this.items.getIterator();
-	for (it.last(); !it.isDone() && length > 0; it.previous()) {
-		var queue = it.getItem();
-		if (index > -1 && index < queue.getLength()) {
-			var oldLength = queue.getLength();
-			queue.remove(index, length);
-			length -= oldLength - index;
-			index = 0;
-			if (!queue.getLength())
-				this.items.deleteNode(it.getNode());
-		} else
-			index = index - queue.getLength();
-	}
-};
-
-/**
- * Returns the item at the position index.
- * @param index {number} The index of the item.
- * @return {*} The item found. It's undefined if the position index is out of bounds.
- */
-PriorityQueue.prototype.getItem = function (index) {
-	var it = this.items.getIterator();
-	for (it.last(); !it.isDone(); it.previous()) {
-		var queue = it.getItem();
-		if (index > -1 && index < queue.getLength())
-			return queue.getItem(index);
-		index = index - queue.getLength();
-	}
-	return undefined;
-};
-
-/**
- * Returns the items relatives to the priority.
- * @param priority {number} The priority of the items.
- * @return {Array<*>} The items found.
- */
-PriorityQueue.prototype.getItems = function (priority) {
-	var items = this.items.search(priority);
-	if (items)
-		return items.items;
-	return [];
-};
-
-/**
- * Returns the first item in the queue. The item is not removed.
- * @return {*} The first item. It's undefined if the queue is empty.
- */
-PriorityQueue.prototype.peek = function () {
-	return this.items.maximum().item.peek();
-};
-
-/**
- * Returns the length of the queue.
- * @return {number} The length of the queue.
- */
-PriorityQueue.prototype.getLength = function () {
-	return this.length;
-};
-
-/**
- * Checks if the queue is empty.
- * @return {boolean} True if the queue is empty, false otherwise.
- */
-PriorityQueue.prototype.isEmpty = function () {
-	return !this.length;
-};
-
-/**
- * Removes all the items stored in the queue.
- * @return {void}
- */
-PriorityQueue.prototype.clear = function () {
-	this.items = new RBTreeList();
-	this.length = 0;
-};
-
-/**
- * Checks if the queue contains a priority that satisfy the condition represented by the callback function.
- * @param priority {number} The priority to find.
- * @param [callback = function(p){return(p===priority);}] The condition to satisfy. The callback must accept the current priority to check.
- * @return {boolean} True if the queue contains the priority that satisfy the condition, false otherwise.
- */
-PriorityQueue.prototype.containsPriority = function (priority, callback) {
-	if (callback)
-		return this.items.fullContains(callback);
-	else
-		return this.items.contains(priority);
-};
-
-/**
- * Returns the queue created by the priority queue with the items in the same order but without the priority.
- * @return {Queue} The queue created.
- */
-PriorityQueue.prototype.toQueue = function () {
-	var queue = new Queue();
-	var it = this.items.getIterator();
-	for (it.last(); !it.isDone(); it.previous()) {
-		var item = it.getItem();
-		var itQ = item.getIterator();
-		for (itQ.first(); !itQ.isDone(); itQ.next())
-			queue.enqueue(itQ.getItem());
-	}
-	return queue;
-};
-
-/**
- * Executes the callback function for each item of the queue.
- * This method modifies the queue so if you don't need to modify it you must return the same item of the array.
- * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
- * @return {void}
- */
-PriorityQueue.prototype.execute = function (callback) {
-	var it = this.items.getIterator();
-	for (it.last(); !it.isDone(); it.previous())
-		it.getItem().execute(callback);
-};
-
-/**
- * Changes the priority of the item at the position index.
- * @param index {number} The position of the item of which increase the priority.
- * @param newPriority {number} The new priority.
- * @return {void}
- */
-PriorityQueue.prototype.changePriority = function (index, newPriority) {
-	var item = this.getItem(index);
-	this.remove(index);
-	this.enqueue(newPriority, item);
-};
-
-/**
- * Returns the items that satisfy the condition determined by the callback.
- * @param callback {function} The function that implements the condition.
- * @return {Array<*>} The array that contains the items that satisfy the condition.
- */
-PriorityQueue.prototype.filter = function (callback) {
-	var result = [];
-	var it = this.items.getIterator();
-	for (it.last(); !it.isDone(); it.previous()) {
-		var itQ = it.getItem().getIterator();
-		for (itQ.first(); !itQ.isDone(); itQ.next()) {
-			if (callback(itQ.getItem()))
-				result.push(itQ.getItem());
-		}
-	}
-	return result;
-};
-
-/**
- * Clones the queue into a new queue.
- * @return {PriorityQueue} The queue cloned from this queue.
- */
-PriorityQueue.prototype.clone = function () {
-	var queue = new PriorityQueue();
-	queue.items = this.items.clone();
-	queue.length = this.length;
-	return queue;
-};
-
-/**
- * Clones the queue into a new queue without cloning duplicated items.
- * @return {PriorityQueue} The queue cloned from this queue.
- */
-PriorityQueue.prototype.cloneDistinct = function () {
-	var queue = new PriorityQueue();
-	queue.items = this.items.cloneDistinct();
-	queue.length = queue.items.getSize();
-	return queue;
-};
-
-/**
- * Class that implements the iterator for a priority queue.
- * @param aggregate {PriorityQueue} The aggregate to scan.
- * @constructor
- */
-function PriorityQueueIterator(aggregate) {
-	/**
-	 * The aggregate relates to this iterator.
-	 * @type {PriorityQueue}
-	 */
-	this.aggregate = aggregate;
-
-	/**
-	 * The pointer to the position of the node.
-	 * @type {RBLNode|null}
-	 */
-	this.pointerNode = null;
-	/**
-	 * The pointer to the position in the node.
-	 * @type {number}
-	 */
-	this.pointerPosition = -1;
-}
-
-/**
- * Moves the iterator to the first position of the aggregate.
- * @return {void}
- */
-PriorityQueueIterator.prototype.first = function () {
-	this.pointerNode = this.aggregate.items.maximum();
-	this.pointerPosition = 0;
-};
-
-/**
- * Moves the iterator to the next item.
- * @return {void}
- */
-PriorityQueueIterator.prototype.next = function () {
-	this.pointerPosition++;
-	if (this.pointerPosition > this.pointerNode.item.getLength() - 1) {
-		this.pointerNode = this.pointerNode.previous;
-		this.pointerPosition = 0;
-	}
-};
-
-/**
- * Moves the iterator to the last position of the aggregate.
- * @return {void}
- */
-PriorityQueueIterator.prototype.last = function () {
-	this.pointerNode = this.aggregate.items.minimum();
-	this.pointerPosition = this.pointerNode.item.getLength() - 1;
-};
-
-/**
- * Moves the iterator to the previous item.
- * @return {void}
- */
-PriorityQueueIterator.prototype.previous = function () {
-	this.pointerPosition--;
-	if (this.pointerPosition < 0) {
-		this.pointerNode = this.pointerNode.next;
-		if (this.pointerNode)
-			this.pointerPosition = this.pointerNode.item.getLength() - 1;
-	}
-};
-
-/**
- * Checks if the iterator is out of the bounds of the aggregate.
- * @return {boolean} It return true if the iterator is out of the bounds of the aggregate, otherwise false.
- */
-PriorityQueueIterator.prototype.isDone = function () {
-	return !this.pointerNode;
-};
-
-/**
- * Returns the item stored at the position pointed by the iterator.
- * @return {*} The item stored or undefined if it's out of the bounds.
- */
-PriorityQueueIterator.prototype.getItem = function () {
-	return this.pointerNode.item.items[this.pointerPosition];
-};
-
-/**
- * Class for managing a queue.
- * @param {...*} [args] The items for initializing the queue.
- * @constructor
- */
-function Queue(args) {
-	/**
-	 * The list of the items in the queue.
-	 * @type {Array<*>}
-	 */
-	this.items = [];
-
-	//builds the queue from the parameters of the constructor
-	this.multiEnqueue(arguments);
-}
-
-/**
- * Returns the iterator relative to the aggregate.
- * @return {Iterator} The iterator.
- */
-Queue.prototype.getIterator = function () {
-	return new QueueIterator(this);
-};
-
-/**
- * Adds the item at the tail of the queue.
- * @param item {*} The item to add.
- * @return {void}
- */
-Queue.prototype.enqueue = function (item) {
-	this.items.push(item);
-};
-
-/**
- * Adds the items at the tail of the queue.
- * @param items {Array<*>} The items to add.
- * @return {void}
- */
-Queue.prototype.multiEnqueue = function (items) {
-	for (var i = 0; i < items.length; i++)
-		this.items.push(items[i]);
-};
-
-/**
- * Removes the item at the head of the queue.
- * @return {*} The item at the head of the queue. It's undefined if the queue is empty.
- */
-Queue.prototype.dequeue = function () {
-	if (!this.items.length)
-		return undefined;
-	return this.items.splice(0, 1)[0]; //remove the first item and return it
-};
-
-/**
- * Removes the items at the head of the queue.
- * @param times {number} The number of times to repeat the dequeue method.
- * @return {Array<*>} The items at the head of the queue.
- */
-Queue.prototype.multiDequeue = function (times) {
-	return this.items.splice(0, times); //removes the last times item and returns the array
-};
-
-/**
- * Removes the first length items from the position index.
- * @param index {number} The position where to start to remove the items.
- * @param [length = 1] {number} The number of items to remove.
- * @return {void}
- */
-Queue.prototype.remove = function (index, length) {
-	length = length || 1;
-	this.items.splice(index, length);
-};
-
-/**
- * Returns the item at the position index.
- * @param index {number} The position of the item.
- * @return {*} The item at the position. It's undefined if index isn't in the queue bounds.
- */
-Queue.prototype.getItem = function (index) {
-	if (index < 0 || index > this.items.length - 1)
-		return undefined;
-	return this.items[index];
-};
-
-/**
- * Returns the first item in the queue. The item is not removed.
- * @return {*} The first item. It's undefined if the queue is empty.
- */
-Queue.prototype.peek = function () {
-	if (this.items.length)
-		return this.items[0];
-	return undefined
-};
-
-/**
- * Removes all the items stored in the queue.
- * @return {void}
- */
-Queue.prototype.clear = function () {
-	this.items = [];
-};
-
-/**
- * Checks if the queue contains an item that satisfy the condition represented by the callback function.
- * @param item {*} The item to find.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {boolean} True if the queue contains the item that satisfy the condition, false otherwise.
- */
-Queue.prototype.contains = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0;
-	while (i < this.items.length && !callback(this.items[i]))
-		i++;
-	return i < this.items.length;
-};
-
-/**
- * Executes the callback function for each item of the queue.
- * This method modifies the queue so if you don't need to modify it you must return the same item of the array.
- * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
- * @return {void}
- */
-Queue.prototype.execute = function (callback) {
-	for (var i = 0; i < this.items.length; i++)
-		this.items[i] = callback(this.items[i]);
-};
-
-/**
- * Returns the length of the queue.
- * @return {number} The length of the queue.
- */
-Queue.prototype.getLength = function () {
-	return this.items.length;
-};
-
-/**
- * Checks if the queue is empty.
- * @return {boolean} True if the queue is empty, false otherwise.
- */
-Queue.prototype.isEmpty = function () {
-	return !this.items.length;
-};
-
-/**
- * Returns the items that satisfy the condition determined by the callback.
- * @param callback {function} The function that implements the condition.
- * @return {Array<*>} The array that contains the items that satisfy the condition.
- */
-Queue.prototype.filter = function (callback) {
-	var result = [];
-	for (var i = 0; i < this.items.length; i++)
-		if (callback(this.items[i]))
-			result.push(this.items[i]);
-	return result;
-};
-
-/**
- * Returns the first position of the item in the queue.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The first position of the item.
- */
-Queue.prototype.indexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0;
-	while (i < this.items.length) {
-		if (callback(this.items[i]))
-			return i;
-		i++;
-	}
-	return -1;
-};
-
-/**
- * Returns the last position of the item in the queue.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The last position of the item.
- */
-Queue.prototype.lastIndexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = this.items.length - 1;
-	while (i > -1) {
-		if (callback(this.items[i]))
-			return i;
-		i--;
-	}
-	return -1;
-};
-
-/**
- * Returns all the position in which the item has been found in the queue.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {Array<number>} The positions in which the item has been found.
- */
-Queue.prototype.allIndexesOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0;
-	var indexes = [];
-	while (i < this.items.length) {
-		if (callback(this.items[i]))
-			indexes.push(i);
-		i++;
-	}
-	return indexes;
-};
-
-/**
- * Clones the queue into a new queue.
- * @return {Queue} The queue cloned from this queue.
- */
-Queue.prototype.clone = function () {
-	var queue = new Queue();
-	for (var i = 0; i < this.items.length; i++)
-		if (this.items[i].clone)
-			queue.enqueue(this.items[i].clone());
-		else
-			queue.enqueue(this.items[i]);
-
-	return queue;
-};
-
-/**
- * Clones the queue into a new queue without cloning duplicated items.
- * @return {Queue} The queue cloned from this queue.
- */
-Queue.prototype.cloneDistinct = function () {
-	var queue = new Queue();
-	for (var i = 0; i < this.items.length; i++)
-		if (!queue.contains(this.items[i]))
-			if (this.items[i].cloneDistinct)
-				queue.enqueue(this.items[i].cloneDistinct());
-			else if (this.items[i].clone)
-				queue.enqueue(this.items[i].clone());
-			else
-				queue.enqueue(this.items[i]);
-	return queue;
-};
-
-/**
- * Class that implements the iterator for a linked list.
- * @param aggregate {Queue} The aggregate to scan.
- * @constructor
- */
-function QueueIterator(aggregate) {
-	/**
-	 * The aggregate relates to this iterator.
-	 * @type {Queue}
-	 */
-	this.aggregate = aggregate;
-
-	/**
-	 * The pointer to the position.
-	 * @type {number}
-	 */
-	this.pointer = -1;
-}
-
-/**
- * Moves the iterator to the first position of the aggregate.
- * @return {void}
- */
-QueueIterator.prototype.first = function () {
-	this.pointer = 0;
-};
-
-/**
- * Moves the iterator to the next item.
- * @return {void}
- */
-QueueIterator.prototype.next = function () {
-	this.pointer++;
-};
-
-/**
- * Moves the iterator to the last position of the aggregate.
- * @return {void}
- */
-QueueIterator.prototype.last = function () {
-	this.pointer = this.aggregate.items.length - 1;
-};
-
-/**
- * Moves the iterator to the previous item.
- * @return {void}
- */
-QueueIterator.prototype.previous = function () {
-	this.pointer--;
-};
-
-/**
- * Checks if the iterator is out of the bounds of the aggregate.
- * @return {boolean} It return true if the iterator is out of the bounds of the aggregate, otherwise false.
- */
-QueueIterator.prototype.isDone = function () {
-	return this.pointer < 0 || this.pointer > this.aggregate.items.length - 1;
-};
-
-/**
- * Returns the item stored at the position pointed by the iterator.
- * @return {*} The item stored or undefined if it's out of the bounds.
- */
-QueueIterator.prototype.getItem = function () {
-	return this.aggregate.getItem(this.pointer);
-};
-
-/**
- * Class for managing a red-black tree.
- * @constructor
- */
-function RBTree() {
-	/**
-	 * The root of the tree.
-	 * @type {RBNode|null}
-	 */
-	this.root = null;
-	/**
-	 * The number of items stored in the tree.
-	 * @type {number}
-	 */
-	this.size = 0;
-}
-
-/**
- * Returns the iterator relative to the aggregate.
- * @return {Iterator} The iterator.
- */
-RBTree.prototype.getIterator = function () {
-	return new RBTreeIterator(this);
-};
-
-/**
- * Inserts the item relatives to the key value in the tree.
- * @param key {number} The key to store.
- * @param item {*} The item to store.
- * @return {void}
- */
-RBTree.prototype.insert = function (key, item) {
-	var node = new RBNode(key, item);
-	this.size++;
-	if (!this.root) {
-		this.root = node;
-		node.type = 'b';
-		return;
-	}
-	var p = this.root;
-	for (var n = this.root; n;) {
-		p = n;
-		if (key < n.key)
-			n = n.left;
-		else
-			n = n.right;
-	}
-	node.parent = p;
-	if (!p)
-		this.root = node;
-	else if (key < p.key)
-		p.left = node;
-	else
-		p.right = node;
-
-	this.insertFixUp(node);
-};
-
-/**
- * Preserves the properties of the tree after an insert.
- * @param node {RBNode} The node to insert.
- * @return {void}
- */
-RBTree.prototype.insertFixUp = function (node) {
-	for (var parent = node.parent; parent && parent.type === 'r'; parent = node.parent) {
-		if (parent === parent.parent.left) {
-			var uncle = parent.parent.right;
-			if (uncle && uncle.type === 'r') {
-				parent.type = 'b';
-				uncle.type = 'b';
-				parent.parent.type = 'r';
-				node = parent.parent;
-			} else if (node === parent.right) {
-				node = parent;
-				this.leftRotate(node);
-			} else {
-				parent.type = 'b';
-				parent.parent.type = 'r';
-				this.rightRotate(parent.parent);
-			}
-		} else {
-			var uncle = parent.parent.left;
-			if (uncle && uncle.type === 'r') {
-				parent.type = 'b';
-				uncle.type = 'b';
-				parent.parent.type = 'r';
-				node = parent.parent;
-			} else if (node === parent.left) {
-				node = parent;
-				this.rightRotate(node);
-			} else {
-				parent.type = 'b';
-				parent.parent.type = 'r';
-				this.leftRotate(parent.parent);
-			}
-		}
-	}
-	this.root.type = 'b';
-};
-
-/**
- * Deletes the node from the tree.
- * @param node {RBNode} The node to delete.
- * @return {void}
- */
-RBTree.prototype.deleteNode = function (node) {
-	var successor;
-	this.size--;
-	if (!node.left || !node.right)
-		successor = node;
-	else {
-		successor = this.successor(node);
-		node.key = successor.key;
-		node.item = successor.item;
-	}
-	var child;
-	if (!successor.left)
-		child = successor.right;
-	else
-		child = successor.left;
-	if (child)
-		child.parent = successor.parent;
-	if (!successor.parent)
-		this.root = child;
-	else if (successor === successor.parent.left)
-		successor.parent.left = child;
-	else
-		successor.parent.right = child;
-
-	if (successor.type === 'b')
-		this.deleteFixUp(child, successor.parent);
-};
-
-/**
- * Preserves the properties of the tree after a deletion.
- * @param node {RBNode} The node to delete.
- * @param parent {RBNode} The parent of the node.
- * @return {void}
- */
-RBTree.prototype.deleteFixUp = function (node, parent) {
-	while (node !== this.root && (!node || node.type === 'b')) {
-		if (node === parent.left) {
-			var brother = parent.right;
-			if (brother && brother.type === 'r') {
-				brother.type = 'b';
-				parent.type = 'r';
-				this.leftRotate(parent);
-				brother = parent.right;
-			}
-			if (brother && (!brother.left || brother.left.type === 'b') && (!brother.right || brother.right.type === 'b')) {
-				brother.type = 'r';
-				node = parent;
-			} else {
-				if (!brother.right || brother.right.type === 'b') {
-					brother.left.type = 'b';
-					brother.type = 'r';
-					this.rightRotate(brother);
-					brother = parent.right;
-				}
-				brother.type = parent.type;
-				parent.type = 'b';
-				brother.right.type = 'b';
-				this.leftRotate(parent);
-				node = this.root;
-			}
-		} else {
-			var brother = parent.left;
-			if (brother && brother.type === 'r') {
-				brother.type = 'b';
-				parent.type = 'r';
-				this.rightRotate(parent);
-				brother = parent.left;
-			}
-			if (brother && (!brother.left || brother.left.type === 'b') && (!brother.right || brother.right.type === 'b')) {
-				brother.type = 'r';
-				node = parent;
-			} else {
-				if (!brother.left || brother.left.type === 'b') {
-					brother.right.type = 'b';
-					brother.type = 'r';
-					this.leftRotate(brother);
-					brother = parent.left;
-				}
-				brother.type = parent.type;
-				parent.type = 'b';
-				brother.left.type = 'b';
-				this.rightRotate(parent);
-				node = this.root;
-			}
-		}
-		parent = node.parent;
-	}
-	if (node)
-		node.type = 'b';
-};
-
-/**
- * Gets the node with the key next to the param node key.
- * @param node {RBNode} The node of which search the successor.
- * @return {RBNode} The node found.
- */
-RBTree.prototype.successor = function (node) {
-	if (node.right)
-		return this.minimum(node.right);
-	var parent = node.parent;
-	while (parent && node === parent.right) {
-		node = parent;
-		parent = parent.parent;
-	}
-	return parent;
-};
-
-/**
- * Gets the node with the key previous to the param node key.
- * @param node {RBNode} The node of which search the predecessor.
- * @return {RBNode} The node found.
- */
-RBTree.prototype.predecessor = function (node) {
-	if (node.left)
-		return this.maximum(node.left);
-	var parent = node.parent;
-	while (parent && node === parent.left) {
-		node = parent;
-		parent = parent.parent;
-	}
-	return parent;
-};
-
-/**
- * Searches the item relatives to the key and to the nodes that satisfy the condition represented by the callback function.
- * @param key {number} The key to find.
- * @param [node = root] {RBNode} The node from which start the search.
- * @param [callback = function(node){return(node.key===key);}] The condition to satisfy. The callback must accept the current node to check.
- * @return {*} The item found or undefined if there isn't the key in the tree.
- */
-RBTree.prototype.search = function (key, node, callback) {
-	node = node || this.root;
-	callback = callback || function (node) {
-		return node.key === key;
-	};
-	while (node && !callback(node))
-		if (key < node.key)
-			node = node.left;
-		else
-			node = node.right;
-	if (node)
-		return node.item;
-	return undefined;
-};
-
-/**
- * Checks if the tree contains a key or a node that satisfy the condition represented by the callback function.
- * This method avoid to search in branches where the key won't be found.
- * @param key {*} The key to find.
- * @param [callback = function(node){return(node.key===key);}] The condition to satisfy. The callback must accept the current node to check.
- * @return {boolean} True if the tree contains the key or a node that satisfy the condition, false otherwise.
- */
-RBTree.prototype.contains = function (key, callback) {
-	return this.search(key, null, callback) !== undefined;
-};
-
-/**
- * Checks if the tree contains a node that satisfy the condition represented by the callback function.
- * This method check all the tree avoiding the binary search.
- * @param callback {function} The condition to satisfy. The callback must accept the current node to check.
- * @return {boolean} True if the tree contains the node that satisfy the condition, false otherwise.
- */
-RBTree.prototype.fullContains = function (callback) {
-	var node = this.minimum();
-	while (node && !callback(node.key))
-		node = this.successor(node);
-	return node !== null;
-};
-
-/**
- * Gets the item relatives to the minimum key stored in the tree.
- * @param [node = root] {Node} The node from which start the search.
- * @return {RBNode} The node found.
- */
-RBTree.prototype.minimum = function (node) {
-	node = node || this.root;
-	while (node && node.left)
-		node = node.left;
-	return node;
-};
-
-/**
- * Gets the item relatives to the maximum key stored in the tree.
- * @param [node = root] {Node} The node from which start the search.
- * @return {RBNode} The node found.
- */
-RBTree.prototype.maximum = function (node) {
-	node = node || this.root;
-	while (node && node.right)
-		node = node.right;
-	return node;
-};
-
-/**
- * Rotates the node with its right child.
- * @param node {RBNode} The node to rotate.
- * @return {void}
- */
-RBTree.prototype.leftRotate = function (node) {
-	var child = node.right;
-	node.right = child.left;
-	if (child.left !== null)
-		child.left.parent = node;
-	child.parent = node.parent;
-	if (node.parent === null)
-		this.root = child;
-	else if (node === node.parent.left)
-		node.parent.left = child;
-	else
-		node.parent.right = child;
-	node.parent = child;
-	child.left = node;
-};
-
-/**
- * Rotates the node with its left child.
- * @param node {RBNode} The node to rotate.
- * @return {void}
- */
-RBTree.prototype.rightRotate = function (node) {
-	var child = node.left;
-	node.left = child.right;
-	if (child.right !== null)
-		child.right.parent = node;
-	child.parent = node.parent;
-	if (node.parent === null)
-		this.root = child;
-	else if (node === node.parent.left)
-		node.parent.left = child;
-	else
-		node.parent.right = child;
-	node.parent = child;
-	child.right = node;
-};
-
-/**
- * Returns the size of the tree.
- * @return {number} The size of the tree.
- */
-RBTree.prototype.getSize = function () {
-	return this.size;
-};
-
-/**
- * Clones the queue into a new queue.
- * @return {RBTree} The tree cloned from this queue.
- */
-RBTree.prototype.clone = function () {
-	var tree = new RBTree();
-	var it = this.getIterator();
-	for (it.first(); !it.isDone(); it.next())
-		if (it.getNode().item.clone)
-			tree.insert(it.getNode().key, it.getNode().item.clone());
-		else
-			tree.insert(it.getNode().key, it.getNode().item);
-
-	return tree;
-};
-
-/**
- * Clones the tree into a new tree without cloning duplicated items.
- * @return {RBTree} The tree cloned from this tree.
- */
-RBTree.prototype.cloneDistinct = function () {
-	var tree = new RBTree();
-	var it = this.getIterator();
-	for (it.first(); !it.isDone(); it.next()) {
-		var callback = function (node) {
-			return node.key === it.getNode().key && node.item === it.getNode().item;
-		};
-		if (!tree.contains(it.getNode().key, callback)) {
-			if (it.getNode().item.cloneDistinct)
-				tree.insert(it.getNode().key, it.getNode().item.cloneDistinct());
-			else if (it.getNode().item.clone)
-				tree.insert(it.getNode().key, it.getNode().item.clone());
-			else
-				tree.insert(it.getNode().key, it.getNode().item);
-		}
-	}
-	return tree;
-};
-
-/**
- * Transforms the tree into an array without preserving keys.
- * @return {Array<*>} The array that represents the tree.
- */
-RBTree.prototype.toArray = function () {
-	var result = [];
-	for (var node = this.minimum(); node; node = this.successor(node))
-		result.push(node.item);
-	return result;
-};
-
-/**
- * Removes all the items stored in the tree.
- * @return {void}
- */
-RBTree.prototype.clear = function () {
-	this.root = null;
-	this.size = 0;
-};
-
-/**
- * Checks if the tree is empty.
- * @return {boolean} True if the tree is empty, false otherwise.
- */
-RBTree.prototype.isEmpty = function () {
-	return !this.size;
-};
-
-/**
- * Executes the callback function for each item of the tree.
- * This method modifies the tree so if you don't need to modify it you must return the same item stored.
- * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
- * @return {void}
- */
-RBTree.prototype.execute = function (callback) {
-	for (var node = this.minimum(); node; node = this.successor(node))
-		node.item = callback(node.item);
-};
-
-/**
- * Returns the items that satisfy the condition determined by the callback.
- * @param callback {function} The function that implements the condition.
- * @return {Array<*>} The array that contains the items that satisfy the condition.
- */
-RBTree.prototype.filter = function (callback) {
-	var result = [];
-	for (var node = this.minimum(); node; node = this.successor(node))
-		if (callback(node.item))
-			result.push(node.item);
-	return result;
-};
-
-/**
- * Returns the first position of the item in the tree.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The first position of the item.
- */
-RBTree.prototype.indexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0, node = this.minimum();
-	while (node) {
-		if (callback(node.item))
-			return i;
-		node = this.successor(node);
-		i++;
-	}
-	return -1;
-};
-
-/**
- * Returns the last position of the item in the tree.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The last position of the item.
- */
-RBTree.prototype.lastIndexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = this.size - 1, node = this.maximum();
-	while (node) {
-		if (callback(node.item))
-			return i;
-		i--;
-		node = this.predecessor(node);
-	}
-	return -1;
-};
-
-/**
- * Returns all the position in which the item has been found in the tree.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {Array<number>} The positions in which the item has been found.
- */
-RBTree.prototype.allIndexesOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0, node = this.minimum();
-	var indexes = [];
-	while (node) {
-		if (callback(node.item))
-			indexes.push(i);
-		i++;
-		node = this.successor(node);
-	}
-	return indexes;
-};
-
-/**
- * Returns the item at the position index.
- * @param index {number} The position of the item.
- * @return {*} The item at the position. It's undefined if index isn't in the tree bounds.
- */
-RBTree.prototype.getItem = function (index) {
-	if (index < 0 || index > this.size - 1)
-		return undefined;
-	for (var node = this.minimum(), i = 0; i < index; node = this.successor(node))
-		i++;
-	return node.item;
-};
-
-/**
- * Class that implements the iterator for a red-black tree.
- * @param aggregate {RBTree} The aggregate to scan.
- * @constructor
- */
-function RBTreeIterator(aggregate) {
-	/**
-	 * The aggregate relates to this iterator.
-	 * @type {RBTree}
-	 */
-	this.aggregate = aggregate;
-
-	/**
-	 * The pointer to the position.
-	 * @type {RBNode|null}
-	 */
-	this.pointer = null;
-}
-
-/**
- * Moves the iterator to the first position of the aggregate.
- * @return {void}
- */
-RBTreeIterator.prototype.first = function () {
-	this.pointer = this.aggregate.minimum();
-};
-
-/**
- * Moves the iterator to the next item.
- * @return {void}
- */
-RBTreeIterator.prototype.next = function () {
-	this.pointer = this.aggregate.successor(this.pointer);
-};
-
-/**
- * Moves the iterator to the last position of the aggregate.
- * @return {void}
- */
-RBTreeIterator.prototype.last = function () {
-	this.pointer = this.aggregate.maximum();
-};
-
-/**
- * Moves the iterator to the previous item.
- * @return {void}
- */
-RBTreeIterator.prototype.previous = function () {
-	this.pointer = this.aggregate.predecessor(this.pointer);
-};
-
-/**
- * Checks if the iterator is out of the bounds of the aggregate.
- * @return {boolean} It return true if the iterator is out of the bounds of the aggregate, otherwise false.
- */
-RBTreeIterator.prototype.isDone = function () {
-	return !this.pointer;
-};
-
-/**
- * Returns the item stored at the position pointed by the iterator.
- * @return {Object|undefined} The item stored or undefined if it's out of the bounds.
- */
-RBTreeIterator.prototype.getItem = function () {
-	return this.pointer.item;
-};
-
-/**
- * Returns the node stored at the position pointed by the iterator.
- * @return {RBNode|null} The node stored or null if it's out of the bounds.
- */
-RBTreeIterator.prototype.getNode = function () {
-	return this.pointer;
-};
-
-/**
- * Class for managing a red-black tree where nodes are also in a list.
- * @constructor
- */
-function RBTreeList() {
-	/**
-	 * The root of the tree.
-	 * @type {RBLNode|null}
-	 */
-	this.root = null;
-	/**
-	 * The first node of the tree.
-	 * @type {RBLNode|null}
-	 */
-	this.first = null;
-	/**
-	 * The last node of the tree.
-	 * @type {RBLNode|null}
-	 */
-	this.last = null;
-	/**
-	 * The size of the tree.
-	 * @type {number}
-	 */
-	this.size = 0;
-}
-
-/**
- * Returns the iterator relative to the aggregate.
- * @return {Iterator} The iterator.
- */
-RBTreeList.prototype.getIterator = function () {
-	return new RBTreeListIterator(this);
-};
-
-/**
- * Inserts the item relatives to the key value in the tree.
- * @param key {number} The key to store.
- * @param item {*} The item to store.
- * @return {void}
- */
-RBTreeList.prototype.insert = function (key, item) {
-	var node = new RBLNode(key, item);
-	this.size++;
-	if (!this.root) {
-		this.root = node;
-		this.first = node;
-		this.last = node;
-		node.type = 'b';
-		return;
-	}
-	var p = this.root;
-	for (var n = this.root; n;) {
-		p = n;
-		if (key < n.key)
-			n = n.left;
-		else
-			n = n.right;
-	}
-	node.parent = p;
-	if (!p)
-		this.root = node;
-	else if (key < p.key)
-		p.left = node;
-	else
-		p.right = node;
-
-	node.next = this.successor(node);
-	if (node.next) {
-		if (node.next.previous)
-			node.next.previous.next = node;
-		else
-			this.first = node;
-		node.previous = node.next.previous;
-		node.next.previous = node;
-	} else {
-		this.last = node;
-		node.previous = this.predecessor(node);
-		if (node.previous)
-			node.previous.next = node;
-		else
-			this.first = node;
-	}
-
-	this.insertFixUp(node);
-};
-
-/**
- * Preserves the properties of the tree after an insert.
- * @param node {RBLNode} The node to insert.
- * @return {void}
- */
-RBTreeList.prototype.insertFixUp = function (node) {
-	for (var parent = node.parent; parent && parent.type === 'r'; parent = node.parent) {
-		if (parent === parent.parent.left) {
-			var uncle = parent.parent.right;
-			if (uncle && uncle.type === 'r') {
-				parent.type = 'b';
-				uncle.type = 'b';
-				parent.parent.type = 'r';
-				node = parent.parent;
-			} else if (node === parent.right) {
-				node = parent;
-				this.leftRotate(node);
-			} else {
-				parent.type = 'b';
-				parent.parent.type = 'r';
-				this.rightRotate(parent.parent);
-			}
-		} else {
-			var uncle = parent.parent.left;
-			if (uncle && uncle.type === 'r') {
-				parent.type = 'b';
-				uncle.type = 'b';
-				parent.parent.type = 'r';
-				node = parent.parent;
-			} else if (node === parent.left) {
-				node = parent;
-				this.rightRotate(node);
-			} else {
-				parent.type = 'b';
-				parent.parent.type = 'r';
-				this.leftRotate(parent.parent);
-			}
-		}
-	}
-	this.root.type = 'b';
-};
-
-/**
- * Deletes the node from the tree.
- * @param node {RBLNode} The node to delete.
- * @return {void}
- */
-RBTreeList.prototype.deleteNode = function (node) {
-	this.size--;
-	var successor;
-	if (!node.left || !node.right)
-		successor = node;
-	else {
-		successor = this.successor(node);
-		node.key = successor.key;
-		node.item = successor.item;
-	}
-	var child;
-	if (!successor.left)
-		child = successor.right;
-	else
-		child = successor.left;
-	if (child)
-		child.parent = successor.parent;
-	if (!successor.parent)
-		this.root = child;
-	else if (successor === successor.parent.left)
-		successor.parent.left = child;
-	else
-		successor.parent.right = child;
-
-	if (successor.next)
-		successor.next.previous = successor.previous;
-	else
-		this.last = successor.previous;
-	if (successor.previous)
-		successor.previous.next = successor.next;
-	else
-		this.first = successor.next;
-
-	if (successor.type === 'b')
-		this.deleteFixUp(child, successor.parent);
-};
-
-/**
- * Preserves the properties of the tree after a deletion.
- * @param node {RBLNode} The node to delete.
- * @param parent {RBLNode} The parent of the node.
- * @return {void}
- */
-RBTreeList.prototype.deleteFixUp = function (node, parent) {
-	while (node !== this.root && (!node || node.type === 'b')) {
-		if (node === parent.left) {
-			var brother = parent.right;
-			if (brother && brother.type === 'r') {
-				brother.type = 'b';
-				parent.type = 'r';
-				this.leftRotate(parent);
-				brother = parent.right;
-			}
-			if (brother && (!brother.left || brother.left.type === 'b') && (!brother.right || brother.right.type === 'b')) {
-				brother.type = 'r';
-				node = parent;
-			} else {
-				if (!brother.right || brother.right.type === 'b') {
-					brother.left.type = 'b';
-					brother.type = 'r';
-					this.rightRotate(brother);
-					brother = parent.right;
-				}
-				brother.type = parent.type;
-				parent.type = 'b';
-				brother.right.type = 'b';
-				this.leftRotate(parent);
-				node = this.root;
-			}
-		} else {
-			var brother = parent.left;
-			if (brother && brother.type === 'r') {
-				brother.type = 'b';
-				parent.type = 'r';
-				this.rightRotate(parent);
-				brother = parent.left;
-			}
-			if (brother && (!brother.left || brother.left.type === 'b') && (!brother.right || brother.right.type === 'b')) {
-				brother.type = 'r';
-				node = parent;
-			} else {
-				if (!brother.left || brother.left.type === 'b') {
-					brother.right.type = 'b';
-					brother.type = 'r';
-					this.leftRotate(brother);
-					brother = parent.left;
-				}
-				brother.type = parent.type;
-				parent.type = 'b';
-				brother.left.type = 'b';
-				this.rightRotate(parent);
-				node = this.root;
-			}
-		}
-		parent = node.parent;
-	}
-	if (node)
-		node.type = 'b';
-};
-
-/**
- * Gets the node with the key next to the param node key.
- * @param node {RBLNode} The node of which search the successor.
- * @return {RBLNode} The node found.
- */
-RBTreeList.prototype.successor = function (node) {
-	if (node.next || node === this.last)
-		return node.next;
-	if (node.right)
-		return this.minimum(node.right);
-	var parent = node.parent;
-	while (parent && node === parent.right) {
-		node = parent;
-		parent = parent.parent;
-	}
-	return parent;
-};
-
-/**
- * Gets the node with the key previous to the param node key.
- * @param node {RBLNode} The node of which search the predecessor.
- * @return {RBLNode} The node found.
- */
-RBTreeList.prototype.predecessor = function (node) {
-	if (node.previous || node === this.first)
-		return node.previous;
-	if (node.left)
-		return this.maximum(node.left);
-	var parent = node.parent;
-	while (parent && node === parent.left) {
-		node = parent;
-		parent = parent.parent;
-	}
-	return parent;
-};
-
-/**
- * Searches the item relatives to the key that satisfy the condition represented by the callback function.
- * @param key {number} The key to find.
- * @param [node = root] {RBNode} The node from which start the search.
- * @param [callback = function(k){return(k===key);}] The condition to satisfy. The callback must accept the current key to check.
- * @return {*} The item found or undefined if there isn't the key in the tree.
- */
-RBTreeList.prototype.search = function (key, node, callback) {
-	node = node || this.root;
-	callback = callback || function (node) {
-		return node.key === key;
-	};
-	while (node && !callback(node))
-		if (key < node.key)
-			node = node.left;
-		else
-			node = node.right;
-	if (node)
-		return node.item;
-	return undefined;
-};
-
-/**
- * Checks if the tree contains a key or a node that satisfy the condition represented by the callback function.
- * This method avoid to search in branches where the key won't be found.
- * @param key {*} The key to find.
- * @param [callback = function(node){return(node.key===key);}] The condition to satisfy. The callback must accept the current node to check.
- * @return {boolean} True if the tree contains the key or a node that satisfy the condition, false otherwise.
- */
-RBTreeList.prototype.contains = function (key, callback) {
-	return this.search(key, null, callback) !== undefined;
-};
-
-/**
- * Checks if the tree contains a node that satisfy the condition represented by the callback function.
- * This method check all the tree avoiding the binary search.
- * @param callback {function} The condition to satisfy. The callback must accept the current node to check.
- * @return {boolean} True if the tree contains the node that satisfy the condition, false otherwise.
- */
-RBTreeList.prototype.fullContains = function (callback) {
-	var node = this.first;
-	while (node && !callback(node.key))
-		node = node.next;
-	return node !== null;
-};
-
-/**
- * Gets the item relatives to the minimum key stored in the tree.
- * @param [node = root] {Node} The node from which start the search.
- * @return {RBLNode} The node found.
- */
-RBTreeList.prototype.minimum = function (node) {
-	if (node)
-		while (node && node.left)
-			node = node.left;
-	else
-		return this.first;
-	return node;
-};
-
-/**
- * Gets the item relatives to the maximum key stored in the tree.
- * @param [node = root] {Node} The node from which start the search.
- * @return {RBLNode} The node found.
- */
-RBTreeList.prototype.maximum = function (node) {
-	if (node)
-		while (node && node.right)
-			node = node.right;
-	else
-		return this.last;
-	return node;
-};
-
-/**
- * Rotates the node with its right child.
- * @param node {RBLNode} The node to rotate.
- * @return {void}
- */
-RBTreeList.prototype.leftRotate = function (node) {
-	var child = node.right;
-	node.right = child.left;
-	if (child.left !== null)
-		child.left.parent = node;
-	child.parent = node.parent;
-	if (node.parent === null)
-		this.root = child;
-	else if (node === node.parent.left)
-		node.parent.left = child;
-	else
-		node.parent.right = child;
-	node.parent = child;
-	child.left = node;
-};
-
-/**
- * Rotates the node with its left child.
- * @param node {RBLNode} The node to rotate.
- * @return {void}
- */
-RBTreeList.prototype.rightRotate = function (node) {
-	var child = node.left;
-	node.left = child.right;
-	if (child.right !== null)
-		child.right.parent = node;
-	child.parent = node.parent;
-	if (node.parent === null)
-		this.root = child;
-	else if (node === node.parent.left)
-		node.parent.left = child;
-	else
-		node.parent.right = child;
-	node.parent = child;
-	child.right = node;
-};
-
-/**
- * Returns the size of the tree.
- * @return {number} The size of the tree.
- */
-RBTreeList.prototype.getSize = function () {
-	return this.size;
-};
-
-/**
- * Clones the tree into a new tree.
- * @return {RBTreeList} The tree cloned from this tree.
- */
-RBTreeList.prototype.clone = function () {
-	var tree = new RBTreeList();
-	var it = this.getIterator();
-	for (it.first(); !it.isDone(); it.next())
-		tree.insert(it.getNode().key, it.getNode().item);
-	return tree;
-};
-
-/**
- * Clones the tree into a new tree without cloning duplicated items.
- * @return {RBTreeList} The tree cloned from this tree.
- */
-RBTreeList.prototype.cloneDistinct = function () {
-	var tree = new RBTreeList();
-	var it = this.getIterator();
-	for (it.first(); !it.isDone(); it.next()) {
-		var callback = function (node) {
-			return node.key === it.getNode().key && node.item === it.getNode().item;
-		};
-		if (!tree.contains(it.getNode().key, callback)) {
-			if (it.getNode().item.cloneDistinct)
-				tree.insert(it.getNode().key, it.getNode().item.cloneDistinct());
-			else if (it.getNode().item.clone)
-				tree.insert(it.getNode().key, it.getNode().item.clone());
-			else
-				tree.insert(it.getNode().key, it.getNode().item);
-		}
-	}
-	return tree;
-};
-
-/**
- * Transforms the tree into an array without preserving keys.
- * @return {Array<*>} The array that represents the tree.
- */
-RBTreeList.prototype.toArray = function () {
-	var result = [];
-	for (var node = this.first; node; node = node.next)
-		result.push(node.item);
-	return result;
-};
-
-/**
- * Removes all the items stored in the tree.
- * @return {void}
- */
-RBTreeList.prototype.clear = function () {
-	this.root = null;
-	this.first = null;
-	this.last = null;
-	this.size = 0;
-};
-
-/**
- * Checks if the tree is empty.
- * @return {boolean} True if the tree is empty, false otherwise.
- */
-RBTreeList.prototype.isEmpty = function () {
-	return !this.size;
-};
-
-/**
- * Executes the callback function for each item of the tree.
- * This method modifies the tree so if you don't need to modify it you must return the same item stored.
- * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
- * @return {void}
- */
-RBTreeList.prototype.execute = function (callback) {
-	for (var node = this.first; node; node = node.next)
-		node.item = callback(node.item);
-};
-
-/**
- * Returns the items that satisfy the condition determined by the callback.
- * @param callback {function} The function that implements the condition.
- * @return {Array<*>} The array that contains the items that satisfy the condition.
- */
-RBTreeList.prototype.filter = function (callback) {
-	var result = [];
-	for (var node = this.first; node; node = node.next)
-		if (callback(node.item))
-			result.push(node.item);
-	return result;
-};
-
-/**
- * Returns the first position of the item in the tree.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The first position of the item.
- */
-RBTreeList.prototype.indexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0, node = this.first;
-	while (node) {
-		if (callback(node.item))
-			return i;
-		node = node.next;
-		i++;
-	}
-	return -1;
-};
-
-/**
- * Returns the last position of the item in the tree.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The last position of the item.
- */
-RBTreeList.prototype.lastIndexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = this.size - 1, node = this.last;
-	while (node) {
-		if (callback(node.item))
-			return i;
-		i--;
-		node = node.previous;
-	}
-	return -1;
-};
-
-/**
- * Returns all the position in which the item has been found in the tree.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {Array<number>} The positions in which the item has been found.
- */
-RBTreeList.prototype.allIndexesOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0, node = this.first;
-	var indexes = [];
-	while (node) {
-		if (callback(node.item))
-			indexes.push(i);
-		i++;
-		node = node.next;
-	}
-	return indexes;
-};
-
-/**
- * Returns the item at the position index.
- * @param index {number} The position of the item.
- * @return {*} The item at the position. It's undefined if index isn't in the tree bounds.
- */
-RBTreeList.prototype.getItem = function (index) {
-	if (index < 0 || index > this.size - 1)
-		return undefined;
-	for (var node = this.first, i = 0; i < index; node = node.next)
-		i++;
-	return node.item;
-};
-
-/**
- * Class that implements the iterator for a red-black tree.
- * @param aggregate {RBTreeList} The aggregate to scan.
- * @constructor
- */
-function RBTreeListIterator(aggregate) {
-	/**
-	 * The aggregate relates to this iterator.
-	 * @type {RBTreeList}
-	 */
-	this.aggregate = aggregate;
-	/**
-	 * The pointer to the position.
-	 * @type {RBLNode|null}
-	 */
-	this.pointer = null;
-}
-
-/**
- * Moves the iterator to the first position of the aggregate.
- * @return {void}
- */
-RBTreeListIterator.prototype.first = function () {
-	this.pointer = this.aggregate.first;
-};
-
-/**
- * Moves the iterator to the next item.
- * @return {void}
- */
-RBTreeListIterator.prototype.next = function () {
-	this.pointer = this.pointer.next;
-};
-
-/**
- * Moves the iterator to the last position of the aggregate.
- * @return {void}
- */
-RBTreeListIterator.prototype.last = function () {
-	this.pointer = this.aggregate.last;
-};
-
-/**
- * Moves the iterator to the previous item.
- * @return {void}
- */
-RBTreeListIterator.prototype.previous = function () {
-	this.pointer = this.pointer.previous;
-};
-
-/**
- * Checks if the iterator is out of the bounds of the aggregate.
- * @return {boolean} It return true if the iterator is out of the bounds of the aggregate, otherwise false.
- */
-RBTreeListIterator.prototype.isDone = function () {
-	return !this.pointer;
-};
-
-/**
- * Returns the item stored at the position pointed by the iterator.
- * @return {*} The item stored or undefined if it's out of the bounds.
- */
-RBTreeListIterator.prototype.getItem = function () {
-	return this.pointer.item;
-};
-
-/**
- * Returns the node stored at the position pointed by the iterator.
- * @abstract
- * @return {RBNode|null} The node stored or null if it's out of the bounds.
- */
-RBTreeListIterator.prototype.getNode = function () {
-	return this.pointer;
-};
-
-/**
- * Class for managing a set.
- * @constructor
- */
-function Set() {
-	/**
-	 * The parents of the set.
-	 * @type {DoubleLinkedList}
-	 */
-	this.parents = new DoubleLinkedList();
-	/**
-	 * The elements stored.
-	 * @type {DoubleLinkedList}
-	 */
-	this.elements = new DoubleLinkedList();
-	/**
-	 * The subsets of this set.
-	 * @type {DoubleLinkedList}
-	 */
-	this.sets = new DoubleLinkedList();
-	/**
-	 * The size of the set. It's equal to his cardinality.
-	 * @type {number}
-	 */
-	this.size = 0;
-}
-
-/**
- * Adds the element to the set.
- * @param element {Element} The element to add.
- * @return {void}
- */
-Set.prototype.insert = function (element) {
-	this.elements.pushBack(element);
-	element.parents.pushBack(this);
-	this.size++;
-};
-
-/**
- * Adds the elements to the set.
- * @param elements {Array<Element>} The elements to add.
- * @return {void}
- */
-Set.prototype.multiInsert = function (elements) {
-	for (var i = 0; i < elements.length; i++) {
-		this.elements.pushBack(elements[i]);
-		elements[i].parents.pushBack(this);
-	}
-	this.size += elements.length;
-};
-
-/**
- * Returns the set that represents the union of two sets.
- * @param set {Set} The set with make the union.
- * @return {Set} The set that represents the union.
- */
-Set.prototype.union = function (set) {
-	var parent = new Set();
-	parent.addSubsets([this, set]);
-	this.parents.pushBack(parent);
-	set.parents.pushBack(parent);
-	//change the parent of the subset
-	var that = this;
-	var f = function (item) {
-		if (item === that)
-			return parent;
-	};
-	var it = this.sets.getIterator();
-	for (it.first(); !it.isDone(); it.next())
-		it.getItem().parents.execute(f);
-	f = function (item) {
-		if (item === set)
-			return parent;
-	};
-	it = set.sets.getIterator();
-	for (it.first(); !it.isDone(); it.next())
-		it.getItem().parents.execute(f);
-	return parent;
-};
-
-/**
- * Returns the set that represents the intersection of two sets.
- * @param set {Set} The set to intersect with this.
- * @return {Set} The set that represents the intersection.
- */
-Set.prototype.intersect = function (set) {
-	var intersection = new Set();
-	//intersect this set with the set
-	var el = this.elements.getIterator();
-	for (el.first(); !el.isDone(); el.next())
-		if (el.getItem().parents.contains(set))
-			intersection.insert(el.getItem());
-
-	//intersect the subsets with the set
-	var it = this.sets.getIterator();
-	for (it.first(); !it.isDone(); it.next()) {
-		el = it.getItem().getIterator();
-		for (el.first(); !el.isDone(); el.next())
-			if (el.getItem().parents.contains(set))
-				intersection.insert(el.getItem());
-	}
-	return intersection;
-};
-
-/**
- * Returns the set that represents the difference of two sets.
- * @param set {Set} The set to difference with this.
- * @return {Set} The set that represents the difference.
- */
-Set.prototype.difference = function (set) {
-	var diff = new Set();
-	//intersect this set with the set
-	var el = this.elements.getIterator();
-	for (el.first(); !el.isDone(); el.next())
-		if (!el.getItem().parents.contains(set))
-			diff.insert(el.getItem());
-
-	//intersect the subsets with the set
-	var it = this.sets.getIterator();
-	for (it.first(); !it.isDone(); it.next()) {
-		el = it.getItem().getIterator();
-		for (el.first(); !el.isDone(); el.next())
-			if (!el.getItem().parents.contains(set))
-				diff.insert(el.getItem());
-	}
-	return diff;
-};
-
-/**
- * Returns the set that represents the cartesian product of two sets.
- * @param set {Set} The set to make the cartesian product with this.
- * @return {Set} The set that represents the cartesian product .
- */
-Set.prototype.cartesianProduct = function (set) {
-	var el1 = this.getItems();
-	var el2 = set.getItems();
-	var product = new Set();
-	for (var i = 0; i < el1.length; i++)
-		for (var j = 0; j < el2.length; j++)
-			product.insert(new Element([el1[i], el2[j]]));
-	return product;
-};
-
-/**
- * Adds the subset.
- * @param set {Set} The subset.
- */
-Set.prototype.addSubset = function (set) {
-	this.sets.pushBack(set);
-	this.size += set.size;
-};
-
-/**
- * Adds the subsets.
- * @param sets {Array<Set>} The subsets.
- */
-Set.prototype.addSubsets = function (sets) {
-	for (var i = 0; i < sets.length; i++)
-		this.addSubset(sets[i]);
-};
-
-/**
- * Returns the items that are stored in the set.
- * @return {Array} The items stored.
- */
-Set.prototype.getItems = function () {
-	var array = [];
-	//get the items stored in the set
-	var el = this.elements.getIterator();
-	for (el.first(); !el.isDone(); el.next())
-		array.push(el.getItem().item);
-
-	//get the items stored in the subsets
-	var it = this.sets.getIterator();
-	for (it.first(); !it.isDone(); it.next()) {
-		el = it.getItem().getIterator();
-		for (el.first(); !el.isDone(); el.next())
-			array.push(el.getItem().item);
-	}
-	return array;
-};
-
-/**
- * Returns the cardinality of the set.
- * @return {number} The cardinality of the set.
- */
-Set.prototype.getCardinality = function () {
-	return this.size;
-};
-
-/**
- * Checks if the set is empty.
- * @return {boolean} True if the set is empty, false otherwise.
- */
-Set.prototype.isEmpty = function () {
-	return !this.size;
-};
-
-/**
- * Clones the set into a new set.
- * @return {Set} The set cloned from this set.
- */
-Set.prototype.clone = function () {
-	var s = new Set();
-	s.parents = this.parents.clone();
-	s.elements = this.elements.clone();
-	s.sets = this.sets.clone();
-	s.size = this.size;
-	return s;
-};
-
-/**
- * Class for managing a stack.
- * @param {...*} [args] The items for initializing the stack.
- * @constructor
- */
-function Stack(args) {
-	/**
-	 * The list of the items in the stack.
-	 * @type {Array<*>}
-	 */
-	this.items = [];
-
-	//builds the stack from the parameters of the constructor
-	this.multiPush(arguments);
-}
-
-/**
- * Returns the iterator relative to the aggregate.
- * @return {Iterator} The iterator.
- */
-Stack.prototype.getIterator = function () {
-	return new StackIterator(this);
-};
-
-/**
- * Adds the item at the top of the stack.
- * @param item {*} The item to add.
- * return {void}
- */
-Stack.prototype.push = function (item) {
-	this.items.push(item);
-};
-
-/**
- * Adds the items at the top of the stack.
- * @param items {Array<*>} The items to add.
- * @return {void}
- */
-Stack.prototype.multiPush = function (items) {
-	for (var i = 0; i < items.length; i++)
-		this.push(items[i]);
-};
-
-/**
- * Removes the item at the top of the stack.
- * @return {*} The item at the top of the stack. It's undefined if the stack is empty.
- */
-Stack.prototype.pop = function () {
-	if (!this.items.length)
-		return undefined;
-	return this.items.pop();
-};
-
-/**
- * Removes the more item at the top of the stack.
- * @param times {number} The number of times to repeat the pop method.
- * @return {Array<*>} The items at the top of the stack.
- */
-Stack.prototype.multiPop = function (times) {
-	var result = [];
-	for (var i = 0; i < times && this.items.length; i++)
-		result.push(this.pop());
-	return result;
-};
-
-/**
- * Returns the item at the top of the stack without remove it.
- * @return {*} The item at the top of the stack. It's undefined if the stack is empty.
- */
-Stack.prototype.peek = function () {
-	if (!this.items.length)
-		return undefined;
-	return this.items[this.items.length - 1];
-};
-
-/**
- * Removes all the items stored in the stack.
- * @return {void}
- */
-Stack.prototype.clear = function () {
-	this.items = [];
-};
-
-/**
- * Checks if the stack contains an item that satisfy the condition represented by the callback function.
- * @param item {*} The item to find.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {boolean} True if the stack contains the item that satisfy the condition, false otherwise.
- */
-Stack.prototype.contains = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0;
-	while (i < this.items.length && !callback(this.items[i]))
-		i++;
-	return i < this.items.length;
-};
-
-/**
- * Executes the callback function for each item of the stack.
- * This method modifies the stack so if you don't need to modify it you must return the same item of the array.
- * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
- * @return {void}
- */
-Stack.prototype.execute = function (callback) {
-	for (var i = this.items.length - 1; i > -1; i--)
-		this.items[i] = callback(this.items[i]);
-};
-
-/**
- * Returns the item at the position index.
- * @param index The position of the item.
- * @return {*} The item at the position. It's undefined if index isn't in the stack bounds.
- */
-Stack.prototype.getItem = function (index) {
-	if (index < 0 || index > this.items.length - 1)
-		return undefined;
-	return this.items[this.items.length - index - 1];
-};
-
-/**
- * Returns the length of the stack.
- * @return {Number} The length of the stack.
- */
-Stack.prototype.getLength = function () {
-	return this.items.length;
-};
-
-/**
- * Checks if the stack is empty.
- * @return {boolean} True if the stack is empty, false otherwise.
- */
-Stack.prototype.isEmpty = function () {
-	return !this.items.length;
-};
-
-/**
- * Returns the items that satisfy the condition determined by the callback.
- * @param callback {function} The function that implements the condition.
- * @return {Array<*>} The array that contains the items that satisfy the condition.
- */
-Stack.prototype.filter = function (callback) {
-	var result = [];
-	for (var i = this.items.length - 1; i > -1; i--) {
-		if (callback(this.items[i]))
-			result.push(this.items[i]);
-	}
-	return result;
-};
-
-/**
- * Returns the first position of the item in the stack.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The first position of the item.
- */
-Stack.prototype.indexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = this.items.length - 1;
-	while (i > -1) {
-		if (callback(this.items[i]))
-			return i;
-		i--;
-	}
-	return -1;
-};
-
-/**
- * Returns the last position of the item in the stack.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The last position of the item.
- */
-Stack.prototype.lastIndexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0;
-	while (i < this.items.length) {
-		if (callback(this.items[i]))
-			return i;
-		i++;
-	}
-	return -1;
-};
-
-/**
- * Returns all the position in which the item has been found in the stack.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {Array<number>} The positions in which the item has been found.
- */
-Stack.prototype.allIndexesOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = this.items.length - 1;
-	var indexes = [];
-	while (i > -1) {
-		if (callback(this.items[i]))
-			indexes.push(i);
-		i--;
-	}
-	return indexes;
-};
-
-/**
- * Clones the stack into a new stack.
- * @return {Stack} The stack cloned from this stack.
- */
-Stack.prototype.clone = function () {
-	var stack = new Stack();
-	for (var i = 0; i < this.items.length; i++)
-		if (this.items[i].clone)
-			stack.push(this.items[i].clone());
-		else
-			stack.push(this.items[i]);
-	return stack;
-};
-
-/**
- * Clones the stack into a new stack without cloning duplicated items.
- * @return {Stack} The stack cloned from this stack.
- */
-Stack.prototype.cloneDistinct = function () {
-	var stack = new Stack();
-	for (var i = 0; i < this.items.length; i++)
-		if (!stack.contains(this.items[i])) {
-			if (this.items[i].cloneDistinct)
-				stack.push(this.items[i].cloneDistinct());
-			else if (this.items[i].clone)
-				stack.push(this.items[i].clone());
-			else
-				stack.push(this.items[i]);
-		}
-	return stack;
-};
-
-/**
- * Class that implements the iterator for a linked list.
- * @param aggregate {Stack} The aggregate to scan.
- * @constructor
- */
-function StackIterator(aggregate) {
-	/**
-	 * The aggregate relates to this iterator.
-	 * @type {Stack}
-	 */
-	this.aggregate = aggregate;
-
-	/**
-	 * The pointer to the position.
-	 * @type {number}
-	 */
-	this.pointer = -1;
-}
-
-/**
- * Moves the iterator to the first position of the aggregate.
- * @return {void}
- */
-StackIterator.prototype.first = function () {
-	this.pointer = this.aggregate.items.length - 1;
-};
-
-/**
- * Moves the iterator to the next item.
- * @return {void}
- */
-StackIterator.prototype.next = function () {
-	this.pointer--;
-};
-
-/**
- * Moves the iterator to the last position of the aggregate.
- * @return {void}
- */
-StackIterator.prototype.last = function () {
-	this.pointer = 0;
-};
-
-/**
- * Moves the iterator to the previous item.
- * @return {void}
- */
-StackIterator.prototype.previous = function () {
-	this.pointer++;
-};
-
-/**
- * Checks if the iterator is out of the bounds of the aggregate.
- * @return {boolean} It return true if the iterator is out of the bounds of the aggregate, otherwise false.
- */
-StackIterator.prototype.isDone = function () {
-	return this.pointer < 0 || this.pointer > this.aggregate.items.length - 1;
-};
-
-/**
- * Returns the item stored at the position pointed by the iterator.
- * @return {*} The item stored or undefined if it's out of the bounds.
- */
-StackIterator.prototype.getItem = function () {
-	return this.aggregate.items[this.pointer];
-};
diff --git a/DataStructuresMinimized.js b/DataStructuresMinimized.js
deleted file mode 100644
index 4a727e1..0000000
--- a/DataStructuresMinimized.js
+++ /dev/null
@@ -1,2751 +0,0 @@
-function Aggregate() {
-}
-function Iterator() {
-}
-function BSNode(e, t) {
-	this.item = t;
-	this.key = e;
-	this.parent = null;
-	this.left = null;
-	this.right = null
-}
-function BSTree() {
-	this.root = null
-}
-function BSTreeIterator(e) {
-	this.aggregate = e;
-	this.pointer = null
-}
-function BNode() {
-	this.keys = [];
-	this.items = [];
-	this.childs = []
-}
-function BTree(e) {
-	this.root = new BNode;
-	this.t = e;
-	this.size = 0
-}
-function BTreeIterator(e) {
-	this.aggregate = e;
-	this.pointer = null
-}
-function CircularBufferIterator(e) {
-	this.aggregate = e;
-	this.pointer = null;
-	this.start = true
-}
-function CircularBuffer(e) {
-	this.head = 0;
-	this.tail = 0;
-	this.items = new Array(e);
-	this.empty = true;
-	this.full = false;
-	this.size = e
-}
-function DLLNode(e) {
-	this.item = e;
-	this.next = null;
-	this.previous = null
-}
-function DoubleLinkedList(e) {
-	this.first = null;
-	this.last = null;
-	this.length = 0;
-	this.fromArray(arguments)
-}
-function DoubleLinkedListIterator(e) {
-	this.aggregate = e;
-	this.pointer = null
-}
-function merge(e, t, n) {
-	var r = Math.floor((e + t) / 2);
-	var i = [];
-	var s = [];
-	for (var o = 0; o < r - e + 1; o++)i[o] = n[e + o];
-	for (var u = 0; u < t - r; u++)s[u] = n[r + u + 1];
-	var a = 0, f = 0;
-	for (var l = e; l < t + 1; l++) {
-		if (f > t - r - 1 || i[a] <= s[f] && a < r - e + 1) {
-			this.postMessage({cmd: "replace", index: l, value: i[a]});
-			a++
-		} else {
-			this.postMessage({cmd: "replace", index: l, value: s[f]});
-			f++
-		}
-	}
-}
-function HashTable(e) {
-	this.size = e;
-	this.p = 1e3;
-	this.a = Math.floor(Math.random() * this.p);
-	this.b = Math.floor(Math.random() * this.p);
-	this.hash = function (e) {
-		return(this.a * e + this.b) % this.p % this.size
-	};
-	this.items = [];
-	this.keyLength = 0;
-	this.clear()
-}
-function LLNode(e) {
-	this.item = e;
-	this.next = null
-}
-function LinkedList(e) {
-	this.first = null;
-	this.last = null;
-	this.length = 0;
-	this.fromArray(arguments)
-}
-function LinkedListIterator(e) {
-	this.aggregate = e;
-	this.pointer = null
-}
-function PriorityQueue() {
-	this.items = new RBTreeList;
-	this.length = 0
-}
-function PriorityQueueIterator(e) {
-	this.aggregate = e;
-	this.pointerNode = null;
-	this.pointerPosition = -1
-}
-function Queue(e) {
-	this.items = [];
-	this.multiEnqueue(arguments)
-}
-function QueueIterator(e) {
-	this.aggregate = e;
-	this.pointer = -1
-}
-function RBNode(e, t) {
-	this.item = t;
-	this.key = e;
-	this.parent = null;
-	this.left = null;
-	this.right = null;
-	this.type = "r"
-}
-function RBTree() {
-	this.root = null;
-	this.size = 0
-}
-function RBTreeIterator(e) {
-	this.aggregate = e;
-	this.pointer = null
-}
-function RBLNode(e, t) {
-	this.item = t;
-	this.key = e;
-	this.parent = null;
-	this.left = null;
-	this.right = null;
-	this.next = null;
-	this.previous = null;
-	this.type = "r"
-}
-function RBTreeList() {
-	this.root = null;
-	this.first = null;
-	this.last = null;
-	this.size = 0
-}
-function RBTreeListIterator(e) {
-	this.aggregate = e;
-	this.pointer = null
-}
-function Element(e) {
-	this.parents = new DoubleLinkedList;
-	this.item = e
-}
-function Set() {
-	this.parents = new DoubleLinkedList;
-	this.elements = new DoubleLinkedList;
-	this.sets = new DoubleLinkedList;
-	this.size = 0
-}
-function Stack(e) {
-	this.items = [];
-	this.multiPush(arguments)
-}
-function StackIterator(e) {
-	this.aggregate = e;
-	this.pointer = -1
-}
-Aggregate.prototype.getIterator = function () {
-};
-Iterator.prototype.first = function () {
-};
-Iterator.prototype.next = function () {
-};
-Iterator.prototype.last = function () {
-};
-Iterator.prototype.previous = function () {
-};
-Iterator.prototype.isDone = function () {
-};
-Iterator.prototype.getItem = function () {
-};
-BSTree.prototype = new Aggregate;
-BSTree.prototype.constructor = BSTree;
-BSTree.prototype.getIterator = function () {
-	return new BSTreeIterator(this)
-};
-BSTree.prototype.insert = function (e, t) {
-	var n = new BSNode(e, t);
-	var r = this.root;
-	for (var i = this.root; i;) {
-		r = i;
-		if (e < i.key)i = i.left; else i = i.right
-	}
-	n.parent = r;
-	if (!r)this.root = n; else if (e < r.key)r.left = n; else r.right = n
-};
-BSTree.prototype.search = function (e, t) {
-	t = t || this.root;
-	while (t && e !== t.key)if (e < t.key)t = t.left; else t = t.right;
-	if (t)return t.item;
-	return undefined
-};
-BSTree.prototype.minimum = function (e) {
-	e = e || this.root;
-	while (e && e.left)e = e.left;
-	return e
-};
-BSTree.prototype.maximum = function (e) {
-	e = e || this.root;
-	while (e && e.right)e = e.right;
-	return e
-};
-BSTree.prototype.successor = function (e) {
-	if (e.right)return this.minimum(e.right);
-	var t = e.parent;
-	while (t && e === t.right) {
-		e = t;
-		t = t.parent
-	}
-	return t
-};
-BSTree.prototype.predecessor = function (e) {
-	if (e.left)return this.maximum(e.left);
-	var t = e.parent;
-	while (t && e === t.left) {
-		e = t;
-		t = t.parent
-	}
-	return t
-};
-BSTree.prototype.deleteNode = function (e) {
-	if (!e.left && !e.right) {
-		if (e === this.root)this.root = null; else if (e.parent.left === e)e.parent.left = null; else e.parent.right = null
-	} else if (e.left && e.right) {
-		var t = this.successor(e);
-		e.key = t.key;
-		e.item = t.item;
-		if (t.parent.left === t)t.parent.left = null; else t.parent.right = null
-	} else {
-		if (e.right) {
-			if (e === this.root) {
-				this.root = e.right;
-				e.right.parent = null
-			} else {
-				e.parent.right = e.right;
-				e.right.parent = e.parent
-			}
-		} else {
-			if (e === this.root) {
-				this.root = e.left;
-				e.left.parent = null
-			} else {
-				e.parent.left = e.left;
-				e.left.parent = e.parent
-			}
-		}
-	}
-};
-BSTreeIterator.prototype = new Iterator;
-BSTreeIterator.prototype.constructor = BSTreeIterator;
-BSTreeIterator.prototype.first = function () {
-	this.pointer = this.aggregate.minimum()
-};
-BSTreeIterator.prototype.next = function () {
-	this.pointer = this.aggregate.successor(this.pointer)
-};
-BSTreeIterator.prototype.last = function () {
-	this.pointer = this.aggregate.maximum()
-};
-BSTreeIterator.prototype.previous = function () {
-	this.pointer = this.aggregate.predecessor(this.pointer)
-};
-BSTreeIterator.prototype.isDone = function () {
-	return!this.pointer
-};
-BSTreeIterator.prototype.getItem = function () {
-	return this.pointer.item
-};
-BSTreeIterator.prototype.getNode = function () {
-	return this.pointer
-};
-BTree.prototype = new Aggregate;
-BTree.prototype.constructor = BTree;
-BTree.prototype.getIterator = function () {
-	return new BTreeIterator(this)
-};
-BTree.prototype.insert = function (e, t) {
-	var n = this.root;
-	if (n.keys.length === 2 * this.t - 1) {
-		var r = new BNode;
-		r.childs.push(n);
-		this.root = r;
-		this.splitChild(r, 0);
-		n = r
-	}
-	this.size++;
-	this.insertNonFull(n, e, t)
-};
-BTree.prototype.insertNonFull = function (e, t, n) {
-	while (e) {
-		var r = e.keys.length - 1;
-		if (!e.childs.length) {
-			for (; r > -1 && t < e.keys[r]; r--) {
-				e.keys[r + 1] = e.keys[r];
-				e.items[r + 1] = e.items[r]
-			}
-			e.keys[r + 1] = t;
-			e.items[r + 1] = n;
-			return
-		} else {
-			var i = 0;
-			r++;
-			while (i < r) {
-				var s = Math.floor((i + r) / 2);
-				if (t <= e.keys[s])r = s; else i = s + 1
-			}
-			if (e.childs[i].keys.length === 2 * this.t - 1) {
-				this.splitChild(e, i);
-				if (t > e.keys[i])i++
-			}
-			e = e.childs[i]
-		}
-	}
-};
-BTree.prototype.search = function (e, t, n) {
-	t = t || this.root;
-	n = n || function (t, n) {
-		return t.keys[n] === e
-	};
-	while (t) {
-		var r = t.keys.length;
-		var i = 0, s = r;
-		while (i < s) {
-			var o = Math.floor((i + s) / 2);
-			if (e <= t.keys[o])s = o; else i = o + 1
-		}
-		if (i < r && n(t, i))return t.items[i]; else if (!t.childs.length)return undefined; else t = t.childs[i]
-	}
-};
-BTree.prototype.splitChild = function (e, t) {
-	var n = new BNode;
-	var r = e.childs[t];
-	for (var i = 0; i < this.t - 1; i++) {
-		n.keys[i] = r.keys[i + this.t];
-		n.items[i] = r.items[i + this.t]
-	}
-	if (r.childs.length)for (var s = 0; s < this.t; s++)n.childs[s] = r.childs[s + this.t];
-	for (var o = e.keys.length; o > t; o--)e.childs[o + 1] = e.childs[o];
-	e.childs[t + 1] = n;
-	for (var u = e.keys.length - 1; u > t - 1; u--) {
-		e.keys[u + 1] = e.keys[u];
-		e.items[u + 1] = e.items[u]
-	}
-	e.keys[t] = r.keys[this.t - 1];
-	e.items[t] = r.items[this.t - 1];
-	r.keys.splice(r.keys.length - this.t);
-	r.items.splice(r.items.length - this.t);
-	r.childs.splice(r.childs.length - this.t)
-};
-BTree.prototype.deleteKey = function (e) {
-	if (this.root.keys.length) {
-		this.deleteNonMin(this.root, e);
-		if (!this.root.keys.length && this.root.childs.length)this.root = this.root.childs[0];
-		this.size--
-	}
-};
-BTree.prototype.deleteNonMin = function (e, t) {
-	var n = 0, r = e.keys.length;
-	while (n < r) {
-		var i = Math.floor((n + r) / 2);
-		if (t <= e.keys[i])r = i; else n = i + 1
-	}
-	if (n < e.keys.length && t === e.keys[n]) {
-		if (!e.childs.length) {
-			for (r = n + 1; r < e.keys.length; r++) {
-				e.keys[r - 1] = e.keys[r];
-				e.items[r - 1] = e.items[r]
-			}
-			e.keys.pop();
-			e.items.pop()
-		} else {
-			if (e.childs[n].length === this.t - 1) {
-				this.augmentChild(e, n);
-				if (n === e.keys.length + 1)n--
-			}
-			if (e.keys[n] !== t)this.deleteNonMin(e.childs[n], t); else this.deleteMax(e, n)
-		}
-	} else {
-		if (e.childs[n].keys.length === this.t - 1) {
-			this.augmentChild(e, n);
-			if (n === e.keys.length + 2)n--
-		}
-		this.deleteNonMin(e.childs[n], t)
-	}
-};
-BTree.prototype.deleteMax = function (e, t) {
-	var n = e.childs[t];
-	var r = true;
-	while (r) {
-		if (!n.childs.length) {
-			e.keys[t] = n.keys[n.keys.length - 1];
-			e.items[t] = n.items[n.items.length - 1];
-			n.keys.pop();
-			n.items.pop();
-			r = false
-		} else {
-			var i = n.childs[n.keys.length];
-			if (i.keys.length === this.t - 1)this.augmentChild(n, n.keys.length);
-			n = n.childs[n.keys.length]
-		}
-	}
-};
-BTree.prototype.augmentChild = function (e, t) {
-	var n = e.childs[t];
-	var r;
-	if (t)r = e.childs[t - 1];
-	if (t && r.keys.length > this.t - 1) {
-		if (n.childs.length) {
-			for (var i = this.keys.length + 1; i > 0; i--)n.childs[i] = n.childs[i - 1];
-			n.childs[0] = r.childs[r.keys.length];
-			for (var s = n.keys.length; s > 0; s--) {
-				n.keys[s] = n.keys[s - 1];
-				n.items[s] = n.items[s - 1]
-			}
-			n.keys[0] = e.keys[t - 1];
-			n.items[0] = e.items[t - 1];
-			e.keys[t - 1] = r.keys[r.keys.length - 1];
-			e.items[t - 1] = r.items[r.items.length - 1]
-		}
-	} else {
-		if (t < e.keys.length)r = e.childs[t + 1];
-		if (t < e.keys.length && r.keys.length > this.t - 1) {
-			if (r.childs.length) {
-				n.childs[n.keys.length + 1] = r.childs[0];
-				for (var o = 1; o < r.keys.length + 1; o++)r.childs[o - 1] = r.childs[o];
-				r.childs.pop()
-			}
-			n.keys[n.keys.length] = e.keys[t];
-			n.items[n.items.length] = e.items[t];
-			e.keys[t] = r.keys[0];
-			e.items[t] = r.items[0];
-			for (var u = 1; u < r.keys.length; u++) {
-				r.keys[u - 1] = r.keys[u];
-				r.items[u - 1] = r.items[u]
-			}
-			r.keys.pop();
-			r.items.pop()
-		} else {
-			if (t < e.keys.length) {
-				n.keys[this.t - 1] = e.keys[t];
-				n.items[this.t - 1] = e.items[t];
-				for (var a = t + 2; a < e.keys.length + 1; a++)e.childs[a - 1] = e.childs[a];
-				e.childs.pop();
-				for (var f = t + 1; f < e.keys.length; f++) {
-					e.keys[f - 1] = e.keys[f];
-					e.items[f - 1] = e.items[f]
-				}
-				e.keys.pop();
-				e.items.pop();
-				if (r.childs.length)for (var l = 0; l < r.keys.length + 1; l++)n.childs[this.t + l] = r.childs[l];
-				for (var c = 0; c < r.keys.length; c++) {
-					n.keys[c + this.t] = r.keys[c];
-					n.items[c + this.t] = r.items[c]
-				}
-			} else {
-				if (r.childs.length)for (var h = 0; h < n.keys.length + 1; h++)r.childs[this.t + h] = n.childs[h];
-				r.keys[this.t - 1] = e.keys[e.keys.length - 1];
-				r.items[this.t - 1] = e.items[e.keys.length - 1];
-				for (var p = 0; p < n.keys.length; p++) {
-					r.keys[p + this.t] = n.keys[p];
-					r.items[p + this.t] = n.items[p]
-				}
-			}
-		}
-	}
-};
-BTree.prototype.contains = function (e, t) {
-	return this.search(e, null, t) !== undefined
-};
-BTree.prototype.fullContains = function (e) {
-	var t = this.minimumKey();
-	while (t !== null && !e(this.search(t)))t = this.successor(t);
-	return t !== null
-};
-BTree.prototype.successor = function (e, t) {
-	t = t || this.root;
-	var n = 0, r = t.keys.length;
-	while (n < r) {
-		var i = Math.floor((n + r) / 2);
-		if (e <= t.keys[i])r = i; else n = i + 1
-	}
-	if (t.keys[n] === e)n++;
-	if (!t.childs.length) {
-		if (n > t.keys.length - 1)return null; else return t.keys[n]
-	}
-	var s = this.successor(e, t.childs[n]);
-	if (s === null && n < t.keys.length)return t.keys[n];
-	return s
-};
-BTree.prototype.predecessor = function (e, t) {
-	t = t || this.root;
-	var n = 0, r = t.keys.length;
-	while (n < r) {
-		var i = Math.floor((n + r) / 2);
-		if (e <= t.keys[i])r = i; else n = i + 1
-	}
-	n--;
-	if (!t.childs.length) {
-		if (n < 0)return null; else return t.keys[n]
-	}
-	var s = this.predecessor(e, t.childs[n + 1]);
-	if (s === null && e > t.keys[0]) {
-		return t.keys[n]
-	}
-	return s
-};
-BTree.prototype.minimumKey = function () {
-	var e = this.root;
-	while (e.childs.length)e = e.childs[0];
-	if (e)return e.keys[0];
-	return null
-};
-BTree.prototype.maximumKey = function () {
-	var e = this.root;
-	while (e.childs.length)e = e.childs[e.childs.length - 1];
-	if (e)return e.keys[e.keys.length - 1];
-	return null
-};
-BTree.prototype.minimum = function () {
-	var e = this.root;
-	while (e.childs.length)e = e.childs[0];
-	return e.items[0]
-};
-BTree.prototype.maximum = function () {
-	var e = this.root;
-	while (e.childs.length)e = e.childs[e.childs.length - 1];
-	return e.items[e.items.length - 1]
-};
-BTree.prototype.getSize = function () {
-	return this.size
-};
-BTree.prototype.isEmpty = function () {
-	return!this.size
-};
-BTree.prototype.execute = function (e) {
-	var t = arguments[1] || this.root;
-	for (var n = 0; n < t.items.length; n++)t.items[n] = e(t.items[n]);
-	for (var r = 0; r < t.childs.length; r++)this.execute(e, t.childs[r])
-};
-BTree.prototype.clear = function () {
-	this.root = null;
-	this.size = 0
-};
-BTree.prototype.filter = function (e) {
-	var t = [];
-	var n = arguments[1] || this.root;
-	for (var r = 0; r < n.items.length; r++) {
-		if (n.childs.length)t = t.concat(this.filter(e, n.childs[r]));
-		if (e(n.items[r]))t.push(n.items[r])
-	}
-	if (n.childs.length)t = t.concat(this.filter(e, n.childs[n.childs.length - 1]));
-	return t
-};
-BTree.prototype.clone = function () {
-	var e = new BTree(this.t);
-	var t = this.getIterator();
-	for (t.first(); !t.isDone(); t.next()) {
-		var n = t.getItem();
-		if (n.clone)n = n.clone();
-		e.insert(t.getKey(), n)
-	}
-	return e
-};
-BTree.prototype.cloneDistinct = function () {
-	var e = new BTree(this.t);
-	var t = this.getIterator();
-	for (t.first(); !t.isDone(); t.next()) {
-		var n = function (e) {
-			return e === t.getItem()
-		};
-		if (!e.fullContains(n)) {
-			if (t.getItem().cloneDistinct)e.insert(t.getKey(), t.getItem().cloneDistinct()); else if (t.getItem().clone)e.insert(t.getKey(), t.getItem().clone()); else e.insert(t.getKey(), t.getItem())
-		}
-	}
-	return e
-};
-BTree.prototype.toArray = function () {
-	var e = [];
-	var t = this.getIterator();
-	for (t.first(); !t.isDone(); t.next())e.push(t.getItem());
-	return e
-};
-BTree.prototype.indexOf = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = 0, r = this.minimumKey();
-	while (r !== null) {
-		if (t(this.search(r)))return n;
-		r = this.successor(r);
-		n++
-	}
-	return-1
-};
-BTree.prototype.lastIndexOf = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = this.size - 1, r = this.maximumKey();
-	while (r !== null) {
-		if (t(this.search(r)))return n;
-		n--;
-		r = this.predecessor(r)
-	}
-	return-1
-};
-BTree.prototype.allIndexesOf = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = 0, r = this.minimumKey();
-	var i = [];
-	while (r !== null) {
-		if (t(this.search(r)))i.push(n);
-		n++;
-		r = this.successor(r)
-	}
-	return i
-};
-BTree.prototype.getItem = function (e) {
-	if (e < 0 || e > this.size - 1)return undefined;
-	var t = this.minimum();
-	for (var n = 0; n < e; n++)t = this.successor(t);
-	return this.search(t)
-};
-BTreeIterator.prototype = new Iterator;
-BTreeIterator.prototype.constructor = BTreeIterator;
-BTreeIterator.prototype.first = function () {
-	this.pointer = this.aggregate.minimumKey()
-};
-BTreeIterator.prototype.next = function () {
-	this.pointer = this.aggregate.successor(this.pointer)
-};
-BTreeIterator.prototype.last = function () {
-	this.pointer = this.aggregate.maximumKey()
-};
-BTreeIterator.prototype.previous = function () {
-	this.pointer = this.aggregate.predecessor(this.pointer)
-};
-BTreeIterator.prototype.isDone = function () {
-	return this.pointer === null
-};
-BTreeIterator.prototype.getItem = function () {
-	return this.aggregate.search(this.pointer)
-};
-BTreeIterator.prototype.getKey = function () {
-	return this.pointer
-};
-CircularBufferIterator.prototype = new Iterator;
-CircularBufferIterator.prototype.constructor = CircularBufferIterator;
-CircularBufferIterator.prototype.first = function () {
-	this.pointer = this.aggregate.tail;
-	this.start = true
-};
-CircularBufferIterator.prototype.next = function () {
-	this.pointer = (this.pointer + 1) % this.aggregate.size;
-	this.start = false
-};
-CircularBufferIterator.prototype.last = function () {
-	this.pointer = (this.aggregate.head - 1) % this.aggregate.size;
-	this.start = true
-};
-CircularBufferIterator.prototype.previous = function () {
-	this.pointer = (this.pointer - 1) % this.aggregate.size;
-	this.start = false
-};
-CircularBufferIterator.prototype.isDone = function () {
-	return this.pointer === this.aggregate.head && !this.start || (this.pointer === this.aggregate.tail - 1) % this.aggregate.size || this.aggregate.isEmpty()
-};
-CircularBufferIterator.prototype.getItem = function () {
-	return this.aggregate.read(this.pointer)
-};
-CircularBuffer.prototype = new Aggregate;
-CircularBuffer.prototype.constructor = CircularBuffer;
-CircularBuffer.prototype.getIterator = function () {
-	return new CircularBufferIterator(this)
-};
-CircularBuffer.prototype.write = function (e) {
-	this.empty = false;
-	if (this.full)this.tail = (this.tail + 1) % this.size;
-	this.items[this.head] = e;
-	this.head = (this.head + 1) % this.size;
-	if (this.tail === this.head)this.full = true
-};
-CircularBuffer.prototype.free = function (e, t) {
-	if (e < 0)e = 0;
-	if (e > this.size - 1)e = this.size - 1;
-	if (t < 0)t = 0;
-	if (t > this.size - 1)t = this.size - 1;
-	for (var n = e; n < t; n = (n + 1) % this.size)delete this.items[n];
-	if (this.tail > e - 1 || this.tail < t)if (this.tail < this.head) {
-		this.tail = (e - 1) % this.size
-	} else {
-		this.tail = t
-	}
-	if (this.head > e || this.head < t)if (this.tail < this.head) {
-		this.head = t
-	} else {
-		this.head = e
-	}
-	if (e !== t)this.full = false;
-	for (var r = 0; r < this.size; r++)if (this.items[r] !== undefined) {
-		this.empty = false;
-		return
-	}
-	this.empty = true
-};
-CircularBuffer.prototype.freeAll = function () {
-	for (var e = 0; e < this.size; e++)delete this.items[e];
-	this.empty = true;
-	this.head = 0;
-	this.tail = 0
-};
-CircularBuffer.prototype.read = function (e) {
-	return this.items[e % this.size]
-};
-CircularBuffer.prototype.isEmpty = function () {
-	return this.empty
-};
-CircularBuffer.prototype.isFull = function () {
-	return this.full
-};
-CircularBuffer.prototype.clone = function () {
-	var e = new CircularBuffer(this.size);
-	e.head = this.head;
-	e.tail = this.tail;
-	for (var t = 0; t < this.items.length; t++)e.items[t] = this.items[t];
-	e.empty = this.empty;
-	e.full = this.full;
-	return e
-};
-CircularBuffer.prototype.resize = function (e) {
-	if (this.size < e) {
-		if (this.head < this.tail + 1) {
-			for (var t = 0; t < this.head; t++) {
-				this.items[(t + this.size) % e] = this.items[t];
-				delete this.items[t]
-			}
-			this.head = (this.head + this.size) % e
-		}
-	} else if (this.size > e) {
-		if (this.head < this.tail + 1) {
-			var n = e;
-			if (this.tail > e - 1) {
-				n = this.tail;
-				this.tail = 0
-			}
-			var r = this.size - n;
-			for (var i = this.head - r - 1; i > n - 1 || i < this.head - r; i--) {
-				this.items[(i + r) % this.size] = this.items[i];
-				if (!i)i = this.size
-			}
-			this.head = (this.head + r) % this.size
-		}
-	}
-	this.size = e
-};
-DoubleLinkedList.prototype = new Aggregate;
-DoubleLinkedList.prototype.constructor = DoubleLinkedList;
-DoubleLinkedList.prototype.getIterator = function () {
-	return new DoubleLinkedListIterator(this)
-};
-DoubleLinkedList.prototype.pushFront = function (e) {
-	var t = new DLLNode(e);
-	t.next = this.first;
-	this.first = t;
-	if (t.next)t.next.previous = t; else this.last = t;
-	this.length++
-};
-DoubleLinkedList.prototype.pushBack = function (e) {
-	var t = new DLLNode(e);
-	t.previous = this.last;
-	this.last = t;
-	if (t.previous)t.previous.next = t; else this.first = t;
-	this.length++
-};
-DoubleLinkedList.prototype.popFront = function () {
-	if (this.length) {
-		var e = this.first;
-		this.first = e.next;
-		if (e.next)e.next.previous = null;
-		this.length--;
-		e.next = null;
-		return e.item
-	}
-	return undefined
-};
-DoubleLinkedList.prototype.popBack = function () {
-	if (this.length) {
-		var e = this.last;
-		this.last = e.previous;
-		if (e.previous)e.previous.next = null;
-		this.length--;
-		e.previous = null;
-		return e.item
-	}
-	return undefined
-};
-DoubleLinkedList.prototype.multiPopFront = function (e) {
-	var t = [];
-	for (var n = 0; n < e && this.length; n++)t.push(this.popFront());
-	return t
-};
-DoubleLinkedList.prototype.multiPopBack = function (e) {
-	var t = [];
-	for (var n = 0; n < e && this.length; n++)t.push(this.popBack());
-	return t
-};
-DoubleLinkedList.prototype.peek = function () {
-	if (!this.length)return undefined;
-	return this.first.item
-};
-DoubleLinkedList.prototype.addAt = function (e, t) {
-	if (t < 0)return;
-	if (!t) {
-		this.pushFront(e);
-		return
-	}
-	if (t === this.length) {
-		this.pushBack(e);
-		return
-	}
-	var n = this.first;
-	if (!n && t > 0)this.pushBack(undefined);
-	for (var r = 0; r < t - 1; r++, n = n.next) {
-		if (n === this.last)this.pushBack(undefined)
-	}
-	if (n === this.last)this.pushBack(e); else if (n === this.first)this.pushFront(e); else {
-		var i = new DLLNode(e);
-		i.next = n.next;
-		i.previous = n;
-		n.next = i;
-		if (i.next)i.next.previous = i;
-		this.length++
-	}
-};
-DoubleLinkedList.prototype.removeAt = function (e) {
-	if (e < 0 || e > this.length - 1)return undefined;
-	if (e === 0)return this.popFront();
-	if (e === this.length - 1)return this.popBack();
-	var t = this.first;
-	for (; e > 0; e--)t = t.next;
-	t.previous.next = t.next;
-	t.next.previous = t.previous;
-	t.next = null;
-	t.previous = null;
-	this.length--;
-	return t.item
-};
-DoubleLinkedList.prototype.remove = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = this.first;
-	var r = null;
-	while (n) {
-		if (t(n.item)) {
-			if (n === this.first)this.first = n.next;
-			if (n === this.last)this.last = r;
-			if (r) {
-				r.next = n.next;
-				if (n.next)n.next.previous = r
-			}
-			return
-		}
-		r = n;
-		n = n.next
-	}
-};
-DoubleLinkedList.prototype.removeAll = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = this.first;
-	var r = null;
-	while (n) {
-		if (t(n.item)) {
-			if (n === this.first)this.first = n.next;
-			if (n === this.last)this.last = r;
-			if (r) {
-				r.next = n.next;
-				if (n.next)n.next.previous = r
-			}
-		} else r = n;
-		n = n.next
-	}
-};
-DoubleLinkedList.prototype.removeSegment = function (e, t) {
-	var n = [];
-	if (t > -1 && e < this.length) {
-		if (e === 0)return this.multiPopFront(t + 1);
-		if (t === this.length - 1 || e > t)return this.multiPopBack(Math.max(t - e, this.length - e)).reverse();
-		var r = this.first;
-		for (var i = 0; i < e - 1; i++)r = r.next;
-		var s = r.next;
-		for (var o = e; o < t + 1 && o < this.length; o++) {
-			n.push(s.item);
-			s = s.next
-		}
-		this.length -= Math.min(t - e + 1, this.length - e);
-		r.next = s;
-		s.previous = r
-	}
-	return n
-};
-DoubleLinkedList.prototype.modifyAt = function (e, t) {
-	var n = this.getNode(e);
-	if (n)n.item = t
-};
-DoubleLinkedList.prototype.clear = function () {
-	this.first = null;
-	this.last = null;
-	this.length = 0
-};
-DoubleLinkedList.prototype.contains = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = 0;
-	var r = this.first;
-	while (n < this.length && !t(r.item)) {
-		n++;
-		r = r.next
-	}
-	return n < this.length
-};
-DoubleLinkedList.prototype.execute = function (e) {
-	var t = this.first;
-	while (t) {
-		t.item = e(t.item);
-		t = t.next
-	}
-};
-DoubleLinkedList.prototype.deleteNode = function (e) {
-	if (e === this.first) {
-		this.popFront();
-		return
-	}
-	if (e === this.last) {
-		this.popBack();
-		return
-	}
-	e.previous.next = e.next;
-	e.next.previous = e.previous;
-	this.length--
-};
-DoubleLinkedList.prototype.getNode = function (e, t) {
-	if (e < 0 || e > this.length - 1)return undefined;
-	var n = Math.floor(this.length / 2);
-	if (e < n || t) {
-		t = t || this.first;
-		for (; e > 0; e--)t = t.next
-	} else for (e = this.length - e - 1, t = this.last; e > 0; e--)t = t.previous;
-	return t
-};
-DoubleLinkedList.prototype.getItem = function (e) {
-	if (e < 0 || e > this.length - 1)return undefined;
-	var t;
-	var n = Math.floor(this.length / 2);
-	if (e < n)for (t = this.first; e > 0; e--)t = t.next; else for (e = this.length - e - 1, t = this.last; e > 0; e--)t = t.previous;
-	return t.item
-};
-DoubleLinkedList.prototype.parallelSort = function () {
-	function n(r, i, s) {
-		if (r < i) {
-			var o = Math.floor((r + i) / 2);
-			var u = new Worker("DoubleLinkedList/WorkerSort.js");
-			var a = new Worker("DoubleLinkedList/WorkerSort.js");
-			e.push(u);
-			e.push(a);
-			var f = e.length;
-			u.postMessage({cmd: "start", from: r, to: o, worker: s});
-			a.postMessage({cmd: "start", from: o + 1, to: i, worker: s});
-			n(r, o, f - 2);
-			n(o + 1, i, f - 1);
-			u.onmessage = function (n) {
-				var r = n.data;
-				switch (r.cmd) {
-					case"finished":
-						e[r.worker].postMessage({cmd: "finished", array: t});
-						break;
-					case"replace":
-						t[r.index] = r.value;
-						break
-				}
-			};
-			a.onmessage = function (n) {
-				var r = n.data;
-				switch (r.cmd) {
-					case"finished":
-						e[r.worker].postMessage({cmd: "finished", array: t});
-						break;
-					case"replace":
-						t[r.index] = r.value;
-						break
-				}
-			}
-		}
-	}
-
-	var e = [];
-	var t = this.toArray();
-	console.log(t);
-	var r = this;
-	var i = new Worker("DoubleLinkedList/WorkerSort.js");
-	e.push(i);
-	i.postMessage({cmd: "start", from: 0, to: this.length - 1, worker: -1, array: t});
-	i.onmessage = function (e) {
-		var n = e.data;
-		switch (n.cmd) {
-			case"finished":
-				r.fromArray(t);
-				console.log(r);
-				break;
-			case"replace":
-				t[n.index] = n.value
-		}
-	};
-	n(0, this.length - 1, 0)
-};
-DoubleLinkedList.prototype.sort = function (e) {
-	function n(e, i, s, o) {
-		if (e < i) {
-			var u = Math.floor((e + i) / 2);
-			var a = t.getNode(u - e, s);
-			n(e, u, s, a);
-			n(u + 1, i, a.next, o);
-			r(e, u, i, s)
-		}
-	}
-
-	function r(t, n, r, i) {
-		var s = [];
-		var o = [];
-		var u = i;
-		for (var a = 0; a < n - t + 1; a++, u = u.next)s[a] = u.item;
-		for (var f = 0; f < r - n; f++, u = u.next)o[f] = u.item;
-		var l = 0, c = 0;
-		for (var h = t; h < r + 1; h++, i = i.next) {
-			if (c > r - n - 1 || e(s[l]) <= e(o[c]) && l < n - t + 1) {
-				i.item = s[l];
-				l++
-			} else {
-				i.item = o[c];
-				c++
-			}
-		}
-	}
-
-	if (!e)e = function (e) {
-		return e
-	};
-	var t = this;
-	n(0, this.length - 1, this.first, this.last)
-};
-DoubleLinkedList.prototype.toArray = function () {
-	var e = [];
-	for (var t = this.first, n = 0; t; t = t.next, n++)e[n] = t.item;
-	return e
-};
-DoubleLinkedList.prototype.getLength = function () {
-	return this.length
-};
-DoubleLinkedList.prototype.fromArray = function (e) {
-	var t = this.first;
-	for (var n = 0; n < Math.min(this.length, e.length); n++, t = t.next)t.item = e[n];
-	if (this.length < e.length)for (var r = this.length; r < e.length; r++)this.pushBack(e[r]); else for (var i = e.length; i < this.length;)this.popBack()
-};
-DoubleLinkedList.prototype.filter = function (e) {
-	var t = [];
-	for (var n = this.first; n; n = n.next) {
-		if (e(n.item))t.push(n.item)
-	}
-	return t
-};
-DoubleLinkedList.prototype.reverse = function () {
-	for (var e = this.first, t = this.last; e !== t && e.previous !== t; e = e.next, t = t.previous) {
-		var n = e.item;
-		e.item = t.item;
-		t.item = n
-	}
-};
-DoubleLinkedList.prototype.isEmpty = function () {
-	return!this.length
-};
-DoubleLinkedList.prototype.indexOf = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = 0;
-	var r = this.first;
-	while (r) {
-		if (t(r.item))return n;
-		n++;
-		r = r.next
-	}
-	return-1
-};
-DoubleLinkedList.prototype.lastIndexOf = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = this.length - 1;
-	var r = this.last;
-	while (r) {
-		if (t(r.item))return n;
-		n--;
-		r = r.previous
-	}
-	return-1
-};
-DoubleLinkedList.prototype.allIndexesOf = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = 0;
-	var r = this.first;
-	var i = [];
-	while (r) {
-		if (t(r.item))i.push(n);
-		n++;
-		r = r.next
-	}
-	return i
-};
-DoubleLinkedList.prototype.join = function (e) {
-	if (this.last)this.last.next = e.first; else this.first = e.first;
-	if (e.first)e.first.previous = this.last;
-	this.last = e.last;
-	this.length += e.length
-};
-DoubleLinkedList.prototype.divide = function (e) {
-	var t = new DoubleLinkedList;
-	if (e > -1 && e < this.length) {
-		var n = this.first;
-		var r = null;
-		for (var i = 0; i < e; i++) {
-			r = n;
-			n = n.next
-		}
-		if (n === this.first) {
-			t.first = this.first;
-			t.last = this.last;
-			this.first = null;
-			this.last = null
-		} else {
-			t.first = n;
-			t.last = this.last;
-			this.last = r;
-			r.next = null;
-			n.previous = null
-		}
-		t.length = this.length - e;
-		this.length = e
-	}
-	return t
-};
-DoubleLinkedList.prototype.clone = function () {
-	var e = new DoubleLinkedList;
-	var t = this.first;
-	for (var n = 0; n < this.length; n++, t = t.next)if (t.item.clone)e.pushBack(t.item.clone()); else e.pushBack(t.item);
-	return e
-};
-DoubleLinkedList.prototype.cloneDistinct = function () {
-	var e = new DoubleLinkedList;
-	var t = this.first;
-	for (var n = 0; n < this.length; n++, t = t.next)if (!e.contains(t.item))if (t.item.cloneDistinct)e.pushBack(t.item.cloneDistinct()); else if (t.item.clone)e.pushBack(t.item.clone()); else e.pushBack(t.item);
-	return e
-};
-DoubleLinkedList.prototype.split = function (e) {
-	var t = this.length;
-	var n = [this];
-	for (var r = e; r < t; r += e)n.push(n[n.length - 1].divide(e));
-	return n
-};
-DoubleLinkedList.prototype.count = function (e) {
-	var t = 0;
-	var n = this.first;
-	while (n) {
-		if (e(n.item))t++;
-		n = n.next
-	}
-	return t
-};
-DoubleLinkedListIterator.prototype = new Iterator;
-DoubleLinkedListIterator.prototype.constructor = DoubleLinkedListIterator;
-DoubleLinkedListIterator.prototype.first = function () {
-	this.pointer = this.aggregate.first
-};
-DoubleLinkedListIterator.prototype.next = function () {
-	this.pointer = this.pointer.next
-};
-DoubleLinkedListIterator.prototype.last = function () {
-	this.pointer = this.aggregate.last
-};
-DoubleLinkedListIterator.prototype.previous = function () {
-	this.pointer = this.pointer.previous
-};
-DoubleLinkedListIterator.prototype.isDone = function () {
-	return!this.pointer
-};
-DoubleLinkedListIterator.prototype.getItem = function () {
-	return this.pointer.item
-};
-DoubleLinkedListIterator.prototype.getNode = function () {
-	return this.pointer
-};
-onmessage = function (e) {
-	var t = e.data;
-	switch (t.cmd) {
-		case"start":
-			this.finished = 0;
-			this.from = t.from;
-			this.to = t.to;
-			this.worker = t.worker;
-			if (this.from === this.to) {
-				this.postMessage({cmd: "finished", worker: this.worker});
-				close()
-			}
-			break;
-		case"finished":
-			this.finished++;
-			if (this.finished > 1) {
-				this.array = t.array;
-				merge(this.from, this.to, this.array);
-				this.postMessage({cmd: "finished", worker: this.worker});
-				close()
-			}
-			break;
-		default:
-			this.postMessage("Something went wrong")
-	}
-};
-HashTable.prototype.insert = function (e, t) {
-	this.keyLength++;
-	this.items[this.hash(e)].pushBack({key: e, item: t})
-};
-HashTable.prototype.deleteKey = function (e) {
-	var t = this.items[this.hash(e)];
-	var n = t.getIterator();
-	for (n.first(); !n.isDone() && n.getItem().key !== e;)n.next();
-	if (!n.isDone()) {
-		t.deleteNode(n.getNode());
-		this.keyLength--
-	}
-};
-HashTable.prototype.deleteAllKey = function (e) {
-	var t = this.items[this.hash(e)];
-	var n = t.getIterator();
-	var r = 0;
-	for (n.first(); !n.isDone(); n.next())if (n.getItem().key === e) {
-		t.deleteNode(n.getNode());
-		r++
-	}
-	this.keyLength -= r
-};
-HashTable.prototype.search = function (e) {
-	var t = this.items[this.hash(e)];
-	var n = t.getIterator();
-	for (n.first(); !n.isDone(); n.next())if (n.getItem().key === e)return n.getItem().item;
-	return undefined
-};
-HashTable.prototype.containsKey = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = this.items[this.hash(e)];
-	var r = n.getIterator();
-	for (r.first(); !r.isDone(); r.next())if (t(r.getItem().key))return true;
-	return false
-};
-HashTable.prototype.searchAll = function (e) {
-	var t = this.items[this.hash(e)];
-	var n = t.getIterator();
-	var r = [];
-	for (n.first(); !n.isDone(); n.next())if (n.getItem().key === e)r.push(n.getItem().item);
-	return r
-};
-HashTable.prototype.getKeys = function () {
-	var e = [];
-	for (var t = 0; t < this.size; t++) {
-		var n = this.items[t].getIterator();
-		for (n.first(); !n.isDone(); n.next())e.push(n.getItem().key)
-	}
-	return e
-};
-HashTable.prototype.getItems = function () {
-	var e = [];
-	for (var t = 0; t < this.size; t++) {
-		var n = this.items[t].getIterator();
-		for (n.first(); !n.isDone(); n.next())e.push(n.getItem().item)
-	}
-	return e
-};
-HashTable.prototype.clear = function () {
-	this.items = [];
-	for (var e = 0; e < this.size; e++)this.items[e] = new DoubleLinkedList;
-	this.keyLength = 0
-};
-HashTable.prototype.getNumberOfKeys = function () {
-	return this.keyLength
-};
-HashTable.prototype.isEmpty = function () {
-	return!this.keyLength
-};
-HashTable.prototype.execute = function (e) {
-	for (var t = 0; t < this.size; t++)this.items[t].execute(e)
-};
-HashTable.prototype.filter = function (e) {
-	var t = [];
-	for (var n = 0; n < this.size; n++)t.concat(this.items[n].filter(e));
-	return t
-};
-HashTable.prototype.getSize = function () {
-	return this.size
-};
-HashTable.prototype.clone = function () {
-	var e = new HashTable(this.size);
-	for (var t = 0; t < this.size; t++)for (var n = this.items[t].first; n; n = n.next)e.insert(n.key, n.item);
-	return e
-};
-LinkedList.prototype = new Aggregate;
-LinkedList.prototype.constructor = LinkedList;
-LinkedList.prototype.getIterator = function () {
-	return new LinkedListIterator(this)
-};
-LinkedList.prototype.pushFront = function (e) {
-	var t = new LLNode(e);
-	t.next = this.first;
-	this.first = t;
-	if (!this.last)this.last = t;
-	this.length++
-};
-LinkedList.prototype.pushBack = function (e) {
-	var t = new LLNode(e);
-	if (this.last)this.last.next = t; else this.first = t;
-	this.last = t;
-	this.length++
-};
-LinkedList.prototype.popFront = function () {
-	if (this.length) {
-		var e = this.first;
-		this.first = this.first.next;
-		this.length--;
-		e.next = null;
-		return e.item
-	}
-	return undefined
-};
-LinkedList.prototype.popBack = function () {
-	if (this.length) {
-		var e = this.last;
-		var t = this.first;
-		while (t.next && t.next.next) {
-			t = t.next
-		}
-		if (e === t)this.last = null; else this.last = t;
-		t.next = null;
-		this.length--;
-		return e.item
-	}
-	return undefined
-};
-LinkedList.prototype.multiPopFront = function (e) {
-	var t = [];
-	for (var n = 0; n < e && this.length; n++)t.push(this.popFront());
-	return t
-};
-LinkedList.prototype.multiPopBack = function (e) {
-	var t = [];
-	for (var n = 0; n < e && this.length; n++)t.push(this.popBack());
-	return t
-};
-LinkedList.prototype.peek = function () {
-	if (!this.length)return undefined;
-	return this.first.item
-};
-LinkedList.prototype.addAt = function (e, t) {
-	if (t < 0)return;
-	if (!t) {
-		this.pushFront(e);
-		return
-	}
-	if (t === this.length) {
-		this.pushBack(e);
-		return
-	}
-	var n = this.first;
-	if (!n && t > 0)this.pushBack(undefined);
-	for (var r = 0; r < t - 1; r++, n = n.next) {
-		if (n === this.last)this.pushBack(undefined)
-	}
-	if (n === this.last)this.pushBack(e); else if (n === this.first)this.pushFront(e); else {
-		var i = new LLNode(e);
-		i.next = n.next;
-		n.next = i;
-		this.length++
-	}
-};
-LinkedList.prototype.removeAt = function (e) {
-	if (e < 0 || e > this.length - 1)return undefined;
-	if (e === 0)return this.popFront();
-	if (e === this.length - 1)return this.popBack();
-	var t = this.first;
-	for (; e > 1; e--)t = t.next;
-	var n = t.next;
-	t.next = n.next;
-	this.length--;
-	return n.item
-};
-LinkedList.prototype.remove = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = this.first;
-	var r = null;
-	while (n) {
-		if (t(n.item)) {
-			if (n === this.first)this.first = n.next;
-			if (n === this.last)this.last = r;
-			if (r)r.next = n.next;
-			return
-		}
-		r = n;
-		n = n.next
-	}
-};
-LinkedList.prototype.removeAll = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = this.first;
-	var r = null;
-	while (n) {
-		if (t(n.item)) {
-			if (n === this.first)this.first = n.next;
-			if (n === this.last)this.last = r;
-			if (r)r.next = n.next
-		} else r = n;
-		n = n.next
-	}
-};
-LinkedList.prototype.removeSegment = function (e, t) {
-	var n = [];
-	if (t > -1 && e < this.length) {
-		if (e === 0)return this.multiPopFront(t + 1);
-		if (t === this.length - 1 || e > t)return this.multiPopBack(Math.max(t - e, this.length - e)).reverse();
-		var r = this.first;
-		for (var i = 0; i < e - 1; i++)r = r.next;
-		var s = r.next;
-		for (var o = e; o < t + 1 && o < this.length; o++) {
-			n.push(s.item);
-			s = s.next
-		}
-		this.length -= Math.min(t - e + 1, this.length - e);
-		r.next = s
-	}
-	return n
-};
-LinkedList.prototype.modifyAt = function (e, t) {
-	var n = this.getNode(e);
-	if (n)n.item = t
-};
-LinkedList.prototype.clear = function () {
-	this.first = null;
-	this.last = null;
-	this.length = 0
-};
-LinkedList.prototype.contains = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = 0;
-	var r = this.first;
-	while (n < this.length && !t(r.item)) {
-		n++;
-		r = r.next
-	}
-	return n < this.length
-};
-LinkedList.prototype.execute = function (e) {
-	var t = this.first;
-	while (t) {
-		t.item = e(t.item);
-		t = t.next
-	}
-};
-LinkedList.prototype.getNode = function (e) {
-	if (e < 0 || e > this.length - 1)return undefined;
-	var t = this.first;
-	for (; e > 0; e--)t = t.next;
-	return t
-};
-LinkedList.prototype.getItem = function (e) {
-	if (e < 0 || e > this.length - 1)return undefined;
-	var t = this.first;
-	for (; e > 0; e--)t = t.next;
-	return t.item
-};
-LinkedList.prototype.toArray = function () {
-	var e = [];
-	for (var t = this.first, n = 0; t; t = t.next, n++)e[n] = t.item;
-	return e
-};
-LinkedList.prototype.getLength = function () {
-	return this.length
-};
-LinkedList.prototype.fromArray = function (e) {
-	var t = this.first;
-	for (var n = 0; n < Math.min(this.length, e.length); n++, t = t.next)t.item = e[n];
-	if (this.length < e.length)for (var r = this.length; r < e.length; r++)this.pushBack(e[r]); else for (var i = e.length; i < this.length;)this.popBack()
-};
-LinkedList.prototype.filter = function (e) {
-	var t = [];
-	for (var n = this.first; n; n = n.next) {
-		if (e(n.item))t.push(n.item)
-	}
-	return t
-};
-LinkedList.prototype.isEmpty = function () {
-	return!this.length
-};
-LinkedList.prototype.indexOf = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = 0;
-	var r = this.first;
-	while (r) {
-		if (t(r.item))return n;
-		n++;
-		r = r.next
-	}
-	return-1
-};
-LinkedList.prototype.lastIndexOf = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = 0;
-	var r = this.first;
-	var i = -1;
-	while (r) {
-		if (t(r.item))i = n;
-		n++;
-		r = r.next
-	}
-	return i
-};
-LinkedList.prototype.allIndexesOf = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = 0;
-	var r = this.first;
-	var i = [];
-	while (r) {
-		if (t(r.item))i.push(n);
-		n++;
-		r = r.next
-	}
-	return i
-};
-LinkedList.prototype.join = function (e) {
-	if (this.last)this.last.next = e.first; else this.first = e.first;
-	this.last = e.last;
-	this.length += e.length
-};
-LinkedList.prototype.divide = function (e) {
-	var t = new LinkedList;
-	if (e > -1 && e < this.length) {
-		var n = this.first;
-		var r = null;
-		for (var i = 0; i < e; i++) {
-			r = n;
-			n = n.next
-		}
-		if (n === this.first) {
-			t.first = this.first;
-			t.last = this.last;
-			this.first = null;
-			this.last = null
-		} else {
-			t.first = n;
-			t.last = this.last;
-			this.last = r;
-			r.next = null
-		}
-		t.length = this.length - e;
-		this.length = e
-	}
-	return t
-};
-LinkedList.prototype.clone = function () {
-	var e = new LinkedList;
-	var t = this.first;
-	for (var n = 0; n < this.length; n++, t = t.next)if (t.item.clone)e.pushBack(t.item.clone()); else e.pushBack(t.item);
-	return e
-};
-LinkedList.prototype.cloneDistinct = function () {
-	var e = new LinkedList;
-	var t = this.first;
-	for (var n = 0; n < this.length; n++, t = t.next)if (!e.contains(t.item))if (t.item.cloneDistinct)e.pushBack(t.item.cloneDistinct()); else if (t.item.clone)e.pushBack(t.item.clone()); else e.pushBack(t.item);
-	return e
-};
-LinkedList.prototype.split = function (e) {
-	var t = this.length;
-	var n = [this];
-	for (var r = e; r < t; r += e)n.push(n[n.length - 1].divide(e));
-	return n
-};
-LinkedList.prototype.count = function (e) {
-	var t = 0;
-	var n = this.first;
-	while (n) {
-		if (e(n.item))t++;
-		n = n.next
-	}
-	return t
-};
-LinkedListIterator.prototype = new Iterator;
-LinkedListIterator.prototype.constructor = LinkedListIterator;
-LinkedListIterator.prototype.first = function () {
-	this.pointer = this.aggregate.first
-};
-LinkedListIterator.prototype.next = function () {
-	this.pointer = this.pointer.next
-};
-LinkedListIterator.prototype.last = function () {
-	this.pointer = this.aggregate.last
-};
-LinkedListIterator.prototype.previous = function () {
-	var e = this.pointer;
-	for (this.pointer = this.first(); this.pointer.next !== e;)this.next()
-};
-LinkedListIterator.prototype.isDone = function () {
-	return!this.pointer
-};
-LinkedListIterator.prototype.getItem = function () {
-	return this.pointer.item
-};
-LinkedListIterator.prototype.getNode = function () {
-	return this.pointer
-};
-PriorityQueue.prototype = new Aggregate;
-PriorityQueue.prototype.constructor = PriorityQueue;
-PriorityQueue.prototype.getIterator = function () {
-	return new PriorityQueueIterator(this)
-};
-PriorityQueue.prototype.enqueue = function (e, t) {
-	var n = this.items.search(e);
-	if (!n) {
-		n = new Queue;
-		this.items.insert(e, n)
-	}
-	n.enqueue(t);
-	this.length++
-};
-PriorityQueue.prototype.multiEnqueue = function (e, t) {
-	for (var n = 0; n < t.length; n++)this.enqueue(e, t[n])
-};
-PriorityQueue.prototype.dequeue = function () {
-	var e = this.items.maximum();
-	var t = undefined;
-	if (e) {
-		var n = e.item;
-		t = n.dequeue();
-		if (n.isEmpty())this.items.deleteNode(e);
-		this.length--
-	}
-	return t
-};
-PriorityQueue.prototype.multiDequeue = function (e) {
-	var t = [];
-	for (var n = 0; n < e && this.length; n++)t.push(this.dequeue());
-	return t
-};
-PriorityQueue.prototype.remove = function (e, t) {
-	t = t || 1;
-	var n = this.items.getIterator();
-	for (n.last(); !n.isDone() && t > 0; n.previous()) {
-		var r = n.getItem();
-		if (e > -1 && e < r.getLength()) {
-			var i = r.getLength();
-			r.remove(e, t);
-			t -= i - e;
-			e = 0;
-			if (!r.getLength())this.items.deleteNode(n.getNode())
-		} else e = e - r.getLength()
-	}
-};
-PriorityQueue.prototype.getItem = function (e) {
-	var t = this.items.getIterator();
-	for (t.last(); !t.isDone(); t.previous()) {
-		var n = t.getItem();
-		if (e > -1 && e < n.getLength())return n.getItem(e);
-		e = e - n.getLength()
-	}
-	return undefined
-};
-PriorityQueue.prototype.getItems = function (e) {
-	var t = this.items.search(e);
-	if (t)return t.items;
-	return[]
-};
-PriorityQueue.prototype.peek = function () {
-	return this.items.maximum().item.peek()
-};
-PriorityQueue.prototype.getLength = function () {
-	return this.length
-};
-PriorityQueue.prototype.isEmpty = function () {
-	return!this.length
-};
-PriorityQueue.prototype.clear = function () {
-	this.items = new RBTreeList;
-	this.length = 0
-};
-PriorityQueue.prototype.containsPriority = function (e, t) {
-	if (t)return this.items.fullContains(t); else return this.items.contains(e)
-};
-PriorityQueue.prototype.toQueue = function () {
-	var e = new Queue;
-	var t = this.items.getIterator();
-	for (t.last(); !t.isDone(); t.previous()) {
-		var n = t.getItem();
-		var r = n.getIterator();
-		for (r.first(); !r.isDone(); r.next())e.enqueue(r.getItem())
-	}
-	return e
-};
-PriorityQueue.prototype.execute = function (e) {
-	var t = this.items.getIterator();
-	for (t.last(); !t.isDone(); t.previous())t.getItem().execute(e)
-};
-PriorityQueue.prototype.changePriority = function (e, t) {
-	var n = this.getItem(e);
-	this.remove(e);
-	this.enqueue(t, n)
-};
-PriorityQueue.prototype.filter = function (e) {
-	var t = [];
-	var n = this.items.getIterator();
-	for (n.last(); !n.isDone(); n.previous()) {
-		var r = n.getItem().getIterator();
-		for (r.first(); !r.isDone(); r.next()) {
-			if (e(r.getItem()))t.push(r.getItem())
-		}
-	}
-	return t
-};
-PriorityQueue.prototype.clone = function () {
-	var e = new PriorityQueue;
-	e.items = this.items.clone();
-	e.length = this.length;
-	return e
-};
-PriorityQueue.prototype.cloneDistinct = function () {
-	var e = new PriorityQueue;
-	e.items = this.items.cloneDistinct();
-	e.length = e.items.getSize();
-	return e
-};
-PriorityQueueIterator.prototype = new Iterator;
-PriorityQueueIterator.prototype.constructor = PriorityQueueIterator;
-PriorityQueueIterator.prototype.first = function () {
-	this.pointerNode = this.aggregate.items.maximum();
-	this.pointerPosition = 0
-};
-PriorityQueueIterator.prototype.next = function () {
-	this.pointerPosition++;
-	if (this.pointerPosition > this.pointerNode.item.getLength() - 1) {
-		this.pointerNode = this.pointerNode.previous;
-		this.pointerPosition = 0
-	}
-};
-PriorityQueueIterator.prototype.last = function () {
-	this.pointerNode = this.aggregate.items.minimum();
-	this.pointerPosition = this.pointerNode.item.getLength() - 1
-};
-PriorityQueueIterator.prototype.previous = function () {
-	this.pointerPosition--;
-	if (this.pointerPosition < 0) {
-		this.pointerNode = this.pointerNode.next;
-		if (this.pointerNode)this.pointerPosition = this.pointerNode.item.getLength() - 1
-	}
-};
-PriorityQueueIterator.prototype.isDone = function () {
-	return!this.pointerNode
-};
-PriorityQueueIterator.prototype.getItem = function () {
-	return this.pointerNode.item.items[this.pointerPosition]
-};
-Queue.prototype = new Aggregate;
-Queue.prototype.constructor = Queue;
-Queue.prototype.getIterator = function () {
-	return new QueueIterator(this)
-};
-Queue.prototype.enqueue = function (e) {
-	this.items.push(e)
-};
-Queue.prototype.multiEnqueue = function (e) {
-	for (var t = 0; t < e.length; t++)this.items.push(e[t])
-};
-Queue.prototype.dequeue = function () {
-	if (!this.items.length)return undefined;
-	return this.items.splice(0, 1)[0]
-};
-Queue.prototype.multiDequeue = function (e) {
-	return this.items.splice(0, e)
-};
-Queue.prototype.remove = function (e, t) {
-	t = t || 1;
-	this.items.splice(e, t)
-};
-Queue.prototype.getItem = function (e) {
-	if (e < 0 || e > this.items.length - 1)return undefined;
-	return this.items[e]
-};
-Queue.prototype.peek = function () {
-	if (this.items.length)return this.items[0];
-	return undefined
-};
-Queue.prototype.clear = function () {
-	this.items = []
-};
-Queue.prototype.contains = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = 0;
-	while (n < this.items.length && !t(this.items[n]))n++;
-	return n < this.items.length
-};
-Queue.prototype.execute = function (e) {
-	for (var t = 0; t < this.items.length; t++)this.items[t] = e(this.items[t])
-};
-Queue.prototype.getLength = function () {
-	return this.items.length
-};
-Queue.prototype.isEmpty = function () {
-	return!this.items.length
-};
-Queue.prototype.filter = function (e) {
-	var t = [];
-	for (var n = 0; n < this.items.length; n++)if (e(this.items[n]))t.push(this.items[n]);
-	return t
-};
-Queue.prototype.indexOf = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = 0;
-	while (n < this.items.length) {
-		if (t(this.items[n]))return n;
-		n++
-	}
-	return-1
-};
-Queue.prototype.lastIndexOf = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = this.items.length - 1;
-	while (n > -1) {
-		if (t(this.items[n]))return n;
-		n--
-	}
-	return-1
-};
-Queue.prototype.allIndexesOf = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = 0;
-	var r = [];
-	while (n < this.items.length) {
-		if (t(this.items[n]))r.push(n);
-		n++
-	}
-	return r
-};
-Queue.prototype.clone = function () {
-	var e = new Queue;
-	for (var t = 0; t < this.items.length; t++)if (this.items[t].clone)e.enqueue(this.items[t].clone()); else e.enqueue(this.items[t]);
-	return e
-};
-Queue.prototype.cloneDistinct = function () {
-	var e = new Queue;
-	for (var t = 0; t < this.items.length; t++)if (!e.contains(this.items[t]))if (this.items[t].cloneDistinct)e.enqueue(this.items[t].cloneDistinct()); else if (this.items[t].clone)e.enqueue(this.items[t].clone()); else e.enqueue(this.items[t]);
-	return e
-};
-QueueIterator.prototype = new Iterator;
-QueueIterator.prototype.constructor = QueueIterator;
-QueueIterator.prototype.first = function () {
-	this.pointer = 0
-};
-QueueIterator.prototype.next = function () {
-	this.pointer++
-};
-QueueIterator.prototype.last = function () {
-	this.pointer = this.aggregate.items.length - 1
-};
-QueueIterator.prototype.previous = function () {
-	this.pointer--
-};
-QueueIterator.prototype.isDone = function () {
-	return this.pointer < 0 || this.pointer > this.aggregate.items.length - 1
-};
-QueueIterator.prototype.getItem = function () {
-	return this.aggregate.getItem(this.pointer)
-};
-RBTree.prototype = new Aggregate;
-RBTree.prototype.constructor = RBTree;
-RBTree.prototype.getIterator = function () {
-	return new RBTreeIterator(this)
-};
-RBTree.prototype.insert = function (e, t) {
-	var n = new RBNode(e, t);
-	this.size++;
-	if (!this.root) {
-		this.root = n;
-		n.type = "b";
-		return
-	}
-	var r = this.root;
-	for (var i = this.root; i;) {
-		r = i;
-		if (e < i.key)i = i.left; else i = i.right
-	}
-	n.parent = r;
-	if (!r)this.root = n; else if (e < r.key)r.left = n; else r.right = n;
-	this.insertFixUp(n)
-};
-RBTree.prototype.insertFixUp = function (e) {
-	for (var t = e.parent; t && t.type === "r"; t = e.parent) {
-		if (t === t.parent.left) {
-			var n = t.parent.right;
-			if (n && n.type === "r") {
-				t.type = "b";
-				n.type = "b";
-				t.parent.type = "r";
-				e = t.parent
-			} else if (e === t.right) {
-				e = t;
-				this.leftRotate(e)
-			} else {
-				t.type = "b";
-				t.parent.type = "r";
-				this.rightRotate(t.parent)
-			}
-		} else {
-			var n = t.parent.left;
-			if (n && n.type === "r") {
-				t.type = "b";
-				n.type = "b";
-				t.parent.type = "r";
-				e = t.parent
-			} else if (e === t.left) {
-				e = t;
-				this.rightRotate(e)
-			} else {
-				t.type = "b";
-				t.parent.type = "r";
-				this.leftRotate(t.parent)
-			}
-		}
-	}
-	this.root.type = "b"
-};
-RBTree.prototype.deleteNode = function (e) {
-	var t;
-	this.size--;
-	if (!e.left || !e.right)t = e; else {
-		t = this.successor(e);
-		e.key = t.key;
-		e.item = t.item
-	}
-	var n;
-	if (!t.left)n = t.right; else n = t.left;
-	if (n)n.parent = t.parent;
-	if (!t.parent)this.root = n; else if (t === t.parent.left)t.parent.left = n; else t.parent.right = n;
-	if (t.type === "b")this.deleteFixUp(n, t.parent)
-};
-RBTree.prototype.deleteFixUp = function (e, t) {
-	while (e !== this.root && (!e || e.type === "b")) {
-		if (e === t.left) {
-			var n = t.right;
-			if (n && n.type === "r") {
-				n.type = "b";
-				t.type = "r";
-				this.leftRotate(t);
-				n = t.right
-			}
-			if (n && (!n.left || n.left.type === "b") && (!n.right || n.right.type === "b")) {
-				n.type = "r";
-				e = t
-			} else {
-				if (!n.right || n.right.type === "b") {
-					n.left.type = "b";
-					n.type = "r";
-					this.rightRotate(n);
-					n = t.right
-				}
-				n.type = t.type;
-				t.type = "b";
-				n.right.type = "b";
-				this.leftRotate(t);
-				e = this.root
-			}
-		} else {
-			var n = t.left;
-			if (n && n.type === "r") {
-				n.type = "b";
-				t.type = "r";
-				this.rightRotate(t);
-				n = t.left
-			}
-			if (n && (!n.left || n.left.type === "b") && (!n.right || n.right.type === "b")) {
-				n.type = "r";
-				e = t
-			} else {
-				if (!n.left || n.left.type === "b") {
-					n.right.type = "b";
-					n.type = "r";
-					this.leftRotate(n);
-					n = t.left
-				}
-				n.type = t.type;
-				t.type = "b";
-				n.left.type = "b";
-				this.rightRotate(t);
-				e = this.root
-			}
-		}
-		t = e.parent
-	}
-	if (e)e.type = "b"
-};
-RBTree.prototype.successor = function (e) {
-	if (e.right)return this.minimum(e.right);
-	var t = e.parent;
-	while (t && e === t.right) {
-		e = t;
-		t = t.parent
-	}
-	return t
-};
-RBTree.prototype.predecessor = function (e) {
-	if (e.left)return this.maximum(e.left);
-	var t = e.parent;
-	while (t && e === t.left) {
-		e = t;
-		t = t.parent
-	}
-	return t
-};
-RBTree.prototype.search = function (e, t, n) {
-	t = t || this.root;
-	n = n || function (t) {
-		return t.key === e
-	};
-	while (t && !n(t))if (e < t.key)t = t.left; else t = t.right;
-	if (t)return t.item;
-	return undefined
-};
-RBTree.prototype.contains = function (e, t) {
-	return this.search(e, null, t) !== undefined
-};
-RBTree.prototype.fullContains = function (e) {
-	var t = this.minimum();
-	while (t && !e(t.key))t = this.successor(t);
-	return t !== null
-};
-RBTree.prototype.minimum = function (e) {
-	e = e || this.root;
-	while (e && e.left)e = e.left;
-	return e
-};
-RBTree.prototype.maximum = function (e) {
-	e = e || this.root;
-	while (e && e.right)e = e.right;
-	return e
-};
-RBTree.prototype.leftRotate = function (e) {
-	var t = e.right;
-	e.right = t.left;
-	if (t.left !== null)t.left.parent = e;
-	t.parent = e.parent;
-	if (e.parent === null)this.root = t; else if (e === e.parent.left)e.parent.left = t; else e.parent.right = t;
-	e.parent = t;
-	t.left = e
-};
-RBTree.prototype.rightRotate = function (e) {
-	var t = e.left;
-	e.left = t.right;
-	if (t.right !== null)t.right.parent = e;
-	t.parent = e.parent;
-	if (e.parent === null)this.root = t; else if (e === e.parent.left)e.parent.left = t; else e.parent.right = t;
-	e.parent = t;
-	t.right = e
-};
-RBTree.prototype.getSize = function () {
-	return this.size
-};
-RBTree.prototype.clone = function () {
-	var e = new RBTree;
-	var t = this.getIterator();
-	for (t.first(); !t.isDone(); t.next())if (t.getNode().item.clone)e.insert(t.getNode().key, t.getNode().item.clone()); else e.insert(t.getNode().key, t.getNode().item);
-	return e
-};
-RBTree.prototype.cloneDistinct = function () {
-	var e = new RBTree;
-	var t = this.getIterator();
-	for (t.first(); !t.isDone(); t.next()) {
-		var n = function (e) {
-			return e.key === t.getNode().key && e.item === t.getNode().item
-		};
-		if (!e.contains(t.getNode().key, n)) {
-			if (t.getNode().item.cloneDistinct)e.insert(t.getNode().key, t.getNode().item.cloneDistinct()); else if (t.getNode().item.clone)e.insert(t.getNode().key, t.getNode().item.clone()); else e.insert(t.getNode().key, t.getNode().item)
-		}
-	}
-	return e
-};
-RBTree.prototype.toArray = function () {
-	var e = [];
-	for (var t = this.minimum(); t; t = this.successor(t))e.push(t.item);
-	return e
-};
-RBTree.prototype.clear = function () {
-	this.root = null;
-	this.size = 0
-};
-RBTree.prototype.isEmpty = function () {
-	return!this.size
-};
-RBTree.prototype.execute = function (e) {
-	for (var t = this.minimum(); t; t = this.successor(t))t.item = e(t.item)
-};
-RBTree.prototype.filter = function (e) {
-	var t = [];
-	for (var n = this.minimum(); n; n = this.successor(n))if (e(n.item))t.push(n.item);
-	return t
-};
-RBTree.prototype.indexOf = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = 0, r = this.minimum();
-	while (r) {
-		if (t(r.item))return n;
-		r = this.successor(r);
-		n++
-	}
-	return-1
-};
-RBTree.prototype.lastIndexOf = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = this.size - 1, r = this.maximum();
-	while (r) {
-		if (t(r.item))return n;
-		n--;
-		r = this.predecessor(r)
-	}
-	return-1
-};
-RBTree.prototype.allIndexesOf = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = 0, r = this.minimum();
-	var i = [];
-	while (r) {
-		if (t(r.item))i.push(n);
-		n++;
-		r = this.successor(r)
-	}
-	return i
-};
-RBTree.prototype.getItem = function (e) {
-	if (e < 0 || e > this.size - 1)return undefined;
-	for (var t = this.minimum(), n = 0; n < e; t = this.successor(t))n++;
-	return t.item
-};
-RBTreeIterator.prototype = new Iterator;
-RBTreeIterator.prototype.constructor = RBTreeIterator;
-RBTreeIterator.prototype.first = function () {
-	this.pointer = this.aggregate.minimum()
-};
-RBTreeIterator.prototype.next = function () {
-	this.pointer = this.aggregate.successor(this.pointer)
-};
-RBTreeIterator.prototype.last = function () {
-	this.pointer = this.aggregate.maximum()
-};
-RBTreeIterator.prototype.previous = function () {
-	this.pointer = this.aggregate.predecessor(this.pointer)
-};
-RBTreeIterator.prototype.isDone = function () {
-	return!this.pointer
-};
-RBTreeIterator.prototype.getItem = function () {
-	return this.pointer.item
-};
-RBTreeIterator.prototype.getNode = function () {
-	return this.pointer
-};
-RBTreeList.prototype = new Aggregate;
-RBTreeList.prototype.constructor = RBTreeList;
-RBTreeList.prototype.getIterator = function () {
-	return new RBTreeListIterator(this)
-};
-RBTreeList.prototype.insert = function (e, t) {
-	var n = new RBLNode(e, t);
-	this.size++;
-	if (!this.root) {
-		this.root = n;
-		this.first = n;
-		this.last = n;
-		n.type = "b";
-		return
-	}
-	var r = this.root;
-	for (var i = this.root; i;) {
-		r = i;
-		if (e < i.key)i = i.left; else i = i.right
-	}
-	n.parent = r;
-	if (!r)this.root = n; else if (e < r.key)r.left = n; else r.right = n;
-	n.next = this.successor(n);
-	if (n.next) {
-		if (n.next.previous)n.next.previous.next = n; else this.first = n;
-		n.previous = n.next.previous;
-		n.next.previous = n
-	} else {
-		this.last = n;
-		n.previous = this.predecessor(n);
-		if (n.previous)n.previous.next = n; else this.first = n
-	}
-	this.insertFixUp(n)
-};
-RBTreeList.prototype.insertFixUp = function (e) {
-	for (var t = e.parent; t && t.type === "r"; t = e.parent) {
-		if (t === t.parent.left) {
-			var n = t.parent.right;
-			if (n && n.type === "r") {
-				t.type = "b";
-				n.type = "b";
-				t.parent.type = "r";
-				e = t.parent
-			} else if (e === t.right) {
-				e = t;
-				this.leftRotate(e)
-			} else {
-				t.type = "b";
-				t.parent.type = "r";
-				this.rightRotate(t.parent)
-			}
-		} else {
-			var n = t.parent.left;
-			if (n && n.type === "r") {
-				t.type = "b";
-				n.type = "b";
-				t.parent.type = "r";
-				e = t.parent
-			} else if (e === t.left) {
-				e = t;
-				this.rightRotate(e)
-			} else {
-				t.type = "b";
-				t.parent.type = "r";
-				this.leftRotate(t.parent)
-			}
-		}
-	}
-	this.root.type = "b"
-};
-RBTreeList.prototype.deleteNode = function (e) {
-	this.size--;
-	var t;
-	if (!e.left || !e.right)t = e; else {
-		t = this.successor(e);
-		e.key = t.key;
-		e.item = t.item
-	}
-	var n;
-	if (!t.left)n = t.right; else n = t.left;
-	if (n)n.parent = t.parent;
-	if (!t.parent)this.root = n; else if (t === t.parent.left)t.parent.left = n; else t.parent.right = n;
-	if (t.next)t.next.previous = t.previous; else this.last = t.previous;
-	if (t.previous)t.previous.next = t.next; else this.first = t.next;
-	if (t.type === "b")this.deleteFixUp(n, t.parent)
-};
-RBTreeList.prototype.deleteFixUp = function (e, t) {
-	while (e !== this.root && (!e || e.type === "b")) {
-		if (e === t.left) {
-			var n = t.right;
-			if (n && n.type === "r") {
-				n.type = "b";
-				t.type = "r";
-				this.leftRotate(t);
-				n = t.right
-			}
-			if (n && (!n.left || n.left.type === "b") && (!n.right || n.right.type === "b")) {
-				n.type = "r";
-				e = t
-			} else {
-				if (!n.right || n.right.type === "b") {
-					n.left.type = "b";
-					n.type = "r";
-					this.rightRotate(n);
-					n = t.right
-				}
-				n.type = t.type;
-				t.type = "b";
-				n.right.type = "b";
-				this.leftRotate(t);
-				e = this.root
-			}
-		} else {
-			var n = t.left;
-			if (n && n.type === "r") {
-				n.type = "b";
-				t.type = "r";
-				this.rightRotate(t);
-				n = t.left
-			}
-			if (n && (!n.left || n.left.type === "b") && (!n.right || n.right.type === "b")) {
-				n.type = "r";
-				e = t
-			} else {
-				if (!n.left || n.left.type === "b") {
-					n.right.type = "b";
-					n.type = "r";
-					this.leftRotate(n);
-					n = t.left
-				}
-				n.type = t.type;
-				t.type = "b";
-				n.left.type = "b";
-				this.rightRotate(t);
-				e = this.root
-			}
-		}
-		t = e.parent
-	}
-	if (e)e.type = "b"
-};
-RBTreeList.prototype.successor = function (e) {
-	if (e.next || e === this.last)return e.next;
-	if (e.right)return this.minimum(e.right);
-	var t = e.parent;
-	while (t && e === t.right) {
-		e = t;
-		t = t.parent
-	}
-	return t
-};
-RBTreeList.prototype.predecessor = function (e) {
-	if (e.previous || e === this.first)return e.previous;
-	if (e.left)return this.maximum(e.left);
-	var t = e.parent;
-	while (t && e === t.left) {
-		e = t;
-		t = t.parent
-	}
-	return t
-};
-RBTreeList.prototype.search = function (e, t, n) {
-	t = t || this.root;
-	n = n || function (t) {
-		return t.key === e
-	};
-	while (t && !n(t))if (e < t.key)t = t.left; else t = t.right;
-	if (t)return t.item;
-	return undefined
-};
-RBTreeList.prototype.contains = function (e, t) {
-	return this.search(e, null, t) !== undefined
-};
-RBTreeList.prototype.fullContains = function (e) {
-	var t = this.first;
-	while (t && !e(t.key))t = t.next;
-	return t !== null
-};
-RBTreeList.prototype.minimum = function (e) {
-	if (e)while (e && e.left)e = e.left; else return this.first;
-	return e
-};
-RBTreeList.prototype.maximum = function (e) {
-	if (e)while (e && e.right)e = e.right; else return this.last;
-	return e
-};
-RBTreeList.prototype.leftRotate = function (e) {
-	var t = e.right;
-	e.right = t.left;
-	if (t.left !== null)t.left.parent = e;
-	t.parent = e.parent;
-	if (e.parent === null)this.root = t; else if (e === e.parent.left)e.parent.left = t; else e.parent.right = t;
-	e.parent = t;
-	t.left = e
-};
-RBTreeList.prototype.rightRotate = function (e) {
-	var t = e.left;
-	e.left = t.right;
-	if (t.right !== null)t.right.parent = e;
-	t.parent = e.parent;
-	if (e.parent === null)this.root = t; else if (e === e.parent.left)e.parent.left = t; else e.parent.right = t;
-	e.parent = t;
-	t.right = e
-};
-RBTreeList.prototype.getSize = function () {
-	return this.size
-};
-RBTreeList.prototype.clone = function () {
-	var e = new RBTreeList;
-	var t = this.getIterator();
-	for (t.first(); !t.isDone(); t.next())e.insert(t.getNode().key, t.getNode().item);
-	return e
-};
-RBTreeList.prototype.cloneDistinct = function () {
-	var e = new RBTreeList;
-	var t = this.getIterator();
-	for (t.first(); !t.isDone(); t.next()) {
-		var n = function (e) {
-			return e.key === t.getNode().key && e.item === t.getNode().item
-		};
-		if (!e.contains(t.getNode().key, n)) {
-			if (t.getNode().item.cloneDistinct)e.insert(t.getNode().key, t.getNode().item.cloneDistinct()); else if (t.getNode().item.clone)e.insert(t.getNode().key, t.getNode().item.clone()); else e.insert(t.getNode().key, t.getNode().item)
-		}
-	}
-	return e
-};
-RBTreeList.prototype.toArray = function () {
-	var e = [];
-	for (var t = this.first; t; t = t.next)e.push(t.item);
-	return e
-};
-RBTreeList.prototype.clear = function () {
-	this.root = null;
-	this.first = null;
-	this.last = null;
-	this.size = 0
-};
-RBTreeList.prototype.isEmpty = function () {
-	return!this.size
-};
-RBTreeList.prototype.execute = function (e) {
-	for (var t = this.first; t; t = t.next)t.item = e(t.item)
-};
-RBTreeList.prototype.filter = function (e) {
-	var t = [];
-	for (var n = this.first; n; n = n.next)if (e(n.item))t.push(n.item);
-	return t
-};
-RBTreeList.prototype.indexOf = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = 0, r = this.first;
-	while (r) {
-		if (t(r.item))return n;
-		r = r.next;
-		n++
-	}
-	return-1
-};
-RBTreeList.prototype.lastIndexOf = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = this.size - 1, r = this.last;
-	while (r) {
-		if (t(r.item))return n;
-		n--;
-		r = r.previous
-	}
-	return-1
-};
-RBTreeList.prototype.allIndexesOf = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = 0, r = this.first;
-	var i = [];
-	while (r) {
-		if (t(r.item))i.push(n);
-		n++;
-		r = r.next
-	}
-	return i
-};
-RBTreeList.prototype.getItem = function (e) {
-	if (e < 0 || e > this.size - 1)return undefined;
-	for (var t = this.first, n = 0; n < e; t = t.next)n++;
-	return t.item
-};
-RBTreeListIterator.prototype = new Iterator;
-RBTreeListIterator.prototype.constructor = RBTreeListIterator;
-RBTreeListIterator.prototype.first = function () {
-	this.pointer = this.aggregate.first
-};
-RBTreeListIterator.prototype.next = function () {
-	this.pointer = this.pointer.next
-};
-RBTreeListIterator.prototype.last = function () {
-	this.pointer = this.aggregate.last
-};
-RBTreeListIterator.prototype.previous = function () {
-	this.pointer = this.pointer.previous
-};
-RBTreeListIterator.prototype.isDone = function () {
-	return!this.pointer
-};
-RBTreeListIterator.prototype.getItem = function () {
-	return this.pointer.item
-};
-RBTreeListIterator.prototype.getNode = function () {
-	return this.pointer
-};
-Set.prototype.insert = function (e) {
-	this.elements.pushBack(e);
-	e.parents.pushBack(this);
-	this.size++
-};
-Set.prototype.multiInsert = function (e) {
-	for (var t = 0; t < e.length; t++) {
-		this.elements.pushBack(e[t]);
-		e[t].parents.pushBack(this)
-	}
-	this.size += e.length
-};
-Set.prototype.union = function (e) {
-	var t = new Set;
-	t.addSubsets([this, e]);
-	this.parents.pushBack(t);
-	e.parents.pushBack(t);
-	var n = this;
-	var r = function (e) {
-		if (e === n)return t
-	};
-	var i = this.sets.getIterator();
-	for (i.first(); !i.isDone(); i.next())i.getItem().parents.execute(r);
-	r = function (n) {
-		if (n === e)return t
-	};
-	i = e.sets.getIterator();
-	for (i.first(); !i.isDone(); i.next())i.getItem().parents.execute(r);
-	return t
-};
-Set.prototype.intersect = function (e) {
-	var t = new Set;
-	var n = this.elements.getIterator();
-	for (n.first(); !n.isDone(); n.next())if (n.getItem().parents.contains(e))t.insert(n.getItem());
-	var r = this.sets.getIterator();
-	for (r.first(); !r.isDone(); r.next()) {
-		n = r.getItem().getIterator();
-		for (n.first(); !n.isDone(); n.next())if (n.getItem().parents.contains(e))t.insert(n.getItem())
-	}
-	return t
-};
-Set.prototype.difference = function (e) {
-	var t = new Set;
-	var n = this.elements.getIterator();
-	for (n.first(); !n.isDone(); n.next())if (!n.getItem().parents.contains(e))t.insert(n.getItem());
-	var r = this.sets.getIterator();
-	for (r.first(); !r.isDone(); r.next()) {
-		n = r.getItem().getIterator();
-		for (n.first(); !n.isDone(); n.next())if (!n.getItem().parents.contains(e))t.insert(n.getItem())
-	}
-	return t
-};
-Set.prototype.cartesianProduct = function (e) {
-	var t = this.getItems();
-	var n = e.getItems();
-	var r = new Set;
-	for (var i = 0; i < t.length; i++)for (var s = 0; s < n.length; s++)r.insert(new Element([t[i], n[s]]));
-	return r
-};
-Set.prototype.addSubset = function (e) {
-	this.sets.pushBack(e);
-	this.size += e.size
-};
-Set.prototype.addSubsets = function (e) {
-	for (var t = 0; t < e.length; t++)this.addSubset(e[t])
-};
-Set.prototype.getItems = function () {
-	var e = [];
-	var t = this.elements.getIterator();
-	for (t.first(); !t.isDone(); t.next())e.push(t.getItem().item);
-	var n = this.sets.getIterator();
-	for (n.first(); !n.isDone(); n.next()) {
-		t = n.getItem().getIterator();
-		for (t.first(); !t.isDone(); t.next())e.push(t.getItem().item)
-	}
-	return e
-};
-Set.prototype.getCardinality = function () {
-	return this.size
-};
-Set.prototype.isEmpty = function () {
-	return!this.size
-};
-Set.prototype.clone = function () {
-	var e = new Set;
-	e.parents = this.parents.clone();
-	e.elements = this.elements.clone();
-	e.sets = this.sets.clone();
-	e.size = this.size;
-	return e
-};
-Stack.prototype = new Aggregate;
-Stack.prototype.constructor = Stack;
-Stack.prototype.getIterator = function () {
-	return new StackIterator(this)
-};
-Stack.prototype.push = function (e) {
-	this.items.push(e)
-};
-Stack.prototype.multiPush = function (e) {
-	for (var t = 0; t < e.length; t++)this.push(e[t])
-};
-Stack.prototype.pop = function () {
-	if (!this.items.length)return undefined;
-	return this.items.pop()
-};
-Stack.prototype.multiPop = function (e) {
-	var t = [];
-	for (var n = 0; n < e && this.items.length; n++)t.push(this.pop());
-	return t
-};
-Stack.prototype.peek = function () {
-	if (!this.items.length)return undefined;
-	return this.items[this.items.length - 1]
-};
-Stack.prototype.clear = function () {
-	this.items = []
-};
-Stack.prototype.contains = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = 0;
-	while (n < this.items.length && !t(this.items[n]))n++;
-	return n < this.items.length
-};
-Stack.prototype.execute = function (e) {
-	for (var t = this.items.length - 1; t > -1; t--)this.items[t] = e(this.items[t])
-};
-Stack.prototype.getItem = function (e) {
-	if (e < 0 || e > this.items.length - 1)return undefined;
-	return this.items[this.items.length - e - 1]
-};
-Stack.prototype.getLength = function () {
-	return this.items.length
-};
-Stack.prototype.isEmpty = function () {
-	return!this.items.length
-};
-Stack.prototype.filter = function (e) {
-	var t = [];
-	for (var n = this.items.length - 1; n > -1; n--) {
-		if (e(this.items[n]))t.push(this.items[n])
-	}
-	return t
-};
-Stack.prototype.indexOf = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = this.items.length - 1;
-	while (n > -1) {
-		if (t(this.items[n]))return n;
-		n--
-	}
-	return-1
-};
-Stack.prototype.lastIndexOf = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = 0;
-	while (n < this.items.length) {
-		if (t(this.items[n]))return n;
-		n++
-	}
-	return-1
-};
-Stack.prototype.allIndexesOf = function (e, t) {
-	t = t || function (t) {
-		return t === e
-	};
-	var n = this.items.length - 1;
-	var r = [];
-	while (n > -1) {
-		if (t(this.items[n]))r.push(n);
-		n--
-	}
-	return r
-};
-Stack.prototype.clone = function () {
-	var e = new Stack;
-	for (var t = 0; t < this.items.length; t++)if (this.items[t].clone)e.push(this.items[t].clone()); else e.push(this.items[t]);
-	return e
-};
-Stack.prototype.cloneDistinct = function () {
-	var e = new Stack;
-	for (var t = 0; t < this.items.length; t++)if (!e.contains(this.items[t])) {
-		if (this.items[t].cloneDistinct)e.push(this.items[t].cloneDistinct()); else if (this.items[t].clone)e.push(this.items[t].clone()); else e.push(this.items[t])
-	}
-	return e
-};
-StackIterator.prototype = new Iterator;
-StackIterator.prototype.constructor = StackIterator;
-StackIterator.prototype.first = function () {
-	this.pointer = this.aggregate.items.length - 1
-};
-StackIterator.prototype.next = function () {
-	this.pointer--
-};
-StackIterator.prototype.last = function () {
-	this.pointer = 0
-};
-StackIterator.prototype.previous = function () {
-	this.pointer++
-};
-StackIterator.prototype.isDone = function () {
-	return this.pointer < 0 || this.pointer > this.aggregate.items.length - 1
-};
-StackIterator.prototype.getItem = function () {
-	return this.aggregate.items[this.pointer]
-}
diff --git a/Tests/BSTree_Test.js b/Tests/BSTree_Test.js
deleted file mode 100644
index 9be2a60..0000000
--- a/Tests/BSTree_Test.js
+++ /dev/null
@@ -1,82 +0,0 @@
-/**
- * Created by Stefano on 06/04/14.
- */
-
-test("BSTree - Insert test", function () {
-	var tree = new BSTree();
-	var keys = [];
-	for (var i = 0; i < 20; i++) {
-		keys.push(Math.random());
-		tree.insert(keys[i], i);
-	}
-	for (var j = 0; j < 20; j++)
-		deepEqual(tree.search(keys[j]), j, "Insert node");
-});
-
-test("BSTree - Minimum test", function () {
-	var tree = new BSTree();
-	var keys = [];
-	var min = 10;
-	for (var i = 0; i < 20; i++) {
-		keys.push(Math.random());
-		tree.insert(keys[i], i);
-		if (keys[i] < min)
-			min = keys[i];
-	}
-	deepEqual(tree.minimum().item, tree.search(min), "Minimum");
-});
-
-test("BSTree - Maximum test", function () {
-	var tree = new BSTree();
-	var keys = [];
-	var max = -1;
-	for (var i = 0; i < 20; i++) {
-		keys.push(Math.random());
-		tree.insert(keys[i], i);
-		if (keys[i] > max)
-			max = keys[i];
-	}
-	deepEqual(tree.maximum().item, tree.search(max), "Maximum");
-});
-
-test("BSTree - Successor test", function () {
-	var tree = new BSTree();
-	for (var i = 0; i < 20; i++)
-		tree.insert(i, i);
-	var it = tree.getIterator();
-	var j = 1;
-	for (it.first(); !it.isDone(); it.next(), j++) {
-		var successor = tree.successor(it.getNode());
-		if (successor)
-			deepEqual(successor.item, j, "Successor");
-		else
-			deepEqual(successor, null, "No successor");
-	}
-});
-
-test("BSTree - Predecessor test", function () {
-	var tree = new BSTree();
-	for (var i = 0; i < 20; i++)
-		tree.insert(i, i);
-	var it = tree.getIterator();
-	var j = 18;
-	for (it.last(); !it.isDone(); it.previous(), j--) {
-		var predecessor = tree.predecessor(it.getNode());
-		if (predecessor)
-			deepEqual(predecessor.item, j, "Predecessor");
-		else
-			deepEqual(predecessor, null, "No predecessor");
-	}
-});
-
-test("BSTree - Delete node test", function () {
-	var tree = new BSTree();
-	for (var i = 0; i < 20; i++)
-		tree.insert(i, i);
-	var j = 0;
-	while (tree.minimum()) {
-		deepEqual(tree.minimum().item, j, "Deletion");
-		tree.deleteNode(tree.minimum());
-		j++;
-	}
-});
\ No newline at end of file
diff --git a/Tests/BSTree_Test.ts b/Tests/BSTree_Test.ts
new file mode 100644
index 0000000..1f08e16
--- /dev/null
+++ b/Tests/BSTree_Test.ts
@@ -0,0 +1,94 @@
+/**
+ * Created by Stefano on 06/04/14.
+ */
+
+QUnit.test("BSTree - Insert test", function (assert)
+{
+	var tree = new ds.BSTree<number>();
+	var keys = [];
+	for (var i = 0; i < 20; i++)
+	{
+		keys.push(Math.random());
+		tree.insert(keys[i], i);
+	}
+	for (var j = 0; j < 20; j++)
+		assert.deepEqual(tree.search(keys[j]), j, "Insert node");
+});
+
+QUnit.test("BSTree - Minimum test", function (assert)
+{
+	var tree = new ds.BSTree();
+	var keys = [];
+	var min = 10;
+	for (var i = 0; i < 20; i++)
+	{
+		keys.push(Math.random());
+		tree.insert(keys[i], i);
+		if (keys[i] < min)
+			min = keys[i];
+	}
+	assert.deepEqual(tree.minimum().item, tree.search(min), "Minimum");
+});
+
+QUnit.test("BSTree - Maximum test", function (assert)
+{
+	var tree = new ds.BSTree();
+	var keys = [];
+	var max = -1;
+	for (var i = 0; i < 20; i++)
+	{
+		keys.push(Math.random());
+		tree.insert(keys[i], i);
+		if (keys[i] > max)
+			max = keys[i];
+	}
+	assert.deepEqual(tree.maximum().item, tree.search(max), "Maximum");
+});
+
+QUnit.test("BSTree - Successor test", function (assert)
+{
+	var tree = new ds.BSTree();
+	for (var i = 0; i < 20; i++)
+		tree.insert(i, i);
+	var it = tree.getIterator();
+	var j = 1;
+	for (it.first(); !it.isDone(); it.next(), j++)
+	{
+		var successor = tree.successor(it.getNode());
+		if (successor)
+			assert.deepEqual(successor.item, j, "Successor");
+		else
+			assert.deepEqual(successor, null, "No successor");
+	}
+});
+
+QUnit.test("BSTree - Predecessor test", function (assert)
+{
+	var tree = new ds.BSTree();
+	for (var i = 0; i < 20; i++)
+		tree.insert(i, i);
+	var it = tree.getIterator();
+	var j = 18;
+	for (it.last(); !it.isDone(); it.previous(), j--)
+	{
+		var predecessor = tree.predecessor(it.getNode());
+		if (predecessor)
+			assert.deepEqual(predecessor.item, j, "Predecessor");
+		else
+			assert.deepEqual(predecessor, null, "No predecessor");
+	}
+});
+
+QUnit.test("BSTree - Delete node test", function (assert)
+{
+	var tree = new ds.BSTree();
+	for (var i = 0; i < 20; i++)
+		tree.insert(i, i);
+	var j = 0;
+	while (tree.minimum())
+	{
+		assert.deepEqual(tree.minimum().item, j, "Deletion");
+		tree.deleteNode(tree.minimum());
+		j++;
+	}
+});
\ No newline at end of file
diff --git a/Tests/BTree_Test.js b/Tests/BTree_Test.js
deleted file mode 100644
index de73fc6..0000000
--- a/Tests/BTree_Test.js
+++ /dev/null
@@ -1,190 +0,0 @@
-/**
- * Created by Stefano on 06/04/14.
- */
-
-test("BTree - Insert test", function () {
-	var tree = new BTree(100);
-	for (var i = 0; i < 100; i++)
-		tree.insert(i, i);
-	for (var j = 0; j < 100; j++) {
-		deepEqual(tree.search(j), j, "Insert node");
-		deepEqual(tree.getItem(j), j, "Insert node");
-	}
-});
-
-test("BTree - Delete node test", function () {
-	var tree = new BTree(3);
-	for (var i = 0; i < 20; i++)
-		tree.insert(i, i);
-	tree.deleteKey(6);
-	deepEqual(tree.search(6), undefined, "Delete node 6");
-});
-
-test("BTree - Successor test", function () {
-	var tree = new BTree(3);
-	for (var i = 0; i < 20; i++)
-		tree.insert(i, i);
-	for (var j = -1; j < 19; j++)
-		deepEqual(tree.successor(j), j + 1, "Successor found");
-	deepEqual(tree.successor(19), null, "Successor not found");
-});
-
-test("BTree - Predecessor test", function () {
-	var tree = new BTree(4);
-	for (var i = 0; i < 40; i++)
-		tree.insert(i, i);
-	for (var j = 40; j > 0; j--)
-		deepEqual(tree.predecessor(j), j - 1, "Predecessor");
-	deepEqual(tree.predecessor(0), null, "Predecessor not found");
-});
-
-test("BTree - Minimum test", function () {
-	var tree = new BTree(3);
-	var keys = [];
-	var min = 10;
-	for (var i = 0; i < 20; i++) {
-		keys.push(Math.random());
-		tree.insert(keys[i], i);
-		if (keys[i] < min)
-			min = keys[i];
-	}
-	deepEqual(tree.minimum(), tree.search(min), "Minimum item");
-	deepEqual(tree.minimumKey(), min, "Minimum key");
-});
-
-test("BTree - Maximum test", function () {
-	var tree = new BTree(3);
-	var keys = [];
-	var max = -1;
-	for (var i = 0; i < 20; i++) {
-		keys.push(Math.random());
-		tree.insert(keys[i], i);
-		if (keys[i] > max)
-			max = keys[i];
-	}
-	deepEqual(tree.maximum(), tree.search(max), "Maximum item");
-	deepEqual(tree.maximumKey(), max, "Maximum key");
-});
-
-test("BTree - To array test", function () {
-	var tree = new BTree(3);
-	for (var i = 0; i < 5; i++)
-		tree.insert(i, i);
-	deepEqual(tree.toArray(), [0, 1, 2, 3, 4], "To array");
-});
-
-test("BTree - Filter test", function () {
-	var tree = new BTree(3);
-
-	for (var i = 0; i < 10; i++)
-		tree.insert(i, i);
-
-	var result = tree.filter(function (item) {
-		return 1 - item % 2;
-	});
-	deepEqual(result, [0, 2, 4, 6, 8], "Filter on the even values");
-});
-
-test("BTree - Clear test", function () {
-	var tree = new BTree(3);
-	tree.insert(0, 0);
-	tree.insert(2, 2);
-	tree.clear();
-	deepEqual(tree.isEmpty(), true, "Clear tree");
-});
-
-test("BTree - Is empty test", function () {
-	var tree = new BTree(3);
-	tree.insert(0, 0);
-	tree.insert(2, 2);
-	deepEqual(tree.isEmpty(), false, "Is not empty");
-	tree.clear();
-	deepEqual(tree.isEmpty(), true, "Is empty");
-});
-
-test("BTree - Contains test", function () {
-	var tree = new BTree(3);
-	tree.insert(0, 0);
-	tree.insert(2, 2);
-	deepEqual(tree.contains(0), true, "Contains 0");
-	deepEqual(tree.contains(2), true, "Contains 2");
-	deepEqual(tree.contains(1), false, "Not contains 1");
-	var callback = function (item) {
-		return item > 0;
-	};
-	deepEqual(tree.fullContains(callback), true, "Contains a value > 0");
-	callback = function (item) {
-		return item < 0;
-	};
-	deepEqual(tree.fullContains(callback), false, "Contains a value < 0");
-});
-
-test("BTree - Execute test", function () {
-	var tree = new BTree();
-	tree.insert(0, 0);
-	tree.insert(2, 2);
-	var callback = function (item) {
-		return item * 2;
-	};
-	tree.execute(callback);
-	deepEqual(tree.search(0), 0, "Execute for key 0");
-	deepEqual(tree.search(2), 4, "Execute for key 1");
-});
-
-test("BTree - Index of test", function () {
-	var tree = new BTree(3);
-	for (var i = 0; i < 10; i++)
-		tree.insert(i, i);
-	var callback = function (item) {
-		return !(item % 2) && item > 5;
-	};
-	deepEqual(tree.indexOf(0), 0, "Index of 0");
-	deepEqual(tree.indexOf(15), -1, "Index of 15");
-	deepEqual(tree.indexOf(5), 5, "Index of 5");
-	deepEqual(tree.indexOf(null, callback), 6, "Index of the first even number greater than 5");
-});
-
-test("BTree - Last index of test", function () {
-	var tree = new BTree(3);
-	for (var i = 0; i < 10; i++)
-		tree.insert(i, i);
-	var callback = function (item) {
-		return !(item % 2) && item > 5;
-	};
-	deepEqual(tree.lastIndexOf(0), 0, "Last index of 0");
-	deepEqual(tree.lastIndexOf(15), -1, "Last index of 15");
-	deepEqual(tree.lastIndexOf(5), 5, "Last index of 5");
-	deepEqual(tree.lastIndexOf(null, callback), 8, "Index of the last even number greater than 5");
-});
-
-test("BTree - Indexes of test", function () {
-	var tree = new BTree(3);
-	for (var i = 0; i < 30; i++)
-		tree.insert(i, i % 10);
-	var callback = function (item) {
-		return !(item % 2) && item > 5;
-	};
-	deepEqual(tree.allIndexesOf(0), [0, 10, 20], "Indexes of 0");
-	deepEqual(tree.allIndexesOf(15), [], "Indexes of 15");
-	deepEqual(tree.allIndexesOf(5), [5, 15, 25], "Indexes of 5");
-	deepEqual(tree.allIndexesOf(null, callback), [6, 8, 16, 18, 26, 28], "Indexes of the even numbers greater than 5");
-});
-
-test("BTree - Clone test", function () {
-	var tree = new BTree(3);
-	for (var i = 0; i < 10; i++)
-		tree.insert(i, i);
-	var clone = tree.clone();
-	var it = clone.getIterator();
-	var j = 0;
-	for (it.first(); !it.isDone(); it.next(), j++)
-		deepEqual(it.getItem(), j, "Clone of the tree");
-});
-
-test("BTree - Clone distinct test", function () {
-	var tree = new BTree(3);
-	for (var i = 0; i < 20; i++)
-		tree.insert(i, i % 10);
-	var clone = tree.cloneDistinct();
-	deepEqual(clone.allIndexesOf(2), [2], "Clone of the tree");
-});
\ No newline at end of file
diff --git a/Tests/BTree_Test.ts b/Tests/BTree_Test.ts
new file mode 100644
index 0000000..787f6c7
--- /dev/null
+++ b/Tests/BTree_Test.ts
@@ -0,0 +1,217 @@
+/**
+ * Created by Stefano on 06/04/14.
+ */
+
+QUnit.test("BTree - Insert test", function (assert)
+{
+	var tree = new ds.BTree(100);
+	for (var i = 0; i < 100; i++)
+		tree.insert(i, i);
+	for (var j = 0; j < 100; j++)
+	{
+		assert.deepEqual(tree.search(j), j, "Insert node");
+		assert.deepEqual(tree.getItem(j), j, "Insert node");
+	}
+});
+
+QUnit.test("BTree - Delete node test", function (assert)
+{
+	var tree = new ds.BTree(3);
+	for (var i = 0; i < 20; i++)
+		tree.insert(i, i);
+	tree.deleteKey(6);
+	assert.deepEqual(tree.search(6), undefined, "Delete node 6");
+});
+
+QUnit.test("BTree - Successor test", function (assert)
+{
+	var tree = new ds.BTree(3);
+	for (var i = 0; i < 20; i++)
+		tree.insert(i, i);
+	for (var j = -1; j < 19; j++)
+		assert.deepEqual(tree.successor(j), j + 1, "Successor found");
+	assert.deepEqual(tree.successor(19), -1, "Successor not found");
+});
+
+QUnit.test("BTree - Predecessor test", function (assert)
+{
+	var tree = new ds.BTree(4);
+	for (var i = 0; i < 40; i++)
+		tree.insert(i, i);
+	for (var j = 40; j > 0; j--)
+		assert.deepEqual(tree.predecessor(j), j - 1, "Predecessor");
+	assert.deepEqual(tree.predecessor(0), -1, "Predecessor not found");
+});
+
+QUnit.test("BTree - Minimum test", function (assert)
+{
+	var tree = new ds.BTree(3);
+	var keys = [];
+	var min = 10;
+	for (var i = 0; i < 20; i++)
+	{
+		keys.push(Math.random());
+		tree.insert(keys[i], i);
+		if (keys[i] < min)
+			min = keys[i];
+	}
+	assert.deepEqual(tree.minimum(), tree.search(min), "Minimum item");
+	assert.deepEqual(tree.minimumKey(), min, "Minimum key");
+});
+
+QUnit.test("BTree - Maximum test", function (assert)
+{
+	var tree = new ds.BTree(3);
+	var keys = [];
+	var max = -1;
+	for (var i = 0; i < 20; i++)
+	{
+		keys.push(Math.random());
+		tree.insert(keys[i], i);
+		if (keys[i] > max)
+			max = keys[i];
+	}
+	assert.deepEqual(tree.maximum(), tree.search(max), "Maximum item");
+	assert.deepEqual(tree.maximumKey(), max, "Maximum key");
+});
+
+QUnit.test("BTree - To array test", function (assert)
+{
+	var tree = new ds.BTree(3);
+	for (var i = 0; i < 5; i++)
+		tree.insert(i, i);
+	assert.deepEqual(tree.toArray(), [0, 1, 2, 3, 4], "To array");
+});
+
+QUnit.test("BTree - Filter test", function (assert)
+{
+	var tree = new ds.BTree<number>(3);
+
+	for (var i = 0; i < 10; i++)
+		tree.insert(i, i);
+
+	var result = tree.filter(function (item)
+	{
+		return Boolean(1 - item % 2);
+	});
+	assert.deepEqual(result, [0, 2, 4, 6, 8], "Filter on the even values");
+});
+
+QUnit.test("BTree - Clear test", function (assert)
+{
+	var tree = new ds.BTree(3);
+	tree.insert(0, 0);
+	tree.insert(2, 2);
+	tree.clear();
+	assert.deepEqual(tree.isEmpty(), true, "Clear tree");
+});
+
+QUnit.test("BTree - Is empty test", function (assert)
+{
+	var tree = new ds.BTree(3);
+	tree.insert(0, 0);
+	tree.insert(2, 2);
+	assert.deepEqual(tree.isEmpty(), false, "Is not empty");
+	tree.clear();
+	assert.deepEqual(tree.isEmpty(), true, "Is empty");
+});
+
+QUnit.test("BTree - Contains test", function (assert)
+{
+	var tree = new ds.BTree(3);
+	tree.insert(0, 0);
+	tree.insert(2, 2);
+	assert.deepEqual(tree.contains(0), true, "Contains 0");
+	assert.deepEqual(tree.contains(2), true, "Contains 2");
+	assert.deepEqual(tree.contains(1), false, "Not contains 1");
+	var callback = function (item)
+	{
+		return item > 0;
+	};
+	assert.deepEqual(tree.fullContains(callback), true, "Contains a value > 0");
+	callback = function (item)
+	{
+		return item < 0;
+	};
+	assert.deepEqual(tree.fullContains(callback), false, "Contains a value < 0");
+});
+
+QUnit.test("BTree - Execute test", function (assert)
+{
+	var tree = new ds.BTree();
+	tree.insert(0, 0);
+	tree.insert(2, 2);
+	var callback = function (item)
+	{
+		return item * 2;
+	};
+	tree.execute(callback);
+	assert.deepEqual(tree.search(0), 0, "Execute for key 0");
+	assert.deepEqual(tree.search(2), 4, "Execute for key 1");
+});
+
+QUnit.test("BTree - Index of test", function (assert)
+{
+	var tree = new ds.BTree(3);
+	for (var i = 0; i < 10; i++)
+		tree.insert(i, i);
+	var callback = function (item)
+	{
+		return !(item % 2) && item > 5;
+	};
+	assert.deepEqual(tree.indexOf(0), 0, "Index of 0");
+	assert.deepEqual(tree.indexOf(15), -1, "Index of 15");
+	assert.deepEqual(tree.indexOf(5), 5, "Index of 5");
+	assert.deepEqual(tree.indexOf(null, callback), 6, "Index of the first even number greater than 5");
+});
+
+QUnit.test("BTree - Last index of test", function (assert)
+{
+	var tree = new ds.BTree(3);
+	for (var i = 0; i < 10; i++)
+		tree.insert(i, i);
+	var callback = function (item)
+	{
+		return !(item % 2) && item > 5;
+	};
+	assert.deepEqual(tree.lastIndexOf(0), 0, "Last index of 0");
+	assert.deepEqual(tree.lastIndexOf(15), -1, "Last index of 15");
+	assert.deepEqual(tree.lastIndexOf(5), 5, "Last index of 5");
+	assert.deepEqual(tree.lastIndexOf(null, callback), 8, "Index of the last even number greater than 5");
+});
+
+QUnit.test("BTree - Indexes of test", function (assert)
+{
+	var tree = new ds.BTree(3);
+	for (var i = 0; i < 30; i++)
+		tree.insert(i, i % 10);
+	var callback = function (item)
+	{
+		return !(item % 2) && item > 5;
+	};
+	assert.deepEqual(tree.allIndexesOf(0), [0, 10, 20], "Indexes of 0");
+	assert.deepEqual(tree.allIndexesOf(15), [], "Indexes of 15");
+	assert.deepEqual(tree.allIndexesOf(5), [5, 15, 25], "Indexes of 5");
+	assert.deepEqual(tree.allIndexesOf(null, callback), [6, 8, 16, 18, 26, 28], "Indexes of the even numbers greater than 5");
+});
+
+QUnit.test("BTree - Clone test", function (assert)
+{
+	var tree = new ds.BTree(3);
+	for (var i = 0; i < 10; i++)
+		tree.insert(i, i);
+	var clone = tree.clone();
+	var it = clone.getIterator();
+	var j = 0;
+	for (it.first(); !it.isDone(); it.next(), j++)
+		assert.deepEqual(it.getItem(), j, "Clone of the tree");
+});
+
+QUnit.test("BTree - Clone distinct test", function (assert)
+{
+	var tree = new ds.BTree(3);
+	for (var i = 0; i < 20; i++)
+		tree.insert(i, i % 10);
+	var clone = tree.cloneDistinct();
+	assert.deepEqual(clone.allIndexesOf(2), [2], "Clone of the tree");
+});
\ No newline at end of file
diff --git a/Tests/CircularBuffer_Test.js b/Tests/CircularBuffer_Test.js
deleted file mode 100644
index 8a1a752..0000000
--- a/Tests/CircularBuffer_Test.js
+++ /dev/null
@@ -1,122 +0,0 @@
-/**
- * Created by Battistella Stefano on 31/03/14.
- */
-
-test("CircularBuffer - Write test", function () {
-	var buffer = new CircularBuffer(10);
-	buffer.write(0);
-	buffer.write(0);
-	buffer.write(0);
-	buffer.write(0);
-	for (var i = 0; i < 4; i++)
-		deepEqual(buffer.read(i), 0, "Write 0");
-	for (var j = 4; j < 10; j++)
-		deepEqual(buffer.read(j), undefined, "Write 0");
-	buffer.write(1);
-	buffer.write(1);
-	buffer.write(1);
-	buffer.write(1);
-	buffer.write(1);
-	buffer.write(1);
-	buffer.write(1);
-	buffer.write(1);
-	for (var m = 4; m < 12; m++)
-		deepEqual(buffer.read(m), 1, "Write 1");
-	for (var n = 2; n < 4; n++)
-		deepEqual(buffer.read(n), 0, "Write 1");
-	deepEqual(buffer.isFull(), true, "Is full");
-});
-
-test("CircularBuffer - Free test", function () {
-	var buffer = new CircularBuffer(10);
-	for (var k = 0; k < 12; k++)
-		buffer.write(k);
-	buffer.free(2, 8);
-	for (var i = 2; i < 8; i++)
-		deepEqual(buffer.read(i), undefined, "Free 2...8");
-	deepEqual(buffer.head, 2, "Free 2...8");
-	deepEqual(buffer.tail, 8, "Free 2...8");
-
-	for (var l = 0; l < 12; l++)
-		buffer.write(l);
-	deepEqual(buffer.head, 4, "Write 12 items");
-	deepEqual(buffer.tail, 4, "Write 12 items");
-
-	buffer.free(8, 6);
-	for (var m = 8; m < 6; m = (m + 1) % 10)
-		deepEqual(buffer.read(m), undefined, "Free 8...6");
-	deepEqual(buffer.head, 8, "Free 8...6");
-	deepEqual(buffer.tail, 6, "Free 8...6");
-
-	buffer.freeAll();
-	for (var j = 0; j < 10; j++)
-		deepEqual(buffer.read(j), undefined, "Free all");
-	deepEqual(buffer.isEmpty(), true, "Is empty");
-});
-
-test("CircularBuffer - Empty test", function () {
-	var buffer = new CircularBuffer(10);
-	buffer.write(0);
-	buffer.write(0);
-	buffer.write(0);
-	deepEqual(buffer.isEmpty(), false, "Is not empty");
-	buffer.free(0, 8);
-	deepEqual(buffer.isEmpty(), true, "Is empty");
-});
-
-test("CircularBuffer - Clone test", function () {
-	var buffer = new CircularBuffer(10);
-	for (var i = 0; i < 15; i++)
-		buffer.write(i);
-	var clone = buffer.clone();
-	for (var j = 0; j < 9; j++)
-		deepEqual(clone.read(j), buffer.read(j), "Check items");
-	deepEqual(clone.head, buffer.head, "Check head position");
-	deepEqual(clone.tail, buffer.tail, "Check tail position");
-	deepEqual(clone.isEmpty(), buffer.isEmpty(), "Check empty");
-	deepEqual(clone.isFull(), buffer.isFull(), "Check empty");
-});
-
-test("CircularBuffer - Resize test", function () {
-	var buffer = new CircularBuffer(5);
-	for (var i = 0; i < 8; i++)
-		buffer.write(i);
-	var clone = buffer.clone();
-	buffer.resize(10);
-	deepEqual(buffer.head, 8, "Check head position");
-	deepEqual(buffer.tail, 3, "Check tail position");
-	for (var j = 0; j < 10; j++)
-		if (j < 3 || j > 7)
-			deepEqual(buffer.read(j), undefined, "Increase size");
-		else
-			deepEqual(buffer.read(j), j, "Augment resize");
-	buffer = clone;
-	buffer.resize(3);
-	deepEqual(buffer.head, 0, "Check head position");
-	deepEqual(buffer.tail, 0, "Check tail position");
-	for (var k = 0; k < 3; k++)
-		deepEqual(buffer.read(k), k + 3, "Decrease size");
-});
-
-test("CircularBuffer - Iterator test", function () {
-	var buffer = new CircularBuffer(10);
-	var it = buffer.getIterator();
-	it.first();
-	deepEqual(it.isDone(), true, "Check empty buffer iterator");
-	buffer.write(0);
-	buffer.write(0);
-	buffer.write(0);
-	buffer.write(0);
-	buffer.write(1);
-	buffer.write(1);
-	buffer.write(1);
-	buffer.write(1);
-	buffer.write(1);
-	buffer.write(1);
-	buffer.write(1);
-	buffer.write(1);
-	var result = [0, 0, 1, 1, 1, 1, 1, 1, 1, 1];
-	var i = 0;
-	for (it.first(); !it.isDone(); it.next(), i++)
-		deepEqual(it.getItem(), result[i], "Check iterator");
-});
\ No newline at end of file
diff --git a/Tests/CircularBuffer_Test.ts b/Tests/CircularBuffer_Test.ts
new file mode 100644
index 0000000..bc12993
--- /dev/null
+++ b/Tests/CircularBuffer_Test.ts
@@ -0,0 +1,128 @@
+/**
+ * Created by Battistella Stefano on 31/03/14.
+ */
+
+QUnit.test("CircularBuffer - Write test", function (assert)
+{
+	var buffer = new ds.CircularBuffer(10);
+	buffer.write(0);
+	buffer.write(0);
+	buffer.write(0);
+	buffer.write(0);
+	for (var i = 0; i < 4; i++)
+		assert.deepEqual(buffer.read(i), 0, "Write 0");
+	for (var j = 4; j < 10; j++)
+		assert.deepEqual(buffer.read(j), undefined, "Write 0");
+	buffer.write(1);
+	buffer.write(1);
+	buffer.write(1);
+	buffer.write(1);
+	buffer.write(1);
+	buffer.write(1);
+	buffer.write(1);
+	buffer.write(1);
+	for (var m = 4; m < 12; m++)
+		assert.deepEqual(buffer.read(m), 1, "Write 1");
+	for (var n = 2; n < 4; n++)
+		assert.deepEqual(buffer.read(n), 0, "Write 1");
+	assert.deepEqual(buffer.isFull(), true, "Is full");
+});
+
+QUnit.test("CircularBuffer - Free test", function (assert)
+{
+	var buffer = new ds.CircularBuffer(10);
+	for (var k = 0; k < 12; k++)
+		buffer.write(k);
+	buffer.free(2, 8);
+	for (var i = 2; i < 8; i++)
+		assert.deepEqual(buffer.read(i), undefined, "Free 2...8");
+	assert.deepEqual(buffer.head, 2, "Free 2...8");
+	assert.deepEqual(buffer.tail, 8, "Free 2...8");
+
+	for (var l = 0; l < 12; l++)
+		buffer.write(l);
+	assert.deepEqual(buffer.head, 4, "Write 12 items");
+	assert.deepEqual(buffer.tail, 4, "Write 12 items");
+
+	buffer.free(8, 6);
+	for (var m = 8; m < 6; m = (m + 1) % 10)
+		assert.deepEqual(buffer.read(m), undefined, "Free 8...6");
+	assert.deepEqual(buffer.head, 8, "Free 8...6");
+	assert.deepEqual(buffer.tail, 6, "Free 8...6");
+
+	buffer.freeAll();
+	for (var j = 0; j < 10; j++)
+		assert.deepEqual(buffer.read(j), undefined, "Free all");
+	assert.deepEqual(buffer.isEmpty(), true, "Is empty");
+});
+
+QUnit.test("CircularBuffer - Empty test", function (assert)
+{
+	var buffer = new ds.CircularBuffer(10);
+	buffer.write(0);
+	buffer.write(0);
+	buffer.write(0);
+	assert.deepEqual(buffer.isEmpty(), false, "Is not empty");
+	buffer.free(0, 8);
+	assert.deepEqual(buffer.isEmpty(), true, "Is empty");
+});
+
+QUnit.test("CircularBuffer - Clone test", function (assert)
+{
+	var buffer = new ds.CircularBuffer(10);
+	for (var i = 0; i < 15; i++)
+		buffer.write(i);
+	var clone = buffer.clone();
+	for (var j = 0; j < 9; j++)
+		assert.deepEqual(clone.read(j), buffer.read(j), "Check items");
+	assert.deepEqual(clone.head, buffer.head, "Check head position");
+	assert.deepEqual(clone.tail, buffer.tail, "Check tail position");
+	assert.deepEqual(clone.isEmpty(), buffer.isEmpty(), "Check empty");
+	assert.deepEqual(clone.isFull(), buffer.isFull(), "Check empty");
+});
+
+QUnit.test("CircularBuffer - Resize test", function (assert)
+{
+	var buffer = new ds.CircularBuffer(5);
+	for (var i = 0; i < 8; i++)
+		buffer.write(i);
+	var clone = buffer.clone();
+	buffer.resize(10);
+	assert.deepEqual(buffer.head, 8, "Check head position");
+	assert.deepEqual(buffer.tail, 3, "Check tail position");
+	for (var j = 0; j < 10; j++)
+		if (j < 3 || j > 7)
+			assert.deepEqual(buffer.read(j), undefined, "Increase size");
+		else
+			assert.deepEqual(buffer.read(j), j, "Augment resize");
+	buffer = clone;
+	buffer.resize(3);
+	assert.deepEqual(buffer.head, 0, "Check head position");
+	assert.deepEqual(buffer.tail, 0, "Check tail position");
+	for (var k = 0; k < 3; k++)
+		assert.deepEqual(buffer.read(k), k + 3, "Decrease size");
+});
+
+QUnit.test("CircularBuffer - Iterator test", function (assert)
+{
+	var buffer = new ds.CircularBuffer(10);
+	var it = buffer.getIterator();
+	it.first();
+	assert.deepEqual(it.isDone(), true, "Check empty buffer iterator");
+	buffer.write(0);
+	buffer.write(0);
+	buffer.write(0);
+	buffer.write(0);
+	buffer.write(1);
+	buffer.write(1);
+	buffer.write(1);
+	buffer.write(1);
+	buffer.write(1);
+	buffer.write(1);
+	buffer.write(1);
+	buffer.write(1);
+	var result = [0, 0, 1, 1, 1, 1, 1, 1, 1, 1];
+	var i = 0;
+	for (it.first(); !it.isDone(); it.next(), i++)
+		assert.deepEqual(it.getItem(), result[i], "Check iterator");
+});
\ No newline at end of file
diff --git a/Tests/DoubleLinkedList_Test.js b/Tests/DoubleLinkedList_Test.js
deleted file mode 100644
index 7e7fb45..0000000
--- a/Tests/DoubleLinkedList_Test.js
+++ /dev/null
@@ -1,420 +0,0 @@
-/**
- * Created by Stefano on 31/03/14.
- */
-
-test("DoubleLinkedList - Init test", function () {
-	var list = new DoubleLinkedList(0, 1, 2);
-	deepEqual(list.toArray(), [0, 1, 2], "Init list");
-    list = new DoubleLinkedList(2);
-    deepEqual(list.toArray(), [2], "Init list");
-});
-
-test("DoubleLinkedList - Init range test", function () {
-    var list = new DoubleLinkedList(Range(0, 2));
-    deepEqual(list.toArray(), [0, 1, 2], "Init list");
-    list = new DoubleLinkedList(Range(2, -2, -0.5));
-    deepEqual(list.toArray(), [2, 1.5, 1, 0.5, 0, -0.5, -1, -1.5, -2], "Init list");
-});
-
-test("DoubleLinkedList - Push test", function () {
-	var list = new DoubleLinkedList();
-	list.pushFront(0);
-	list.pushFront(1);
-	list.pushBack(2);
-	list.pushBack(3);
-	deepEqual(list.getItem(0), 1, "Push front 1");
-	deepEqual(list.getItem(1), 0, "Push front 0");
-	deepEqual(list.getItem(2), 2, "Push back 2");
-	deepEqual(list.getItem(3), 3, "Push back 3");
-});
-
-test("DoubleLinkedList - Pop test", function () {
-	var list = new DoubleLinkedList();
-	list.pushFront(0);
-	list.pushFront(1);
-	list.pushBack(2);
-	list.pushBack(3);
-	deepEqual(list.popBack(), 3, "Pop back 3");
-	deepEqual(list.popFront(), 1, "Pop front 1");
-	deepEqual(list.popBack(), 2, "Pop back 2");
-	deepEqual(list.popFront(), 0, "Pop front 0");
-});
-
-test("DoubleLinkedList - Remove at test", function () {
-	var list = new DoubleLinkedList();
-	list.pushFront(0);
-	list.pushFront(1);
-	list.pushBack(2);
-	list.pushBack(3);
-	deepEqual(list.removeAt(1), 0, "Remove at 1");
-	deepEqual(list.removeAt(1), 2, "Remove at 1");
-	deepEqual(list.removeAt(1), 3, "Remove at 1");
-	deepEqual(list.removeAt(0), 1, "Remove at 0");
-});
-
-test("DoubleLinkedList - Remove test", function () {
-	var list = new DoubleLinkedList();
-	for (var i = 0; i < 30; i++)
-		list.pushBack(i % 10);
-	list.pushBack(15);
-	var callback = function (item) {
-		return !(item % 2) && item > 5;
-	};
-	list.remove(0);
-	deepEqual(list.indexOf(0), 9, "Remove 0");
-	list.remove(15);
-	deepEqual(list.indexOf(15), -1, "Remove 15");
-	list.remove(9);
-	list.remove(9);
-	list.remove(9);
-	deepEqual(list.indexOf(9), -1, "Remove 9");
-	list.remove(0, callback);
-	deepEqual(list.indexOf(6), 13, "Remove the first even numbers greater than 5");
-});
-
-test("DoubleLinkedList - Remove all test", function () {
-	var list = new DoubleLinkedList();
-	for (var i = 0; i < 30; i++)
-		list.pushBack(i % 10);
-	var callback = function (item) {
-		return !(item % 2) && item > 5;
-	};
-	list.removeAll(0);
-	deepEqual(list.indexOf(0), -1, "Remove all 0");
-	list.removeAll(9);
-	deepEqual(list.indexOf(9), -1, "Remove all 9");
-	list.removeAll(0, callback);
-	deepEqual(list.indexOf(8), -1, "Remove all the even numbers greater than 5");
-});
-
-test("DoubleLinkedList - Remove segment test", function () {
-	var list = new DoubleLinkedList();
-	for (var i = 0; i < 10; i++)
-		list.pushBack(i);
-	deepEqual(list.removeSegment(2, 6), [2, 3, 4, 5, 6], "Remove the segment from the list");
-	deepEqual(list.toArray(), [0, 1, 7, 8, 9], "Remove the segment from the list");
-	deepEqual(list.getLength(), 5, "Remove the segment from the list");
-	deepEqual(list.removeSegment(2, 1), [7, 8, 9], "Remove the segment from the list");
-	deepEqual(list.toArray(), [0, 1], "Remove the segment from the list");
-	deepEqual(list.getLength(), 2, "Remove the segment from the list");
-});
-
-test("DoubleLinkedList - Modify at test", function () {
-	var list = new DoubleLinkedList();
-	for (var i = 0; i < 4; i++)
-		list.pushBack(i);
-	list.modifyAt(2, 6);
-	deepEqual(list.toArray(), [0, 1, 6, 3], "Change at valid position");
-	list.modifyAt(5, 5);
-	deepEqual(list.toArray(), [0, 1, 6, 3], "Change at non valid position");
-});
-
-test("DoubleLinkedList - Delete node test", function () {
-	var list = new DoubleLinkedList();
-	list.pushFront(0);
-	list.pushFront(1);
-	list.pushBack(2);
-	list.pushBack(3);
-	var it = list.getIterator();
-	for (it.first(); !it.isDone(); it.next())
-		if (it.getItem())
-			list.deleteNode(it.getNode());
-	deepEqual(list.getItem(0), 0, "Delete node");
-});
-
-test("DoubleLinkedList - Sort test", function () {
-	var list = new DoubleLinkedList();
-	const length = 100;
-	for (var i = 0; i < length; i++)
-		list.pushFront(i);
-
-	list.sort();
-	deepEqual(list.getItem(0), 0, "Sort");
-	deepEqual(list.getItem(length - 1), length - 1, "Sort");
-});
-
-test("DoubleLinkedList - Sort with callback test", function () {
-	var list = new DoubleLinkedList();
-	const length = 100;
-
-	for (var i = 0; i < length; i++)
-		list.pushFront(i);
-
-	list.sort(
-		function (item) {
-			return -item;
-		}
-	);
-	deepEqual(list.getItem(0), length - 1, "Sort with callback");
-	deepEqual(list.getItem(length - 1), 0, "Sort with callback");
-});
-
-test("DoubleLinkedList - Filter test", function () {
-	var list = new DoubleLinkedList();
-	const length = 100;
-
-	for (var i = 0; i < length; i++)
-		list.pushFront(i);
-
-	var result = list.filter(function (item) {
-		return 1 - item % 2;
-	});
-
-	deepEqual(result[0], 98, "Filter of the even values");
-	deepEqual(result[result.length - 1], 0, "Filter on the even values");
-});
-
-test("DoubleLinkedList - Reverse test", function () {
-	var list = new DoubleLinkedList();
-	const length = 100;
-
-	for (var i = 0; i < length; i++)
-		list.pushFront(i);
-
-	list.reverse();
-
-	deepEqual(list.getItem(0), 0, "Reverse");
-	deepEqual(list.getItem(length - 1), 99, "Reverse");
-});
-
-test("DoubleLinkedList - Iterator test", function () {
-	var list = new DoubleLinkedList();
-
-	for (var i = 0; i < 100; i++)
-		list.pushBack(i);
-
-	var it = list.getIterator();
-
-	var j = 0;
-	for (it.first(); !it.isDone(); it.next(), j++) {
-		deepEqual(it.getItem(), j, "Check iterator position");
-	}
-	for (it.last(); !it.isDone(); it.previous(), j--) {
-		deepEqual(it.getItem(), j - 1, "Check iterator position");
-	}
-
-});
-
-test("DoubleLinkedList - Add at test", function () {
-	var list = new DoubleLinkedList();
-	list.addAt(5, 0);
-	deepEqual(list.peek(), 5, "Add at 0");
-	list.addAt(2, 1);
-	deepEqual(list.getItem(1), 2, "Add at 1");
-	list.addAt(15, 6);
-	deepEqual(list.getItem(2), undefined, "Add at 6");
-	deepEqual(list.getItem(5), undefined, "Add at 6");
-	deepEqual(list.getItem(6), 15, "Add at 6");
-	list.addAt(30, 6);
-	deepEqual(list.getItem(6), 30, "Add at 6");
-	deepEqual(list.getItem(7), 15, "Add at 6");
-	list.addAt(6, 0);
-	deepEqual(list.peek(), 6, "Add at 0");
-});
-
-test("DoubleLinkedList - MultiPop test", function () {
-	var list = new DoubleLinkedList();
-	list.pushFront(0);
-	list.pushFront(1);
-	list.pushBack(2);
-	list.pushBack(3);
-	deepEqual(list.multiPopBack(2), [3, 2], "Multi pop back");
-	deepEqual(list.multiPopFront(2), [1, 0], "Multi pop front");
-});
-
-test("DoubleLinkedList - Get length test", function () {
-	var list = new DoubleLinkedList();
-	deepEqual(list.getLength(), 0, "Get length empty");
-	list.pushFront(0);
-	list.pushFront(1);
-	list.pushBack(2);
-	list.pushBack(3);
-	deepEqual(list.getLength(), 4, "Get length");
-	list.multiPopBack(2);
-	deepEqual(list.getLength(), 2, "Get length");
-
-});
-
-test("DoubleLinkedList - Peek test", function () {
-	var list = new DoubleLinkedList();
-	list.pushFront(0);
-	deepEqual(list.peek(), 0, "Peek");
-	list.pushFront(1);
-	list.pushBack(2);
-	deepEqual(list.peek(), 1, "Peek");
-	list.pushBack(3);
-	deepEqual(list.peek(), 1, "Peek");
-});
-
-test("DoubleLinkedList - Clear test", function () {
-	var list = new DoubleLinkedList();
-	list.pushFront(0);
-	list.pushFront(1);
-	list.pushBack(2);
-	list.pushBack(3);
-	list.clear();
-	deepEqual(list.getLength(), 0, "Clear the list");
-
-});
-
-test("DoubleLinkedList - Is empty test", function () {
-	var list = new DoubleLinkedList();
-	deepEqual(list.isEmpty(), true, "Is empty");
-	list.pushFront(0);
-	list.pushFront(1);
-	list.pushBack(2);
-	list.pushBack(3);
-	deepEqual(list.isEmpty(), false, "Is not empty");
-	list.clear();
-	deepEqual(list.isEmpty(), true, "Is empty");
-});
-
-test("DoubleLinkedList - contains", function () {
-	var list = new DoubleLinkedList();
-	list.pushBack(0);
-	list.pushBack(2);
-	deepEqual(list.contains(0), true, "Contains 0");
-	deepEqual(list.contains(2), true, "Contains 2");
-	deepEqual(list.contains(1), false, "Not contains 1");
-	var callback = function (item) {
-		return item > 0;
-	};
-	deepEqual(list.contains(null, callback), true, "Contains a value > 0");
-	callback = function (item) {
-		return item < 0;
-	};
-	deepEqual(list.contains(null, callback), false, "Contains a value < 0");
-});
-
-test("DoubleLinkedList - execute", function () {
-	var list = new DoubleLinkedList();
-	list.pushBack(0);
-	list.pushBack(2);
-	var callback = function (item) {
-		return item * 2;
-	};
-	list.execute(callback);
-	deepEqual(list.getItem(0), 0, "Execute for item 0");
-	deepEqual(list.getItem(1), 4, "Execute for item 1");
-});
-
-test("DoubleLinkedList - Index of test", function () {
-	var list = new DoubleLinkedList();
-	for (var i = 0; i < 10; i++)
-		list.pushBack(i);
-	var callback = function (item) {
-		return !(item % 2) && item > 5;
-	};
-	deepEqual(list.indexOf(0), 0, "Index of 0");
-	deepEqual(list.indexOf(15), -1, "Index of 15");
-	deepEqual(list.indexOf(5), 5, "Index of 5");
-	list.removeAt(5);
-	deepEqual(list.indexOf(6), 5, "Index of 6");
-	deepEqual(list.indexOf(null, callback), 5, "Index of the first even number greater than 5");
-});
-
-test("DoubleLinkedList - Last index of test", function () {
-	var list = new DoubleLinkedList();
-	for (var i = 0; i < 10; i++)
-		list.pushBack(i);
-	var callback = function (item) {
-		return !(item % 2) && item > 5;
-	};
-	deepEqual(list.lastIndexOf(0), 0, "Last index of 0");
-	deepEqual(list.lastIndexOf(15), -1, "Last index of 15");
-	deepEqual(list.lastIndexOf(5), 5, "Last index of 5");
-	list.removeAt(5);
-	deepEqual(list.lastIndexOf(6), 5, "Last index of 6");
-	deepEqual(list.lastIndexOf(null, callback), 7, "Index of the last even number greater than 5");
-});
-
-test("DoubleLinkedList - Indexes of test", function () {
-	var list = new DoubleLinkedList();
-	for (var i = 0; i < 30; i++)
-		list.pushBack(i % 10);
-	var callback = function (item) {
-		return !(item % 2) && item > 5;
-	};
-	deepEqual(list.allIndexesOf(0), [0, 10, 20], "Indexes of 0");
-	deepEqual(list.allIndexesOf(15), [], "Indexes of 15");
-	deepEqual(list.allIndexesOf(5), [5, 15, 25], "Indexes of 5");
-	list.removeAt(5);
-	deepEqual(list.allIndexesOf(5), [14, 24], "Indexes of 5");
-	deepEqual(list.allIndexesOf(6), [5, 15, 25], "Indexes of 6");
-	deepEqual(list.allIndexesOf(null, callback), [5, 7, 15, 17, 25, 27], "Indexes of the even numbers greater than 5");
-});
-
-test("DoubleLinkedList - Join test", function () {
-	var listA = new DoubleLinkedList();
-	var listB = new DoubleLinkedList();
-	for (var i = 0; i < 5; i++) {
-		listA.pushBack(i);
-		listB.pushBack(i);
-	}
-	listA.join(listB);
-	deepEqual(listA.allIndexesOf(3), [3, 8], "Join of the lists");
-	deepEqual(listA.getLength(), 10, "Check the length of the list");
-});
-
-test("DoubleLinkedList - Divide test", function () {
-	var list = new DoubleLinkedList();
-	for (var i = 0; i < 10; i++)
-		list.pushBack(i);
-	var listA = list.divide(-1);
-	deepEqual(listA.isEmpty(), true, "Divide before start");
-	var listB = list.divide(10);
-	deepEqual(listB.isEmpty(), true, "Divide after end");
-	var listC = list.divide(8);
-	deepEqual(listC.getItem(0), 8, "Divide at valid position");
-	deepEqual(listC.getItem(1), 9, "Divide at valid position");
-	deepEqual(listC.getLength(), 2, "Divide at valid position");
-	deepEqual(list.getItem(8), undefined, "Divide at valid position");
-	deepEqual(list.getLength(), 8, "Divide at valid position");
-	var listD = list.divide(0);
-	deepEqual(listD.getLength(), 8, "Divide at the first position");
-	deepEqual(listD.getItem(0), 0, "Divide at the first position");
-	deepEqual(listD.getItem(8), undefined, "Divide at the first position");
-	deepEqual(listD.getItem(7), 7, "Divide at the first position");
-	deepEqual(list.getLength(), 0, "Divide at the first position");
-	deepEqual(list.getItem(0), undefined, "Divide at the first position");
-});
-
-test("DoubleLinkedList - Clone test", function () {
-	var list = new DoubleLinkedList();
-	for (var i = 0; i < 10; i++)
-		list.pushBack(i);
-	var clone = list.clone();
-	var it = clone.getIterator();
-	var j = 0;
-	for (it.first(); !it.isDone(); it.next(), j++)
-		deepEqual(it.getItem(), j, "Clone of the list");
-});
-
-test("DoubleLinkedList - Clone distinct test", function () {
-	var list = new DoubleLinkedList();
-	for (var i = 0; i < 20; i++)
-		list.pushBack(i % 10);
-	var clone = list.cloneDistinct();
-	deepEqual(clone.allIndexesOf(2), [2], "Clone of the list");
-});
-
-test("DoubleLinkedList - Split test", function () {
-	var list = new DoubleLinkedList();
-	for (var i = 0; i < 7; i++)
-		list.pushBack(i);
-	var lists = list.split(3);
-	deepEqual(lists.length, 3, "Check the number of lists created");
-	deepEqual(lists[0].toArray(), [0, 1, 2], "Check the items in the lists created");
-	deepEqual(lists[1].toArray(), [3, 4, 5], "Check the items in the lists created");
-	deepEqual(lists[2].toArray(), [6], "Check the items in the lists created");
-});
-
-test("DoubleLinkedList - Count test", function () {
-	var list = new DoubleLinkedList();
-	for (var i = 0; i < 10; i++)
-		list.pushBack(i);
-	var callback = function (item) {
-		return item > 4;
-	};
-	deepEqual(list.count(callback), 5, "Count the items that are greater than 4");
-});
\ No newline at end of file
diff --git a/Tests/DoubleLinkedList_Test.ts b/Tests/DoubleLinkedList_Test.ts
new file mode 100644
index 0000000..bd8c409
--- /dev/null
+++ b/Tests/DoubleLinkedList_Test.ts
@@ -0,0 +1,466 @@
+/**
+ * Created by Stefano on 31/03/14.
+ */
+
+QUnit.test("DoubleLinkedList - Init test", function (assert)
+{
+	var list = new ds.DoubleLinkedList(0, 1, 2);
+	assert.deepEqual(list.toArray(), [0, 1, 2], "Init list");
+	list = new ds.DoubleLinkedList(2);
+	assert.deepEqual(list.toArray(), [2], "Init list");
+});
+
+QUnit.test("DoubleLinkedList - Init range test", function (assert)
+{
+	var list = new ds.DoubleLinkedList(ds.Range(0, 2));
+	assert.deepEqual(list.toArray(), [0, 1, 2], "Init list");
+	list = new ds.DoubleLinkedList(ds.Range(2, -2, -0.5));
+	assert.deepEqual(list.toArray(), [2, 1.5, 1, 0.5, 0, -0.5, -1, -1.5, -2], "Init list");
+});
+
+QUnit.test("DoubleLinkedList - Push test", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	list.pushFront(0);
+	list.pushFront(1);
+	list.pushBack(2);
+	list.pushBack(3);
+	assert.deepEqual(list.getItem(0), 1, "Push front 1");
+	assert.deepEqual(list.getItem(1), 0, "Push front 0");
+	assert.deepEqual(list.getItem(2), 2, "Push back 2");
+	assert.deepEqual(list.getItem(3), 3, "Push back 3");
+});
+
+QUnit.test("DoubleLinkedList - Pop test", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	list.pushFront(0);
+	list.pushFront(1);
+	list.pushBack(2);
+	list.pushBack(3);
+	assert.deepEqual(list.popBack(), 3, "Pop back 3");
+	assert.deepEqual(list.popFront(), 1, "Pop front 1");
+	assert.deepEqual(list.popBack(), 2, "Pop back 2");
+	assert.deepEqual(list.popFront(), 0, "Pop front 0");
+});
+
+QUnit.test("DoubleLinkedList - Remove at test", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	list.pushFront(0);
+	list.pushFront(1);
+	list.pushBack(2);
+	list.pushBack(3);
+	assert.deepEqual(list.removeAt(1), 0, "Remove at 1");
+	assert.deepEqual(list.removeAt(1), 2, "Remove at 1");
+	assert.deepEqual(list.removeAt(1), 3, "Remove at 1");
+	assert.deepEqual(list.removeAt(0), 1, "Remove at 0");
+});
+
+QUnit.test("DoubleLinkedList - Remove test", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	for (var i = 0; i < 30; i++)
+		list.pushBack(i % 10);
+	list.pushBack(15);
+	var callback = function (item)
+	{
+		return !(item % 2) && item > 5;
+	};
+	list.remove(0);
+	assert.deepEqual(list.indexOf(0), 9, "Remove 0");
+	list.remove(15);
+	assert.deepEqual(list.indexOf(15), -1, "Remove 15");
+	list.remove(9);
+	list.remove(9);
+	list.remove(9);
+	assert.deepEqual(list.indexOf(9), -1, "Remove 9");
+	list.remove(0, callback);
+	assert.deepEqual(list.indexOf(6), 13, "Remove the first even numbers greater than 5");
+});
+
+QUnit.test("DoubleLinkedList - Remove all test", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	for (var i = 0; i < 30; i++)
+		list.pushBack(i % 10);
+	var callback = function (item)
+	{
+		return !(item % 2) && item > 5;
+	};
+	list.removeAll(0);
+	assert.deepEqual(list.indexOf(0), -1, "Remove all 0");
+	list.removeAll(9);
+	assert.deepEqual(list.indexOf(9), -1, "Remove all 9");
+	list.removeAll(0, callback);
+	assert.deepEqual(list.indexOf(8), -1, "Remove all the even numbers greater than 5");
+});
+
+QUnit.test("DoubleLinkedList - Remove segment test", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	for (var i = 0; i < 10; i++)
+		list.pushBack(i);
+	assert.deepEqual(list.removeSegment(2, 6), [2, 3, 4, 5, 6], "Remove the segment from the list");
+	assert.deepEqual(list.toArray(), [0, 1, 7, 8, 9], "Remove the segment from the list");
+	assert.deepEqual(list.getLength(), 5, "Remove the segment from the list");
+	assert.deepEqual(list.removeSegment(2, 1), [7, 8, 9], "Remove the segment from the list");
+	assert.deepEqual(list.toArray(), [0, 1], "Remove the segment from the list");
+	assert.deepEqual(list.getLength(), 2, "Remove the segment from the list");
+});
+
+QUnit.test("DoubleLinkedList - Modify at test", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	for (var i = 0; i < 4; i++)
+		list.pushBack(i);
+	list.modifyAt(2, 6);
+	assert.deepEqual(list.toArray(), [0, 1, 6, 3], "Change at valid position");
+	list.modifyAt(5, 5);
+	assert.deepEqual(list.toArray(), [0, 1, 6, 3], "Change at non valid position");
+});
+
+QUnit.test("DoubleLinkedList - Delete node test", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	list.pushFront(0);
+	list.pushFront(1);
+	list.pushBack(2);
+	list.pushBack(3);
+	var it = list.getIterator();
+	for (it.first(); !it.isDone(); it.next())
+		if (it.getItem())
+			list.deleteNode(it.getNode());
+	assert.deepEqual(list.getItem(0), 0, "Delete node");
+});
+
+QUnit.test("DoubleLinkedList - Sort test", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	const length = 100;
+	for (var i = 0; i < length; i++)
+		list.pushFront(i);
+
+	list.sort();
+	assert.deepEqual(list.getItem(0), 0, "Sort");
+	assert.deepEqual(list.getItem(length - 1), length - 1, "Sort");
+});
+
+QUnit.test("DoubleLinkedList - Sort with callback test", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	const length = 100;
+
+	for (var i = 0; i < length; i++)
+		list.pushFront(i);
+
+	list.sort(
+		function (item)
+		{
+			return -item;
+		}
+	);
+	assert.deepEqual(list.getItem(0), length - 1, "Sort with callback");
+	assert.deepEqual(list.getItem(length - 1), 0, "Sort with callback");
+});
+
+QUnit.test("DoubleLinkedList - Filter test", function (assert)
+{
+	var list = new ds.DoubleLinkedList<number>();
+	const length = 100;
+
+	for (var i = 0; i < length; i++)
+		list.pushFront(i);
+
+	var result = list.filter(function (item)
+	{
+		return Boolean(1 - item % 2);
+	});
+
+	assert.deepEqual(result[0], 98, "Filter of the even values");
+	assert.deepEqual(result[result.length - 1], 0, "Filter on the even values");
+});
+
+QUnit.test("DoubleLinkedList - Reverse test", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	const length = 100;
+
+	for (var i = 0; i < length; i++)
+		list.pushFront(i);
+
+	list.reverse();
+
+	assert.deepEqual(list.getItem(0), 0, "Reverse");
+	assert.deepEqual(list.getItem(length - 1), 99, "Reverse");
+});
+
+QUnit.test("DoubleLinkedList - Iterator test", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+
+	for (var i = 0; i < 100; i++)
+		list.pushBack(i);
+
+	var it = list.getIterator();
+
+	var j = 0;
+	for (it.first(); !it.isDone(); it.next(), j++)
+	{
+		assert.deepEqual(it.getItem(), j, "Check iterator position");
+	}
+	for (it.last(); !it.isDone(); it.previous(), j--)
+	{
+		assert.deepEqual(it.getItem(), j - 1, "Check iterator position");
+	}
+
+});
+
+QUnit.test("DoubleLinkedList - Add at test", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	list.addAt(5, 0);
+	assert.deepEqual(list.peek(), 5, "Add at 0");
+	list.addAt(2, 1);
+	assert.deepEqual(list.getItem(1), 2, "Add at 1");
+	list.addAt(15, 6);
+	assert.deepEqual(list.getItem(2), undefined, "Add at 6");
+	assert.deepEqual(list.getItem(5), undefined, "Add at 6");
+	assert.deepEqual(list.getItem(6), 15, "Add at 6");
+	list.addAt(30, 6);
+	assert.deepEqual(list.getItem(6), 30, "Add at 6");
+	assert.deepEqual(list.getItem(7), 15, "Add at 6");
+	list.addAt(6, 0);
+	assert.deepEqual(list.peek(), 6, "Add at 0");
+});
+
+QUnit.test("DoubleLinkedList - MultiPop test", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	list.pushFront(0);
+	list.pushFront(1);
+	list.pushBack(2);
+	list.pushBack(3);
+	assert.deepEqual(list.multiPopBack(2), [3, 2], "Multi pop back");
+	assert.deepEqual(list.multiPopFront(2), [1, 0], "Multi pop front");
+});
+
+QUnit.test("DoubleLinkedList - Get length test", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	assert.deepEqual(list.getLength(), 0, "Get length empty");
+	list.pushFront(0);
+	list.pushFront(1);
+	list.pushBack(2);
+	list.pushBack(3);
+	assert.deepEqual(list.getLength(), 4, "Get length");
+	list.multiPopBack(2);
+	assert.deepEqual(list.getLength(), 2, "Get length");
+
+});
+
+QUnit.test("DoubleLinkedList - Peek test", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	list.pushFront(0);
+	assert.deepEqual(list.peek(), 0, "Peek");
+	list.pushFront(1);
+	list.pushBack(2);
+	assert.deepEqual(list.peek(), 1, "Peek");
+	list.pushBack(3);
+	assert.deepEqual(list.peek(), 1, "Peek");
+});
+
+QUnit.test("DoubleLinkedList - Clear test", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	list.pushFront(0);
+	list.pushFront(1);
+	list.pushBack(2);
+	list.pushBack(3);
+	list.clear();
+	assert.deepEqual(list.getLength(), 0, "Clear the list");
+
+});
+
+QUnit.test("DoubleLinkedList - Is empty test", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	assert.deepEqual(list.isEmpty(), true, "Is empty");
+	list.pushFront(0);
+	list.pushFront(1);
+	list.pushBack(2);
+	list.pushBack(3);
+	assert.deepEqual(list.isEmpty(), false, "Is not empty");
+	list.clear();
+	assert.deepEqual(list.isEmpty(), true, "Is empty");
+});
+
+QUnit.test("DoubleLinkedList - contains", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	list.pushBack(0);
+	list.pushBack(2);
+	assert.deepEqual(list.contains(0), true, "Contains 0");
+	assert.deepEqual(list.contains(2), true, "Contains 2");
+	assert.deepEqual(list.contains(1), false, "Not contains 1");
+	var callback = function (item)
+	{
+		return item > 0;
+	};
+	assert.deepEqual(list.contains(null, callback), true, "Contains a value > 0");
+	callback = function (item)
+	{
+		return item < 0;
+	};
+	assert.deepEqual(list.contains(null, callback), false, "Contains a value < 0");
+});
+
+QUnit.test("DoubleLinkedList - execute", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	list.pushBack(0);
+	list.pushBack(2);
+	var callback = function (item)
+	{
+		return item * 2;
+	};
+	list.execute(callback);
+	assert.deepEqual(list.getItem(0), 0, "Execute for item 0");
+	assert.deepEqual(list.getItem(1), 4, "Execute for item 1");
+});
+
+QUnit.test("DoubleLinkedList - Index of test", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	for (var i = 0; i < 10; i++)
+		list.pushBack(i);
+	var callback = function (item)
+	{
+		return !(item % 2) && item > 5;
+	};
+	assert.deepEqual(list.indexOf(0), 0, "Index of 0");
+	assert.deepEqual(list.indexOf(15), -1, "Index of 15");
+	assert.deepEqual(list.indexOf(5), 5, "Index of 5");
+	list.removeAt(5);
+	assert.deepEqual(list.indexOf(6), 5, "Index of 6");
+	assert.deepEqual(list.indexOf(null, callback), 5, "Index of the first even number greater than 5");
+});
+
+QUnit.test("DoubleLinkedList - Last index of test", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	for (var i = 0; i < 10; i++)
+		list.pushBack(i);
+	var callback = function (item)
+	{
+		return !(item % 2) && item > 5;
+	};
+	assert.deepEqual(list.lastIndexOf(0), 0, "Last index of 0");
+	assert.deepEqual(list.lastIndexOf(15), -1, "Last index of 15");
+	assert.deepEqual(list.lastIndexOf(5), 5, "Last index of 5");
+	list.removeAt(5);
+	assert.deepEqual(list.lastIndexOf(6), 5, "Last index of 6");
+	assert.deepEqual(list.lastIndexOf(null, callback), 7, "Index of the last even number greater than 5");
+});
+
+QUnit.test("DoubleLinkedList - Indexes of test", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	for (var i = 0; i < 30; i++)
+		list.pushBack(i % 10);
+	var callback = function (item)
+	{
+		return !(item % 2) && item > 5;
+	};
+	assert.deepEqual(list.allIndexesOf(0), [0, 10, 20], "Indexes of 0");
+	assert.deepEqual(list.allIndexesOf(15), [], "Indexes of 15");
+	assert.deepEqual(list.allIndexesOf(5), [5, 15, 25], "Indexes of 5");
+	list.removeAt(5);
+	assert.deepEqual(list.allIndexesOf(5), [14, 24], "Indexes of 5");
+	assert.deepEqual(list.allIndexesOf(6), [5, 15, 25], "Indexes of 6");
+	assert.deepEqual(list.allIndexesOf(null, callback), [5, 7, 15, 17, 25, 27], "Indexes of the even numbers greater than 5");
+});
+
+QUnit.test("DoubleLinkedList - Join test", function (assert)
+{
+	var listA = new ds.DoubleLinkedList();
+	var listB = new ds.DoubleLinkedList();
+	for (var i = 0; i < 5; i++)
+	{
+		listA.pushBack(i);
+		listB.pushBack(i);
+	}
+	listA.join(listB);
+	assert.deepEqual(listA.allIndexesOf(3), [3, 8], "Join of the lists");
+	assert.deepEqual(listA.getLength(), 10, "Check the length of the list");
+});
+
+QUnit.test("DoubleLinkedList - Divide test", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	for (var i = 0; i < 10; i++)
+		list.pushBack(i);
+	var listA = list.divide(-1);
+	assert.deepEqual(listA.isEmpty(), true, "Divide before start");
+	var listB = list.divide(10);
+	assert.deepEqual(listB.isEmpty(), true, "Divide after end");
+	var listC = list.divide(8);
+	assert.deepEqual(listC.getItem(0), 8, "Divide at valid position");
+	assert.deepEqual(listC.getItem(1), 9, "Divide at valid position");
+	assert.deepEqual(listC.getLength(), 2, "Divide at valid position");
+	assert.deepEqual(list.getItem(8), undefined, "Divide at valid position");
+	assert.deepEqual(list.getLength(), 8, "Divide at valid position");
+	var listD = list.divide(0);
+	assert.deepEqual(listD.getLength(), 8, "Divide at the first position");
+	assert.deepEqual(listD.getItem(0), 0, "Divide at the first position");
+	assert.deepEqual(listD.getItem(8), undefined, "Divide at the first position");
+	assert.deepEqual(listD.getItem(7), 7, "Divide at the first position");
+	assert.deepEqual(list.getLength(), 0, "Divide at the first position");
+	assert.deepEqual(list.getItem(0), undefined, "Divide at the first position");
+});
+
+QUnit.test("DoubleLinkedList - Clone test", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	for (var i = 0; i < 10; i++)
+		list.pushBack(i);
+	var clone = list.clone();
+	var it = clone.getIterator();
+	var j = 0;
+	for (it.first(); !it.isDone(); it.next(), j++)
+		assert.deepEqual(it.getItem(), j, "Clone of the list");
+});
+
+QUnit.test("DoubleLinkedList - Clone distinct test", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	for (var i = 0; i < 20; i++)
+		list.pushBack(i % 10);
+	var clone = list.cloneDistinct();
+	assert.deepEqual(clone.allIndexesOf(2), [2], "Clone of the list");
+});
+
+QUnit.test("DoubleLinkedList - Split test", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	for (var i = 0; i < 7; i++)
+		list.pushBack(i);
+	var lists = list.split(3);
+	assert.deepEqual(lists.length, 3, "Check the number of lists created");
+	assert.deepEqual(lists[0].toArray(), [0, 1, 2], "Check the items in the lists created");
+	assert.deepEqual(lists[1].toArray(), [3, 4, 5], "Check the items in the lists created");
+	assert.deepEqual(lists[2].toArray(), [6], "Check the items in the lists created");
+});
+
+QUnit.test("DoubleLinkedList - Count test", function (assert)
+{
+	var list = new ds.DoubleLinkedList();
+	for (var i = 0; i < 10; i++)
+		list.pushBack(i);
+	var callback = function (item)
+	{
+		return item > 4;
+	};
+	assert.deepEqual(list.count(callback), 5, "Count the items that are greater than 4");
+});
\ No newline at end of file
diff --git a/Tests/HashTable_Test.js b/Tests/HashTable_Test.js
deleted file mode 100644
index 4605f18..0000000
--- a/Tests/HashTable_Test.js
+++ /dev/null
@@ -1,94 +0,0 @@
-/**
- * Created by Stefano on 31/03/14.
- */
-
-test("HashTable - Insert test", function () {
-	var table = new HashTable(4);
-	for (var i = 0; i < 20; i++)
-		table.insert(i, "Insert # " + i);
-	for (var j = 0; j < 20; j++)
-		deepEqual(table.search(j), "Insert # " + j, "Insert " + j);
-});
-
-test("HashTable - Delete key test", function () {
-	var table = new HashTable(4);
-	for (var i = 0; i < 20; i++)
-		table.insert(i, i);
-	table.deleteKey(6);
-	deepEqual(table.search(6), undefined, "Delete key");
-});
-
-test("HashTable - Delete all key test", function () {
-	var table = new HashTable(4);
-	for (var i = 0; i < 100; i++)
-		table.insert(i % 20, {value: i % 20});
-	table.deleteAllKey(13);
-	deepEqual(table.searchAll(13).length, 0, "Delete all key");
-});
-
-test("HashTable - Get keys test", function () {
-	var table = new HashTable(50);
-	var keys = [];
-	for (var i = 0; i < 100; i++) {
-		table.insert(i, {value: i % 20});
-		keys.push(i);
-	}
-	keys.sort();
-	var storedKeys = table.getKeys().sort();
-	deepEqual(storedKeys, keys, "Get stored keys");
-});
-
-test("HashTable - Get items test", function () {
-	var table = new HashTable(50);
-	var items = [];
-	for (var i = 0; i < 100; i++) {
-		table.insert(i, i % 20);
-		items.push(i % 20);
-	}
-	items.sort();
-	var storedKeys = table.getItems().sort();
-	deepEqual(storedKeys, items, "Get stored items");
-});
-
-test("HashTable - Contains key test", function () {
-	var table = new HashTable(50);
-	for (var i = 0; i < 100; i++)
-		table.insert(i, i % 20);
-	deepEqual(table.containsKey(4), true, "Contains key");
-	deepEqual(table.containsKey(200), false, "Not contains key");
-	var callback = function (k) {
-		return k > 20;
-	};
-	deepEqual(table.containsKey(0, callback), true, "Contains key greater than 20");
-	callback = function (k) {
-		return k < 0;
-	};
-	deepEqual(table.containsKey(0, callback), false, "Not contains negative key");
-});
-
-test("HashTable - Clear test", function () {
-	var table = new HashTable(50);
-	for (var i = 0; i < 100; i++)
-		table.insert(i, i % 20);
-	deepEqual(table.isEmpty(), false, "Before clear");
-	table.clear();
-	deepEqual(table.isEmpty(), true, "After clear");
-});
-
-test("HashTable - Get number of keys test", function () {
-	var table = new HashTable(50);
-	deepEqual(table.getNumberOfKeys(), 0, "Before insertion");
-	for (var i = 0; i < 100; i++)
-		table.insert(i, i % 20);
-	deepEqual(table.getNumberOfKeys(), 100, "After insertion");
-});
-
-test("HashTable - Is empty test", function () {
-	var table = new HashTable(50);
-	deepEqual(table.isEmpty(), true, "Before insertion");
-	for (var i = 0; i < 100; i++)
-		table.insert(i, i % 20);
-	deepEqual(table.isEmpty(), false, "Before clear");
-	table.clear();
-	deepEqual(table.isEmpty(), true, "After clear");
-});
diff --git a/Tests/HashTable_Test.ts b/Tests/HashTable_Test.ts
new file mode 100644
index 0000000..11a1879
--- /dev/null
+++ b/Tests/HashTable_Test.ts
@@ -0,0 +1,107 @@
+/**
+ * Created by Stefano on 31/03/14.
+ */
+
+QUnit.test("HashTable - Insert test", function (assert)
+{
+	var table = new ds.HashTable(4);
+	for (var i = 0; i < 20; i++)
+		table.insert(i, "Insert # " + i);
+	for (var j = 0; j < 20; j++)
+		assert.deepEqual(table.search(j), "Insert # " + j, "Insert " + j);
+});
+
+QUnit.test("HashTable - Delete key test", function (assert)
+{
+	var table = new ds.HashTable(4);
+	for (var i = 0; i < 20; i++)
+		table.insert(i, i);
+	table.deleteKey(6);
+	assert.deepEqual(table.search(6), undefined, "Delete key");
+});
+
+QUnit.test("HashTable - Delete all key test", function (assert)
+{
+	var table = new ds.HashTable(4);
+	for (var i = 0; i < 100; i++)
+		table.insert(i % 20, { value: i % 20 });
+	table.deleteAllKey(13);
+	assert.deepEqual(table.searchAll(13).length, 0, "Delete all key");
+});
+
+QUnit.test("HashTable - Get keys test", function (assert)
+{
+	var table = new ds.HashTable(50);
+	var keys = [];
+	for (var i = 0; i < 100; i++)
+	{
+		table.insert(i, { value: i % 20 });
+		keys.push(i);
+	}
+	keys.sort();
+	var storedKeys = table.getKeys().sort();
+	assert.deepEqual(storedKeys, keys, "Get stored keys");
+});
+
+QUnit.test("HashTable - Get items test", function (assert)
+{
+	var table = new ds.HashTable(50);
+	var items = [];
+	for (var i = 0; i < 100; i++)
+	{
+		table.insert(i, i % 20);
+		items.push(i % 20);
+	}
+	items.sort();
+	var storedKeys = table.getItems().sort();
+	assert.deepEqual(storedKeys, items, "Get stored items");
+});
+
+QUnit.test("HashTable - Contains key test", function (assert)
+{
+	var table = new ds.HashTable(50);
+	for (var i = 0; i < 100; i++)
+		table.insert(i, i % 20);
+	assert.deepEqual(table.containsKey(4), true, "Contains key");
+	assert.deepEqual(table.containsKey(200), false, "Not contains key");
+	var callback = function (k)
+	{
+		return k > 20;
+	};
+	assert.deepEqual(table.containsKey(0, callback), true, "Contains key greater than 20");
+	callback = function (k)
+	{
+		return k < 0;
+	};
+	assert.deepEqual(table.containsKey(0, callback), false, "Not contains negative key");
+});
+
+QUnit.test("HashTable - Clear test", function (assert)
+{
+	var table = new ds.HashTable(50);
+	for (var i = 0; i < 100; i++)
+		table.insert(i, i % 20);
+	assert.deepEqual(table.isEmpty(), false, "Before clear");
+	table.clear();
+	assert.deepEqual(table.isEmpty(), true, "After clear");
+});
+
+QUnit.test("HashTable - Get number of keys test", function (assert)
+{
+	var table = new ds.HashTable(50);
+	assert.deepEqual(table.getNumberOfKeys(), 0, "Before insertion");
+	for (var i = 0; i < 100; i++)
+		table.insert(i, i % 20);
+	assert.deepEqual(table.getNumberOfKeys(), 100, "After insertion");
+});
+
+QUnit.test("HashTable - Is empty test", function (assert)
+{
+	var table = new ds.HashTable(50);
+	assert.deepEqual(table.isEmpty(), true, "Before insertion");
+	for (var i = 0; i < 100; i++)
+		table.insert(i, i % 20);
+	assert.deepEqual(table.isEmpty(), false, "Before clear");
+	table.clear();
+	assert.deepEqual(table.isEmpty(), true, "After clear");
+});
diff --git a/Tests/LinkedList_Test.js b/Tests/LinkedList_Test.js
deleted file mode 100644
index dfcd8fb..0000000
--- a/Tests/LinkedList_Test.js
+++ /dev/null
@@ -1,385 +0,0 @@
-/**
- * Created by Stefano on 31/03/14.
- */
-
-test("LinkedList - Init test", function () {
-	var list = new LinkedList(0, 1, 2);
-	deepEqual(list.toArray(), [0, 1, 2], "Init list");
-    list = new LinkedList(0);
-    deepEqual(list.toArray(), [0], "Init list");
-});
-
-test("LinkedList - Init test with range", function () {
-    var list = new LinkedList(new Range(0, 5));
-    deepEqual(list.toArray(), [0, 1, 2, 3, 4, 5], "Init list with range");
-});
-
-test("LinkedList - Push test", function () {
-	var list = new LinkedList();
-	list.pushFront(0);
-	list.pushFront(1);
-	list.pushBack(2);
-	list.pushBack(3);
-	deepEqual(list.getItem(0), 1, "Push front 1");
-	deepEqual(list.getItem(1), 0, "Push front 0");
-	deepEqual(list.getItem(2), 2, "Push back 2");
-	deepEqual(list.getItem(3), 3, "Push back 3");
-});
-
-test("LinkedList - Pop test", function () {
-	var list = new LinkedList();
-	list.pushFront(0);
-	list.pushFront(1);
-	list.pushBack(2);
-	list.pushBack(3);
-	deepEqual(list.popBack(), 3, "Pop back 3");
-	deepEqual(list.popFront(), 1, "Pop front 1");
-	deepEqual(list.popBack(), 2, "Pop back 2");
-	deepEqual(list.popFront(), 0, "Pop front 0");
-});
-
-test("LinkedList - Remove at test", function () {
-	var list = new LinkedList();
-	list.pushFront(0);
-	list.pushFront(1);
-	list.pushBack(2);
-	list.pushBack(3);
-	deepEqual(list.removeAt(1), 0, "Remove at 1");
-	deepEqual(list.removeAt(1), 2, "Remove at 1");
-	deepEqual(list.removeAt(1), 3, "Remove at 1");
-	deepEqual(list.removeAt(0), 1, "Remove at 0");
-});
-
-test("LinkedList - Remove test", function () {
-	var list = new LinkedList();
-	for (var i = 0; i < 30; i++)
-		list.pushBack(i % 10);
-	list.pushBack(15);
-	var callback = function (item) {
-		return !(item % 2) && item > 5;
-	};
-	list.remove(0);
-	deepEqual(list.indexOf(0), 9, "Remove 0");
-	list.remove(15);
-	deepEqual(list.indexOf(15), -1, "Remove 15");
-	list.remove(9);
-	list.remove(9);
-	list.remove(9);
-	deepEqual(list.indexOf(9), -1, "Remove 9");
-	list.remove(0, callback);
-	deepEqual(list.indexOf(6), 13, "Remove the first even numbers greater than 5");
-});
-
-test("LinkedList - Remove all test", function () {
-	var list = new LinkedList();
-	for (var i = 0; i < 30; i++)
-		list.pushBack(i % 10);
-	var callback = function (item) {
-		return !(item % 2) && item > 5;
-	};
-	list.removeAll(0);
-	deepEqual(list.indexOf(0), -1, "Remove all 0");
-	list.removeAll(9);
-	deepEqual(list.indexOf(9), -1, "Remove all 9");
-	list.removeAll(0, callback);
-	deepEqual(list.indexOf(8), -1, "Remove all the even numbers greater than 5");
-});
-
-test("LinkedList - Remove segment test", function () {
-	var list = new LinkedList();
-	for (var i = 0; i < 10; i++)
-		list.pushBack(i);
-	deepEqual(list.removeSegment(2, 6), [2, 3, 4, 5, 6], "Remove the segment from the list");
-	deepEqual(list.toArray(), [0, 1, 7, 8, 9], "Remove the segment from the list");
-	deepEqual(list.getLength(), 5, "Remove the segment from the list");
-	deepEqual(list.removeSegment(2, 1), [7, 8, 9], "Remove the segment from the list");
-	deepEqual(list.toArray(), [0, 1], "Remove the segment from the list");
-	deepEqual(list.getLength(), 2, "Remove the segment from the list");
-});
-
-test("LinkedList - Modify at test", function () {
-	var list = new LinkedList();
-	for (var i = 0; i < 4; i++)
-		list.pushBack(i);
-	list.modifyAt(2, 6);
-	deepEqual(list.toArray(), [0, 1, 6, 3], "Change at valid position");
-	list.modifyAt(5, 5);
-	deepEqual(list.toArray(), [0, 1, 6, 3], "Change at non valid position");
-});
-
-test("LinkedList - To array test", function () {
-	var list = new LinkedList();
-	list.pushFront(0);
-	list.pushFront(1);
-	list.pushBack(2);
-	list.pushBack(3);
-	var array = list.toArray();
-	deepEqual(array[0], 1, "To array");
-	deepEqual(array[1], 0, "To array");
-	deepEqual(array[2], 2, "To array");
-	deepEqual(array[3], 3, "To array");
-});
-
-test("LinkedList - From array test", function () {
-	var array = [5, 2, 6, 4];
-	var list = new LinkedList();
-	list.fromArray(array);
-	deepEqual(list.getItem(0), 5, "From array");
-	deepEqual(list.getItem(1), 2, "From array");
-	deepEqual(list.getItem(2), 6, "From array");
-	deepEqual(list.getItem(3), 4, "From array");
-});
-
-test("LinkedList - Filter test", function () {
-	var list = new LinkedList();
-	const length = 100;
-
-	for (var i = 0; i < length; i++)
-		list.pushFront(i);
-
-	var result = list.filter(function (item) {
-		return 1 - item % 2;
-	});
-
-	deepEqual(result[0], 98, "Filter of the even values");
-	deepEqual(result[result.length - 1], 0, "Filter on the even values");
-});
-
-test("LinkedList - Iterator test", function () {
-	var list = new LinkedList();
-
-	for (var i = 0; i < 100; i++)
-		list.pushBack(i);
-
-	var it = list.getIterator();
-
-	var j = 0;
-	for (it.first(); !it.isDone(); it.next(), j++) {
-		deepEqual(it.getItem(), j, "Check iterator position");
-	}
-
-});
-
-test("LinkedList - Add at test", function () {
-	var list = new LinkedList();
-	list.addAt(5, 0);
-	deepEqual(list.peek(), 5, "Add at 0");
-	list.addAt(2, 1);
-	deepEqual(list.getItem(1), 2, "Add at 1");
-	list.addAt(15, 6);
-	deepEqual(list.getItem(2), undefined, "Add at 6");
-	deepEqual(list.getItem(5), undefined, "Add at 6");
-	deepEqual(list.getItem(6), 15, "Add at 6");
-	list.addAt(30, 6);
-	deepEqual(list.getItem(6), 30, "Add at 6");
-	deepEqual(list.getItem(7), 15, "Add at 6");
-	list.addAt(6, 0);
-	deepEqual(list.peek(), 6, "Add at 0");
-});
-
-test("LinkedList - MultiPop test", function () {
-	var list = new LinkedList();
-	list.pushFront(0);
-	list.pushFront(1);
-	list.pushBack(2);
-	list.pushBack(3);
-	deepEqual(list.multiPopBack(2), [3, 2], "Multi pop back");
-	deepEqual(list.multiPopFront(2), [1, 0], "Multi pop front");
-});
-
-test("LinkedList - Get length test", function () {
-	var list = new LinkedList();
-	deepEqual(list.getLength(), 0, "Get length empty");
-	list.pushFront(0);
-	list.pushFront(1);
-	list.pushBack(2);
-	list.pushBack(3);
-	deepEqual(list.getLength(), 4, "Get length");
-	list.multiPopBack(2);
-	deepEqual(list.getLength(), 2, "Get length");
-
-});
-
-test("LinkedList - Peek test", function () {
-	var list = new LinkedList();
-	list.pushFront(0);
-	deepEqual(list.peek(), 0, "Peek");
-	list.pushFront(1);
-	list.pushBack(2);
-	deepEqual(list.peek(), 1, "Peek");
-	list.pushBack(3);
-	deepEqual(list.peek(), 1, "Peek");
-});
-
-test("LinkedList - Clear test", function () {
-	var list = new LinkedList();
-	list.pushFront(0);
-	list.pushFront(1);
-	list.pushBack(2);
-	list.pushBack(3);
-	list.clear();
-	deepEqual(list.getLength(), 0, "Clear the list");
-
-});
-
-test("LinkedList - Is empty test", function () {
-	var list = new LinkedList();
-	deepEqual(list.isEmpty(), true, "Is empty");
-	list.pushFront(0);
-	list.pushFront(1);
-	list.pushBack(2);
-	list.pushBack(3);
-	deepEqual(list.isEmpty(), false, "Is not empty");
-	list.clear();
-	deepEqual(list.isEmpty(), true, "Is empty");
-});
-
-test("LinkedList - Contains test", function () {
-	var list = new LinkedList();
-	list.pushBack(0);
-	list.pushBack(2);
-	deepEqual(list.contains(0), true, "Contains 0");
-	deepEqual(list.contains(2), true, "Contains 2");
-	deepEqual(list.contains(1), false, "Not contains 1");
-	var callback = function (item) {
-		return item > 0;
-	};
-	deepEqual(list.contains(null, callback), true, "Contains a value > 0");
-	callback = function (item) {
-		return item < 0;
-	};
-	deepEqual(list.contains(null, callback), false, "Contains a value < 0");
-});
-
-test("LinkedList - Execute test", function () {
-	var list = new LinkedList();
-	list.pushBack(0);
-	list.pushBack(2);
-	var callback = function (item) {
-		return item * 2;
-	};
-	list.execute(callback);
-	deepEqual(list.getItem(0), 0, "Execute for item 0");
-	deepEqual(list.getItem(1), 4, "Execute for item 1");
-});
-
-test("LinkedList - Index of test", function () {
-	var list = new LinkedList();
-	for (var i = 0; i < 10; i++)
-		list.pushBack(i);
-	var callback = function (item) {
-		return !(item % 2) && item > 5;
-	};
-	deepEqual(list.indexOf(0), 0, "Index of 0");
-	deepEqual(list.indexOf(15), -1, "Index of 15");
-	deepEqual(list.indexOf(5), 5, "Index of 5");
-	list.removeAt(5);
-	deepEqual(list.indexOf(6), 5, "Index of 6");
-	deepEqual(list.indexOf(null, callback), 5, "Index of the first even number greater than 5");
-});
-
-test("LinkedList - Last index of test", function () {
-	var list = new LinkedList();
-	for (var i = 0; i < 10; i++)
-		list.pushBack(i);
-	var callback = function (item) {
-		return !(item % 2) && item > 5;
-	};
-	deepEqual(list.lastIndexOf(0), 0, "Last index of 0");
-	deepEqual(list.lastIndexOf(15), -1, "Last index of 15");
-	deepEqual(list.lastIndexOf(5), 5, "Last index of 5");
-	list.removeAt(5);
-	deepEqual(list.lastIndexOf(6), 5, "Last index of 6");
-	deepEqual(list.lastIndexOf(null, callback), 7, "Index of the last even number greater than 5");
-});
-
-test("LinkedList - Indexes of test", function () {
-	var list = new LinkedList();
-	for (var i = 0; i < 30; i++)
-		list.pushBack(i % 10);
-	var callback = function (item) {
-		return !(item % 2) && item > 5;
-	};
-	deepEqual(list.allIndexesOf(0), [0, 10, 20], "Indexes of 0");
-	deepEqual(list.allIndexesOf(15), [], "Indexes of 15");
-	deepEqual(list.allIndexesOf(5), [5, 15, 25], "Indexes of 5");
-	list.removeAt(5);
-	deepEqual(list.allIndexesOf(5), [14, 24], "Indexes of 5");
-	deepEqual(list.allIndexesOf(6), [5, 15, 25], "Indexes of 6");
-	deepEqual(list.allIndexesOf(null, callback), [5, 7, 15, 17, 25, 27], "Indexes of the even numbers greater than 5");
-});
-
-test("LinkedList - Join test", function () {
-	var listA = new LinkedList();
-	var listB = new LinkedList();
-	for (var i = 0; i < 5; i++) {
-		listA.pushBack(i);
-		listB.pushBack(i);
-	}
-	listA.join(listB);
-	deepEqual(listA.allIndexesOf(3), [3, 8], "Join of the lists");
-	deepEqual(listA.getLength(), 10, "Check the length of the list");
-});
-
-test("LinkedList - Divide test", function () {
-	var list = new LinkedList();
-	for (var i = 0; i < 10; i++)
-		list.pushBack(i);
-	var listA = list.divide(-1);
-	deepEqual(listA.isEmpty(), true, "Divide before start");
-	var listB = list.divide(10);
-	deepEqual(listB.isEmpty(), true, "Divide after end");
-	var listC = list.divide(8);
-	deepEqual(listC.getItem(0), 8, "Divide at valid position");
-	deepEqual(listC.getItem(1), 9, "Divide at valid position");
-	deepEqual(listC.getLength(), 2, "Divide at valid position");
-	deepEqual(list.getItem(8), undefined, "Divide at valid position");
-	deepEqual(list.getLength(), 8, "Divide at valid position");
-	var listD = list.divide(0);
-	deepEqual(listD.getLength(), 8, "Divide at the first position");
-	deepEqual(listD.getItem(0), 0, "Divide at the first position");
-	deepEqual(listD.getItem(8), undefined, "Divide at the first position");
-	deepEqual(listD.getItem(7), 7, "Divide at the first position");
-	deepEqual(list.getLength(), 0, "Divide at the first position");
-	deepEqual(list.getItem(0), undefined, "Divide at the first position");
-});
-
-test("LinkedList - Clone test", function () {
-	var list = new LinkedList();
-	for (var i = 0; i < 10; i++)
-		list.pushBack(i);
-	var clone = list.clone();
-	var it = clone.getIterator();
-	var j = 0;
-	for (it.first(); !it.isDone(); it.next(), j++)
-		deepEqual(it.getItem(), j, "Clone of the list");
-});
-
-test("LinkedList - Clone distinct test", function () {
-	var list = new LinkedList();
-	for (var i = 0; i < 20; i++)
-		list.pushBack(i % 10);
-	var clone = list.cloneDistinct();
-	deepEqual(clone.allIndexesOf(2), [2], "Clone of the list");
-});
-
-test("LinkedList - Split test", function () {
-	var list = new LinkedList();
-	for (var i = 0; i < 7; i++)
-		list.pushBack(i);
-	var lists = list.split(3);
-	deepEqual(lists.length, 3, "Check the number of lists created");
-	deepEqual(lists[0].toArray(), [0, 1, 2], "Check the items in the lists created");
-	deepEqual(lists[1].toArray(), [3, 4, 5], "Check the items in the lists created");
-	deepEqual(lists[2].toArray(), [6], "Check the items in the lists created");
-});
-
-test("LinkedList - Count test", function () {
-	var list = new LinkedList();
-	for (var i = 0; i < 10; i++)
-		list.pushBack(i);
-	var callback = function (item) {
-		return item > 4;
-	};
-	deepEqual(list.count(callback), 5, "Count the items that are greater than 4");
-});
\ No newline at end of file
diff --git a/Tests/LinkedList_Test.ts b/Tests/LinkedList_Test.ts
new file mode 100644
index 0000000..d04bf42
--- /dev/null
+++ b/Tests/LinkedList_Test.ts
@@ -0,0 +1,427 @@
+/**
+ * Created by Stefano on 31/03/14.
+ */
+
+QUnit.test("LinkedList - Init test", function (assert)
+{
+	var list = new ds.LinkedList(0, 1, 2);
+	assert.deepEqual(list.toArray(), [0, 1, 2], "Init list");
+	list = new ds.LinkedList(0);
+	assert.deepEqual(list.toArray(), [0], "Init list");
+});
+
+QUnit.test("LinkedList - Init test with range", function (assert)
+{
+	var list = new ds.LinkedList(ds.Range(0, 5));
+	assert.deepEqual(list.toArray(), [0, 1, 2, 3, 4, 5], "Init list with range");
+});
+
+QUnit.test("LinkedList - Push test", function (assert)
+{
+	var list = new ds.LinkedList();
+	list.pushFront(0);
+	list.pushFront(1);
+	list.pushBack(2);
+	list.pushBack(3);
+	assert.deepEqual(list.getItem(0), 1, "Push front 1");
+	assert.deepEqual(list.getItem(1), 0, "Push front 0");
+	assert.deepEqual(list.getItem(2), 2, "Push back 2");
+	assert.deepEqual(list.getItem(3), 3, "Push back 3");
+});
+
+QUnit.test("LinkedList - Pop test", function (assert)
+{
+	var list = new ds.LinkedList();
+	list.pushFront(0);
+	list.pushFront(1);
+	list.pushBack(2);
+	list.pushBack(3);
+	assert.deepEqual(list.popBack(), 3, "Pop back 3");
+	assert.deepEqual(list.popFront(), 1, "Pop front 1");
+	assert.deepEqual(list.popBack(), 2, "Pop back 2");
+	assert.deepEqual(list.popFront(), 0, "Pop front 0");
+});
+
+QUnit.test("LinkedList - Remove at test", function (assert)
+{
+	var list = new ds.LinkedList();
+	list.pushFront(0);
+	list.pushFront(1);
+	list.pushBack(2);
+	list.pushBack(3);
+	assert.deepEqual(list.removeAt(1), 0, "Remove at 1");
+	assert.deepEqual(list.removeAt(1), 2, "Remove at 1");
+	assert.deepEqual(list.removeAt(1), 3, "Remove at 1");
+	assert.deepEqual(list.removeAt(0), 1, "Remove at 0");
+});
+
+QUnit.test("LinkedList - Remove test", function (assert)
+{
+	var list = new ds.LinkedList();
+	for (var i = 0; i < 30; i++)
+		list.pushBack(i % 10);
+	list.pushBack(15);
+	var callback = function (item)
+	{
+		return !(item % 2) && item > 5;
+	};
+	list.remove(0);
+	assert.deepEqual(list.indexOf(0), 9, "Remove 0");
+	list.remove(15);
+	assert.deepEqual(list.indexOf(15), -1, "Remove 15");
+	list.remove(9);
+	list.remove(9);
+	list.remove(9);
+	assert.deepEqual(list.indexOf(9), -1, "Remove 9");
+	list.remove(0, callback);
+	assert.deepEqual(list.indexOf(6), 13, "Remove the first even numbers greater than 5");
+});
+
+QUnit.test("LinkedList - Remove all test", function (assert)
+{
+	var list = new ds.LinkedList();
+	for (var i = 0; i < 30; i++)
+		list.pushBack(i % 10);
+	var callback = function (item)
+	{
+		return !(item % 2) && item > 5;
+	};
+	list.removeAll(0);
+	assert.deepEqual(list.indexOf(0), -1, "Remove all 0");
+	list.removeAll(9);
+	assert.deepEqual(list.indexOf(9), -1, "Remove all 9");
+	list.removeAll(0, callback);
+	assert.deepEqual(list.indexOf(8), -1, "Remove all the even numbers greater than 5");
+});
+
+QUnit.test("LinkedList - Remove segment test", function (assert)
+{
+	var list = new ds.LinkedList();
+	for (var i = 0; i < 10; i++)
+		list.pushBack(i);
+	assert.deepEqual(list.removeSegment(2, 6), [2, 3, 4, 5, 6], "Remove the segment from the list");
+	assert.deepEqual(list.toArray(), [0, 1, 7, 8, 9], "Remove the segment from the list");
+	assert.deepEqual(list.getLength(), 5, "Remove the segment from the list");
+	assert.deepEqual(list.removeSegment(2, 1), [7, 8, 9], "Remove the segment from the list");
+	assert.deepEqual(list.toArray(), [0, 1], "Remove the segment from the list");
+	assert.deepEqual(list.getLength(), 2, "Remove the segment from the list");
+});
+
+QUnit.test("LinkedList - Modify at test", function (assert)
+{
+	var list = new ds.LinkedList();
+	for (var i = 0; i < 4; i++)
+		list.pushBack(i);
+	list.modifyAt(2, 6);
+	assert.deepEqual(list.toArray(), [0, 1, 6, 3], "Change at valid position");
+	list.modifyAt(5, 5);
+	assert.deepEqual(list.toArray(), [0, 1, 6, 3], "Change at non valid position");
+});
+
+QUnit.test("LinkedList - To array test", function (assert)
+{
+	var list = new ds.LinkedList();
+	list.pushFront(0);
+	list.pushFront(1);
+	list.pushBack(2);
+	list.pushBack(3);
+	var array = list.toArray();
+	assert.deepEqual(array[0], 1, "To array");
+	assert.deepEqual(array[1], 0, "To array");
+	assert.deepEqual(array[2], 2, "To array");
+	assert.deepEqual(array[3], 3, "To array");
+});
+
+QUnit.test("LinkedList - From array test", function (assert)
+{
+	var array = [5, 2, 6, 4];
+	var list = new ds.LinkedList();
+	list.fromArray(array);
+	assert.deepEqual(list.getItem(0), 5, "From array");
+	assert.deepEqual(list.getItem(1), 2, "From array");
+	assert.deepEqual(list.getItem(2), 6, "From array");
+	assert.deepEqual(list.getItem(3), 4, "From array");
+});
+
+QUnit.test("LinkedList - Filter test", function (assert)
+{
+	var list = new ds.LinkedList<number>();
+	const length = 100;
+
+	for (var i = 0; i < length; i++)
+		list.pushFront(i);
+
+	var result = list.filter(function (item)
+	{
+		return Boolean(1 - item % 2);
+	});
+
+	assert.deepEqual(result[0], 98, "Filter of the even values");
+	assert.deepEqual(result[result.length - 1], 0, "Filter on the even values");
+});
+
+QUnit.test("LinkedList - Iterator test", function (assert)
+{
+	var list = new ds.LinkedList();
+
+	for (var i = 0; i < 100; i++)
+		list.pushBack(i);
+
+	var it = list.getIterator();
+
+	var j = 0;
+	for (it.first(); !it.isDone(); it.next(), j++)
+	{
+		assert.deepEqual(it.getItem(), j, "Check iterator position");
+	}
+
+});
+
+QUnit.test("LinkedList - Add at test", function (assert)
+{
+	var list = new ds.LinkedList();
+	list.addAt(5, 0);
+	assert.deepEqual(list.peek(), 5, "Add at 0");
+	list.addAt(2, 1);
+	assert.deepEqual(list.getItem(1), 2, "Add at 1");
+	list.addAt(15, 6);
+	assert.deepEqual(list.getItem(2), undefined, "Add at 6");
+	assert.deepEqual(list.getItem(5), undefined, "Add at 6");
+	assert.deepEqual(list.getItem(6), 15, "Add at 6");
+	list.addAt(30, 6);
+	assert.deepEqual(list.getItem(6), 30, "Add at 6");
+	assert.deepEqual(list.getItem(7), 15, "Add at 6");
+	list.addAt(6, 0);
+	assert.deepEqual(list.peek(), 6, "Add at 0");
+});
+
+QUnit.test("LinkedList - MultiPop test", function (assert)
+{
+	var list = new ds.LinkedList();
+	list.pushFront(0);
+	list.pushFront(1);
+	list.pushBack(2);
+	list.pushBack(3);
+	assert.deepEqual(list.multiPopBack(2), [3, 2], "Multi pop back");
+	assert.deepEqual(list.multiPopFront(2), [1, 0], "Multi pop front");
+});
+
+QUnit.test("LinkedList - Get length test", function (assert)
+{
+	var list = new ds.LinkedList();
+	assert.deepEqual(list.getLength(), 0, "Get length empty");
+	list.pushFront(0);
+	list.pushFront(1);
+	list.pushBack(2);
+	list.pushBack(3);
+	assert.deepEqual(list.getLength(), 4, "Get length");
+	list.multiPopBack(2);
+	assert.deepEqual(list.getLength(), 2, "Get length");
+
+});
+
+QUnit.test("LinkedList - Peek test", function (assert)
+{
+	var list = new ds.LinkedList();
+	list.pushFront(0);
+	assert.deepEqual(list.peek(), 0, "Peek");
+	list.pushFront(1);
+	list.pushBack(2);
+	assert.deepEqual(list.peek(), 1, "Peek");
+	list.pushBack(3);
+	assert.deepEqual(list.peek(), 1, "Peek");
+});
+
+QUnit.test("LinkedList - Clear test", function (assert)
+{
+	var list = new ds.LinkedList();
+	list.pushFront(0);
+	list.pushFront(1);
+	list.pushBack(2);
+	list.pushBack(3);
+	list.clear();
+	assert.deepEqual(list.getLength(), 0, "Clear the list");
+
+});
+
+QUnit.test("LinkedList - Is empty test", function (assert)
+{
+	var list = new ds.LinkedList();
+	assert.deepEqual(list.isEmpty(), true, "Is empty");
+	list.pushFront(0);
+	list.pushFront(1);
+	list.pushBack(2);
+	list.pushBack(3);
+	assert.deepEqual(list.isEmpty(), false, "Is not empty");
+	list.clear();
+	assert.deepEqual(list.isEmpty(), true, "Is empty");
+});
+
+QUnit.test("LinkedList - Contains test", function (assert)
+{
+	var list = new ds.LinkedList();
+	list.pushBack(0);
+	list.pushBack(2);
+	assert.deepEqual(list.contains(0), true, "Contains 0");
+	assert.deepEqual(list.contains(2), true, "Contains 2");
+	assert.deepEqual(list.contains(1), false, "Not contains 1");
+	var callback = function (item)
+	{
+		return item > 0;
+	};
+	assert.deepEqual(list.contains(null, callback), true, "Contains a value > 0");
+	callback = function (item)
+	{
+		return item < 0;
+	};
+	assert.deepEqual(list.contains(null, callback), false, "Contains a value < 0");
+});
+
+QUnit.test("LinkedList - Execute test", function (assert)
+{
+	var list = new ds.LinkedList();
+	list.pushBack(0);
+	list.pushBack(2);
+	var callback = function (item)
+	{
+		return item * 2;
+	};
+	list.execute(callback);
+	assert.deepEqual(list.getItem(0), 0, "Execute for item 0");
+	assert.deepEqual(list.getItem(1), 4, "Execute for item 1");
+});
+
+QUnit.test("LinkedList - Index of test", function (assert)
+{
+	var list = new ds.LinkedList();
+	for (var i = 0; i < 10; i++)
+		list.pushBack(i);
+	var callback = function (item)
+	{
+		return !(item % 2) && item > 5;
+	};
+	assert.deepEqual(list.indexOf(0), 0, "Index of 0");
+	assert.deepEqual(list.indexOf(15), -1, "Index of 15");
+	assert.deepEqual(list.indexOf(5), 5, "Index of 5");
+	list.removeAt(5);
+	assert.deepEqual(list.indexOf(6), 5, "Index of 6");
+	assert.deepEqual(list.indexOf(null, callback), 5, "Index of the first even number greater than 5");
+});
+
+QUnit.test("LinkedList - Last index of test", function (assert)
+{
+	var list = new ds.LinkedList();
+	for (var i = 0; i < 10; i++)
+		list.pushBack(i);
+	var callback = function (item)
+	{
+		return !(item % 2) && item > 5;
+	};
+	assert.deepEqual(list.lastIndexOf(0), 0, "Last index of 0");
+	assert.deepEqual(list.lastIndexOf(15), -1, "Last index of 15");
+	assert.deepEqual(list.lastIndexOf(5), 5, "Last index of 5");
+	list.removeAt(5);
+	assert.deepEqual(list.lastIndexOf(6), 5, "Last index of 6");
+	assert.deepEqual(list.lastIndexOf(null, callback), 7, "Index of the last even number greater than 5");
+});
+
+QUnit.test("LinkedList - Indexes of test", function (assert)
+{
+	var list = new ds.LinkedList();
+	for (var i = 0; i < 30; i++)
+		list.pushBack(i % 10);
+	var callback = function (item)
+	{
+		return !(item % 2) && item > 5;
+	};
+	assert.deepEqual(list.allIndexesOf(0), [0, 10, 20], "Indexes of 0");
+	assert.deepEqual(list.allIndexesOf(15), [], "Indexes of 15");
+	assert.deepEqual(list.allIndexesOf(5), [5, 15, 25], "Indexes of 5");
+	list.removeAt(5);
+	assert.deepEqual(list.allIndexesOf(5), [14, 24], "Indexes of 5");
+	assert.deepEqual(list.allIndexesOf(6), [5, 15, 25], "Indexes of 6");
+	assert.deepEqual(list.allIndexesOf(null, callback), [5, 7, 15, 17, 25, 27], "Indexes of the even numbers greater than 5");
+});
+
+QUnit.test("LinkedList - Join test", function (assert)
+{
+	var listA = new ds.LinkedList();
+	var listB = new ds.LinkedList();
+	for (var i = 0; i < 5; i++)
+	{
+		listA.pushBack(i);
+		listB.pushBack(i);
+	}
+	listA.join(listB);
+	assert.deepEqual(listA.allIndexesOf(3), [3, 8], "Join of the lists");
+	assert.deepEqual(listA.getLength(), 10, "Check the length of the list");
+});
+
+QUnit.test("LinkedList - Divide test", function (assert)
+{
+	var list = new ds.LinkedList();
+	for (var i = 0; i < 10; i++)
+		list.pushBack(i);
+	var listA = list.divide(-1);
+	assert.deepEqual(listA.isEmpty(), true, "Divide before start");
+	var listB = list.divide(10);
+	assert.deepEqual(listB.isEmpty(), true, "Divide after end");
+	var listC = list.divide(8);
+	assert.deepEqual(listC.getItem(0), 8, "Divide at valid position");
+	assert.deepEqual(listC.getItem(1), 9, "Divide at valid position");
+	assert.deepEqual(listC.getLength(), 2, "Divide at valid position");
+	assert.deepEqual(list.getItem(8), undefined, "Divide at valid position");
+	assert.deepEqual(list.getLength(), 8, "Divide at valid position");
+	var listD = list.divide(0);
+	assert.deepEqual(listD.getLength(), 8, "Divide at the first position");
+	assert.deepEqual(listD.getItem(0), 0, "Divide at the first position");
+	assert.deepEqual(listD.getItem(8), undefined, "Divide at the first position");
+	assert.deepEqual(listD.getItem(7), 7, "Divide at the first position");
+	assert.deepEqual(list.getLength(), 0, "Divide at the first position");
+	assert.deepEqual(list.getItem(0), undefined, "Divide at the first position");
+});
+
+QUnit.test("LinkedList - Clone test", function (assert)
+{
+	var list = new ds.LinkedList();
+	for (var i = 0; i < 10; i++)
+		list.pushBack(i);
+	var clone = list.clone();
+	var it = clone.getIterator();
+	var j = 0;
+	for (it.first(); !it.isDone(); it.next(), j++)
+		assert.deepEqual(it.getItem(), j, "Clone of the list");
+});
+
+QUnit.test("LinkedList - Clone distinct test", function (assert)
+{
+	var list = new ds.LinkedList();
+	for (var i = 0; i < 20; i++)
+		list.pushBack(i % 10);
+	var clone = list.cloneDistinct();
+	assert.deepEqual(clone.allIndexesOf(2), [2], "Clone of the list");
+});
+
+QUnit.test("LinkedList - Split test", function (assert)
+{
+	var list = new ds.LinkedList();
+	for (var i = 0; i < 7; i++)
+		list.pushBack(i);
+	var lists = list.split(3);
+	assert.deepEqual(lists.length, 3, "Check the number of lists created");
+	assert.deepEqual(lists[0].toArray(), [0, 1, 2], "Check the items in the lists created");
+	assert.deepEqual(lists[1].toArray(), [3, 4, 5], "Check the items in the lists created");
+	assert.deepEqual(lists[2].toArray(), [6], "Check the items in the lists created");
+});
+
+QUnit.test("LinkedList - Count test", function (assert)
+{
+	var list = new ds.LinkedList();
+	for (var i = 0; i < 10; i++)
+		list.pushBack(i);
+	var callback = function (item)
+	{
+		return item > 4;
+	};
+	assert.deepEqual(list.count(callback), 5, "Count the items that are greater than 4");
+});
\ No newline at end of file
diff --git a/Tests/PriorityQueue_Test.js b/Tests/PriorityQueue_Test.js
deleted file mode 100644
index 09c2b86..0000000
--- a/Tests/PriorityQueue_Test.js
+++ /dev/null
@@ -1,197 +0,0 @@
-/**
- * Created by Battistella Stefano on 31/03/14.
- */
-
-test("PriorityQueue - Enqueue test", function () {
-	var queue = new PriorityQueue();
-	queue.enqueue(5, 0);
-	deepEqual(queue.peek(), 0, "Enqueue 0");
-	queue.enqueue(2, 6);
-	deepEqual(queue.getItem(0), 0, "Enqueue 6");
-	deepEqual(queue.getItem(1), 6, "Enqueue 6");
-});
-
-test("PriorityQueue - MultiEnqueue test", function () {
-	var queue = new PriorityQueue();
-	queue.multiEnqueue(3, [0, 2]);
-	deepEqual(queue.multiDequeue(2), [0, 2], "MultiEnqueue 2 items");
-	queue.multiEnqueue(4, [2]);
-	queue.multiEnqueue(5, [4, 5, 8]);
-	deepEqual(queue.multiDequeue(4), [4, 5, 8, 2], "MultiDequeue 4 items");
-	queue.multiEnqueue(0, []);
-	deepEqual(queue.multiDequeue(1), [], "MultiEnqueue 0 items");
-});
-
-test("PriorityQueue - Dequeue test", function () {
-	var queue = new PriorityQueue();
-	queue.enqueue(5, 0);
-	queue.enqueue(2, 2);
-	deepEqual(queue.dequeue(), 0, "Dequeue");
-	deepEqual(queue.dequeue(), 2, "Dequeue");
-	deepEqual(queue.dequeue(), undefined, "Check length if too much dequeue");
-});
-
-test("PriorityQueue - MultiDequeue test", function () {
-	var queue = new PriorityQueue();
-	queue.enqueue(10, 0);
-	queue.enqueue(8, 2);
-	deepEqual(queue.multiDequeue(1), [0], "MultiDequeue 1 time");
-	deepEqual(queue.getLength(), 1, "MultiDequeue 1 time check length");
-	queue.enqueue(9, 4);
-	queue.enqueue(4, 5);
-	queue.enqueue(6, 8);
-	deepEqual(queue.multiDequeue(7), [4, 2, 8, 5], "MultiDequeue 7 times");
-	deepEqual(queue.getLength(), 0, "MultiDequeue 7 time check length");
-	deepEqual(queue.multiDequeue(1), [], "MultiDequeue 1 time with queue empty");
-});
-
-test("PriorityQueue - Remove test", function () {
-	var queue = new PriorityQueue();
-	queue.enqueue(4, 0);
-	queue.enqueue(3, 2);
-	queue.enqueue(2, 4);
-	queue.enqueue(1, 5);
-	queue.enqueue(0, 8);
-	queue.remove(2, 2);
-	deepEqual(queue.multiDequeue(3), [0, 2, 8], "Remove from position 2 for 2");
-});
-
-test("PriorityQueue - Is empty test", function () {
-	var queue = new PriorityQueue();
-	queue.enqueue(5, 0);
-	queue.enqueue(2, 2);
-	deepEqual(queue.isEmpty(), false, "Is empty");
-	queue.clear();
-	deepEqual(queue.isEmpty(), true, "Is empty");
-});
-
-test("PriorityQueue - Clear test", function () {
-	var queue = new PriorityQueue();
-	queue.enqueue(5, 0);
-	queue.enqueue(5, 2);
-	queue.clear();
-	deepEqual(queue.isEmpty(), true, "Clear queue");
-});
-
-test("PriorityQueue - Iterator test", function () {
-	var queue = new PriorityQueue();
-	for (var i = 0; i < 10; i++)
-		queue.enqueue(10 - Math.floor(i / 2), i);
-	var j = 0;
-	var it = queue.getIterator();
-	for (it.first(); !it.isDone(); it.next(), j++)
-		deepEqual(it.getItem(), j, "Get next item " + j);
-	j--;
-	for (it.last(); !it.isDone(); it.previous(), j--)
-		deepEqual(it.getItem(), j, "Get previous item " + j);
-});
-
-test("PriorityQueue - Contains priority test", function () {
-	var queue = new PriorityQueue();
-	queue.enqueue(5, 0);
-	queue.enqueue(2, 2);
-	deepEqual(queue.containsPriority(5), true, "Contains priority 5");
-	deepEqual(queue.containsPriority(2), true, "Contains priority 2");
-	deepEqual(queue.containsPriority(1), false, "Not contains priority 1");
-	var callback = function (item) {
-		return item > 3;
-	};
-	deepEqual(queue.containsPriority(null, callback), true, "Contains a priority > 3");
-	callback = function (item) {
-		return item < 2;
-	};
-	deepEqual(queue.containsPriority(null, callback), false, "Contains a priority < 2");
-});
-
-test("PriorityQueue - Get items test", function () {
-	var queue = new PriorityQueue();
-	queue.enqueue(5, 0);
-	queue.enqueue(5, 2);
-	queue.enqueue(5, 5);
-	deepEqual(queue.getItems(5), [0, 2, 5], "Get items with priority 5");
-	deepEqual(queue.getItems(1), [], "Get items with priority 1");
-});
-
-test("PriorityQueue - To queue test", function () {
-	var priorityQueue = new PriorityQueue();
-	priorityQueue.enqueue(5, 0);
-	priorityQueue.enqueue(5, 2);
-	priorityQueue.enqueue(5, 5);
-	var queue = priorityQueue.toQueue();
-	deepEqual(queue.items, [0, 2, 5], "Check the to queue method");
-});
-
-test("PriorityQueue - Execute test", function () {
-	var queue = new PriorityQueue();
-	queue.enqueue(4, 0);
-	queue.enqueue(3, 2);
-	var callback = function (item) {
-		return item * 2;
-	};
-	queue.execute(callback);
-	deepEqual(queue.getItem(0), 0, "Execute for item 0");
-	deepEqual(queue.getItem(1), 4, "Execute for item 1");
-});
-
-test("PriorityQueue - Remove test", function () {
-	var queue = new PriorityQueue();
-	queue.enqueue(4, 0);
-	queue.enqueue(3, 1);
-	queue.enqueue(2, 2);
-	queue.enqueue(1, 3);
-	queue.enqueue(0, 4);
-	for (var i = 0; i < 5; i++)
-		deepEqual(queue.getItem(i), i, "Check queue correctness");
-	queue.changePriority(3, 8);
-	for (var j = 0; j < 5; j++) {
-		if (!j)
-			deepEqual(queue.getItem(j), 3, "Check increase priority");
-		else if (j < 4)
-			deepEqual(queue.getItem(j), j - 1, "Check increase priority");
-		else
-			deepEqual(queue.getItem(j), j, "Check increase priority");
-	}
-	queue.changePriority(3, -4);
-	for (var k = 0; k < 5; k++) {
-		if (!k)
-			deepEqual(queue.getItem(k), 3, "Check decrease priority");
-		else if (k < 3)
-			deepEqual(queue.getItem(k), k - 1, "Check decrease priority");
-		else if (k === 3)
-			deepEqual(queue.getItem(k), 4, "Check decrease priority");
-		else
-			deepEqual(queue.getItem(k), 2, "Check decrease priority");
-	}
-
-});
-
-test("PriorityQueue - Filter test", function () {
-	var queue = new PriorityQueue();
-	const length = 100;
-
-	for (var i = 0; i < length; i++)
-		queue.enqueue(i, i);
-
-	var result = queue.filter(function (item) {
-		return 1 - item % 2;
-	});
-
-	deepEqual(result[0], 98, "Filter of the even values");
-	deepEqual(result[result.length - 1], 0, "Filter on the even values");
-});
-
-test("PriorityQueue - Clone test", function () {
-	var queue = new PriorityQueue();
-	for (var i = 0; i < 10; i++)
-		queue.enqueue(i, i);
-	var clone = queue.clone();
-	deepEqual(clone.multiDequeue(10), [9, 8, 7, 6, 5, 4, 3, 2, 1, 0], "Clone of the queue");
-});
-
-test("PriorityQueue - Clone distinct test", function () {
-	var queue = new PriorityQueue();
-	for (var i = 0; i < 40; i++)
-		queue.enqueue(i % 20, i % 10);
-	var clone = queue.cloneDistinct();
-	deepEqual(clone.multiDequeue(10), [9, 8, 7, 6, 5, 4, 3, 2, 1, 0], "Clone of the queue");
-});
\ No newline at end of file
diff --git a/Tests/PriorityQueue_Test.ts b/Tests/PriorityQueue_Test.ts
new file mode 100644
index 0000000..a41d44a
--- /dev/null
+++ b/Tests/PriorityQueue_Test.ts
@@ -0,0 +1,219 @@
+/**
+ * Created by Battistella Stefano on 31/03/14.
+ */
+
+QUnit.test("PriorityQueue - Enqueue test", function (assert)
+{
+	var queue = new ds.PriorityQueue();
+	queue.enqueue(5, 0);
+	assert.deepEqual(queue.peek(), 0, "Enqueue 0");
+	queue.enqueue(2, 6);
+	assert.deepEqual(queue.getItem(0), 0, "Enqueue 6");
+	assert.deepEqual(queue.getItem(1), 6, "Enqueue 6");
+});
+
+QUnit.test("PriorityQueue - MultiEnqueue test", function (assert)
+{
+	var queue = new ds.PriorityQueue();
+	queue.multiEnqueue(3, [0, 2]);
+	assert.deepEqual(queue.multiDequeue(2), [0, 2], "MultiEnqueue 2 items");
+	queue.multiEnqueue(4, [2]);
+	queue.multiEnqueue(5, [4, 5, 8]);
+	assert.deepEqual(queue.multiDequeue(4), [4, 5, 8, 2], "MultiDequeue 4 items");
+	queue.multiEnqueue(0, []);
+	assert.deepEqual(queue.multiDequeue(1), [], "MultiEnqueue 0 items");
+});
+
+QUnit.test("PriorityQueue - Dequeue test", function (assert)
+{
+	var queue = new ds.PriorityQueue();
+	queue.enqueue(5, 0);
+	queue.enqueue(2, 2);
+	assert.deepEqual(queue.dequeue(), 0, "Dequeue");
+	assert.deepEqual(queue.dequeue(), 2, "Dequeue");
+	assert.deepEqual(queue.dequeue(), undefined, "Check length if too much dequeue");
+});
+
+QUnit.test("PriorityQueue - MultiDequeue test", function (assert)
+{
+	var queue = new ds.PriorityQueue();
+	queue.enqueue(10, 0);
+	queue.enqueue(8, 2);
+	assert.deepEqual(queue.multiDequeue(1), [0], "MultiDequeue 1 time");
+	assert.deepEqual(queue.getLength(), 1, "MultiDequeue 1 time check length");
+	queue.enqueue(9, 4);
+	queue.enqueue(4, 5);
+	queue.enqueue(6, 8);
+	assert.deepEqual(queue.multiDequeue(7), [4, 2, 8, 5], "MultiDequeue 7 times");
+	assert.deepEqual(queue.getLength(), 0, "MultiDequeue 7 time check length");
+	assert.deepEqual(queue.multiDequeue(1), [], "MultiDequeue 1 time with queue empty");
+});
+
+QUnit.test("PriorityQueue - Remove test", function (assert)
+{
+	var queue = new ds.PriorityQueue();
+	queue.enqueue(4, 0);
+	queue.enqueue(3, 2);
+	queue.enqueue(2, 4);
+	queue.enqueue(1, 5);
+	queue.enqueue(0, 8);
+	queue.remove(2, 2);
+	assert.deepEqual(queue.multiDequeue(3), [0, 2, 8], "Remove from position 2 for 2");
+});
+
+QUnit.test("PriorityQueue - Is empty test", function (assert)
+{
+	var queue = new ds.PriorityQueue();
+	queue.enqueue(5, 0);
+	queue.enqueue(2, 2);
+	assert.deepEqual(queue.isEmpty(), false, "Is empty");
+	queue.clear();
+	assert.deepEqual(queue.isEmpty(), true, "Is empty");
+});
+
+QUnit.test("PriorityQueue - Clear test", function (assert)
+{
+	var queue = new ds.PriorityQueue<number>();
+	queue.enqueue(5, 0);
+	queue.enqueue(5, 2);
+	queue.clear();
+	assert.deepEqual(queue.isEmpty(), true, "Clear queue");
+});
+
+QUnit.test("PriorityQueue - Iterator test", function (assert)
+{
+	var queue = new ds.PriorityQueue();
+	for (var i = 0; i < 10; i++)
+		queue.enqueue(10 - Math.floor(i / 2), i);
+	var j = 0;
+	var it = queue.getIterator();
+	for (it.first(); !it.isDone(); it.next(), j++)
+		assert.deepEqual(it.getItem(), j, "Get next item " + j);
+	j--;
+	for (it.last(); !it.isDone(); it.previous(), j--)
+		assert.deepEqual(it.getItem(), j, "Get previous item " + j);
+});
+
+QUnit.test("PriorityQueue - Contains priority test", function (assert)
+{
+	var queue = new ds.PriorityQueue();
+	queue.enqueue(5, 0);
+	queue.enqueue(2, 2);
+	assert.deepEqual(queue.containsPriority(5), true, "Contains priority 5");
+	assert.deepEqual(queue.containsPriority(2), true, "Contains priority 2");
+	assert.deepEqual(queue.containsPriority(1), false, "Not contains priority 1");
+	var callback = function (item)
+	{
+		return item > 3;
+	};
+	assert.deepEqual(queue.containsPriority(null, callback), true, "Contains a priority > 3");
+	callback = function (item)
+	{
+		return item < 2;
+	};
+	assert.deepEqual(queue.containsPriority(null, callback), false, "Contains a priority < 2");
+});
+
+QUnit.test("PriorityQueue - Get items test", function (assert)
+{
+	var queue = new ds.PriorityQueue();
+	queue.enqueue(5, 0);
+	queue.enqueue(5, 2);
+	queue.enqueue(5, 5);
+	assert.deepEqual(queue.getItems(5), [0, 2, 5], "Get items with priority 5");
+	assert.deepEqual(queue.getItems(1), [], "Get items with priority 1");
+});
+
+QUnit.test("PriorityQueue - To queue test", function (assert)
+{
+	var priorityQueue = new ds.PriorityQueue();
+	priorityQueue.enqueue(5, 0);
+	priorityQueue.enqueue(5, 2);
+	priorityQueue.enqueue(5, 5);
+	var queue = priorityQueue.toQueue();
+	assert.deepEqual(queue.items, [0, 2, 5], "Check the to queue method");
+});
+
+QUnit.test("PriorityQueue - Execute test", function (assert)
+{
+	var queue = new ds.PriorityQueue();
+	queue.enqueue(4, 0);
+	queue.enqueue(3, 2);
+	var callback = function (item)
+	{
+		return item * 2;
+	};
+	queue.execute(callback);
+	assert.deepEqual(queue.getItem(0), 0, "Execute for item 0");
+	assert.deepEqual(queue.getItem(1), 4, "Execute for item 1");
+});
+
+QUnit.test("PriorityQueue - Remove test", function (assert)
+{
+	var queue = new ds.PriorityQueue();
+	queue.enqueue(4, 0);
+	queue.enqueue(3, 1);
+	queue.enqueue(2, 2);
+	queue.enqueue(1, 3);
+	queue.enqueue(0, 4);
+	for (var i = 0; i < 5; i++)
+		assert.deepEqual(queue.getItem(i), i, "Check queue correctness");
+	queue.changePriority(3, 8);
+	for (var j = 0; j < 5; j++)
+	{
+		if (!j)
+			assert.deepEqual(queue.getItem(j), 3, "Check increase priority");
+		else if (j < 4)
+			assert.deepEqual(queue.getItem(j), j - 1, "Check increase priority");
+		else
+			assert.deepEqual(queue.getItem(j), j, "Check increase priority");
+	}
+	queue.changePriority(3, -4);
+	for (var k = 0; k < 5; k++)
+	{
+		if (!k)
+			assert.deepEqual(queue.getItem(k), 3, "Check decrease priority");
+		else if (k < 3)
+			assert.deepEqual(queue.getItem(k), k - 1, "Check decrease priority");
+		else if (k === 3)
+			assert.deepEqual(queue.getItem(k), 4, "Check decrease priority");
+		else
+			assert.deepEqual(queue.getItem(k), 2, "Check decrease priority");
+	}
+
+});
+
+QUnit.test("PriorityQueue - Filter test", function (assert)
+{
+	var queue = new ds.PriorityQueue();
+	const length = 100;
+
+	for (var i = 0; i < length; i++)
+		queue.enqueue(i, i);
+
+	var result = queue.filter(function (item)
+	{
+		return 1 - item % 2;
+	});
+
+	assert.deepEqual(result[0], 98, "Filter of the even values");
+	assert.deepEqual(result[result.length - 1], 0, "Filter on the even values");
+});
+
+QUnit.test("PriorityQueue - Clone test", function (assert)
+{
+	var queue = new ds.PriorityQueue();
+	for (var i = 0; i < 10; i++)
+		queue.enqueue(i, i);
+	var clone = queue.clone();
+	assert.deepEqual(clone.multiDequeue(10), [9, 8, 7, 6, 5, 4, 3, 2, 1, 0], "Clone of the queue");
+});
+
+QUnit.test("PriorityQueue - Clone distinct test", function (assert)
+{
+	var queue = new ds.PriorityQueue();
+	for (var i = 0; i < 40; i++)
+		queue.enqueue(i % 20, i % 10);
+	var clone = queue.cloneDistinct();
+	assert.deepEqual(clone.multiDequeue(10), [9, 8, 7, 6, 5, 4, 3, 2, 1, 0], "Clone of the queue");
+});
\ No newline at end of file
diff --git a/Tests/Queue_Test.js b/Tests/Queue_Test.js
deleted file mode 100644
index 1081ded..0000000
--- a/Tests/Queue_Test.js
+++ /dev/null
@@ -1,220 +0,0 @@
-/**
- * Created by Battistella Stefano on 31/03/14.
- */
-
-test("Queue - Init test", function () {
-	var queue = new Queue(0, 2, 4, 6);
-	deepEqual(queue.multiDequeue(4), [0, 2, 4, 6], "Initializing");
-    queue = new Queue(0);
-    deepEqual(queue.multiDequeue(4), [0], "Initializing");
-});
-
-test("Queue - Init range test", function () {
-    var queue = new Queue(Range(0, 6, 2));
-    deepEqual(queue.multiDequeue(4), [0, 2, 4, 6], "Initializing");
-});
-
-test("Queue - Enqueue test", function () {
-	var queue = new Queue();
-	queue.enqueue(0);
-	deepEqual(queue.peek(), 0, "Enqueue 0");
-	queue.enqueue(2);
-	deepEqual(queue.getItem(0), 0, "Enqueue 2");
-	deepEqual(queue.getItem(1), 2, "Enqueue 2");
-});
-
-test("Queue - MultiEnqueue test", function () {
-	var queue = new Queue();
-	queue.multiEnqueue([0, 2]);
-	deepEqual(queue.multiDequeue(2), [0, 2], "MultiEnqueue 2 items");
-	queue.multiEnqueue([2]);
-	queue.multiEnqueue([4, 5, 8]);
-	deepEqual(queue.multiDequeue(4), [2, 4, 5, 8], "MultiDequeue 4 items");
-	queue.multiEnqueue([]);
-	deepEqual(queue.multiDequeue(1), [], "MultiEnqueue 0 items");
-});
-
-test("Queue - Dequeue test", function () {
-	var queue = new Queue();
-	queue.enqueue(0);
-	queue.enqueue(2);
-	deepEqual(queue.dequeue(), 0, "Dequeue");
-	deepEqual(queue.dequeue(), 2, "Dequeue");
-	deepEqual(queue.dequeue(), undefined, "Check length if too much dequeue");
-});
-
-test("Queue - MultiDequeue test", function () {
-	var queue = new Queue();
-	queue.enqueue(0);
-	queue.enqueue(2);
-	deepEqual(queue.multiDequeue(1), [0], "MultiDequeue 1 time");
-	queue.enqueue(4);
-	queue.enqueue(5);
-	queue.enqueue(8);
-	deepEqual(queue.multiDequeue(7), [2, 4, 5, 8], "MultiDequeue 7 times");
-	deepEqual(queue.multiDequeue(1), [], "MultiDequeue 1 time with queue empty");
-});
-
-test("Queue - Remove test", function () {
-	var queue = new Queue();
-	queue.enqueue(0);
-	queue.enqueue(2);
-	queue.enqueue(4);
-	queue.enqueue(5);
-	queue.enqueue(8);
-	queue.remove(2, 2);
-	deepEqual(queue.multiDequeue(3), [0, 2, 8], "Remove from position 2 for 2");
-});
-
-test("Queue - Iterator test", function () {
-	var queue = new Queue();
-	for (var i = 0; i < 10; i++)
-		queue.enqueue(i);
-	var j = 0;
-	var it = queue.getIterator();
-	for (it.first(); !it.isDone(); it.next(), j++)
-		deepEqual(it.getItem(), j, "Get next item " + j);
-	j--;
-	for (it.last(); !it.isDone(); it.previous(), j--)
-		deepEqual(it.getItem(), j, "Get previous item " + j);
-});
-
-test("Queue - Get length test", function () {
-	var queue = new Queue();
-	deepEqual(queue.getLength(), 0, "Length 0");
-	queue.enqueue(0);
-	deepEqual(queue.getLength(), 1, "Length 1");
-	queue.enqueue(2);
-	deepEqual(queue.getLength(), 2, "Length 2");
-	queue.dequeue();
-	queue.dequeue();
-	deepEqual(queue.getLength(), 0, "Length 0");
-
-});
-
-test("Queue - Peek test", function () {
-	var queue = new Queue();
-	queue.enqueue(0);
-	deepEqual(queue.peek(), 0, "Peek 0");
-	queue.enqueue(2);
-	deepEqual(queue.peek(), 0, "Peek 0");
-});
-
-test("Queue - Clear test", function () {
-	var queue = new Queue();
-	queue.enqueue(0);
-	queue.enqueue(2);
-	queue.clear();
-	deepEqual(queue.isEmpty(), true, "Clear queue");
-});
-
-test("Queue - Is empty test", function () {
-	var queue = new Queue();
-	queue.enqueue(0);
-	queue.enqueue(2);
-	deepEqual(queue.isEmpty(), false, "Is not empty");
-	queue.clear();
-	deepEqual(queue.isEmpty(), true, "Is empty");
-});
-
-test("Queue - Contains test", function () {
-	var queue = new Queue();
-	queue.enqueue(0);
-	queue.enqueue(2);
-	deepEqual(queue.contains(0), true, "Contains 0");
-	deepEqual(queue.contains(2), true, "Contains 2");
-	deepEqual(queue.contains(1), false, "Not contains 1");
-	var callback = function (item) {
-		return item > 0;
-	};
-	deepEqual(queue.contains(null, callback), true, "Contains a value > 0");
-	callback = function (item) {
-		return item < 0;
-	};
-	deepEqual(queue.contains(null, callback), false, "Contains a value < 0");
-});
-
-test("Queue - Execute test", function () {
-	var queue = new Queue();
-	queue.enqueue(0);
-	queue.enqueue(2);
-	var callback = function (item) {
-		return item * 2;
-	};
-	queue.execute(callback);
-	deepEqual(queue.getItem(0), 0, "Execute for item 0");
-	deepEqual(queue.getItem(1), 4, "Execute for item 1");
-});
-
-test("Queue - Index of test", function () {
-	var queue = new Queue();
-	for (var i = 0; i < 10; i++)
-		queue.enqueue(i);
-	var callback = function (item) {
-		return !(item % 2) && item > 5;
-	};
-	deepEqual(queue.indexOf(0), 0, "Index of 0");
-	deepEqual(queue.indexOf(15), -1, "Index of 15");
-	deepEqual(queue.indexOf(5), 5, "Index of 5");
-	deepEqual(queue.indexOf(null, callback), 6, "Index of the first even number greater than 5");
-});
-
-test("Queue - Last index of test", function () {
-	var queue = new Queue();
-	for (var i = 0; i < 10; i++)
-		queue.enqueue(i);
-	var callback = function (item) {
-		return !(item % 2) && item > 5;
-	};
-	deepEqual(queue.lastIndexOf(0), 0, "Last index of 0");
-	deepEqual(queue.lastIndexOf(15), -1, "Last index of 15");
-	deepEqual(queue.lastIndexOf(5), 5, "Last index of 5");
-	deepEqual(queue.lastIndexOf(null, callback), 8, "Index of the last even number greater than 5");
-});
-
-test("Queue - Indexes of test", function () {
-	var queue = new Queue();
-	for (var i = 0; i < 30; i++)
-		queue.enqueue(i % 10);
-	var callback = function (item) {
-		return !(item % 2) && item > 5;
-	};
-	deepEqual(queue.allIndexesOf(0), [0, 10, 20], "Indexes of 0");
-	deepEqual(queue.allIndexesOf(15), [], "Indexes of 15");
-	deepEqual(queue.allIndexesOf(5), [5, 15, 25], "Indexes of 5");
-	deepEqual(queue.allIndexesOf(null, callback), [6, 8, 16, 18, 26, 28], "Indexes of the even numbers greater than 5");
-});
-
-test("Queue - Clone test", function () {
-	var queue = new Queue();
-	for (var i = 0; i < 10; i++)
-		queue.enqueue(i);
-	var clone = queue.clone();
-	var it = clone.getIterator();
-	var j = 0;
-	for (it.first(); !it.isDone(); it.next(), j++)
-		deepEqual(it.getItem(), j, "Clone of the queue");
-});
-
-test("Queue - Clone distinct test", function () {
-	var queue = new Queue();
-	for (var i = 0; i < 20; i++)
-		queue.enqueue(i % 10);
-	var clone = queue.cloneDistinct();
-	deepEqual(clone.allIndexesOf(2), [2], "Clone of the queue");
-});
-
-test("Queue - Filter test", function () {
-	var queue = new Queue();
-	const length = 100;
-
-	for (var i = 0; i < length; i++)
-		queue.enqueue(i);
-
-	var result = queue.filter(function (item) {
-		return 1 - item % 2;
-	});
-
-	deepEqual(result[0], 0, "Filter of the even values");
-	deepEqual(result[result.length - 1], 98, "Filter on the even values");
-});
\ No newline at end of file
diff --git a/Tests/Queue_Test.ts b/Tests/Queue_Test.ts
new file mode 100644
index 0000000..b5c6ee6
--- /dev/null
+++ b/Tests/Queue_Test.ts
@@ -0,0 +1,247 @@
+/**
+ * Created by Battistella Stefano on 31/03/14.
+ */
+
+QUnit.test("Queue - Init test", function (assert)
+{
+	var queue = new ds.Queue(0, 2, 4, 6);
+	assert.deepEqual(queue.multiDequeue(4), [0, 2, 4, 6], "Initializing");
+	queue = new ds.Queue(0);
+	assert.deepEqual(queue.multiDequeue(4), [0], "Initializing");
+});
+
+QUnit.test("Queue - Init range test", function (assert)
+{
+	var queue = new ds.Queue(ds.Range(0, 6, 2));
+	assert.deepEqual(queue.multiDequeue(4), [0, 2, 4, 6], "Initializing");
+});
+
+QUnit.test("Queue - Enqueue test", function (assert)
+{
+	var queue = new ds.Queue();
+	queue.enqueue(0);
+	assert.deepEqual(queue.peek(), 0, "Enqueue 0");
+	queue.enqueue(2);
+	assert.deepEqual(queue.getItem(0), 0, "Enqueue 2");
+	assert.deepEqual(queue.getItem(1), 2, "Enqueue 2");
+});
+
+QUnit.test("Queue - MultiEnqueue test", function (assert)
+{
+	var queue = new ds.Queue();
+	queue.multiEnqueue([0, 2]);
+	assert.deepEqual(queue.multiDequeue(2), [0, 2], "MultiEnqueue 2 items");
+	queue.multiEnqueue([2]);
+	queue.multiEnqueue([4, 5, 8]);
+	assert.deepEqual(queue.multiDequeue(4), [2, 4, 5, 8], "MultiDequeue 4 items");
+	queue.multiEnqueue([]);
+	assert.deepEqual(queue.multiDequeue(1), [], "MultiEnqueue 0 items");
+});
+
+QUnit.test("Queue - Dequeue test", function (assert)
+{
+	var queue = new ds.Queue();
+	queue.enqueue(0);
+	queue.enqueue(2);
+	assert.deepEqual(queue.dequeue(), 0, "Dequeue");
+	assert.deepEqual(queue.dequeue(), 2, "Dequeue");
+	assert.deepEqual(queue.dequeue(), undefined, "Check length if too much dequeue");
+});
+
+QUnit.test("Queue - MultiDequeue test", function (assert)
+{
+	var queue = new ds.Queue();
+	queue.enqueue(0);
+	queue.enqueue(2);
+	assert.deepEqual(queue.multiDequeue(1), [0], "MultiDequeue 1 time");
+	queue.enqueue(4);
+	queue.enqueue(5);
+	queue.enqueue(8);
+	assert.deepEqual(queue.multiDequeue(7), [2, 4, 5, 8], "MultiDequeue 7 times");
+	assert.deepEqual(queue.multiDequeue(1), [], "MultiDequeue 1 time with queue empty");
+});
+
+QUnit.test("Queue - Remove test", function (assert)
+{
+	var queue = new ds.Queue();
+	queue.enqueue(0);
+	queue.enqueue(2);
+	queue.enqueue(4);
+	queue.enqueue(5);
+	queue.enqueue(8);
+	queue.remove(2, 2);
+	assert.deepEqual(queue.multiDequeue(3), [0, 2, 8], "Remove from position 2 for 2");
+});
+
+QUnit.test("Queue - Iterator test", function (assert)
+{
+	var queue = new ds.Queue();
+	for (var i = 0; i < 10; i++)
+		queue.enqueue(i);
+	var j = 0;
+	var it = queue.getIterator();
+	for (it.first(); !it.isDone(); it.next(), j++)
+		assert.deepEqual(it.getItem(), j, "Get next item " + j);
+	j--;
+	for (it.last(); !it.isDone(); it.previous(), j--)
+		assert.deepEqual(it.getItem(), j, "Get previous item " + j);
+});
+
+QUnit.test("Queue - Get length test", function (assert)
+{
+	var queue = new ds.Queue();
+	assert.deepEqual(queue.getLength(), 0, "Length 0");
+	queue.enqueue(0);
+	assert.deepEqual(queue.getLength(), 1, "Length 1");
+	queue.enqueue(2);
+	assert.deepEqual(queue.getLength(), 2, "Length 2");
+	queue.dequeue();
+	queue.dequeue();
+	assert.deepEqual(queue.getLength(), 0, "Length 0");
+
+});
+
+QUnit.test("Queue - Peek test", function (assert)
+{
+	var queue = new ds.Queue();
+	queue.enqueue(0);
+	assert.deepEqual(queue.peek(), 0, "Peek 0");
+	queue.enqueue(2);
+	assert.deepEqual(queue.peek(), 0, "Peek 0");
+});
+
+QUnit.test("Queue - Clear test", function (assert)
+{
+	var queue = new ds.Queue();
+	queue.enqueue(0);
+	queue.enqueue(2);
+	queue.clear();
+	assert.deepEqual(queue.isEmpty(), true, "Clear queue");
+});
+
+QUnit.test("Queue - Is empty test", function (assert)
+{
+	var queue = new ds.Queue();
+	queue.enqueue(0);
+	queue.enqueue(2);
+	assert.deepEqual(queue.isEmpty(), false, "Is not empty");
+	queue.clear();
+	assert.deepEqual(queue.isEmpty(), true, "Is empty");
+});
+
+QUnit.test("Queue - Contains test", function (assert)
+{
+	var queue = new ds.Queue();
+	queue.enqueue(0);
+	queue.enqueue(2);
+	assert.deepEqual(queue.contains(0), true, "Contains 0");
+	assert.deepEqual(queue.contains(2), true, "Contains 2");
+	assert.deepEqual(queue.contains(1), false, "Not contains 1");
+	var callback = function (item)
+	{
+		return item > 0;
+	};
+	assert.deepEqual(queue.contains(null, callback), true, "Contains a value > 0");
+	callback = function (item)
+	{
+		return item < 0;
+	};
+	assert.deepEqual(queue.contains(null, callback), false, "Contains a value < 0");
+});
+
+QUnit.test("Queue - Execute test", function (assert)
+{
+	var queue = new ds.Queue();
+	queue.enqueue(0);
+	queue.enqueue(2);
+	var callback = function (item)
+	{
+		return item * 2;
+	};
+	queue.execute(callback);
+	assert.deepEqual(queue.getItem(0), 0, "Execute for item 0");
+	assert.deepEqual(queue.getItem(1), 4, "Execute for item 1");
+});
+
+QUnit.test("Queue - Index of test", function (assert)
+{
+	var queue = new ds.Queue();
+	for (var i = 0; i < 10; i++)
+		queue.enqueue(i);
+	var callback = function (item)
+	{
+		return !(item % 2) && item > 5;
+	};
+	assert.deepEqual(queue.indexOf(0), 0, "Index of 0");
+	assert.deepEqual(queue.indexOf(15), -1, "Index of 15");
+	assert.deepEqual(queue.indexOf(5), 5, "Index of 5");
+	assert.deepEqual(queue.indexOf(null, callback), 6, "Index of the first even number greater than 5");
+});
+
+QUnit.test("Queue - Last index of test", function (assert)
+{
+	var queue = new ds.Queue();
+	for (var i = 0; i < 10; i++)
+		queue.enqueue(i);
+	var callback = function (item)
+	{
+		return !(item % 2) && item > 5;
+	};
+	assert.deepEqual(queue.lastIndexOf(0), 0, "Last index of 0");
+	assert.deepEqual(queue.lastIndexOf(15), -1, "Last index of 15");
+	assert.deepEqual(queue.lastIndexOf(5), 5, "Last index of 5");
+	assert.deepEqual(queue.lastIndexOf(null, callback), 8, "Index of the last even number greater than 5");
+});
+
+QUnit.test("Queue - Indexes of test", function (assert)
+{
+	var queue = new ds.Queue();
+	for (var i = 0; i < 30; i++)
+		queue.enqueue(i % 10);
+	var callback = function (item)
+	{
+		return !(item % 2) && item > 5;
+	};
+	assert.deepEqual(queue.allIndexesOf(0), [0, 10, 20], "Indexes of 0");
+	assert.deepEqual(queue.allIndexesOf(15), [], "Indexes of 15");
+	assert.deepEqual(queue.allIndexesOf(5), [5, 15, 25], "Indexes of 5");
+	assert.deepEqual(queue.allIndexesOf(null, callback), [6, 8, 16, 18, 26, 28], "Indexes of the even numbers greater than 5");
+});
+
+QUnit.test("Queue - Clone test", function (assert)
+{
+	var queue = new ds.Queue();
+	for (var i = 0; i < 10; i++)
+		queue.enqueue(i);
+	var clone = queue.clone();
+	var it = clone.getIterator();
+	var j = 0;
+	for (it.first(); !it.isDone(); it.next(), j++)
+		assert.deepEqual(it.getItem(), j, "Clone of the queue");
+});
+
+QUnit.test("Queue - Clone distinct test", function (assert)
+{
+	var queue = new ds.Queue();
+	for (var i = 0; i < 20; i++)
+		queue.enqueue(i % 10);
+	var clone = queue.cloneDistinct();
+	assert.deepEqual(clone.allIndexesOf(2), [2], "Clone of the queue");
+});
+
+QUnit.test("Queue - Filter test", function (assert)
+{
+	var queue = new ds.Queue<number>();
+	const length = 100;
+
+	for (var i = 0; i < length; i++)
+		queue.enqueue(i);
+
+	var result = queue.filter(function (item)
+	{
+		return Boolean(1 - item % 2);
+	});
+
+	assert.deepEqual(result[0], 0, "Filter of the even values");
+	assert.deepEqual(result[result.length - 1], 98, "Filter on the even values");
+});
\ No newline at end of file
diff --git a/Tests/RBTreeList_Test.js b/Tests/RBTreeList_Test.js
deleted file mode 100644
index f1f96ea..0000000
--- a/Tests/RBTreeList_Test.js
+++ /dev/null
@@ -1,207 +0,0 @@
-/**
- * Created by Stefano on 06/04/14.
- */
-
-test("RBTreeList - Insert test", function () {
-	var tree = new RBTreeList();
-	var keys = [];
-	for (var i = 0; i < 20; i++) {
-		keys.push(Math.random());
-		tree.insert(keys[i], i);
-	}
-	for (var j = 0; j < 20; j++)
-		deepEqual(tree.search(keys[j]), j, "Insert node");
-});
-
-test("RBTreeList - Minimum test", function () {
-	var tree = new RBTreeList();
-	var keys = [];
-	var min = 10;
-	for (var i = 0; i < 20; i++) {
-		keys.push(Math.random());
-		tree.insert(keys[i], i);
-		if (keys[i] < min)
-			min = keys[i];
-	}
-	deepEqual(tree.minimum().item, tree.search(min), "Minimum");
-});
-
-test("RBTreeList - Maximum test", function () {
-	var tree = new RBTreeList();
-	var keys = [];
-	var max = -1;
-	for (var i = 0; i < 20; i++) {
-		keys.push(Math.random());
-		tree.insert(keys[i], i);
-		if (keys[i] > max)
-			max = keys[i];
-	}
-	deepEqual(tree.maximum().item, tree.search(max), "Maximum");
-});
-
-test("RBTreeList - Successor test", function () {
-	var tree = new RBTreeList();
-	for (var i = 0; i < 20; i++)
-		tree.insert(i, i);
-	var it = tree.getIterator();
-	var j = 1;
-	for (it.first(); !it.isDone(); it.next(), j++) {
-		var successor = tree.successor(it.getNode());
-		if (successor)
-			deepEqual(successor.item, j, "Successor");
-		else
-			deepEqual(successor, null, "No successor");
-	}
-});
-
-test("RBTreeList - Predecessor test", function () {
-	var tree = new RBTreeList();
-	for (var i = 0; i < 20; i++)
-		tree.insert(i, i);
-	var it = tree.getIterator();
-	var j = 18;
-	for (it.last(); !it.isDone(); it.previous(), j--) {
-		var predecessor = tree.predecessor(it.getNode());
-		if (predecessor)
-			deepEqual(predecessor.item, j, "Predecessor");
-		else
-			deepEqual(predecessor, null, "No predecessor");
-	}
-});
-
-test("RBTreeList - Delete node test", function () {
-	var tree = new RBTreeList();
-	for (var i = 0; i < 20; i++)
-		tree.insert(i, i);
-	var j = 0;
-	while (tree.minimum()) {
-		deepEqual(tree.minimum().item, j, "Deletion");
-		tree.deleteNode(tree.minimum());
-		j++;
-	}
-});
-
-test("RBTreeList - To array test", function () {
-	var tree = new RBTreeList();
-	for (var i = 0; i < 5; i++)
-		tree.insert(i, i);
-	deepEqual(tree.toArray(), [0, 1, 2, 3, 4], "To array");
-});
-
-test("RBTreeList - Filter test", function () {
-	var tree = new RBTreeList();
-
-	for (var i = 0; i < 100; i++)
-		tree.insert(i, i);
-
-	var result = tree.filter(function (item) {
-		return 1 - item % 2;
-	});
-
-	deepEqual(result[0], 0, "Filter of the even values");
-	deepEqual(result[result.length - 1], 98, "Filter on the even values");
-});
-
-test("RBTreeList - Clear test", function () {
-	var tree = new RBTreeList();
-	tree.insert(0, 0);
-	tree.insert(2, 2);
-	tree.clear();
-	deepEqual(tree.isEmpty(), true, "Clear tree");
-});
-
-test("RBTreeList - Is empty test", function () {
-	var tree = new RBTreeList();
-	tree.insert(0, 0);
-	tree.insert(2, 2);
-	deepEqual(tree.isEmpty(), false, "Is not empty");
-	tree.clear();
-	deepEqual(tree.isEmpty(), true, "Is empty");
-});
-
-test("RBTreeList - Contains test", function () {
-	var tree = new RBTreeList();
-	tree.insert(0, 0);
-	tree.insert(2, 2);
-	deepEqual(tree.contains(0), true, "Contains 0");
-	deepEqual(tree.contains(2), true, "Contains 2");
-	deepEqual(tree.contains(1), false, "Not contains 1");
-	var callback = function (item) {
-		return item > 0;
-	};
-	deepEqual(tree.fullContains(callback), true, "Contains a value > 0");
-	callback = function (item) {
-		return item < 0;
-	};
-	deepEqual(tree.fullContains(callback), false, "Contains a value < 0");
-});
-
-test("RBTreeList - Execute test", function () {
-	var tree = new RBTreeList();
-	tree.insert(0, 0);
-	tree.insert(2, 2);
-	var callback = function (item) {
-		return item * 2;
-	};
-	tree.execute(callback);
-	deepEqual(tree.search(0), 0, "Execute for key 0");
-	deepEqual(tree.search(2), 4, "Execute for key 1");
-});
-
-test("RBTreeList - Index of test", function () {
-	var tree = new RBTreeList();
-	for (var i = 0; i < 10; i++)
-		tree.insert(i, i);
-	var callback = function (item) {
-		return !(item % 2) && item > 5;
-	};
-	deepEqual(tree.indexOf(0), 0, "Index of 0");
-	deepEqual(tree.indexOf(15), -1, "Index of 15");
-	deepEqual(tree.indexOf(5), 5, "Index of 5");
-	deepEqual(tree.indexOf(null, callback), 6, "Index of the first even number greater than 5");
-});
-
-test("RBTreeList - Last index of test", function () {
-	var tree = new RBTreeList();
-	for (var i = 0; i < 10; i++)
-		tree.insert(i, i);
-	var callback = function (item) {
-		return !(item % 2) && item > 5;
-	};
-	deepEqual(tree.lastIndexOf(0), 0, "Last index of 0");
-	deepEqual(tree.lastIndexOf(15), -1, "Last index of 15");
-	deepEqual(tree.lastIndexOf(5), 5, "Last index of 5");
-	deepEqual(tree.lastIndexOf(null, callback), 8, "Index of the last even number greater than 5");
-});
-
-test("RBTreeList - Indexes of test", function () {
-	var tree = new RBTreeList();
-	for (var i = 0; i < 30; i++)
-		tree.insert(i, i % 10);
-	var callback = function (item) {
-		return !(item % 2) && item > 5;
-	};
-	deepEqual(tree.allIndexesOf(0), [0, 10, 20], "Indexes of 0");
-	deepEqual(tree.allIndexesOf(15), [], "Indexes of 15");
-	deepEqual(tree.allIndexesOf(5), [5, 15, 25], "Indexes of 5");
-	deepEqual(tree.allIndexesOf(null, callback), [6, 8, 16, 18, 26, 28], "Indexes of the even numbers greater than 5");
-});
-
-test("RBTreeList - Clone test", function () {
-	var tree = new RBTreeList();
-	for (var i = 0; i < 10; i++)
-		tree.insert(i, i);
-	var clone = tree.clone();
-	var it = clone.getIterator();
-	var j = 0;
-	for (it.first(); !it.isDone(); it.next(), j++)
-		deepEqual(it.getItem(), j, "Clone of the tree");
-});
-
-test("RBTreeList - Clone distinct test", function () {
-	var tree = new RBTreeList();
-	for (var i = 0; i < 20; i++)
-		tree.insert(i % 10, i % 10);
-	var clone = tree.cloneDistinct();
-	deepEqual(clone.allIndexesOf(2), [2], "Clone of the tree");
-});
\ No newline at end of file
diff --git a/Tests/RBTreeList_Test.ts b/Tests/RBTreeList_Test.ts
new file mode 100644
index 0000000..9feb082
--- /dev/null
+++ b/Tests/RBTreeList_Test.ts
@@ -0,0 +1,237 @@
+/**
+ * Created by Stefano on 06/04/14.
+ */
+
+QUnit.test("RBTreeList - Insert test", function (assert)
+{
+	var tree = new ds.RBTreeList();
+	var keys = [];
+	for (var i = 0; i < 20; i++)
+	{
+		keys.push(Math.random());
+		tree.insert(keys[i], i);
+	}
+	for (var j = 0; j < 20; j++)
+		assert.deepEqual(tree.search(keys[j]), j, "Insert node");
+});
+
+QUnit.test("RBTreeList - Minimum test", function (assert)
+{
+	var tree = new ds.RBTreeList();
+	var keys = [];
+	var min = 10;
+	for (var i = 0; i < 20; i++)
+	{
+		keys.push(Math.random());
+		tree.insert(keys[i], i);
+		if (keys[i] < min)
+			min = keys[i];
+	}
+	assert.deepEqual(tree.minimum().item, tree.search(min), "Minimum");
+});
+
+QUnit.test("RBTreeList - Maximum test", function (assert)
+{
+	var tree = new ds.RBTreeList();
+	var keys = [];
+	var max = -1;
+	for (var i = 0; i < 20; i++)
+	{
+		keys.push(Math.random());
+		tree.insert(keys[i], i);
+		if (keys[i] > max)
+			max = keys[i];
+	}
+	assert.deepEqual(tree.maximum().item, tree.search(max), "Maximum");
+});
+
+QUnit.test("RBTreeList - Successor test", function (assert)
+{
+	var tree = new ds.RBTreeList();
+	for (var i = 0; i < 20; i++)
+		tree.insert(i, i);
+	var it = tree.getIterator();
+	var j = 1;
+	for (it.first(); !it.isDone(); it.next(), j++)
+	{
+		var successor = tree.successor(it.getNode());
+		if (successor)
+			assert.deepEqual(successor.item, j, "Successor");
+		else
+			assert.deepEqual(successor, null, "No successor");
+	}
+});
+
+QUnit.test("RBTreeList - Predecessor test", function (assert)
+{
+	var tree = new ds.RBTreeList();
+	for (var i = 0; i < 20; i++)
+		tree.insert(i, i);
+	var it = tree.getIterator();
+	var j = 18;
+	for (it.last(); !it.isDone(); it.previous(), j--)
+	{
+		var predecessor = tree.predecessor(it.getNode());
+		if (predecessor)
+			assert.deepEqual(predecessor.item, j, "Predecessor");
+		else
+			assert.deepEqual(predecessor, null, "No predecessor");
+	}
+});
+
+QUnit.test("RBTreeList - Delete node test", function (assert)
+{
+	var tree = new ds.RBTreeList();
+	for (var i = 0; i < 20; i++)
+		tree.insert(i, i);
+	var j = 0;
+	while (tree.minimum())
+	{
+		assert.deepEqual(tree.minimum().item, j, "Deletion");
+		tree.deleteNode(tree.minimum());
+		j++;
+	}
+});
+
+QUnit.test("RBTreeList - To array test", function (assert)
+{
+	var tree = new ds.RBTreeList();
+	for (var i = 0; i < 5; i++)
+		tree.insert(i, i);
+	assert.deepEqual(tree.toArray(), [0, 1, 2, 3, 4], "To array");
+});
+
+QUnit.test("RBTreeList - Filter test", function (assert)
+{
+	var tree = new ds.RBTreeList<number>();
+
+	for (var i = 0; i < 100; i++)
+		tree.insert(i, i);
+
+	var result = tree.filter(function (item)
+	{
+		return Boolean(1 - item % 2);
+	});
+
+	assert.deepEqual(result[0], 0, "Filter of the even values");
+	assert.deepEqual(result[result.length - 1], 98, "Filter on the even values");
+});
+
+QUnit.test("RBTreeList - Clear test", function (assert)
+{
+	var tree = new ds.RBTreeList();
+	tree.insert(0, 0);
+	tree.insert(2, 2);
+	tree.clear();
+	assert.deepEqual(tree.isEmpty(), true, "Clear tree");
+});
+
+QUnit.test("RBTreeList - Is empty test", function (assert)
+{
+	var tree = new ds.RBTreeList();
+	tree.insert(0, 0);
+	tree.insert(2, 2);
+	assert.deepEqual(tree.isEmpty(), false, "Is not empty");
+	tree.clear();
+	assert.deepEqual(tree.isEmpty(), true, "Is empty");
+});
+
+QUnit.test("RBTreeList - Contains test", function (assert)
+{
+	var tree = new ds.RBTreeList();
+	tree.insert(0, 0);
+	tree.insert(2, 2);
+	assert.deepEqual(tree.contains(0), true, "Contains 0");
+	assert.deepEqual(tree.contains(2), true, "Contains 2");
+	assert.deepEqual(tree.contains(1), false, "Not contains 1");
+	var callback = function (item)
+	{
+		return item > 0;
+	};
+	assert.deepEqual(tree.fullContains(callback), true, "Contains a value > 0");
+	callback = function (item)
+	{
+		return item < 0;
+	};
+	assert.deepEqual(tree.fullContains(callback), false, "Contains a value < 0");
+});
+
+QUnit.test("RBTreeList - Execute test", function (assert)
+{
+	var tree = new ds.RBTreeList();
+	tree.insert(0, 0);
+	tree.insert(2, 2);
+	var callback = function (item)
+	{
+		return item * 2;
+	};
+	tree.execute(callback);
+	assert.deepEqual(tree.search(0), 0, "Execute for key 0");
+	assert.deepEqual(tree.search(2), 4, "Execute for key 1");
+});
+
+QUnit.test("RBTreeList - Index of test", function (assert)
+{
+	var tree = new ds.RBTreeList();
+	for (var i = 0; i < 10; i++)
+		tree.insert(i, i);
+	var callback = function (item)
+	{
+		return !(item % 2) && item > 5;
+	};
+	assert.deepEqual(tree.indexOf(0), 0, "Index of 0");
+	assert.deepEqual(tree.indexOf(15), -1, "Index of 15");
+	assert.deepEqual(tree.indexOf(5), 5, "Index of 5");
+	assert.deepEqual(tree.indexOf(null, callback), 6, "Index of the first even number greater than 5");
+});
+
+QUnit.test("RBTreeList - Last index of test", function (assert)
+{
+	var tree = new ds.RBTreeList();
+	for (var i = 0; i < 10; i++)
+		tree.insert(i, i);
+	var callback = function (item)
+	{
+		return !(item % 2) && item > 5;
+	};
+	assert.deepEqual(tree.lastIndexOf(0), 0, "Last index of 0");
+	assert.deepEqual(tree.lastIndexOf(15), -1, "Last index of 15");
+	assert.deepEqual(tree.lastIndexOf(5), 5, "Last index of 5");
+	assert.deepEqual(tree.lastIndexOf(null, callback), 8, "Index of the last even number greater than 5");
+});
+
+QUnit.test("RBTreeList - Indexes of test", function (assert)
+{
+	var tree = new ds.RBTreeList();
+	for (var i = 0; i < 30; i++)
+		tree.insert(i, i % 10);
+	var callback = function (item)
+	{
+		return !(item % 2) && item > 5;
+	};
+	assert.deepEqual(tree.allIndexesOf(0), [0, 10, 20], "Indexes of 0");
+	assert.deepEqual(tree.allIndexesOf(15), [], "Indexes of 15");
+	assert.deepEqual(tree.allIndexesOf(5), [5, 15, 25], "Indexes of 5");
+	assert.deepEqual(tree.allIndexesOf(null, callback), [6, 8, 16, 18, 26, 28], "Indexes of the even numbers greater than 5");
+});
+
+QUnit.test("RBTreeList - Clone test", function (assert)
+{
+	var tree = new ds.RBTreeList();
+	for (var i = 0; i < 10; i++)
+		tree.insert(i, i);
+	var clone = tree.clone();
+	var it = clone.getIterator();
+	var j = 0;
+	for (it.first(); !it.isDone(); it.next(), j++)
+		assert.deepEqual(it.getItem(), j, "Clone of the tree");
+});
+
+QUnit.test("RBTreeList - Clone distinct test", function (assert)
+{
+	var tree = new ds.RBTreeList();
+	for (var i = 0; i < 20; i++)
+		tree.insert(i % 10, i % 10);
+	var clone = tree.cloneDistinct();
+	assert.deepEqual(clone.allIndexesOf(2), [2], "Clone of the tree");
+});
\ No newline at end of file
diff --git a/Tests/RBTree_Test.js b/Tests/RBTree_Test.js
deleted file mode 100644
index 404636c..0000000
--- a/Tests/RBTree_Test.js
+++ /dev/null
@@ -1,211 +0,0 @@
-/**
- * Created by Stefano on 06/04/14.
- */
-
-test("RBTree - Insert test", function () {
-	var tree = new RBTree();
-	var keys = [];
-	for (var i = 0; i < 20; i++) {
-		keys.push(Math.random());
-		tree.insert(keys[i], keys[i]);
-	}
-	for (var j = 0; j < 20; j++)
-		deepEqual(tree.search(keys[j]), keys[j], "Insert node");
-	keys.sort();
-	for (var k = 0; k < 20; k++)
-		deepEqual(tree.getItem(k), keys[k], "Insert node");
-});
-
-test("RBTree - Minimum test", function () {
-	var tree = new RBTree();
-	var keys = [];
-	var min = 10;
-	for (var i = 0; i < 20; i++) {
-		keys.push(Math.random());
-		tree.insert(keys[i], i);
-		if (keys[i] < min)
-			min = keys[i];
-	}
-	deepEqual(tree.minimum().item, tree.search(min), "Minimum");
-});
-
-test("RBTree - Maximum test", function () {
-	var tree = new RBTree();
-	var keys = [];
-	var max = -1;
-	for (var i = 0; i < 20; i++) {
-		keys.push(Math.random());
-		tree.insert(keys[i], i);
-		if (keys[i] > max)
-			max = keys[i];
-	}
-	deepEqual(tree.maximum().item, tree.search(max), "Maximum");
-});
-
-test("RBTree - Successor test", function () {
-	var tree = new RBTree();
-	for (var i = 0; i < 20; i++)
-		tree.insert(i, i);
-	var it = tree.getIterator();
-	var j = 1;
-	for (it.first(); !it.isDone(); it.next(), j++) {
-		var successor = tree.successor(it.getNode());
-		if (successor)
-			deepEqual(successor.item, j, "Successor");
-		else
-			deepEqual(successor, null, "No successor");
-	}
-});
-
-test("RBTree - Predecessor test", function () {
-	var tree = new RBTree();
-	for (var i = 0; i < 20; i++)
-		tree.insert(i, i);
-	var it = tree.getIterator();
-	var j = 18;
-	for (it.last(); !it.isDone(); it.previous(), j--) {
-		var predecessor = tree.predecessor(it.getNode());
-		if (predecessor)
-			deepEqual(predecessor.item, j, "Predecessor");
-		else
-			deepEqual(predecessor, null, "No predecessor");
-	}
-});
-
-test("RBTree - Delete node test", function () {
-	var tree = new RBTree();
-	for (var i = 0; i < 20; i++)
-		tree.insert(i, i);
-	var j = 0;
-	while (tree.minimum()) {
-		deepEqual(tree.minimum().item, j, "Deletion");
-		tree.deleteNode(tree.minimum());
-		j++;
-	}
-});
-
-test("RBTree - To array test", function () {
-	var tree = new RBTree();
-	for (var i = 0; i < 5; i++)
-		tree.insert(i, i);
-	deepEqual(tree.toArray(), [0, 1, 2, 3, 4], "To array");
-});
-
-test("RBTree - Filter test", function () {
-	var tree = new RBTree();
-	const length = 100;
-
-	for (var i = 0; i < length; i++)
-		tree.insert(i, i);
-
-	var result = tree.filter(function (item) {
-		return 1 - item % 2;
-	});
-
-	deepEqual(result[0], 0, "Filter of the even values");
-	deepEqual(result[result.length - 1], 98, "Filter on the even values");
-});
-
-test("RBTree - Clear test", function () {
-	var tree = new RBTreeList();
-	tree.insert(0, 0);
-	tree.insert(2, 2);
-	tree.clear();
-	deepEqual(tree.isEmpty(), true, "Clear tree");
-});
-
-test("RBTree - Is empty test", function () {
-	var tree = new RBTree();
-	tree.insert(0, 0);
-	tree.insert(2, 2);
-	deepEqual(tree.isEmpty(), false, "Is not empty");
-	tree.clear();
-	deepEqual(tree.isEmpty(), true, "Is empty");
-});
-
-test("RBTree - Contains test", function () {
-	var tree = new RBTree();
-	tree.insert(0, 0);
-	tree.insert(2, 2);
-	deepEqual(tree.contains(0), true, "Contains 0");
-	deepEqual(tree.contains(2), true, "Contains 2");
-	deepEqual(tree.contains(1), false, "Not contains 1");
-	var callback = function (item) {
-		return item > 0;
-	};
-	deepEqual(tree.fullContains(callback), true, "Contains a value > 0");
-	callback = function (item) {
-		return item < 0;
-	};
-	deepEqual(tree.fullContains(callback), false, "Contains a value < 0");
-});
-
-test("RBTree - Execute test", function () {
-	var tree = new RBTree();
-	tree.insert(0, 0);
-	tree.insert(2, 2);
-	var callback = function (item) {
-		return item * 2;
-	};
-	tree.execute(callback);
-	deepEqual(tree.search(0), 0, "Execute for key 0");
-	deepEqual(tree.search(2), 4, "Execute for key 1");
-});
-
-test("RBTree - Index of test", function () {
-	var tree = new RBTree();
-	for (var i = 0; i < 10; i++)
-		tree.insert(i, i);
-	var callback = function (item) {
-		return !(item % 2) && item > 5;
-	};
-	deepEqual(tree.indexOf(0), 0, "Index of 0");
-	deepEqual(tree.indexOf(15), -1, "Index of 15");
-	deepEqual(tree.indexOf(5), 5, "Index of 5");
-	deepEqual(tree.indexOf(null, callback), 6, "Index of the first even number greater than 5");
-});
-
-test("RBTree - Last index of test", function () {
-	var tree = new RBTree();
-	for (var i = 0; i < 10; i++)
-		tree.insert(i, i);
-	var callback = function (item) {
-		return !(item % 2) && item > 5;
-	};
-	deepEqual(tree.lastIndexOf(0), 0, "Last index of 0");
-	deepEqual(tree.lastIndexOf(15), -1, "Last index of 15");
-	deepEqual(tree.lastIndexOf(5), 5, "Last index of 5");
-	deepEqual(tree.lastIndexOf(null, callback), 8, "Index of the last even number greater than 5");
-});
-
-test("RBTree - Indexes of test", function () {
-	var tree = new RBTree();
-	for (var i = 0; i < 30; i++)
-		tree.insert(i, i % 10);
-	var callback = function (item) {
-		return !(item % 2) && item > 5;
-	};
-	deepEqual(tree.allIndexesOf(0), [0, 10, 20], "Indexes of 0");
-	deepEqual(tree.allIndexesOf(15), [], "Indexes of 15");
-	deepEqual(tree.allIndexesOf(5), [5, 15, 25], "Indexes of 5");
-	deepEqual(tree.allIndexesOf(null, callback), [6, 8, 16, 18, 26, 28], "Indexes of the even numbers greater than 5");
-});
-
-test("RBTree - Clone test", function () {
-	var tree = new RBTree();
-	for (var i = 0; i < 10; i++)
-		tree.insert(i, i);
-	var clone = tree.clone();
-	var it = clone.getIterator();
-	var j = 0;
-	for (it.first(); !it.isDone(); it.next(), j++)
-		deepEqual(it.getItem(), j, "Clone of the tree");
-});
-
-test("RBTree - Clone distinct test", function () {
-	var tree = new RBTree();
-	for (var i = 0; i < 20; i++)
-		tree.insert(i % 10, i % 10);
-	var clone = tree.cloneDistinct();
-	deepEqual(clone.allIndexesOf(2), [2], "Clone of the tree");
-});
\ No newline at end of file
diff --git a/Tests/RBTree_Test.ts b/Tests/RBTree_Test.ts
new file mode 100644
index 0000000..7f6891a
--- /dev/null
+++ b/Tests/RBTree_Test.ts
@@ -0,0 +1,241 @@
+/**
+ * Created by Stefano on 06/04/14.
+ */
+
+QUnit.test("RBTree - Insert test", function (assert)
+{
+	var tree = new ds.RBTree();
+	var keys = [];
+	for (var i = 0; i < 20; i++)
+	{
+		keys.push(Math.random());
+		tree.insert(keys[i], keys[i]);
+	}
+	for (var j = 0; j < 20; j++)
+		assert.deepEqual(tree.search(keys[j]), keys[j], "Insert node");
+	keys.sort();
+	for (var k = 0; k < 20; k++)
+		assert.deepEqual(tree.getItem(k), keys[k], "Insert node");
+});
+
+QUnit.test("RBTree - Minimum test", function (assert)
+{
+	var tree = new ds.RBTree();
+	var keys = [];
+	var min = 10;
+	for (var i = 0; i < 20; i++)
+	{
+		keys.push(Math.random());
+		tree.insert(keys[i], i);
+		if (keys[i] < min)
+			min = keys[i];
+	}
+	assert.deepEqual(tree.minimum().item, tree.search(min), "Minimum");
+});
+
+QUnit.test("RBTree - Maximum test", function (assert)
+{
+	var tree = new ds.RBTree();
+	var keys = [];
+	var max = -1;
+	for (var i = 0; i < 20; i++)
+	{
+		keys.push(Math.random());
+		tree.insert(keys[i], i);
+		if (keys[i] > max)
+			max = keys[i];
+	}
+	assert.deepEqual(tree.maximum().item, tree.search(max), "Maximum");
+});
+
+QUnit.test("RBTree - Successor test", function (assert)
+{
+	var tree = new ds.RBTree();
+	for (var i = 0; i < 20; i++)
+		tree.insert(i, i);
+	var it = tree.getIterator();
+	var j = 1;
+	for (it.first(); !it.isDone(); it.next(), j++)
+	{
+		var successor = tree.successor(it.getNode());
+		if (successor)
+			assert.deepEqual(successor.item, j, "Successor");
+		else
+			assert.deepEqual(successor, null, "No successor");
+	}
+});
+
+QUnit.test("RBTree - Predecessor test", function (assert)
+{
+	var tree = new ds.RBTree();
+	for (var i = 0; i < 20; i++)
+		tree.insert(i, i);
+	var it = tree.getIterator();
+	var j = 18;
+	for (it.last(); !it.isDone(); it.previous(), j--)
+	{
+		var predecessor = tree.predecessor(it.getNode());
+		if (predecessor)
+			assert.deepEqual(predecessor.item, j, "Predecessor");
+		else
+			assert.deepEqual(predecessor, null, "No predecessor");
+	}
+});
+
+QUnit.test("RBTree - Delete node test", function (assert)
+{
+	var tree = new ds.RBTree();
+	for (var i = 0; i < 20; i++)
+		tree.insert(i, i);
+	var j = 0;
+	while (tree.minimum())
+	{
+		assert.deepEqual(tree.minimum().item, j, "Deletion");
+		tree.deleteNode(tree.minimum());
+		j++;
+	}
+});
+
+QUnit.test("RBTree - To array test", function (assert)
+{
+	var tree = new ds.RBTree();
+	for (var i = 0; i < 5; i++)
+		tree.insert(i, i);
+	assert.deepEqual(tree.toArray(), [0, 1, 2, 3, 4], "To array");
+});
+
+QUnit.test("RBTree - Filter test", function (assert)
+{
+	var tree = new ds.RBTree<number>();
+	const length = 100;
+
+	for (var i = 0; i < length; i++)
+		tree.insert(i, i);
+
+	var result = tree.filter(function (item)
+	{
+		return Boolean(1 - item % 2);
+	});
+
+	assert.deepEqual(result[0], 0, "Filter of the even values");
+	assert.deepEqual(result[result.length - 1], 98, "Filter on the even values");
+});
+
+QUnit.test("RBTree - Clear test", function (assert)
+{
+	var tree = new ds.RBTreeList();
+	tree.insert(0, 0);
+	tree.insert(2, 2);
+	tree.clear();
+	assert.deepEqual(tree.isEmpty(), true, "Clear tree");
+});
+
+QUnit.test("RBTree - Is empty test", function (assert)
+{
+	var tree = new ds.RBTree();
+	tree.insert(0, 0);
+	tree.insert(2, 2);
+	assert.deepEqual(tree.isEmpty(), false, "Is not empty");
+	tree.clear();
+	assert.deepEqual(tree.isEmpty(), true, "Is empty");
+});
+
+QUnit.test("RBTree - Contains test", function (assert)
+{
+	var tree = new ds.RBTree();
+	tree.insert(0, 0);
+	tree.insert(2, 2);
+	assert.deepEqual(tree.contains(0), true, "Contains 0");
+	assert.deepEqual(tree.contains(2), true, "Contains 2");
+	assert.deepEqual(tree.contains(1), false, "Not contains 1");
+	var callback = function (item)
+	{
+		return item > 0;
+	};
+	assert.deepEqual(tree.fullContains(callback), true, "Contains a value > 0");
+	callback = function (item)
+	{
+		return item < 0;
+	};
+	assert.deepEqual(tree.fullContains(callback), false, "Contains a value < 0");
+});
+
+QUnit.test("RBTree - Execute test", function (assert)
+{
+	var tree = new ds.RBTree();
+	tree.insert(0, 0);
+	tree.insert(2, 2);
+	var callback = function (item)
+	{
+		return item * 2;
+	};
+	tree.execute(callback);
+	assert.deepEqual(tree.search(0), 0, "Execute for key 0");
+	assert.deepEqual(tree.search(2), 4, "Execute for key 1");
+});
+
+QUnit.test("RBTree - Index of test", function (assert)
+{
+	var tree = new ds.RBTree();
+	for (var i = 0; i < 10; i++)
+		tree.insert(i, i);
+	var callback = function (item)
+	{
+		return !(item % 2) && item > 5;
+	};
+	assert.deepEqual(tree.indexOf(0), 0, "Index of 0");
+	assert.deepEqual(tree.indexOf(15), -1, "Index of 15");
+	assert.deepEqual(tree.indexOf(5), 5, "Index of 5");
+	assert.deepEqual(tree.indexOf(null, callback), 6, "Index of the first even number greater than 5");
+});
+
+QUnit.test("RBTree - Last index of test", function (assert)
+{
+	var tree = new ds.RBTree();
+	for (var i = 0; i < 10; i++)
+		tree.insert(i, i);
+	var callback = function (item)
+	{
+		return !(item % 2) && item > 5;
+	};
+	assert.deepEqual(tree.lastIndexOf(0), 0, "Last index of 0");
+	assert.deepEqual(tree.lastIndexOf(15), -1, "Last index of 15");
+	assert.deepEqual(tree.lastIndexOf(5), 5, "Last index of 5");
+	assert.deepEqual(tree.lastIndexOf(null, callback), 8, "Index of the last even number greater than 5");
+});
+
+QUnit.test("RBTree - Indexes of test", function (assert)
+{
+	var tree = new ds.RBTree();
+	for (var i = 0; i < 30; i++)
+		tree.insert(i, i % 10);
+	var callback = function (item)
+	{
+		return !(item % 2) && item > 5;
+	};
+	assert.deepEqual(tree.allIndexesOf(0), [0, 10, 20], "Indexes of 0");
+	assert.deepEqual(tree.allIndexesOf(15), [], "Indexes of 15");
+	assert.deepEqual(tree.allIndexesOf(5), [5, 15, 25], "Indexes of 5");
+	assert.deepEqual(tree.allIndexesOf(null, callback), [6, 8, 16, 18, 26, 28], "Indexes of the even numbers greater than 5");
+});
+
+QUnit.test("RBTree - Clone test", function (assert)
+{
+	var tree = new ds.RBTree();
+	for (var i = 0; i < 10; i++)
+		tree.insert(i, i);
+	var clone = tree.clone();
+	var it = clone.getIterator();
+	var j = 0;
+	for (it.first(); !it.isDone(); it.next(), j++)
+		assert.deepEqual(it.getItem(), j, "Clone of the tree");
+});
+
+QUnit.test("RBTree - Clone distinct test", function (assert)
+{
+	var tree = new ds.RBTree();
+	for (var i = 0; i < 20; i++)
+		tree.insert(i % 10, i % 10);
+	var clone = tree.cloneDistinct();
+	assert.deepEqual(clone.allIndexesOf(2), [2], "Clone of the tree");
+});
\ No newline at end of file
diff --git a/Tests/Range_Test.js b/Tests/Range_Test.js
deleted file mode 100644
index fc201ff..0000000
--- a/Tests/Range_Test.js
+++ /dev/null
@@ -1,31 +0,0 @@
-/**
- * Created by Stefano on 06/04/14.
- */
-
-test("Range - Create linear test", function () {
-    var range = Range(0, 5);
-    for (var j = 0; j < range.length; j++) {
-        deepEqual(range[j], j, "Check range values");
-    }
-});
-
-test("Range - Create inverse test", function () {
-    var range = Range(5, 0, -1);
-    for (var j = 0; j < range.length; j++) {
-        deepEqual(range[j], 5 - j, "Check range values");
-    }
-});
-
-test("Range - Create step test", function () {
-    var range = Range(0, 15, 4);
-    for (var j = 0; j < range.length; j++) {
-        deepEqual(range[j], j * 4, "Check range values");
-    }
-});
-
-test("Range - Create inverse step test", function () {
-    var range = Range(15, 4, -2);
-    for (var j = 0; j < range.length; j++) {
-        deepEqual(range[j], 15 - j * 2, "Check range values");
-    }
-});
\ No newline at end of file
diff --git a/Tests/Range_Test.ts b/Tests/Range_Test.ts
new file mode 100644
index 0000000..6a3dbc6
--- /dev/null
+++ b/Tests/Range_Test.ts
@@ -0,0 +1,39 @@
+/**
+ * Created by Stefano on 06/04/14.
+ */
+
+QUnit.test("Range - Create linear test", function (assert)
+{
+    var range = ds.Range(0, 5);
+    for (var j = 0; j < range.length; j++)
+    {
+        assert.deepEqual(range[j], j, "Check range values");
+    }
+});
+
+QUnit.test("Range - Create inverse test", function (assert)
+{
+    var range = ds.Range(5, 0, -1);
+    for (var j = 0; j < range.length; j++)
+    {
+        assert.deepEqual(range[j], 5 - j, "Check range values");
+    }
+});
+
+QUnit.test("Range - Create step test", function (assert)
+{
+    var range = ds.Range(0, 15, 4);
+    for (var j = 0; j < range.length; j++)
+    {
+        assert.deepEqual(range[j], j * 4, "Check range values");
+    }
+});
+
+QUnit.test("Range - Create inverse step test", function (assert)
+{
+    var range = ds.Range(15, 4, -2);
+    for (var j = 0; j < range.length; j++)
+    {
+        assert.deepEqual(range[j], 15 - j * 2, "Check range values");
+    }
+});
\ No newline at end of file
diff --git a/Tests/Set_Test.js b/Tests/Set_Test.js
deleted file mode 100644
index 5720f03..0000000
--- a/Tests/Set_Test.js
+++ /dev/null
@@ -1,104 +0,0 @@
-/**
- * Created by Stefano on 06/04/14.
- */
-
-test("Set - Insert test", function () {
-	var setA = new Set();
-	var e0 = new Element(0);
-	var e1 = new Element(1);
-	setA.multiInsert([e0, e1]);
-	deepEqual(setA.getItems(), [0, 1], "Insert elements");
-	deepEqual(setA.getCardinality(), 2, "Insert elements");
-});
-
-test("Set - Union test", function () {
-	var setA = new Set();
-	var setB = new Set();
-	var e0 = new Element(0);
-	var e1 = new Element(1);
-	var e2 = new Element(2);
-	var e3 = new Element(3);
-	setA.multiInsert([e0, e1]);
-	setA.multiInsert([e2, e3]);
-	var union = setA.union(setB);
-	deepEqual(setA.parents.contains(union), true, "Union of sets");
-	deepEqual(setB.parents.contains(union), true, "Union of sets");
-	deepEqual(union.getCardinality(), 4, "Union of sets");
-});
-
-test("Set - Intersection test", function () {
-	var setA = new Set();
-	var setB = new Set();
-	var e = [];
-	for (var i = 0; i < 6; i++) {
-		e.push(new Element(i));
-		if (i < 4)
-			setA.insert(e[i]);
-		if (i > 1)
-			setB.insert(e[i]);
-	}
-	var intersection = setA.intersect(setB);
-	for (var k = 0; k < 2; k++)
-		deepEqual(intersection.elements.getItem(k).item, k + 2, "Intersection of sets");
-	deepEqual(intersection.getCardinality(), 2, "Intersection of sets");
-});
-
-test("Set - Difference test", function () {
-	var setA = new Set();
-	var setB = new Set();
-	var e = [];
-	for (var i = 0; i < 6; i++) {
-		e.push(new Element(i));
-		if (i < 4)
-			setA.insert(e[i]);
-		if (i > 1)
-			setB.insert(e[i]);
-	}
-	var diffA = setA.difference(setB);
-	var diffB = setB.difference(setA);
-	for (var j = 0; j < 2; j++)
-		deepEqual(diffA.elements.getItem(j).item, j, "Difference of sets");
-	deepEqual(diffA.getCardinality(), 2, "Difference of sets");
-	for (var k = 0; k < 2; k++)
-		deepEqual(diffB.elements.getItem(k).item, k + 4, "Difference of sets");
-	deepEqual(diffB.getCardinality(), 2, "Difference of sets");
-});
-
-test("Set - Cartesian product test", function () {
-	var setA = new Set();
-	var setB = new Set();
-	var e = [];
-	for (var i = 0; i < 6; i++) {
-		e.push(new Element(i));
-		if (i < 3)
-			setA.insert(e[i]);
-		if (i > 2)
-			setB.insert(e[i]);
-	}
-	var productA = setA.cartesianProduct(setB);
-	var productB = setB.cartesianProduct(setA);
-	deepEqual(productA.getItems(), [
-		[0, 3],
-		[0, 4],
-		[0, 5],
-		[1, 3],
-		[1, 4],
-		[1, 5],
-		[2, 3],
-		[2, 4],
-		[2, 5]
-	], "Cartesian product of sets");
-	deepEqual(productA.getCardinality(), 9, "Cartesian product of sets");
-	deepEqual(productB.getItems(), [
-		[3, 0],
-		[3, 1],
-		[3, 2],
-		[4, 0],
-		[4, 1],
-		[4, 2],
-		[5, 0],
-		[5, 1],
-		[5, 2]
-	], "Cartesian product of sets");
-	deepEqual(productB.getCardinality(), 9, "Cartesian product of sets");
-});
\ No newline at end of file
diff --git a/Tests/Set_Test.ts b/Tests/Set_Test.ts
new file mode 100644
index 0000000..1316e84
--- /dev/null
+++ b/Tests/Set_Test.ts
@@ -0,0 +1,112 @@
+/**
+ * Created by Stefano on 06/04/14.
+ */
+
+QUnit.test("Set - Insert test", function (assert)
+{
+	var setA = new ds.Set();
+	var e0 = new ds.Element(0);
+	var e1 = new ds.Element(1);
+	setA.multiInsert([e0, e1]);
+	assert.deepEqual(setA.getItems(), [0, 1], "Insert elements");
+	assert.deepEqual(setA.getCardinality(), 2, "Insert elements");
+});
+
+QUnit.test("Set - Union test", function (assert)
+{
+	var setA = new ds.Set();
+	var setB = new ds.Set();
+	var e0 = new ds.Element(0);
+	var e1 = new ds.Element(1);
+	var e2 = new ds.Element(2);
+	var e3 = new ds.Element(3);
+	setA.multiInsert([e0, e1]);
+	setA.multiInsert([e2, e3]);
+	var union = setA.union(setB);
+	assert.deepEqual(setA.parents.contains(union), true, "Union of sets");
+	assert.deepEqual(setB.parents.contains(union), true, "Union of sets");
+	assert.deepEqual(union.getCardinality(), 4, "Union of sets");
+});
+
+QUnit.test("Set - Intersection test", function (assert)
+{
+	var setA = new ds.Set();
+	var setB = new ds.Set();
+	var e = [];
+	for (var i = 0; i < 6; i++)
+	{
+		e.push(new ds.Element(i));
+		if (i < 4)
+			setA.insert(e[i]);
+		if (i > 1)
+			setB.insert(e[i]);
+	}
+	var intersection = setA.intersect(setB);
+	for (var k = 0; k < 2; k++)
+		assert.deepEqual(intersection.elements.getItem(k).item, k + 2, "Intersection of sets");
+	assert.deepEqual(intersection.getCardinality(), 2, "Intersection of sets");
+});
+
+QUnit.test("Set - Difference test", function (assert)
+{
+	var setA = new ds.Set();
+	var setB = new ds.Set();
+	var e = [];
+	for (var i = 0; i < 6; i++)
+	{
+		e.push(new ds.Element(i));
+		if (i < 4)
+			setA.insert(e[i]);
+		if (i > 1)
+			setB.insert(e[i]);
+	}
+	var diffA = setA.difference(setB);
+	var diffB = setB.difference(setA);
+	for (var j = 0; j < 2; j++)
+		assert.deepEqual(diffA.elements.getItem(j).item, j, "Difference of sets");
+	assert.deepEqual(diffA.getCardinality(), 2, "Difference of sets");
+	for (var k = 0; k < 2; k++)
+		assert.deepEqual(diffB.elements.getItem(k).item, k + 4, "Difference of sets");
+	assert.deepEqual(diffB.getCardinality(), 2, "Difference of sets");
+});
+
+QUnit.test("Set - Cartesian product test", function (assert)
+{
+	var setA = new ds.Set();
+	var setB = new ds.Set();
+	var e = [];
+	for (var i = 0; i < 6; i++)
+	{
+		e.push(new ds.Element(i));
+		if (i < 3)
+			setA.insert(e[i]);
+		if (i > 2)
+			setB.insert(e[i]);
+	}
+	var productA = setA.cartesianProduct(setB);
+	var productB = setB.cartesianProduct(setA);
+	assert.deepEqual(productA.getItems(), [
+		[0, 3],
+		[0, 4],
+		[0, 5],
+		[1, 3],
+		[1, 4],
+		[1, 5],
+		[2, 3],
+		[2, 4],
+		[2, 5]
+	], "Cartesian product of sets");
+	assert.deepEqual(productA.getCardinality(), 9, "Cartesian product of sets");
+	assert.deepEqual(productB.getItems(), [
+		[3, 0],
+		[3, 1],
+		[3, 2],
+		[4, 0],
+		[4, 1],
+		[4, 2],
+		[5, 0],
+		[5, 1],
+		[5, 2]
+	], "Cartesian product of sets");
+	assert.deepEqual(productB.getCardinality(), 9, "Cartesian product of sets");
+});
\ No newline at end of file
diff --git a/Tests/Stack_Test.js b/Tests/Stack_Test.js
deleted file mode 100644
index 57cae5d..0000000
--- a/Tests/Stack_Test.js
+++ /dev/null
@@ -1,198 +0,0 @@
-/**
- * Created by Battistella Stefano on 31/03/14.
- */
-
-test("Stack - Init test", function () {
-    var stack = new Stack(0, 2, 4, 6);
-    deepEqual(stack.multiPop(4), [6, 4, 2, 0], "Initializing");
-    stack = new Stack(0);
-    deepEqual(stack.multiPop(4), [0], "Initializing");
-});
-
-test("Stack - Init range test", function () {
-    var stack = new Stack(Range(0, 6, 2));
-    deepEqual(stack.multiPop(4), [6, 4, 2, 0], "Initializing");
-});
-
-test("Stack - Push test", function () {
-    var stack = new Stack();
-    stack.push(0);
-    deepEqual(stack.getItem(0), 0, "Push 0");
-    stack.push(2);
-    deepEqual(stack.getItem(0), 2, "Push 2");
-    deepEqual(stack.getItem(1), 0, "Push 2");
-});
-
-test("Stack - Pop test", function () {
-    var stack = new Stack();
-    stack.push(0);
-    stack.push(2);
-    deepEqual(stack.pop(), 2, "Pop");
-    deepEqual(stack.pop(), 0, "Check length");
-    deepEqual(stack.pop(), undefined, "Check length if too much pop");
-});
-
-test("Stack - MultiPop test", function () {
-    var stack = new Stack();
-    stack.push(0);
-    stack.push(2);
-    deepEqual(stack.multiPop(1), [2], "MultiPop 1 time");
-    stack.push(4);
-    stack.push(5);
-    stack.push(8);
-    deepEqual(stack.multiPop(7), [8, 5, 4, 0], "MultiPop 7 times");
-    deepEqual(stack.multiPop(1), [], "MultiPop 1 time with stack empty");
-});
-
-test("Stack - Iterator test", function () {
-    var stack = new Stack();
-    for (var i = 0; i < 10; i++)
-        stack.push(i);
-    var j = 9;
-    var it = stack.getIterator();
-    for (it.first(); !it.isDone(); it.next(), j--)
-        deepEqual(it.getItem(), j, "Get next item " + (10 - j));
-    j++;
-    for (it.last(); !it.isDone(); it.previous(), j++)
-        deepEqual(it.getItem(), j, "Get previous item " + (10 - j));
-});
-
-test("Stack - Get length test", function () {
-    var stack = new Stack();
-    deepEqual(stack.getLength(), 0, "Length 0");
-    stack.push(0);
-    deepEqual(stack.getLength(), 1, "Length 1");
-    stack.push(2);
-    deepEqual(stack.getLength(), 2, "Length 2");
-    stack.pop();
-    stack.pop();
-    deepEqual(stack.getLength(), 0, "Length 0");
-
-});
-
-test("Stack - Peek test", function () {
-    var stack = new Stack();
-    stack.push(0);
-    deepEqual(stack.peek(), 0, "Peek 0");
-    stack.push(2);
-    deepEqual(stack.peek(), 2, "Peek 2");
-});
-
-test("Stack - Clear test", function () {
-    var stack = new Stack();
-    stack.push(0);
-    stack.push(2);
-    stack.clear();
-    deepEqual(stack.isEmpty(), true, "Clear stack");
-});
-
-test("Stack - Is empty test", function () {
-    var stack = new Stack();
-    stack.push(0);
-    stack.push(2);
-    deepEqual(stack.isEmpty(), false, "Is empty");
-    stack.clear();
-    deepEqual(stack.isEmpty(), true, "Is empty");
-});
-
-test("Stack - contains", function () {
-    var stack = new Stack();
-    stack.push(0);
-    stack.push(2);
-    deepEqual(stack.contains(0), true, "Contains 0");
-    deepEqual(stack.contains(2), true, "Contains 2");
-    deepEqual(stack.contains(1), false, "Not contains 1");
-    var callback = function (item) {
-        return item > 0;
-    };
-    deepEqual(stack.contains(null, callback), true, "Contains a value > 0");
-    callback = function (item) {
-        return item < 0;
-    };
-    deepEqual(stack.contains(null, callback), false, "Contains a value < 0");
-});
-
-test("Stack - execute", function () {
-    var stack = new Stack();
-    stack.push(0);
-    stack.push(2);
-    var callback = function (item) {
-        return item * 2;
-    };
-    stack.execute(callback);
-    deepEqual(stack.getItem(0), 4, "Execute for item 1");
-    deepEqual(stack.getItem(1), 0, "Execute for item 0");
-});
-
-test("Stack - Index of test", function () {
-    var stack = new Stack();
-    for (var i = 0; i < 10; i++)
-        stack.push(i);
-    var callback = function (item) {
-        return !(item % 2) && item > 5;
-    };
-    deepEqual(stack.indexOf(0), 0, "Index of 0");
-    deepEqual(stack.indexOf(15), -1, "Index of 15");
-    deepEqual(stack.indexOf(5), 5, "Index of 5");
-    deepEqual(stack.indexOf(null, callback), 8, "Index of the first even number greater than 5");
-});
-
-test("Stack - Last index of test", function () {
-    var stack = new Stack();
-    for (var i = 0; i < 10; i++)
-        stack.push(i);
-    var callback = function (item) {
-        return !(item % 2) && item > 5;
-    };
-    deepEqual(stack.lastIndexOf(0), 0, "Last index of 0");
-    deepEqual(stack.lastIndexOf(15), -1, "Last index of 15");
-    deepEqual(stack.lastIndexOf(5), 5, "Last index of 5");
-    deepEqual(stack.lastIndexOf(null, callback), 6, "Index of the last even number greater than 5");
-});
-
-test("Stack - Indexes of test", function () {
-    var stack = new Stack();
-    for (var i = 0; i < 30; i++)
-        stack.push(i % 10);
-    var callback = function (item) {
-        return !(item % 2) && item > 5;
-    };
-    deepEqual(stack.allIndexesOf(0), [20, 10, 0], "Indexes of 0");
-    deepEqual(stack.allIndexesOf(15), [], "Indexes of 15");
-    deepEqual(stack.allIndexesOf(5), [25, 15, 5], "Indexes of 5");
-    deepEqual(stack.allIndexesOf(null, callback), [28, 26, 18, 16, 8, 6], "Indexes of the even numbers greater than 5");
-});
-
-test("Stack - Clone test", function () {
-    var stack = new Stack();
-    for (var i = 0; i < 10; i++)
-        stack.push(i);
-    var clone = stack.clone();
-    var it = clone.getIterator();
-    var j = 9;
-    for (it.first(); !it.isDone(); it.next(), j--)
-        deepEqual(it.getItem(), j, "Clone of the list");
-});
-
-test("Stack - Clone distinct test", function () {
-    var stack = new Stack();
-    for (var i = 0; i < 20; i++)
-        stack.push(i % 10);
-    var clone = stack.cloneDistinct();
-    deepEqual(clone.allIndexesOf(2), [2], "Clone of the list");
-});
-
-test("Stack - Filter test", function () {
-    var stack = new Stack();
-    const length = 100;
-
-    for (var i = 0; i < length; i++)
-        stack.push(i);
-
-    var result = stack.filter(function (item) {
-        return 1 - item % 2;
-    });
-
-    deepEqual(result[0], 98, "Filter of the even values");
-    deepEqual(result[result.length - 1], 0, "Filter on the even values");
-});
\ No newline at end of file
diff --git a/Tests/Stack_Test.ts b/Tests/Stack_Test.ts
new file mode 100644
index 0000000..8c4f946
--- /dev/null
+++ b/Tests/Stack_Test.ts
@@ -0,0 +1,223 @@
+/**
+ * Created by Battistella Stefano on 31/03/14.
+ */
+
+QUnit.test("Stack - Init test", function (assert)
+{
+    var stack = new ds.Stack(0, 2, 4, 6);
+    assert.deepEqual(stack.multiPop(4), [6, 4, 2, 0], "Initializing");
+    stack = new ds.Stack(0);
+    assert.deepEqual(stack.multiPop(4), [0], "Initializing");
+});
+
+QUnit.test("Stack - Init range test", function (assert)
+{
+    var stack = new ds.Stack(ds.Range(0, 6, 2));
+    assert.deepEqual(stack.multiPop(4), [6, 4, 2, 0], "Initializing");
+});
+
+QUnit.test("Stack - Push test", function (assert)
+{
+    var stack = new ds.Stack();
+    stack.push(0);
+    assert.deepEqual(stack.getItem(0), 0, "Push 0");
+    stack.push(2);
+    assert.deepEqual(stack.getItem(0), 2, "Push 2");
+    assert.deepEqual(stack.getItem(1), 0, "Push 2");
+});
+
+QUnit.test("Stack - Pop test", function (assert)
+{
+    var stack = new ds.Stack();
+    stack.push(0);
+    stack.push(2);
+    assert.deepEqual(stack.pop(), 2, "Pop");
+    assert.deepEqual(stack.pop(), 0, "Check length");
+    assert.deepEqual(stack.pop(), undefined, "Check length if too much pop");
+});
+
+QUnit.test("Stack - MultiPop test", function (assert)
+{
+    var stack = new ds.Stack();
+    stack.push(0);
+    stack.push(2);
+    assert.deepEqual(stack.multiPop(1), [2], "MultiPop 1 time");
+    stack.push(4);
+    stack.push(5);
+    stack.push(8);
+    assert.deepEqual(stack.multiPop(7), [8, 5, 4, 0], "MultiPop 7 times");
+    assert.deepEqual(stack.multiPop(1), [], "MultiPop 1 time with stack empty");
+});
+
+QUnit.test("Stack - Iterator test", function (assert)
+{
+    var stack = new ds.Stack();
+    for (var i = 0; i < 10; i++)
+        stack.push(i);
+    var j = 9;
+    var it = stack.getIterator();
+    for (it.first(); !it.isDone(); it.next(), j--)
+        assert.deepEqual(it.getItem(), j, "Get next item " + (10 - j));
+    j++;
+    for (it.last(); !it.isDone(); it.previous(), j++)
+        assert.deepEqual(it.getItem(), j, "Get previous item " + (10 - j));
+});
+
+QUnit.test("Stack - Get length test", function (assert)
+{
+    var stack = new ds.Stack();
+    assert.deepEqual(stack.getLength(), 0, "Length 0");
+    stack.push(0);
+    assert.deepEqual(stack.getLength(), 1, "Length 1");
+    stack.push(2);
+    assert.deepEqual(stack.getLength(), 2, "Length 2");
+    stack.pop();
+    stack.pop();
+    assert.deepEqual(stack.getLength(), 0, "Length 0");
+
+});
+
+QUnit.test("Stack - Peek test", function (assert)
+{
+    var stack = new ds.Stack();
+    stack.push(0);
+    assert.deepEqual(stack.peek(), 0, "Peek 0");
+    stack.push(2);
+    assert.deepEqual(stack.peek(), 2, "Peek 2");
+});
+
+QUnit.test("Stack - Clear test", function (assert)
+{
+    var stack = new ds.Stack();
+    stack.push(0);
+    stack.push(2);
+    stack.clear();
+    assert.deepEqual(stack.isEmpty(), true, "Clear stack");
+});
+
+QUnit.test("Stack - Is empty test", function (assert)
+{
+    var stack = new ds.Stack();
+    stack.push(0);
+    stack.push(2);
+    assert.deepEqual(stack.isEmpty(), false, "Is empty");
+    stack.clear();
+    assert.deepEqual(stack.isEmpty(), true, "Is empty");
+});
+
+QUnit.test("Stack - contains", function (assert)
+{
+    var stack = new ds.Stack();
+    stack.push(0);
+    stack.push(2);
+    assert.deepEqual(stack.contains(0), true, "Contains 0");
+    assert.deepEqual(stack.contains(2), true, "Contains 2");
+    assert.deepEqual(stack.contains(1), false, "Not contains 1");
+    var callback = function (item)
+    {
+        return item > 0;
+    };
+    assert.deepEqual(stack.contains(null, callback), true, "Contains a value > 0");
+    callback = function (item)
+    {
+        return item < 0;
+    };
+    assert.deepEqual(stack.contains(null, callback), false, "Contains a value < 0");
+});
+
+QUnit.test("Stack - execute", function (assert)
+{
+    var stack = new ds.Stack();
+    stack.push(0);
+    stack.push(2);
+    var callback = function (item)
+    {
+        return item * 2;
+    };
+    stack.execute(callback);
+    assert.deepEqual(stack.getItem(0), 4, "Execute for item 1");
+    assert.deepEqual(stack.getItem(1), 0, "Execute for item 0");
+});
+
+QUnit.test("Stack - Index of test", function (assert)
+{
+    var stack = new ds.Stack();
+    for (var i = 0; i < 10; i++)
+        stack.push(i);
+    var callback = function (item)
+    {
+        return !(item % 2) && item > 5;
+    };
+    assert.deepEqual(stack.indexOf(0), 0, "Index of 0");
+    assert.deepEqual(stack.indexOf(15), -1, "Index of 15");
+    assert.deepEqual(stack.indexOf(5), 5, "Index of 5");
+    assert.deepEqual(stack.indexOf(null, callback), 8, "Index of the first even number greater than 5");
+});
+
+QUnit.test("Stack - Last index of test", function (assert)
+{
+    var stack = new ds.Stack();
+    for (var i = 0; i < 10; i++)
+        stack.push(i);
+    var callback = function (item)
+    {
+        return !(item % 2) && item > 5;
+    };
+    assert.deepEqual(stack.lastIndexOf(0), 0, "Last index of 0");
+    assert.deepEqual(stack.lastIndexOf(15), -1, "Last index of 15");
+    assert.deepEqual(stack.lastIndexOf(5), 5, "Last index of 5");
+    assert.deepEqual(stack.lastIndexOf(null, callback), 6, "Index of the last even number greater than 5");
+});
+
+QUnit.test("Stack - Indexes of test", function (assert)
+{
+    var stack = new ds.Stack();
+    for (var i = 0; i < 30; i++)
+        stack.push(i % 10);
+    var callback = function (item)
+    {
+        return !(item % 2) && item > 5;
+    };
+    assert.deepEqual(stack.allIndexesOf(0), [20, 10, 0], "Indexes of 0");
+    assert.deepEqual(stack.allIndexesOf(15), [], "Indexes of 15");
+    assert.deepEqual(stack.allIndexesOf(5), [25, 15, 5], "Indexes of 5");
+    assert.deepEqual(stack.allIndexesOf(null, callback), [28, 26, 18, 16, 8, 6], "Indexes of the even numbers greater than 5");
+});
+
+QUnit.test("Stack - Clone test", function (assert)
+{
+    var stack = new ds.Stack();
+    for (var i = 0; i < 10; i++)
+        stack.push(i);
+    var clone = stack.clone();
+    var it = clone.getIterator();
+    var j = 9;
+    for (it.first(); !it.isDone(); it.next(), j--)
+        assert.deepEqual(it.getItem(), j, "Clone of the list");
+});
+
+QUnit.test("Stack - Clone distinct test", function (assert)
+{
+    var stack = new ds.Stack();
+    for (var i = 0; i < 20; i++)
+        stack.push(i % 10);
+    var clone = stack.cloneDistinct();
+    assert.deepEqual(clone.allIndexesOf(2), [2], "Clone of the list");
+});
+
+QUnit.test("Stack - Filter test", function (assert)
+{
+    var stack = new ds.Stack<number>();
+    const length = 100;
+
+    for (var i = 0; i < length; i++)
+        stack.push(i);
+
+    var result = stack.filter(function (item)
+    {
+        return Boolean(1 - item % 2);
+    });
+
+    assert.deepEqual(result[0], 98, "Filter of the even values");
+    assert.deepEqual(result[result.length - 1], 0, "Filter on the even values");
+});
\ No newline at end of file
diff --git a/Tests/Trie_Test.js b/Tests/Trie_Test.js
deleted file mode 100644
index 5a4b894..0000000
--- a/Tests/Trie_Test.js
+++ /dev/null
@@ -1,52 +0,0 @@
-/**
- * Created by Stefano on 06/04/14.
- */
-
-test("Trie - Insert test", function () {
-	var trie = new Trie();
-    trie.insert("Blue");
-    trie.insert("Bleu");
-    var strings = [];
-    trie.stringsToArray(strings);
-    deepEqual(strings, ["Bleu","Blue"], "Insert node");
-    trie.insert("Abba", 0);
-    trie.insert("Hello", 0);
-    trie.insert("World", 0);
-    deepEqual(trie.getItem("Abba"), 0, "Insert node");
-    deepEqual(trie.getItem("Hello"), 0, "Insert node");
-    deepEqual(trie.getItem("World"), 0, "Insert node");
-});
-
-test("Trie - Suggest test", function () {
-    var trie = new Trie();
-    trie.insert("Blue");
-    trie.insert("Boing");
-    trie.insert("Yellow");
-    trie.insert("Hello");
-    trie.insert("He");
-    trie.insert("Hola");
-    deepEqual(trie.suggest(""), ["Blue","Boing", "He", "Hello", "Hola", "Yellow"], "Suggest empty string");
-    deepEqual(trie.suggest("B"), ["Blue","Boing"], "Suggest B string");
-    deepEqual(trie.suggest("Bo"), ["Boing"], "Suggest Bo string");
-    deepEqual(trie.suggest("Ho"), ["Hola"], "Suggest Ho string");
-    deepEqual(trie.suggest("A"), [], "Suggest A string");
-    deepEqual(trie.suggest("Ready"), [], "Suggest Ready string");
-});
-
-test("Trie - Update Item test", function () {
-    var trie = new Trie();
-    trie.insert("Blue", 0);
-    trie.insert("Boing", 0);
-    trie.insert("Yellow", 0);
-    trie.insert("Hello", 0);
-    trie.insert("He", 0);
-    trie.insert("Hola", 0);
-    var callback = function(item) {
-        return item+1;
-    };
-    var strings = trie.suggest("");
-    for(var i = 0; i < strings.length; ++i) {
-        trie.updateItem(strings[i], callback);
-        deepEqual(trie.getItem(strings[i]), 1, "Value Updated");
-    }
-});
\ No newline at end of file
diff --git a/Tests/Trie_Test.ts b/Tests/Trie_Test.ts
new file mode 100644
index 0000000..6670a30
--- /dev/null
+++ b/Tests/Trie_Test.ts
@@ -0,0 +1,57 @@
+/**
+ * Created by Stefano on 06/04/14.
+ */
+
+QUnit.test("Trie - Insert test", function (assert)
+{
+    var trie = new ds.Trie();
+    trie.insert("Blue");
+    trie.insert("Bleu");
+    var strings = [];
+    trie.stringsToArray(strings);
+    assert.deepEqual(strings, ["Bleu", "Blue"], "Insert node");
+    trie.insert("Abba", 0);
+    trie.insert("Hello", 0);
+    trie.insert("World", 0);
+    assert.deepEqual(trie.getItem("Abba"), 0, "Insert node");
+    assert.deepEqual(trie.getItem("Hello"), 0, "Insert node");
+    assert.deepEqual(trie.getItem("World"), 0, "Insert node");
+});
+
+QUnit.test("Trie - Suggest test", function (assert)
+{
+    var trie = new ds.Trie();
+    trie.insert("Blue");
+    trie.insert("Boing");
+    trie.insert("Yellow");
+    trie.insert("Hello");
+    trie.insert("He");
+    trie.insert("Hola");
+    assert.deepEqual(trie.suggest(""), ["Blue", "Boing", "He", "Hello", "Hola", "Yellow"], "Suggest empty string");
+    assert.deepEqual(trie.suggest("B"), ["Blue", "Boing"], "Suggest B string");
+    assert.deepEqual(trie.suggest("Bo"), ["Boing"], "Suggest Bo string");
+    assert.deepEqual(trie.suggest("Ho"), ["Hola"], "Suggest Ho string");
+    assert.deepEqual(trie.suggest("A"), [], "Suggest A string");
+    assert.deepEqual(trie.suggest("Ready"), [], "Suggest Ready string");
+});
+
+QUnit.test("Trie - Update Item test", function (assert)
+{
+    var trie = new ds.Trie();
+    trie.insert("Blue", 0);
+    trie.insert("Boing", 0);
+    trie.insert("Yellow", 0);
+    trie.insert("Hello", 0);
+    trie.insert("He", 0);
+    trie.insert("Hola", 0);
+    var callback = function (item)
+    {
+        return item + 1;
+    };
+    var strings = trie.suggest("");
+    for (var i = 0; i < strings.length; ++i)
+    {
+        trie.updateItem(strings[i], callback);
+        assert.deepEqual(trie.getItem(strings[i]), 1, "Value Updated");
+    }
+});
\ No newline at end of file
diff --git a/Tests/qunit.d.ts b/Tests/qunit.d.ts
new file mode 100644
index 0000000..f348bc4
--- /dev/null
+++ b/Tests/qunit.d.ts
@@ -0,0 +1,600 @@
+// Type definitions for QUnit v2.0.1
+// Project: http://qunitjs.com/
+// Definitions by: James Bracy <https://github.com/waratuman>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+interface Assert
+{
+    /**
+     * Instruct QUnit to wait for an asynchronous operation.
+     * 
+     * The callback returned from `assert.async()` will throw an Error if it is
+     * invoked more than once (or more often than the accepted call count, if
+     * provided).
+     *
+     * This replaces functionality previously provided by `QUnit.stop()` and
+     * `QUnit.start()`.
+     * 
+     * @param {number} [acceptCallCount=1] Number of expected callbacks before the test is done.
+     */
+    async(acceptCallCount?: number): () => void;
+
+    /**
+     * A deep recursive comparison, working on primitive types, arrays, objects,
+     * regular expressions, dates and functions.
+     * 
+     * The `deepEqual()` assertion can be used just like `equal()` when comparing
+     * the value of objects, such that `{ key: value }` is equal to
+     * `{ key: value }`. For non-scalar values, identity will be disregarded by
+     * deepEqual.
+     * 
+     * `notDeepEqual()` can be used to explicitly test deep, strict inequality.
+     * 
+     * @param actual Object or Expression being tested
+     * @param expected Known comparision value
+     * @param {string} [message] A short description of the assertion 
+     */
+    deepEqual(actual: any, expected: any, message?: string): void;
+
+    /**
+     * A non-strict comparison, roughly equivalent to JUnit's assertEquals.
+     * 
+     * The `equal` assertion uses the simple comparison operator (`==`) to
+     * compare the actual and expected arguments. When they are equal, the
+     * assertion passes; otherwise, it fails. When it fails, both actual and
+     * expected values are displayed in the test result, in addition to a given
+     * message.
+     * 
+     *  `notEqual()` can be used to explicitly test inequality.
+     * 
+     * `strictEqual()` can be used to test strict equality.
+     * 
+     * @param actual Expression being tested
+     * @param expected Known comparison value
+     * @param {string} [message] A short description of the assertion
+     */
+    equal(actual: any, expected: any, message?: string): void;
+
+    /**
+     * Specify how many assertions are expected to run within a test.
+     * 
+     * To ensure that an explicit number of assertions are run within any test,
+     * use `assert.expect( number )` to register an expected count. If the
+     * number of assertions run does not match the expected count, the test will
+     * fail.
+     * 
+     * @param {number} amount Number of assertions in this test.
+     */
+    expect(amount: number): void;
+
+    /**
+     * An inverted deep recursive comparison, working on primitive types,
+     * arrays, objects, regular expressions, dates and functions.
+     * 
+     * @param actual Object or Expression being tested
+     * @param expected Known comparison value
+     * @param {string} [message] A short description of the assertion
+     */
+    notDeepEqual(actual: any, expected: any, message?: string): void;
+
+    /**
+     * A non-strict comparison, checking for inequality.
+     * 
+     * The `notEqual` assertion uses the simple inverted comparison operator
+     * (`!=`) to compare the actual and expected arguments. When they aren't
+     * equal, the assertion passes; otherwise, it fails. When it fails, both
+     * actual and expected values are displayed in the test result, in addition
+     * to a given message.
+     * 
+     * `equal()` can be used to test equality.
+     * 
+     * `notStrictEqual()` can be used to test strict inequality.
+     * 
+     * @param actual Object or Expression being tested
+     * @param expected Known comparison value
+     * @param {string} [message] A short description of the assertion
+     */
+    notEqual(actual: any, expected: any, message?: string): void;
+
+    /**
+     * A boolean check, inverse of `ok()` and CommonJS's `assert.ok()`, and
+     * equivalent to JUnit's `assertFalse()`. Passes if the first argument is
+     * falsy.
+     * 
+     * `notOk()` requires just one argument. If the argument evaluates to false,
+     * the assertion passes; otherwise, it fails. If a second message argument
+     * is provided, it will be displayed in place of the result.
+     * 
+     * @param state Expression being tested
+     * @param {string} [message] A short description of the assertion
+     */
+    notOk(state: any, message?: string): void;
+
+    /**
+     * A strict comparison of an object's own properties, checking for inequality.
+     * 
+     * The `notPropEqual` assertion uses the strict inverted comparison operator
+     * (`!==`) to compare the actual and expected arguments as Objects regarding
+     * only their properties but not their constructors.
+     * 
+     * When they aren't equal, the assertion passes; otherwise, it fails. When
+     * it fails, both actual and expected values are displayed in the test
+     * result, in addition to a given message.
+     * 
+     * `equal()` can be used to test equality.
+     * 
+     * `propEqual()` can be used to test strict equality of an Object properties.
+     * 
+     * @param actual Object or Expression being tested
+     * @param expected Known comparison value
+     * @param {string} [message] A short description of the assertion
+     */
+    notPropEqual(actual: any, expected: any, message?: string): void;
+
+    /**
+     * A strict comparison, checking for inequality.
+     * 
+     * The `notStrictEqual` assertion uses the strict inverted comparison
+     * operator (`!==`) to compare the actual and expected arguments. When they
+     * aren't equal, the assertion passes; otherwise, it fails. When it fails,
+     * both actual and expected values are displayed in the test result, in
+     * addition to a given message.
+     * 
+     * `equal()` can be used to test equality.
+     * 
+     * `strictEqual()` can be used to test strict equality.
+     * 
+     * @param actual Object or Expression being tested
+     * @param expected Known comparison value
+     * @param {string} [message] A short description of the assertion
+     */
+    notStrictEqual(actual: any, expected: any, message?: string): void;
+
+    /**
+     * A boolean check, equivalent to CommonJS's assert.ok() and JUnit's
+     * assertTrue(). Passes if the first argument is truthy.
+     * 
+     * The most basic assertion in QUnit, ok() requires just one argument. If
+     * the argument evaluates to true, the assertion passes; otherwise, it
+     * fails. If a second message argument is provided, it will be displayed in
+     * place of the result.
+     * 
+     * @param state Expression being tested
+     * @param {string} message A short description of the assertion
+     */
+    ok(state: any, message?: string): void;
+
+    /**
+     * A strict type and value comparison of an object's own properties.
+     * 
+     * The `propEqual()` assertion provides strictly (`===`) comparison of
+     * Object properties. Unlike `deepEqual()`, this assertion can be used to
+     * compare two objects made with different constructors and prototype.
+     * 
+     * `strictEqual()` can be used to test strict equality.
+     * 
+     * `notPropEqual()` can be used to explicitly test strict inequality of
+     * Object properties.
+     * 
+     * @param actual Object or Expression being tested
+     * @param expected Known comparison value
+     * @param {string} [message] A short description of the assertion
+     */
+    propEqual(actual: any, expected: any, message?: string): void;
+
+    /**
+     * Report the result of a custom assertion
+     * 
+     * Some test suites may need to express an expectation that is not defined
+     * by any of QUnit's built-in assertions. This need may be met by
+     * encapsulating the expectation in a JavaScript function which returns a
+     * `Boolean` value representing the result; this value can then be passed
+     * into QUnit's `ok` assertion.
+     * 
+     * A more readable solution would involve defining a custom assertion. If
+     * the expectation function invokes `pushResult`, QUnit will be notified of
+     * the result and report it accordingly.
+     * 
+     * @param assertionResult The assertion result
+     */
+    pushResult(assertResult: {
+        result: boolean;
+        actual: any;
+        expected: any;
+        message: string;
+    }): void;
+
+    /**
+     * A strict type and value comparison.
+     * 
+     * The `strictEqual()` assertion provides the most rigid comparison of type
+     * and value with the strict equality operator (`===`).
+     * 
+     * `equal()` can be used to test non-strict equality.
+     * 
+     * `notStrictEqual()` can be used to explicitly test strict inequality.
+     * 
+     * @param actual Object or Expression being tested
+     * @param expected Known comparison value
+     * @param {string} [message] A short description of the assertion
+     */
+    strictEqual(actual: any, expected: any, message?: string): void;
+
+    /**
+     * Test if a callback throws an exception, and optionally compare the thrown
+     * error.
+     * 
+     * When testing code that is expected to throw an exception based on a
+     * specific set of circumstances, use assert.throws() to catch the error
+     * object for testing and comparison.
+     * 
+     * In very few environments, like Closure Compiler, throws is considered a
+     * reserved word and will cause an error. For that case, an alias is bundled
+     * called `raises`. It has the same signature and behaviour, just a
+     * different name.
+     */
+    throws(block: () => void, expected?: any, message?: any): void;
+    raises(block: () => void, expected?: any, message?: any): void;
+
+}
+
+interface Config
+{
+    altertitle: boolean;
+    autostart: boolean;
+    collapse: boolean;
+    current: any;
+    filter: string | RegExp
+    fixture: string;
+    hidepassed: boolean;
+    maxDepth: number;
+    module: string;
+    moduleId: string[];
+    notrycatch: boolean;
+    noglobals: boolean;
+    seed: string;
+    reorder: boolean;
+    requireExpects: boolean;
+    testId: string[];
+    testTimeout: number;
+    scrolltop: boolean;
+    urlConfig: {
+        id?: string;
+        label?: string;
+        tooltip?: string;
+        value?: string | string[] | { [key: string]: string }
+    }[];
+}
+
+interface Hooks
+{
+
+    /**
+     * Runs after the last test. If additional tests are defined after the
+     * module's queue has emptied, it will not run this hook again.
+     */
+    after?: (assert: Assert) => void;
+
+    /**
+     * Runs after each test.
+     */
+    afterEach?: (assert: Assert) => void;
+
+    /**
+     * Runs before the first test.
+     */
+    before?: (assert: Assert) => void;
+
+    /**
+     * Runs before each test.
+     */
+    beforeEach?: (assert: Assert) => void;
+
+}
+
+interface NestedHooks
+{
+    /**
+     * Runs after the last test. If additional tests are defined after the
+     * module's queue has emptied, it will not run this hook again.
+     */
+    after: (fn: (assert: Assert) => void) => void;
+
+    /**
+     * Runs after each test.
+     */
+    afterEach: (fn: (assert: Assert) => void) => void;
+
+    /**
+     * Runs before the first test.
+     */
+    before: (fn: (assert: Assert) => void) => void;
+
+    /**
+     * Runs before each test.
+     */
+    beforeEach: (fn: (assert: Assert) => void) => void;
+
+}
+
+interface QUnit
+{
+
+    /**
+     * Namespace for QUnit assertions
+     * 
+     * QUnit's built-in assertions are defined on the `QUnit.assert` object. An
+     * instance of this object is passed as the only argument to the `QUnit.test`
+     * function callback.
+     * 
+     * This object has properties for each of QUnit's built-in assertion methods.
+     */
+    assert: Assert;
+
+    /**
+     * Register a callback to fire whenever the test suite begins.
+     * 
+     * `QUnit.begin()` is called once before running any tests.
+     * 
+     * @callback callback Callback to execute.
+     */
+    begin(callback: (details: { totalTests: number }) => void): void;
+
+    /**
+     * Configuration for QUnit
+     * 
+     * QUnit has a bunch of internal configuration defaults, some of which are
+     * useful to override. Check the description for each option for details.
+     */
+    config: Config
+
+    /**
+     * Register a callback to fire whenever the test suite ends.
+     * 
+     * @param callback Callback to execute
+     */
+    done(callback: (details: { failed: number, passed: number, total: number, runtime: number }) => void): void;
+
+    /**
+     * Advanced and extensible data dumping for JavaScript.
+     * 
+     * This method does string serialization by parsing data structures and
+     * objects. It parses DOM elements to a string representation of their outer
+     * HTML. By default, nested structures will be displayed up to five levels
+     * deep. Anything beyond that is replaced by `[object Object]` and
+     * `[object Array]` placeholders.
+     * 
+     * If you need more or less output, change the value of `QUnit.dump.maxDepth`,
+     * representing how deep the elements should be parsed.
+     * 
+     * Note: This method used to be in QUnit.jsDump, which was changed to
+     * QUnit.dump. The old property will be removed in QUnit 3.0.
+     */
+    dump: {
+        maxDepth: number;
+        parse(data: any): string
+    };
+
+    /**
+     * Copy the properties defined by the `mixin` object into the `target` object.
+     * 
+     * This method will modify the `target` object to contain the "own" properties
+     * defined by the `mixin`. If the `mixin` object specifies the value of any
+     * attribute as undefined, this property will instead be removed from the
+     * `target` object.
+     * 
+     * @param target An object whose properties are to be modified
+     * @param mixin An object describing which properties should be modified
+     */
+    extend(target: any, mixin: any): void;
+
+    /**
+     * Register a callback to fire whenever an assertion completes.
+     * 
+     * This is one of several callbacks QUnit provides. Its intended for
+     * integration scenarios like PhantomJS or Jenkins. The properties of the
+     * details argument are listed below as options.
+     * 
+     * @param callback Callback to execute 
+     */
+    log(callback: (details: {
+        result: boolean,
+        actual: any;
+        expected: any;
+        message: string;
+        source: string;
+        module: string;
+        name: string;
+        runtime: number;
+    }) => void): void;
+
+    /**
+     * Group related tests under a single label.
+     *
+     * You can use the module name to organize, select, and filter tests to run.
+     * 
+     * All tests inside a module callback function will be grouped into that
+     * module. The test names will all be preceded by the module name in the
+     * test results. Other modules can be nested inside this callback function,
+     * where their tests' names will be labeled by their names recursively
+     * prefixed by their parent modules.
+     * 
+     * If `QUnit.module` is defined without a `nested` callback argument, all
+     * subsequently defined tests will be grouped into the module until another
+     * module is defined.
+     * 
+     * Modules with test group functions allow you to define nested modules, and
+     * QUnit will run tests on the parent module before going deep on the nested
+     * ones, even if they're declared first. Additionally, any hook callbacks on
+     * a parent module will wrap the hooks on a nested module. In other words,
+     * `before` and `beforeEach` callbacks will form a queue while the
+     * `afterEach` and `after` callbacks will form a stack.
+     * 
+     * You can specify code to run before and after tests using the hooks
+     * argument, and also to create properties that will be shared on the
+     * testing context. Any additional properties on the `hooks` object will be
+     * added to that context. The `hooks` argument is still optional if you call
+     * `QUnit.module` with a callback argument.
+     * 
+     * The module's callback is invoked with the test environment as its `this`
+     * context, with the environment's properties copied to the module's tests,
+     * hooks, and nested modules. Note that changes on tests' `this` are not
+     * preserved between sibling tests, where `this` will be reset to the initial
+     * value for each test.
+     *  
+     * @param {string} name Label for this group of tests
+     * @param hookds Callbacks to run during test execution
+     * @param nested A callback with grouped tests and nested modules to run under the current module label
+     */
+    module(name: string, hooks?: Hooks, nested?: (hooks: NestedHooks) => void): void;
+    module(name: string, nested?: (hooks: NestedHooks) => void): void;
+
+    /**
+     * Register a callback to fire whenever a module ends.
+     * 
+     * @param callback Callback to execute
+     */
+    moduleDone(callback: (details: {
+        name: string;
+        failed: number;
+        passed: number;
+        total: number;
+        runtime: number;
+    }) => void): void;
+
+    /**
+     * Register a callback to fire whenever a module begins.
+     * 
+     * @param callback Callback to execute
+     */
+    moduleStart(callback: (details: { name: string }) => void): void;
+
+    /**
+     * Adds a test to exclusively run, preventing all other tests from running.
+     * 
+     * Use this method to focus your test suite on a specific test. QUnit.only
+     * will cause any other tests in your suite to be ignored.
+     * 
+     * Note, that if more than one QUnit.only is present only the first instance
+     * will run.
+     * 
+     * This is an alternative to filtering tests to run in the HTML reporter. It
+     * is especially useful when you use a console reporter or in a codebase
+     * with a large set of long running tests.
+     * 
+     * @param {string} name Title of unit being tested
+     * @param callback Function to close over assertions
+     */
+    only(name: string, callback: (assert: Assert) => void): void;
+
+    /**
+     * DEPRECATED: Report the result of a custom assertion.
+     * 
+     * This method is deprecated and it's recommended to use pushResult on its
+     * direct reference in the assertion context.
+     * 
+     * QUnit.push reflects to the current running test, and it may leak
+     * assertions in asynchronous mode. Checkout assert.pushResult() to set a
+     * proper custom assertion.
+     * 
+     * Invoking QUnit.push allows to create a readable expectation that is not
+     * defined by any of QUnit's built-in assertions.
+     * 
+     * @deprecated
+     */
+    push(result: boolean, actual: any, expected: any, message: string): void;
+
+    /**
+     * Adds a test like object to be skipped.
+     * 
+     * Use this method to replace QUnit.test() instead of commenting out entire
+     * tests.
+     * 
+     * This test's prototype will be listed on the suite as a skipped test,
+     * ignoring the callback argument and the respective global and module's
+     * hooks.
+     * 
+     * @param {string} Title of unit being tested
+     */
+    skip(name: string, callback?: (assert: Assert) => void): void;
+
+    /**
+     * Returns a single line string representing the stacktrace (call stack).
+     * 
+     * This method returns a single line string representing the stacktrace from
+     * where it was called. According to its offset argument, `QUnit.stack()` will
+     * return the correspondent line from the call stack.
+     * 
+     * The default `offset` is `0` and will return the current location where it
+     * was called.
+     * 
+     * Not all browsers support retrieving stracktraces. In those, `QUnit.stack()`
+     * will return undefined.
+     * 
+     * @param {number} offset Set the stacktrace line offset.
+     */
+    stack(offset?: number): string;
+
+    /**
+     * `QUnit.start()` must be used to start a test run that has
+     * `QUnit.config.autostart` set to `false`.
+     * 
+     * This method was previously used to control async tests on text contexts
+     * along with QUnit.stop. For asynchronous tests, use assert.async instead.
+     * 
+     * When your async test has multiple exit points, call `QUnit.start()` for the
+     * corresponding number of `QUnit.stop()` increments.
+     */
+    start(): void;
+
+    /**
+     * Add a test to run.
+     * 
+     * Add a test to run using `QUnit.test()`.
+     * 
+     * The `assert` argument to the callback contains all of QUnit's assertion
+     * methods. Use this argument to call your test assertions.
+     *
+     * `QUnit.test()` can automatically handle the asynchronous resolution of a
+     * Promise on your behalf if you return a thenable Promise as the result of
+     * your callback function.
+     * 
+     * @param {string} Title of unit being tested
+     * @param callback Function to close over assertions
+     */
+    test(name: string, callback: (assert: Assert) => void): void;
+
+    /**
+     * Register a callback to fire whenever a test ends.
+     * 
+     * @param callback Callback to execute
+     */
+    testDone(callback: (details: {
+        name: string;
+        module: string;
+        failed: number;
+        passed: number;
+        total: number;
+        runtime: number;
+    }) => void): void;
+
+    /**
+     * Register a callback to fire whenever a test begins.
+     * 
+     * @param callback Callback to execute
+     */
+    testStart(callback: (details: { name: string; module: string; }) => void): void;
+
+    /**
+     * Are the test running from the server or not.
+     */
+    isLocal: boolean;
+
+    /**
+    * QUnit version
+    */
+    version: string;
+
+}
+
+/* QUnit */
+declare const QUnit: QUnit;
\ No newline at end of file
diff --git a/Tests/tester.html b/Tests/tester.html
index e79e53f..aecba8f 100644
--- a/Tests/tester.html
+++ b/Tests/tester.html
@@ -10,53 +10,14 @@
 <div id="qunit-fixture"></div>
 
 <!--classes to test-->
-<script type="text/javascript" src="Lib/Range/Range.js"></script>
-<script type="text/javascript" src="Lib/Aggregate/Aggregate.js"></script>
-<script type="text/javascript" src="Lib/Aggregate/Iterator.js"></script>
-<script type="text/javascript" src="Lib/Stack/Stack.js"></script>
-<script type="text/javascript" src="Lib/Stack/StackIterator.js"></script>
-<script type="text/javascript" src="Lib/Queue/Queue.js"></script>
-<script type="text/javascript" src="Lib/Queue/QueueIterator.js"></script>
-<script type="text/javascript" src="Lib/PriorityQueue/PriorityQueue.js"></script>
-<script type="text/javascript" src="Lib/PriorityQueue/PriorityQueueIterator.js"></script>
-<script type="text/javascript" src="Lib/CircularBuffer/CircularBuffer.js"></script>
-<script type="text/javascript" src="Lib/CircularBuffer/CircularBufferIterator.js"></script>
-<script type="text/javascript" src="Lib/LinkedList/LinkedList.js"></script>
-<script type="text/javascript" src="Lib/LinkedList/LinkedListIterator.js"></script>
-<script type="text/javascript" src="Lib/DoubleLinkedList/DoubleLinkedList.js"></script>
-<script type="text/javascript" src="Lib/DoubleLinkedList/DoubleLinkedListIterator.js"></script>
-<script type="text/javascript" src="Lib/HashTable/HashTable.js"></script>
-<script type="text/javascript" src="Lib/BSTree/BSTree.js"></script>
-<script type="text/javascript" src="Lib/BSTree/BSTreeIterator.js"></script>
-<script type="text/javascript" src="Lib/RBTree/RBTree.js"></script>
-<script type="text/javascript" src="Lib/RBTree/RBTreeIterator.js"></script>
-<script type="text/javascript" src="Lib/RBTreeList/RBTreeList.js"></script>
-<script type="text/javascript" src="Lib/RBTreeList/RBTreeListIterator.js"></script>
-<script type="text/javascript" src="Lib/BTree/BTree.js"></script>
-<script type="text/javascript" src="Lib/BTree/BTreeIterator.js"></script>
-<script type="text/javascript" src="Lib/Set/Set.js"></script>
-<script type="text/javascript" src="Lib/Trie/Trie.js"></script>
-<script type="text/javascript" src="Lib/Trie/TrieIterator.js"></script>
+<script type="text/javascript" src="../out/ds.js"></script>
 
 <!--QUnit-->
 
 <script src="//code.jquery.com/qunit/qunit-1.17.1.js"></script>
 
 <!--tests-->
-<script type="text/javascript" src="Range_Test.js"></script>
-<script type="text/javascript" src="Stack_Test.js"></script>
-<script type="text/javascript" src="Queue_Test.js"></script>
-<script type="text/javascript" src="PriorityQueue_Test.js"></script>
-<script type="text/javascript" src="CircularBuffer_Test.js"></script>
-<script type="text/javascript" src="LinkedList_Test.js"></script>
-<script type="text/javascript" src="DoubleLinkedList_Test.js"></script>
-<script type="text/javascript" src="HashTable_Test.js"></script>
-<script type="text/javascript" src="BSTree_Test.js"></script>
-<script type="text/javascript" src="RBTree_Test.js"></script>
-<script type="text/javascript" src="RBTreeList_Test.js"></script>
-<script type="text/javascript" src="BTree_Test.js"></script>
-<script type="text/javascript" src="Set_Test.js"></script>
-<script type="text/javascript" src="Trie_Test.js"></script>
+<script type="text/javascript" src="../out/tests.js"></script>
 
 <script>
     QUnit.jUnitReport = function (report) {
diff --git a/Tests/tsconfig.json b/Tests/tsconfig.json
new file mode 100644
index 0000000..c250ac1
--- /dev/null
+++ b/Tests/tsconfig.json
@@ -0,0 +1,69 @@
+{
+  "compilerOptions": {
+    /* Basic Options */
+    "target": "es5", /* Specify ECMAScript target version: 'ES3' (default), 'ES5', 'ES2015', 'ES2016', 'ES2017', or 'ESNEXT'. */
+    // "module": "commonjs",                     /* Specify module code generation: 'none', 'commonjs', 'amd', 'system', 'umd', 'es2015', or 'ESNext'. */
+    // "lib": [],                             /* Specify library files to be included in the compilation:  */
+    // "allowJs": true,                       /* Allow javascript files to be compiled. */
+    // "checkJs": true,                       /* Report errors in .js files. */
+    // "jsx": "preserve",                     /* Specify JSX code generation: 'preserve', 'react-native', or 'react'. */
+    // "declaration": true,                   /* Generates corresponding '.d.ts' file. */
+    "sourceMap": true, /* Generates corresponding '.map' file. */
+    "outFile": "../out/tests.js" /* Concatenate and emit output to single file. */
+    // "outDir": "./",                        /* Redirect output structure to the directory. */
+    // "rootDir": "./",                       /* Specify the root directory of input files. Use to control the output directory structure with --outDir. */
+    // "removeComments": true,                /* Do not emit comments to output. */
+    // "noEmit": true,                        /* Do not emit outputs. */
+    // "importHelpers": true,                 /* Import emit helpers from 'tslib'. */
+    // "downlevelIteration": true,            /* Provide full support for iterables in 'for-of', spread, and destructuring when targeting 'ES5' or 'ES3'. */
+    // "isolatedModules": true,               /* Transpile each file as a separate module (similar to 'ts.transpileModule'). */
+    /* Strict Type-Checking Options */
+    // "strict": true                            /* Enable all strict type-checking options. */
+    // "noImplicitAny": true,                 /* Raise error on expressions and declarations with an implied 'any' type. */
+    // "strictNullChecks": true,              /* Enable strict null checks. */
+    // "strictFunctionTypes": true,           /* Enable strict checking of function types. */
+    // "noImplicitThis": true,                /* Raise error on 'this' expressions with an implied 'any' type. */
+    // "alwaysStrict": true,                  /* Parse in strict mode and emit "use strict" for each source file. */
+    /* Additional Checks */
+    // "noUnusedLocals": true,                /* Report errors on unused locals. */
+    // "noUnusedParameters": true,            /* Report errors on unused parameters. */
+    // "noImplicitReturns": true,             /* Report error when not all code paths in function return a value. */
+    // "noFallthroughCasesInSwitch": true,    /* Report errors for fallthrough cases in switch statement. */
+    /* Module Resolution Options */
+    // "moduleResolution": "node",            /* Specify module resolution strategy: 'node' (Node.js) or 'classic' (TypeScript pre-1.6). */
+    // "baseUrl": "./",                       /* Base directory to resolve non-absolute module names. */
+    // "paths": {},                           /* A series of entries which re-map imports to lookup locations relative to the 'baseUrl'. */
+    // "rootDirs": [],                        /* List of root folders whose combined content represents the structure of the project at runtime. */
+    // "typeRoots": [],                       /* List of folders to include type definitions from. */
+    // "types": [],                           /* Type declaration files to be included in compilation. */
+    // "allowSyntheticDefaultImports": true,  /* Allow default imports from modules with no default export. This does not affect code emit, just typechecking. */
+    // "preserveSymlinks": true,              /* Do not resolve the real path of symlinks. */
+    /* Source Map Options */
+    // "sourceRoot": "./",                    /* Specify the location where debugger should locate TypeScript files instead of source locations. */
+    // "mapRoot": "./",                       /* Specify the location where debugger should locate map files instead of generated locations. */
+    // "inlineSourceMap": true,               /* Emit a single file with source maps instead of having a separate file. */
+    // "inlineSources": true,                 /* Emit the source alongside the sourcemaps within a single file; requires '--inlineSourceMap' or '--sourceMap' to be set. */
+    /* Experimental Options */
+    // "experimentalDecorators": true,        /* Enables experimental support for ES7 decorators. */
+    // "emitDecoratorMetadata": true,         /* Enables experimental support for emitting type metadata for decorators. */
+  },
+  "files": [
+    "../out/ds.d.ts",
+    "qunit.d.ts",
+    //
+    "BSTree_Test.ts",
+    "BTree_Test.ts",
+    "CircularBuffer_Test.ts",
+    "DoubleLinkedList_Test.ts",
+    "HashTable_Test.ts",
+    "LinkedList_Test.ts",
+    "PriorityQueue_Test.ts",
+    "Queue_Test.ts",
+    "Range_Test.ts",
+    "RBTree_Test.ts",
+    "RBTreeList_Test.ts",
+    "Set_Test.ts",
+    "Stack_Test.ts",
+    "Trie_Test.ts",
+  ]
+}
\ No newline at end of file
diff --git a/bower.json b/bower.json
deleted file mode 100644
index 07e8955..0000000
--- a/bower.json
+++ /dev/null
@@ -1,18 +0,0 @@
-{
-  "name": "javascript-data-structure",
-  "version": "1.0.0",
-  "homepage": "https://github.com/Bishop92/JavaScript-Data-Structures",
-  "authors": [
-    "Bishop"
-  ],
-  "description": "Datastructures in JS",
-  "main": "DataStructuresMinimized.js",
-  "license": "MIT",
-  "ignore": [
-    "**/.*",
-    "node_modules",
-    "bower_components",
-    "test",
-    "tests"
-  ]
-}
diff --git a/lib/Aggregate/Aggregate.js b/lib/Aggregate/Aggregate.js
deleted file mode 100644
index 7b0c5ba..0000000
--- a/lib/Aggregate/Aggregate.js
+++ /dev/null
@@ -1,15 +0,0 @@
-/**
- * Created by Stefano on 04/04/2014.
- */
-
-function Aggregate() {
-
-}
-
-/**
- * Returns the iterator relative to the aggregate.
- * @abstract
- * @return {Iterator} The iterator.
- */
-Aggregate.prototype.getIterator = function () {
-};
\ No newline at end of file
diff --git a/lib/Aggregate/Aggregate.ts b/lib/Aggregate/Aggregate.ts
new file mode 100644
index 0000000..ea028e4
--- /dev/null
+++ b/lib/Aggregate/Aggregate.ts
@@ -0,0 +1,19 @@
+/**
+ * Created by Stefano on 04/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+namespace ds
+{
+    /**
+     * 集合
+     */
+    export abstract class Aggregate
+    {
+        /**
+         * Returns the iterator relative to the aggregate.
+         * @abstract
+         * @return {Iterator} The iterator.
+         */
+        abstract getIterator(): Iterator;
+    }
+}
diff --git a/lib/Aggregate/Iterator.js b/lib/Aggregate/Iterator.js
deleted file mode 100644
index 971f0e3..0000000
--- a/lib/Aggregate/Iterator.js
+++ /dev/null
@@ -1,66 +0,0 @@
-/**
- * Created by Stefano on 04/04/2014.
- */
-
-/**
- * Interface for managing an iterator for an aggregate.
- * @constructor
- * @interface
- */
-function Iterator() {
-
-}
-
-/**
- * Moves the iterator to the first position of the aggregate.
- * @abstract
- * @return {void}
- */
-Iterator.prototype.first = function () {
-
-};
-
-/**
- * Moves the iterator to the next item.
- * @abstract
- * @return {void}
- */
-Iterator.prototype.next = function () {
-
-};
-
-/**
- * Moves the iterator to the last position of the aggregate.
- * @abstract
- * @return {void}
- */
-Iterator.prototype.last = function () {
-
-};
-
-/**
- * Moves the iterator to the previous item.
- * @abstract
- * @return {void}
- */
-Iterator.prototype.previous = function () {
-
-};
-
-/**
- * Checks if the iterator is out of the bounds of the aggregate.
- * @abstract
- * @return {boolean} It return true if the iterator is out of the bounds of the aggregate, otherwise false.
- */
-Iterator.prototype.isDone = function () {
-
-};
-
-/**
- * Returns the item stored at the position pointed by the iterator.
- * @abstract
- * @return {*} The item stored or undefined if it's out of the bounds.
- */
-Iterator.prototype.getItem = function () {
-
-};
\ No newline at end of file
diff --git a/lib/Aggregate/Iterator.ts b/lib/Aggregate/Iterator.ts
new file mode 100644
index 0000000..465cf1a
--- /dev/null
+++ b/lib/Aggregate/Iterator.ts
@@ -0,0 +1,57 @@
+/**
+ * Created by Stefano on 04/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+namespace ds
+{
+
+    /**
+     * Interface for managing an iterator for an aggregate.
+     * @constructor
+     * @interface
+     */
+    export interface Iterator
+    {
+        /**
+         * Moves the iterator to the first position of the aggregate.
+         * @abstract
+         * @return {void}
+         */
+        first(): void;
+
+        /**
+         * Moves the iterator to the next item.
+         * @abstract
+         * @return {void}
+         */
+        next(): void;
+
+        /**
+         * Moves the iterator to the last position of the aggregate.
+         * @abstract
+         * @return {void}
+         */
+        last(): void;
+
+        /**
+         * Moves the iterator to the previous item.
+         * @abstract
+         * @return {void}
+         */
+        previous(): void;
+
+        /**
+         * Checks if the iterator is out of the bounds of the aggregate.
+         * @abstract
+         * @return {boolean} It return true if the iterator is out of the bounds of the aggregate, otherwise false.
+         */
+        isDone(): boolean;
+
+        /**
+         * Returns the item stored at the position pointed by the iterator.
+         * @abstract
+         * @return {*} The item stored or undefined if it's out of the bounds.
+         */
+        getItem(): any;
+    }
+}
\ No newline at end of file
diff --git a/lib/BSTree/BSTree.js b/lib/BSTree/BSTree.js
deleted file mode 100644
index 2421e19..0000000
--- a/lib/BSTree/BSTree.js
+++ /dev/null
@@ -1,200 +0,0 @@
-/**
- * Created by Stefano on 05/04/2014.
- */
-
-/**
- * The single node of the tree.
- * @param key {number} The key of the node.
- * @param item {*} The item to store in the node.
- * @constructor
- */
-function BSNode(key, item) {
-	/**
-	 * The item stored.
-	 * @type {*}
-	 */
-	this.item = item;
-	/**
-	 * The key of the node.
-	 * @type {number}
-	 */
-	this.key = key;
-	/**
-	 * The parent node. It's null if there's no a parent node.
-	 * @type {BSNode|null}
-	 */
-	this.parent = null;
-	/**
-	 * The left node. It's null if there's no a left node.
-	 * @type {BSNode|null}
-	 */
-	this.left = null;
-	/**
-	 * The right node. It's null if there's no a right node.
-	 * @type {BSNode|null}
-	 */
-	this.right = null;
-}
-
-BSTree.prototype = new Aggregate();
-BSTree.prototype.constructor = BSTree;
-
-/**
- * Class for managing a binary search tree.
- * @constructor
- */
-function BSTree() {
-	/**
-	 * The root of the tree.
-	 * @type {BSNode|null}
-	 */
-	this.root = null;
-}
-
-/**
- * @inheritDoc
- */
-BSTree.prototype.getIterator = function () {
-	return new BSTreeIterator(this);
-};
-
-/**
- * Insert the item relatives to the key value in the tree.
- * @param key {number} The key to store.
- * @param item {*} The item to store.
- * @return {void}
- */
-BSTree.prototype.insert = function (key, item) {
-	var node = new BSNode(key, item);
-	var p = this.root;
-	for (var n = this.root; n;) {
-		p = n;
-		if (key < n.key)
-			n = n.left;
-		else
-			n = n.right;
-	}
-	node.parent = p;
-	if (!p)
-		this.root = node;
-	else if (key < p.key)
-		p.left = node;
-	else
-		p.right = node;
-};
-
-/**
- * Search the item relatives to the key.
- * @param key {Number} The key to find.
- * @param [node = root] {BSNode} The node from which start the search.
- * @return {*} The item found or undefined if there isn't the key in the tree.
- */
-BSTree.prototype.search = function (key, node) {
-	node = node || this.root;
-	while (node && key !== node.key)
-		if (key < node.key)
-			node = node.left;
-		else
-			node = node.right;
-	if (node)
-		return node.item;
-	return undefined;
-};
-
-/**
- * Get the item relatives to the minimum key stored in the tree.
- * @param [node = root] {Node} The node from which start the search.
- * @return {BSNode} The node found.
- */
-BSTree.prototype.minimum = function (node) {
-	node = node || this.root;
-	while (node && node.left)
-		node = node.left;
-	return node;
-};
-
-/**
- * Get the item relatives to the maximum key stored in the tree.
- * @param [node = root] {Node} The node from which start the search.
- * @return {BSNode} The node found.
- */
-BSTree.prototype.maximum = function (node) {
-	node = node || this.root;
-	while (node && node.right)
-		node = node.right;
-	return node;
-};
-
-/**
- * Get the node with the key next to the param node key.
- * @param node {BSNode} The node of which search the successor.
- * @return {BSNode} The node found.
- */
-BSTree.prototype.successor = function (node) {
-	if (node.right)
-		return this.minimum(node.right);
-	var parent = node.parent;
-	while (parent && node === parent.right) {
-		node = parent;
-		parent = parent.parent;
-	}
-	return parent;
-};
-
-/**
- * Get the node with the key previous to the param node key.
- * @param node {BSNode} The node of which search the predecessor.
- * @return {BSNode} The node found.
- */
-BSTree.prototype.predecessor = function (node) {
-	if (node.left)
-		return this.maximum(node.left);
-	var parent = node.parent;
-	while (parent && node === parent.left) {
-		node = parent;
-		parent = parent.parent;
-	}
-	return parent;
-};
-
-/**
- * Delete the node from the tree.
- * @param node {BSNode} The node to delete.
- * @return {void}
- */
-BSTree.prototype.deleteNode = function (node) {
-	if (!node.left && !node.right) {
-		if (node === this.root)
-			this.root = null;
-		else if (node.parent.left === node)
-			node.parent.left = null;
-		else
-			node.parent.right = null;
-	} else if (node.left && node.right) {
-		var next = this.successor(node);
-		node.key = next.key;
-		node.item = next.item;
-		if (next.parent.left === next)
-			next.parent.left = null;
-		else
-			next.parent.right = null;
-	} else {
-		if (node.right) {
-			if (node === this.root) {
-				this.root = node.right;
-				node.right.parent = null;
-			} else {
-				node.parent.right = node.right;
-				node.right.parent = node.parent;
-			}
-		} else {
-			if (node === this.root) {
-				this.root = node.left;
-				node.left.parent = null;
-			} else {
-				node.parent.left = node.left;
-				node.left.parent = node.parent;
-			}
-		}
-	}
-};
\ No newline at end of file
diff --git a/lib/BSTree/BSTree.ts b/lib/BSTree/BSTree.ts
new file mode 100644
index 0000000..203e418
--- /dev/null
+++ b/lib/BSTree/BSTree.ts
@@ -0,0 +1,233 @@
+/**
+ * Created by Stefano on 05/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+namespace ds
+{
+
+	export class BSNode<T>
+	{
+		/**
+		 * The item stored.
+		 * @type {*}
+		 */
+		item: T;
+		/**
+		 * The key of the node.
+		 * @type {number}
+		 */
+		key: number;
+		/**
+		 * The parent node. It's null if there's no a parent node.
+		 * @type {BSNode|null}
+		 */
+		parent: BSNode<T>;
+		/**
+		 * The left node. It's null if there's no a left node.
+		 * @type {BSNode|null}
+		 */
+		left: BSNode<T>;
+		/**
+		 * The right node. It's null if there's no a right node.
+		 * @type {BSNode|null}
+		 */
+		right: BSNode<T>;
+
+		/**
+		 * The single node of the tree.
+		 * @param key {number} The key of the node.
+		 * @param item {*} The item to store in the node.
+		 * @constructor
+		 */
+		constructor(key: number, item: T)
+		{
+			this.item = item;
+			this.key = key;
+			this.parent = <any>null;
+			this.left = <any>null;
+			this.right = <any>null;
+		}
+	}
+
+	export class BSTree<T> extends Aggregate
+	{
+		/**
+		 * The root of the tree.
+		 * @type {BSNode|null}
+		 */
+		root: BSNode<T>;
+		constructor()
+		{
+			super();
+			this.root = <any>null;
+		}
+
+		/**
+		 * @inheritDoc
+		 */
+		getIterator()
+		{
+			return new BSTreeIterator<T>(this);
+		}
+
+		/**
+		 * Insert the item relatives to the key value in the tree.
+		 * @param key {number} The key to store.
+		 * @param item {*} The item to store.
+		 * @return {void}
+		 */
+		insert(key: number, item: T)
+		{
+			var node = new BSNode<T>(key, item);
+			var p = this.root;
+			for (var n = this.root; n;)
+			{
+				p = n;
+				if (key < n.key)
+					n = n.left;
+				else
+					n = n.right;
+			}
+			node.parent = p;
+			if (!p)
+				this.root = node;
+			else if (key < p.key)
+				p.left = node;
+			else
+				p.right = node;
+		}
+
+		/**
+		 * Search the item relatives to the key.
+		 * @param key {Number} The key to find.
+		 * @param [node = root] {BSNode} The node from which start the search.
+		 * @return {*} The item found or undefined if there isn't the key in the tree.
+		 */
+		search(key: number, node: BSNode<T> | null = null)
+		{
+			node = node || this.root;
+			while (node && key !== node.key)
+				if (key < node.key)
+					node = node.left;
+				else
+					node = node.right;
+			if (node)
+				return node.item;
+			return undefined;
+		}
+
+		/**
+		 * Get the item relatives to the minimum key stored in the tree.
+		 * @param [node = root] {Node} The node from which start the search.
+		 * @return {BSNode} The node found.
+		 */
+		minimum(node: BSNode<T> | null = null)
+		{
+			node = node || this.root;
+			while (node && node.left)
+				node = node.left;
+			return node;
+		}
+
+		/**
+		 * Get the item relatives to the maximum key stored in the tree.
+		 * @param [node = root] {Node} The node from which start the search.
+		 * @return {BSNode} The node found.
+		 */
+		maximum(node: BSNode<T> | null = null)
+		{
+			node = node || this.root;
+			while (node && node.right)
+				node = node.right;
+			return node;
+		}
+
+		/**
+		 * Get the node with the key next to the param node key.
+		 * @param node {BSNode} The node of which search the successor.
+		 * @return {BSNode} The node found.
+		 */
+		successor(node: BSNode<T>)
+		{
+			if (node.right)
+				return this.minimum(node.right);
+			var parent = node.parent;
+			while (parent && node === parent.right)
+			{
+				node = parent;
+				parent = parent.parent;
+			}
+			return parent;
+		}
+
+		/**
+		 * Get the node with the key previous to the param node key.
+		 * @param node {BSNode} The node of which search the predecessor.
+		 * @return {BSNode} The node found.
+		 */
+		predecessor(node: BSNode<T>)
+		{
+			if (node.left)
+				return this.maximum(node.left);
+			var parent = node.parent;
+			while (parent && node === parent.left)
+			{
+				node = parent;
+				parent = parent.parent;
+			}
+			return parent;
+		}
+
+		/**
+		 * Delete the node from the tree.
+		 * @param node {BSNode} The node to delete.
+		 * @return {void}
+		 */
+		deleteNode(node: BSNode<T>)
+		{
+			if (!node.left && !node.right)
+			{
+				if (node === this.root)
+					this.root = <any>null;
+				else if (node.parent.left === node)
+					node.parent.left = <any>null;
+				else
+					node.parent.right = <any>null;
+			} else if (node.left && node.right)
+			{
+				var next = this.successor(node);
+				node.key = next.key;
+				node.item = next.item;
+				if (next.parent.left === next)
+					next.parent.left = <any>null;
+				else
+					next.parent.right = <any>null;
+			} else
+			{
+				if (node.right)
+				{
+					if (node === this.root)
+					{
+						this.root = node.right;
+						node.right.parent = <any>null;
+					} else
+					{
+						node.parent.right = node.right;
+						node.right.parent = node.parent;
+					}
+				} else
+				{
+					if (node === this.root)
+					{
+						this.root = node.left;
+						node.left.parent = <any>null;
+					} else
+					{
+						node.parent.left = node.left;
+						node.left.parent = node.parent;
+					}
+				}
+			}
+		}
+	}
+}
\ No newline at end of file
diff --git a/lib/BSTree/BSTreeIterator.js b/lib/BSTree/BSTreeIterator.js
deleted file mode 100644
index 49c2dfc..0000000
--- a/lib/BSTree/BSTreeIterator.js
+++ /dev/null
@@ -1,76 +0,0 @@
-/**
- * Created by Stefano on 06/04/2014.
- */
-
-BSTreeIterator.prototype = new Iterator();
-BSTreeIterator.prototype.constructor = BSTreeIterator;
-
-/**
- * Class that implements the iterator for a binary search tree.
- * @param aggregate {BSTree} The aggregate to scan.
- * @constructor
- */
-function BSTreeIterator(aggregate) {
-	/**
-	 * The aggregate relates to this iterator.
-	 * @type {BSTree}
-	 */
-	this.aggregate = aggregate;
-
-	/**
-	 * The pointer to the position.
-	 * @type {BSNode|null}
-	 */
-	this.pointer = null;
-}
-
-/**
- * @inheritDoc
- */
-BSTreeIterator.prototype.first = function () {
-	this.pointer = this.aggregate.minimum();
-};
-
-/**
- * @inheritDoc
- */
-BSTreeIterator.prototype.next = function () {
-	this.pointer = this.aggregate.successor(this.pointer);
-};
-
-/**
- * @inheritDoc
- */
-BSTreeIterator.prototype.last = function () {
-	this.pointer = this.aggregate.maximum();
-};
-
-/**
- * @inheritDoc
- */
-BSTreeIterator.prototype.previous = function () {
-	this.pointer = this.aggregate.predecessor(this.pointer);
-};
-
-/**
- * @inheritDoc
- */
-BSTreeIterator.prototype.isDone = function () {
-	return !this.pointer;
-};
-
-/**
- * @inheritDoc
- */
-BSTreeIterator.prototype.getItem = function () {
-	return this.pointer.item;
-};
-
-/**
- * Return the node stored at the position pointed by the iterator.
- * @abstract
- * @return {BSNode|null} The node stored or null if it's out of the bounds.
- */
-BSTreeIterator.prototype.getNode = function () {
-	return this.pointer;
-};
\ No newline at end of file
diff --git a/lib/BSTree/BSTreeIterator.ts b/lib/BSTree/BSTreeIterator.ts
new file mode 100644
index 0000000..e5680aa
--- /dev/null
+++ b/lib/BSTree/BSTreeIterator.ts
@@ -0,0 +1,90 @@
+/**
+ * Created by Stefano on 06/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+namespace ds
+{
+	export class BSTreeIterator<T> implements Iterator
+	{
+		/**
+		 * The aggregate relates to this iterator.
+		 * @type {BSTree}
+		 */
+		aggregate: BSTree<T>;
+
+		/**
+		 * The pointer to the position.
+		 * @type {BSNode|null}
+		 */
+		pointer: BSNode<T>;
+
+		/**
+		 * Class that implements the iterator for a binary search tree.
+		 * @param aggregate {BSTree} The aggregate to scan.
+		 * @constructor
+		 */
+		constructor(aggregate: BSTree<T>)
+		{
+			this.aggregate = aggregate;
+			this.pointer = <any>null;
+		}
+
+		/**
+		 * @inheritDoc
+		 */
+		first()
+		{
+			this.pointer = this.aggregate.minimum();
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		next()
+		{
+			this.pointer = this.aggregate.successor(this.pointer);
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		last()
+		{
+			this.pointer = this.aggregate.maximum();
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		previous()
+		{
+			this.pointer = this.aggregate.predecessor(this.pointer);
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		isDone()
+		{
+			return !this.pointer;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		getItem()
+		{
+			return this.pointer.item;
+		};
+
+		/**
+		 * Return the node stored at the position pointed by the iterator.
+		 * @abstract
+		 * @return {BSNode|null} The node stored or null if it's out of the bounds.
+		 */
+		getNode()
+		{
+			return this.pointer;
+		};
+	}
+}
\ No newline at end of file
diff --git a/lib/BTree/BTree.js b/lib/BTree/BTree.js
deleted file mode 100644
index afbd5a7..0000000
--- a/lib/BTree/BTree.js
+++ /dev/null
@@ -1,682 +0,0 @@
-/**
- * Created by Stefano on 08/04/2014.
- */
-
-/**
- * The single node of the tree.
- * @constructor
- */
-function BNode() {
-	/**
-	 * The keys stored it the node.
-	 * @type {Array<*>}
-	 */
-	this.keys = [];
-	/**
-	 * The items stored in the node.
-	 * @type {Array<*>}
-	 */
-	this.items = [];
-	/**
-	 * The nodes child of the node.
-	 * @type {Array<BNode>}
-	 */
-	this.childs = [];
-}
-
-BTree.prototype = new Aggregate();
-BTree.prototype.constructor = BTree;
-
-/**
- * Class for managing a B-Tree.
- * @param minimumDegree {number} The minimum number of keys of a node.
- * @constructor
- */
-function BTree(minimumDegree) {
-	/**
-	 * The root of the tree.
-	 * @type {BNode}
-	 */
-	this.root = new BNode();
-
-	/**
-	 * The minimum number of the keys of a node.
-	 * @type {number}
-	 */
-	this.t = minimumDegree;
-
-	/**
-	 * The number of items stored in the tree.
-	 * @type {number}
-	 */
-	this.size = 0;
-}
-
-/**
- * @inheritDoc
- */
-BTree.prototype.getIterator = function () {
-	return new BTreeIterator(this);
-};
-
-/**
- * Insert the item relatives to the key value in the tree.
- * @param key {number} The key to store.
- * @param item {*} The item to store.
- * @return {void}
- */
-BTree.prototype.insert = function (key, item) {
-	var node = this.root;
-	if (node.keys.length === 2 * this.t - 1) {
-		var newNode = new BNode();
-		newNode.childs.push(node);
-		this.root = newNode;
-		this.splitChild(newNode, 0);
-		node = newNode;
-	}
-	this.size++;
-	this.insertNonFull(node, key, item);
-};
-
-/**
- * Insert the new node in the right position if the node is not full.
- * @param node {BNode} The node from which start to check the insertion.
- * @param key {number} The key to store.
- * @param item {*} The item to store.
- * @return {void}
- */
-BTree.prototype.insertNonFull = function (node, key, item) {
-	while (node) {
-		var i = node.keys.length - 1;
-		if (!node.childs.length) {
-			for (; i > -1 && key < node.keys[i]; i--) {
-				node.keys[i + 1] = node.keys[i];
-				node.items[i + 1] = node.items[i];
-			}
-			node.keys[i + 1] = key;
-			node.items[i + 1] = item;
-			return;
-		} else {
-			var j = 0;
-			i++;
-			while (j < i) {
-				var m = Math.floor((j + i) / 2);
-				if (key <= node.keys[m])
-					i = m;
-				else
-					j = m + 1;
-			}
-			if (node.childs[j].keys.length === 2 * this.t - 1) {
-				this.splitChild(node, j);
-				if (key > node.keys[j])
-					j++;
-			}
-			node = node.childs[j];
-		}
-	}
-};
-
-/**
- * Search the item relatives to the key that satisfy the condition represented by the callback function.
- * @param key {Number} The key to find.
- * @param [node = root] {RBNode} The node from which start the search.
- * @param [callback = function(node,index){return(node.keys[index]===key);}] The condition to satisfy. The callback must accept the current node to check and optionally the position of the key.
- * @return {*} The item found or undefined if there isn't the key in the tree.
- */
-BTree.prototype.search = function (key, node, callback) {
-	node = node || this.root;
-	callback = callback || function (node, index) {
-		return node.keys[index] === key;
-	};
-	while (node) {
-		var n = node.keys.length;
-		var i = 0, j = n;
-		while (i < j) {
-			var m = Math.floor((i + j) / 2);
-			if (key <= node.keys[m])
-				j = m;
-			else
-				i = m + 1;
-		}
-		if (i < n && callback(node, i))
-			return node.items[i];
-		else if (!node.childs.length)
-			return undefined;
-		else
-			node = node.childs[i];
-	}
-};
-
-/**
- * Split the child of the node at the position index.
- * @param node {BNode} The parent of the child to split.
- * @param index {number} The position of the child to split.
- * @return {void}
- */
-BTree.prototype.splitChild = function (node, index) {
-	var newNode = new BNode();
-	var child = node.childs[index];
-	//copy of the last t - 1 keys and items in the new node
-	for (var i = 0; i < this.t - 1; i++) {
-		newNode.keys[i] = child.keys[i + this.t];
-		newNode.items[i] = child.items[i + this.t];
-	}
-	if (child.childs.length)
-	//copy of the last t child in the new node
-		for (var j = 0; j < this.t; j++)
-			newNode.childs[j] = child.childs[j + this.t];
-	//shift the children from index + 1 position
-	for (var l = node.keys.length; l > index; l--)
-		node.childs[l + 1] = node.childs[l];
-	//set the index position as the position t of the child
-	node.childs[index + 1] = newNode;
-	//shift the keys and the items from index position
-	for (var k = node.keys.length - 1; k > index - 1; k--) {
-		node.keys[k + 1] = node.keys[k];
-		node.items[k + 1] = node.items[k];
-	}
-	node.keys[index] = child.keys[this.t - 1];
-	node.items[index] = child.items[this.t - 1];
-	//remove keys, items and child in the old node.
-	child.keys.splice(child.keys.length - this.t);
-	child.items.splice(child.items.length - this.t);
-	child.childs.splice(child.childs.length - this.t);
-};
-
-/**
- * Delete the key from the tree.
- * @param key {*} The key to delete.
- * @return {void}
- */
-BTree.prototype.deleteKey = function (key) {
-	if (this.root.keys.length) {
-		this.deleteNonMin(this.root, key);
-		if (!this.root.keys.length && this.root.childs.length)
-			this.root = this.root.childs[0];
-		this.size--;
-	}
-};
-
-/**
- * Deletes a node that's a number of keys greater than the minimum for a node.
- * @param node {BNode} The node to delete.
- * @param key {number} The key to delete.
- * @return {void}
- */
-BTree.prototype.deleteNonMin = function (node, key) {
-	var i = 0, j = node.keys.length;
-	while (i < j) {
-		var m = Math.floor((i + j) / 2);
-		if (key <= node.keys[m])
-			j = m;
-		else
-			i = m + 1;
-	}
-	//key is in the node
-	if (i < node.keys.length && key === node.keys[i]) {
-		//the node is a leaf
-		if (!node.childs.length) {
-			//remove the key
-			for (j = i + 1; j < node.keys.length; j++) {
-				node.keys[j - 1] = node.keys[j];
-				node.items[j - 1] = node.items[j];
-			}
-			node.keys.pop();
-			node.items.pop();
-		} else {
-			//the node is not a leaf
-			//the node has the minimum number of keys
-			if (node.childs[i].length === this.t - 1) {
-				//increase the number of the keys of the node
-				this.augmentChild(node, i);
-				if (i === node.keys.length + 1)
-					i--;
-			}
-			//check if the key is moved in the child
-			if (node.keys[i] !== key)
-				this.deleteNonMin(node.childs[i], key);
-			else
-				this.deleteMax(node, i);
-		}
-		//the key is not in the node
-	} else {
-		//check if the child i has the minimum number of keys
-		if (node.childs[i].keys.length === this.t - 1) {
-			this.augmentChild(node, i);
-			if (i === node.keys.length + 2)
-				i--;
-		}
-		this.deleteNonMin(node.childs[i], key);
-	}
-};
-
-/**
- * Deletes a node that have the maximum number of keys for node.
- * @param node {BNode} The node to delete.
- * @param index {number} The key to delete in the node.
- * @return {void}
- */
-BTree.prototype.deleteMax = function (node, index) {
-	var child = node.childs[index];
-	var goAhead = true;
-	while (goAhead) {
-		if (!child.childs.length) {
-			node.keys[index] = child.keys[child.keys.length - 1];
-			node.items[index] = child.items[child.items.length - 1];
-			child.keys.pop();
-			child.items.pop();
-			goAhead = false;
-		} else {
-			var last = child.childs[child.keys.length];
-			if (last.keys.length === this.t - 1)
-				this.augmentChild(child, child.keys.length);
-			child = child.childs[child.keys.length];
-		}
-	}
-};
-
-/**
- * Augments the number of keys stored in the node preserving the order.
- * @param node {BNode} The node to delete.
- * @param index {number} The index of the position to augment.
- * @return {void}
- */
-BTree.prototype.augmentChild = function (node, index) {
-	var child = node.childs[index];
-	var brother;
-	if (index)
-		brother = node.childs[index - 1];
-	if (index && brother.keys.length > this.t - 1) {
-		if (child.childs.length) {
-			for (var j = this.keys.length + 1; j > 0; j--)
-				child.childs[j] = child.childs[j - 1];
-			child.childs[0] = brother.childs[brother.keys.length];
-			for (var i = child.keys.length; i > 0; i--) {
-				child.keys[i] = child.keys[i - 1];
-				child.items[i] = child.items[i - 1];
-			}
-			child.keys[0] = node.keys[index - 1];
-			child.items[0] = node.items[index - 1];
-			node.keys[index - 1] = brother.keys[brother.keys.length - 1];
-			node.items[index - 1] = brother.items[brother.items.length - 1];
-		}
-	} else {
-		if (index < node.keys.length)
-			brother = node.childs[index + 1];
-		if (index < node.keys.length && brother.keys.length > this.t - 1) {
-			if (brother.childs.length) {
-				child.childs[child.keys.length + 1] = brother.childs[0];
-				for (var l = 1; l < brother.keys.length + 1; l++)
-					brother.childs[l - 1] = brother.childs[l];
-				brother.childs.pop();
-			}
-			child.keys[child.keys.length] = node.keys[index];
-			child.items[child.items.length] = node.items[index];
-			node.keys[index] = brother.keys[0];
-			node.items[index] = brother.items[0];
-			for (var k = 1; k < brother.keys.length; k++) {
-				brother.keys[k - 1] = brother.keys[k];
-				brother.items[k - 1] = brother.items[k];
-			}
-			brother.keys.pop();
-			brother.items.pop();
-		} else {
-			if (index < node.keys.length) {
-				child.keys[this.t - 1] = node.keys[index];
-				child.items[this.t - 1] = node.items[index];
-				for (var m = index + 2; m < node.keys.length + 1; m++)
-					node.childs[m - 1] = node.childs[m];
-				node.childs.pop();
-				for (var n = index + 1; n < node.keys.length; n++) {
-					node.keys[n - 1] = node.keys[n];
-					node.items[n - 1] = node.items[n];
-				}
-				node.keys.pop();
-				node.items.pop();
-				if (brother.childs.length)
-					for (var y = 0; y < brother.keys.length + 1; y++)
-						child.childs[this.t + y] = brother.childs[y];
-				for (var x = 0; x < brother.keys.length; x++) {
-					child.keys[x + this.t] = brother.keys[x];
-					child.items[x + this.t] = brother.items[x];
-				}
-			} else {
-				if (brother.childs.length)
-					for (var w = 0; w < child.keys.length + 1; w++)
-						brother.childs[this.t + w] = child.childs[w];
-				brother.keys[this.t - 1] = node.keys[node.keys.length - 1];
-				brother.items[this.t - 1] = node.items[node.keys.length - 1];
-				for (var z = 0; z < child.keys.length; z++) {
-					brother.keys[z + this.t] = child.keys[z];
-					brother.items[z + this.t] = child.items[z];
-				}
-			}
-		}
-	}
-};
-
-/**
- * Checks if the tree contains the key.
- * @param key {number} The key to find.
- * @param [callback = function(node,index){return(node.keys[index]===key);}] The condition to satisfy. The callback must accept the current node to check and optionally the position of the key.
- * @return {boolean} True if the tree contains the key.
- */
-BTree.prototype.contains = function (key, callback) {
-	return this.search(key, null, callback) !== undefined;
-};
-
-/**
- * Checks if the tree contains a node that satisfy the condition represented by the callback function.
- * This method check all the tree avoiding the binary search.
- * @param callback {function} The condition to satisfy. The callback must accept the current node to check.
- * @return {boolean} True if the tree contains the node that satisfy the condition, false otherwise.
- */
-BTree.prototype.fullContains = function (callback) {
-	var key = this.minimumKey();
-	while (key !== null && !callback(this.search(key)))
-		key = this.successor(key);
-	return key !== null;
-};
-
-/**
- * Get the key next to the param node key.
- * @param key {number} The key of which search the successor.
- * @param [node = root] The node from start the search of the successor.
- * @return {number} The key found.
- */
-BTree.prototype.successor = function (key, node) {
-	node = node || this.root;
-	var i = 0, j = node.keys.length;
-	//search the key in the node
-	while (i < j) {
-		var m = Math.floor((i + j) / 2);
-		if (key <= node.keys[m])
-			j = m;
-		else
-			i = m + 1;
-	}
-	//check if the key has been found
-	if (node.keys[i] === key)
-	//in this case the successor is the next key
-		i++;
-	//if it's a leaf
-	if (!node.childs.length) {
-		//check if the key hasn't been found
-		if (i > node.keys.length - 1)
-			return null;
-		else
-			return node.keys[i];
-	}
-	//if it's not a leaf check if the successor is in the i-child
-	var successor = this.successor(key, node.childs[i]);
-	//if it's not in the child and has been found a key then return it
-	if (successor === null && i < node.keys.length)
-		return node.keys[i];
-	//return the value of the successor even if it's null
-	return successor;
-};
-
-/**
- * Get the key previous to the param key.
- * @param key {number} The key of which search the predecessor.
- * @param [node = root] The node from start the search of the predecessor.
- * @return {number} The key found.
- */
-BTree.prototype.predecessor = function (key, node) {
-	node = node || this.root;
-	var i = 0, j = node.keys.length;
-	//search the key in the node
-	while (i < j) {
-		var m = Math.floor((i + j) / 2);
-		if (key <= node.keys[m])
-			j = m;
-		else
-			i = m + 1;
-	}
-	i--;
-	//check if the node is a leaf
-	if (!node.childs.length) {
-		//check if a predecessor has been found
-		if (i < 0)
-			return null;
-		else
-			return node.keys[i];
-	}
-	var predecessor = this.predecessor(key, node.childs[i + 1]);
-	if (predecessor === null && key > node.keys[0]) {
-		return node.keys[i];
-	}
-	return predecessor;
-};
-
-/**
- * Gets the minimum key stored in the tree.
- * @return {number} The key found.
- */
-BTree.prototype.minimumKey = function () {
-	var node = this.root;
-	while (node.childs.length)
-		node = node.childs[0];
-	if (node)
-		return node.keys[0];
-	return null;
-};
-
-/**
- * Gets the maximum key stored in the tree.
- * @return {number} The key found.
- */
-BTree.prototype.maximumKey = function () {
-	var node = this.root;
-	while (node.childs.length)
-		node = node.childs[node.childs.length - 1];
-	if (node)
-		return node.keys[node.keys.length - 1];
-	return null;
-};
-
-/**
- * Gets the item relatives to the minimum key stored in the tree.
- * @return {number} The item found.
- */
-BTree.prototype.minimum = function () {
-	var node = this.root;
-	while (node.childs.length)
-		node = node.childs[0];
-	return node.items[0];
-};
-
-/**
- * Gets the item relatives to the maximum key stored in the tree.
- * @return {node} The item found.
- */
-BTree.prototype.maximum = function () {
-	var node = this.root;
-	while (node.childs.length)
-		node = node.childs[node.childs.length - 1];
-	return node.items[node.items.length - 1];
-};
-
-/**
- * Returns the size of the tree.
- * @return {number} The size of the tree.
- */
-BTree.prototype.getSize = function () {
-	return this.size;
-};
-
-/**
- * Checks if the tree is empty.
- * @return {boolean} True if the tree is empty, false otherwise.
- */
-BTree.prototype.isEmpty = function () {
-	return !this.size;
-};
-
-/**
- * Executes the callback function for each item of the tree.
- * This method modifies the tree so if you don't need to modify it you must return the same item of the array.
- * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
- * @return {void}
- */
-BTree.prototype.execute = function (callback) {
-	var node = arguments[1] || this.root;
-	for (var i = 0; i < node.items.length; i++)
-		node.items[i] = callback(node.items[i]);
-	for (var j = 0; j < node.childs.length; j++)
-		this.execute(callback, node.childs[j]);
-};
-
-/**
- * Removes all the items stored in the tree.
- * @return {void}
- */
-BTree.prototype.clear = function () {
-	this.root = null;
-	this.size = 0;
-};
-
-/**
- * Returns the items that satisfy the condition determined by the callback.
- * @param callback {function} The function that implements the condition.
- * @return {Array<*>} The array that contains the items that satisfy the condition.
- */
-BTree.prototype.filter = function (callback) {
-	var result = [];
-	var node = arguments[1] || this.root;
-	for (var i = 0; i < node.items.length; i++) {
-		if (node.childs.length)
-			result = result.concat(this.filter(callback, node.childs[i]));
-		if (callback(node.items[i]))
-			result.push(node.items[i]);
-	}
-	if (node.childs.length)
-		result = result.concat(this.filter(callback, node.childs[node.childs.length - 1]));
-	return result;
-};
-
-/**
- * Clones the tree into a new tree.
- * @return {BTree} The tree cloned from this tree.
- */
-BTree.prototype.clone = function () {
-	var tree = new BTree(this.t);
-	var it = this.getIterator();
-	for (it.first(); !it.isDone(); it.next()) {
-		var item = it.getItem();
-		if (item.clone)
-			item = item.clone();
-		tree.insert(it.getKey(), item);
-	}
-	return tree;
-};
-
-/**
- * Clones the tree into a new tree without cloning duplicated items.
- * @return {BTree} The tree cloned from this tree.
- */
-BTree.prototype.cloneDistinct = function () {
-	var tree = new BTree(this.t);
-	var it = this.getIterator();
-	for (it.first(); !it.isDone(); it.next()) {
-		var callback = function (item) {
-			return item === it.getItem();
-		};
-		if (!tree.fullContains(callback)) {
-			if (it.getItem().cloneDistinct)
-				tree.insert(it.getKey(), it.getItem().cloneDistinct());
-			else if (it.getItem().clone)
-				tree.insert(it.getKey(), it.getItem().clone());
-			else
-				tree.insert(it.getKey(), it.getItem());
-		}
-	}
-	return tree;
-};
-
-/**
- * Transform the tree into an array without preserving keys.
- * @return {Array<*>} The array that represents the tree.
- */
-BTree.prototype.toArray = function () {
-	var result = [];
-	var it = this.getIterator();
-	for (it.first(); !it.isDone(); it.next())
-		result.push(it.getItem());
-	return result;
-};
-
-/**
- * Returns the first position of the item in the tree.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The first position of the item.
- */
-BTree.prototype.indexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0, key = this.minimumKey();
-	while (key !== null) {
-		if (callback(this.search(key)))
-			return i;
-		key = this.successor(key);
-		i++;
-	}
-	return -1;
-};
-
-/**
- * Returns the last position of the item in the tree.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The last position of the item.
- */
-BTree.prototype.lastIndexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = this.size - 1, key = this.maximumKey();
-	while (key !== null) {
-		if (callback(this.search(key)))
-			return i;
-		i--;
-		key = this.predecessor(key);
-	}
-	return -1;
-};
-
-/**
- * Returns all the position in which the item has been found in the tree.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {Array<number>} The positions in which the item has been found.
- */
-BTree.prototype.allIndexesOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0, key = this.minimumKey();
-	var indexes = [];
-	while (key !== null) {
-		if (callback(this.search(key)))
-			indexes.push(i);
-		i++;
-		key = this.successor(key);
-	}
-	return indexes;
-};
-
-/**
- * Returns the item at the position index.
- * @param index {number} The position of the item.
- * @return {*} The item at the position. It's undefined if index isn't in the tree bounds.
- */
-BTree.prototype.getItem = function (index) {
-	if (index < 0 || index > this.size - 1)
-		return undefined;
-	var key = this.minimum();
-	for (var i = 0; i < index; i++)
-		key = this.successor(key);
-	return this.search(key);
-};
\ No newline at end of file
diff --git a/lib/BTree/BTree.ts b/lib/BTree/BTree.ts
new file mode 100644
index 0000000..60f1179
--- /dev/null
+++ b/lib/BTree/BTree.ts
@@ -0,0 +1,779 @@
+
+/**
+ * Created by Stefano on 08/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+namespace ds
+{
+	export class BNode<T>
+	{
+		/**
+		 * The keys stored it the node.
+		 * @type {Array<*>}
+		 */
+		keys: number[] = [];
+		/**
+		 * The items stored in the node.
+		 * @type {Array<*>}
+		 */
+		items: T[] = [];
+		/**
+		 * The nodes child of the node.
+		 * @type {Array<BNode>}
+		 */
+		childs: BNode<T>[] = [];
+		/**
+		 * The single node of the tree.
+		 * @constructor
+		 */
+		constructor()
+		{
+		}
+	}
+
+	export class BTree<T> extends Aggregate
+	{
+		/**
+		 * The root of the tree.
+		 * @type {BNode}
+		 */
+		root = new BNode<T>();
+
+		/**
+		 * The minimum number of the keys of a node.
+		 * @type {number}
+		 */
+		t: number;
+
+		/**
+		 * The number of items stored in the tree.
+		 * @type {number}
+		 */
+		size = 0;
+
+		/**
+		 * Class for managing a B-Tree.
+		 * @param minimumDegree {number} The minimum number of keys of a node.
+		 * @constructor
+		 */
+		constructor(minimumDegree: number = 0)
+		{
+			super();
+
+			this.t = minimumDegree;
+		}
+
+		/**
+		 * @inheritDoc
+		 */
+		getIterator()
+		{
+			return new BTreeIterator<T>(this);
+		};
+
+		/**
+		 * Insert the item relatives to the key value in the tree.
+		 * @param key {number} The key to store.
+		 * @param item {*} The item to store.
+		 * @return {void}
+		 */
+		insert(key: number, item: T)
+		{
+			var node = this.root;
+			if (node.keys.length === 2 * this.t - 1)
+			{
+				var newNode = new BNode<T>();
+				newNode.childs.push(node);
+				this.root = newNode;
+				this.splitChild(newNode, 0);
+				node = newNode;
+			}
+			this.size++;
+			this.insertNonFull(node, key, item);
+		};
+
+		/**
+		 * Insert the new node in the right position if the node is not full.
+		 * @param node {BNode} The node from which start to check the insertion.
+		 * @param key {number} The key to store.
+		 * @param item {*} The item to store.
+		 * @return {void}
+		 */
+		insertNonFull(node: BNode<T>, key: number, item: T)
+		{
+			while (node)
+			{
+				var i = node.keys.length - 1;
+				if (!node.childs.length)
+				{
+					for (; i > -1 && key < node.keys[i]; i--)
+					{
+						node.keys[i + 1] = node.keys[i];
+						node.items[i + 1] = node.items[i];
+					}
+					node.keys[i + 1] = key;
+					node.items[i + 1] = item;
+					return;
+				} else
+				{
+					var j = 0;
+					i++;
+					while (j < i)
+					{
+						var m = Math.floor((j + i) / 2);
+						if (key <= node.keys[m])
+							i = m;
+						else
+							j = m + 1;
+					}
+					if (node.childs[j].keys.length === 2 * this.t - 1)
+					{
+						this.splitChild(node, j);
+						if (key > node.keys[j])
+							j++;
+					}
+					node = node.childs[j];
+				}
+			}
+		};
+
+		/**
+		 * Search the item relatives to the key that satisfy the condition represented by the callback function.
+		 * @param key {Number} The key to find.
+		 * @param [node = root] {RBNode} The node from which start the search.
+		 * @param [callback = function(node,index){return(node.keys[index]===key);}] The condition to satisfy. The callback must accept the current node to check and optionally the position of the key.
+		 * @return {*} The item found or undefined if there isn't the key in the tree.
+		 */
+		search(key: number, node?: BNode<T>, callback?: (node: BNode<T>, index: number) => boolean): T
+		{
+			node = node || this.root;
+			callback = callback || function (node, index)
+			{
+				return node.keys[index] === key;
+			};
+			while (node)
+			{
+				var n = node.keys.length;
+				var i = 0, j = n;
+				while (i < j)
+				{
+					var m = Math.floor((i + j) / 2);
+					if (key <= node.keys[m])
+						j = m;
+					else
+						i = m + 1;
+				}
+				if (i < n && callback(node, i))
+					return node.items[i];
+				else if (!node.childs.length)
+					return <any>undefined;
+				else
+					node = node.childs[i];
+			}
+			return <any>undefined;
+		};
+
+		/**
+		 * Split the child of the node at the position index.
+		 * @param node {BNode} The parent of the child to split.
+		 * @param index {number} The position of the child to split.
+		 * @return {void}
+		 */
+		splitChild(node: BNode<T>, index: number)
+		{
+			var newNode = new BNode<T>();
+			var child = node.childs[index];
+			//copy of the last t - 1 keys and items in the new node
+			for (var i = 0; i < this.t - 1; i++)
+			{
+				newNode.keys[i] = child.keys[i + this.t];
+				newNode.items[i] = child.items[i + this.t];
+			}
+			if (child.childs.length)
+				//copy of the last t child in the new node
+				for (var j = 0; j < this.t; j++)
+					newNode.childs[j] = child.childs[j + this.t];
+			//shift the children from index + 1 position
+			for (var l = node.keys.length; l > index; l--)
+				node.childs[l + 1] = node.childs[l];
+			//set the index position as the position t of the child
+			node.childs[index + 1] = newNode;
+			//shift the keys and the items from index position
+			for (var k = node.keys.length - 1; k > index - 1; k--)
+			{
+				node.keys[k + 1] = node.keys[k];
+				node.items[k + 1] = node.items[k];
+			}
+			node.keys[index] = child.keys[this.t - 1];
+			node.items[index] = child.items[this.t - 1];
+			//remove keys, items and child in the old node.
+			child.keys.splice(child.keys.length - this.t);
+			child.items.splice(child.items.length - this.t);
+			child.childs.splice(child.childs.length - this.t);
+		};
+
+		/**
+		 * Delete the key from the tree.
+		 * @param key {*} The key to delete.
+		 * @return {void}
+		 */
+		deleteKey(key: number)
+		{
+			if (this.root.keys.length)
+			{
+				this.deleteNonMin(this.root, key);
+				if (!this.root.keys.length && this.root.childs.length)
+					this.root = this.root.childs[0];
+				this.size--;
+			}
+		};
+
+		/**
+		 * Deletes a node that's a number of keys greater than the minimum for a node.
+		 * @param node {BNode} The node to delete.
+		 * @param key {number} The key to delete.
+		 * @return {void}
+		 */
+		deleteNonMin(node: BNode<T>, key: number)
+		{
+			var i = 0, j = node.keys.length;
+			while (i < j)
+			{
+				var m = Math.floor((i + j) / 2);
+				if (key <= node.keys[m])
+					j = m;
+				else
+					i = m + 1;
+			}
+			//key is in the node
+			if (i < node.keys.length && key === node.keys[i])
+			{
+				//the node is a leaf
+				if (!node.childs.length)
+				{
+					//remove the key
+					for (j = i + 1; j < node.keys.length; j++)
+					{
+						node.keys[j - 1] = node.keys[j];
+						node.items[j - 1] = node.items[j];
+					}
+					node.keys.pop();
+					node.items.pop();
+				} else
+				{
+					//the node is not a leaf
+					//the node has the minimum number of keys
+					if (node.childs[i].length === this.t - 1)
+					{
+						//increase the number of the keys of the node
+						this.augmentChild(node, i);
+						if (i === node.keys.length + 1)
+							i--;
+					}
+					//check if the key is moved in the child
+					if (node.keys[i] !== key)
+						this.deleteNonMin(node.childs[i], key);
+					else
+						this.deleteMax(node, i);
+				}
+				//the key is not in the node
+			} else
+			{
+				//check if the child i has the minimum number of keys
+				if (node.childs[i].keys.length === this.t - 1)
+				{
+					this.augmentChild(node, i);
+					if (i === node.keys.length + 2)
+						i--;
+				}
+				this.deleteNonMin(node.childs[i], key);
+			}
+		};
+
+		/**
+		 * Deletes a node that have the maximum number of keys for node.
+		 * @param node {BNode} The node to delete.
+		 * @param index {number} The key to delete in the node.
+		 * @return {void}
+		 */
+		deleteMax(node: BNode<T>, index: number)
+		{
+			var child = node.childs[index];
+			var goAhead = true;
+			while (goAhead)
+			{
+				if (!child.childs.length)
+				{
+					node.keys[index] = child.keys[child.keys.length - 1];
+					node.items[index] = child.items[child.items.length - 1];
+					child.keys.pop();
+					child.items.pop();
+					goAhead = false;
+				} else
+				{
+					var last = child.childs[child.keys.length];
+					if (last.keys.length === this.t - 1)
+						this.augmentChild(child, child.keys.length);
+					child = child.childs[child.keys.length];
+				}
+			}
+		};
+
+		/**
+		 * Augments the number of keys stored in the node preserving the order.
+		 * @param node {BNode} The node to delete.
+		 * @param index {number} The index of the position to augment.
+		 * @return {void}
+		 */
+		augmentChild(node: BNode<T>, index: number)
+		{
+			var child = node.childs[index];
+			var brother: BNode<T> = <any>null;
+			if (index)
+				brother = node.childs[index - 1];
+			if (index && brother.keys.length > this.t - 1)
+			{
+				if (child.childs.length)
+				{
+					for (var j = this.keys.length + 1; j > 0; j--)
+						child.childs[j] = child.childs[j - 1];
+					child.childs[0] = brother.childs[brother.keys.length];
+					for (var i = child.keys.length; i > 0; i--)
+					{
+						child.keys[i] = child.keys[i - 1];
+						child.items[i] = child.items[i - 1];
+					}
+					child.keys[0] = node.keys[index - 1];
+					child.items[0] = node.items[index - 1];
+					node.keys[index - 1] = brother.keys[brother.keys.length - 1];
+					node.items[index - 1] = brother.items[brother.items.length - 1];
+				}
+			} else
+			{
+				if (index < node.keys.length)
+					brother = node.childs[index + 1];
+				if (index < node.keys.length && brother.keys.length > this.t - 1)
+				{
+					if (brother.childs.length)
+					{
+						child.childs[child.keys.length + 1] = brother.childs[0];
+						for (var l = 1; l < brother.keys.length + 1; l++)
+							brother.childs[l - 1] = brother.childs[l];
+						brother.childs.pop();
+					}
+					child.keys[child.keys.length] = node.keys[index];
+					child.items[child.items.length] = node.items[index];
+					node.keys[index] = brother.keys[0];
+					node.items[index] = brother.items[0];
+					for (var k = 1; k < brother.keys.length; k++)
+					{
+						brother.keys[k - 1] = brother.keys[k];
+						brother.items[k - 1] = brother.items[k];
+					}
+					brother.keys.pop();
+					brother.items.pop();
+				} else
+				{
+					if (index < node.keys.length)
+					{
+						child.keys[this.t - 1] = node.keys[index];
+						child.items[this.t - 1] = node.items[index];
+						for (var m = index + 2; m < node.keys.length + 1; m++)
+							node.childs[m - 1] = node.childs[m];
+						node.childs.pop();
+						for (var n = index + 1; n < node.keys.length; n++)
+						{
+							node.keys[n - 1] = node.keys[n];
+							node.items[n - 1] = node.items[n];
+						}
+						node.keys.pop();
+						node.items.pop();
+						if (brother.childs.length)
+							for (var y = 0; y < brother.keys.length + 1; y++)
+								child.childs[this.t + y] = brother.childs[y];
+						for (var x = 0; x < brother.keys.length; x++)
+						{
+							child.keys[x + this.t] = brother.keys[x];
+							child.items[x + this.t] = brother.items[x];
+						}
+					} else
+					{
+						if (brother.childs.length)
+							for (var w = 0; w < child.keys.length + 1; w++)
+								brother.childs[this.t + w] = child.childs[w];
+						brother.keys[this.t - 1] = node.keys[node.keys.length - 1];
+						brother.items[this.t - 1] = node.items[node.keys.length - 1];
+						for (var z = 0; z < child.keys.length; z++)
+						{
+							brother.keys[z + this.t] = child.keys[z];
+							brother.items[z + this.t] = child.items[z];
+						}
+					}
+				}
+			}
+		};
+
+		/**
+		 * Checks if the tree contains the key.
+		 * @param key {number} The key to find.
+		 * @param [callback = function(node,index){return(node.keys[index]===key);}] The condition to satisfy. The callback must accept the current node to check and optionally the position of the key.
+		 * @return {boolean} True if the tree contains the key.
+		 */
+		contains(key: number, callback?: (node: BNode<T>, index: number) => boolean)
+		{
+			return this.search(key, <any>null, callback) !== undefined;
+		};
+
+		/**
+		 * Checks if the tree contains a node that satisfy the condition represented by the callback function.
+		 * This method check all the tree avoiding the binary search.
+		 * @param callback {function} The condition to satisfy. The callback must accept the current node to check.
+		 * @return {boolean} True if the tree contains the node that satisfy the condition, false otherwise.
+		 */
+		fullContains(callback: (item: T) => boolean)
+		{
+			var key = this.minimumKey();
+			while (key !== -1 && !callback(this.search(key)))
+				key = this.successor(key);
+			return key !== -1;
+		};
+
+		/**
+		 * Get the key next to the param node key.
+		 * @param key {number} The key of which search the successor.
+		 * @param [node = root] The node from start the search of the successor.
+		 * @return {number} The key found.
+		 */
+		successor(key: number, node?: BNode<T>): number
+		{
+			node = node || this.root;
+			var i = 0, j = node.keys.length;
+			//search the key in the node
+			while (i < j)
+			{
+				var m = Math.floor((i + j) / 2);
+				if (key <= node.keys[m])
+					j = m;
+				else
+					i = m + 1;
+			}
+			//check if the key has been found
+			if (node.keys[i] === key)
+				//in this case the successor is the next key
+				i++;
+			//if it's a leaf
+			if (!node.childs.length)
+			{
+				//check if the key hasn't been found
+				if (i > node.keys.length - 1)
+					return -1;
+				else
+					return node.keys[i];
+			}
+			//if it's not a leaf check if the successor is in the i-child
+			var successor = this.successor(key, node.childs[i]);
+			//if it's not in the child and has been found a key then return it
+			if (successor === -1 && i < node.keys.length)
+				return node.keys[i];
+			//return the value of the successor even if it's null
+			return successor;
+		};
+
+		/**
+		 * Get the key previous to the param key.
+		 * @param key {number} The key of which search the predecessor.
+		 * @param [node = root] The node from start the search of the predecessor.
+		 * @return {number} The key found.
+		 */
+		predecessor(key: number, node?: BNode<T>): number
+		{
+			node = node || this.root;
+			var i = 0, j = node.keys.length;
+			//search the key in the node
+			while (i < j)
+			{
+				var m = Math.floor((i + j) / 2);
+				if (key <= node.keys[m])
+					j = m;
+				else
+					i = m + 1;
+			}
+			i--;
+			//check if the node is a leaf
+			if (!node.childs.length)
+			{
+				//check if a predecessor has been found
+				if (i < 0)
+					return -1;
+				else
+					return node.keys[i];
+			}
+			var predecessor = this.predecessor(key, node.childs[i + 1]);
+			if (predecessor === -1 && key > node.keys[0])
+			{
+				return node.keys[i];
+			}
+			return predecessor;
+		};
+
+		/**
+		 * Gets the minimum key stored in the tree.
+		 * @return {number} The key found.
+		 */
+		minimumKey()
+		{
+			var node = this.root;
+			while (node.childs.length)
+				node = node.childs[0];
+			if (node)
+				return node.keys[0];
+			return -1;
+		};
+
+		/**
+		 * Gets the maximum key stored in the tree.
+		 * @return {number} The key found.
+		 */
+		maximumKey()
+		{
+			var node = this.root;
+			while (node.childs.length)
+				node = node.childs[node.childs.length - 1];
+			if (node)
+				return node.keys[node.keys.length - 1];
+			return -1;
+		};
+
+		/**
+		 * Gets the item relatives to the minimum key stored in the tree.
+		 * @return {number} The item found.
+		 */
+		minimum()
+		{
+			var node = this.root;
+			while (node.childs.length)
+				node = node.childs[0];
+			return node.items[0];
+		};
+
+		/**
+		 * Gets the item relatives to the maximum key stored in the tree.
+		 * @return {node} The item found.
+		 */
+		maximum()
+		{
+			var node = this.root;
+			while (node.childs.length)
+				node = node.childs[node.childs.length - 1];
+			return node.items[node.items.length - 1];
+		};
+
+		/**
+		 * Returns the size of the tree.
+		 * @return {number} The size of the tree.
+		 */
+		getSize()
+		{
+			return this.size;
+		};
+
+		/**
+		 * Checks if the tree is empty.
+		 * @return {boolean} True if the tree is empty, false otherwise.
+		 */
+		isEmpty()
+		{
+			return !this.size;
+		};
+
+		/**
+		 * Executes the callback function for each item of the tree.
+		 * This method modifies the tree so if you don't need to modify it you must return the same item of the array.
+		 * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+		 * @return {void}
+		 */
+		execute(callback: (item: T) => T, node?: BNode<T>)
+		{
+			node = node || this.root;
+			for (var i = 0; i < node.items.length; i++)
+				node.items[i] = callback(node.items[i]);
+			for (var j = 0; j < node.childs.length; j++)
+				this.execute(callback, node.childs[j]);
+		};
+
+		/**
+		 * Removes all the items stored in the tree.
+		 * @return {void}
+		 */
+		clear()
+		{
+			this.root = <any>null;
+			this.size = 0;
+		};
+
+		/**
+		 * Returns the items that satisfy the condition determined by the callback.
+		 * @param callback {function} The function that implements the condition.
+		 * @return {Array<*>} The array that contains the items that satisfy the condition.
+		 */
+		filter(callback: (item: T) => boolean, node?: BNode<T>)
+		{
+			var result: T[] = [];
+			node = node || this.root;
+			for (var i = 0; i < node.items.length; i++)
+			{
+				if (node.childs.length)
+					result = result.concat(this.filter(callback, node.childs[i]));
+				if (callback(node.items[i]))
+					result.push(node.items[i]);
+			}
+			if (node.childs.length)
+				result = result.concat(this.filter(callback, node.childs[node.childs.length - 1]));
+			return result;
+		};
+
+		/**
+		 * Clones the tree into a new tree.
+		 * @return {BTree} The tree cloned from this tree.
+		 */
+		clone()
+		{
+			var tree = new BTree(this.t);
+			var it = this.getIterator();
+			for (it.first(); !it.isDone(); it.next())
+			{
+				var item: any = it.getItem();
+				if (item["clone"])
+					item = item["clone"]();
+				tree.insert(it.getKey(), item);
+			}
+			return tree;
+		};
+
+		/**
+		 * Clones the tree into a new tree without cloning duplicated items.
+		 * @return {BTree} The tree cloned from this tree.
+		 */
+		cloneDistinct()
+		{
+			var tree = new BTree<T>(this.t);
+			var it = this.getIterator();
+			for (it.first(); !it.isDone(); it.next())
+			{
+				var callback = function (item: T)
+				{
+					return item === it.getItem();
+				};
+				if (!tree.fullContains(callback))
+				{
+					var item: any = it.getItem();
+					if (item.cloneDistinct)
+						tree.insert(it.getKey(), item.cloneDistinct());
+					else if (item.clone)
+						tree.insert(it.getKey(), item.clone());
+					else
+						tree.insert(it.getKey(), item);
+				}
+			}
+			return tree;
+		};
+
+		/**
+		 * Transform the tree into an array without preserving keys.
+		 * @return {Array<*>} The array that represents the tree.
+		 */
+		toArray()
+		{
+			var result = [];
+			var it = this.getIterator();
+			for (it.first(); !it.isDone(); it.next())
+				result.push(it.getItem());
+			return result;
+		};
+
+		/**
+		 * Returns the first position of the item in the tree.
+		 * @param item {*} The item to search.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {number} The first position of the item.
+		 */
+		indexOf(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var i = 0, key = this.minimumKey();
+			while (key !== -1)
+			{
+				if (callback(this.search(key)))
+					return i;
+				key = this.successor(key);
+				i++;
+			}
+			return -1;
+		};
+
+		/**
+		 * Returns the last position of the item in the tree.
+		 * @param item {*} The item to search.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {number} The last position of the item.
+		 */
+		lastIndexOf(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var i = this.size - 1, key = this.maximumKey();
+			while (key !== -1)
+			{
+				if (callback(this.search(key)))
+					return i;
+				i--;
+				key = this.predecessor(key);
+			}
+			return -1;
+		};
+
+		/**
+		 * Returns all the position in which the item has been found in the tree.
+		 * @param item {*} The item to search.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {Array<number>} The positions in which the item has been found.
+		 */
+		allIndexesOf(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var i = 0, key = this.minimumKey();
+			var indexes = [];
+			while (key !== -1)
+			{
+				if (callback(this.search(key)))
+					indexes.push(i);
+				i++;
+				key = this.successor(key);
+			}
+			return indexes;
+		};
+
+		/**
+		 * Returns the item at the position index.
+		 * @param index {number} The position of the item.
+		 * @return {*} The item at the position. It's undefined if index isn't in the tree bounds.
+		 */
+		getItem(index: number)
+		{
+			if (index < 0 || index > this.size - 1)
+				return undefined;
+			var key: number = <any>this.minimum();
+			for (var i = 0; i < index; i++)
+				key = this.successor(key);
+			return this.search(key);
+		};
+	}
+}
\ No newline at end of file
diff --git a/lib/BTree/BTreeIterator.js b/lib/BTree/BTreeIterator.js
deleted file mode 100644
index d357113..0000000
--- a/lib/BTree/BTreeIterator.js
+++ /dev/null
@@ -1,76 +0,0 @@
-/**
- * Created by Stefano on 06/04/2014.
- */
-
-BTreeIterator.prototype = new Iterator();
-BTreeIterator.prototype.constructor = BTreeIterator;
-
-/**
- * Class that implements the iterator for a binary search tree.
- * @param aggregate {BTree} The aggregate to scan.
- * @constructor
- */
-function BTreeIterator(aggregate) {
-	/**
-	 * The aggregate relates to this iterator.
-	 * @type {BTree}
-	 */
-	this.aggregate = aggregate;
-
-	/**
-	 * The pointer to the position.
-	 * @type {number}
-	 */
-	this.pointer = null;
-}
-
-/**
- * @inheritDoc
- */
-BTreeIterator.prototype.first = function () {
-	this.pointer = this.aggregate.minimumKey();
-};
-
-/**
- * @inheritDoc
- */
-BTreeIterator.prototype.next = function () {
-	this.pointer = this.aggregate.successor(this.pointer);
-};
-
-/**
- * @inheritDoc
- */
-BTreeIterator.prototype.last = function () {
-	this.pointer = this.aggregate.maximumKey();
-};
-
-/**
- * @inheritDoc
- */
-BTreeIterator.prototype.previous = function () {
-	this.pointer = this.aggregate.predecessor(this.pointer);
-};
-
-/**
- * @inheritDoc
- */
-BTreeIterator.prototype.isDone = function () {
-	return this.pointer === null;
-};
-
-/**
- * @inheritDoc
- */
-BTreeIterator.prototype.getItem = function () {
-	return this.aggregate.search(this.pointer);
-};
-
-/**
- * Return the key stored at the position pointed by the iterator.
- * @abstract
- * @return {number} The key stored or null if it's out of the bounds.
- */
-BTreeIterator.prototype.getKey = function () {
-	return this.pointer;
-};
\ No newline at end of file
diff --git a/lib/BTree/BTreeIterator.ts b/lib/BTree/BTreeIterator.ts
new file mode 100644
index 0000000..9491afb
--- /dev/null
+++ b/lib/BTree/BTreeIterator.ts
@@ -0,0 +1,89 @@
+/**
+ * Created by Stefano on 06/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+namespace ds
+{
+	export class BTreeIterator<T> implements Iterator
+	{
+		/**
+		 * The aggregate relates to this iterator.
+		 * @type {BTree}
+		 */
+		aggregate: BTree<T>;
+
+		/**
+		 * The pointer to the position.
+		 * @type {number}
+		 */
+		pointer: number = -1;
+
+		/**
+		 * Class that implements the iterator for a binary search tree.
+		 * @param aggregate {BTree} The aggregate to scan.
+		 * @constructor
+		 */
+		constructor(aggregate: BTree<T>)
+		{
+			this.aggregate = aggregate;
+		}
+
+		/**
+		 * @inheritDoc
+		 */
+		first()
+		{
+			this.pointer = this.aggregate.minimumKey();
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		next()
+		{
+			this.pointer = this.aggregate.successor(this.pointer);
+		}
+
+		/**
+		 * @inheritDoc
+		 */
+		last()
+		{
+			this.pointer = this.aggregate.maximumKey();
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		previous()
+		{
+			this.pointer = this.aggregate.predecessor(this.pointer);
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		isDone()
+		{
+			return this.pointer === -1;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		getItem()
+		{
+			return this.aggregate.search(this.pointer);
+		};
+
+		/**
+		 * Return the key stored at the position pointed by the iterator.
+		 * @abstract
+		 * @return {number} The key stored or null if it's out of the bounds.
+		 */
+		getKey()
+		{
+			return this.pointer;
+		};
+	}
+}
\ No newline at end of file
diff --git a/lib/CircularBuffer/CircularBuffer.js b/lib/CircularBuffer/CircularBuffer.js
deleted file mode 100644
index 5719cab..0000000
--- a/lib/CircularBuffer/CircularBuffer.js
+++ /dev/null
@@ -1,201 +0,0 @@
-/**
- * Created by Stefano on 31/03/14.
- */
-
-CircularBuffer.prototype = new Aggregate();
-CircularBuffer.prototype.constructor = CircularBuffer;
-
-/**
- * Class for managing a circular buffer.
- * @param size {Number} The size of the buffer.
- * @constructor
- */
-function CircularBuffer(size) {
-	/**
-	 * The index of the position of the head of the buffer.
-	 * @type {number}
-	 */
-	this.head = 0;
-	/**
-	 * The index of the position of the tail of the buffer.
-	 * @type {number}
-	 */
-	this.tail = 0;
-	/**
-	 * The items stored in the buffer.
-	 * @type {Array<*>}
-	 */
-	this.items = new Array(size);
-	/**
-	 * Is true if buffer is empty, false otherwise.
-	 * @type {boolean}
-	 */
-	this.empty = true;
-	/**
-	 * Is false if buffer is full, false otherwise.
-	 * @type {boolean}
-	 */
-	this.full = false;
-	/**
-	 * The size of the buffer.
-	 * @type {Number}
-	 */
-	this.size = size;
-}
-
-/**
- * @inheritDoc
- */
-CircularBuffer.prototype.getIterator = function () {
-	return new CircularBufferIterator(this);
-};
-
-/**
- * Write the item at the head of the buffer.
- * @param item {*} The item to write.
- * @return {void}
- */
-CircularBuffer.prototype.write = function (item) {
-	this.empty = false;
-	if (this.full)
-	//if buffer is full tail must be set forward
-		this.tail = (this.tail + 1) % this.size;
-	this.items[this.head] = item;
-	//head is set forward
-	this.head = (this.head + 1) % this.size;
-	if (this.tail === this.head)
-		this.full = true;
-};
-
-/**
- * Free the buffer between indexes from and to.
- * If from > to, positions between from and the end of the buffer and between the start and to will be free.
- * @param from {Number} The index from which start to free (inclusive index)
- * @param to {Number} The index where stop to free (exclusive index)
- * @return {void}
- */
-CircularBuffer.prototype.free = function (from, to) {
-	if (from < 0)
-		from = 0;
-	if (from > this.size - 1)
-		from = this.size - 1;
-	if (to < 0)
-		to = 0;
-	if (to > this.size - 1)
-		to = this.size - 1;
-	//if from < to then will be free allocation between from and to
-	//otherwise will be free allocations between from and the end and between the start and to
-	for (var i = from; i < to; i = (i + 1) % this.size)
-		delete this.items[i];
-
-	//adjust the position of the tail and of the head
-	if (this.tail > from - 1 || this.tail < to)
-		if (this.tail < this.head) {
-			this.tail = (from - 1) % this.size;
-		} else {
-			this.tail = to;
-		}
-	if (this.head > from || this.head < to)
-		if (this.tail < this.head) {
-			this.head = to;
-		} else {
-			this.head = from;
-		}
-	//check if something is free
-	if (from !== to)
-		this.full = false;
-	//free could make buffer empty
-	for (var j = 0; j < this.size; j++)
-		if (this.items[j] !== undefined) {
-			this.empty = false;
-			return;
-		}
-	this.empty = true;
-};
-
-/**
- * Free all the buffer.
- * @return {void}
- */
-CircularBuffer.prototype.freeAll = function () {
-	for (var i = 0; i < this.size; i++)
-		delete this.items[i];
-	this.empty = true;
-	this.head = 0;
-	this.tail = 0;
-};
-
-/**
- * Read the item stored at the position index.
- * @param index {Number} The position of the item to read.
- * @return {*} The item read.
- */
-CircularBuffer.prototype.read = function (index) {
-	return this.items[index % this.size];
-};
-
-/**
- * Return true if the buffer is empty, false otherwise.
- * @return {boolean}
- */
-CircularBuffer.prototype.isEmpty = function () {
-	return this.empty;
-};
-
-/**
- * Return true if the buffer is full, false otherwise.
- * @return {boolean}
- */
-CircularBuffer.prototype.isFull = function () {
-	return this.full;
-};
-
-/**
- * Clones the circular buffer into a new circular buffer.
- * @return {CircularBuffer} The circular buffer cloned from this circular buffer.
- */
-CircularBuffer.prototype.clone = function () {
-	var buffer = new CircularBuffer(this.size);
-	buffer.head = this.head;
-	buffer.tail = this.tail;
-	for (var i = 0; i < this.items.length; i++)
-		buffer.items[i] = this.items[i];
-	buffer.empty = this.empty;
-	buffer.full = this.full;
-	return buffer;
-};
-
-/**
- * Resize the buffer.
- * @param size {number} The new size of the buffer.
- * @return {void}
- */
-CircularBuffer.prototype.resize = function (size) {
-	if (this.size < size) {
-		if (this.head < this.tail + 1) {
-			for (var i = 0; i < this.head; i++) {
-				this.items[(i + this.size) % size] = this.items[i];
-				delete this.items[i];
-			}
-			this.head = (this.head + this.size) % size;
-		}
-	} else if (this.size > size) {
-		if (this.head < this.tail + 1) {
-			//check if the tail is after the size
-			var start = size;
-			if (this.tail > size - 1) {
-				start = this.tail;
-				this.tail = 0;
-			}
-			//the items stored must be shift to a valid position
-			var step = this.size - start;
-			for (var j = this.head - step - 1; j > start - 1 || j < this.head - step; j--) {
-				this.items[(j + step) % this.size] = this.items[j];
-				if (!j)
-					j = this.size;
-			}
-			this.head = (this.head + step) % this.size;
-		}
-	}
-	this.size = size;
-};
\ No newline at end of file
diff --git a/lib/CircularBuffer/CircularBuffer.ts b/lib/CircularBuffer/CircularBuffer.ts
new file mode 100644
index 0000000..18bd463
--- /dev/null
+++ b/lib/CircularBuffer/CircularBuffer.ts
@@ -0,0 +1,232 @@
+/**
+ * Created by Stefano on 31/03/14.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+namespace ds
+{
+	export class CircularBuffer<T> extends Aggregate
+	{
+
+		/**
+		 * The index of the position of the head of the buffer.
+		 * @type {number}
+		 */
+		head = 0;
+		/**
+		 * The index of the position of the tail of the buffer.
+		 * @type {number}
+		 */
+		tail = 0;
+		/**
+		 * The items stored in the buffer.
+		 * @type {Array<*>}
+		 */
+		items: T[] = [];
+		/**
+		 * Is true if buffer is empty, false otherwise.
+		 * @type {boolean}
+		 */
+		empty = true;
+		/**
+		 * Is false if buffer is full, false otherwise.
+		 * @type {boolean}
+		 */
+		full = false;
+		/**
+		 * The size of the buffer.
+		 * @type {Number}
+		 */
+		size: number;
+
+		/**
+		 * Class for managing a circular buffer.
+		 * @param size {Number} The size of the buffer.
+		 * @constructor
+		 */
+		constructor(size: number)
+		{
+			super();
+			this.size = size;
+			this.items.length = size;
+		}
+
+		/**
+		 * @inheritDoc
+		 */
+		getIterator()
+		{
+			return new CircularBufferIterator<T>(this);
+		};
+
+		/**
+		 * Write the item at the head of the buffer.
+		 * @param item {*} The item to write.
+		 * @return {void}
+		 */
+		write(item: T)
+		{
+			this.empty = false;
+			if (this.full)
+				//if buffer is full tail must be set forward
+				this.tail = (this.tail + 1) % this.size;
+			this.items[this.head] = item;
+			//head is set forward
+			this.head = (this.head + 1) % this.size;
+			if (this.tail === this.head)
+				this.full = true;
+		};
+
+		/**
+		 * Free the buffer between indexes from and to.
+		 * If from > to, positions between from and the end of the buffer and between the start and to will be free.
+		 * @param from {Number} The index from which start to free (inclusive index)
+		 * @param to {Number} The index where stop to free (exclusive index)
+		 * @return {void}
+		 */
+		free(from: number, to: number)
+		{
+			if (from < 0)
+				from = 0;
+			if (from > this.size - 1)
+				from = this.size - 1;
+			if (to < 0)
+				to = 0;
+			if (to > this.size - 1)
+				to = this.size - 1;
+			//if from < to then will be free allocation between from and to
+			//otherwise will be free allocations between from and the end and between the start and to
+			for (var i = from; i < to; i = (i + 1) % this.size)
+				delete this.items[i];
+
+			//adjust the position of the tail and of the head
+			if (this.tail > from - 1 || this.tail < to)
+				if (this.tail < this.head)
+				{
+					this.tail = (from - 1) % this.size;
+				} else
+				{
+					this.tail = to;
+				}
+			if (this.head > from || this.head < to)
+				if (this.tail < this.head)
+				{
+					this.head = to;
+				} else
+				{
+					this.head = from;
+				}
+			//check if something is free
+			if (from !== to)
+				this.full = false;
+			//free could make buffer empty
+			for (var j = 0; j < this.size; j++)
+				if (this.items[j] !== undefined)
+				{
+					this.empty = false;
+					return;
+				}
+			this.empty = true;
+		};
+
+		/**
+		 * Free all the buffer.
+		 * @return {void}
+		 */
+		freeAll()
+		{
+			for (var i = 0; i < this.size; i++)
+				delete this.items[i];
+			this.empty = true;
+			this.head = 0;
+			this.tail = 0;
+		};
+
+		/**
+		 * Read the item stored at the position index.
+		 * @param index {Number} The position of the item to read.
+		 * @return {*} The item read.
+		 */
+		read(index: number)
+		{
+			return this.items[index % this.size];
+		};
+
+		/**
+		 * Return true if the buffer is empty, false otherwise.
+		 * @return {boolean}
+		 */
+		isEmpty()
+		{
+			return this.empty;
+		};
+
+		/**
+		 * Return true if the buffer is full, false otherwise.
+		 * @return {boolean}
+		 */
+		isFull()
+		{
+			return this.full;
+		};
+
+		/**
+		 * Clones the circular buffer into a new circular buffer.
+		 * @return {CircularBuffer} The circular buffer cloned from this circular buffer.
+		 */
+		clone()
+		{
+			var buffer = new CircularBuffer<T>(this.size);
+			buffer.head = this.head;
+			buffer.tail = this.tail;
+			for (var i = 0; i < this.items.length; i++)
+				buffer.items[i] = this.items[i];
+			buffer.empty = this.empty;
+			buffer.full = this.full;
+			return buffer;
+		};
+
+		/**
+		 * Resize the buffer.
+		 * @param size {number} The new size of the buffer.
+		 * @return {void}
+		 */
+		resize(size: number)
+		{
+			if (this.size < size)
+			{
+				if (this.head < this.tail + 1)
+				{
+					for (var i = 0; i < this.head; i++)
+					{
+						this.items[(i + this.size) % size] = this.items[i];
+						delete this.items[i];
+					}
+					this.head = (this.head + this.size) % size;
+				}
+			} else if (this.size > size)
+			{
+				if (this.head < this.tail + 1)
+				{
+					//check if the tail is after the size
+					var start = size;
+					if (this.tail > size - 1)
+					{
+						start = this.tail;
+						this.tail = 0;
+					}
+					//the items stored must be shift to a valid position
+					var step = this.size - start;
+					for (var j = this.head - step - 1; j > start - 1 || j < this.head - step; j--)
+					{
+						this.items[(j + step) % this.size] = this.items[j];
+						if (!j)
+							j = this.size;
+					}
+					this.head = (this.head + step) % this.size;
+				}
+			}
+			this.size = size;
+		};
+
+	}
+}
\ No newline at end of file
diff --git a/lib/CircularBuffer/CircularBufferIterator.js b/lib/CircularBuffer/CircularBufferIterator.js
deleted file mode 100644
index b58f656..0000000
--- a/lib/CircularBuffer/CircularBufferIterator.js
+++ /dev/null
@@ -1,76 +0,0 @@
-/**
- * Created by Stefano on 06/04/2014.
- */
-
-CircularBufferIterator.prototype = new Iterator();
-CircularBufferIterator.prototype.constructor = CircularBufferIterator;
-
-/**
- * Class that implements the iterator for a circular buffer.
- * @param aggregate {CircularBuffer} The aggregate to scan.
- * @constructor
- */
-function CircularBufferIterator(aggregate) {
-	/**
-	 * The aggregate relates to this iterator.
-	 * @type {CircularBuffer}
-	 */
-	this.aggregate = aggregate;
-
-	/**
-	 * The pointer to the position.
-	 * @type {number|null}
-	 */
-	this.pointer = null;
-	/**
-	 * Discriminator for full buffer
-	 * @type {bool}
-	 */
-	this.start = true;
-}
-
-/**
- * @inheritDoc
- */
-CircularBufferIterator.prototype.first = function () {
-	this.pointer = this.aggregate.tail;
-	this.start = true;
-};
-
-/**
- * @inheritDoc
- */
-CircularBufferIterator.prototype.next = function () {
-	this.pointer = (this.pointer + 1) % this.aggregate.size;
-	this.start = false;
-};
-
-/**
- * @inheritDoc
- */
-CircularBufferIterator.prototype.last = function () {
-	this.pointer = (this.aggregate.head - 1) % this.aggregate.size;
-	this.start = true;
-};
-
-/**
- * @inheritDoc
- */
-CircularBufferIterator.prototype.previous = function () {
-	this.pointer = (this.pointer - 1) % this.aggregate.size;
-	this.start = false;
-};
-
-/**
- * @inheritDoc
- */
-CircularBufferIterator.prototype.isDone = function () {
-	return (this.pointer === this.aggregate.head && !this.start) || (this.pointer === this.aggregate.tail - 1) % this.aggregate.size || this.aggregate.isEmpty();
-};
-
-/**
- * @inheritDoc
- */
-CircularBufferIterator.prototype.getItem = function () {
-	return this.aggregate.read(this.pointer);
-};
\ No newline at end of file
diff --git a/lib/CircularBuffer/CircularBufferIterator.ts b/lib/CircularBuffer/CircularBufferIterator.ts
new file mode 100644
index 0000000..0f9ec00
--- /dev/null
+++ b/lib/CircularBuffer/CircularBufferIterator.ts
@@ -0,0 +1,91 @@
+/**
+ * Created by Stefano on 06/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+namespace ds
+{
+
+	export class CircularBufferIterator<T> implements Iterator
+	{
+		/**
+		 * The aggregate relates to this iterator.
+		 * @type {CircularBuffer}
+		 */
+		aggregate: CircularBuffer<T>;
+
+		/**
+		 * The pointer to the position.
+		 * @type {number}
+		 */
+		pointer: number = -1;
+		/**
+		 * Discriminator for full buffer
+		 * @type {bool}
+		 */
+		start = true;
+
+		/**
+		 * Class that implements the iterator for a circular buffer.
+		 * @param aggregate {CircularBuffer} The aggregate to scan.
+		 * @constructor
+		 */
+		constructor(aggregate: CircularBuffer<T>)
+		{
+			this.aggregate = aggregate;
+		}
+
+		/**
+		 * @inheritDoc
+		 */
+		first()
+		{
+			this.pointer = this.aggregate.tail;
+			this.start = true;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		next()
+		{
+			this.pointer = (this.pointer + 1) % this.aggregate.size;
+			this.start = false;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		last()
+		{
+			this.pointer = (this.aggregate.head - 1) % this.aggregate.size;
+			this.start = true;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		previous()
+		{
+			this.pointer = (this.pointer - 1) % this.aggregate.size;
+			this.start = false;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		isDone()
+		{
+			var bl = (this.pointer === this.aggregate.head && !this.start) || (this.pointer === this.aggregate.tail - 1) || this.aggregate.isEmpty();
+			return bl;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		getItem()
+		{
+			return this.aggregate.read(this.pointer);
+		};
+	}
+
+}
\ No newline at end of file
diff --git a/lib/DoubleLinkedList/DoubleLinkedList.js b/lib/DoubleLinkedList/DoubleLinkedList.js
deleted file mode 100644
index 9e6e2f7..0000000
--- a/lib/DoubleLinkedList/DoubleLinkedList.js
+++ /dev/null
@@ -1,798 +0,0 @@
-/**
- * Created by Stefano on 31/03/14.
- */
-
-/**
- * The single node of the list.
- * @param item {*} The item to store in the node.
- * @constructor
- */
-function DLLNode(item) {
-	/**
-	 * The item stored.
-	 * @type {*}
-	 */
-	this.item = item;
-	/**
-	 * The next node. It's null if there's no a next node.
-	 * @type {DLLNode|null}
-	 */
-	this.next = null;
-	/**
-	 * The previous node. It's null if there's no a previous node.
-	 * @type {DLLNode|null}
-	 */
-	this.previous = null;
-}
-
-DoubleLinkedList.prototype = new Aggregate();
-DoubleLinkedList.prototype.constructor = DoubleLinkedList;
-
-/**
- * Class for managing a double linked list.
- * @param {...*} [args] The items for initializing the list.
- * @constructor
- */
-function DoubleLinkedList(args) {
-	/**
-	 * The first node of the list.
-	 * @type {DLLNode|null}
-	 */
-	this.first = null;
-	/**
-	 * The last node of the list.
-	 * @type {DLLNode|null}
-	 */
-	this.last = null;
-	/**
-	 * The length of the list.
-	 * @type {number}
-	 */
-	this.length = 0;
-
-    if(args && args.length) {
-        //builds the list from the range passed from the constructor
-        this.fromArray(args);
-    } else {
-        //builds the list from the parameters of the constructor
-        this.fromArray(arguments);
-    }
-}
-
-/**
- * @inheritDoc
- */
-DoubleLinkedList.prototype.getIterator = function () {
-	return new DoubleLinkedListIterator(this);
-};
-
-/**
- * Add an item at the head of the list.
- * @param item {*} The item to add.
- * @return {void}
- */
-DoubleLinkedList.prototype.pushFront = function (item) {
-	var node = new DLLNode(item);
-	node.next = this.first;
-	this.first = node;
-	//link the next node to the new node
-	if (node.next)
-		node.next.previous = node;
-	else
-		this.last = node;
-	this.length++;
-};
-
-/**
- * Add an item at the tail of the list.
- * @param item {*} The item to add.
- * @return {void}
- */
-DoubleLinkedList.prototype.pushBack = function (item) {
-	var node = new DLLNode(item);
-	node.previous = this.last;
-	this.last = node;
-	//link the previous node to the new node
-	if (node.previous)
-		node.previous.next = node;
-	else
-		this.first = node;
-	this.length++;
-};
-
-/**
- * Remove the first item of the list.
- * @return {*} The item removed. It's undefined if the list is empty.
- */
-DoubleLinkedList.prototype.popFront = function () {
-	if (this.length) {
-		var node = this.first;
-		this.first = node.next;
-		if (node.next)
-			node.next.previous = null;
-		this.length--;
-		node.next = null;
-		return node.item;
-	}
-	return undefined;
-};
-
-/**
- * Remove the last item of the list.
- * @return {*} The item removed. It's undefined if the list is empty.
- */
-DoubleLinkedList.prototype.popBack = function () {
-	if (this.length) {
-		var node = this.last;
-		this.last = node.previous;
-		if (node.previous)
-			node.previous.next = null;
-		this.length--;
-		node.previous = null;
-		return node.item;
-	}
-	return undefined;
-};
-
-/**
- * Removes the first times items of the list.
- * @param times {number} The number of times to repeat the popFront method.
- * @return {*} The item removed. It's undefined if the list is empty.
- */
-DoubleLinkedList.prototype.multiPopFront = function (times) {
-	var result = [];
-	for (var i = 0; i < times && this.length; i++)
-		result.push(this.popFront());
-	return result;
-};
-
-/**
- * Removes the last times items of the list.
- * @param times {number} The number of times to repeat the popBack method.
- * @return {*} The items removed.
- */
-DoubleLinkedList.prototype.multiPopBack = function (times) {
-	var result = [];
-	for (var i = 0; i < times && this.length; i++)
-		result.push(this.popBack());
-	return result;
-};
-
-/**
- * Returns the first item of the list without remove it.
- * @return {*} The item at the top of the list. It's undefined if the list is empty.
- */
-DoubleLinkedList.prototype.peek = function () {
-	if (!this.length)
-		return undefined;
-	return this.first.item;
-};
-
-/**
- * Add the item at the index position.
- * @param item {*} The item to add.
- * @param index {number} The position where to add the item. If index is negative, the item won't be added.
- * @return {void}
- */
-DoubleLinkedList.prototype.addAt = function (item, index) {
-	if (index < 0)
-		return;
-	if (!index) {
-		this.pushFront(item);
-		return;
-	}
-	if (index === this.length) {
-		this.pushBack(item);
-		return;
-	}
-	var node = this.first;
-	if (!node && index > 0)
-		this.pushBack(undefined);
-	for (var i = 0; i < index - 1; i++, node = node.next) {
-		if (node === this.last)
-			this.pushBack(undefined);
-	}
-	if (node === this.last)
-		this.pushBack(item);
-	else if (node === this.first)
-		this.pushFront(item);
-	else {
-		var newNode = new DLLNode(item);
-		newNode.next = node.next;
-		newNode.previous = node;
-		node.next = newNode;
-		if (newNode.next)
-			newNode.next.previous = newNode;
-		this.length++;
-	}
-};
-
-/**
- * Remove the item at the position index.
- * @param index {Number} The position of the item to remove.
- * @return {*} The item stored at the position index. It's undefined if the index is out of bounds.
- */
-DoubleLinkedList.prototype.removeAt = function (index) {
-	if (index < 0 || index > this.length - 1)
-		return undefined;
-	if (index === 0)
-		return this.popFront();
-	if (index === this.length - 1)
-		return this.popBack();
-	var node = this.first;
-	for (; index > 0; index--)
-		node = node.next;
-	//now node is the node to remove
-	node.previous.next = node.next;
-	node.next.previous = node.previous;
-	node.next = null;
-	node.previous = null;
-	this.length--;
-	return node.item;
-};
-
-/**
- * Removes the item from the list.
- * @param item {*} The item to remove.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {void}
- */
-DoubleLinkedList.prototype.remove = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var node = this.first;
-	var previous = null;
-	while (node) {
-		if (callback(node.item)) {
-			if (node === this.first)
-				this.first = node.next;
-			if (node === this.last)
-				this.last = previous;
-			if (previous) {
-				previous.next = node.next;
-				if (node.next)
-					node.next.previous = previous;
-			}
-			return;
-		}
-		previous = node;
-		node = node.next;
-	}
-};
-
-/**
- * Removes all the item from the list.
- * @param item {*} The item to remove.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {void}
- */
-DoubleLinkedList.prototype.removeAll = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var node = this.first;
-	var previous = null;
-	while (node) {
-		if (callback(node.item)) {
-			if (node === this.first)
-				this.first = node.next;
-			if (node === this.last)
-				this.last = previous;
-			if (previous) {
-				previous.next = node.next;
-				if (node.next)
-					node.next.previous = previous;
-			}
-		} else
-			previous = node;
-		node = node.next;
-	}
-};
-
-/**
- * Removes all the items stored from the from position to the to position.
- * If from > to, the method will remove all the items up to the end.
- * @param from {number} The position where start to remove the items. The from position is included.
- * @param to {number} The position where stop to remove the items. The to position is included.
- * @return {Array<*>} The items removed.
- */
-DoubleLinkedList.prototype.removeSegment = function (from, to) {
-	var result = [];
-	if (to > -1 && from < this.length) {
-		if (from === 0)
-			return this.multiPopFront(to + 1);
-		if (to === this.length - 1 || from > to)
-			return this.multiPopBack(Math.max(to - from, this.length - from)).reverse();
-		var node = this.first;
-		for (var i = 0; i < from - 1; i++)
-			node = node.next;
-		//now node is the node before the node to remove
-		//node to remove
-		var next = node.next;
-		for (var j = from; j < to + 1 && j < this.length; j++) {
-			result.push(next.item);
-			next = next.next;
-		}
-		this.length -= Math.min(to - from + 1, this.length - from);
-		node.next = next;
-		next.previous = node;
-	}
-	return result;
-};
-
-/**
- * Change the item stored in the index position. If the index is out of bound, the node won't be updated.
- * @param index {number} The position of the node to modify.
- * @param item {*} The new item stored in the node.
- * @return {void}
- */
-DoubleLinkedList.prototype.modifyAt = function (index, item) {
-	var node = this.getNode(index);
-	if (node)
-		node.item = item;
-};
-
-/**
- * Removes all the items stored in the list.
- * @return {void}
- */
-DoubleLinkedList.prototype.clear = function () {
-	this.first = null;
-	this.last = null;
-	this.length = 0;
-};
-
-/**
- * Checks if the list contains an item that satisfy the condition represented by the callback function.
- * @param item {*} The item to find.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {boolean} True if the list contains the item that satisfy the condition, false otherwise.
- */
-DoubleLinkedList.prototype.contains = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0;
-	var node = this.first;
-	while (i < this.length && !callback(node.item)) {
-		i++;
-		node = node.next;
-	}
-	return i < this.length;
-};
-
-/**
- * Executes the callback function for each item of the stack.
- * This method modifies the list so if you don't need to modify it you must return the same item of the array.
- * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
- * @return {void}
- */
-DoubleLinkedList.prototype.execute = function (callback) {
-	var node = this.first;
-	while (node) {
-		node.item = callback(node.item);
-		node = node.next;
-	}
-};
-
-/**
- * Delete the node from the list.
- * @param node {DLLNode} The node to delete.
- * @return {void}
- */
-DoubleLinkedList.prototype.deleteNode = function (node) {
-	if (node === this.first) {
-		this.popFront();
-		return;
-	}
-	if (node === this.last) {
-		this.popBack();
-		return;
-	}
-	node.previous.next = node.next;
-	node.next.previous = node.previous;
-	this.length--;
-};
-
-/**
- * Get the node at the position index relative from the node.
- * @param index {Number} The index, relative to the node, of the node to return.
- * @param [node = first] {DLLNode} The node from which start the search.
- * @return {DLLNode} The node at the position index.
- */
-DoubleLinkedList.prototype.getNode = function (index, node) {
-	if (index < 0 || index > this.length - 1)
-		return undefined;
-	var m = Math.floor(this.length / 2);
-	//if the index is less than the middle, the search start from the head of the list, otherwise from the tail of the list
-	if (index < m || node) {
-		node = node || this.first;
-		for (; index > 0; index--)
-			node = node.next;
-	} else
-		for (index = this.length - index - 1, node = this.last; index > 0; index--)
-			node = node.previous;
-	return node;
-};
-
-/**
- * Get the item at the position index.
- * @param index {Number} The position of the item.
- * @return {*}. It's undefined if index isn't in the queue bounds.
- */
-DoubleLinkedList.prototype.getItem = function (index) {
-	if (index < 0 || index > this.length - 1)
-		return undefined;
-	var node;
-	var m = Math.floor(this.length / 2);
-	if (index < m) //if the index is less than the middle, the search start from the head of the list, otherwise from the tail of the list
-		for (node = this.first; index > 0; index--)
-			node = node.next;
-	else
-		for (index = this.length - index - 1, node = this.last; index > 0; index--)
-			node = node.previous;
-	return node.item;
-};
-
-/**
- * Sort the list using web workers.
- * Using this method is discouraged. Many web browser set a limit to the maximum number of workers instantiated.
- * The items of the list, due to web workers implementation, will be serialized so they will lost own methods.
- * @return {void}
- */
-DoubleLinkedList.prototype.parallelSort = function () {
-
-	var workers = [];
-	var _array = this.toArray();
-	console.log(_array);
-
-	function partialSort(_from, _to, _id) {
-		if (_from < _to) {
-			var m = Math.floor((_from + _to) / 2);
-			var workerLeft = new Worker("DoubleLinkedList/WorkerSort.js");
-			var workerRight = new Worker("DoubleLinkedList/WorkerSort.js");
-			workers.push(workerLeft);
-			workers.push(workerRight);
-			var length = workers.length;
-			workerLeft.postMessage({cmd: 'start', from: _from, to: m, worker: _id});
-			workerRight.postMessage({cmd: 'start', from: m + 1, to: _to, worker: _id});
-			partialSort(_from, m, length - 2);
-			partialSort(m + 1, _to, length - 1);
-			workerLeft.onmessage = function (event) {
-				var data = event.data;
-				switch (data.cmd) {
-					case 'finished':
-						workers[data.worker].postMessage({cmd: 'finished', array: _array});
-						break;
-					case 'replace':
-						_array[data.index] = data.value;
-						break;
-				}
-			};
-			workerRight.onmessage = function (event) {
-				var data = event.data;
-				switch (data.cmd) {
-					case 'finished':
-						workers[data.worker].postMessage({cmd: 'finished', array: _array});
-						break;
-					case 'replace':
-						_array[data.index] = data.value;
-						break;
-				}
-			}
-		}
-	}
-
-	var outerThis = this;
-
-	var mainWorker = new Worker("DoubleLinkedList/WorkerSort.js");
-	workers.push(mainWorker);
-	mainWorker.postMessage({cmd: 'start', from: 0, to: this.length - 1, worker: -1, array: _array});
-	mainWorker.onmessage = function (event) {
-		var data = event.data;
-		switch (data.cmd) {
-			case 'finished':
-				outerThis.fromArray(_array);
-				console.log(outerThis);
-				break;
-			case 'replace':
-				_array[data.index] = data.value;
-		}
-	};
-	partialSort(0, this.length - 1, 0);
-};
-
-/**
- * Sort the list.
- * @param [callback = function(item){return(item);}] {function} The function invoked in order to get the value for the evaluation of the sort criteria.
- * @example
- * callback = function(item) {return -item.key;}
- * This function callback will return the opposite of the attribute key of the item. In this case the list will be sorted in descending order.
- * @return {void}
- */
-DoubleLinkedList.prototype.sort = function (callback) {
-
-	if (!callback)
-		callback = function (item) {
-			return item;
-		};
-
-	var outerThis = this;
-
-	function partialSort(from, to, fromNode, toNode) {
-		if (from < to) {
-			var m = Math.floor((from + to) / 2);
-			var mNode = outerThis.getNode(m - from, fromNode);
-			partialSort(from, m, fromNode, mNode);
-			partialSort(m + 1, to, mNode.next, toNode);
-			merge(from, m, to, fromNode);
-		}
-	}
-
-	function merge(from, m, to, fromNode) {
-		var left = [];
-		var right = [];
-		var node = fromNode;
-		for (var i = 0; i < m - from + 1; i++, node = node.next)
-			left[i] = node.item;
-		for (var j = 0; j < to - m; j++, node = node.next)
-			right[j] = node.item;
-		var x = 0, y = 0;
-		for (var k = from; k < to + 1; k++, fromNode = fromNode.next) {
-			if (y > to - m - 1 || (callback(left[x]) <= callback(right[y]) && x < m - from + 1)) {
-				fromNode.item = left[x];
-				x++;
-			} else {
-				fromNode.item = right[y];
-				y++;
-			}
-		}
-	}
-
-	partialSort(0, this.length - 1, this.first, this.last);
-};
-
-/**
- * Transform the list into an array.
- * @return {Array<*>} The array built.
- */
-DoubleLinkedList.prototype.toArray = function () {
-	var array = [];
-	for (var node = this.first, i = 0; node; node = node.next, i++)
-		array[i] = node.item;
-	return array;
-};
-
-/**
- * Returns the length of the list.
- * @return {Number} The length of the list.
- */
-DoubleLinkedList.prototype.getLength = function () {
-	return this.length;
-};
-
-/**
- * Build the list from the array.
- * @param array {Array<*>} The array from which build the list.
- * @return {void}
- */
-DoubleLinkedList.prototype.fromArray = function (array) {
-	var node = this.first;
-	for (var i = 0; i < Math.min(this.length, array.length); i++, node = node.next)
-		node.item = array[i];
-	if (this.length < array.length)
-		for (var j = this.length; j < array.length; j++)
-			this.pushBack(array[j]);
-	else
-		for (var k = array.length; k < this.length;)
-			this.popBack();
-};
-
-/**
- * Return the items that satisfy the condition determined by the callback.
- * @param callback {function} The function that implements the condition.
- * @return {Array<Object>} The array that contains the items that satisfy the condition.
- */
-DoubleLinkedList.prototype.filter = function (callback) {
-	var result = [];
-	for (var node = this.first; node; node = node.next) {
-		if (callback(node.item))
-			result.push(node.item);
-	}
-	return result;
-};
-
-/**
- * Reverse the list. This method reverses only the items, not the nodes.
- * @return {void}
- */
-DoubleLinkedList.prototype.reverse = function () {
-	for (var start = this.first, end = this.last; start !== end && start.previous !== end; start = start.next, end = end.previous) {
-		var item = start.item;
-		start.item = end.item;
-		end.item = item;
-	}
-};
-
-/**
- * Checks if the list is empty.
- * @return {boolean} True if the list is empty, false otherwise.
- */
-DoubleLinkedList.prototype.isEmpty = function () {
-	return !this.length;
-};
-
-/**
- * Returns the first position of the item in the list.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The first position of the item.
- */
-DoubleLinkedList.prototype.indexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0;
-	var node = this.first;
-	while (node) {
-		if (callback(node.item))
-			return i;
-		i++;
-		node = node.next;
-	}
-	return -1;
-};
-
-/**
- * Returns the last position of the item in the list.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The last position of the item.
- */
-DoubleLinkedList.prototype.lastIndexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = this.length - 1;
-	var node = this.last;
-	while (node) {
-		if (callback(node.item))
-			return i;
-		i--;
-		node = node.previous;
-	}
-	return -1;
-};
-
-/**
- * Returns all the position in which the item has been found in the list.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {Array<number>} The positions in which the item has been found.
- */
-DoubleLinkedList.prototype.allIndexesOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0;
-	var node = this.first;
-	var indexes = [];
-	while (node) {
-		if (callback(node.item))
-			indexes.push(i);
-		i++;
-		node = node.next;
-	}
-	return indexes;
-};
-
-/**
- * Add the list at the end of this list.
- * @param list {DoubleLinkedList} The list to join.
- * @return {void}
- */
-DoubleLinkedList.prototype.join = function (list) {
-	if (this.last)
-		this.last.next = list.first;
-	else
-		this.first = list.first;
-	if (list.first)
-		list.first.previous = this.last;
-	this.last = list.last;
-	this.length += list.length;
-};
-
-/**
- * Divides the list at the index position. The node at the index position is the first new node of the list.
- * @param index {number} The position where to divide the list.
- * @return {DoubleLinkedList} The list formed by the nodes from the index position then. If the index is out of bound, the list will be empty.
- */
-DoubleLinkedList.prototype.divide = function (index) {
-	var list = new DoubleLinkedList();
-	if (index > -1 && index < this.length) {
-		var node = this.first;
-		var previous = null;
-		for (var i = 0; i < index; i++) {
-			previous = node;
-			node = node.next;
-		}
-		if (node === this.first) {
-			list.first = this.first;
-			list.last = this.last;
-			this.first = null;
-			this.last = null;
-		} else {
-			list.first = node;
-			list.last = this.last;
-			this.last = previous;
-			previous.next = null;
-			node.previous = null;
-		}
-		list.length = this.length - index;
-		this.length = index;
-	}
-	return list;
-};
-
-/**
- * Clones the list into a new list.
- * @return {DoubleLinkedList} The list cloned from this list.
- */
-DoubleLinkedList.prototype.clone = function () {
-	var list = new DoubleLinkedList();
-	var node = this.first;
-	for (var i = 0; i < this.length; i++, node = node.next)
-		if (node.item.clone)
-			list.pushBack(node.item.clone());
-		else
-			list.pushBack(node.item);
-	return list;
-};
-
-/**
- * Clones the list into a new list without cloning duplicated items.
- * @return {DoubleLinkedList} The list cloned from this list.
- */
-DoubleLinkedList.prototype.cloneDistinct = function () {
-	var list = new DoubleLinkedList();
-	var node = this.first;
-	for (var i = 0; i < this.length; i++, node = node.next)
-		if (!list.contains(node.item))
-			if (node.item.cloneDistinct)
-				list.pushBack(node.item.cloneDistinct());
-			else if (node.item.clone)
-				list.pushBack(node.item.clone());
-			else
-				list.pushBack(node.item);
-	return list;
-};
-
-/**
- * Splits the list into lists of desired size.
- * @param size {number} The size of the lists.
- * @return {Array<DoubleLinkedList>} The lists created by splitting the list.
- */
-DoubleLinkedList.prototype.split = function (size) {
-	var length = this.length;
-	var lists = [this];
-	for (var i = size; i < length; i += size)
-		lists.push(lists[lists.length - 1].divide(size));
-	return lists;
-};
-
-/**
- * Returns the number of items that satisfy the represented by the callback function.
- * @param callback {function} The condition to satisfy.
- * @return {number} The number of items that satisfy the condition.
- */
-DoubleLinkedList.prototype.count = function (callback) {
-	var count = 0;
-	var node = this.first;
-	while (node) {
-		if (callback(node.item))
-			count++;
-		node = node.next;
-	}
-	return count;
-};
diff --git a/lib/DoubleLinkedList/DoubleLinkedList.ts b/lib/DoubleLinkedList/DoubleLinkedList.ts
new file mode 100644
index 0000000..dea0245
--- /dev/null
+++ b/lib/DoubleLinkedList/DoubleLinkedList.ts
@@ -0,0 +1,829 @@
+/**
+ * Created by Stefano on 31/03/14.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+namespace ds
+{
+	export class DLLNode<T>
+	{
+		/**
+		 * The item stored.
+		 * @type {*}
+		 */
+		item: T;
+		/**
+		 * The next node. It's null if there's no a next node.
+		 * @type {DLLNode|null}
+		 */
+		next: DLLNode<T> = <any>null;
+		/**
+		 * The previous node. It's null if there's no a previous node.
+		 * @type {DLLNode|null}
+		 */
+		previous: DLLNode<T> = <any>null;
+
+		/**
+		 * The single node of the list.
+		 * @param item {*} The item to store in the node.
+		 * @constructor
+		 */
+		constructor(item: T)
+		{
+			this.item = item;
+		}
+
+	}
+
+	export class DoubleLinkedList<T> extends Aggregate
+	{
+		/**
+		 * The first node of the list.
+		 * @type {DLLNode|null}
+		 */
+		first: DLLNode<T> = <any>null;
+		/**
+		 * The last node of the list.
+		 * @type {DLLNode|null}
+		 */
+		last: DLLNode<T> = <any>null;
+		/**
+		 * The length of the list.
+		 * @type {number}
+		 */
+		length = 0;
+
+		/**
+		 * Class for managing a double linked list.
+		 * @param {...*} [args] The items for initializing the list.
+		 * @constructor
+		 */
+		constructor(...args: any[])
+		{
+			super();
+
+			if (args && args.length == 1 && args[0] instanceof Array)
+			{
+				//builds the list from the range passed from the constructor
+				this.fromArray(args[0]);
+			} else
+			{
+				//builds the list from the parameters of the constructor
+				this.fromArray(args);
+			}
+		}
+
+		/**
+		 * @inheritDoc
+		 */
+		getIterator()
+		{
+			return new DoubleLinkedListIterator<T>(this);
+		};
+
+		/**
+		 * Add an item at the head of the list.
+		 * @param item {*} The item to add.
+		 * @return {void}
+		 */
+		pushFront(item: any)
+		{
+			var node = new DLLNode(item);
+			node.next = this.first;
+			this.first = node;
+			//link the next node to the new node
+			if (node.next)
+				node.next.previous = node;
+			else
+				this.last = node;
+			this.length++;
+		};
+
+		/**
+		 * Add an item at the tail of the list.
+		 * @param item {*} The item to add.
+		 * @return {void}
+		 */
+		pushBack(item: T)
+		{
+			var node = new DLLNode(item);
+			node.previous = this.last;
+			this.last = node;
+			//link the previous node to the new node
+			if (node.previous)
+				node.previous.next = node;
+			else
+				this.first = node;
+			this.length++;
+		};
+
+		/**
+		 * Remove the first item of the list.
+		 * @return {*} The item removed. It's undefined if the list is empty.
+		 */
+		popFront()
+		{
+			if (this.length)
+			{
+				var node = this.first;
+				this.first = node.next;
+				if (node.next)
+					node.next.previous = <any>null;
+				this.length--;
+				node.next = <any>null;
+				return node.item;
+			}
+			return undefined;
+		};
+
+		/**
+		 * Remove the last item of the list.
+		 * @return {*} The item removed. It's undefined if the list is empty.
+		 */
+		popBack()
+		{
+			if (this.length)
+			{
+				var node = this.last;
+				this.last = node.previous;
+				if (node.previous)
+					node.previous.next = <any>null;
+				this.length--;
+				node.previous = <any>null;
+				return node.item;
+			}
+			return undefined;
+		};
+
+		/**
+		 * Removes the first times items of the list.
+		 * @param times {number} The number of times to repeat the popFront method.
+		 * @return {*} The item removed. It's undefined if the list is empty.
+		 */
+		multiPopFront(times: number)
+		{
+			var result = [];
+			for (var i = 0; i < times && this.length; i++)
+				result.push(this.popFront());
+			return result;
+		};
+
+		/**
+		 * Removes the last times items of the list.
+		 * @param times {number} The number of times to repeat the popBack method.
+		 * @return {*} The items removed.
+		 */
+		multiPopBack(times: number)
+		{
+			var result = [];
+			for (var i = 0; i < times && this.length; i++)
+				result.push(this.popBack());
+			return result;
+		};
+
+		/**
+		 * Returns the first item of the list without remove it.
+		 * @return {*} The item at the top of the list. It's undefined if the list is empty.
+		 */
+		peek()
+		{
+			if (!this.length)
+				return undefined;
+			return this.first.item;
+		};
+
+		/**
+		 * Add the item at the index position.
+		 * @param item {*} The item to add.
+		 * @param index {number} The position where to add the item. If index is negative, the item won't be added.
+		 * @return {void}
+		 */
+		addAt(item: T, index: number)
+		{
+			if (index < 0)
+				return;
+			if (!index)
+			{
+				this.pushFront(item);
+				return;
+			}
+			if (index === this.length)
+			{
+				this.pushBack(item);
+				return;
+			}
+			var node = this.first;
+			if (!node && index > 0)
+				this.pushBack(<any>undefined);
+			for (var i = 0; i < index - 1; i++ , node = node.next)
+			{
+				if (node === this.last)
+					this.pushBack(<any>undefined);
+			}
+			if (node === this.last)
+				this.pushBack(item);
+			else if (node === this.first)
+				this.pushFront(item);
+			else
+			{
+				var newNode = new DLLNode(item);
+				newNode.next = node.next;
+				newNode.previous = node;
+				node.next = newNode;
+				if (newNode.next)
+					newNode.next.previous = newNode;
+				this.length++;
+			}
+		};
+
+		/**
+		 * Remove the item at the position index.
+		 * @param index {Number} The position of the item to remove.
+		 * @return {*} The item stored at the position index. It's undefined if the index is out of bounds.
+		 */
+		removeAt(index: number)
+		{
+			if (index < 0 || index > this.length - 1)
+				return undefined;
+			if (index === 0)
+				return this.popFront();
+			if (index === this.length - 1)
+				return this.popBack();
+			var node = this.first;
+			for (; index > 0; index--)
+				node = node.next;
+			//now node is the node to remove
+			node.previous.next = node.next;
+			node.next.previous = node.previous;
+			node.next = <any>null;
+			node.previous = <any>null;
+			this.length--;
+			return node.item;
+		};
+
+		/**
+		 * Removes the item from the list.
+		 * @param item {*} The item to remove.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {void}
+		 */
+		remove(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var node = this.first;
+			var previous = null;
+			while (node)
+			{
+				if (callback(node.item))
+				{
+					if (node === this.first)
+						this.first = node.next;
+					if (node === this.last)
+						this.last = <any>previous;
+					if (previous)
+					{
+						previous.next = node.next;
+						if (node.next)
+							node.next.previous = previous;
+					}
+					return;
+				}
+				previous = node;
+				node = node.next;
+			}
+		};
+
+		/**
+		 * Removes all the item from the list.
+		 * @param item {*} The item to remove.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {void}
+		 */
+		removeAll(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var node = this.first;
+			var previous = null;
+			while (node)
+			{
+				if (callback(node.item))
+				{
+					if (node === this.first)
+						this.first = node.next;
+					if (node === this.last)
+						this.last = <any>previous;
+					if (previous)
+					{
+						previous.next = node.next;
+						if (node.next)
+							node.next.previous = previous;
+					}
+				} else
+					previous = node;
+				node = node.next;
+			}
+		};
+
+		/**
+		 * Removes all the items stored from the from position to the to position.
+		 * If from > to, the method will remove all the items up to the end.
+		 * @param from {number} The position where start to remove the items. The from position is included.
+		 * @param to {number} The position where stop to remove the items. The to position is included.
+		 * @return {Array<*>} The items removed.
+		 */
+		removeSegment(from: number, to: number)
+		{
+			var result = [];
+			if (to > -1 && from < this.length)
+			{
+				if (from === 0)
+					return this.multiPopFront(to + 1);
+				if (to === this.length - 1 || from > to)
+					return this.multiPopBack(Math.max(to - from, this.length - from)).reverse();
+				var node = this.first;
+				for (var i = 0; i < from - 1; i++)
+					node = node.next;
+				//now node is the node before the node to remove
+				//node to remove
+				var next = node.next;
+				for (var j = from; j < to + 1 && j < this.length; j++)
+				{
+					result.push(next.item);
+					next = next.next;
+				}
+				this.length -= Math.min(to - from + 1, this.length - from);
+				node.next = next;
+				next.previous = node;
+			}
+			return result;
+		};
+
+		/**
+		 * Change the item stored in the index position. If the index is out of bound, the node won't be updated.
+		 * @param index {number} The position of the node to modify.
+		 * @param item {*} The new item stored in the node.
+		 * @return {void}
+		 */
+		modifyAt(index: number, item: T)
+		{
+			var node = this.getNode(index);
+			if (node)
+				node.item = item;
+		};
+
+		/**
+		 * Removes all the items stored in the list.
+		 * @return {void}
+		 */
+		clear()
+		{
+			this.first = <any>null;
+			this.last = <any>null;
+			this.length = 0;
+		};
+
+		/**
+		 * Checks if the list contains an item that satisfy the condition represented by the callback function.
+		 * @param item {*} The item to find.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {boolean} True if the list contains the item that satisfy the condition, false otherwise.
+		 */
+		contains(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var i = 0;
+			var node = this.first;
+			while (i < this.length && !callback(node.item))
+			{
+				i++;
+				node = node.next;
+			}
+			return i < this.length;
+		};
+
+		/**
+		 * Executes the callback function for each item of the stack.
+		 * This method modifies the list so if you don't need to modify it you must return the same item of the array.
+		 * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+		 * @return {void}
+		 */
+		execute(callback: (item: T) => T)
+		{
+			var node = this.first;
+			while (node)
+			{
+				node.item = callback(node.item);
+				node = node.next;
+			}
+		};
+
+		/**
+		 * Delete the node from the list.
+		 * @param node {DLLNode} The node to delete.
+		 * @return {void}
+		 */
+		deleteNode(node: DLLNode<T>)
+		{
+			if (node === this.first)
+			{
+				this.popFront();
+				return;
+			}
+			if (node === this.last)
+			{
+				this.popBack();
+				return;
+			}
+			node.previous.next = node.next;
+			node.next.previous = node.previous;
+			this.length--;
+		};
+
+		/**
+		 * Get the node at the position index relative from the node.
+		 * @param index {Number} The index, relative to the node, of the node to return.
+		 * @param [node = first] {DLLNode} The node from which start the search.
+		 * @return {DLLNode} The node at the position index.
+		 */
+		getNode(index: number, node?: DLLNode<T>)
+		{
+			if (index < 0 || index > this.length - 1)
+				return undefined;
+			var m = Math.floor(this.length / 2);
+			//if the index is less than the middle, the search start from the head of the list, otherwise from the tail of the list
+			if (index < m || node)
+			{
+				node = node || this.first;
+				for (; index > 0; index--)
+					node = node.next;
+			} else
+				for (index = this.length - index - 1, node = this.last; index > 0; index--)
+					node = node.previous;
+			return node;
+		};
+
+		/**
+		 * Get the item at the position index.
+		 * @param index {Number} The position of the item.
+		 * @return {*}. It's undefined if index isn't in the queue bounds.
+		 */
+		getItem(index: number)
+		{
+			if (index < 0 || index > this.length - 1)
+				return undefined;
+			var node;
+			var m = Math.floor(this.length / 2);
+			if (index < m) //if the index is less than the middle, the search start from the head of the list, otherwise from the tail of the list
+				for (node = this.first; index > 0; index--)
+					node = node.next;
+			else
+				for (index = this.length - index - 1, node = this.last; index > 0; index--)
+					node = node.previous;
+			return node.item;
+		};
+
+		/**
+		 * Sort the list.
+		 * @param [callback = function(item){return(item);}] {function} The function invoked in order to get the value for the evaluation of the sort criteria.
+		 * @example
+		 * callback = function(item) {return -item.key;}
+		 * This function callback will return the opposite of the attribute key of the item. In this case the list will be sorted in descending order.
+		 * @return {void}
+		 */
+		sort(callback?: (item: T) => number)
+		{
+			if (!callback)
+				callback = function (item: T)
+				{
+					return <any>item;
+				};
+
+			var outerThis = this;
+
+			function partialSort(from: number, to: number, fromNode: DLLNode<T>, toNode: DLLNode<T>, callback: (item: T) => number)
+			{
+				if (from < to)
+				{
+					var m = Math.floor((from + to) / 2);
+					var mNode: DLLNode<T> = <any>outerThis.getNode(m - from, fromNode);
+					partialSort(from, m, fromNode, mNode, callback);
+					partialSort(m + 1, to, mNode.next, toNode, callback);
+					merge(from, m, to, fromNode, callback);
+				}
+			}
+
+			function merge(from: number, m: number, to: number, fromNode: DLLNode<T>, callback: (item: T) => number)
+			{
+				var left = [];
+				var right = [];
+				var node = fromNode;
+				for (var i = 0; i < m - from + 1; i++ , node = node.next)
+					left[i] = node.item;
+				for (var j = 0; j < to - m; j++ , node = node.next)
+					right[j] = node.item;
+				var x = 0, y = 0;
+				for (var k = from; k < to + 1; k++ , fromNode = fromNode.next)
+				{
+					if (y > to - m - 1 || (callback(left[x]) <= callback(right[y]) && x < m - from + 1))
+					{
+						fromNode.item = left[x];
+						x++;
+					} else
+					{
+						fromNode.item = right[y];
+						y++;
+					}
+				}
+			}
+
+			partialSort(0, this.length - 1, this.first, this.last, callback);
+		};
+
+		/**
+		 * Transform the list into an array.
+		 * @return {Array<*>} The array built.
+		 */
+		toArray()
+		{
+			var array = [];
+			for (var node = this.first, i = 0; node; node = node.next, i++)
+				array[i] = node.item;
+			return array;
+		};
+
+		/**
+		 * Returns the length of the list.
+		 * @return {Number} The length of the list.
+		 */
+		getLength()
+		{
+			return this.length;
+		};
+
+		/**
+		 * Build the list from the array.
+		 * @param array {Array<*>} The array from which build the list.
+		 * @return {void}
+		 */
+		fromArray(array: T[])
+		{
+			var node = this.first;
+			for (var i = 0; i < Math.min(this.length, array.length); i++ , node = node.next)
+				node.item = array[i];
+			if (this.length < array.length)
+				for (var j = this.length; j < array.length; j++)
+					this.pushBack(array[j]);
+			else
+				for (var k = array.length; k < this.length;)
+					this.popBack();
+		};
+
+		/**
+		 * Return the items that satisfy the condition determined by the callback.
+		 * @param callback {function} The function that implements the condition.
+		 * @return {Array<Object>} The array that contains the items that satisfy the condition.
+		 */
+		filter(callback: (item: T) => boolean)
+		{
+			var result = [];
+			for (var node = this.first; node; node = node.next)
+			{
+				if (callback(node.item))
+					result.push(node.item);
+			}
+			return result;
+		};
+
+		/**
+		 * Reverse the list. This method reverses only the items, not the nodes.
+		 * @return {void}
+		 */
+		reverse()
+		{
+			for (var start = this.first, end = this.last; start !== end && start.previous !== end; start = start.next, end = end.previous)
+			{
+				var item = start.item;
+				start.item = end.item;
+				end.item = item;
+			}
+		};
+
+		/**
+		 * Checks if the list is empty.
+		 * @return {boolean} True if the list is empty, false otherwise.
+		 */
+		isEmpty()
+		{
+			return !this.length;
+		};
+
+		/**
+		 * Returns the first position of the item in the list.
+		 * @param item {*} The item to search.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {number} The first position of the item.
+		 */
+		indexOf(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var i = 0;
+			var node = this.first;
+			while (node)
+			{
+				if (callback(node.item))
+					return i;
+				i++;
+				node = node.next;
+			}
+			return -1;
+		};
+
+		/**
+		 * Returns the last position of the item in the list.
+		 * @param item {*} The item to search.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {number} The last position of the item.
+		 */
+		lastIndexOf(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var i = this.length - 1;
+			var node = this.last;
+			while (node)
+			{
+				if (callback(node.item))
+					return i;
+				i--;
+				node = node.previous;
+			}
+			return -1;
+		};
+
+		/**
+		 * Returns all the position in which the item has been found in the list.
+		 * @param item {*} The item to search.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {Array<number>} The positions in which the item has been found.
+		 */
+		allIndexesOf(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var i = 0;
+			var node = this.first;
+			var indexes = [];
+			while (node)
+			{
+				if (callback(node.item))
+					indexes.push(i);
+				i++;
+				node = node.next;
+			}
+			return indexes;
+		};
+
+		/**
+		 * Add the list at the end of this list.
+		 * @param list {DoubleLinkedList} The list to join.
+		 * @return {void}
+		 */
+		join(list: DoubleLinkedList<T>)
+		{
+			if (this.last)
+				this.last.next = list.first;
+			else
+				this.first = list.first;
+			if (list.first)
+				list.first.previous = this.last;
+			this.last = list.last;
+			this.length += list.length;
+		};
+
+		/**
+		 * Divides the list at the index position. The node at the index position is the first new node of the list.
+		 * @param index {number} The position where to divide the list.
+		 * @return {DoubleLinkedList} The list formed by the nodes from the index position then. If the index is out of bound, the list will be empty.
+		 */
+		divide(index: number)
+		{
+			var list = new DoubleLinkedList<T>();
+			if (index > -1 && index < this.length)
+			{
+				var node = this.first;
+				var previous: DLLNode<T> = <any>null;
+				for (var i = 0; i < index; i++)
+				{
+					previous = node;
+					node = node.next;
+				}
+				if (node === this.first)
+				{
+					list.first = this.first;
+					list.last = this.last;
+					this.first = <any>null;
+					this.last = <any>null;
+				} else
+				{
+					list.first = node;
+					list.last = this.last;
+					this.last = previous;
+					previous.next = <any>null;
+					node.previous = <any>null;
+				}
+				list.length = this.length - index;
+				this.length = index;
+			}
+			return list;
+		};
+
+		/**
+		 * Clones the list into a new list.
+		 * @return {DoubleLinkedList} The list cloned from this list.
+		 */
+		clone()
+		{
+			var list = new DoubleLinkedList<T>();
+			var node = this.first;
+			for (var i = 0; i < this.length; i++ , node = node.next)
+			{
+				var item: any = node.item;
+				if (item.clone)
+					list.pushBack(item.clone());
+				else
+					list.pushBack(item);
+			}
+			return list;
+		};
+
+		/**
+		 * Clones the list into a new list without cloning duplicated items.
+		 * @return {DoubleLinkedList} The list cloned from this list.
+		 */
+		cloneDistinct()
+		{
+			var list = new DoubleLinkedList<T>();
+			var node = this.first;
+			for (var i = 0; i < this.length; i++ , node = node.next)
+				if (!list.contains(node.item))
+				{
+					var item: any = node.item;
+					if (item.cloneDistinct)
+						list.pushBack(item.cloneDistinct());
+					else if (item.clone)
+						list.pushBack(item.clone());
+					else
+						list.pushBack(item);
+				}
+			return list;
+		};
+
+		/**
+		 * Splits the list into lists of desired size.
+		 * @param size {number} The size of the lists.
+		 * @return {Array<DoubleLinkedList>} The lists created by splitting the list.
+		 */
+		split(size: number)
+		{
+			var length = this.length;
+			var lists: DoubleLinkedList<T>[] = [this];
+			for (var i = size; i < length; i += size)
+				lists.push(lists[lists.length - 1].divide(size));
+			return lists;
+		};
+
+		/**
+		 * Returns the number of items that satisfy the represented by the callback function.
+		 * @param callback {function} The condition to satisfy.
+		 * @return {number} The number of items that satisfy the condition.
+		 */
+		count(callback: (item: T) => boolean)
+		{
+			var count = 0;
+			var node = this.first;
+			while (node)
+			{
+				if (callback(node.item))
+					count++;
+				node = node.next;
+			}
+			return count;
+		};
+
+	}
+}
\ No newline at end of file
diff --git a/lib/DoubleLinkedList/DoubleLinkedListIterator.js b/lib/DoubleLinkedList/DoubleLinkedListIterator.js
deleted file mode 100644
index 38de29b..0000000
--- a/lib/DoubleLinkedList/DoubleLinkedListIterator.js
+++ /dev/null
@@ -1,76 +0,0 @@
-/**
- * Created by Stefano on 04/04/2014.
- */
-
-DoubleLinkedListIterator.prototype = new Iterator();
-DoubleLinkedListIterator.prototype.constructor = DoubleLinkedListIterator;
-
-/**
- * Class that implements the iterator for a double linked list.
- * @param aggregate {DoubleLinkedList} The aggregate to scan.
- * @constructor
- */
-function DoubleLinkedListIterator(aggregate) {
-	/**
-	 * The aggregate relates to this iterator.
-	 * @type {DoubleLinkedList}
-	 */
-	this.aggregate = aggregate;
-
-	/**
-	 * The pointer to the position.
-	 * @type {Node|null}
-	 */
-	this.pointer = null;
-}
-
-/**
- * @inheritDoc
- */
-DoubleLinkedListIterator.prototype.first = function () {
-	this.pointer = this.aggregate.first;
-};
-
-/**
- * @inheritDoc
- */
-DoubleLinkedListIterator.prototype.next = function () {
-	this.pointer = this.pointer.next;
-};
-
-/**
- * @inheritDoc
- */
-DoubleLinkedListIterator.prototype.last = function () {
-	this.pointer = this.aggregate.last;
-};
-
-/**
- * @inheritDoc
- */
-DoubleLinkedListIterator.prototype.previous = function () {
-	this.pointer = this.pointer.previous;
-};
-
-/**
- * @inheritDoc
- */
-DoubleLinkedListIterator.prototype.isDone = function () {
-	return !this.pointer;
-};
-
-/**
- * @inheritDoc
- */
-DoubleLinkedListIterator.prototype.getItem = function () {
-	return this.pointer.item;
-};
-
-/**
- * Return the node stored at the position pointed by the iterator.
- * @abstract
- * @return {Node|null} The node stored or null if it's out of the bounds.
- */
-DoubleLinkedListIterator.prototype.getNode = function () {
-	return this.pointer;
-};
\ No newline at end of file
diff --git a/lib/DoubleLinkedList/DoubleLinkedListIterator.ts b/lib/DoubleLinkedList/DoubleLinkedListIterator.ts
new file mode 100644
index 0000000..9614f0a
--- /dev/null
+++ b/lib/DoubleLinkedList/DoubleLinkedListIterator.ts
@@ -0,0 +1,90 @@
+/**
+ * Created by Stefano on 04/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+namespace ds
+{
+	export class DoubleLinkedListIterator<T> implements Iterator
+	{
+		/**
+		 * The aggregate relates to this iterator.
+		 * @type {DoubleLinkedList}
+		 */
+		aggregate: DoubleLinkedList<T>;
+
+		/**
+		 * The pointer to the position.
+		 * @type {Node|null}
+		 */
+		pointer: DLLNode<T> = <any>null;
+
+		/**
+		 * Class that implements the iterator for a double linked list.
+		 * @param aggregate {DoubleLinkedList} The aggregate to scan.
+		 * @constructor
+		 */
+		constructor(aggregate: DoubleLinkedList<T>)
+		{
+			this.aggregate = aggregate;
+		}
+
+		/**
+		 * @inheritDoc
+		 */
+		first()
+		{
+			this.pointer = this.aggregate.first;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		next()
+		{
+			this.pointer = this.pointer.next;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		last()
+		{
+			this.pointer = this.aggregate.last;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		previous()
+		{
+			this.pointer = this.pointer.previous;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		isDone()
+		{
+			return !this.pointer;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		getItem()
+		{
+			return this.pointer.item;
+		};
+
+		/**
+		 * Return the node stored at the position pointed by the iterator.
+		 * @abstract
+		 * @return {Node|null} The node stored or null if it's out of the bounds.
+		 */
+		getNode()
+		{
+			return this.pointer;
+		};
+	}
+
+}
\ No newline at end of file
diff --git a/lib/DoubleLinkedList/WorkerSort.js b/lib/DoubleLinkedList/WorkerSort.js
deleted file mode 100644
index 871b250..0000000
--- a/lib/DoubleLinkedList/WorkerSort.js
+++ /dev/null
@@ -1,50 +0,0 @@
-/**
- * Created by Stefano on 01/04/14.
- */
-onmessage = function (event) {
-	var data = event.data;
-	switch (data.cmd) {
-		case 'start':
-			this.finished = 0;
-			this.from = data.from;
-			this.to = data.to;
-			this.worker = data.worker;
-			if (this.from === this.to) {
-				this.postMessage({cmd: 'finished', worker: this.worker});
-				close();
-			}
-			break;
-		case 'finished':
-			this.finished++;
-			if (this.finished > 1) {
-				this.array = data.array;
-				merge(this.from, this.to, this.array);
-				this.postMessage({cmd: 'finished', worker: this.worker});
-				close();
-			}
-			break;
-		default :
-			this.postMessage('Something went wrong');
-	}
-};
-
-//noinspection FunctionWithMultipleLoopsJS
-function merge(from, to, array) {
-	var m = Math.floor((from + to) / 2);
-	var left = [];
-	var right = [];
-	for (var i = 0; i < m - from + 1; i++)
-		left[i] = array[from + i];
-	for (var j = 0; j < to - m; j++)
-		right[j] = array[m + j + 1];
-	var x = 0, y = 0;
-	for (var k = from; k < to + 1; k++) {
-		if (y > to - m - 1 || (left[x] <= right[y] && x < m - from + 1)) {
-			this.postMessage({cmd: 'replace', index: k, value: left[x]});
-			x++;
-		} else {
-			this.postMessage({cmd: 'replace', index: k, value: right[y]});
-			y++;
-		}
-	}
-}
\ No newline at end of file
diff --git a/lib/HashTable/HashTable.js b/lib/HashTable/HashTable.js
deleted file mode 100644
index 1e15fe3..0000000
--- a/lib/HashTable/HashTable.js
+++ /dev/null
@@ -1,233 +0,0 @@
-/**
- * Created by Stefano on 05/04/2014.
- */
-
-/**
- * Class for managing an hash table.
- * @param size {number} The size of the table.
- * @constructor
- */
-function HashTable(size) {
-	/**
-	 * The size of the table
-	 * @type {number}
-	 */
-	this.size = size;
-
-	this.p = 1000;
-
-	this.a = Math.floor(Math.random() * this.p);
-
-	this.b = Math.floor(Math.random() * this.p);
-
-	/**
-	 * Calculate the hash of the param key.
-	 * @param key {number} The key to hash.
-	 * @return {number} The hash of the key.
-	 */
-	this.hash = function (key) {
-		return ((this.a * key + this.b) % this.p) % this.size;
-	};
-
-	/**
-	 * The items stored in the hash table.
-	 * @type {Array<DoubleLinkedList>}
-	 */
-	this.items = [];
-
-	/**
-	 * The number of keys stored in the hash table.
-	 * @type {number}
-	 */
-	this.keyLength = 0;
-
-	this.clear();
-}
-
-/**
- * Stores the item with its key.
- * @param key {number} The key relatives to the item.
- * @param item {*} The item to store.
- */
-HashTable.prototype.insert = function (key, item) {
-	this.keyLength++;
-	this.items[this.hash(key)].pushBack({key: key, item: item});
-};
-
-/**
- * Deletes the first item relatives to the key value.
- * @param key {number} The key to delete.
- * @return {void}
- */
-HashTable.prototype.deleteKey = function (key) {
-	var list = this.items[this.hash(key)];
-	var it = list.getIterator();
-	for (it.first(); !it.isDone() && it.getItem().key !== key;)
-		it.next();
-	if (!it.isDone()) {
-		list.deleteNode(it.getNode());
-		this.keyLength--;
-	}
-};
-
-/**
- * Deletes all the items relative to the key value.
- * @param key {number} The key to delete.
- * @return {void}
- */
-HashTable.prototype.deleteAllKey = function (key) {
-	var list = this.items[this.hash(key)];
-	var it = list.getIterator();
-	var keysRemoved = 0;
-	for (it.first(); !it.isDone(); it.next())
-		if (it.getItem().key === key) {
-			list.deleteNode(it.getNode());
-			keysRemoved++;
-		}
-	this.keyLength -= keysRemoved;
-};
-
-/**
- * Searches the item relative to the key value.
- * @param key {number} The key of the item to search.
- * @return {*|undefined} The item found or undefined if the key does not exist.
- */
-HashTable.prototype.search = function (key) {
-	var list = this.items[this.hash(key)];
-	var it = list.getIterator();
-	for (it.first(); !it.isDone(); it.next())
-		if (it.getItem().key === key)
-			return it.getItem().item;
-	return undefined;
-};
-
-/**
- * Checks if the hash table contains a key that satisfy the condition represented by the callback function.
- * @param key {number} The key to find.
- * @param [callback = function(k){return(k===key);}] The condition to satisfy. The callback must accept the current key to check.
- * @return {boolean} True if the hash table contains the key that satisfy the condition, false otherwise.
- */
-HashTable.prototype.containsKey = function (key, callback) {
-	callback = callback || function (k) {
-		return k === key;
-	};
-	var list = this.items[this.hash(key)];
-	var it = list.getIterator();
-	for (it.first(); !it.isDone(); it.next())
-		if (callback(it.getItem().key))
-			return true;
-	return false;
-};
-
-/**
- * Searches all the items relative to the key value.
- * @param key {number} The key of the items to search.
- * @return {Array.<*>} An array with the items found.
- */
-HashTable.prototype.searchAll = function (key) {
-	var list = this.items[this.hash(key)];
-	var it = list.getIterator();
-	var array = [];
-	for (it.first(); !it.isDone(); it.next())
-		if (it.getItem().key === key)
-			array.push(it.getItem().item);
-	return array;
-};
-
-/**
- * Returns the keys stored in the hash table.
- * @return {Array<number>} The keys stored in the table.
- */
-HashTable.prototype.getKeys = function () {
-	var keys = [];
-	for (var i = 0; i < this.size; i++) {
-		var it = this.items[i].getIterator();
-		for (it.first(); !it.isDone(); it.next())
-			keys.push(it.getItem().key);
-	}
-	return keys;
-};
-
-/**
- * Returns the items stored in the hash table.
- * @return {Array<*>} The items stored in the table.
- */
-HashTable.prototype.getItems = function () {
-	var items = [];
-	for (var i = 0; i < this.size; i++) {
-		var it = this.items[i].getIterator();
-		for (it.first(); !it.isDone(); it.next())
-			items.push(it.getItem().item);
-	}
-	return items;
-};
-
-/**
- * Removes all the keys and the items stored in the hash table.
- * @return {void}
- */
-HashTable.prototype.clear = function () {
-	this.items = [];
-	for (var i = 0; i < this.size; i++)
-		this.items[i] = new DoubleLinkedList();
-	this.keyLength = 0;
-};
-
-/**
- * Returns the number of keys stored in the hash table.
- * @return {number} The number of keys stored.
- */
-HashTable.prototype.getNumberOfKeys = function () {
-	return this.keyLength;
-};
-
-/**
- * Checks if the hash table is empty.
- * @return {boolean} True if the hash table is empty, false otherwise.
- */
-HashTable.prototype.isEmpty = function () {
-	return !this.keyLength;
-};
-
-/**
- * Executes the callback function for each item of the hash table.
- * This method modifies the hash table so if you don't need to modify it you must return the same item stored.
- * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
- * @return {void}
- */
-HashTable.prototype.execute = function (callback) {
-	for (var i = 0; i < this.size; i++)
-		this.items[i].execute(callback);
-};
-
-/**
- * Returns the items that satisfy the condition determined by the callback.
- * @param callback {function} The function that implements the condition.
- * @return {Array<*>} The array that contains the items that satisfy the condition.
- */
-HashTable.prototype.filter = function (callback) {
-	var result = [];
-	for (var i = 0; i < this.size; i++)
-		result.concat(this.items[i].filter(callback));
-	return result;
-};
-
-/**
- * Returns the size of the hash table.
- * @return {number} The size of the hash table.
- */
-HashTable.prototype.getSize = function () {
-	return this.size;
-};
-
-/**
- * Clones the hash table into a new hash table.
- * @return {HashTable} The hash table cloned from this hash table.
- */
-HashTable.prototype.clone = function () {
-	var table = new HashTable(this.size);
-	for (var i = 0; i < this.size; i++)
-		for (var node = this.items[i].first; node; node = node.next)
-			table.insert(node.key, node.item);
-	return table;
-};
\ No newline at end of file
diff --git a/lib/HashTable/HashTable.ts b/lib/HashTable/HashTable.ts
new file mode 100644
index 0000000..b98263d
--- /dev/null
+++ b/lib/HashTable/HashTable.ts
@@ -0,0 +1,273 @@
+/**
+ * Created by Stefano on 05/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+namespace ds
+{
+	export class HashTable<T>
+	{
+
+		/**
+		 * The size of the table
+		 * @type {number}
+		 */
+		size: number;
+
+		p = 1000;
+
+		a = Math.floor(Math.random() * this.p);
+
+		b = Math.floor(Math.random() * this.p);
+
+		/**
+		 * Calculate the hash of the param key.
+		 * @param key {number} The key to hash.
+		 * @return {number} The hash of the key.
+		 */
+		hash: (key: number) => number;
+
+		/**
+		 * The items stored in the hash table.
+		 * @type {Array<DoubleLinkedList>}
+		 */
+		items: DoubleLinkedList<{ key: number, item: T }>[] = [];
+
+		/**
+		 * The number of keys stored in the hash table.
+		 * @type {number}
+		 */
+		keyLength = 0;
+
+		/**
+		 * Class for managing an hash table.
+		 * @param size {number} The size of the table.
+		 * @constructor
+		 */
+		constructor(size: number)
+		{
+			this.size = size;
+			this.p = 1000;
+			this.a = Math.floor(Math.random() * this.p);
+			this.b = Math.floor(Math.random() * this.p);
+
+			this.hash = function (key)
+			{
+				return ((this.a * key + this.b) % this.p) % this.size;
+			};
+			this.items = [];
+
+			this.keyLength = 0;
+
+			this.clear();
+		}
+
+		/**
+		 * Stores the item with its key.
+		 * @param key {number} The key relatives to the item.
+		 * @param item {*} The item to store.
+		 */
+		insert(key: number, item: T)
+		{
+			this.keyLength++;
+			this.items[this.hash(key)].pushBack({ key: key, item: item });
+		};
+
+		/**
+		 * Deletes the first item relatives to the key value.
+		 * @param key {number} The key to delete.
+		 * @return {void}
+		 */
+		deleteKey(key: number)
+		{
+			var list = this.items[this.hash(key)];
+			var it = list.getIterator();
+			for (it.first(); !it.isDone() && it.getItem().key !== key;)
+				it.next();
+			if (!it.isDone())
+			{
+				list.deleteNode(it.getNode());
+				this.keyLength--;
+			}
+		};
+
+		/**
+		 * Deletes all the items relative to the key value.
+		 * @param key {number} The key to delete.
+		 * @return {void}
+		 */
+		deleteAllKey(key: number)
+		{
+			var list = this.items[this.hash(key)];
+			var it = list.getIterator();
+			var keysRemoved = 0;
+			for (it.first(); !it.isDone(); it.next())
+				if (it.getItem().key === key)
+				{
+					list.deleteNode(it.getNode());
+					keysRemoved++;
+				}
+			this.keyLength -= keysRemoved;
+		};
+
+		/**
+		 * Searches the item relative to the key value.
+		 * @param key {number} The key of the item to search.
+		 * @return {*|undefined} The item found or undefined if the key does not exist.
+		 */
+		search(key: number)
+		{
+			var list = this.items[this.hash(key)];
+			var it = list.getIterator();
+			for (it.first(); !it.isDone(); it.next())
+				if (it.getItem().key === key)
+					return it.getItem().item;
+			return undefined;
+		};
+
+		/**
+		 * Checks if the hash table contains a key that satisfy the condition represented by the callback function.
+		 * @param key {number} The key to find.
+		 * @param [callback = function(k){return(k===key);}] The condition to satisfy. The callback must accept the current key to check.
+		 * @return {boolean} True if the hash table contains the key that satisfy the condition, false otherwise.
+		 */
+		containsKey(key: number, callback?: (key: number) => boolean)
+		{
+			callback = callback || function (k)
+			{
+				return k === key;
+			};
+			var list = this.items[this.hash(key)];
+			var it = list.getIterator();
+			for (it.first(); !it.isDone(); it.next())
+				if (callback(it.getItem().key))
+					return true;
+			return false;
+		};
+
+		/**
+		 * Searches all the items relative to the key value.
+		 * @param key {number} The key of the items to search.
+		 * @return {Array.<*>} An array with the items found.
+		 */
+		searchAll(key: number)
+		{
+			var list = this.items[this.hash(key)];
+			var it = list.getIterator();
+			var array = [];
+			for (it.first(); !it.isDone(); it.next())
+				if (it.getItem().key === key)
+					array.push(it.getItem().item);
+			return array;
+		};
+
+		/**
+		 * Returns the keys stored in the hash table.
+		 * @return {Array<number>} The keys stored in the table.
+		 */
+		getKeys()
+		{
+			var keys = [];
+			for (var i = 0; i < this.size; i++)
+			{
+				var it = this.items[i].getIterator();
+				for (it.first(); !it.isDone(); it.next())
+					keys.push(it.getItem().key);
+			}
+			return keys;
+		};
+
+		/**
+		 * Returns the items stored in the hash table.
+		 * @return {Array<*>} The items stored in the table.
+		 */
+		getItems()
+		{
+			var items = [];
+			for (var i = 0; i < this.size; i++)
+			{
+				var it = this.items[i].getIterator();
+				for (it.first(); !it.isDone(); it.next())
+					items.push(it.getItem().item);
+			}
+			return items;
+		};
+
+		/**
+		 * Removes all the keys and the items stored in the hash table.
+		 * @return {void}
+		 */
+		clear()
+		{
+			this.items = [];
+			for (var i = 0; i < this.size; i++)
+				this.items[i] = new DoubleLinkedList();
+			this.keyLength = 0;
+		};
+
+		/**
+		 * Returns the number of keys stored in the hash table.
+		 * @return {number} The number of keys stored.
+		 */
+		getNumberOfKeys()
+		{
+			return this.keyLength;
+		};
+
+		/**
+		 * Checks if the hash table is empty.
+		 * @return {boolean} True if the hash table is empty, false otherwise.
+		 */
+		isEmpty()
+		{
+			return !this.keyLength;
+		};
+
+		/**
+		 * Executes the callback function for each item of the hash table.
+		 * This method modifies the hash table so if you don't need to modify it you must return the same item stored.
+		 * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+		 * @return {void}
+		 */
+		execute(callback: (item: { key: number; item: T; }) => { key: number; item: T; })
+		{
+			for (var i = 0; i < this.size; i++)
+				this.items[i].execute(callback);
+		};
+
+		/**
+		 * Returns the items that satisfy the condition determined by the callback.
+		 * @param callback {function} The function that implements the condition.
+		 * @return {Array<*>} The array that contains the items that satisfy the condition.
+		 */
+		filter(callback: (item: { key: number; item: T; }) => boolean)
+		{
+			var result: any[] = [];
+			for (var i = 0; i < this.size; i++)
+				result.concat(this.items[i].filter(callback));
+			return result;
+		};
+
+		/**
+		 * Returns the size of the hash table.
+		 * @return {number} The size of the hash table.
+		 */
+		getSize()
+		{
+			return this.size;
+		};
+
+		/**
+		 * Clones the hash table into a new hash table.
+		 * @return {HashTable} The hash table cloned from this hash table.
+		 */
+		clone()
+		{
+			var table = new HashTable<T>(this.size);
+			for (var i = 0; i < this.size; i++)
+				for (var node = this.items[i].first; node; node = node.next)
+					table.insert(node.key, node.item);
+			return table;
+		};
+	}
+
+}
\ No newline at end of file
diff --git a/lib/LinkedList/LinkedList.js b/lib/LinkedList/LinkedList.js
deleted file mode 100644
index ab41043..0000000
--- a/lib/LinkedList/LinkedList.js
+++ /dev/null
@@ -1,617 +0,0 @@
-/**
- * Created by Stefano on 31/03/14.
- */
-
-/**
- * The single node of the list.
- * @param item {*} The item to store in the node.
- * @constructor
- */
-function LLNode(item) {
-	/**
-	 * The item stored.
-	 * @type {*}
-	 */
-	this.item = item;
-	/**
-	 * The next node. It's null if there's no a next node.
-	 * @type {LLNode|null}
-	 */
-	this.next = null;
-}
-
-LinkedList.prototype = new Aggregate();
-LinkedList.prototype.constructor = LinkedList;
-
-/**
- * Class for managing a linked list.
- * @param {...*} [args] The items for initializing the list.
- * @constructor
- */
-function LinkedList(args) {
-	/**
-	 * The first node of the list.
-	 * @type {LLNode|null}
-	 */
-	this.first = null;
-	/**
-	 * The last node of the list.
-	 * @type {LLNode|null}
-	 */
-	this.last = null;
-	/**
-	 * The length of the list.
-	 * @type {number}
-	 */
-	this.length = 0;
-
-    if(args && args.length) {
-        //builds the list from the range passed from the constructor
-        this.fromArray(args);
-    } else {
-        //builds the list from the parameters of the constructor
-        this.fromArray(arguments);
-    }
-}
-
-/**
- * @inheritDoc
- */
-LinkedList.prototype.getIterator = function () {
-	return new LinkedListIterator(this);
-};
-
-/**
- * Adds an item at the head of the list.
- * @param item {*} The item to add.
- * @return {void}
- */
-LinkedList.prototype.pushFront = function (item) {
-	var node = new LLNode(item);
-	node.next = this.first;
-	this.first = node;
-	if (!this.last)
-		this.last = node;
-	this.length++;
-};
-
-/**
- * Adds an item at the tail of the list.
- * @param item {*} The item to add.
- * @return {void}
- */
-LinkedList.prototype.pushBack = function (item) {
-	var node = new LLNode(item);
-	if (this.last)
-		this.last.next = node;
-	else
-		this.first = node;
-	this.last = node;
-	this.length++;
-};
-
-/**
- * Removes the first item of the list.
- * @return {*} The item removed. It's undefined if the list is empty.
- */
-LinkedList.prototype.popFront = function () {
-	if (this.length) {
-		var node = this.first;
-		this.first = this.first.next;
-		this.length--;
-		node.next = null;
-		return node.item;
-	}
-	return undefined;
-};
-
-/**
- * Removes the last item of the list.
- * @return {*} The item removed. It's undefined if the list is empty.
- */
-LinkedList.prototype.popBack = function () {
-	if (this.length) {
-		var node = this.last;
-		var next = this.first;
-		while (next.next && next.next.next) {
-			next = next.next;
-		}
-		if (node === next)
-			this.last = null;
-		else
-			this.last = next;
-		next.next = null;
-		this.length--;
-		return node.item;
-	}
-	return undefined;
-};
-
-/**
- * Removes the first times items of the list.
- * @param times {number} The number of times to repeat the popFront method.
- * @return {*} The item removed. It's undefined if the list is empty.
- */
-LinkedList.prototype.multiPopFront = function (times) {
-	var result = [];
-	for (var i = 0; i < times && this.length; i++)
-		result.push(this.popFront());
-	return result;
-};
-
-/**
- * Removes the last times items of the list.
- * @param times {number} The number of times to repeat the popBack method.
- * @return {*} The items removed.
- */
-LinkedList.prototype.multiPopBack = function (times) {
-	var result = [];
-	for (var i = 0; i < times && this.length; i++)
-		result.push(this.popBack());
-	return result;
-};
-
-/**
- * Returns the first item of the list without remove it.
- * @return {*} The item at the top of the list. It's undefined if the list is empty.
- */
-LinkedList.prototype.peek = function () {
-	if (!this.length)
-		return undefined;
-	return this.first.item;
-};
-
-/**
- * Add the item at the index position.
- * @param item {*} The item to add.
- * @param index {number} The position where to add the item. If index is negative, the item won't be added.
- * @return {void}
- */
-LinkedList.prototype.addAt = function (item, index) {
-	if (index < 0)
-		return;
-	if (!index) {
-		this.pushFront(item);
-		return;
-	}
-	if (index === this.length) {
-		this.pushBack(item);
-		return;
-	}
-	var node = this.first;
-	if (!node && index > 0)
-		this.pushBack(undefined);
-	for (var i = 0; i < index - 1; i++, node = node.next) {
-		if (node === this.last)
-			this.pushBack(undefined);
-	}
-	if (node === this.last)
-		this.pushBack(item);
-	else if (node === this.first)
-		this.pushFront(item);
-	else {
-		var newNode = new LLNode(item);
-		newNode.next = node.next;
-		node.next = newNode;
-		this.length++;
-	}
-};
-
-/**
- * Removes the item at the index position.
- * @param index {number} The position of the item to remove.
- * @return {*} The item stored at the position index. It's undefined if the index is out of bounds.
- */
-LinkedList.prototype.removeAt = function (index) {
-	if (index < 0 || index > this.length - 1)
-		return undefined;
-	if (index === 0)
-		return this.popFront();
-	if (index === this.length - 1)
-		return this.popBack();
-	var node = this.first;
-	for (; index > 1; index--)
-		node = node.next;
-	//now node is the node before the node to remove
-	//node to remove
-	var next = node.next;
-	node.next = next.next;
-	this.length--;
-	return next.item;
-};
-
-/**
- * Removes the item from the list.
- * @param item {*} The item to remove.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {void}
- */
-LinkedList.prototype.remove = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var node = this.first;
-	var previous = null;
-	while (node) {
-		if (callback(node.item)) {
-			if (node === this.first)
-				this.first = node.next;
-			if (node === this.last)
-				this.last = previous;
-			if (previous)
-				previous.next = node.next;
-			return;
-		}
-		previous = node;
-		node = node.next;
-	}
-};
-
-/**
- * Removes all the item from the list.
- * @param item {*} The item to remove.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {void}
- */
-LinkedList.prototype.removeAll = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var node = this.first;
-	var previous = null;
-	while (node) {
-		if (callback(node.item)) {
-			if (node === this.first)
-				this.first = node.next;
-			if (node === this.last)
-				this.last = previous;
-			if (previous)
-				previous.next = node.next;
-		} else
-			previous = node;
-		node = node.next;
-	}
-};
-
-/**
- * Removes all the items stored from the from position to the to position.
- * If from > to, the method will remove all the items up to the end.
- * @param from {number} The position where start to remove the items. The from position is included.
- * @param to {number} The position where stop to remove the items. The to position is included.
- * @return {Array<*>} The items removed.
- */
-LinkedList.prototype.removeSegment = function (from, to) {
-	var result = [];
-	if (to > -1 && from < this.length) {
-		if (from === 0)
-			return this.multiPopFront(to + 1);
-		if (to === this.length - 1 || from > to)
-			return this.multiPopBack(Math.max(to - from, this.length - from)).reverse();
-		var node = this.first;
-		for (var i = 0; i < from - 1; i++)
-			node = node.next;
-		//now node is the node before the node to remove
-		//node to remove
-		var next = node.next;
-		for (var j = from; j < to + 1 && j < this.length; j++) {
-			result.push(next.item);
-			next = next.next;
-		}
-		this.length -= Math.min(to - from + 1, this.length - from);
-		node.next = next;
-	}
-	return result;
-};
-
-/**
- * Change the item stored in the index position. If the index is out of bound, the node won't be updated.
- * @param index {number} The position of the node to modify.
- * @param item {*} The new item stored in the node.
- * @return {void}
- */
-LinkedList.prototype.modifyAt = function (index, item) {
-	var node = this.getNode(index);
-	if (node)
-		node.item = item;
-};
-
-/**
- * Removes all the items stored in the list.
- * @return {void}
- */
-LinkedList.prototype.clear = function () {
-	this.first = null;
-	this.last = null;
-	this.length = 0;
-};
-
-/**
- * Checks if the list contains an item that satisfy the condition represented by the callback function.
- * @param item {*} The item to find.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {boolean} True if the list contains the item that satisfy the condition, false otherwise.
- */
-LinkedList.prototype.contains = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0;
-	var node = this.first;
-	while (i < this.length && !callback(node.item)) {
-		i++;
-		node = node.next;
-	}
-	return i < this.length;
-};
-
-/**
- * Executes the callback function for each item of the stack.
- * This method modifies the list so if you don't need to modify it you must return the same item of the array.
- * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
- * @return {void}
- */
-LinkedList.prototype.execute = function (callback) {
-	var node = this.first;
-	while (node) {
-		node.item = callback(node.item);
-		node = node.next;
-	}
-};
-
-/**
- * Returns the node at the position index.
- * @param index {number} The position of the node.
- * @return {LLNode} The node stored at the position index. It's undefined if index isn't in the list bounds.
- */
-LinkedList.prototype.getNode = function (index) {
-	if (index < 0 || index > this.length - 1)
-		return undefined;
-	var node = this.first;
-	for (; index > 0; index--)
-		node = node.next;
-	return node;
-};
-
-/**
- * Returns the item at the position index.
- * @param index {number} The position of the item.
- * @return {*} The item stored at the position index. It's undefined if index isn't in the list bounds.
- */
-LinkedList.prototype.getItem = function (index) {
-	if (index < 0 || index > this.length - 1)
-		return undefined;
-	var node = this.first;
-	for (; index > 0; index--)
-		node = node.next;
-	return node.item;
-};
-
-/**
- * Transforms the list into an array.
- * @return {Array<*>} The array built.
- */
-LinkedList.prototype.toArray = function () {
-	var array = [];
-	for (var node = this.first, i = 0; node; node = node.next, i++)
-		array[i] = node.item;
-	return array;
-};
-
-/**
- * Returns the length of the list.
- * @return {Number} The length of the list.
- */
-LinkedList.prototype.getLength = function () {
-	return this.length;
-};
-
-/**
- * Builds the list from the array.
- * @param array {Array<*>} The array from which build the list.
- * @return {void}
- */
-LinkedList.prototype.fromArray = function (array) {
-	var node = this.first;
-	for (var i = 0; i < Math.min(this.length, array.length); i++, node = node.next)
-		node.item = array[i];
-	if (this.length < array.length)
-		for (var j = this.length; j < array.length; j++)
-			this.pushBack(array[j]);
-	else
-		for (var k = array.length; k < this.length;)
-			this.popBack();
-};
-
-/**
- * Returns the items that satisfy the condition determined by the callback.
- * @param callback {function} The function that implements the condition.
- * @return {Array<*>} The array that contains the items that satisfy the condition.
- */
-LinkedList.prototype.filter = function (callback) {
-	var result = [];
-	for (var node = this.first; node; node = node.next) {
-		if (callback(node.item))
-			result.push(node.item);
-	}
-	return result;
-};
-
-/**
- * Checks if the list is empty.
- * @return {boolean} True if the list is empty, false otherwise.
- */
-LinkedList.prototype.isEmpty = function () {
-	return !this.length;
-};
-
-/**
- * Returns the first position of the item in the list.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The first position of the item.
- */
-LinkedList.prototype.indexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0;
-	var node = this.first;
-	while (node) {
-		if (callback(node.item))
-			return i;
-		i++;
-		node = node.next;
-	}
-	return -1;
-};
-
-/**
- * Returns the last position of the item in the list.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The last position of the item.
- */
-LinkedList.prototype.lastIndexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0;
-	var node = this.first;
-	var index = -1;
-	while (node) {
-		if (callback(node.item))
-			index = i;
-		i++;
-		node = node.next;
-	}
-	return index;
-};
-
-/**
- * Returns all the position in which the item has been found in the list.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {Array<number>} The positions in which the item has been found.
- */
-LinkedList.prototype.allIndexesOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0;
-	var node = this.first;
-	var indexes = [];
-	while (node) {
-		if (callback(node.item))
-			indexes.push(i);
-		i++;
-		node = node.next;
-	}
-	return indexes;
-};
-
-/**
- * Add the list at the end of this list.
- * @param list {LinkedList} The list to join.
- * @return {void}
- */
-LinkedList.prototype.join = function (list) {
-	if (this.last)
-		this.last.next = list.first;
-	else
-		this.first = list.first;
-	this.last = list.last;
-	this.length += list.length;
-};
-
-/**
- * Divides the list at the index position. The node at the index position is the first new node of the list.
- * @param index {number} The position where to divide the list.
- * @return {LinkedList} The list formed by the nodes from the index position then. If the index is out of bound, the list will be empty.
- */
-LinkedList.prototype.divide = function (index) {
-	var list = new LinkedList();
-	if (index > -1 && index < this.length) {
-		var node = this.first;
-		var previous = null;
-		for (var i = 0; i < index; i++) {
-			previous = node;
-			node = node.next;
-		}
-		if (node === this.first) {
-			list.first = this.first;
-			list.last = this.last;
-			this.first = null;
-			this.last = null;
-		} else {
-			list.first = node;
-			list.last = this.last;
-			this.last = previous;
-			previous.next = null;
-		}
-		list.length = this.length - index;
-		this.length = index;
-	}
-	return list;
-};
-
-/**
- * Clones the list into a new list.
- * @return {LinkedList} The list cloned from this list.
- */
-LinkedList.prototype.clone = function () {
-	var list = new LinkedList();
-	var node = this.first;
-	for (var i = 0; i < this.length; i++, node = node.next)
-		if (node.item.clone)
-			list.pushBack(node.item.clone());
-		else
-			list.pushBack(node.item);
-	return list;
-};
-
-/**
- * Clones the list into a new list without cloning duplicated items.
- * @return {LinkedList} The list cloned from this list.
- */
-LinkedList.prototype.cloneDistinct = function () {
-	var list = new LinkedList();
-	var node = this.first;
-	for (var i = 0; i < this.length; i++, node = node.next)
-		if (!list.contains(node.item))
-			if (node.item.cloneDistinct)
-				list.pushBack(node.item.cloneDistinct());
-			else if (node.item.clone)
-				list.pushBack(node.item.clone());
-			else
-				list.pushBack(node.item);
-	return list;
-};
-
-/**
- * Splits the list into lists of desired size.
- * @param size {number} The size of the lists.
- * @return {Array<LinkedList>} The lists created by splitting the list.
- */
-LinkedList.prototype.split = function (size) {
-	var length = this.length;
-	var lists = [this];
-	for (var i = size; i < length; i += size)
-		lists.push(lists[lists.length - 1].divide(size));
-	return lists;
-};
-
-/**
- * Returns the number of items that satisfy the represented by the callback function.
- * @param callback {function} The condition to satisfy.
- * @return {number} The number of items that satisfy the condition.
- */
-LinkedList.prototype.count = function (callback) {
-	var count = 0;
-	var node = this.first;
-	while (node) {
-		if (callback(node.item))
-			count++;
-		node = node.next;
-	}
-	return count;
-};
diff --git a/lib/LinkedList/LinkedList.ts b/lib/LinkedList/LinkedList.ts
new file mode 100644
index 0000000..85cb698
--- /dev/null
+++ b/lib/LinkedList/LinkedList.ts
@@ -0,0 +1,705 @@
+/**
+ * Created by Stefano on 31/03/14.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+namespace ds
+{
+	export class LLNode<T>
+	{
+		/**
+		 * The item stored.
+		 * @type {*}
+		 */
+		item: T;
+		/**
+		 * The next node. It's null if there's no a next node.
+		 * @type {LLNode|null}
+		 */
+		next: LLNode<T> = <any>null;
+
+		/**
+		 * The single node of the list.
+		 * @param item {*} The item to store in the node.
+		 * @constructor
+		 */
+		constructor(item: T)
+		{
+			this.item = item;
+		}
+	}
+
+	export class LinkedList<T> extends Aggregate
+	{
+
+		/**
+		 * The first node of the list.
+		 * @type {LLNode|null}
+		 */
+		first: LLNode<T> = <any>null;
+		/**
+		 * The last node of the list.
+		 * @type {LLNode|null}
+		 */
+		last: LLNode<T> = <any>null;
+		/**
+		 * The length of the list.
+		 * @type {number}
+		 */
+		length = 0;
+
+		/**
+		 * Class for managing a linked list.
+		 * @param {...*} [args] The items for initializing the list.
+		 * @constructor
+		 */
+		constructor(...args: any[])
+		{
+			super();
+			this.first = <any>null;
+			this.last = <any>null;
+			this.length = 0;
+
+			if (args && args.length == 1 && args[0] instanceof Array)
+			{
+				//builds the list from the range passed from the constructor
+				this.fromArray(args[0]);
+			} else
+			{
+				//builds the list from the parameters of the constructor
+				this.fromArray(args);
+			}
+		}
+
+		/**
+		 * @inheritDoc
+		 */
+		getIterator()
+		{
+			return new LinkedListIterator<T>(this);
+		};
+
+		/**
+		 * Adds an item at the head of the list.
+		 * @param item {*} The item to add.
+		 * @return {void}
+		 */
+		pushFront(item: T)
+		{
+			var node = new LLNode(item);
+			node.next = this.first;
+			this.first = node;
+			if (!this.last)
+				this.last = node;
+			this.length++;
+		};
+
+		/**
+		 * Adds an item at the tail of the list.
+		 * @param item {*} The item to add.
+		 * @return {void}
+		 */
+		pushBack(item: T)
+		{
+			var node = new LLNode(item);
+			if (this.last)
+				this.last.next = node;
+			else
+				this.first = node;
+			this.last = node;
+			this.length++;
+		};
+
+		/**
+		 * Removes the first item of the list.
+		 * @return {*} The item removed. It's undefined if the list is empty.
+		 */
+		popFront()
+		{
+			if (this.length)
+			{
+				var node = this.first;
+				this.first = this.first.next;
+				this.length--;
+				node.next = <any>null;
+				return node.item;
+			}
+			return undefined;
+		};
+
+		/**
+		 * Removes the last item of the list.
+		 * @return {*} The item removed. It's undefined if the list is empty.
+		 */
+		popBack()
+		{
+			if (this.length)
+			{
+				var node = this.last;
+				var next = this.first;
+				while (next.next && next.next.next)
+				{
+					next = next.next;
+				}
+				if (node === next)
+					this.last = <any>null;
+				else
+					this.last = next;
+				next.next = <any>null;
+				this.length--;
+				return node.item;
+			}
+			return undefined;
+		};
+
+		/**
+		 * Removes the first times items of the list.
+		 * @param times {number} The number of times to repeat the popFront method.
+		 * @return {*} The item removed. It's undefined if the list is empty.
+		 */
+		multiPopFront(times: number)
+		{
+			var result = [];
+			for (var i = 0; i < times && this.length; i++)
+				result.push(this.popFront());
+			return result;
+		};
+
+		/**
+		 * Removes the last times items of the list.
+		 * @param times {number} The number of times to repeat the popBack method.
+		 * @return {*} The items removed.
+		 */
+		multiPopBack(times: number)
+		{
+			var result = [];
+			for (var i = 0; i < times && this.length; i++)
+				result.push(this.popBack());
+			return result;
+		};
+
+		/**
+		 * Returns the first item of the list without remove it.
+		 * @return {*} The item at the top of the list. It's undefined if the list is empty.
+		 */
+		peek()
+		{
+			if (!this.length)
+				return undefined;
+			return this.first.item;
+		};
+
+		/**
+		 * Add the item at the index position.
+		 * @param item {*} The item to add.
+		 * @param index {number} The position where to add the item. If index is negative, the item won't be added.
+		 * @return {void}
+		 */
+		addAt(item: T, index: number)
+		{
+			if (index < 0)
+				return;
+			if (!index)
+			{
+				this.pushFront(item);
+				return;
+			}
+			if (index === this.length)
+			{
+				this.pushBack(item);
+				return;
+			}
+			var node = this.first;
+			if (!node && index > 0)
+				this.pushBack(<any>undefined);
+			for (var i = 0; i < index - 1; i++ , node = node.next)
+			{
+				if (node === this.last)
+					this.pushBack(<any>undefined);
+			}
+			if (node === this.last)
+				this.pushBack(item);
+			else if (node === this.first)
+				this.pushFront(item);
+			else
+			{
+				var newNode = new LLNode(item);
+				newNode.next = node.next;
+				node.next = newNode;
+				this.length++;
+			}
+		};
+
+		/**
+		 * Removes the item at the index position.
+		 * @param index {number} The position of the item to remove.
+		 * @return {*} The item stored at the position index. It's undefined if the index is out of bounds.
+		 */
+		removeAt(index: number)
+		{
+			if (index < 0 || index > this.length - 1)
+				return undefined;
+			if (index === 0)
+				return this.popFront();
+			if (index === this.length - 1)
+				return this.popBack();
+			var node = this.first;
+			for (; index > 1; index--)
+				node = node.next;
+			//now node is the node before the node to remove
+			//node to remove
+			var next = node.next;
+			node.next = next.next;
+			this.length--;
+			return next.item;
+		};
+
+		/**
+		 * Removes the item from the list.
+		 * @param item {*} The item to remove.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {void}
+		 */
+		remove(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var node = this.first;
+			var previous: LLNode<T> = <any>null;
+			while (node)
+			{
+				if (callback(node.item))
+				{
+					if (node === this.first)
+						this.first = node.next;
+					if (node === this.last)
+						this.last = previous;
+					if (previous)
+						previous.next = node.next;
+					return;
+				}
+				previous = node;
+				node = node.next;
+			}
+		};
+
+		/**
+		 * Removes all the item from the list.
+		 * @param item {*} The item to remove.
+		 * @param [callback (item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {void}
+		 */
+		removeAll(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var node = this.first;
+			var previous: LLNode<T> = <any>null;
+			while (node)
+			{
+				if (callback(node.item))
+				{
+					if (node === this.first)
+						this.first = node.next;
+					if (node === this.last)
+						this.last = previous;
+					if (previous)
+						previous.next = node.next;
+				} else
+					previous = node;
+				node = node.next;
+			}
+		};
+
+		/**
+		 * Removes all the items stored from the from position to the to position.
+		 * If from > to, the method will remove all the items up to the end.
+		 * @param from {number} The position where start to remove the items. The from position is included.
+		 * @param to {number} The position where stop to remove the items. The to position is included.
+		 * @return {Array<*>} The items removed.
+		 */
+		removeSegment(from: number, to: number)
+		{
+			var result = [];
+			if (to > -1 && from < this.length)
+			{
+				if (from === 0)
+					return this.multiPopFront(to + 1);
+				if (to === this.length - 1 || from > to)
+					return this.multiPopBack(Math.max(to - from, this.length - from)).reverse();
+				var node = this.first;
+				for (var i = 0; i < from - 1; i++)
+					node = node.next;
+				//now node is the node before the node to remove
+				//node to remove
+				var next = node.next;
+				for (var j = from; j < to + 1 && j < this.length; j++)
+				{
+					result.push(next.item);
+					next = next.next;
+				}
+				this.length -= Math.min(to - from + 1, this.length - from);
+				node.next = next;
+			}
+			return result;
+		};
+
+		/**
+		 * Change the item stored in the index position. If the index is out of bound, the node won't be updated.
+		 * @param index {number} The position of the node to modify.
+		 * @param item {*} The new item stored in the node.
+		 * @return {void}
+		 */
+		modifyAt(index: number, item: any)
+		{
+			var node = this.getNode(index);
+			if (node)
+				node.item = item;
+		};
+
+		/**
+		 * Removes all the items stored in the list.
+		 * @return {void}
+		 */
+		clear()
+		{
+			this.first = <any>null;
+			this.last = <any>null;
+			this.length = 0;
+		};
+
+		/**
+		 * Checks if the list contains an item that satisfy the condition represented by the callback function.
+		 * @param item {*} The item to find.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {boolean} True if the list contains the item that satisfy the condition, false otherwise.
+		 */
+		contains(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var i = 0;
+			var node = this.first;
+			while (i < this.length && !callback(node.item))
+			{
+				i++;
+				node = node.next;
+			}
+			return i < this.length;
+		};
+
+		/**
+		 * Executes the callback function for each item of the stack.
+		 * This method modifies the list so if you don't need to modify it you must return the same item of the array.
+		 * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+		 * @return {void}
+		 */
+		execute(callback: (item: T) => any)
+		{
+			var node = this.first;
+			while (node)
+			{
+				node.item = callback(node.item);
+				node = node.next;
+			}
+		};
+
+		/**
+		 * Returns the node at the position index.
+		 * @param index {number} The position of the node.
+		 * @return {LLNode} The node stored at the position index. It's undefined if index isn't in the list bounds.
+		 */
+		getNode(index: number)
+		{
+			if (index < 0 || index > this.length - 1)
+				return undefined;
+			var node = this.first;
+			for (; index > 0; index--)
+				node = node.next;
+			return node;
+		};
+
+		/**
+		 * Returns the item at the position index.
+		 * @param index {number} The position of the item.
+		 * @return {*} The item stored at the position index. It's undefined if index isn't in the list bounds.
+		 */
+		getItem(index: number)
+		{
+			if (index < 0 || index > this.length - 1)
+				return undefined;
+			var node = this.first;
+			for (; index > 0; index--)
+				node = node.next;
+			return node.item;
+		};
+
+		/**
+		 * Transforms the list into an array.
+		 * @return {Array<*>} The array built.
+		 */
+		toArray()
+		{
+			var array = [];
+			for (var node = this.first, i = 0; node; node = node.next, i++)
+				array[i] = node.item;
+			return array;
+		};
+
+		/**
+		 * Returns the length of the list.
+		 * @return {Number} The length of the list.
+		 */
+		getLength()
+		{
+			return this.length;
+		};
+
+		/**
+		 * Builds the list from the array.
+		 * @param array {Array<*>} The array from which build the list.
+		 * @return {void}
+		 */
+		fromArray(array: T[])
+		{
+			var node = this.first;
+			for (var i = 0; i < Math.min(this.length, array.length); i++ , node = node.next)
+				node.item = array[i];
+			if (this.length < array.length)
+				for (var j = this.length; j < array.length; j++)
+					this.pushBack(array[j]);
+			else
+				for (var k = array.length; k < this.length;)
+					this.popBack();
+		};
+
+		/**
+		 * Returns the items that satisfy the condition determined by the callback.
+		 * @param callback {function} The function that implements the condition.
+		 * @return {Array<*>} The array that contains the items that satisfy the condition.
+		 */
+		filter(callback: (item: T) => boolean)
+		{
+			var result = [];
+			for (var node = this.first; node; node = node.next)
+			{
+				if (callback(node.item))
+					result.push(node.item);
+			}
+			return result;
+		};
+
+		/**
+		 * Checks if the list is empty.
+		 * @return {boolean} True if the list is empty, false otherwise.
+		 */
+		isEmpty()
+		{
+			return !this.length;
+		};
+
+		/**
+		 * Returns the first position of the item in the list.
+		 * @param item {*} The item to search.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {number} The first position of the item.
+		 */
+		indexOf(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var i = 0;
+			var node = this.first;
+			while (node)
+			{
+				if (callback(node.item))
+					return i;
+				i++;
+				node = node.next;
+			}
+			return -1;
+		};
+
+		/**
+		 * Returns the last position of the item in the list.
+		 * @param item {*} The item to search.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {number} The last position of the item.
+		 */
+		lastIndexOf(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var i = 0;
+			var node = this.first;
+			var index = -1;
+			while (node)
+			{
+				if (callback(node.item))
+					index = i;
+				i++;
+				node = node.next;
+			}
+			return index;
+		};
+
+		/**
+		 * Returns all the position in which the item has been found in the list.
+		 * @param item {*} The item to search.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {Array<number>} The positions in which the item has been found.
+		 */
+		allIndexesOf(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var i = 0;
+			var node = this.first;
+			var indexes = [];
+			while (node)
+			{
+				if (callback(node.item))
+					indexes.push(i);
+				i++;
+				node = node.next;
+			}
+			return indexes;
+		};
+
+		/**
+		 * Add the list at the end of this list.
+		 * @param list {LinkedList} The list to join.
+		 * @return {void}
+		 */
+		join(list: LinkedList<T>)
+		{
+			if (this.last)
+				this.last.next = list.first;
+			else
+				this.first = list.first;
+			this.last = list.last;
+			this.length += list.length;
+		};
+
+		/**
+		 * Divides the list at the index position. The node at the index position is the first new node of the list.
+		 * @param index {number} The position where to divide the list.
+		 * @return {LinkedList} The list formed by the nodes from the index position then. If the index is out of bound, the list will be empty.
+		 */
+		divide(index: number)
+		{
+			var list = new LinkedList<T>();
+			if (index > -1 && index < this.length)
+			{
+				var node = this.first;
+				var previous: LLNode<T> = <any>null;
+				for (var i = 0; i < index; i++)
+				{
+					previous = node;
+					node = node.next;
+				}
+				if (node === this.first)
+				{
+					list.first = this.first;
+					list.last = this.last;
+					this.first = <any>null;
+					this.last = <any>null;
+				} else
+				{
+					list.first = node;
+					list.last = this.last;
+					this.last = previous;
+					previous.next = <any>null;
+				}
+				list.length = this.length - index;
+				this.length = index;
+			}
+			return list;
+		};
+
+		/**
+		 * Clones the list into a new list.
+		 * @return {LinkedList} The list cloned from this list.
+		 */
+		clone()
+		{
+			var list = new LinkedList<T>();
+			var node = this.first;
+			for (var i = 0; i < this.length; i++ , node = node.next)
+			{
+				var item: any = node.item;
+				if (item.clone)
+					list.pushBack(item.clone());
+				else
+					list.pushBack(item);
+			}
+			return list;
+		};
+
+		/**
+		 * Clones the list into a new list without cloning duplicated items.
+		 * @return {LinkedList} The list cloned from this list.
+		 */
+		cloneDistinct()
+		{
+			var list = new LinkedList<T>();
+			var node = this.first;
+			for (var i = 0; i < this.length; i++ , node = node.next)
+				if (!list.contains(node.item))
+				{
+					var item: any = node.item;
+					if (item.cloneDistinct)
+						list.pushBack(item.cloneDistinct());
+					else if (item.clone)
+						list.pushBack(item.clone());
+					else
+						list.pushBack(item);
+				}
+			return list;
+		};
+
+		/**
+		 * Splits the list into lists of desired size.
+		 * @param size {number} The size of the lists.
+		 * @return {Array<LinkedList>} The lists created by splitting the list.
+		 */
+		split(size: number)
+		{
+			var length = this.length;
+			var lists: LinkedList<T>[] = [this];
+			for (var i = size; i < length; i += size)
+				lists.push(lists[lists.length - 1].divide(size));
+			return lists;
+		};
+
+		/**
+		 * Returns the number of items that satisfy the represented by the callback function.
+		 * @param callback {function} The condition to satisfy.
+		 * @return {number} The number of items that satisfy the condition.
+		 */
+		count(callback: (item: T) => boolean)
+		{
+			var count = 0;
+			var node = this.first;
+			while (node)
+			{
+				if (callback(node.item))
+					count++;
+				node = node.next;
+			}
+			return count;
+		};
+
+	}
+}
\ No newline at end of file
diff --git a/lib/LinkedList/LinkedListIterator.js b/lib/LinkedList/LinkedListIterator.js
deleted file mode 100644
index 90237dd..0000000
--- a/lib/LinkedList/LinkedListIterator.js
+++ /dev/null
@@ -1,78 +0,0 @@
-/**
- * Created by Stefano on 04/04/2014.
- */
-
-LinkedListIterator.prototype = new Iterator();
-LinkedListIterator.prototype.constructor = LinkedListIterator;
-
-/**
- * Class that implements the iterator for a linked list.
- * @param aggregate {LinkedList} The aggregate to scan.
- * @constructor
- */
-function LinkedListIterator(aggregate) {
-	/**
-	 * The aggregate relates to this iterator.
-	 * @type {LinkedList}
-	 */
-	this.aggregate = aggregate;
-
-	/**
-	 * The pointer to the position.
-	 * @type {Node|null}
-	 */
-	this.pointer = null;
-}
-
-/**
- * @inheritDoc
- */
-LinkedListIterator.prototype.first = function () {
-	this.pointer = this.aggregate.first;
-};
-
-/**
- * @inheritDoc
- */
-LinkedListIterator.prototype.next = function () {
-	this.pointer = this.pointer.next;
-};
-
-/**
- * @inheritDoc
- */
-LinkedListIterator.prototype.last = function () {
-	this.pointer = this.aggregate.last;
-};
-
-/**
- * @inheritDoc
- */
-LinkedListIterator.prototype.previous = function () {
-	var node = this.pointer;
-	for (this.pointer = this.first(); this.pointer.next !== node;)
-		this.next();
-};
-
-/**
- * @inheritDoc
- */
-LinkedListIterator.prototype.isDone = function () {
-	return !this.pointer;
-};
-
-/**
- * @inheritDoc
- */
-LinkedListIterator.prototype.getItem = function () {
-	return this.pointer.item;
-};
-
-/**
- * Return the node stored at the position pointed by the iterator.
- * @abstract
- * @return {Node|null} The node stored or null if it's out of the bounds.
- */
-LinkedListIterator.prototype.getNode = function () {
-	return this.pointer;
-};
\ No newline at end of file
diff --git a/lib/LinkedList/LinkedListIterator.ts b/lib/LinkedList/LinkedListIterator.ts
new file mode 100644
index 0000000..895bb81
--- /dev/null
+++ b/lib/LinkedList/LinkedListIterator.ts
@@ -0,0 +1,93 @@
+/**
+ * Created by Stefano on 04/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+namespace ds
+{
+	export class LinkedListIterator<T> implements Iterator
+	{
+		/**
+		 * The aggregate relates to this iterator.
+		 * @type {LinkedList}
+		 */
+		aggregate: LinkedList<T>;
+
+		/**
+		 * The pointer to the position.
+		 * @type {Node|null}
+		 */
+		pointer: LLNode<T> = <any>null;
+
+		/**
+		 * Class that implements the iterator for a linked list.
+		 * @param aggregate {LinkedList} The aggregate to scan.
+		 * @constructor
+		 */
+		constructor(aggregate: LinkedList<T>)
+		{
+			this.aggregate = aggregate;
+			this.pointer = <any>null;
+		}
+
+		/**
+		 * @inheritDoc
+		 */
+		first()
+		{
+			return this.pointer = this.aggregate.first;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		next()
+		{
+			this.pointer = this.pointer.next;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		last()
+		{
+			this.pointer = this.aggregate.last;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		previous()
+		{
+			var node = this.pointer;
+			for (this.pointer = this.first(); this.pointer.next !== node;)
+				this.next();
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		isDone()
+		{
+			return !this.pointer;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		getItem()
+		{
+			return this.pointer.item;
+		};
+
+		/**
+		 * Return the node stored at the position pointed by the iterator.
+		 * @abstract
+		 * @return {Node|null} The node stored or null if it's out of the bounds.
+		 */
+		getNode()
+		{
+			return this.pointer;
+		};
+
+	}
+}
\ No newline at end of file
diff --git a/lib/PriorityQueue/PriorityQueue.js b/lib/PriorityQueue/PriorityQueue.js
deleted file mode 100644
index 373c9b4..0000000
--- a/lib/PriorityQueue/PriorityQueue.js
+++ /dev/null
@@ -1,264 +0,0 @@
-/**
- * Created by Stefano on 31/03/14.
- */
-
-PriorityQueue.prototype = new Aggregate();
-PriorityQueue.prototype.constructor = PriorityQueue;
-
-/**
- * Class for managing a priority queue.
- * @constructor
- */
-function PriorityQueue() {
-	/**
-	 * The list of the items in the queue.
-	 * @type {RBTreeList}
-	 */
-	this.items = new RBTreeList();
-	/**
-	 * The length of the queue.
-	 * @type {number}
-	 */
-	this.length = 0;
-}
-
-/**
- * @inheritDoc
- */
-PriorityQueue.prototype.getIterator = function () {
-	return new PriorityQueueIterator(this);
-};
-
-/**
- * Add the item at the tail of the queue.
- * @param priority {number} The priority of the item.
- * @param item {*} The item to add.
- * @return {void}
- */
-PriorityQueue.prototype.enqueue = function (priority, item) {
-	var queue = this.items.search(priority);
-	if (!queue) {
-		queue = new Queue();
-		this.items.insert(priority, queue);
-	}
-	queue.enqueue(item);
-	this.length++;
-};
-
-/**
- * Adds the items with the same priority at the tail of the queue.
- * @param priority {number} The priority of the items.
- * @param items {Array<*>} The items to add.
- * @return {void}
- */
-PriorityQueue.prototype.multiEnqueue = function (priority, items) {
-	for (var i = 0; i < items.length; i++)
-		this.enqueue(priority, items[i]);
-};
-
-/**
- * Remove the item at the head of the queue.
- * @return {*} The item at the head of the queue. It's undefined if the queue is empty.
- */
-PriorityQueue.prototype.dequeue = function () {
-	var node = this.items.maximum();
-	var item = undefined;
-	if (node) {
-		var queue = node.item;
-		item = queue.dequeue();
-		if (queue.isEmpty())
-			this.items.deleteNode(node);
-		this.length--;
-	}
-	return item;
-};
-
-/**
- * Removes the items at the head of the queue.
- * @param times {number} The number of times to repeat the dequeue method.
- * @return {Array<*>} The items at the head of the queue.
- */
-PriorityQueue.prototype.multiDequeue = function (times) {
-	var items = [];
-	for (var i = 0; i < times && this.length; i++)
-		items.push(this.dequeue());
-	return items;
-};
-
-/**
- * Removes the first length items from the position index.
- * @param index {number} The position where to start to remove the items.
- * @param [length = 1] {number} The number of items to remove.
- * @return {void}
- */
-PriorityQueue.prototype.remove = function (index, length) {
-	length = length || 1;
-	var it = this.items.getIterator();
-	for (it.last(); !it.isDone() && length > 0; it.previous()) {
-		var queue = it.getItem();
-		if (index > -1 && index < queue.getLength()) {
-			var oldLength = queue.getLength();
-			queue.remove(index, length);
-			length -= oldLength - index;
-			index = 0;
-			if (!queue.getLength())
-				this.items.deleteNode(it.getNode());
-		} else
-			index = index - queue.getLength();
-	}
-};
-
-/**
- * Return the item at the position index.
- * @param index {number} The index of the item.
- * @return {*} The item found. It's undefined if the position index is out of bounds.
- */
-PriorityQueue.prototype.getItem = function (index) {
-	var it = this.items.getIterator();
-	for (it.last(); !it.isDone(); it.previous()) {
-		var queue = it.getItem();
-		if (index > -1 && index < queue.getLength())
-			return queue.getItem(index);
-		index = index - queue.getLength();
-	}
-	return undefined;
-};
-
-/**
- * Return the items relatives to the priority.
- * @param priority {number} The priority of the items.
- * @return {Array<*>} The items found.
- */
-PriorityQueue.prototype.getItems = function (priority) {
-	var items = this.items.search(priority);
-	if (items)
-		return items.items;
-	return [];
-};
-
-/**
- * Return the first item in the queue. The item is not removed.
- * @return {*} The first item. It's undefined if the queue is empty.
- */
-PriorityQueue.prototype.peek = function () {
-	return this.items.maximum().item.peek();
-};
-
-/**
- * Return the length of the queue.
- * @return {number} The length of the queue.
- */
-PriorityQueue.prototype.getLength = function () {
-	return this.length;
-};
-
-/**
- * Checks if the queue is empty.
- * @return {boolean} True if the queue is empty, false otherwise.
- */
-PriorityQueue.prototype.isEmpty = function () {
-	return !this.length;
-};
-
-/**
- * Removes all the items stored in the queue.
- * @return {void}
- */
-PriorityQueue.prototype.clear = function () {
-	this.items = new RBTreeList();
-	this.length = 0;
-};
-
-/**
- * Checks if the queue contains a priority that satisfy the condition represented by the callback function.
- * @param priority {number} The priority to find.
- * @param [callback = function(p){return(p===priority);}] The condition to satisfy. The callback must accept the current priority to check.
- * @return {boolean} True if the queue contains the priority that satisfy the condition, false otherwise.
- */
-PriorityQueue.prototype.containsPriority = function (priority, callback) {
-	if (callback)
-		return this.items.fullContains(callback);
-	else
-		return this.items.contains(priority);
-};
-
-/**
- * Return the queue created by the priority queue with the items in the same order but without the priority.
- * @return {Queue} The queue created.
- */
-PriorityQueue.prototype.toQueue = function () {
-	var queue = new Queue();
-	var it = this.items.getIterator();
-	for (it.last(); !it.isDone(); it.previous()) {
-		var item = it.getItem();
-		var itQ = item.getIterator();
-		for (itQ.first(); !itQ.isDone(); itQ.next())
-			queue.enqueue(itQ.getItem());
-	}
-	return queue;
-};
-
-/**
- * Executes the callback function for each item of the queue.
- * This method modifies the queue so if you don't need to modify it you must return the same item of the array.
- * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
- * @return {void}
- */
-PriorityQueue.prototype.execute = function (callback) {
-	var it = this.items.getIterator();
-	for (it.last(); !it.isDone(); it.previous())
-		it.getItem().execute(callback);
-};
-
-/**
- * Change the priority of the item at the position index.
- * @param index {number} The position of the item of which increase the priority.
- * @param newPriority {number} The new priority.
- * @return {void}
- */
-PriorityQueue.prototype.changePriority = function (index, newPriority) {
-	var item = this.getItem(index);
-	this.remove(index);
-	this.enqueue(newPriority, item);
-};
-
-/**
- * Returns the items that satisfy the condition determined by the callback.
- * @param callback {function} The function that implements the condition.
- * @return {Array<*>} The array that contains the items that satisfy the condition.
- */
-PriorityQueue.prototype.filter = function (callback) {
-	var result = [];
-	var it = this.items.getIterator();
-	for (it.last(); !it.isDone(); it.previous()) {
-		var itQ = it.getItem().getIterator();
-		for (itQ.first(); !itQ.isDone(); itQ.next()) {
-			if (callback(itQ.getItem()))
-				result.push(itQ.getItem());
-		}
-	}
-	return result;
-};
-
-/**
- * Clones the queue into a new queue.
- * @return {PriorityQueue} The queue cloned from this queue.
- */
-PriorityQueue.prototype.clone = function () {
-	var queue = new PriorityQueue();
-	queue.items = this.items.clone();
-	queue.length = this.length;
-	return queue;
-};
-
-/**
- * Clones the queue into a new queue without cloning duplicated items.
- * @return {PriorityQueue} The queue cloned from this queue.
- */
-PriorityQueue.prototype.cloneDistinct = function () {
-	var queue = new PriorityQueue();
-	queue.items = this.items.cloneDistinct();
-	queue.length = queue.items.getSize();
-	return queue;
-};
-
diff --git a/lib/PriorityQueue/PriorityQueue.ts b/lib/PriorityQueue/PriorityQueue.ts
new file mode 100644
index 0000000..c1d871d
--- /dev/null
+++ b/lib/PriorityQueue/PriorityQueue.ts
@@ -0,0 +1,299 @@
+/**
+ * Created by Stefano on 31/03/14.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+namespace ds
+{
+	export class PriorityQueue<T> extends Aggregate
+	{
+		/**
+		 * The list of the items in the queue.
+		 * @type {RBTreeList}
+		 */
+		items: RBTreeList<Queue<T>>;
+		/**
+		 * The length of the queue.
+		 * @type {number}
+		 */
+		length = 0;
+
+		/**
+		 * Class for managing a priority queue.
+		 * @constructor
+		 */
+		constructor()
+		{
+			super()
+			this.items = new RBTreeList<Queue<T>>();
+			this.length = 0;
+		}
+
+		/**
+		 * @inheritDoc
+		 */
+		getIterator()
+		{
+			return new PriorityQueueIterator<T>(this);
+		};
+
+		/**
+		 * Add the item at the tail of the queue.
+		 * @param priority {number} The priority of the item.
+		 * @param item {*} The item to add.
+		 * @return {void}
+		 */
+		enqueue(priority: number, item: T)
+		{
+			var queue = this.items.search(priority);
+			if (!queue)
+			{
+				queue = new Queue<T>();
+				this.items.insert(priority, queue);
+			}
+			queue.enqueue(item);
+			this.length++;
+		};
+
+		/**
+		 * Adds the items with the same priority at the tail of the queue.
+		 * @param priority {number} The priority of the items.
+		 * @param items {Array<*>} The items to add.
+		 * @return {void}
+		 */
+		multiEnqueue(priority: number, items: any[])
+		{
+			for (var i = 0; i < items.length; i++)
+				this.enqueue(priority, items[i]);
+		};
+
+		/**
+		 * Remove the item at the head of the queue.
+		 * @return {*} The item at the head of the queue. It's undefined if the queue is empty.
+		 */
+		dequeue()
+		{
+			var node = this.items.maximum();
+			var item = undefined;
+			if (node)
+			{
+				var queue = node.item;
+				item = queue.dequeue();
+				if (queue.isEmpty())
+					this.items.deleteNode(node);
+				this.length--;
+			}
+			return item;
+		};
+
+		/**
+		 * Removes the items at the head of the queue.
+		 * @param times {number} The number of times to repeat the dequeue method.
+		 * @return {Array<*>} The items at the head of the queue.
+		 */
+		multiDequeue(times: number)
+		{
+			var items = [];
+			for (var i = 0; i < times && this.length; i++)
+				items.push(this.dequeue());
+			return items;
+		};
+
+		/**
+		 * Removes the first length items from the position index.
+		 * @param index {number} The position where to start to remove the items.
+		 * @param [length = 1] {number} The number of items to remove.
+		 * @return {void}
+		 */
+		remove(index: number, length?: number)
+		{
+			length = length || 1;
+			var it = this.items.getIterator();
+			for (it.last(); !it.isDone() && length > 0; it.previous())
+			{
+				var queue = it.getItem();
+				if (index > -1 && index < queue.getLength())
+				{
+					var oldLength = queue.getLength();
+					queue.remove(index, length);
+					length -= oldLength - index;
+					index = 0;
+					if (!queue.getLength())
+						this.items.deleteNode(it.getNode());
+				} else
+					index = index - queue.getLength();
+			}
+		};
+
+		/**
+		 * Return the item at the position index.
+		 * @param index {number} The index of the item.
+		 * @return {*} The item found. It's undefined if the position index is out of bounds.
+		 */
+		getItem(index: number): T
+		{
+			var it = this.items.getIterator();
+			for (it.last(); !it.isDone(); it.previous())
+			{
+				var queue = it.getItem();
+				if (index > -1 && index < queue.getLength())
+					return queue.getItem(index);
+				index = index - queue.getLength();
+			}
+			return <any>undefined;
+		};
+
+		/**
+		 * Return the items relatives to the priority.
+		 * @param priority {number} The priority of the items.
+		 * @return {Array<*>} The items found.
+		 */
+		getItems(priority: number)
+		{
+			var items = this.items.search(priority);
+			if (items)
+				return items.items;
+			return [];
+		};
+
+		/**
+		 * Return the first item in the queue. The item is not removed.
+		 * @return {*} The first item. It's undefined if the queue is empty.
+		 */
+		peek()
+		{
+			return this.items.maximum().item.peek();
+		};
+
+		/**
+		 * Return the length of the queue.
+		 * @return {number} The length of the queue.
+		 */
+		getLength()
+		{
+			return this.length;
+		};
+
+		/**
+		 * Checks if the queue is empty.
+		 * @return {boolean} True if the queue is empty, false otherwise.
+		 */
+		isEmpty()
+		{
+			return !this.length;
+		};
+
+		/**
+		 * Removes all the items stored in the queue.
+		 * @return {void}
+		 */
+		clear()
+		{
+			this.items = new RBTreeList();
+			this.length = 0;
+		};
+
+		/**
+		 * Checks if the queue contains a priority that satisfy the condition represented by the callback function.
+		 * @param priority {number} The priority to find.
+		 * @param [callback = function(p){return(p===priority);}] The condition to satisfy. The callback must accept the current priority to check.
+		 * @return {boolean} True if the queue contains the priority that satisfy the condition, false otherwise.
+		 */
+		containsPriority(priority: number, callback?: (key: number) => boolean)
+		{
+			if (callback)
+				return this.items.fullContains(callback);
+			else
+				return this.items.contains(priority);
+		};
+
+		/**
+		 * Return the queue created by the priority queue with the items in the same order but without the priority.
+		 * @return {Queue} The queue created.
+		 */
+		toQueue()
+		{
+			var queue = new Queue<T>();
+			var it = this.items.getIterator();
+			for (it.last(); !it.isDone(); it.previous())
+			{
+				var item = it.getItem();
+				var itQ = item.getIterator();
+				for (itQ.first(); !itQ.isDone(); itQ.next())
+					queue.enqueue(itQ.getItem());
+			}
+			return queue;
+		};
+
+		/**
+		 * Executes the callback function for each item of the queue.
+		 * This method modifies the queue so if you don't need to modify it you must return the same item of the array.
+		 * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+		 * @return {void}
+		 */
+		execute(callback: (item: any) => any)
+		{
+			var it = this.items.getIterator();
+			for (it.last(); !it.isDone(); it.previous())
+				it.getItem().execute(callback);
+		};
+
+		/**
+		 * Change the priority of the item at the position index.
+		 * @param index {number} The position of the item of which increase the priority.
+		 * @param newPriority {number} The new priority.
+		 * @return {void}
+		 */
+		changePriority(index: number, newPriority: number)
+		{
+			var item = this.getItem(index);
+			this.remove(index);
+			this.enqueue(newPriority, item);
+		};
+
+		/**
+		 * Returns the items that satisfy the condition determined by the callback.
+		 * @param callback {function} The function that implements the condition.
+		 * @return {Array<*>} The array that contains the items that satisfy the condition.
+		 */
+		filter(callback: (item: any) => any)
+		{
+			var result = [];
+			var it = this.items.getIterator();
+			for (it.last(); !it.isDone(); it.previous())
+			{
+				var itQ = it.getItem().getIterator();
+				for (itQ.first(); !itQ.isDone(); itQ.next())
+				{
+					if (callback(itQ.getItem()))
+						result.push(itQ.getItem());
+				}
+			}
+			return result;
+		};
+
+		/**
+		 * Clones the queue into a new queue.
+		 * @return {PriorityQueue} The queue cloned from this queue.
+		 */
+		clone()
+		{
+			var queue = new PriorityQueue<T>();
+			queue.items = this.items.clone();
+			queue.length = this.length;
+			return queue;
+		};
+
+		/**
+		 * Clones the queue into a new queue without cloning duplicated items.
+		 * @return {PriorityQueue} The queue cloned from this queue.
+		 */
+		cloneDistinct()
+		{
+			var queue = new PriorityQueue<T>();
+			queue.items = this.items.cloneDistinct();
+			queue.length = queue.items.getSize();
+			return queue;
+		};
+
+	}
+}
\ No newline at end of file
diff --git a/lib/PriorityQueue/PriorityQueueIterator.js b/lib/PriorityQueue/PriorityQueueIterator.js
deleted file mode 100644
index deceffa..0000000
--- a/lib/PriorityQueue/PriorityQueueIterator.js
+++ /dev/null
@@ -1,83 +0,0 @@
-/**
- * Created by Stefano on 04/04/2014.
- */
-
-PriorityQueueIterator.prototype = new Iterator();
-PriorityQueueIterator.prototype.constructor = PriorityQueueIterator;
-
-/**
- * Class that implements the iterator for a priority queue.
- * @param aggregate {PriorityQueue} The aggregate to scan.
- * @constructor
- */
-function PriorityQueueIterator(aggregate) {
-	/**
-	 * The aggregate relates to this iterator.
-	 * @type {PriorityQueue}
-	 */
-	this.aggregate = aggregate;
-
-	/**
-	 * The pointer to the position of the node.
-	 * @type {RBLNode|null}
-	 */
-	this.pointerNode = null;
-	/**
-	 * The pointer to the position in the node.
-	 * @type {number}
-	 */
-	this.pointerPosition = -1;
-}
-
-/**
- * @inheritDoc
- */
-PriorityQueueIterator.prototype.first = function () {
-	this.pointerNode = this.aggregate.items.maximum();
-	this.pointerPosition = 0;
-};
-
-/**
- * @inheritDoc
- */
-PriorityQueueIterator.prototype.next = function () {
-	this.pointerPosition++;
-	if (this.pointerPosition > this.pointerNode.item.getLength() - 1) {
-		this.pointerNode = this.pointerNode.previous;
-		this.pointerPosition = 0;
-	}
-};
-
-/**
- * @inheritDoc
- */
-PriorityQueueIterator.prototype.last = function () {
-	this.pointerNode = this.aggregate.items.minimum();
-	this.pointerPosition = this.pointerNode.item.getLength() - 1;
-};
-
-/**
- * @inheritDoc
- */
-PriorityQueueIterator.prototype.previous = function () {
-	this.pointerPosition--;
-	if (this.pointerPosition < 0) {
-		this.pointerNode = this.pointerNode.next;
-		if (this.pointerNode)
-			this.pointerPosition = this.pointerNode.item.getLength() - 1;
-	}
-};
-
-/**
- * @inheritDoc
- */
-PriorityQueueIterator.prototype.isDone = function () {
-	return !this.pointerNode;
-};
-
-/**
- * @inheritDoc
- */
-PriorityQueueIterator.prototype.getItem = function () {
-	return this.pointerNode.item.items[this.pointerPosition];
-};
\ No newline at end of file
diff --git a/lib/PriorityQueue/PriorityQueueIterator.ts b/lib/PriorityQueue/PriorityQueueIterator.ts
new file mode 100644
index 0000000..add8848
--- /dev/null
+++ b/lib/PriorityQueue/PriorityQueueIterator.ts
@@ -0,0 +1,99 @@
+/**
+ * Created by Stefano on 04/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+namespace ds
+{
+	export class PriorityQueueIterator<T> implements Iterator
+	{
+		/**
+		 * The aggregate relates to this iterator.
+		 * @type {PriorityQueue}
+		 */
+		aggregate: PriorityQueue<T>;
+
+		/**
+		 * The pointer to the position of the node.
+		 * @type {RBLNode|null}
+		 */
+		pointerNode: RBLNode<Queue<T>> = <any>null;
+		/**
+		 * The pointer to the position in the node.
+		 * @type {number}
+		 */
+		pointerPosition = -1;
+
+		/**
+		 * Class that implements the iterator for a priority queue.
+		 * @param aggregate {PriorityQueue} The aggregate to scan.
+		 * @constructor
+		 */
+		constructor(aggregate: PriorityQueue<T>)
+		{
+			this.aggregate = aggregate;
+			this.pointerNode = <any>null;
+			this.pointerPosition = -1;
+		}
+
+		/**
+		 * @inheritDoc
+		 */
+		first()
+		{
+			this.pointerNode = this.aggregate.items.maximum();
+			this.pointerPosition = 0;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		next()
+		{
+			this.pointerPosition++;
+			if (this.pointerPosition > this.pointerNode.item.getLength() - 1)
+			{
+				this.pointerNode = this.pointerNode.previous;
+				this.pointerPosition = 0;
+			}
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		last()
+		{
+			this.pointerNode = this.aggregate.items.minimum();
+			this.pointerPosition = this.pointerNode.item.getLength() - 1;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		previous()
+		{
+			this.pointerPosition--;
+			if (this.pointerPosition < 0)
+			{
+				this.pointerNode = this.pointerNode.next;
+				if (this.pointerNode)
+					this.pointerPosition = this.pointerNode.item.getLength() - 1;
+			}
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		isDone()
+		{
+			return !this.pointerNode;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		getItem()
+		{
+			return this.pointerNode.item.items[this.pointerPosition];
+		};
+	}
+}
\ No newline at end of file
diff --git a/lib/Queue/Queue.js b/lib/Queue/Queue.js
deleted file mode 100644
index 15486ba..0000000
--- a/lib/Queue/Queue.js
+++ /dev/null
@@ -1,297 +0,0 @@
-/**
- * Created by Stefano on 31/03/14.
- */
-
-Queue.prototype = new Aggregate();
-Queue.prototype.constructor = Queue;
-
-/**
- * Class for managing a queue.
- * @param {...*} [args] The items for initializing the queue.
- * @constructor
- */
-function Queue(args) {
-	/**
-	 * The list of the items in the queue.
-	 * @type {Array<*>}
-	 */
-	this.items = [];
-	
-	/**
-	 * Decreases dequeue big O complexity by shifting starting indexs
-	 * for each dequeue, instead of splicing.
-	 * @type {int} 
-	 */
-	this.offsetIndex = 0;
-
-    if(args && args.length) {
-        //builds the list from the range passed from the constructor
-        this.multiEnqueue(args);
-    } else {
-        //builds the list from the parameters of the constructor
-        this.multiEnqueue(arguments);
-    }
-}
-
-/**
- * @inheritDoc
- */
-Queue.prototype.getIterator = function () {
-	return new QueueIterator(this);
-};
-
-/**
- * Adds the item at the tail of the queue.
- * @param item {*} The item to add.
- * @return {void}
- */
-Queue.prototype.enqueue = function (item) {
-	this.items.push(item);
-};
-
-/**
- * Adds the items at the tail of the queue.
- * @param items {Array<*>} The items to add.
- * @return {void}
- */
-Queue.prototype.multiEnqueue = function (items) {
-	for (var i = 0; i < items.length; i++)
-		this.items.push(items[i]);
-};
-
-/**
- * Removes the item at the head of the queue.
- * @return {*} The item at the head of the queue. It's undefined if the queue is empty.
- */
-Queue.prototype.dequeue = function () {
-	if (!(this.items.length - this.offsetIndex))
-		return undefined;
-	
-	var dequeued = this.items[this.offsetIndex]; // holds the value, for cases that purge occurs
-	this.offsetIndex++;
-	/**
-	 * Automatically purge unneeded (already dequeued) 
-	 * indexs from the array when they take up 
-	 * more than one half the array
-	 */
-	if (this.offsetIndex >= this.items.length/2){
-		this.purge();
-	}
-
-	return dequeued; //return dequeued item
-};
-
-/**
- * Removes the items at the head of the queue.
- * @param times {number} The number of times to repeat the dequeue method.
- * @return {Array<*>} The items at the head of the queue.
- */ 
-Queue.prototype.multiDequeue = function (times) {
-	var dequeued = []; // Holds variables that have been removed from the array
-	// Dequeue the desired number of items
-	console.log('items', this.items);
-	for(var i = 0; (i < times && this.items.length -this.offsetIndex > 0); i++){
-		console.log('calleds');
-		dequeued.push(this.dequeue());
-	}
-
-	return dequeued; //removes the last times item and returns the array
-};
-
-/**
- * Clears array indexs hidden by offset. To free up memory
- * @return {void}
- */
-Queue.prototype.purge = function(){
-	this.items.splice(0, this.offsetIndex);
-	this.offsetIndex = 0;
-}
-
-/**
- * Removes the first length items from the position index.
- * @param index {number} The position where to start to remove the items.
- * @param [length = 1] {number} The number of items to remove.
- * @return {void}
- */
-Queue.prototype.remove = function (index, length) {
-	length = length || 1;
-	this.items.splice(index, length);
-};
-
-/**
- * Returns the item at the position index.
- * @param index {number} The position of the item.
- * @return {*} The item at the position. It's undefined if index isn't in the queue bounds.
- */
-Queue.prototype.getItem = function (index) {
-	// take offsetIndex into account
-	var index = index + this.offsetIndex; 
-	if (index < 0 || index > this.items.length - 1 - this.offsetIndex)
-		return undefined;
-	return this.items[index];
-};
-
-/**
- * Returns the first item in the queue. The item is not removed.
- * @return {*} The first item. It's undefined if the queue is empty.
- */
-Queue.prototype.peek = function () {
-	if (this.items.length - this.offsetIndex)
-		return this.items[this.offsetIndex];
-	return undefined
-};
-
-/**
- * Removes all the items stored in the queue.
- * @return {void}
- */
-Queue.prototype.clear = function () {
-	this.items = [];
-};
-
-/**
- * Checks if the queue contains an item that satisfy the condition represented by the callback function.
- * @param item {*} The item to find.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {boolean} True if the queue contains the item that satisfy the condition, false otherwise.
- */
-Queue.prototype.contains = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = this.offsetIndex;
-	while (i < this.items.length && !callback(this.items[i]))
-		i++;
-	return i < this.items.length;
-};
-
-/**
- * Executes the callback function for each item of the queue.
- * This method modifies the queue so if you don't need to modify it you must return the same item of the array.
- * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
- * @return {void}
- */
-Queue.prototype.execute = function (callback) {
-	for (var i = this.offsetIndex; i < this.items.length; i++)
-		this.items[i] = callback(this.items[i]);
-};
-
-/**
- * Returns the length of the queue.
- * @return {number} The length of the queue.
- */
-Queue.prototype.getLength = function () {
-	return this.items.length - this.offsetIndex;
-};
-
-/**
- * Checks if the queue is empty.
- * @return {boolean} True if the queue is empty, false otherwise.
- */
-Queue.prototype.isEmpty = function () {
-	return !(this.items.length - this.offsetIndex);
-};
-
-/**
- * Returns the items that satisfy the condition determined by the callback.
- * @param callback {function} The function that implements the condition.
- * @return {Array<*>} The array that contains the items that satisfy the condition.
- */
-Queue.prototype.filter = function (callback) {
-	var result = [];
-	for (var i = this.offsetIndex; i < this.items.length; i++)
-		if (callback(this.items[i]))
-			result.push(this.items[i]);
-	return result;
-};
-
-/**
- * Returns the first position of the item in the queue.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The first position of the item.
- */
-Queue.prototype.indexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = this.offsetIndex;
-	while (i < this.items.length) {
-		if (callback(this.items[i]))
-			return i - this.offsetIndex;
-		i++;
-	}
-	return -1;
-};
-
-/**
- * Returns the last position of the item in the queue.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The last position of the item.
- */
-Queue.prototype.lastIndexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = this.items.length - 1;
-	while (i > this.offsetIndex - 1) {
-		console.log('l', this.offsetIndex);
-		if (callback(this.items[i]))
-			return i - this.offsetIndex;
-		i--;
-	}
-	return -1;
-};
-
-/**
- * Returns all the position in which the item has been found in the queue.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {Array<number>} The positions in which the item has been found.
- */
-Queue.prototype.allIndexesOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = this.offsetIndex;
-	var indexes = [];
-	while (i < this.items.length) {
-		if (callback(this.items[i]))
-			indexes.push(i - this.offsetIndex);
-		i++;
-	}
-	return indexes;
-};
-
-/**
- * Clones the queue into a new queue.
- * @return {Queue} The queue cloned from this queue.
- */
-Queue.prototype.clone = function () {
-	var queue = new Queue();
-	for (var i = this.offsetIndex; i < this.items.length; i++)
-		if (this.items[i].clone)
-			queue.enqueue(this.items[i].clone());
-		else
-			queue.enqueue(this.items[i]);
-
-	return queue;
-};
-
-/**
- * Clones the queue into a new queue without cloning duplicated items.
- * @return {Queue} The queue cloned from this queue.
- */
-Queue.prototype.cloneDistinct = function () {
-	var queue = new Queue();
-	for (var i = this.offsetIndex; i < this.items.length; i++)
-		if (!queue.contains(this.items[i]))
-			if (this.items[i].cloneDistinct)
-				queue.enqueue(this.items[i].cloneDistinct());
-			else if (this.items[i].clone)
-				queue.enqueue(this.items[i].clone());
-			else
-				queue.enqueue(this.items[i]);
-	return queue;
-};
\ No newline at end of file
diff --git a/lib/Queue/Queue.ts b/lib/Queue/Queue.ts
new file mode 100644
index 0000000..96abc52
--- /dev/null
+++ b/lib/Queue/Queue.ts
@@ -0,0 +1,345 @@
+/**
+ * Created by Stefano on 31/03/14.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+namespace ds
+{
+	export class Queue<T> extends Aggregate
+	{
+		/**
+		 * The list of the items in the queue.
+		 * @type {Array<*>}
+		 */
+		items: T[] = [];
+
+		/**
+		 * Decreases dequeue big O complexity by shifting starting indexs
+		 * for each dequeue, instead of splicing.
+		 * @type {int} 
+		 */
+		offsetIndex = 0;
+
+		/**
+		 * Class for managing a queue.
+		 * @param {...*} [args] The items for initializing the queue.
+		 * @constructor
+		 */
+		constructor(...args: any[])
+		{
+			super();
+			this.items = [];
+
+			this.offsetIndex = 0;
+
+			if (args && args.length == 1 && args[0] instanceof Array)
+			{
+				//builds the list from the range passed from the constructor
+				this.multiEnqueue(args[0]);
+			} else
+			{
+				//builds the list from the parameters of the constructor
+				this.multiEnqueue(args);
+			}
+		}
+
+		/**
+		 * @inheritDoc
+		 */
+		getIterator()
+		{
+			return new QueueIterator<T>(this);
+		};
+
+		/**
+		 * Adds the item at the tail of the queue.
+		 * @param item {*} The item to add.
+		 * @return {void}
+		 */
+		enqueue(item: T)
+		{
+			this.items.push(item);
+		};
+
+		/**
+		 * Adds the items at the tail of the queue.
+		 * @param items {Array<*>} The items to add.
+		 * @return {void}
+		 */
+		multiEnqueue(items: T[])
+		{
+			for (var i = 0; i < items.length; i++)
+				this.items.push(items[i]);
+		};
+
+		/**
+		 * Removes the item at the head of the queue.
+		 * @return {*} The item at the head of the queue. It's undefined if the queue is empty.
+		 */
+		dequeue()
+		{
+			if (!(this.items.length - this.offsetIndex))
+				return undefined;
+
+			var dequeued = this.items[this.offsetIndex]; // holds the value, for cases that purge occurs
+			this.offsetIndex++;
+			/**
+			 * Automatically purge unneeded (already dequeued) 
+			 * indexs from the array when they take up 
+			 * more than one half the array
+			 */
+			if (this.offsetIndex >= this.items.length / 2)
+			{
+				this.purge();
+			}
+
+			return dequeued; //return dequeued item
+		};
+
+		/**
+		 * Removes the items at the head of the queue.
+		 * @param times {number} The number of times to repeat the dequeue method.
+		 * @return {Array<*>} The items at the head of the queue.
+		 */
+		multiDequeue(times: number)
+		{
+			var dequeued = []; // Holds variables that have been removed from the array
+			// Dequeue the desired number of items
+			console.log('items', this.items);
+			for (var i = 0; (i < times && this.items.length - this.offsetIndex > 0); i++)
+			{
+				console.log('calleds');
+				dequeued.push(this.dequeue());
+			}
+
+			return dequeued; //removes the last times item and returns the array
+		};
+
+		/**
+		 * Clears array indexs hidden by offset. To free up memory
+		 * @return {void}
+		 */
+		purge()
+		{
+			this.items.splice(0, this.offsetIndex);
+			this.offsetIndex = 0;
+		}
+
+		/**
+		 * Removes the first length items from the position index.
+		 * @param index {number} The position where to start to remove the items.
+		 * @param [length = 1] {number} The number of items to remove.
+		 * @return {void}
+		 */
+		remove(index: number, length?: number)
+		{
+			length = length || 1;
+			this.items.splice(index, length);
+		};
+
+		/**
+		 * Returns the item at the position index.
+		 * @param index {number} The position of the item.
+		 * @return {*} The item at the position. It's undefined if index isn't in the queue bounds.
+		 */
+		getItem(index: number): T
+		{
+			// take offsetIndex into account
+			var index = index + this.offsetIndex;
+			if (index < 0 || index > this.items.length - 1 - this.offsetIndex)
+				return <any>undefined;
+			return this.items[index];
+		};
+
+		/**
+		 * Returns the first item in the queue. The item is not removed.
+		 * @return {*} The first item. It's undefined if the queue is empty.
+		 */
+		peek()
+		{
+			if (this.items.length - this.offsetIndex)
+				return this.items[this.offsetIndex];
+			return undefined
+		};
+
+		/**
+		 * Removes all the items stored in the queue.
+		 * @return {void}
+		 */
+		clear()
+		{
+			this.items = [];
+		};
+
+		/**
+		 * Checks if the queue contains an item that satisfy the condition represented by the callback function.
+		 * @param item {*} The item to find.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {boolean} True if the queue contains the item that satisfy the condition, false otherwise.
+		 */
+		contains(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var i = this.offsetIndex;
+			while (i < this.items.length && !callback(this.items[i]))
+				i++;
+			return i < this.items.length;
+		};
+
+		/**
+		 * Executes the callback function for each item of the queue.
+		 * This method modifies the queue so if you don't need to modify it you must return the same item of the array.
+		 * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+		 * @return {void}
+		 */
+		execute(callback: (item: T) => T)
+		{
+			for (var i = this.offsetIndex; i < this.items.length; i++)
+				this.items[i] = callback(this.items[i]);
+		};
+
+		/**
+		 * Returns the length of the queue.
+		 * @return {number} The length of the queue.
+		 */
+		getLength()
+		{
+			return this.items.length - this.offsetIndex;
+		};
+
+		/**
+		 * Checks if the queue is empty.
+		 * @return {boolean} True if the queue is empty, false otherwise.
+		 */
+		isEmpty()
+		{
+			return !(this.items.length - this.offsetIndex);
+		};
+
+		/**
+		 * Returns the items that satisfy the condition determined by the callback.
+		 * @param callback {function} The function that implements the condition.
+		 * @return {Array<*>} The array that contains the items that satisfy the condition.
+		 */
+		filter(callback: (item: T) => boolean)
+		{
+			var result = [];
+			for (var i = this.offsetIndex; i < this.items.length; i++)
+				if (callback(this.items[i]))
+					result.push(this.items[i]);
+			return result;
+		};
+
+		/**
+		 * Returns the first position of the item in the queue.
+		 * @param item {*} The item to search.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {number} The first position of the item.
+		 */
+		indexOf(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var i = this.offsetIndex;
+			while (i < this.items.length)
+			{
+				if (callback(this.items[i]))
+					return i - this.offsetIndex;
+				i++;
+			}
+			return -1;
+		};
+
+		/**
+		 * Returns the last position of the item in the queue.
+		 * @param item {*} The item to search.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {number} The last position of the item.
+		 */
+		lastIndexOf(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var i = this.items.length - 1;
+			while (i > this.offsetIndex - 1)
+			{
+				console.log('l', this.offsetIndex);
+				if (callback(this.items[i]))
+					return i - this.offsetIndex;
+				i--;
+			}
+			return -1;
+		};
+
+		/**
+		 * Returns all the position in which the item has been found in the queue.
+		 * @param item {*} The item to search.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {Array<number>} The positions in which the item has been found.
+		 */
+		allIndexesOf(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var i = this.offsetIndex;
+			var indexes = [];
+			while (i < this.items.length)
+			{
+				if (callback(this.items[i]))
+					indexes.push(i - this.offsetIndex);
+				i++;
+			}
+			return indexes;
+		};
+
+		/**
+		 * Clones the queue into a new queue.
+		 * @return {Queue} The queue cloned from this queue.
+		 */
+		clone()
+		{
+			var queue = new Queue<T>();
+			for (var i = this.offsetIndex; i < this.items.length; i++)
+			{
+				var item: any = this.items[i];
+				if (item.clone)
+					queue.enqueue(item.clone());
+				else
+					queue.enqueue(item);
+			}
+
+			return queue;
+		};
+
+		/**
+		 * Clones the queue into a new queue without cloning duplicated items.
+		 * @return {Queue} The queue cloned from this queue.
+		 */
+		cloneDistinct()
+		{
+			var queue = new Queue<T>();
+			for (var i = this.offsetIndex; i < this.items.length; i++)
+				if (!queue.contains(this.items[i]))
+				{
+					var item: any = this.items[i];
+					if (item.cloneDistinct)
+						queue.enqueue(item.cloneDistinct());
+					else if (item.clone)
+						queue.enqueue(item.clone());
+					else
+						queue.enqueue(item);
+				}
+
+			return queue;
+		};
+	}
+
+}
\ No newline at end of file
diff --git a/lib/Queue/QueueIterator.js b/lib/Queue/QueueIterator.js
deleted file mode 100644
index e0b6db7..0000000
--- a/lib/Queue/QueueIterator.js
+++ /dev/null
@@ -1,67 +0,0 @@
-/**
- * Created by Stefano on 04/04/2014.
- */
-
-QueueIterator.prototype = new Iterator();
-QueueIterator.prototype.constructor = QueueIterator;
-
-/**
- * Class that implements the iterator for a linked list.
- * @param aggregate {Queue} The aggregate to scan.
- * @constructor
- */
-function QueueIterator(aggregate) {
-	/**
-	 * The aggregate relates to this iterator.
-	 * @type {Queue}
-	 */
-	this.aggregate = aggregate;
-
-	/**
-	 * The pointer to the position.
-	 * @type {number}
-	 */
-	this.pointer = -1;
-}
-
-/**
- * @inheritDoc
- */
-QueueIterator.prototype.first = function () {
-	this.pointer = 0;
-};
-
-/**
- * @inheritDoc
- */
-QueueIterator.prototype.next = function () {
-	this.pointer++;
-};
-
-/**
- * @inheritDoc
- */
-QueueIterator.prototype.last = function () {
-	this.pointer = this.aggregate.items.length - 1;
-};
-
-/**
- * @inheritDoc
- */
-QueueIterator.prototype.previous = function () {
-	this.pointer--;
-};
-
-/**
- * @inheritDoc
- */
-QueueIterator.prototype.isDone = function () {
-	return this.pointer < 0 || this.pointer > this.aggregate.items.length - 1;
-};
-
-/**
- * @inheritDoc
- */
-QueueIterator.prototype.getItem = function () {
-	return this.aggregate.getItem(this.pointer);
-};
\ No newline at end of file
diff --git a/lib/Queue/QueueIterator.ts b/lib/Queue/QueueIterator.ts
new file mode 100644
index 0000000..30232cd
--- /dev/null
+++ b/lib/Queue/QueueIterator.ts
@@ -0,0 +1,79 @@
+/**
+ * Created by Stefano on 04/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+namespace ds
+{
+	export class QueueIterator<T> implements Iterator
+	{
+		/**
+		 * The aggregate relates to this iterator.
+		 * @type {Queue}
+		 */
+		aggregate: Queue<T>;
+
+		/**
+		 * The pointer to the position.
+		 * @type {number}
+		 */
+		pointer = -1;
+		/**
+		 * Class that implements the iterator for a linked list.
+		 * @param aggregate {Queue} The aggregate to scan.
+		 * @constructor
+		 */
+		constructor(aggregate: Queue<T>)
+		{
+			this.aggregate = aggregate;
+			this.pointer = -1;
+		}
+
+		/**
+		 * @inheritDoc
+		 */
+		first()
+		{
+			this.pointer = 0;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		next()
+		{
+			this.pointer++;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		last()
+		{
+			this.pointer = this.aggregate.items.length - 1;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		previous()
+		{
+			this.pointer--;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		isDone()
+		{
+			return this.pointer < 0 || this.pointer > this.aggregate.items.length - 1;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		getItem()
+		{
+			return this.aggregate.getItem(this.pointer);
+		};
+	}
+}
\ No newline at end of file
diff --git a/lib/RBTree/RBTree.js b/lib/RBTree/RBTree.js
deleted file mode 100644
index dd4edf4..0000000
--- a/lib/RBTree/RBTree.js
+++ /dev/null
@@ -1,553 +0,0 @@
-/**
- * The single node of the tree.
- * @param key {number} The key of the node.
- * @param item {*} The item to store in the node.
- * @constructor
- */
-function RBNode(key, item) {
-	/**
-	 * The item stored.
-	 * @type {*}
-	 */
-	this.item = item;
-	/**
-	 * The key of the node.
-	 * @type {number}
-	 */
-	this.key = key;
-	/**
-	 * The parent node. It's null if there's no a parent node.
-	 * @type {RBNode|null}
-	 */
-	this.parent = null;
-	/**
-	 * The left node. It's null if there's no a left node.
-	 * @type {RBNode|null}
-	 */
-	this.left = null;
-	/**
-	 * The right node. It's null if there's no a right node.
-	 * @type {RBNode|null}
-	 */
-	this.right = null;
-	/**
-	 * The type of the node. It's or red or black.
-	 * @type {string}
-	 */
-	this.type = 'r';
-}
-
-RBTree.prototype = new Aggregate();
-RBTree.prototype.constructor = RBTree;
-
-/**
- * Class for managing a red-black tree.
- * @constructor
- */
-function RBTree() {
-	/**
-	 * The root of the tree.
-	 * @type {RBNode|null}
-	 */
-	this.root = null;
-	/**
-	 * The number of items stored in the tree.
-	 * @type {number}
-	 */
-	this.size = 0;
-}
-
-/**
- * @inheritDoc
- */
-RBTree.prototype.getIterator = function () {
-	return new RBTreeIterator(this);
-};
-
-/**
- * Insert the item relatives to the key value in the tree.
- * @param key {number} The key to store.
- * @param item {*} The item to store.
- * @return {void}
- */
-RBTree.prototype.insert = function (key, item) {
-	var node = new RBNode(key, item);
-	this.size++;
-	if (!this.root) {
-		this.root = node;
-		node.type = 'b';
-		return;
-	}
-	var p = this.root;
-	for (var n = this.root; n;) {
-		p = n;
-		if (key < n.key)
-			n = n.left;
-		else
-			n = n.right;
-	}
-	node.parent = p;
-	if (!p)
-		this.root = node;
-	else if (key < p.key)
-		p.left = node;
-	else
-		p.right = node;
-
-	this.insertFixUp(node);
-};
-
-/**
- * Preserve the properties of the tree after an insert.
- * @param node {RBNode} The node to insert.
- * @return {void}
- */
-RBTree.prototype.insertFixUp = function (node) {
-	for (var parent = node.parent; parent && parent.type === 'r'; parent = node.parent) {
-		if (parent === parent.parent.left) {
-			var uncle = parent.parent.right;
-			if (uncle && uncle.type === 'r') {
-				parent.type = 'b';
-				uncle.type = 'b';
-				parent.parent.type = 'r';
-				node = parent.parent;
-			} else if (node === parent.right) {
-				node = parent;
-				this.leftRotate(node);
-			} else {
-				parent.type = 'b';
-				parent.parent.type = 'r';
-				this.rightRotate(parent.parent);
-			}
-		} else {
-			var uncle = parent.parent.left;
-			if (uncle && uncle.type === 'r') {
-				parent.type = 'b';
-				uncle.type = 'b';
-				parent.parent.type = 'r';
-				node = parent.parent;
-			} else if (node === parent.left) {
-				node = parent;
-				this.rightRotate(node);
-			} else {
-				parent.type = 'b';
-				parent.parent.type = 'r';
-				this.leftRotate(parent.parent);
-			}
-		}
-	}
-	this.root.type = 'b';
-};
-
-/**
- * Delete the node from the tree.
- * @param node {RBNode} The node to delete.
- * @return {void}
- */
-RBTree.prototype.deleteNode = function (node) {
-	var successor;
-	this.size--;
-	if (!node.left || !node.right)
-		successor = node;
-	else {
-		successor = this.successor(node);
-		node.key = successor.key;
-		node.item = successor.item;
-	}
-	var child;
-	if (!successor.left)
-		child = successor.right;
-	else
-		child = successor.left;
-	if (child)
-		child.parent = successor.parent;
-	if (!successor.parent)
-		this.root = child;
-	else if (successor === successor.parent.left)
-		successor.parent.left = child;
-	else
-		successor.parent.right = child;
-
-	if (successor.type === 'b')
-		this.deleteFixUp(child, successor.parent);
-};
-
-/**
- * Preserve the properties of the tree after a deletion.
- * @param node {RBNode} The node to delete.
- * @param parent {RBNode} The parent of the node.
- * @return {void}
- */
-RBTree.prototype.deleteFixUp = function (node, parent) {
-	while (node !== this.root && (!node || node.type === 'b')) {
-		if (node === parent.left) {
-			var brother = parent.right;
-			if (brother && brother.type === 'r') {
-				brother.type = 'b';
-				parent.type = 'r';
-				this.leftRotate(parent);
-				brother = parent.right;
-			}
-			if (brother && (!brother.left || brother.left.type === 'b') && (!brother.right || brother.right.type === 'b')) {
-				brother.type = 'r';
-				node = parent;
-			} else {
-				if (!brother.right || brother.right.type === 'b') {
-					brother.left.type = 'b';
-					brother.type = 'r';
-					this.rightRotate(brother);
-					brother = parent.right;
-				}
-				brother.type = parent.type;
-				parent.type = 'b';
-				brother.right.type = 'b';
-				this.leftRotate(parent);
-				node = this.root;
-			}
-		} else {
-			var brother = parent.left;
-			if (brother && brother.type === 'r') {
-				brother.type = 'b';
-				parent.type = 'r';
-				this.rightRotate(parent);
-				brother = parent.left;
-			}
-			if (brother && (!brother.left || brother.left.type === 'b') && (!brother.right || brother.right.type === 'b')) {
-				brother.type = 'r';
-				node = parent;
-			} else {
-				if (!brother.left || brother.left.type === 'b') {
-					brother.right.type = 'b';
-					brother.type = 'r';
-					this.leftRotate(brother);
-					brother = parent.left;
-				}
-				brother.type = parent.type;
-				parent.type = 'b';
-				brother.left.type = 'b';
-				this.rightRotate(parent);
-				node = this.root;
-			}
-		}
-		parent = node.parent;
-	}
-	if (node)
-		node.type = 'b';
-};
-
-/**
- * Get the node with the key next to the param node key.
- * @param node {RBNode} The node of which search the successor.
- * @return {RBNode} The node found.
- */
-RBTree.prototype.successor = function (node) {
-	if (node.right)
-		return this.minimum(node.right);
-	var parent = node.parent;
-	while (parent && node === parent.right) {
-		node = parent;
-		parent = parent.parent;
-	}
-	return parent;
-};
-
-/**
- * Get the node with the key previous to the param node key.
- * @param node {RBNode} The node of which search the predecessor.
- * @return {RBNode} The node found.
- */
-RBTree.prototype.predecessor = function (node) {
-	if (node.left)
-		return this.maximum(node.left);
-	var parent = node.parent;
-	while (parent && node === parent.left) {
-		node = parent;
-		parent = parent.parent;
-	}
-	return parent;
-};
-
-/**
- * Search the item relatives to the key and to the nodes that satisfy the condition represented by the callback function.
- * @param key {number} The key to find.
- * @param [node = root] {RBNode} The node from which start the search.
- * @param [callback = function(node){return(node.key===key);}] The condition to satisfy. The callback must accept the current node to check.
- * @return {*} The item found or undefined if there isn't the key in the tree.
- */
-RBTree.prototype.search = function (key, node, callback) {
-	node = node || this.root;
-	callback = callback || function (node) {
-		return node.key === key;
-	};
-	while (node && !callback(node))
-		if (key < node.key)
-			node = node.left;
-		else
-			node = node.right;
-	if (node)
-		return node.item;
-	return undefined;
-};
-
-/**
- * Checks if the tree contains a key or a node that satisfy the condition represented by the callback function.
- * This method avoid to search in branches where the key won't be found.
- * @param key {*} The key to find.
- * @param [callback = function(node){return(node.key===key);}] The condition to satisfy. The callback must accept the current node to check.
- * @return {boolean} True if the tree contains the key or a node that satisfy the condition, false otherwise.
- */
-RBTree.prototype.contains = function (key, callback) {
-	return this.search(key, null, callback) !== undefined;
-};
-
-/**
- * Checks if the tree contains a node that satisfy the condition represented by the callback function.
- * This method check all the tree avoiding the binary search.
- * @param callback {function} The condition to satisfy. The callback must accept the current node to check.
- * @return {boolean} True if the tree contains the node that satisfy the condition, false otherwise.
- */
-RBTree.prototype.fullContains = function (callback) {
-	var node = this.minimum();
-	while (node && !callback(node.key))
-		node = this.successor(node);
-	return node !== null;
-};
-
-/**
- * Get the item relatives to the minimum key stored in the tree.
- * @param [node = root] {Node} The node from which start the search.
- * @return {RBNode} The node found.
- */
-RBTree.prototype.minimum = function (node) {
-	node = node || this.root;
-	while (node && node.left)
-		node = node.left;
-	return node;
-};
-
-/**
- * Get the item relatives to the maximum key stored in the tree.
- * @param [node = root] {Node} The node from which start the search.
- * @return {RBNode} The node found.
- */
-RBTree.prototype.maximum = function (node) {
-	node = node || this.root;
-	while (node && node.right)
-		node = node.right;
-	return node;
-};
-
-/**
- * Rotate the node with its right child.
- * @param node {RBNode} The node to rotate.
- * @return {void}
- */
-RBTree.prototype.leftRotate = function (node) {
-	var child = node.right;
-	node.right = child.left;
-	if (child.left !== null)
-		child.left.parent = node;
-	child.parent = node.parent;
-	if (node.parent === null)
-		this.root = child;
-	else if (node === node.parent.left)
-		node.parent.left = child;
-	else
-		node.parent.right = child;
-	node.parent = child;
-	child.left = node;
-};
-
-/**
- * Rotate the node with its left child.
- * @param node {RBNode} The node to rotate.
- * @return {void}
- */
-RBTree.prototype.rightRotate = function (node) {
-	var child = node.left;
-	node.left = child.right;
-	if (child.right !== null)
-		child.right.parent = node;
-	child.parent = node.parent;
-	if (node.parent === null)
-		this.root = child;
-	else if (node === node.parent.left)
-		node.parent.left = child;
-	else
-		node.parent.right = child;
-	node.parent = child;
-	child.right = node;
-};
-
-/**
- * Returns the size of the tree.
- * @return {number} The size of the tree.
- */
-RBTree.prototype.getSize = function () {
-	return this.size;
-};
-
-/**
- * Clones the queue into a new queue.
- * @return {RBTree} The tree cloned from this queue.
- */
-RBTree.prototype.clone = function () {
-	var tree = new RBTree();
-	var it = this.getIterator();
-	for (it.first(); !it.isDone(); it.next())
-		if (it.getNode().item.clone)
-			tree.insert(it.getNode().key, it.getNode().item.clone());
-		else
-			tree.insert(it.getNode().key, it.getNode().item);
-
-	return tree;
-};
-
-/**
- * Clones the tree into a new tree without cloning duplicated items.
- * @return {RBTree} The tree cloned from this tree.
- */
-RBTree.prototype.cloneDistinct = function () {
-	var tree = new RBTree();
-	var it = this.getIterator();
-	for (it.first(); !it.isDone(); it.next()) {
-		var callback = function (node) {
-			return node.key === it.getNode().key && node.item === it.getNode().item;
-		};
-		if (!tree.contains(it.getNode().key, callback)) {
-			if (it.getNode().item.cloneDistinct)
-				tree.insert(it.getNode().key, it.getNode().item.cloneDistinct());
-			else if (it.getNode().item.clone)
-				tree.insert(it.getNode().key, it.getNode().item.clone());
-			else
-				tree.insert(it.getNode().key, it.getNode().item);
-		}
-	}
-	return tree;
-};
-
-/**
- * Transform the tree into an array without preserving keys.
- * @return {Array<*>} The array that represents the tree.
- */
-RBTree.prototype.toArray = function () {
-	var result = [];
-	for (var node = this.minimum(); node; node = this.successor(node))
-		result.push(node.item);
-	return result;
-};
-
-/**
- * Removes all the items stored in the tree.
- * @return {void}
- */
-RBTree.prototype.clear = function () {
-	this.root = null;
-	this.size = 0;
-};
-
-/**
- * Checks if the tree is empty.
- * @return {boolean} True if the tree is empty, false otherwise.
- */
-RBTree.prototype.isEmpty = function () {
-	return !this.size;
-};
-
-/**
- * Executes the callback function for each item of the tree.
- * This method modifies the tree so if you don't need to modify it you must return the same item stored.
- * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
- * @return {void}
- */
-RBTree.prototype.execute = function (callback) {
-	for (var node = this.minimum(); node; node = this.successor(node))
-		node.item = callback(node.item);
-};
-
-/**
- * Returns the items that satisfy the condition determined by the callback.
- * @param callback {function} The function that implements the condition.
- * @return {Array<*>} The array that contains the items that satisfy the condition.
- */
-RBTree.prototype.filter = function (callback) {
-	var result = [];
-	for (var node = this.minimum(); node; node = this.successor(node))
-		if (callback(node.item))
-			result.push(node.item);
-	return result;
-};
-
-/**
- * Returns the first position of the item in the tree.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The first position of the item.
- */
-RBTree.prototype.indexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0, node = this.minimum();
-	while (node) {
-		if (callback(node.item))
-			return i;
-		node = this.successor(node);
-		i++;
-	}
-	return -1;
-};
-
-/**
- * Returns the last position of the item in the tree.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The last position of the item.
- */
-RBTree.prototype.lastIndexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = this.size - 1, node = this.maximum();
-	while (node) {
-		if (callback(node.item))
-			return i;
-		i--;
-		node = this.predecessor(node);
-	}
-	return -1;
-};
-
-/**
- * Returns all the position in which the item has been found in the tree.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {Array<number>} The positions in which the item has been found.
- */
-RBTree.prototype.allIndexesOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0, node = this.minimum();
-	var indexes = [];
-	while (node) {
-		if (callback(node.item))
-			indexes.push(i);
-		i++;
-		node = this.successor(node);
-	}
-	return indexes;
-};
-
-/**
- * Returns the item at the position index.
- * @param index {number} The position of the item.
- * @return {*} The item at the position. It's undefined if index isn't in the tree bounds.
- */
-RBTree.prototype.getItem = function (index) {
-	if (index < 0 || index > this.size - 1)
-		return undefined;
-	for (var node = this.minimum(), i = 0; i < index; node = this.successor(node))
-		i++;
-	return node.item;
-};
\ No newline at end of file
diff --git a/lib/RBTree/RBTree.ts b/lib/RBTree/RBTree.ts
new file mode 100644
index 0000000..73477f9
--- /dev/null
+++ b/lib/RBTree/RBTree.ts
@@ -0,0 +1,639 @@
+namespace ds
+{
+	export class RBNode<T>
+	{
+		/**
+		 * The item stored.
+		 * @type {*}
+		 */
+		item: T;
+		/**
+		 * The key of the node.
+		 * @type {number}
+		 */
+		key: number;
+		/**
+		 * The parent node. It's null if there's no a parent node.
+		 * @type {RBNode|null}
+		 */
+		parent: RBNode<T> = <any>null;
+		/**
+		 * The left node. It's null if there's no a left node.
+		 * @type {RBNode|null}
+		 */
+		left: RBNode<T> = <any>null;
+		/**
+		 * The right node. It's null if there's no a right node.
+		 * @type {RBNode|null}
+		 */
+		right: RBNode<T> = <any>null;
+		/**
+		 * The type of the node. It's or red or black.
+		 * @type {string}
+		 */
+		type = 'r';
+
+		/**
+		 * The single node of the tree.
+		 * @param key {number} The key of the node.
+		 * @param item {*} The item to store in the node.
+		 * @constructor
+		 */
+		constructor(key: number, item: T)
+		{
+			this.item = item;
+			this.key = key;
+			this.parent = <any>null;
+			this.left = <any>null;
+			this.right = <any>null;
+			this.type = 'r';
+		}
+
+	}
+
+	export class RBTree<T> extends Aggregate
+	{
+		/**
+		 * The root of the tree.
+		 * @type {RBNode|null}
+		 */
+		root: RBNode<T> = <any>null;
+		/**
+		 * The number of items stored in the tree.
+		 * @type {number}
+		 */
+		size = 0;
+
+		/**
+		 * Class for managing a red-black tree.
+		 * @constructor
+		 */
+		constructor()
+		{
+			super();
+			this.root = <any>null;
+			this.size = 0;
+		}
+
+		/**
+		 * @inheritDoc
+		 */
+		getIterator()
+		{
+			return new RBTreeIterator<T>(this);
+		};
+
+		/**
+		 * Insert the item relatives to the key value in the tree.
+		 * @param key {number} The key to store.
+		 * @param item {*} The item to store.
+		 * @return {void}
+		 */
+		insert(key: number, item: T)
+		{
+			var node = new RBNode(key, item);
+			this.size++;
+			if (!this.root)
+			{
+				this.root = node;
+				node.type = 'b';
+				return;
+			}
+			var p = this.root;
+			for (var n = this.root; n;)
+			{
+				p = n;
+				if (key < n.key)
+					n = n.left;
+				else
+					n = n.right;
+			}
+			node.parent = p;
+			if (!p)
+				this.root = node;
+			else if (key < p.key)
+				p.left = node;
+			else
+				p.right = node;
+
+			this.insertFixUp(node);
+		};
+
+		/**
+		 * Preserve the properties of the tree after an insert.
+		 * @param node {RBNode} The node to insert.
+		 * @return {void}
+		 */
+		insertFixUp(node: RBNode<T>)
+		{
+			for (var parent = node.parent; parent && parent.type === 'r'; parent = node.parent)
+			{
+				if (parent === parent.parent.left)
+				{
+					var uncle = parent.parent.right;
+					if (uncle && uncle.type === 'r')
+					{
+						parent.type = 'b';
+						uncle.type = 'b';
+						parent.parent.type = 'r';
+						node = parent.parent;
+					} else if (node === parent.right)
+					{
+						node = parent;
+						this.leftRotate(node);
+					} else
+					{
+						parent.type = 'b';
+						parent.parent.type = 'r';
+						this.rightRotate(parent.parent);
+					}
+				} else
+				{
+					var uncle = parent.parent.left;
+					if (uncle && uncle.type === 'r')
+					{
+						parent.type = 'b';
+						uncle.type = 'b';
+						parent.parent.type = 'r';
+						node = parent.parent;
+					} else if (node === parent.left)
+					{
+						node = parent;
+						this.rightRotate(node);
+					} else
+					{
+						parent.type = 'b';
+						parent.parent.type = 'r';
+						this.leftRotate(parent.parent);
+					}
+				}
+			}
+			this.root.type = 'b';
+		};
+
+		/**
+		 * Delete the node from the tree.
+		 * @param node {RBNode} The node to delete.
+		 * @return {void}
+		 */
+		deleteNode(node: RBNode<T>)
+		{
+			var successor;
+			this.size--;
+			if (!node.left || !node.right)
+				successor = node;
+			else
+			{
+				successor = this.successor(node);
+				node.key = successor.key;
+				node.item = successor.item;
+			}
+			var child;
+			if (!successor.left)
+				child = successor.right;
+			else
+				child = successor.left;
+			if (child)
+				child.parent = successor.parent;
+			if (!successor.parent)
+				this.root = child;
+			else if (successor === successor.parent.left)
+				successor.parent.left = child;
+			else
+				successor.parent.right = child;
+
+			if (successor.type === 'b')
+				this.deleteFixUp(child, successor.parent);
+		};
+
+		/**
+		 * Preserve the properties of the tree after a deletion.
+		 * @param node {RBNode} The node to delete.
+		 * @param parent {RBNode} The parent of the node.
+		 * @return {void}
+		 */
+		deleteFixUp(node: RBNode<T>, parent: RBNode<T>)
+		{
+			while (node !== this.root && (!node || node.type === 'b'))
+			{
+				if (node === parent.left)
+				{
+					var brother = parent.right;
+					if (brother && brother.type === 'r')
+					{
+						brother.type = 'b';
+						parent.type = 'r';
+						this.leftRotate(parent);
+						brother = parent.right;
+					}
+					if (brother && (!brother.left || brother.left.type === 'b') && (!brother.right || brother.right.type === 'b'))
+					{
+						brother.type = 'r';
+						node = parent;
+					} else
+					{
+						if (!brother.right || brother.right.type === 'b')
+						{
+							brother.left.type = 'b';
+							brother.type = 'r';
+							this.rightRotate(brother);
+							brother = parent.right;
+						}
+						brother.type = parent.type;
+						parent.type = 'b';
+						brother.right.type = 'b';
+						this.leftRotate(parent);
+						node = this.root;
+					}
+				} else
+				{
+					var brother = parent.left;
+					if (brother && brother.type === 'r')
+					{
+						brother.type = 'b';
+						parent.type = 'r';
+						this.rightRotate(parent);
+						brother = parent.left;
+					}
+					if (brother && (!brother.left || brother.left.type === 'b') && (!brother.right || brother.right.type === 'b'))
+					{
+						brother.type = 'r';
+						node = parent;
+					} else
+					{
+						if (!brother.left || brother.left.type === 'b')
+						{
+							brother.right.type = 'b';
+							brother.type = 'r';
+							this.leftRotate(brother);
+							brother = parent.left;
+						}
+						brother.type = parent.type;
+						parent.type = 'b';
+						brother.left.type = 'b';
+						this.rightRotate(parent);
+						node = this.root;
+					}
+				}
+				parent = node.parent;
+			}
+			if (node)
+				node.type = 'b';
+		};
+
+		/**
+		 * Get the node with the key next to the param node key.
+		 * @param node {RBNode} The node of which search the successor.
+		 * @return {RBNode} The node found.
+		 */
+		successor(node: RBNode<T>)
+		{
+			if (node.right)
+				return this.minimum(node.right);
+			var parent = node.parent;
+			while (parent && node === parent.right)
+			{
+				node = parent;
+				parent = parent.parent;
+			}
+			return parent;
+		};
+
+		/**
+		 * Get the node with the key previous to the param node key.
+		 * @param node {RBNode} The node of which search the predecessor.
+		 * @return {RBNode} The node found.
+		 */
+		predecessor(node: RBNode<T>)
+		{
+			if (node.left)
+				return this.maximum(node.left);
+			var parent = node.parent;
+			while (parent && node === parent.left)
+			{
+				node = parent;
+				parent = parent.parent;
+			}
+			return parent;
+		};
+
+		/**
+		 * Search the item relatives to the key and to the nodes that satisfy the condition represented by the callback function.
+		 * @param key {number} The key to find.
+		 * @param [node = root] {RBNode} The node from which start the search.
+		 * @param [callback = function(node){return(node.key===key);}] The condition to satisfy. The callback must accept the current node to check.
+		 * @return {*} The item found or undefined if there isn't the key in the tree.
+		 */
+		search(key: number, node?: RBNode<T>, callback?: (node: RBNode<T>) => boolean)
+		{
+			node = node || this.root;
+			callback = callback || function (node)
+			{
+				return node.key === key;
+			};
+			while (node && !callback(node))
+				if (key < node.key)
+					node = node.left;
+				else
+					node = node.right;
+			if (node)
+				return node.item;
+			return undefined;
+		};
+
+		/**
+		 * Checks if the tree contains a key or a node that satisfy the condition represented by the callback function.
+		 * This method avoid to search in branches where the key won't be found.
+		 * @param key {*} The key to find.
+		 * @param [callback = function(node){return(node.key===key);}] The condition to satisfy. The callback must accept the current node to check.
+		 * @return {boolean} True if the tree contains the key or a node that satisfy the condition, false otherwise.
+		 */
+		contains(key: number, callback?: (node: RBNode<T>) => boolean)
+		{
+			return this.search(key, <any>null, callback) !== undefined;
+		};
+
+		/**
+		 * Checks if the tree contains a node that satisfy the condition represented by the callback function.
+		 * This method check all the tree avoiding the binary search.
+		 * @param callback {function} The condition to satisfy. The callback must accept the current node to check.
+		 * @return {boolean} True if the tree contains the node that satisfy the condition, false otherwise.
+		 */
+		fullContains(callback: (key: number) => boolean)
+		{
+			var node = this.minimum();
+			while (node && !callback(node.key))
+				node = this.successor(node);
+			return node !== null;
+		};
+
+		/**
+		 * Get the item relatives to the minimum key stored in the tree.
+		 * @param [node = root] {Node} The node from which start the search.
+		 * @return {RBNode} The node found.
+		 */
+		minimum(node?: RBNode<T>)
+		{
+			node = node || this.root;
+			while (node && node.left)
+				node = node.left;
+			return node;
+		};
+
+		/**
+		 * Get the item relatives to the maximum key stored in the tree.
+		 * @param [node = root] {Node} The node from which start the search.
+		 * @return {RBNode} The node found.
+		 */
+		maximum(node?: RBNode<T>)
+		{
+			node = node || this.root;
+			while (node && node.right)
+				node = node.right;
+			return node;
+		};
+
+		/**
+		 * Rotate the node with its right child.
+		 * @param node {RBNode} The node to rotate.
+		 * @return {void}
+		 */
+		leftRotate(node: RBNode<T>)
+		{
+			var child = node.right;
+			node.right = child.left;
+			if (child.left !== null)
+				child.left.parent = node;
+			child.parent = node.parent;
+			if (node.parent === null)
+				this.root = child;
+			else if (node === node.parent.left)
+				node.parent.left = child;
+			else
+				node.parent.right = child;
+			node.parent = child;
+			child.left = node;
+		};
+
+		/**
+		 * Rotate the node with its left child.
+		 * @param node {RBNode} The node to rotate.
+		 * @return {void}
+		 */
+		rightRotate(node: RBNode<T>)
+		{
+			var child = node.left;
+			node.left = child.right;
+			if (child.right !== null)
+				child.right.parent = node;
+			child.parent = node.parent;
+			if (node.parent === null)
+				this.root = child;
+			else if (node === node.parent.left)
+				node.parent.left = child;
+			else
+				node.parent.right = child;
+			node.parent = child;
+			child.right = node;
+		};
+
+		/**
+		 * Returns the size of the tree.
+		 * @return {number} The size of the tree.
+		 */
+		getSize()
+		{
+			return this.size;
+		};
+
+		/**
+		 * Clones the queue into a new queue.
+		 * @return {RBTree} The tree cloned from this queue.
+		 */
+		clone()
+		{
+			var tree = new RBTree<T>();
+			var it = this.getIterator();
+			for (it.first(); !it.isDone(); it.next())
+			{
+				var item: any = it.getNode().item;
+				if (item.clone)
+					tree.insert(it.getNode().key, item.clone());
+				else
+					tree.insert(it.getNode().key, item);
+			}
+
+			return tree;
+		};
+
+		/**
+		 * Clones the tree into a new tree without cloning duplicated items.
+		 * @return {RBTree} The tree cloned from this tree.
+		 */
+		cloneDistinct()
+		{
+			var tree = new RBTree<T>();
+			var it = this.getIterator();
+			for (it.first(); !it.isDone(); it.next())
+			{
+				var callback = function (node: RBNode<T>)
+				{
+					return node.key === it.getNode().key && node.item === it.getNode().item;
+				};
+				if (!tree.contains(it.getNode().key, callback))
+				{
+					var item: any = it.getNode().item;
+					if (item.cloneDistinct)
+						tree.insert(it.getNode().key, item.cloneDistinct());
+					else if (item.clone)
+						tree.insert(it.getNode().key, item.clone());
+					else
+						tree.insert(it.getNode().key, item);
+				}
+			}
+			return tree;
+		};
+
+		/**
+		 * Transform the tree into an array without preserving keys.
+		 * @return {Array<*>} The array that represents the tree.
+		 */
+		toArray()
+		{
+			var result = [];
+			for (var node = this.minimum(); node; node = this.successor(node))
+				result.push(node.item);
+			return result;
+		};
+
+		/**
+		 * Removes all the items stored in the tree.
+		 * @return {void}
+		 */
+		clear()
+		{
+			this.root = <any>null;
+			this.size = 0;
+		};
+
+		/**
+		 * Checks if the tree is empty.
+		 * @return {boolean} True if the tree is empty, false otherwise.
+		 */
+		isEmpty()
+		{
+			return !this.size;
+		};
+
+		/**
+		 * Executes the callback function for each item of the tree.
+		 * This method modifies the tree so if you don't need to modify it you must return the same item stored.
+		 * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+		 * @return {void}
+		 */
+		execute(callback: (item: T) => T)
+		{
+			for (var node = this.minimum(); node; node = this.successor(node))
+				node.item = callback(node.item);
+		};
+
+		/**
+		 * Returns the items that satisfy the condition determined by the callback.
+		 * @param callback {function} The function that implements the condition.
+		 * @return {Array<*>} The array that contains the items that satisfy the condition.
+		 */
+		filter(callback: (item: T) => boolean)
+		{
+			var result = [];
+			for (var node = this.minimum(); node; node = this.successor(node))
+				if (callback(node.item))
+					result.push(node.item);
+			return result;
+		};
+
+		/**
+		 * Returns the first position of the item in the tree.
+		 * @param item {*} The item to search.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {number} The first position of the item.
+		 */
+		indexOf(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var i = 0, node = this.minimum();
+			while (node)
+			{
+				if (callback(node.item))
+					return i;
+				node = this.successor(node);
+				i++;
+			}
+			return -1;
+		};
+
+		/**
+		 * Returns the last position of the item in the tree.
+		 * @param item {*} The item to search.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {number} The last position of the item.
+		 */
+		lastIndexOf(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var i = this.size - 1, node = this.maximum();
+			while (node)
+			{
+				if (callback(node.item))
+					return i;
+				i--;
+				node = this.predecessor(node);
+			}
+			return -1;
+		};
+
+		/**
+		 * Returns all the position in which the item has been found in the tree.
+		 * @param item {*} The item to search.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {Array<number>} The positions in which the item has been found.
+		 */
+		allIndexesOf(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var i = 0, node = this.minimum();
+			var indexes = [];
+			while (node)
+			{
+				if (callback(node.item))
+					indexes.push(i);
+				i++;
+				node = this.successor(node);
+			}
+			return indexes;
+		};
+
+		/**
+		 * Returns the item at the position index.
+		 * @param index {number} The position of the item.
+		 * @return {*} The item at the position. It's undefined if index isn't in the tree bounds.
+		 */
+		getItem(index: number)
+		{
+			if (index < 0 || index > this.size - 1)
+				return undefined;
+			for (var node = this.minimum(), i = 0; i < index; node = this.successor(node))
+				i++;
+			return node.item;
+		};
+	}
+
+}
\ No newline at end of file
diff --git a/lib/RBTree/RBTreeIterator.js b/lib/RBTree/RBTreeIterator.js
deleted file mode 100644
index accb87b..0000000
--- a/lib/RBTree/RBTreeIterator.js
+++ /dev/null
@@ -1,76 +0,0 @@
-/**
- * Created by Stefano on 06/04/2014.
- */
-
-RBTreeIterator.prototype = new Iterator();
-RBTreeIterator.prototype.constructor = RBTreeIterator;
-
-/**
- * Class that implements the iterator for a red-black tree.
- * @param aggregate {RBTree} The aggregate to scan.
- * @constructor
- */
-function RBTreeIterator(aggregate) {
-	/**
-	 * The aggregate relates to this iterator.
-	 * @type {RBTree}
-	 */
-	this.aggregate = aggregate;
-
-	/**
-	 * The pointer to the position.
-	 * @type {RBNode|null}
-	 */
-	this.pointer = null;
-}
-
-/**
- * @inheritDoc
- */
-RBTreeIterator.prototype.first = function () {
-	this.pointer = this.aggregate.minimum();
-};
-
-/**
- * @inheritDoc
- */
-RBTreeIterator.prototype.next = function () {
-	this.pointer = this.aggregate.successor(this.pointer);
-};
-
-/**
- * @inheritDoc
- */
-RBTreeIterator.prototype.last = function () {
-	this.pointer = this.aggregate.maximum();
-};
-
-/**
- * @inheritDoc
- */
-RBTreeIterator.prototype.previous = function () {
-	this.pointer = this.aggregate.predecessor(this.pointer);
-};
-
-/**
- * @inheritDoc
- */
-RBTreeIterator.prototype.isDone = function () {
-	return !this.pointer;
-};
-
-/**
- * @inheritDoc
- */
-RBTreeIterator.prototype.getItem = function () {
-	return this.pointer.item;
-};
-
-/**
- * Return the node stored at the position pointed by the iterator.
- * @abstract
- * @return {RBNode|null} The node stored or null if it's out of the bounds.
- */
-RBTreeIterator.prototype.getNode = function () {
-	return this.pointer;
-};
\ No newline at end of file
diff --git a/lib/RBTree/RBTreeIterator.ts b/lib/RBTree/RBTreeIterator.ts
new file mode 100644
index 0000000..cecd5a2
--- /dev/null
+++ b/lib/RBTree/RBTreeIterator.ts
@@ -0,0 +1,89 @@
+/**
+ * Created by Stefano on 06/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+namespace ds
+{
+	export class RBTreeIterator<T> implements Iterator
+	{
+		/**
+		 * The aggregate relates to this iterator.
+		 * @type {RBTree}
+		 */
+		aggregate: RBTree<T>;
+
+		/**
+		 * The pointer to the position.
+		 * @type {RBNode|null}
+		 */
+		pointer: RBNode<T> = <any>null;
+		/**
+		 * Class that implements the iterator for a red-black tree.
+		 * @param aggregate {RBTree} The aggregate to scan.
+		 * @constructor
+		 */
+		constructor(aggregate: RBTree<T>)
+		{
+			this.aggregate = aggregate;
+			this.pointer = <any>null;
+		}
+
+		/**
+		 * @inheritDoc
+		 */
+		first()
+		{
+			this.pointer = this.aggregate.minimum();
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		next()
+		{
+			this.pointer = this.aggregate.successor(this.pointer);
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		last()
+		{
+			this.pointer = this.aggregate.maximum();
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		previous()
+		{
+			this.pointer = this.aggregate.predecessor(this.pointer);
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		isDone()
+		{
+			return !this.pointer;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		getItem()
+		{
+			return this.pointer.item;
+		};
+
+		/**
+		 * Return the node stored at the position pointed by the iterator.
+		 * @abstract
+		 * @return {RBNode|null} The node stored or null if it's out of the bounds.
+		 */
+		getNode()
+		{
+			return this.pointer;
+		};
+	}
+}
\ No newline at end of file
diff --git a/lib/RBTreeList/RBTreeList.js b/lib/RBTreeList/RBTreeList.js
deleted file mode 100644
index c5f1d85..0000000
--- a/lib/RBTreeList/RBTreeList.js
+++ /dev/null
@@ -1,603 +0,0 @@
-/**
- * The single node of the tree.
- * @param key {number} The key of the node.
- * @param item {*} The item to store in the node.
- * @constructor
- */
-function RBLNode(key, item) {
-	/**
-	 * The item stored.
-	 * @type {*}
-	 */
-	this.item = item;
-	/**
-	 * The key of the node.
-	 * @type {number}
-	 */
-	this.key = key;
-	/**
-	 * The parent node. It's null if there's no a parent node.
-	 * @type {RBLNode|null}
-	 */
-	this.parent = null;
-	/**
-	 * The left node. It's null if there's no a left node.
-	 * @type {RBLNode|null}
-	 */
-	this.left = null;
-	/**
-	 * The right node. It's null if there's no a right node.
-	 * @type {RBLNode|null}
-	 */
-	this.right = null;
-	/**
-	 * The next node. It's null if there's no a next node.
-	 * @type {RBLNode|null}
-	 */
-	this.next = null;
-	/**
-	 * The previous node. It's null if there's no a previous node.
-	 * @type {RBLNode|null}
-	 */
-	this.previous = null;
-	/**
-	 * The type of the node. It's or red or black.
-	 * @type {string}
-	 */
-	this.type = 'r';
-}
-
-RBTreeList.prototype = new Aggregate();
-RBTreeList.prototype.constructor = RBTreeList;
-
-function RBTreeList() {
-	/**
-	 * The root of the tree.
-	 * @type {RBLNode|null}
-	 */
-	this.root = null;
-	/**
-	 * The first node of the tree.
-	 * @type {RBLNode|null}
-	 */
-	this.first = null;
-	/**
-	 * The last node of the tree.
-	 * @type {RBLNode|null}
-	 */
-	this.last = null;
-	/**
-	 * The size of the tree.
-	 * @type {number}
-	 */
-	this.size = 0;
-}
-
-/**
- * @inheritDoc
- */
-RBTreeList.prototype.getIterator = function () {
-	return new RBTreeListIterator(this);
-};
-
-/**
- * Insert the item relatives to the key value in the tree.
- * @param key {number} The key to store.
- * @param item {*} The item to store.
- * @return {void}
- */
-RBTreeList.prototype.insert = function (key, item) {
-	var node = new RBLNode(key, item);
-	this.size++;
-	if (!this.root) {
-		this.root = node;
-		this.first = node;
-		this.last = node;
-		node.type = 'b';
-		return;
-	}
-	var p = this.root;
-	for (var n = this.root; n;) {
-		p = n;
-		if (key < n.key)
-			n = n.left;
-		else
-			n = n.right;
-	}
-	node.parent = p;
-	if (!p)
-		this.root = node;
-	else if (key < p.key)
-		p.left = node;
-	else
-		p.right = node;
-
-	node.next = this.successor(node);
-	if (node.next) {
-		if (node.next.previous)
-			node.next.previous.next = node;
-		else
-			this.first = node;
-		node.previous = node.next.previous;
-		node.next.previous = node;
-	} else {
-		this.last = node;
-		node.previous = this.predecessor(node);
-		if (node.previous)
-			node.previous.next = node;
-		else
-			this.first = node;
-	}
-
-	this.insertFixUp(node);
-};
-
-/**
- * Preserve the properties of the tree after an insert.
- * @param node {RBLNode} The node to insert.
- * @return {void}
- */
-RBTreeList.prototype.insertFixUp = function (node) {
-	for (var parent = node.parent; parent && parent.type === 'r'; parent = node.parent) {
-		if (parent === parent.parent.left) {
-			var uncle = parent.parent.right;
-			if (uncle && uncle.type === 'r') {
-				parent.type = 'b';
-				uncle.type = 'b';
-				parent.parent.type = 'r';
-				node = parent.parent;
-			} else if (node === parent.right) {
-				node = parent;
-				this.leftRotate(node);
-			} else {
-				parent.type = 'b';
-				parent.parent.type = 'r';
-				this.rightRotate(parent.parent);
-			}
-		} else {
-			var uncle = parent.parent.left;
-			if (uncle && uncle.type === 'r') {
-				parent.type = 'b';
-				uncle.type = 'b';
-				parent.parent.type = 'r';
-				node = parent.parent;
-			} else if (node === parent.left) {
-				node = parent;
-				this.rightRotate(node);
-			} else {
-				parent.type = 'b';
-				parent.parent.type = 'r';
-				this.leftRotate(parent.parent);
-			}
-		}
-	}
-	this.root.type = 'b';
-};
-
-/**
- * Delete the node from the tree.
- * @param node {RBLNode} The node to delete.
- * @return {void}
- */
-RBTreeList.prototype.deleteNode = function (node) {
-	this.size--;
-	var successor;
-	if (!node.left || !node.right)
-		successor = node;
-	else {
-		successor = this.successor(node);
-		node.key = successor.key;
-		node.item = successor.item;
-	}
-	var child;
-	if (!successor.left)
-		child = successor.right;
-	else
-		child = successor.left;
-	if (child)
-		child.parent = successor.parent;
-	if (!successor.parent)
-		this.root = child;
-	else if (successor === successor.parent.left)
-		successor.parent.left = child;
-	else
-		successor.parent.right = child;
-
-	if (successor.next)
-		successor.next.previous = successor.previous;
-	else
-		this.last = successor.previous;
-	if (successor.previous)
-		successor.previous.next = successor.next;
-	else
-		this.first = successor.next;
-
-	if (successor.type === 'b')
-		this.deleteFixUp(child, successor.parent);
-};
-
-/**
- * Preserve the properties of the tree after a deletion.
- * @param node {RBLNode} The node to delete.
- * @param parent {RBLNode} The parent of the node.
- * @return {void}
- */
-RBTreeList.prototype.deleteFixUp = function (node, parent) {
-	while (node !== this.root && (!node || node.type === 'b')) {
-		if (node === parent.left) {
-			var brother = parent.right;
-			if (brother && brother.type === 'r') {
-				brother.type = 'b';
-				parent.type = 'r';
-				this.leftRotate(parent);
-				brother = parent.right;
-			}
-			if (brother && (!brother.left || brother.left.type === 'b') && (!brother.right || brother.right.type === 'b')) {
-				brother.type = 'r';
-				node = parent;
-			} else {
-				if (!brother.right || brother.right.type === 'b') {
-					brother.left.type = 'b';
-					brother.type = 'r';
-					this.rightRotate(brother);
-					brother = parent.right;
-				}
-				brother.type = parent.type;
-				parent.type = 'b';
-				brother.right.type = 'b';
-				this.leftRotate(parent);
-				node = this.root;
-			}
-		} else {
-			var brother = parent.left;
-			if (brother && brother.type === 'r') {
-				brother.type = 'b';
-				parent.type = 'r';
-				this.rightRotate(parent);
-				brother = parent.left;
-			}
-			if (brother && (!brother.left || brother.left.type === 'b') && (!brother.right || brother.right.type === 'b')) {
-				brother.type = 'r';
-				node = parent;
-			} else {
-				if (!brother.left || brother.left.type === 'b') {
-					brother.right.type = 'b';
-					brother.type = 'r';
-					this.leftRotate(brother);
-					brother = parent.left;
-				}
-				brother.type = parent.type;
-				parent.type = 'b';
-				brother.left.type = 'b';
-				this.rightRotate(parent);
-				node = this.root;
-			}
-		}
-		parent = node.parent;
-	}
-	if (node)
-		node.type = 'b';
-};
-
-/**
- * Get the node with the key next to the param node key.
- * @param node {RBLNode} The node of which search the successor.
- * @return {RBLNode} The node found.
- */
-RBTreeList.prototype.successor = function (node) {
-	if (node.next || node === this.last)
-		return node.next;
-	if (node.right)
-		return this.minimum(node.right);
-	var parent = node.parent;
-	while (parent && node === parent.right) {
-		node = parent;
-		parent = parent.parent;
-	}
-	return parent;
-};
-
-/**
- * Get the node with the key previous to the param node key.
- * @param node {RBLNode} The node of which search the predecessor.
- * @return {RBLNode} The node found.
- */
-RBTreeList.prototype.predecessor = function (node) {
-	if (node.previous || node === this.first)
-		return node.previous;
-	if (node.left)
-		return this.maximum(node.left);
-	var parent = node.parent;
-	while (parent && node === parent.left) {
-		node = parent;
-		parent = parent.parent;
-	}
-	return parent;
-};
-
-/**
- * Search the item relatives to the key that satisfy the condition represented by the callback function.
- * @param key {number} The key to find.
- * @param [node = root] {RBNode} The node from which start the search.
- * @param [callback = function(k){return(k===key);}] The condition to satisfy. The callback must accept the current key to check.
- * @return {*} The item found or undefined if there isn't the key in the tree.
- */
-RBTreeList.prototype.search = function (key, node, callback) {
-	node = node || this.root;
-	callback = callback || function (node) {
-		return node.key === key;
-	};
-	while (node && !callback(node))
-		if (key < node.key)
-			node = node.left;
-		else
-			node = node.right;
-	if (node)
-		return node.item;
-	return undefined;
-};
-
-/**
- * Checks if the tree contains a key or a node that satisfy the condition represented by the callback function.
- * This method avoid to search in branches where the key won't be found.
- * @param key {*} The key to find.
- * @param [callback = function(node){return(node.key===key);}] The condition to satisfy. The callback must accept the current node to check.
- * @return {boolean} True if the tree contains the key or a node that satisfy the condition, false otherwise.
- */
-RBTreeList.prototype.contains = function (key, callback) {
-	return this.search(key, null, callback) !== undefined;
-};
-
-/**
- * Checks if the tree contains a node that satisfy the condition represented by the callback function.
- * This method check all the tree avoiding the binary search.
- * @param callback {function} The condition to satisfy. The callback must accept the current node to check.
- * @return {boolean} True if the tree contains the node that satisfy the condition, false otherwise.
- */
-RBTreeList.prototype.fullContains = function (callback) {
-	var node = this.first;
-	while (node && !callback(node.key))
-		node = node.next;
-	return node !== null;
-};
-
-/**
- * Get the item relatives to the minimum key stored in the tree.
- * @param [node = root] {Node} The node from which start the search.
- * @return {RBLNode} The node found.
- */
-RBTreeList.prototype.minimum = function (node) {
-	if (node)
-		while (node && node.left)
-			node = node.left;
-	else
-		return this.first;
-	return node;
-};
-
-/**
- * Get the item relatives to the maximum key stored in the tree.
- * @param [node = root] {Node} The node from which start the search.
- * @return {RBLNode} The node found.
- */
-RBTreeList.prototype.maximum = function (node) {
-	if (node)
-		while (node && node.right)
-			node = node.right;
-	else
-		return this.last;
-	return node;
-};
-
-/**
- * Rotate the node with its right child.
- * @param node {RBLNode} The node to rotate.
- * @return {void}
- */
-RBTreeList.prototype.leftRotate = function (node) {
-	var child = node.right;
-	node.right = child.left;
-	if (child.left !== null)
-		child.left.parent = node;
-	child.parent = node.parent;
-	if (node.parent === null)
-		this.root = child;
-	else if (node === node.parent.left)
-		node.parent.left = child;
-	else
-		node.parent.right = child;
-	node.parent = child;
-	child.left = node;
-};
-
-/**
- * Rotate the node with its left child.
- * @param node {RBLNode} The node to rotate.
- * @return {void}
- */
-RBTreeList.prototype.rightRotate = function (node) {
-	var child = node.left;
-	node.left = child.right;
-	if (child.right !== null)
-		child.right.parent = node;
-	child.parent = node.parent;
-	if (node.parent === null)
-		this.root = child;
-	else if (node === node.parent.left)
-		node.parent.left = child;
-	else
-		node.parent.right = child;
-	node.parent = child;
-	child.right = node;
-};
-
-/**
- * Returns the size of the tree.
- * @return {number} The size of the tree.
- */
-RBTreeList.prototype.getSize = function () {
-	return this.size;
-};
-
-/**
- * Clones the tree into a new tree.
- * @return {RBTreeList} The tree cloned from this tree.
- */
-RBTreeList.prototype.clone = function () {
-	var tree = new RBTreeList();
-	var it = this.getIterator();
-	for (it.first(); !it.isDone(); it.next())
-		tree.insert(it.getNode().key, it.getNode().item);
-	return tree;
-};
-
-/**
- * Clones the tree into a new tree without cloning duplicated items.
- * @return {RBTreeList} The tree cloned from this tree.
- */
-RBTreeList.prototype.cloneDistinct = function () {
-	var tree = new RBTreeList();
-	var it = this.getIterator();
-	for (it.first(); !it.isDone(); it.next()) {
-		var callback = function (node) {
-			return node.key === it.getNode().key && node.item === it.getNode().item;
-		};
-		if (!tree.contains(it.getNode().key, callback)) {
-			if (it.getNode().item.cloneDistinct)
-				tree.insert(it.getNode().key, it.getNode().item.cloneDistinct());
-			else if (it.getNode().item.clone)
-				tree.insert(it.getNode().key, it.getNode().item.clone());
-			else
-				tree.insert(it.getNode().key, it.getNode().item);
-		}
-	}
-	return tree;
-};
-
-/**
- * Transform the tree into an array without preserving keys.
- * @return {Array<*>} The array that represents the tree.
- */
-RBTreeList.prototype.toArray = function () {
-	var result = [];
-	for (var node = this.first; node; node = node.next)
-		result.push(node.item);
-	return result;
-};
-
-/**
- * Removes all the items stored in the tree.
- * @return {void}
- */
-RBTreeList.prototype.clear = function () {
-	this.root = null;
-	this.first = null;
-	this.last = null;
-	this.size = 0;
-};
-
-/**
- * Checks if the tree is empty.
- * @return {boolean} True if the tree is empty, false otherwise.
- */
-RBTreeList.prototype.isEmpty = function () {
-	return !this.size;
-};
-
-/**
- * Executes the callback function for each item of the tree.
- * This method modifies the tree so if you don't need to modify it you must return the same item stored.
- * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
- * @return {void}
- */
-RBTreeList.prototype.execute = function (callback) {
-	for (var node = this.first; node; node = node.next)
-		node.item = callback(node.item);
-};
-
-/**
- * Returns the items that satisfy the condition determined by the callback.
- * @param callback {function} The function that implements the condition.
- * @return {Array<*>} The array that contains the items that satisfy the condition.
- */
-RBTreeList.prototype.filter = function (callback) {
-	var result = [];
-	for (var node = this.first; node; node = node.next)
-		if (callback(node.item))
-			result.push(node.item);
-	return result;
-};
-
-/**
- * Returns the first position of the item in the tree.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The first position of the item.
- */
-RBTreeList.prototype.indexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0, node = this.first;
-	while (node) {
-		if (callback(node.item))
-			return i;
-		node = node.next;
-		i++;
-	}
-	return -1;
-};
-
-/**
- * Returns the last position of the item in the tree.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The last position of the item.
- */
-RBTreeList.prototype.lastIndexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = this.size - 1, node = this.last;
-	while (node) {
-		if (callback(node.item))
-			return i;
-		i--;
-		node = node.previous;
-	}
-	return -1;
-};
-
-/**
- * Returns all the position in which the item has been found in the tree.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {Array<number>} The positions in which the item has been found.
- */
-RBTreeList.prototype.allIndexesOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0, node = this.first;
-	var indexes = [];
-	while (node) {
-		if (callback(node.item))
-			indexes.push(i);
-		i++;
-		node = node.next;
-	}
-	return indexes;
-};
-
-/**
- * Returns the item at the position index.
- * @param index {number} The position of the item.
- * @return {*} The item at the position. It's undefined if index isn't in the tree bounds.
- */
-RBTreeList.prototype.getItem = function (index) {
-	if (index < 0 || index > this.size - 1)
-		return undefined;
-	for (var node = this.first, i = 0; i < index; node = node.next)
-		i++;
-	return node.item;
-};
\ No newline at end of file
diff --git a/lib/RBTreeList/RBTreeList.ts b/lib/RBTreeList/RBTreeList.ts
new file mode 100644
index 0000000..53998cc
--- /dev/null
+++ b/lib/RBTreeList/RBTreeList.ts
@@ -0,0 +1,690 @@
+namespace ds
+{
+	export class RBLNode<T>
+	{
+		/**
+		 * The item stored.
+		 * @type {*}
+		 */
+		item: T;
+		/**
+		 * The key of the node.
+		 * @type {number}
+		 */
+		key: number;
+		/**
+		 * The parent node. It's null if there's no a parent node.
+		 * @type {RBLNode|null}
+		 */
+		parent: RBLNode<T> = <any>null;
+		/**
+		 * The left node. It's null if there's no a left node.
+		 * @type {RBLNode|null}
+		 */
+		left: RBLNode<T> = <any>null;
+		/**
+		 * The right node. It's null if there's no a right node.
+		 * @type {RBLNode|null}
+		 */
+		right: RBLNode<T> = <any>null;
+		/**
+		 * The next node. It's null if there's no a next node.
+		 * @type {RBLNode|null}
+		 */
+		next: RBLNode<T> = <any>null;
+		/**
+		 * The previous node. It's null if there's no a previous node.
+		 * @type {RBLNode|null}
+		 */
+		previous: RBLNode<T> = <any>null;
+		/**
+		 * The type of the node. It's or red or black.
+		 * @type {string}
+		 */
+		type = 'r';
+
+		/**
+		 * The single node of the tree.
+		 * @param key {number} The key of the node.
+		 * @param item {*} The item to store in the node.
+		 * @constructor
+		 */
+		constructor(key: number, item: T)
+		{
+			this.item = item;
+			this.key = key;
+			this.parent = <any>null;
+			this.left = <any>null;
+			this.right = <any>null;
+			this.next = <any>null;
+			this.previous = <any>null;
+			this.type = 'r';
+		}
+	}
+
+	export class RBTreeList<T> extends Aggregate
+	{
+		/**
+		 * The root of the tree.
+		 * @type {RBLNode|null}
+		 */
+		root: RBLNode<T> = <any>null;
+		/**
+		 * The first node of the tree.
+		 * @type {RBLNode|null}
+		 */
+		first: RBLNode<T> = <any>null;
+		/**
+		 * The last node of the tree.
+		 * @type {RBLNode|null}
+		 */
+		last: RBLNode<T> = <any>null;
+		/**
+		 * The size of the tree.
+		 * @type {number}
+		 */
+		size = 0;
+
+		constructor()
+		{
+			super();
+			this.root = <any>null;
+			this.first = <any>null;
+			this.last = <any>null;
+			this.size = 0;
+		}
+
+		/**
+		 * @inheritDoc
+		 */
+		getIterator()
+		{
+			return new RBTreeListIterator<T>(this);
+		};
+
+		/**
+		 * Insert the item relatives to the key value in the tree.
+		 * @param key {number} The key to store.
+		 * @param item {*} The item to store.
+		 * @return {void}
+		 */
+		insert(key: number, item: T)
+		{
+			var node = new RBLNode(key, item);
+			this.size++;
+			if (!this.root)
+			{
+				this.root = node;
+				this.first = node;
+				this.last = node;
+				node.type = 'b';
+				return;
+			}
+			var p = this.root;
+			for (var n = this.root; n;)
+			{
+				p = n;
+				if (key < n.key)
+					n = n.left;
+				else
+					n = n.right;
+			}
+			node.parent = p;
+			if (!p)
+				this.root = node;
+			else if (key < p.key)
+				p.left = node;
+			else
+				p.right = node;
+
+			node.next = this.successor(node);
+			if (node.next)
+			{
+				if (node.next.previous)
+					node.next.previous.next = node;
+				else
+					this.first = node;
+				node.previous = node.next.previous;
+				node.next.previous = node;
+			} else
+			{
+				this.last = node;
+				node.previous = this.predecessor(node);
+				if (node.previous)
+					node.previous.next = node;
+				else
+					this.first = node;
+			}
+
+			this.insertFixUp(node);
+		};
+
+		/**
+		 * Preserve the properties of the tree after an insert.
+		 * @param node {RBLNode} The node to insert.
+		 * @return {void}
+		 */
+		insertFixUp(node: RBLNode<T>)
+		{
+			for (var parent = node.parent; parent && parent.type === 'r'; parent = node.parent)
+			{
+				if (parent === parent.parent.left)
+				{
+					var uncle = parent.parent.right;
+					if (uncle && uncle.type === 'r')
+					{
+						parent.type = 'b';
+						uncle.type = 'b';
+						parent.parent.type = 'r';
+						node = parent.parent;
+					} else if (node === parent.right)
+					{
+						node = parent;
+						this.leftRotate(node);
+					} else
+					{
+						parent.type = 'b';
+						parent.parent.type = 'r';
+						this.rightRotate(parent.parent);
+					}
+				} else
+				{
+					var uncle = parent.parent.left;
+					if (uncle && uncle.type === 'r')
+					{
+						parent.type = 'b';
+						uncle.type = 'b';
+						parent.parent.type = 'r';
+						node = parent.parent;
+					} else if (node === parent.left)
+					{
+						node = parent;
+						this.rightRotate(node);
+					} else
+					{
+						parent.type = 'b';
+						parent.parent.type = 'r';
+						this.leftRotate(parent.parent);
+					}
+				}
+			}
+			this.root.type = 'b';
+		};
+
+		/**
+		 * Delete the node from the tree.
+		 * @param node {RBLNode} The node to delete.
+		 * @return {void}
+		 */
+		deleteNode(node: RBLNode<T>)
+		{
+			this.size--;
+			var successor;
+			if (!node.left || !node.right)
+				successor = node;
+			else
+			{
+				successor = this.successor(node);
+				node.key = successor.key;
+				node.item = successor.item;
+			}
+			var child;
+			if (!successor.left)
+				child = successor.right;
+			else
+				child = successor.left;
+			if (child)
+				child.parent = successor.parent;
+			if (!successor.parent)
+				this.root = child;
+			else if (successor === successor.parent.left)
+				successor.parent.left = child;
+			else
+				successor.parent.right = child;
+
+			if (successor.next)
+				successor.next.previous = successor.previous;
+			else
+				this.last = successor.previous;
+			if (successor.previous)
+				successor.previous.next = successor.next;
+			else
+				this.first = successor.next;
+
+			if (successor.type === 'b')
+				this.deleteFixUp(child, successor.parent);
+		};
+
+		/**
+		 * Preserve the properties of the tree after a deletion.
+		 * @param node {RBLNode} The node to delete.
+		 * @param parent {RBLNode} The parent of the node.
+		 * @return {void}
+		 */
+		deleteFixUp(node: RBLNode<T>, parent: RBLNode<T>)
+		{
+			while (node !== this.root && (!node || node.type === 'b'))
+			{
+				if (node === parent.left)
+				{
+					var brother = parent.right;
+					if (brother && brother.type === 'r')
+					{
+						brother.type = 'b';
+						parent.type = 'r';
+						this.leftRotate(parent);
+						brother = parent.right;
+					}
+					if (brother && (!brother.left || brother.left.type === 'b') && (!brother.right || brother.right.type === 'b'))
+					{
+						brother.type = 'r';
+						node = parent;
+					} else
+					{
+						if (!brother.right || brother.right.type === 'b')
+						{
+							brother.left.type = 'b';
+							brother.type = 'r';
+							this.rightRotate(brother);
+							brother = parent.right;
+						}
+						brother.type = parent.type;
+						parent.type = 'b';
+						brother.right.type = 'b';
+						this.leftRotate(parent);
+						node = this.root;
+					}
+				} else
+				{
+					var brother = parent.left;
+					if (brother && brother.type === 'r')
+					{
+						brother.type = 'b';
+						parent.type = 'r';
+						this.rightRotate(parent);
+						brother = parent.left;
+					}
+					if (brother && (!brother.left || brother.left.type === 'b') && (!brother.right || brother.right.type === 'b'))
+					{
+						brother.type = 'r';
+						node = parent;
+					} else
+					{
+						if (!brother.left || brother.left.type === 'b')
+						{
+							brother.right.type = 'b';
+							brother.type = 'r';
+							this.leftRotate(brother);
+							brother = parent.left;
+						}
+						brother.type = parent.type;
+						parent.type = 'b';
+						brother.left.type = 'b';
+						this.rightRotate(parent);
+						node = this.root;
+					}
+				}
+				parent = node.parent;
+			}
+			if (node)
+				node.type = 'b';
+		};
+
+		/**
+		 * Get the node with the key next to the param node key.
+		 * @param node {RBLNode} The node of which search the successor.
+		 * @return {RBLNode} The node found.
+		 */
+		successor(node: RBLNode<T>)
+		{
+			if (node.next || node === this.last)
+				return node.next;
+			if (node.right)
+				return this.minimum(node.right);
+			var parent = node.parent;
+			while (parent && node === parent.right)
+			{
+				node = parent;
+				parent = parent.parent;
+			}
+			return parent;
+		};
+
+		/**
+		 * Get the node with the key previous to the param node key.
+		 * @param node {RBLNode} The node of which search the predecessor.
+		 * @return {RBLNode} The node found.
+		 */
+		predecessor(node: RBLNode<T>)
+		{
+			if (node.previous || node === this.first)
+				return node.previous;
+			if (node.left)
+				return this.maximum(node.left);
+			var parent = node.parent;
+			while (parent && node === parent.left)
+			{
+				node = parent;
+				parent = parent.parent;
+			}
+			return parent;
+		};
+
+		/**
+		 * Search the item relatives to the key that satisfy the condition represented by the callback function.
+		 * @param key {number} The key to find.
+		 * @param [node = root] {RBNode} The node from which start the search.
+		 * @param [callback = function(k){return(k===key);}] The condition to satisfy. The callback must accept the current key to check.
+		 * @return {*} The item found or undefined if there isn't the key in the tree.
+		 */
+		search(key: number, node?: RBLNode<T>, callback?: (node: RBLNode<T>) => boolean)
+		{
+			node = node || this.root;
+			callback = callback || function (node)
+			{
+				return node.key === key;
+			};
+			while (node && !callback(node))
+				if (key < node.key)
+					node = node.left;
+				else
+					node = node.right;
+			if (node)
+				return node.item;
+			return undefined;
+		};
+
+		/**
+		 * Checks if the tree contains a key or a node that satisfy the condition represented by the callback function.
+		 * This method avoid to search in branches where the key won't be found.
+		 * @param key {*} The key to find.
+		 * @param [callback = function(node){return(node.key===key);}] The condition to satisfy. The callback must accept the current node to check.
+		 * @return {boolean} True if the tree contains the key or a node that satisfy the condition, false otherwise.
+		 */
+		contains(key: number, callback?: (node: RBLNode<T>) => boolean)
+		{
+			return this.search(key, <any>null, callback) !== undefined;
+		};
+
+		/**
+		 * Checks if the tree contains a node that satisfy the condition represented by the callback function.
+		 * This method check all the tree avoiding the binary search.
+		 * @param callback {function} The condition to satisfy. The callback must accept the current node to check.
+		 * @return {boolean} True if the tree contains the node that satisfy the condition, false otherwise.
+		 */
+		fullContains(callback: (key: number) => boolean)
+		{
+			var node = this.first;
+			while (node && !callback(node.key))
+				node = node.next;
+			return node !== null;
+		};
+
+		/**
+		 * Get the item relatives to the minimum key stored in the tree.
+		 * @param [node = root] {Node} The node from which start the search.
+		 * @return {RBLNode} The node found.
+		 */
+		minimum(node?: RBLNode<T>)
+		{
+			if (node)
+				while (node && node.left)
+					node = node.left;
+			else
+				return this.first;
+			return node;
+		};
+
+		/**
+		 * Get the item relatives to the maximum key stored in the tree.
+		 * @param [node = root] {Node} The node from which start the search.
+		 * @return {RBLNode} The node found.
+		 */
+		maximum(node?: RBLNode<T>)
+		{
+			if (node)
+				while (node && node.right)
+					node = node.right;
+			else
+				return this.last;
+			return node;
+		};
+
+		/**
+		 * Rotate the node with its right child.
+		 * @param node {RBLNode} The node to rotate.
+		 * @return {void}
+		 */
+		leftRotate(node: RBLNode<T>)
+		{
+			var child = node.right;
+			node.right = child.left;
+			if (child.left !== null)
+				child.left.parent = node;
+			child.parent = node.parent;
+			if (node.parent === null)
+				this.root = child;
+			else if (node === node.parent.left)
+				node.parent.left = child;
+			else
+				node.parent.right = child;
+			node.parent = child;
+			child.left = node;
+		};
+
+		/**
+		 * Rotate the node with its left child.
+		 * @param node {RBLNode} The node to rotate.
+		 * @return {void}
+		 */
+		rightRotate(node: RBLNode<T>)
+		{
+			var child = node.left;
+			node.left = child.right;
+			if (child.right !== null)
+				child.right.parent = node;
+			child.parent = node.parent;
+			if (node.parent === null)
+				this.root = child;
+			else if (node === node.parent.left)
+				node.parent.left = child;
+			else
+				node.parent.right = child;
+			node.parent = child;
+			child.right = node;
+		};
+
+		/**
+		 * Returns the size of the tree.
+		 * @return {number} The size of the tree.
+		 */
+		getSize()
+		{
+			return this.size;
+		};
+
+		/**
+		 * Clones the tree into a new tree.
+		 * @return {RBTreeList} The tree cloned from this tree.
+		 */
+		clone()
+		{
+			var tree = new RBTreeList<T>();
+			var it = this.getIterator();
+			for (it.first(); !it.isDone(); it.next())
+				tree.insert(it.getNode().key, it.getNode().item);
+			return tree;
+		};
+
+		/**
+		 * Clones the tree into a new tree without cloning duplicated items.
+		 * @return {RBTreeList} The tree cloned from this tree.
+		 */
+		cloneDistinct()
+		{
+			var tree = new RBTreeList<T>();
+			var it = this.getIterator();
+			for (it.first(); !it.isDone(); it.next())
+			{
+				var callback = function (node: RBLNode<T>)
+				{
+					return node.key === it.getNode().key && node.item === it.getNode().item;
+				};
+				if (!tree.contains(it.getNode().key, callback))
+				{
+					var item: any = it.getNode().item;
+					if (item.cloneDistinct)
+						tree.insert(it.getNode().key, item.cloneDistinct());
+					else if (item.clone)
+						tree.insert(it.getNode().key, item.clone());
+					else
+						tree.insert(it.getNode().key, item);
+				}
+			}
+			return tree;
+		};
+
+		/**
+		 * Transform the tree into an array without preserving keys.
+		 * @return {Array<*>} The array that represents the tree.
+		 */
+		toArray()
+		{
+			var result = [];
+			for (var node = this.first; node; node = node.next)
+				result.push(node.item);
+			return result;
+		};
+
+		/**
+		 * Removes all the items stored in the tree.
+		 * @return {void}
+		 */
+		clear()
+		{
+			this.root = <any>null;
+			this.first = <any>null;
+			this.last = <any>null;
+			this.size = 0;
+		};
+
+		/**
+		 * Checks if the tree is empty.
+		 * @return {boolean} True if the tree is empty, false otherwise.
+		 */
+		isEmpty()
+		{
+			return !this.size;
+		};
+
+		/**
+		 * Executes the callback function for each item of the tree.
+		 * This method modifies the tree so if you don't need to modify it you must return the same item stored.
+		 * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+		 * @return {void}
+		 */
+		execute(callback: (item: T) => T)
+		{
+			for (var node = this.first; node; node = node.next)
+				node.item = callback(node.item);
+		};
+
+		/**
+		 * Returns the items that satisfy the condition determined by the callback.
+		 * @param callback {function} The function that implements the condition.
+		 * @return {Array<*>} The array that contains the items that satisfy the condition.
+		 */
+		filter(callback: (item: T) => boolean)
+		{
+			var result = [];
+			for (var node = this.first; node; node = node.next)
+				if (callback(node.item))
+					result.push(node.item);
+			return result;
+		};
+
+		/**
+		 * Returns the first position of the item in the tree.
+		 * @param item {*} The item to search.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {number} The first position of the item.
+		 */
+		indexOf(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var i = 0, node = this.first;
+			while (node)
+			{
+				if (callback(node.item))
+					return i;
+				node = node.next;
+				i++;
+			}
+			return -1;
+		};
+
+		/**
+		 * Returns the last position of the item in the tree.
+		 * @param item {*} The item to search.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {number} The last position of the item.
+		 */
+		lastIndexOf(item: any, callback?: (item: any) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var i = this.size - 1, node = this.last;
+			while (node)
+			{
+				if (callback(node.item))
+					return i;
+				i--;
+				node = node.previous;
+			}
+			return -1;
+		};
+
+		/**
+		 * Returns all the position in which the item has been found in the tree.
+		 * @param item {*} The item to search.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {Array<number>} The positions in which the item has been found.
+		 */
+		allIndexesOf(item: any, callback?: (item: any) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var i = 0, node = this.first;
+			var indexes = [];
+			while (node)
+			{
+				if (callback(node.item))
+					indexes.push(i);
+				i++;
+				node = node.next;
+			}
+			return indexes;
+		};
+
+		/**
+		 * Returns the item at the position index.
+		 * @param index {number} The position of the item.
+		 * @return {*} The item at the position. It's undefined if index isn't in the tree bounds.
+		 */
+		getItem(index: number)
+		{
+			if (index < 0 || index > this.size - 1)
+				return undefined;
+			for (var node = this.first, i = 0; i < index; node = node.next)
+				i++;
+			return node.item;
+		};
+	}
+}
\ No newline at end of file
diff --git a/lib/RBTreeList/RBTreeListIterator.js b/lib/RBTreeList/RBTreeListIterator.js
deleted file mode 100644
index c4cd51c..0000000
--- a/lib/RBTreeList/RBTreeListIterator.js
+++ /dev/null
@@ -1,75 +0,0 @@
-/**
- * Created by Stefano on 06/04/2014.
- */
-
-RBTreeListIterator.prototype = new Iterator();
-RBTreeListIterator.prototype.constructor = RBTreeListIterator;
-
-/**
- * Class that implements the iterator for a red-black tree.
- * @param aggregate {RBTreeList} The aggregate to scan.
- * @constructor
- */
-function RBTreeListIterator(aggregate) {
-	/**
-	 * The aggregate relates to this iterator.
-	 * @type {RBTreeList}
-	 */
-	this.aggregate = aggregate;
-	/**
-	 * The pointer to the position.
-	 * @type {RBLNode|null}
-	 */
-	this.pointer = null;
-}
-
-/**
- * @inheritDoc
- */
-RBTreeListIterator.prototype.first = function () {
-	this.pointer = this.aggregate.first;
-};
-
-/**
- * @inheritDoc
- */
-RBTreeListIterator.prototype.next = function () {
-	this.pointer = this.pointer.next;
-};
-
-/**
- * @inheritDoc
- */
-RBTreeListIterator.prototype.last = function () {
-	this.pointer = this.aggregate.last;
-};
-
-/**
- * @inheritDoc
- */
-RBTreeListIterator.prototype.previous = function () {
-	this.pointer = this.pointer.previous;
-};
-
-/**
- * @inheritDoc
- */
-RBTreeListIterator.prototype.isDone = function () {
-	return !this.pointer;
-};
-
-/**
- * @inheritDoc
- */
-RBTreeListIterator.prototype.getItem = function () {
-	return this.pointer.item;
-};
-
-/**
- * Return the node stored at the position pointed by the iterator.
- * @abstract
- * @return {RBNode|null} The node stored or null if it's out of the bounds.
- */
-RBTreeListIterator.prototype.getNode = function () {
-	return this.pointer;
-};
\ No newline at end of file
diff --git a/lib/RBTreeList/RBTreeListIterator.ts b/lib/RBTreeList/RBTreeListIterator.ts
new file mode 100644
index 0000000..e019c9b
--- /dev/null
+++ b/lib/RBTreeList/RBTreeListIterator.ts
@@ -0,0 +1,89 @@
+/**
+ * Created by Stefano on 06/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+namespace ds
+{
+	export class RBTreeListIterator<T> implements Iterator
+	{
+		/**
+		 * The aggregate relates to this iterator.
+		 * @type {RBTreeList}
+		 */
+		aggregate: RBTreeList<T>;
+		/**
+		 * The pointer to the position.
+		 * @type {RBLNode|null}
+		 */
+		pointer: RBLNode<T> = <any>null;
+
+		/**
+		 * Class that implements the iterator for a red-black tree.
+		 * @param aggregate {RBTreeList} The aggregate to scan.
+		 * @constructor
+		 */
+		constructor(aggregate: RBTreeList<T>)
+		{
+			this.aggregate = aggregate;
+			this.pointer = <any>null;
+		}
+
+		/**
+		 * @inheritDoc
+		 */
+		first()
+		{
+			this.pointer = this.aggregate.first;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		next()
+		{
+			this.pointer = this.pointer.next;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		last()
+		{
+			this.pointer = this.aggregate.last;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		previous()
+		{
+			this.pointer = this.pointer.previous;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		isDone()
+		{
+			return !this.pointer;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		getItem()
+		{
+			return this.pointer.item;
+		};
+
+		/**
+		 * Return the node stored at the position pointed by the iterator.
+		 * @abstract
+		 * @return {RBNode|null} The node stored or null if it's out of the bounds.
+		 */
+		getNode()
+		{
+			return this.pointer;
+		};
+	}
+}
\ No newline at end of file
diff --git a/lib/Range/Range.js b/lib/Range/Range.js
deleted file mode 100644
index 80a0892..0000000
--- a/lib/Range/Range.js
+++ /dev/null
@@ -1,21 +0,0 @@
-/**
- * Created by Stefano on 01/02/2015.
- */
-
-/**
- * Create an array containing the value of the range
- * @param from {number} The inclusive start value of the range.
- * @param to {number} The inclusive end value of the range.
- * @param [step=1] The step to sample the values
- * @return {Array<number>} The array containing the value of the range.
- */
-function Range(from, to, step) {
-    var range = [];
-    step = step || 1;
-    var sign = (step > 0 ? 1 : -1);
-
-    for (var i = 0; from * sign <= to * sign; from += step, ++i)
-        range[i] = from;
-
-    return range;
-}
\ No newline at end of file
diff --git a/lib/Range/Range.ts b/lib/Range/Range.ts
new file mode 100644
index 0000000..3547f48
--- /dev/null
+++ b/lib/Range/Range.ts
@@ -0,0 +1,25 @@
+/**
+ * Created by Stefano on 01/02/2015.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+namespace ds
+{
+    /**
+     * Create an array containing the value of the range
+     * @param from {number} The inclusive start value of the range.
+     * @param to {number} The inclusive end value of the range.
+     * @param [step=1] The step to sample the values
+     * @return {Array<number>} The array containing the value of the range.
+     */
+    export function Range(from: number, to: number, step?: number)
+    {
+        var range = [];
+        step = step || 1;
+        var sign = (step > 0 ? 1 : -1);
+
+        for (var i = 0; from * sign <= to * sign; from += step, ++i)
+            range[i] = from;
+
+        return range;
+    }
+}
\ No newline at end of file
diff --git a/lib/Set/Set.js b/lib/Set/Set.js
deleted file mode 100644
index 5a7be32..0000000
--- a/lib/Set/Set.js
+++ /dev/null
@@ -1,224 +0,0 @@
-/**
- * Created by Stefano on 12/04/2014.
- */
-
-/**
- * Class for representing an element of a set.
- * @param item {*} The item to store in the element.
- * @constructor
- */
-function Element(item) {
-	this.parents = new DoubleLinkedList();
-	this.item = item;
-}
-
-/**
- * Class for managing a set.
- * @constructor
- */
-function Set() {
-	/**
-	 * The parents of the set.
-	 * @type {DoubleLinkedList}
-	 */
-	this.parents = new DoubleLinkedList();
-	/**
-	 * The elements stored.
-	 * @type {DoubleLinkedList}
-	 */
-	this.elements = new DoubleLinkedList();
-	/**
-	 * The subsets of this set.
-	 * @type {DoubleLinkedList}
-	 */
-	this.sets = new DoubleLinkedList();
-	/**
-	 * The size of the set. It's equal to his cardinality.
-	 * @type {number}
-	 */
-	this.size = 0;
-}
-
-/**
- * Add the element to the set.
- * @param element {Element} The element to add.
- * @return {void}
- */
-Set.prototype.insert = function (element) {
-	this.elements.pushBack(element);
-	element.parents.pushBack(this);
-	this.size++;
-};
-
-/**
- * Add the elements to the set.
- * @param elements {Array<Element>} The elements to add.
- * @return {void}
- */
-Set.prototype.multiInsert = function (elements) {
-	for (var i = 0; i < elements.length; i++) {
-		this.elements.pushBack(elements[i]);
-		elements[i].parents.pushBack(this);
-	}
-	this.size += elements.length;
-};
-
-/**
- * Returns the set that represents the union of two sets.
- * @param set {Set} The set with make the union.
- * @return {Set} The set that represents the union.
- */
-Set.prototype.union = function (set) {
-	var parent = new Set();
-	parent.addSubsets([this, set]);
-	this.parents.pushBack(parent);
-	set.parents.pushBack(parent);
-	//change the parent of the subset
-	var that = this;
-	var f = function (item) {
-		if (item === that)
-			return parent;
-	};
-	var it = this.sets.getIterator();
-	for (it.first(); !it.isDone(); it.next())
-		it.getItem().parents.execute(f);
-	f = function (item) {
-		if (item === set)
-			return parent;
-	};
-	it = set.sets.getIterator();
-	for (it.first(); !it.isDone(); it.next())
-		it.getItem().parents.execute(f);
-	return parent;
-};
-
-/**
- * Returns the set that represents the intersection of two sets.
- * @param set {Set} The set to intersect with this.
- * @return {Set} The set that represents the intersection.
- */
-Set.prototype.intersect = function (set) {
-	var intersection = new Set();
-	//intersect this set with the set
-	var el = this.elements.getIterator();
-	for (el.first(); !el.isDone(); el.next())
-		if (el.getItem().parents.contains(set))
-			intersection.insert(el.getItem());
-
-	//intersect the subsets with the set
-	var it = this.sets.getIterator();
-	for (it.first(); !it.isDone(); it.next()) {
-		el = it.getItem().getIterator();
-		for (el.first(); !el.isDone(); el.next())
-			if (el.getItem().parents.contains(set))
-				intersection.insert(el.getItem());
-	}
-	return intersection;
-};
-
-/**
- * Returns the set that represents the difference of two sets.
- * @param set {Set} The set to difference with this.
- * @return {Set} The set that represents the difference.
- */
-Set.prototype.difference = function (set) {
-	var diff = new Set();
-	//intersect this set with the set
-	var el = this.elements.getIterator();
-	for (el.first(); !el.isDone(); el.next())
-		if (!el.getItem().parents.contains(set))
-			diff.insert(el.getItem());
-
-	//intersect the subsets with the set
-	var it = this.sets.getIterator();
-	for (it.first(); !it.isDone(); it.next()) {
-		el = it.getItem().getIterator();
-		for (el.first(); !el.isDone(); el.next())
-			if (!el.getItem().parents.contains(set))
-				diff.insert(el.getItem());
-	}
-	return diff;
-};
-
-/**
- * Returns the set that represents the cartesian product of two sets.
- * @param set {Set} The set to make the cartesian product with this.
- * @return {Set} The set that represents the cartesian product .
- */
-Set.prototype.cartesianProduct = function (set) {
-	var el1 = this.getItems();
-	var el2 = set.getItems();
-	var product = new Set();
-	for (var i = 0; i < el1.length; i++)
-		for (var j = 0; j < el2.length; j++)
-			product.insert(new Element([el1[i], el2[j]]));
-	return product;
-};
-
-/**
- * Add the subset.
- * @param set {Set} The subset.
- */
-Set.prototype.addSubset = function (set) {
-	this.sets.pushBack(set);
-	this.size += set.size;
-};
-
-/**
- * Add the subsets.
- * @param sets {Array<Set>} The subsets.
- */
-Set.prototype.addSubsets = function (sets) {
-	for (var i = 0; i < sets.length; i++)
-		this.addSubset(sets[i]);
-};
-
-/**
- * Returns the items that are stored in the set.
- * @return {Array} The items stored.
- */
-Set.prototype.getItems = function () {
-	var array = [];
-	//get the items stored in the set
-	var el = this.elements.getIterator();
-	for (el.first(); !el.isDone(); el.next())
-		array.push(el.getItem().item);
-
-	//get the items stored in the subsets
-	var it = this.sets.getIterator();
-	for (it.first(); !it.isDone(); it.next()) {
-		el = it.getItem().getIterator();
-		for (el.first(); !el.isDone(); el.next())
-			array.push(el.getItem().item);
-	}
-	return array;
-};
-
-/**
- * Returns the cardinality of the set.
- * @return {number} The cardinality of the set.
- */
-Set.prototype.getCardinality = function () {
-	return this.size;
-};
-
-/**
- * Checks if the set is empty.
- * @return {boolean} True if the set is empty, false otherwise.
- */
-Set.prototype.isEmpty = function () {
-	return !this.size;
-};
-
-/**
- * Clones the set into a new set.
- * @return {Set} The set cloned from this set.
- */
-Set.prototype.clone = function () {
-	var s = new Set();
-	s.parents = this.parents.clone();
-	s.elements = this.elements.clone();
-	s.sets = this.sets.clone();
-	s.size = this.size;
-	return s;
-};
\ No newline at end of file
diff --git a/lib/Set/Set.ts b/lib/Set/Set.ts
new file mode 100644
index 0000000..c12ef58
--- /dev/null
+++ b/lib/Set/Set.ts
@@ -0,0 +1,262 @@
+/**
+ * Created by Stefano on 12/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+namespace ds
+{
+	export class Element<T>
+	{
+		parents: DoubleLinkedList<Set<T>>;
+		item: T;
+		/**
+		 * Class for representing an element of a set.
+		 * @param item {*} The item to store in the element.
+		 * @constructor
+		 */
+		constructor(item: T)
+		{
+			this.parents = new DoubleLinkedList<Set<T>>();
+			this.item = item;
+		}
+	}
+
+	export class Set<T>
+	{
+		/**
+		 * The parents of the set.
+		 * @type {DoubleLinkedList}
+		 */
+		parents: DoubleLinkedList<Set<T>>;
+		/**
+		 * The elements stored.
+		 * @type {DoubleLinkedList}
+		 */
+		elements: DoubleLinkedList<Element<T>>;
+		/**
+		 * The subsets of this set.
+		 * @type {DoubleLinkedList}
+		 */
+		sets: DoubleLinkedList<Set<T>>;
+		/**
+		 * The size of the set. It's equal to his cardinality.
+		 * @type {number}
+		 */
+		size = 0;
+
+		/**
+		 * Class for managing a set.
+		 * @constructor
+		 */
+		constructor()
+		{
+			this.parents = new DoubleLinkedList();
+			this.elements = new DoubleLinkedList();
+			this.sets = new DoubleLinkedList();
+			this.size = 0;
+		}
+
+		/**
+		 * Add the element to the set.
+		 * @param element {Element} The element to add.
+		 * @return {void}
+		 */
+		insert(element: Element<T>)
+		{
+			this.elements.pushBack(element);
+			element.parents.pushBack(this);
+			this.size++;
+		};
+
+		/**
+		 * Add the elements to the set.
+		 * @param elements {Array<Element>} The elements to add.
+		 * @return {void}
+		 */
+		multiInsert(elements: Element<T>[])
+		{
+			for (var i = 0; i < elements.length; i++)
+			{
+				this.elements.pushBack(elements[i]);
+				elements[i].parents.pushBack(this);
+			}
+			this.size += elements.length;
+		};
+
+		/**
+		 * Returns the set that represents the union of two sets.
+		 * @param set {Set} The set with make the union.
+		 * @return {Set} The set that represents the union.
+		 */
+		union(set: Set<T>)
+		{
+			var parent = new Set<T>();
+			parent.addSubsets([this, set]);
+			this.parents.pushBack(parent);
+			set.parents.pushBack(parent);
+			//change the parent of the subset
+			var that = this;
+			var f = function (item: Set<T>): Set<T>
+			{
+				if (item === that)
+					return parent;
+				return <any>undefined;
+			};
+			var it = this.sets.getIterator();
+			for (it.first(); !it.isDone(); it.next())
+				it.getItem().parents.execute(f);
+			f = function (item): Set<T>
+			{
+				if (item === set)
+					return parent;
+				return <any>undefined;
+			};
+			it = set.sets.getIterator();
+			for (it.first(); !it.isDone(); it.next())
+				it.getItem().parents.execute(f);
+			return parent;
+		};
+
+		/**
+		 * Returns the set that represents the intersection of two sets.
+		 * @param set {Set} The set to intersect with this.
+		 * @return {Set} The set that represents the intersection.
+		 */
+		intersect(set: Set<T>)
+		{
+			var intersection = new Set<T>();
+			//intersect this set with the set
+			var el = this.elements.getIterator();
+			for (el.first(); !el.isDone(); el.next())
+				if (el.getItem().parents.contains(set))
+					intersection.insert(el.getItem());
+
+			//intersect the subsets with the set
+			var it = this.sets.getIterator();
+			for (it.first(); !it.isDone(); it.next())
+			{
+				el = it.getItem().getIterator();
+				for (el.first(); !el.isDone(); el.next())
+					if (el.getItem().parents.contains(set))
+						intersection.insert(el.getItem());
+			}
+			return intersection;
+		};
+
+		/**
+		 * Returns the set that represents the difference of two sets.
+		 * @param set {Set} The set to difference with this.
+		 * @return {Set} The set that represents the difference.
+		 */
+		difference(set: Set<T>)
+		{
+			var diff = new Set<T>();
+			//intersect this set with the set
+			var el = this.elements.getIterator();
+			for (el.first(); !el.isDone(); el.next())
+				if (!el.getItem().parents.contains(set))
+					diff.insert(el.getItem());
+
+			//intersect the subsets with the set
+			var it = this.sets.getIterator();
+			for (it.first(); !it.isDone(); it.next())
+			{
+				el = it.getItem().getIterator();
+				for (el.first(); !el.isDone(); el.next())
+					if (!el.getItem().parents.contains(set))
+						diff.insert(el.getItem());
+			}
+			return diff;
+		};
+
+		/**
+		 * Returns the set that represents the cartesian product of two sets.
+		 * @param set {Set} The set to make the cartesian product with this.
+		 * @return {Set} The set that represents the cartesian product .
+		 */
+		cartesianProduct(set: Set<T>)
+		{
+			var el1 = this.getItems();
+			var el2 = set.getItems();
+			var product = new Set();
+			for (var i = 0; i < el1.length; i++)
+				for (var j = 0; j < el2.length; j++)
+					product.insert(new Element([el1[i], el2[j]]));
+			return product;
+		};
+
+		/**
+		 * Add the subset.
+		 * @param set {Set} The subset.
+		 */
+		addSubset(set: Set<T>)
+		{
+			this.sets.pushBack(set);
+			this.size += set.size;
+		};
+
+		/**
+		 * Add the subsets.
+		 * @param sets {Array<Set>} The subsets.
+		 */
+		addSubsets(sets: Set<T>[])
+		{
+			for (var i = 0; i < sets.length; i++)
+				this.addSubset(sets[i]);
+		};
+
+		/**
+		 * Returns the items that are stored in the set.
+		 * @return {Array} The items stored.
+		 */
+		getItems()
+		{
+			var array = [];
+			//get the items stored in the set
+			var el = this.elements.getIterator();
+			for (el.first(); !el.isDone(); el.next())
+				array.push(el.getItem().item);
+
+			//get the items stored in the subsets
+			var it = this.sets.getIterator();
+			for (it.first(); !it.isDone(); it.next())
+			{
+				el = it.getItem().getIterator();
+				for (el.first(); !el.isDone(); el.next())
+					array.push(el.getItem().item);
+			}
+			return array;
+		};
+
+		/**
+		 * Returns the cardinality of the set.
+		 * @return {number} The cardinality of the set.
+		 */
+		getCardinality()
+		{
+			return this.size;
+		};
+
+		/**
+		 * Checks if the set is empty.
+		 * @return {boolean} True if the set is empty, false otherwise.
+		 */
+		isEmpty()
+		{
+			return !this.size;
+		};
+
+		/**
+		 * Clones the set into a new set.
+		 * @return {Set} The set cloned from this set.
+		 */
+		clone()
+		{
+			var s = new Set<T>();
+			s.parents = this.parents.clone();
+			s.elements = this.elements.clone();
+			s.sets = this.sets.clone();
+			s.size = this.size;
+			return s;
+		};
+	}
+}
\ No newline at end of file
diff --git a/lib/Stack/Stack.js b/lib/Stack/Stack.js
deleted file mode 100644
index 6798b14..0000000
--- a/lib/Stack/Stack.js
+++ /dev/null
@@ -1,251 +0,0 @@
-/**
- * Created by Battistella Stefano on 31/03/14.
- */
-
-Stack.prototype = new Aggregate();
-Stack.prototype.constructor = Stack;
-
-/**
- * Class for managing a stack.
- * @param {...*} [args] The items for initializing the stack.
- * @constructor
- */
-function Stack(args) {
-	/**
-	 * The list of the items in the stack.
-	 * @type {Array<*>}
-	 */
-	this.items = [];
-
-    if(args && args.length) {
-        //builds the stack from the range passed from the constructor
-        this.multiPush(args);
-    } else {
-        //builds the stack from the parameters of the constructor
-        this.multiPush(arguments);
-    }
-}
-
-/**
- * @inheritDoc
- */
-Stack.prototype.getIterator = function () {
-	return new StackIterator(this);
-};
-
-/**
- * Adds the item at the top of the stack.
- * @param item {*} The item to add.
- * return {void}
- */
-Stack.prototype.push = function (item) {
-	this.items.push(item);
-};
-
-/**
- * Adds the items at the top of the stack.
- * @param items {Array<*>} The items to add.
- * @return {void}
- */
-Stack.prototype.multiPush = function (items) {
-	for (var i = 0; i < items.length; i++)
-		this.push(items[i]);
-};
-
-/**
- * Removes the item at the top of the stack.
- * @return {*} The item at the top of the stack. It's undefined if the stack is empty.
- */
-Stack.prototype.pop = function () {
-	if (!this.items.length)
-		return undefined;
-	return this.items.pop();
-};
-
-/**
- * Removes the more item at the top of the stack.
- * @param times {number} The number of times to repeat the pop method.
- * @return {Array<*>} The items at the top of the stack.
- */
-Stack.prototype.multiPop = function (times) {
-	var result = [];
-	for (var i = 0; i < times && this.items.length; i++)
-		result.push(this.pop());
-	return result;
-};
-
-/**
- * Returns the item at the top of the stack without remove it.
- * @return {*} The item at the top of the stack. It's undefined if the stack is empty.
- */
-Stack.prototype.peek = function () {
-	if (!this.items.length)
-		return undefined;
-	return this.items[this.items.length - 1];
-};
-
-/**
- * Removes all the items stored in the stack.
- * @return {void}
- */
-Stack.prototype.clear = function () {
-	this.items = [];
-};
-
-/**
- * Checks if the stack contains an item that satisfy the condition represented by the callback function.
- * @param item {*} The item to find.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {boolean} True if the stack contains the item that satisfy the condition, false otherwise.
- */
-Stack.prototype.contains = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0;
-	while (i < this.items.length && !callback(this.items[i]))
-		i++;
-	return i < this.items.length;
-};
-
-/**
- * Executes the callback function for each item of the stack.
- * This method modifies the stack so if you don't need to modify it you must return the same item of the array.
- * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
- * @return {void}
- */
-Stack.prototype.execute = function (callback) {
-	for (var i = this.items.length - 1; i > -1; i--)
-		this.items[i] = callback(this.items[i]);
-};
-
-/**
- * Returns the item at the position index.
- * @param index The position of the item.
- * @return {*} The item at the position. It's undefined if index isn't in the stack bounds.
- */
-Stack.prototype.getItem = function (index) {
-	if (index < 0 || index > this.items.length - 1)
-		return undefined;
-	return this.items[this.items.length - index - 1];
-};
-
-/**
- * Returns the length of the stack.
- * @return {Number} The length of the stack.
- */
-Stack.prototype.getLength = function () {
-	return this.items.length;
-};
-
-/**
- * Checks if the stack is empty.
- * @return {boolean} True if the stack is empty, false otherwise.
- */
-Stack.prototype.isEmpty = function () {
-	return !this.items.length;
-};
-
-/**
- * Returns the items that satisfy the condition determined by the callback.
- * @param callback {function} The function that implements the condition.
- * @return {Array<*>} The array that contains the items that satisfy the condition.
- */
-Stack.prototype.filter = function (callback) {
-	var result = [];
-	for (var i = this.items.length - 1; i > -1; i--) {
-		if (callback(this.items[i]))
-			result.push(this.items[i]);
-	}
-	return result;
-};
-
-/**
- * Returns the first position of the item in the stack.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The first position of the item.
- */
-Stack.prototype.indexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = this.items.length - 1;
-	while (i > -1) {
-		if (callback(this.items[i]))
-			return i;
-		i--;
-	}
-	return -1;
-};
-
-/**
- * Returns the last position of the item in the stack.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {number} The last position of the item.
- */
-Stack.prototype.lastIndexOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = 0;
-	while (i < this.items.length) {
-		if (callback(this.items[i]))
-			return i;
-		i++;
-	}
-	return -1;
-};
-
-/**
- * Returns all the position in which the item has been found in the stack.
- * @param item {*} The item to search.
- * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
- * @return {Array<number>} The positions in which the item has been found.
- */
-Stack.prototype.allIndexesOf = function (item, callback) {
-	callback = callback || function (it) {
-		return it === item;
-	};
-	var i = this.items.length - 1;
-	var indexes = [];
-	while (i > -1) {
-		if (callback(this.items[i]))
-			indexes.push(i);
-		i--;
-	}
-	return indexes;
-};
-
-/**
- * Clones the stack into a new stack.
- * @return {Stack} The stack cloned from this stack.
- */
-Stack.prototype.clone = function () {
-	var stack = new Stack();
-	for (var i = 0; i < this.items.length; i++)
-		if (this.items[i].clone)
-			stack.push(this.items[i].clone());
-		else
-			stack.push(this.items[i]);
-	return stack;
-};
-
-/**
- * Clones the stack into a new stack without cloning duplicated items.
- * @return {Stack} The stack cloned from this stack.
- */
-Stack.prototype.cloneDistinct = function () {
-	var stack = new Stack();
-	for (var i = 0; i < this.items.length; i++)
-		if (!stack.contains(this.items[i])) {
-			if (this.items[i].cloneDistinct)
-				stack.push(this.items[i].cloneDistinct());
-			else if (this.items[i].clone)
-				stack.push(this.items[i].clone());
-			else
-				stack.push(this.items[i]);
-		}
-	return stack;
-};
\ No newline at end of file
diff --git a/lib/Stack/Stack.ts b/lib/Stack/Stack.ts
new file mode 100644
index 0000000..ab0a921
--- /dev/null
+++ b/lib/Stack/Stack.ts
@@ -0,0 +1,290 @@
+/**
+ * Created by Battistella Stefano on 31/03/14.
+ */
+namespace ds
+{
+	export class Stack<T> extends Aggregate
+	{
+		/**
+		 * The list of the items in the stack.
+		 * @type {Array<*>}
+		 */
+		items: T[] = [];
+		/**
+		 * Class for managing a stack.
+		 * @param {...*} [args] The items for initializing the stack.
+		 * @constructor
+		 */
+		constructor(...args: any[])
+		{
+			super();
+			this.items = [];
+
+			if (args && args.length == 1 && args[0] instanceof Array)
+			{
+				//builds the stack from the range passed from the constructor
+				this.multiPush(args[0]);
+			} else
+			{
+				//builds the stack from the parameters of the constructor
+				this.multiPush(args);
+			}
+		}
+
+		/**
+		 * @inheritDoc
+		 */
+		getIterator()
+		{
+			return new StackIterator<T>(this);
+		};
+
+		/**
+		 * Adds the item at the top of the stack.
+		 * @param item {*} The item to add.
+		 * return {void}
+		 */
+		push(item: T)
+		{
+			this.items.push(item);
+		};
+
+		/**
+		 * Adds the items at the top of the stack.
+		 * @param items {Array<*>} The items to add.
+		 * @return {void}
+		 */
+		multiPush(items: T[])
+		{
+			for (var i = 0; i < items.length; i++)
+				this.push(items[i]);
+		};
+
+		/**
+		 * Removes the item at the top of the stack.
+		 * @return {*} The item at the top of the stack. It's undefined if the stack is empty.
+		 */
+		pop()
+		{
+			if (!this.items.length)
+				return undefined;
+			return this.items.pop();
+		};
+
+		/**
+		 * Removes the more item at the top of the stack.
+		 * @param times {number} The number of times to repeat the pop method.
+		 * @return {Array<*>} The items at the top of the stack.
+		 */
+		multiPop(times: number)
+		{
+			var result = [];
+			for (var i = 0; i < times && this.items.length; i++)
+				result.push(this.pop());
+			return result;
+		};
+
+		/**
+		 * Returns the item at the top of the stack without remove it.
+		 * @return {*} The item at the top of the stack. It's undefined if the stack is empty.
+		 */
+		peek()
+		{
+			if (!this.items.length)
+				return undefined;
+			return this.items[this.items.length - 1];
+		};
+
+		/**
+		 * Removes all the items stored in the stack.
+		 * @return {void}
+		 */
+		clear()
+		{
+			this.items = [];
+		};
+
+		/**
+		 * Checks if the stack contains an item that satisfy the condition represented by the callback function.
+		 * @param item {*} The item to find.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {boolean} True if the stack contains the item that satisfy the condition, false otherwise.
+		 */
+		contains(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var i = 0;
+			while (i < this.items.length && !callback(this.items[i]))
+				i++;
+			return i < this.items.length;
+		};
+
+		/**
+		 * Executes the callback function for each item of the stack.
+		 * This method modifies the stack so if you don't need to modify it you must return the same item of the array.
+		 * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+		 * @return {void}
+		 */
+		execute(callback: (item: T) => T)
+		{
+			for (var i = this.items.length - 1; i > -1; i--)
+				this.items[i] = callback(this.items[i]);
+		};
+
+		/**
+		 * Returns the item at the position index.
+		 * @param index The position of the item.
+		 * @return {*} The item at the position. It's undefined if index isn't in the stack bounds.
+		 */
+		getItem(index: number)
+		{
+			if (index < 0 || index > this.items.length - 1)
+				return undefined;
+			return this.items[this.items.length - index - 1];
+		};
+
+		/**
+		 * Returns the length of the stack.
+		 * @return {Number} The length of the stack.
+		 */
+		getLength()
+		{
+			return this.items.length;
+		};
+
+		/**
+		 * Checks if the stack is empty.
+		 * @return {boolean} True if the stack is empty, false otherwise.
+		 */
+		isEmpty()
+		{
+			return !this.items.length;
+		};
+
+		/**
+		 * Returns the items that satisfy the condition determined by the callback.
+		 * @param callback {function} The function that implements the condition.
+		 * @return {Array<*>} The array that contains the items that satisfy the condition.
+		 */
+		filter(callback: (item: T) => boolean)
+		{
+			var result = [];
+			for (var i = this.items.length - 1; i > -1; i--)
+			{
+				if (callback(this.items[i]))
+					result.push(this.items[i]);
+			}
+			return result;
+		};
+
+		/**
+		 * Returns the first position of the item in the stack.
+		 * @param item {*} The item to search.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {number} The first position of the item.
+		 */
+		indexOf(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var i = this.items.length - 1;
+			while (i > -1)
+			{
+				if (callback(this.items[i]))
+					return i;
+				i--;
+			}
+			return -1;
+		};
+
+		/**
+		 * Returns the last position of the item in the stack.
+		 * @param item {*} The item to search.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {number} The last position of the item.
+		 */
+		lastIndexOf(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var i = 0;
+			while (i < this.items.length)
+			{
+				if (callback(this.items[i]))
+					return i;
+				i++;
+			}
+			return -1;
+		};
+
+		/**
+		 * Returns all the position in which the item has been found in the stack.
+		 * @param item {*} The item to search.
+		 * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+		 * @return {Array<number>} The positions in which the item has been found.
+		 */
+		allIndexesOf(item: T, callback?: (item: T) => boolean)
+		{
+			callback = callback || function (it)
+			{
+				return it === item;
+			};
+			var i = this.items.length - 1;
+			var indexes = [];
+			while (i > -1)
+			{
+				if (callback(this.items[i]))
+					indexes.push(i);
+				i--;
+			}
+			return indexes;
+		};
+
+		/**
+		 * Clones the stack into a new stack.
+		 * @return {Stack} The stack cloned from this stack.
+		 */
+		clone()
+		{
+			var stack = new Stack<T>();
+			for (var i = 0; i < this.items.length; i++)
+			{
+				var item: any = this.items[i];
+				if (item.clone)
+					stack.push(item.clone());
+				else
+					stack.push(item);
+			}
+
+			return stack;
+		};
+
+		/**
+		 * Clones the stack into a new stack without cloning duplicated items.
+		 * @return {Stack} The stack cloned from this stack.
+		 */
+		cloneDistinct()
+		{
+			var stack = new Stack<T>();
+			for (var i = 0; i < this.items.length; i++)
+				if (!stack.contains(this.items[i]))
+				{
+					var item: any = this.items[i];
+					if (item.cloneDistinct)
+						stack.push(item.cloneDistinct());
+					else if (item.clone)
+						stack.push(item.clone());
+					else
+						stack.push(item);
+				}
+			return stack;
+		};
+	}
+}
\ No newline at end of file
diff --git a/lib/Stack/StackIterator.js b/lib/Stack/StackIterator.js
deleted file mode 100644
index c59d146..0000000
--- a/lib/Stack/StackIterator.js
+++ /dev/null
@@ -1,67 +0,0 @@
-/**
- * Created by Stefano on 04/04/2014.
- */
-
-StackIterator.prototype = new Iterator();
-StackIterator.prototype.constructor = StackIterator;
-
-/**
- * Class that implements the iterator for a linked list.
- * @param aggregate {Stack} The aggregate to scan.
- * @constructor
- */
-function StackIterator(aggregate) {
-	/**
-	 * The aggregate relates to this iterator.
-	 * @type {Stack}
-	 */
-	this.aggregate = aggregate;
-
-	/**
-	 * The pointer to the position.
-	 * @type {number}
-	 */
-	this.pointer = -1;
-}
-
-/**
- * @inheritDoc
- */
-StackIterator.prototype.first = function () {
-	this.pointer = this.aggregate.items.length - 1;
-};
-
-/**
- * @inheritDoc
- */
-StackIterator.prototype.next = function () {
-	this.pointer--;
-};
-
-/**
- * @inheritDoc
- */
-StackIterator.prototype.last = function () {
-	this.pointer = 0;
-};
-
-/**
- * @inheritDoc
- */
-StackIterator.prototype.previous = function () {
-	this.pointer++;
-};
-
-/**
- * @inheritDoc
- */
-StackIterator.prototype.isDone = function () {
-	return this.pointer < 0 || this.pointer > this.aggregate.items.length - 1;
-};
-
-/**
- * @inheritDoc
- */
-StackIterator.prototype.getItem = function () {
-	return this.aggregate.items[this.pointer];
-};
\ No newline at end of file
diff --git a/lib/Stack/StackIterator.ts b/lib/Stack/StackIterator.ts
new file mode 100644
index 0000000..b6ca535
--- /dev/null
+++ b/lib/Stack/StackIterator.ts
@@ -0,0 +1,79 @@
+/**
+ * Created by Stefano on 04/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+namespace ds
+{
+	export class StackIterator<T> implements Iterator
+	{
+		/**
+		 * The aggregate relates to this iterator.
+		 * @type {Stack}
+		 */
+		aggregate: Stack<T>;
+
+		/**
+		 * The pointer to the position.
+		 * @type {number}
+		 */
+		pointer = -1;
+		/**
+		 * Class that implements the iterator for a linked list.
+		 * @param aggregate {Stack} The aggregate to scan.
+		 * @constructor
+		 */
+		constructor(aggregate: Stack<T>)
+		{
+			this.aggregate = aggregate;
+			this.pointer = -1;
+		}
+
+		/**
+		 * @inheritDoc
+		 */
+		first()
+		{
+			this.pointer = this.aggregate.items.length - 1;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		next()
+		{
+			this.pointer--;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		last()
+		{
+			this.pointer = 0;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		previous()
+		{
+			this.pointer++;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		isDone()
+		{
+			return this.pointer < 0 || this.pointer > this.aggregate.items.length - 1;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		getItem()
+		{
+			return this.aggregate.items[this.pointer];
+		};
+	}
+}
\ No newline at end of file
diff --git a/lib/Trie/Trie.js b/lib/Trie/Trie.js
deleted file mode 100644
index 730fee2..0000000
--- a/lib/Trie/Trie.js
+++ /dev/null
@@ -1,202 +0,0 @@
-/**
- * Created by Stefano on 02/02/2015.
- */
-
-/**
- * The single node of the tree.
- * @param [string = null] The string of the node.
- * @param [item = null] The item to store in the node.
- * @constructor
- */
-function TNode(string, item) {
-    /**
-     * The item stored.
-     * @type {*|null}
-     */
-    this.item = item || null;
-    /**
-     * The key of the node.
-     * @type {string|null}
-     */
-    this.string = string || null;
-    /**
-     * The parent node. It's null if there's no a parent node.
-     * @type {TNode|null}
-     */
-    this.parent = null;
-    /**
-     * The children of the node.
-     * @type {Array<TNode>}
-     */
-    this.childs = [];
-}
-
-Trie.prototype = new Aggregate();
-Trie.prototype.constructor = Trie;
-
-/**
- * Class for managing a trie
- * @constructor
- */
-function Trie() {
-    /**
-     * The root of the trie.
-     * @type {TNode}
-     */
-    this.root = new TNode('');
-
-    /**
-     * The size of the trie
-     * @type {number}
-     */
-    this.size = 0;
-}
-
-/**
- * @inheritDoc
- */
-Trie.prototype.getIterator = function () {
-    return new TrieIterator(this);
-};
-
-/**
- * Insert the string in the tree creating the relative path to it.
- * If the string already exists then the values are updated
- * @param string {string} The string to store.
- * @param [item = null] The item to store.
- * @return {void}
- */
-Trie.prototype.insert = function (string, item) {
-    var node = this.root;
-
-    var i = 0;
-    while (i < string.length && node.childs[string.charCodeAt(i)]) {
-        node = node.childs[string.charCodeAt(i)];
-        ++i;
-    }
-
-    while (i < string.length) {
-        node.childs[string.charCodeAt(i)] = new TNode();
-        node = node.childs[string.charCodeAt(i)];
-        ++i;
-    }
-
-    if (node.string != string)
-        ++this.size;
-
-    node.string = string;
-    node.item = item;
-};
-
-/**
- * Suggest the possible conclusion for the string.
- * @param string {string} The start of the string.
- * @return {Array<string>} The array of possible string conclusion to fill.
- */
-Trie.prototype.suggest = function (string) {
-    var node = this.root;
-
-    for (var i = 0; i < string.length && node; ++i) {
-        node = node.childs[string.charCodeAt(i)];
-    }
-
-    var results = [];
-    if (node) {
-        this.stringsToArray(results, node);
-    }
-    return results;
-};
-
-/**
- * Return all the string saved under the node in the array.
- * @param result {Array<string>} The array to fill.
- * @param [node {TNode|null} = null] The node from which start searching the strings.
- * @return {void}
- */
-Trie.prototype.stringsToArray = function (result, node) {
-    node = node || this.root;
-
-
-    if (node.string) {
-        result.push(node.string);
-    }
-
-    for (var key in node.childs) {
-        if (key !== 'length' && node.childs.hasOwnProperty(key)) {
-            this.stringsToArray(result, node.childs[key]);
-        }
-    }
-};
-
-/**
- * Update the item related to the string searched.
- * @param string {string} The string for finding the item.
- * @param callback {function} The function to execute to update the item. It should accept the item the iteration is working on.
- * @return {void}
- */
-Trie.prototype.updateItem = function (string, callback) {
-    var node = this.root;
-
-    var i = 0;
-    while (i < string.length && node.childs[string.charCodeAt(i)]) {
-        node = node.childs[string.charCodeAt(i)];
-        ++i;
-    }
-
-    // Update the value only if the node reached correspond to the string
-    if (node && node.string == string) {
-        node.item = callback(node.item);
-    }
-};
-
-/**
- * Return the item related to the string searched.
- * @param string {string} The string for finding the item.
- * @returns {*} The item found. Undefined if the string is not in the trie
- */
-Trie.prototype.getItem = function (string) {
-    var node = this.root;
-
-    var i = 0;
-    while (i < string.length && node.childs[string.charCodeAt(i)]) {
-        node = node.childs[string.charCodeAt(i)];
-        ++i;
-    }
-
-    // Return the value only if the node reached correspond to the string
-    if (node && node.string == string) {
-        return node.item;
-    }
-
-    return undefined;
-};
-
-/**
- * Return the size of the trie.
- * @returns {number} The size of the tree.
- */
-Trie.prototype.getSize = function() {
-    return this.size;
-};
-
-/**
- * Get the minimum string stored in the tree.
- * @param [node = root] {Node} The node from which start the search.
- * @return {string} The string found.
- */
-Trie.prototype.minimum = function (node) {
-    node = node || this.root;
-    return node.string;
-};
-
-/**
- * Get the maximum string stored in the tree.
- * @param [node = root] {Node} The node from which start the search.
- * @return {string} The string found.
- */
-Trie.prototype.maximum = function (node) {
-    node = node || this.root;
-    while (node && node.childs[node.childs.length - 1])
-        node = node.childs[node.childs.length - 1];
-    return node.string;
-};
\ No newline at end of file
diff --git a/lib/Trie/Trie.ts b/lib/Trie/Trie.ts
new file mode 100644
index 0000000..08b61dd
--- /dev/null
+++ b/lib/Trie/Trie.ts
@@ -0,0 +1,239 @@
+/**
+ * Created by Stefano on 02/02/2015.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+namespace ds
+{
+    export class TNode<T>
+    {
+        /**
+         * The item stored.
+         * @type {*|null}
+         */
+        item: T = <any>null;
+        /**
+         * The key of the node.
+         * @type {string|null}
+         */
+        string: string = <any>null;
+        /**
+         * The parent node. It's null if there's no a parent node.
+         * @type {TNode|null}
+         */
+        parent: TNode<any> = <any>null;
+        /**
+         * The children of the node.
+         * @type {Array<TNode>}
+         */
+        childs: TNode<T>[] = [];
+
+        /**
+         * The single node of the tree.
+         * @param [string = null] The string of the node.
+         * @param [item = null] The item to store in the node.
+         * @constructor
+         */
+        constructor(string?: string, item?: T)
+        {
+            this.item = item || <any>null;
+            this.string = string || <any>null;
+            this.parent = <any>null;
+            this.childs = [];
+        }
+
+    }
+
+    export class Trie<T> extends Aggregate
+    {
+        /**
+         * The root of the trie.
+         * @type {TNode}
+         */
+        root: TNode<T>;
+
+        /**
+         * The size of the trie
+         * @type {number}
+         */
+        size = 0;
+
+        /**
+         * Class for managing a trie
+         * @constructor
+         */
+        constructor()
+        {
+            super();
+            this.root = new TNode<T>('');
+            this.size = 0;
+        }
+
+        /**
+         * @inheritDoc
+         */
+        getIterator()
+        {
+            return new TrieIterator<T>(this);
+        };
+
+        /**
+         * Insert the string in the tree creating the relative path to it.
+         * If the string already exists then the values are updated
+         * @param string {string} The string to store.
+         * @param [item = null] The item to store.
+         * @return {void}
+         */
+        insert(string: string, item?: T)
+        {
+            var node = this.root;
+
+            var i = 0;
+            while (i < string.length && node.childs[string.charCodeAt(i)])
+            {
+                node = node.childs[string.charCodeAt(i)];
+                ++i;
+            }
+
+            while (i < string.length)
+            {
+                node.childs[string.charCodeAt(i)] = new TNode();
+                node = node.childs[string.charCodeAt(i)];
+                ++i;
+            }
+
+            if (node.string != string)
+                ++this.size;
+
+            node.string = string;
+            node.item = <any>item;
+        };
+
+        /**
+         * Suggest the possible conclusion for the string.
+         * @param string {string} The start of the string.
+         * @return {Array<string>} The array of possible string conclusion to fill.
+         */
+        suggest(string: string)
+        {
+            var node = this.root;
+
+            for (var i = 0; i < string.length && node; ++i)
+            {
+                node = node.childs[string.charCodeAt(i)];
+            }
+
+            var results: string[] = [];
+            if (node)
+            {
+                this.stringsToArray(results, node);
+            }
+            return results;
+        };
+
+        /**
+         * Return all the string saved under the node in the array.
+         * @param result {Array<string>} The array to fill.
+         * @param [node {TNode|null} = null] The node from which start searching the strings.
+         * @return {void}
+         */
+        stringsToArray(result: string[], node?: TNode<T>)
+        {
+            node = node || this.root;
+
+            if (node.string)
+            {
+                result.push(node.string);
+            }
+
+            for (var key in node.childs)
+            {
+                if (key !== 'length' && node.childs.hasOwnProperty(key))
+                {
+                    this.stringsToArray(result, node.childs[key]);
+                }
+            }
+        };
+
+        /**
+         * Update the item related to the string searched.
+         * @param string {string} The string for finding the item.
+         * @param callback {function} The function to execute to update the item. It should accept the item the iteration is working on.
+         * @return {void}
+         */
+        updateItem(string: string, callback: (item: T) => T)
+        {
+            var node = this.root;
+
+            var i = 0;
+            while (i < string.length && node.childs[string.charCodeAt(i)])
+            {
+                node = node.childs[string.charCodeAt(i)];
+                ++i;
+            }
+
+            // Update the value only if the node reached correspond to the string
+            if (node && node.string == string)
+            {
+                node.item = callback(node.item);
+            }
+        };
+
+        /**
+         * Return the item related to the string searched.
+         * @param string {string} The string for finding the item.
+         * @returns {*} The item found. Undefined if the string is not in the trie
+         */
+        getItem(string: string)
+        {
+            var node = this.root;
+
+            var i = 0;
+            while (i < string.length && node.childs[string.charCodeAt(i)])
+            {
+                node = node.childs[string.charCodeAt(i)];
+                ++i;
+            }
+
+            // Return the value only if the node reached correspond to the string
+            if (node && node.string == string)
+            {
+                return node.item;
+            }
+
+            return undefined;
+        };
+
+        /**
+         * Return the size of the trie.
+         * @returns {number} The size of the tree.
+         */
+        getSize()
+        {
+            return this.size;
+        };
+
+        /**
+         * Get the minimum string stored in the tree.
+         * @param [node = root] {Node} The node from which start the search.
+         * @return {string} The string found.
+         */
+        minimum(node?: TNode<T>)
+        {
+            node = node || this.root;
+            return node.string;
+        };
+
+        /**
+         * Get the maximum string stored in the tree.
+         * @param [node = root] {Node} The node from which start the search.
+         * @return {string} The string found.
+         */
+        maximum(node?: TNode<T>)
+        {
+            node = node || this.root;
+            while (node && node.childs[node.childs.length - 1])
+                node = node.childs[node.childs.length - 1];
+            return node.string;
+        };
+    }
+}
\ No newline at end of file
diff --git a/lib/Trie/TrieIterator.js b/lib/Trie/TrieIterator.js
deleted file mode 100644
index bb30449..0000000
--- a/lib/Trie/TrieIterator.js
+++ /dev/null
@@ -1,67 +0,0 @@
-/**
- * Created by Stefano on 06/04/2014.
- */
-
-TrieIterator.prototype = new Iterator();
-TrieIterator.prototype.constructor = TrieIterator;
-
-/**
- * Class that implements the iterator for a trie.
- * @param aggregate {Trie} The aggregate to scan.
- * @constructor
- */
-function TrieIterator(aggregate) {
-	/**
-	 * The aggregate relates to this iterator.
-	 * @type {Trie}
-	 */
-	this.aggregate = aggregate;
-
-	/**
-	 * The pointer to the position.
-	 * @type {TNode|null}
-	 */
-	this.pointer = null;
-}
-
-/**
- * @inheritDoc
- */
-TrieIterator.prototype.first = function () {
-	this.pointer = this.aggregate.minimum();
-};
-
-/**
- * @inheritDoc
- */
-TrieIterator.prototype.next = function () {
-	this.pointer = this.aggregate.successor(this.pointer);
-};
-
-/**
- * @inheritDoc
- */
-TrieIterator.prototype.last = function () {
-	this.pointer = this.aggregate.maximum();
-};
-
-/**
- * @inheritDoc
- */
-TrieIterator.prototype.previous = function () {
-	this.pointer = this.aggregate.predecessor(this.pointer);
-};
-
-/**
- * @inheritDoc
- */
-TrieIterator.prototype.isDone = function () {
-	return !this.pointer;
-};
-
-/**
- * @inheritDoc
- */
-TrieIterator.prototype.getItem = function () {
-	return this.pointer.item;
-};
\ No newline at end of file
diff --git a/lib/Trie/TrieIterator.ts b/lib/Trie/TrieIterator.ts
new file mode 100644
index 0000000..a89db44
--- /dev/null
+++ b/lib/Trie/TrieIterator.ts
@@ -0,0 +1,80 @@
+/**
+ * Created by Stefano on 06/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+namespace ds
+{
+	export class TrieIterator<T> implements Iterator
+	{
+		/**
+		 * The aggregate relates to this iterator.
+		 * @type {Trie}
+		 */
+		aggregate: Trie<T>;
+
+		/**
+		 * The pointer to the position.
+		 * @type {TNode|null}
+		 */
+		pointer: string = <any>null;
+
+		/**
+		 * Class that implements the iterator for a trie.
+		 * @param aggregate {Trie} The aggregate to scan.
+		 * @constructor
+		 */
+		constructor(aggregate: Trie<T>)
+		{
+			this.aggregate = aggregate;
+			this.pointer = <any>null;
+		}
+
+		/**
+		 * @inheritDoc
+		 */
+		first()
+		{
+			this.pointer = this.aggregate.minimum();
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		next()
+		{
+			this.pointer = this.aggregate.successor(this.pointer);
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		last()
+		{
+			this.pointer = this.aggregate.maximum();
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		previous()
+		{
+			this.pointer = this.aggregate.predecessor(this.pointer);
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		isDone()
+		{
+			return !this.pointer;
+		};
+
+		/**
+		 * @inheritDoc
+		 */
+		getItem()
+		{
+			return this.pointer.item;
+		};
+	}
+}
\ No newline at end of file
diff --git a/lib/tsconfig.json b/lib/tsconfig.json
new file mode 100644
index 0000000..6272b4a
--- /dev/null
+++ b/lib/tsconfig.json
@@ -0,0 +1,79 @@
+{
+  "compilerOptions": {
+    /* Basic Options */
+    "target": "es5", /* Specify ECMAScript target version: 'ES3' (default), 'ES5', 'ES2015', 'ES2016', 'ES2017', or 'ESNEXT'. */
+    // "module": "commonjs", /* Specify module code generation: 'none', 'commonjs', 'amd', 'system', 'umd', 'es2015', or 'ESNext'. */
+    // "lib": [],                             /* Specify library files to be included in the compilation:  */
+    // "allowJs": true,                       /* Allow javascript files to be compiled. */
+    // "checkJs": true,                       /* Report errors in .js files. */
+    // "jsx": "preserve",                     /* Specify JSX code generation: 'preserve', 'react-native', or 'react'. */
+    "declaration": true, /* Generates corresponding '.d.ts' file. */
+    "sourceMap": true, /* Generates corresponding '.map' file. */
+    "outFile": "../out/ds.js", /* Concatenate and emit output to single file. */
+    // "outDir": "./",                        /* Redirect output structure to the directory. */
+    // "rootDir": "./",                       /* Specify the root directory of input files. Use to control the output directory structure with --outDir. */
+    // "removeComments": true,                /* Do not emit comments to output. */
+    // "noEmit": true,                        /* Do not emit outputs. */
+    // "importHelpers": true,                 /* Import emit helpers from 'tslib'. */
+    // "downlevelIteration": true,            /* Provide full support for iterables in 'for-of', spread, and destructuring when targeting 'ES5' or 'ES3'. */
+    // "isolatedModules": true,               /* Transpile each file as a separate module (similar to 'ts.transpileModule'). */
+    /* Strict Type-Checking Options */
+    "strict": true /* Enable all strict type-checking options. */
+    // "noImplicitAny": true,                 /* Raise error on expressions and declarations with an implied 'any' type. */
+    // "strictNullChecks": true,              /* Enable strict null checks. */
+    // "strictFunctionTypes": true,           /* Enable strict checking of function types. */
+    // "noImplicitThis": true,                /* Raise error on 'this' expressions with an implied 'any' type. */
+    // "alwaysStrict": true,                  /* Parse in strict mode and emit "use strict" for each source file. */
+    /* Additional Checks */
+    // "noUnusedLocals": true,                /* Report errors on unused locals. */
+    // "noUnusedParameters": true,            /* Report errors on unused parameters. */
+    // "noImplicitReturns": true,             /* Report error when not all code paths in function return a value. */
+    // "noFallthroughCasesInSwitch": true,    /* Report errors for fallthrough cases in switch statement. */
+    /* Module Resolution Options */
+    // "moduleResolution": "node",            /* Specify module resolution strategy: 'node' (Node.js) or 'classic' (TypeScript pre-1.6). */
+    // "baseUrl": "./",                       /* Base directory to resolve non-absolute module names. */
+    // "paths": {},                           /* A series of entries which re-map imports to lookup locations relative to the 'baseUrl'. */
+    // "rootDirs": [],                        /* List of root folders whose combined content represents the structure of the project at runtime. */
+    // "typeRoots": [],                       /* List of folders to include type definitions from. */
+    // "types": [],                           /* Type declaration files to be included in compilation. */
+    // "allowSyntheticDefaultImports": true,  /* Allow default imports from modules with no default export. This does not affect code emit, just typechecking. */
+    // "preserveSymlinks": true,              /* Do not resolve the real path of symlinks. */
+    /* Source Map Options */
+    // "sourceRoot": "./",                    /* Specify the location where debugger should locate TypeScript files instead of source locations. */
+    // "mapRoot": "./",                       /* Specify the location where debugger should locate map files instead of generated locations. */
+    // "inlineSourceMap": true,               /* Emit a single file with source maps instead of having a separate file. */
+    // "inlineSources": true,                 /* Emit the source alongside the sourcemaps within a single file; requires '--inlineSourceMap' or '--sourceMap' to be set. */
+    /* Experimental Options */
+    // "experimentalDecorators": true,        /* Enables experimental support for ES7 decorators. */
+    // "emitDecoratorMetadata": true,         /* Enables experimental support for emitting type metadata for decorators. */
+  },
+  "files": [
+    "Aggregate/Aggregate.ts",
+    "Aggregate/Iterator.ts",
+    "BTree/BTree.ts",
+    "BTree/BTreeIterator.ts",
+    "BSTree/BSTree.ts",
+    "BSTree/BSTreeIterator.ts",
+    "CircularBuffer/CircularBuffer.ts",
+    "CircularBuffer/CircularBufferIterator.ts",
+    "DoubleLinkedList/DoubleLinkedList.ts",
+    "DoubleLinkedList/DoubleLinkedListIterator.ts",
+    "HashTable/HashTable.ts",
+    "LinkedList/LinkedList.ts",
+    "LinkedList/LinkedListIterator.ts",
+    "PriorityQueue/PriorityQueue.ts",
+    "PriorityQueue/PriorityQueueIterator.ts",
+    "Queue/Queue.ts",
+    "Queue/QueueIterator.ts",
+    "Range/Range.ts",
+    "RBTree/RBTree.ts",
+    "RBTree/RBTreeIterator.ts",
+    "RBTreeList/RBTreeList.ts",
+    "RBTreeList/RBTreeListIterator.ts",
+    "Set/Set.ts",
+    "Stack/Stack.ts",
+    "Stack/StackIterator.ts",
+    "Trie/Trie.ts",
+    "Trie/TrieIterator.ts"
+  ]
+}
\ No newline at end of file
diff --git a/out/ds.d.ts b/out/ds.d.ts
new file mode 100644
index 0000000..55c4d8c
--- /dev/null
+++ b/out/ds.d.ts
@@ -0,0 +1,2787 @@
+/**
+ * Created by Stefano on 04/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+declare namespace ds {
+    /**
+     * 集合
+     */
+    abstract class Aggregate {
+        /**
+         * Returns the iterator relative to the aggregate.
+         * @abstract
+         * @return {Iterator} The iterator.
+         */
+        abstract getIterator(): Iterator;
+    }
+}
+/**
+ * Created by Stefano on 04/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+declare namespace ds {
+    /**
+     * Interface for managing an iterator for an aggregate.
+     * @constructor
+     * @interface
+     */
+    interface Iterator {
+        /**
+         * Moves the iterator to the first position of the aggregate.
+         * @abstract
+         * @return {void}
+         */
+        first(): void;
+        /**
+         * Moves the iterator to the next item.
+         * @abstract
+         * @return {void}
+         */
+        next(): void;
+        /**
+         * Moves the iterator to the last position of the aggregate.
+         * @abstract
+         * @return {void}
+         */
+        last(): void;
+        /**
+         * Moves the iterator to the previous item.
+         * @abstract
+         * @return {void}
+         */
+        previous(): void;
+        /**
+         * Checks if the iterator is out of the bounds of the aggregate.
+         * @abstract
+         * @return {boolean} It return true if the iterator is out of the bounds of the aggregate, otherwise false.
+         */
+        isDone(): boolean;
+        /**
+         * Returns the item stored at the position pointed by the iterator.
+         * @abstract
+         * @return {*} The item stored or undefined if it's out of the bounds.
+         */
+        getItem(): any;
+    }
+}
+/**
+ * Created by Stefano on 08/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+declare namespace ds {
+    class BNode<T> {
+        /**
+         * The keys stored it the node.
+         * @type {Array<*>}
+         */
+        keys: number[];
+        /**
+         * The items stored in the node.
+         * @type {Array<*>}
+         */
+        items: T[];
+        /**
+         * The nodes child of the node.
+         * @type {Array<BNode>}
+         */
+        childs: BNode<T>[];
+        /**
+         * The single node of the tree.
+         * @constructor
+         */
+        constructor();
+    }
+    class BTree<T> extends Aggregate {
+        /**
+         * The root of the tree.
+         * @type {BNode}
+         */
+        root: BNode<T>;
+        /**
+         * The minimum number of the keys of a node.
+         * @type {number}
+         */
+        t: number;
+        /**
+         * The number of items stored in the tree.
+         * @type {number}
+         */
+        size: number;
+        /**
+         * Class for managing a B-Tree.
+         * @param minimumDegree {number} The minimum number of keys of a node.
+         * @constructor
+         */
+        constructor(minimumDegree?: number);
+        /**
+         * @inheritDoc
+         */
+        getIterator(): BTreeIterator<T>;
+        /**
+         * Insert the item relatives to the key value in the tree.
+         * @param key {number} The key to store.
+         * @param item {*} The item to store.
+         * @return {void}
+         */
+        insert(key: number, item: T): void;
+        /**
+         * Insert the new node in the right position if the node is not full.
+         * @param node {BNode} The node from which start to check the insertion.
+         * @param key {number} The key to store.
+         * @param item {*} The item to store.
+         * @return {void}
+         */
+        insertNonFull(node: BNode<T>, key: number, item: T): void;
+        /**
+         * Search the item relatives to the key that satisfy the condition represented by the callback function.
+         * @param key {Number} The key to find.
+         * @param [node = root] {RBNode} The node from which start the search.
+         * @param [callback = function(node,index){return(node.keys[index]===key);}] The condition to satisfy. The callback must accept the current node to check and optionally the position of the key.
+         * @return {*} The item found or undefined if there isn't the key in the tree.
+         */
+        search(key: number, node?: BNode<T>, callback?: (node: BNode<T>, index: number) => boolean): T;
+        /**
+         * Split the child of the node at the position index.
+         * @param node {BNode} The parent of the child to split.
+         * @param index {number} The position of the child to split.
+         * @return {void}
+         */
+        splitChild(node: BNode<T>, index: number): void;
+        /**
+         * Delete the key from the tree.
+         * @param key {*} The key to delete.
+         * @return {void}
+         */
+        deleteKey(key: number): void;
+        /**
+         * Deletes a node that's a number of keys greater than the minimum for a node.
+         * @param node {BNode} The node to delete.
+         * @param key {number} The key to delete.
+         * @return {void}
+         */
+        deleteNonMin(node: BNode<T>, key: number): void;
+        /**
+         * Deletes a node that have the maximum number of keys for node.
+         * @param node {BNode} The node to delete.
+         * @param index {number} The key to delete in the node.
+         * @return {void}
+         */
+        deleteMax(node: BNode<T>, index: number): void;
+        /**
+         * Augments the number of keys stored in the node preserving the order.
+         * @param node {BNode} The node to delete.
+         * @param index {number} The index of the position to augment.
+         * @return {void}
+         */
+        augmentChild(node: BNode<T>, index: number): void;
+        /**
+         * Checks if the tree contains the key.
+         * @param key {number} The key to find.
+         * @param [callback = function(node,index){return(node.keys[index]===key);}] The condition to satisfy. The callback must accept the current node to check and optionally the position of the key.
+         * @return {boolean} True if the tree contains the key.
+         */
+        contains(key: number, callback?: (node: BNode<T>, index: number) => boolean): boolean;
+        /**
+         * Checks if the tree contains a node that satisfy the condition represented by the callback function.
+         * This method check all the tree avoiding the binary search.
+         * @param callback {function} The condition to satisfy. The callback must accept the current node to check.
+         * @return {boolean} True if the tree contains the node that satisfy the condition, false otherwise.
+         */
+        fullContains(callback: (item: T) => boolean): boolean;
+        /**
+         * Get the key next to the param node key.
+         * @param key {number} The key of which search the successor.
+         * @param [node = root] The node from start the search of the successor.
+         * @return {number} The key found.
+         */
+        successor(key: number, node?: BNode<T>): number;
+        /**
+         * Get the key previous to the param key.
+         * @param key {number} The key of which search the predecessor.
+         * @param [node = root] The node from start the search of the predecessor.
+         * @return {number} The key found.
+         */
+        predecessor(key: number, node?: BNode<T>): number;
+        /**
+         * Gets the minimum key stored in the tree.
+         * @return {number} The key found.
+         */
+        minimumKey(): number;
+        /**
+         * Gets the maximum key stored in the tree.
+         * @return {number} The key found.
+         */
+        maximumKey(): number;
+        /**
+         * Gets the item relatives to the minimum key stored in the tree.
+         * @return {number} The item found.
+         */
+        minimum(): T;
+        /**
+         * Gets the item relatives to the maximum key stored in the tree.
+         * @return {node} The item found.
+         */
+        maximum(): T;
+        /**
+         * Returns the size of the tree.
+         * @return {number} The size of the tree.
+         */
+        getSize(): number;
+        /**
+         * Checks if the tree is empty.
+         * @return {boolean} True if the tree is empty, false otherwise.
+         */
+        isEmpty(): boolean;
+        /**
+         * Executes the callback function for each item of the tree.
+         * This method modifies the tree so if you don't need to modify it you must return the same item of the array.
+         * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+         * @return {void}
+         */
+        execute(callback: (item: T) => T, node?: BNode<T>): void;
+        /**
+         * Removes all the items stored in the tree.
+         * @return {void}
+         */
+        clear(): void;
+        /**
+         * Returns the items that satisfy the condition determined by the callback.
+         * @param callback {function} The function that implements the condition.
+         * @return {Array<*>} The array that contains the items that satisfy the condition.
+         */
+        filter(callback: (item: T) => boolean, node?: BNode<T>): T[];
+        /**
+         * Clones the tree into a new tree.
+         * @return {BTree} The tree cloned from this tree.
+         */
+        clone(): BTree<{}>;
+        /**
+         * Clones the tree into a new tree without cloning duplicated items.
+         * @return {BTree} The tree cloned from this tree.
+         */
+        cloneDistinct(): BTree<T>;
+        /**
+         * Transform the tree into an array without preserving keys.
+         * @return {Array<*>} The array that represents the tree.
+         */
+        toArray(): T[];
+        /**
+         * Returns the first position of the item in the tree.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The first position of the item.
+         */
+        indexOf(item: T, callback?: (item: T) => boolean): number;
+        /**
+         * Returns the last position of the item in the tree.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The last position of the item.
+         */
+        lastIndexOf(item: T, callback?: (item: T) => boolean): number;
+        /**
+         * Returns all the position in which the item has been found in the tree.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {Array<number>} The positions in which the item has been found.
+         */
+        allIndexesOf(item: T, callback?: (item: T) => boolean): number[];
+        /**
+         * Returns the item at the position index.
+         * @param index {number} The position of the item.
+         * @return {*} The item at the position. It's undefined if index isn't in the tree bounds.
+         */
+        getItem(index: number): T | undefined;
+    }
+}
+/**
+ * Created by Stefano on 06/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+declare namespace ds {
+    class BTreeIterator<T> implements Iterator {
+        /**
+         * The aggregate relates to this iterator.
+         * @type {BTree}
+         */
+        aggregate: BTree<T>;
+        /**
+         * The pointer to the position.
+         * @type {number}
+         */
+        pointer: number;
+        /**
+         * Class that implements the iterator for a binary search tree.
+         * @param aggregate {BTree} The aggregate to scan.
+         * @constructor
+         */
+        constructor(aggregate: BTree<T>);
+        /**
+         * @inheritDoc
+         */
+        first(): void;
+        /**
+         * @inheritDoc
+         */
+        next(): void;
+        /**
+         * @inheritDoc
+         */
+        last(): void;
+        /**
+         * @inheritDoc
+         */
+        previous(): void;
+        /**
+         * @inheritDoc
+         */
+        isDone(): boolean;
+        /**
+         * @inheritDoc
+         */
+        getItem(): T;
+        /**
+         * Return the key stored at the position pointed by the iterator.
+         * @abstract
+         * @return {number} The key stored or null if it's out of the bounds.
+         */
+        getKey(): number;
+    }
+}
+/**
+ * Created by Stefano on 05/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+declare namespace ds {
+    class BSNode<T> {
+        /**
+         * The item stored.
+         * @type {*}
+         */
+        item: T;
+        /**
+         * The key of the node.
+         * @type {number}
+         */
+        key: number;
+        /**
+         * The parent node. It's null if there's no a parent node.
+         * @type {BSNode|null}
+         */
+        parent: BSNode<T>;
+        /**
+         * The left node. It's null if there's no a left node.
+         * @type {BSNode|null}
+         */
+        left: BSNode<T>;
+        /**
+         * The right node. It's null if there's no a right node.
+         * @type {BSNode|null}
+         */
+        right: BSNode<T>;
+        /**
+         * The single node of the tree.
+         * @param key {number} The key of the node.
+         * @param item {*} The item to store in the node.
+         * @constructor
+         */
+        constructor(key: number, item: T);
+    }
+    class BSTree<T> extends Aggregate {
+        /**
+         * The root of the tree.
+         * @type {BSNode|null}
+         */
+        root: BSNode<T>;
+        constructor();
+        /**
+         * @inheritDoc
+         */
+        getIterator(): BSTreeIterator<T>;
+        /**
+         * Insert the item relatives to the key value in the tree.
+         * @param key {number} The key to store.
+         * @param item {*} The item to store.
+         * @return {void}
+         */
+        insert(key: number, item: T): void;
+        /**
+         * Search the item relatives to the key.
+         * @param key {Number} The key to find.
+         * @param [node = root] {BSNode} The node from which start the search.
+         * @return {*} The item found or undefined if there isn't the key in the tree.
+         */
+        search(key: number, node?: BSNode<T> | null): T | undefined;
+        /**
+         * Get the item relatives to the minimum key stored in the tree.
+         * @param [node = root] {Node} The node from which start the search.
+         * @return {BSNode} The node found.
+         */
+        minimum(node?: BSNode<T> | null): BSNode<T>;
+        /**
+         * Get the item relatives to the maximum key stored in the tree.
+         * @param [node = root] {Node} The node from which start the search.
+         * @return {BSNode} The node found.
+         */
+        maximum(node?: BSNode<T> | null): BSNode<T>;
+        /**
+         * Get the node with the key next to the param node key.
+         * @param node {BSNode} The node of which search the successor.
+         * @return {BSNode} The node found.
+         */
+        successor(node: BSNode<T>): BSNode<T>;
+        /**
+         * Get the node with the key previous to the param node key.
+         * @param node {BSNode} The node of which search the predecessor.
+         * @return {BSNode} The node found.
+         */
+        predecessor(node: BSNode<T>): BSNode<T>;
+        /**
+         * Delete the node from the tree.
+         * @param node {BSNode} The node to delete.
+         * @return {void}
+         */
+        deleteNode(node: BSNode<T>): void;
+    }
+}
+/**
+ * Created by Stefano on 06/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+declare namespace ds {
+    class BSTreeIterator<T> implements Iterator {
+        /**
+         * The aggregate relates to this iterator.
+         * @type {BSTree}
+         */
+        aggregate: BSTree<T>;
+        /**
+         * The pointer to the position.
+         * @type {BSNode|null}
+         */
+        pointer: BSNode<T>;
+        /**
+         * Class that implements the iterator for a binary search tree.
+         * @param aggregate {BSTree} The aggregate to scan.
+         * @constructor
+         */
+        constructor(aggregate: BSTree<T>);
+        /**
+         * @inheritDoc
+         */
+        first(): void;
+        /**
+         * @inheritDoc
+         */
+        next(): void;
+        /**
+         * @inheritDoc
+         */
+        last(): void;
+        /**
+         * @inheritDoc
+         */
+        previous(): void;
+        /**
+         * @inheritDoc
+         */
+        isDone(): boolean;
+        /**
+         * @inheritDoc
+         */
+        getItem(): T;
+        /**
+         * Return the node stored at the position pointed by the iterator.
+         * @abstract
+         * @return {BSNode|null} The node stored or null if it's out of the bounds.
+         */
+        getNode(): BSNode<T>;
+    }
+}
+/**
+ * Created by Stefano on 31/03/14.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+declare namespace ds {
+    class CircularBuffer<T> extends Aggregate {
+        /**
+         * The index of the position of the head of the buffer.
+         * @type {number}
+         */
+        head: number;
+        /**
+         * The index of the position of the tail of the buffer.
+         * @type {number}
+         */
+        tail: number;
+        /**
+         * The items stored in the buffer.
+         * @type {Array<*>}
+         */
+        items: T[];
+        /**
+         * Is true if buffer is empty, false otherwise.
+         * @type {boolean}
+         */
+        empty: boolean;
+        /**
+         * Is false if buffer is full, false otherwise.
+         * @type {boolean}
+         */
+        full: boolean;
+        /**
+         * The size of the buffer.
+         * @type {Number}
+         */
+        size: number;
+        /**
+         * Class for managing a circular buffer.
+         * @param size {Number} The size of the buffer.
+         * @constructor
+         */
+        constructor(size: number);
+        /**
+         * @inheritDoc
+         */
+        getIterator(): CircularBufferIterator<T>;
+        /**
+         * Write the item at the head of the buffer.
+         * @param item {*} The item to write.
+         * @return {void}
+         */
+        write(item: T): void;
+        /**
+         * Free the buffer between indexes from and to.
+         * If from > to, positions between from and the end of the buffer and between the start and to will be free.
+         * @param from {Number} The index from which start to free (inclusive index)
+         * @param to {Number} The index where stop to free (exclusive index)
+         * @return {void}
+         */
+        free(from: number, to: number): void;
+        /**
+         * Free all the buffer.
+         * @return {void}
+         */
+        freeAll(): void;
+        /**
+         * Read the item stored at the position index.
+         * @param index {Number} The position of the item to read.
+         * @return {*} The item read.
+         */
+        read(index: number): T;
+        /**
+         * Return true if the buffer is empty, false otherwise.
+         * @return {boolean}
+         */
+        isEmpty(): boolean;
+        /**
+         * Return true if the buffer is full, false otherwise.
+         * @return {boolean}
+         */
+        isFull(): boolean;
+        /**
+         * Clones the circular buffer into a new circular buffer.
+         * @return {CircularBuffer} The circular buffer cloned from this circular buffer.
+         */
+        clone(): CircularBuffer<T>;
+        /**
+         * Resize the buffer.
+         * @param size {number} The new size of the buffer.
+         * @return {void}
+         */
+        resize(size: number): void;
+    }
+}
+/**
+ * Created by Stefano on 06/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+declare namespace ds {
+    class CircularBufferIterator<T> implements Iterator {
+        /**
+         * The aggregate relates to this iterator.
+         * @type {CircularBuffer}
+         */
+        aggregate: CircularBuffer<T>;
+        /**
+         * The pointer to the position.
+         * @type {number}
+         */
+        pointer: number;
+        /**
+         * Discriminator for full buffer
+         * @type {bool}
+         */
+        start: boolean;
+        /**
+         * Class that implements the iterator for a circular buffer.
+         * @param aggregate {CircularBuffer} The aggregate to scan.
+         * @constructor
+         */
+        constructor(aggregate: CircularBuffer<T>);
+        /**
+         * @inheritDoc
+         */
+        first(): void;
+        /**
+         * @inheritDoc
+         */
+        next(): void;
+        /**
+         * @inheritDoc
+         */
+        last(): void;
+        /**
+         * @inheritDoc
+         */
+        previous(): void;
+        /**
+         * @inheritDoc
+         */
+        isDone(): boolean;
+        /**
+         * @inheritDoc
+         */
+        getItem(): T;
+    }
+}
+/**
+ * Created by Stefano on 31/03/14.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+declare namespace ds {
+    class DLLNode<T> {
+        /**
+         * The item stored.
+         * @type {*}
+         */
+        item: T;
+        /**
+         * The next node. It's null if there's no a next node.
+         * @type {DLLNode|null}
+         */
+        next: DLLNode<T>;
+        /**
+         * The previous node. It's null if there's no a previous node.
+         * @type {DLLNode|null}
+         */
+        previous: DLLNode<T>;
+        /**
+         * The single node of the list.
+         * @param item {*} The item to store in the node.
+         * @constructor
+         */
+        constructor(item: T);
+    }
+    class DoubleLinkedList<T> extends Aggregate {
+        /**
+         * The first node of the list.
+         * @type {DLLNode|null}
+         */
+        first: DLLNode<T>;
+        /**
+         * The last node of the list.
+         * @type {DLLNode|null}
+         */
+        last: DLLNode<T>;
+        /**
+         * The length of the list.
+         * @type {number}
+         */
+        length: number;
+        /**
+         * Class for managing a double linked list.
+         * @param {...*} [args] The items for initializing the list.
+         * @constructor
+         */
+        constructor(...args: any[]);
+        /**
+         * @inheritDoc
+         */
+        getIterator(): DoubleLinkedListIterator<T>;
+        /**
+         * Add an item at the head of the list.
+         * @param item {*} The item to add.
+         * @return {void}
+         */
+        pushFront(item: any): void;
+        /**
+         * Add an item at the tail of the list.
+         * @param item {*} The item to add.
+         * @return {void}
+         */
+        pushBack(item: T): void;
+        /**
+         * Remove the first item of the list.
+         * @return {*} The item removed. It's undefined if the list is empty.
+         */
+        popFront(): T | undefined;
+        /**
+         * Remove the last item of the list.
+         * @return {*} The item removed. It's undefined if the list is empty.
+         */
+        popBack(): T | undefined;
+        /**
+         * Removes the first times items of the list.
+         * @param times {number} The number of times to repeat the popFront method.
+         * @return {*} The item removed. It's undefined if the list is empty.
+         */
+        multiPopFront(times: number): (T | undefined)[];
+        /**
+         * Removes the last times items of the list.
+         * @param times {number} The number of times to repeat the popBack method.
+         * @return {*} The items removed.
+         */
+        multiPopBack(times: number): (T | undefined)[];
+        /**
+         * Returns the first item of the list without remove it.
+         * @return {*} The item at the top of the list. It's undefined if the list is empty.
+         */
+        peek(): T | undefined;
+        /**
+         * Add the item at the index position.
+         * @param item {*} The item to add.
+         * @param index {number} The position where to add the item. If index is negative, the item won't be added.
+         * @return {void}
+         */
+        addAt(item: T, index: number): void;
+        /**
+         * Remove the item at the position index.
+         * @param index {Number} The position of the item to remove.
+         * @return {*} The item stored at the position index. It's undefined if the index is out of bounds.
+         */
+        removeAt(index: number): T | undefined;
+        /**
+         * Removes the item from the list.
+         * @param item {*} The item to remove.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {void}
+         */
+        remove(item: T, callback?: (item: T) => boolean): void;
+        /**
+         * Removes all the item from the list.
+         * @param item {*} The item to remove.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {void}
+         */
+        removeAll(item: T, callback?: (item: T) => boolean): void;
+        /**
+         * Removes all the items stored from the from position to the to position.
+         * If from > to, the method will remove all the items up to the end.
+         * @param from {number} The position where start to remove the items. The from position is included.
+         * @param to {number} The position where stop to remove the items. The to position is included.
+         * @return {Array<*>} The items removed.
+         */
+        removeSegment(from: number, to: number): (T | undefined)[];
+        /**
+         * Change the item stored in the index position. If the index is out of bound, the node won't be updated.
+         * @param index {number} The position of the node to modify.
+         * @param item {*} The new item stored in the node.
+         * @return {void}
+         */
+        modifyAt(index: number, item: T): void;
+        /**
+         * Removes all the items stored in the list.
+         * @return {void}
+         */
+        clear(): void;
+        /**
+         * Checks if the list contains an item that satisfy the condition represented by the callback function.
+         * @param item {*} The item to find.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {boolean} True if the list contains the item that satisfy the condition, false otherwise.
+         */
+        contains(item: T, callback?: (item: T) => boolean): boolean;
+        /**
+         * Executes the callback function for each item of the stack.
+         * This method modifies the list so if you don't need to modify it you must return the same item of the array.
+         * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+         * @return {void}
+         */
+        execute(callback: (item: T) => T): void;
+        /**
+         * Delete the node from the list.
+         * @param node {DLLNode} The node to delete.
+         * @return {void}
+         */
+        deleteNode(node: DLLNode<T>): void;
+        /**
+         * Get the node at the position index relative from the node.
+         * @param index {Number} The index, relative to the node, of the node to return.
+         * @param [node = first] {DLLNode} The node from which start the search.
+         * @return {DLLNode} The node at the position index.
+         */
+        getNode(index: number, node?: DLLNode<T>): DLLNode<T> | undefined;
+        /**
+         * Get the item at the position index.
+         * @param index {Number} The position of the item.
+         * @return {*}. It's undefined if index isn't in the queue bounds.
+         */
+        getItem(index: number): T | undefined;
+        /**
+         * Sort the list.
+         * @param [callback = function(item){return(item);}] {function} The function invoked in order to get the value for the evaluation of the sort criteria.
+         * @example
+         * callback = function(item) {return -item.key;}
+         * This function callback will return the opposite of the attribute key of the item. In this case the list will be sorted in descending order.
+         * @return {void}
+         */
+        sort(callback?: (item: T) => number): void;
+        /**
+         * Transform the list into an array.
+         * @return {Array<*>} The array built.
+         */
+        toArray(): T[];
+        /**
+         * Returns the length of the list.
+         * @return {Number} The length of the list.
+         */
+        getLength(): number;
+        /**
+         * Build the list from the array.
+         * @param array {Array<*>} The array from which build the list.
+         * @return {void}
+         */
+        fromArray(array: T[]): void;
+        /**
+         * Return the items that satisfy the condition determined by the callback.
+         * @param callback {function} The function that implements the condition.
+         * @return {Array<Object>} The array that contains the items that satisfy the condition.
+         */
+        filter(callback: (item: T) => boolean): T[];
+        /**
+         * Reverse the list. This method reverses only the items, not the nodes.
+         * @return {void}
+         */
+        reverse(): void;
+        /**
+         * Checks if the list is empty.
+         * @return {boolean} True if the list is empty, false otherwise.
+         */
+        isEmpty(): boolean;
+        /**
+         * Returns the first position of the item in the list.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The first position of the item.
+         */
+        indexOf(item: T, callback?: (item: T) => boolean): number;
+        /**
+         * Returns the last position of the item in the list.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The last position of the item.
+         */
+        lastIndexOf(item: T, callback?: (item: T) => boolean): number;
+        /**
+         * Returns all the position in which the item has been found in the list.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {Array<number>} The positions in which the item has been found.
+         */
+        allIndexesOf(item: T, callback?: (item: T) => boolean): number[];
+        /**
+         * Add the list at the end of this list.
+         * @param list {DoubleLinkedList} The list to join.
+         * @return {void}
+         */
+        join(list: DoubleLinkedList<T>): void;
+        /**
+         * Divides the list at the index position. The node at the index position is the first new node of the list.
+         * @param index {number} The position where to divide the list.
+         * @return {DoubleLinkedList} The list formed by the nodes from the index position then. If the index is out of bound, the list will be empty.
+         */
+        divide(index: number): DoubleLinkedList<T>;
+        /**
+         * Clones the list into a new list.
+         * @return {DoubleLinkedList} The list cloned from this list.
+         */
+        clone(): DoubleLinkedList<T>;
+        /**
+         * Clones the list into a new list without cloning duplicated items.
+         * @return {DoubleLinkedList} The list cloned from this list.
+         */
+        cloneDistinct(): DoubleLinkedList<T>;
+        /**
+         * Splits the list into lists of desired size.
+         * @param size {number} The size of the lists.
+         * @return {Array<DoubleLinkedList>} The lists created by splitting the list.
+         */
+        split(size: number): DoubleLinkedList<T>[];
+        /**
+         * Returns the number of items that satisfy the represented by the callback function.
+         * @param callback {function} The condition to satisfy.
+         * @return {number} The number of items that satisfy the condition.
+         */
+        count(callback: (item: T) => boolean): number;
+    }
+}
+/**
+ * Created by Stefano on 04/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+declare namespace ds {
+    class DoubleLinkedListIterator<T> implements Iterator {
+        /**
+         * The aggregate relates to this iterator.
+         * @type {DoubleLinkedList}
+         */
+        aggregate: DoubleLinkedList<T>;
+        /**
+         * The pointer to the position.
+         * @type {Node|null}
+         */
+        pointer: DLLNode<T>;
+        /**
+         * Class that implements the iterator for a double linked list.
+         * @param aggregate {DoubleLinkedList} The aggregate to scan.
+         * @constructor
+         */
+        constructor(aggregate: DoubleLinkedList<T>);
+        /**
+         * @inheritDoc
+         */
+        first(): void;
+        /**
+         * @inheritDoc
+         */
+        next(): void;
+        /**
+         * @inheritDoc
+         */
+        last(): void;
+        /**
+         * @inheritDoc
+         */
+        previous(): void;
+        /**
+         * @inheritDoc
+         */
+        isDone(): boolean;
+        /**
+         * @inheritDoc
+         */
+        getItem(): T;
+        /**
+         * Return the node stored at the position pointed by the iterator.
+         * @abstract
+         * @return {Node|null} The node stored or null if it's out of the bounds.
+         */
+        getNode(): DLLNode<T>;
+    }
+}
+/**
+ * Created by Stefano on 05/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+declare namespace ds {
+    class HashTable<T> {
+        /**
+         * The size of the table
+         * @type {number}
+         */
+        size: number;
+        p: number;
+        a: number;
+        b: number;
+        /**
+         * Calculate the hash of the param key.
+         * @param key {number} The key to hash.
+         * @return {number} The hash of the key.
+         */
+        hash: (key: number) => number;
+        /**
+         * The items stored in the hash table.
+         * @type {Array<DoubleLinkedList>}
+         */
+        items: DoubleLinkedList<{
+            key: number;
+            item: T;
+        }>[];
+        /**
+         * The number of keys stored in the hash table.
+         * @type {number}
+         */
+        keyLength: number;
+        /**
+         * Class for managing an hash table.
+         * @param size {number} The size of the table.
+         * @constructor
+         */
+        constructor(size: number);
+        /**
+         * Stores the item with its key.
+         * @param key {number} The key relatives to the item.
+         * @param item {*} The item to store.
+         */
+        insert(key: number, item: T): void;
+        /**
+         * Deletes the first item relatives to the key value.
+         * @param key {number} The key to delete.
+         * @return {void}
+         */
+        deleteKey(key: number): void;
+        /**
+         * Deletes all the items relative to the key value.
+         * @param key {number} The key to delete.
+         * @return {void}
+         */
+        deleteAllKey(key: number): void;
+        /**
+         * Searches the item relative to the key value.
+         * @param key {number} The key of the item to search.
+         * @return {*|undefined} The item found or undefined if the key does not exist.
+         */
+        search(key: number): T | undefined;
+        /**
+         * Checks if the hash table contains a key that satisfy the condition represented by the callback function.
+         * @param key {number} The key to find.
+         * @param [callback = function(k){return(k===key);}] The condition to satisfy. The callback must accept the current key to check.
+         * @return {boolean} True if the hash table contains the key that satisfy the condition, false otherwise.
+         */
+        containsKey(key: number, callback?: (key: number) => boolean): boolean;
+        /**
+         * Searches all the items relative to the key value.
+         * @param key {number} The key of the items to search.
+         * @return {Array.<*>} An array with the items found.
+         */
+        searchAll(key: number): T[];
+        /**
+         * Returns the keys stored in the hash table.
+         * @return {Array<number>} The keys stored in the table.
+         */
+        getKeys(): number[];
+        /**
+         * Returns the items stored in the hash table.
+         * @return {Array<*>} The items stored in the table.
+         */
+        getItems(): T[];
+        /**
+         * Removes all the keys and the items stored in the hash table.
+         * @return {void}
+         */
+        clear(): void;
+        /**
+         * Returns the number of keys stored in the hash table.
+         * @return {number} The number of keys stored.
+         */
+        getNumberOfKeys(): number;
+        /**
+         * Checks if the hash table is empty.
+         * @return {boolean} True if the hash table is empty, false otherwise.
+         */
+        isEmpty(): boolean;
+        /**
+         * Executes the callback function for each item of the hash table.
+         * This method modifies the hash table so if you don't need to modify it you must return the same item stored.
+         * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+         * @return {void}
+         */
+        execute(callback: (item: {
+            key: number;
+            item: T;
+        }) => {
+            key: number;
+            item: T;
+        }): void;
+        /**
+         * Returns the items that satisfy the condition determined by the callback.
+         * @param callback {function} The function that implements the condition.
+         * @return {Array<*>} The array that contains the items that satisfy the condition.
+         */
+        filter(callback: (item: {
+            key: number;
+            item: T;
+        }) => boolean): any[];
+        /**
+         * Returns the size of the hash table.
+         * @return {number} The size of the hash table.
+         */
+        getSize(): number;
+        /**
+         * Clones the hash table into a new hash table.
+         * @return {HashTable} The hash table cloned from this hash table.
+         */
+        clone(): HashTable<T>;
+    }
+}
+/**
+ * Created by Stefano on 31/03/14.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+declare namespace ds {
+    class LLNode<T> {
+        /**
+         * The item stored.
+         * @type {*}
+         */
+        item: T;
+        /**
+         * The next node. It's null if there's no a next node.
+         * @type {LLNode|null}
+         */
+        next: LLNode<T>;
+        /**
+         * The single node of the list.
+         * @param item {*} The item to store in the node.
+         * @constructor
+         */
+        constructor(item: T);
+    }
+    class LinkedList<T> extends Aggregate {
+        /**
+         * The first node of the list.
+         * @type {LLNode|null}
+         */
+        first: LLNode<T>;
+        /**
+         * The last node of the list.
+         * @type {LLNode|null}
+         */
+        last: LLNode<T>;
+        /**
+         * The length of the list.
+         * @type {number}
+         */
+        length: number;
+        /**
+         * Class for managing a linked list.
+         * @param {...*} [args] The items for initializing the list.
+         * @constructor
+         */
+        constructor(...args: any[]);
+        /**
+         * @inheritDoc
+         */
+        getIterator(): LinkedListIterator<T>;
+        /**
+         * Adds an item at the head of the list.
+         * @param item {*} The item to add.
+         * @return {void}
+         */
+        pushFront(item: T): void;
+        /**
+         * Adds an item at the tail of the list.
+         * @param item {*} The item to add.
+         * @return {void}
+         */
+        pushBack(item: T): void;
+        /**
+         * Removes the first item of the list.
+         * @return {*} The item removed. It's undefined if the list is empty.
+         */
+        popFront(): T | undefined;
+        /**
+         * Removes the last item of the list.
+         * @return {*} The item removed. It's undefined if the list is empty.
+         */
+        popBack(): T | undefined;
+        /**
+         * Removes the first times items of the list.
+         * @param times {number} The number of times to repeat the popFront method.
+         * @return {*} The item removed. It's undefined if the list is empty.
+         */
+        multiPopFront(times: number): (T | undefined)[];
+        /**
+         * Removes the last times items of the list.
+         * @param times {number} The number of times to repeat the popBack method.
+         * @return {*} The items removed.
+         */
+        multiPopBack(times: number): (T | undefined)[];
+        /**
+         * Returns the first item of the list without remove it.
+         * @return {*} The item at the top of the list. It's undefined if the list is empty.
+         */
+        peek(): T | undefined;
+        /**
+         * Add the item at the index position.
+         * @param item {*} The item to add.
+         * @param index {number} The position where to add the item. If index is negative, the item won't be added.
+         * @return {void}
+         */
+        addAt(item: T, index: number): void;
+        /**
+         * Removes the item at the index position.
+         * @param index {number} The position of the item to remove.
+         * @return {*} The item stored at the position index. It's undefined if the index is out of bounds.
+         */
+        removeAt(index: number): T | undefined;
+        /**
+         * Removes the item from the list.
+         * @param item {*} The item to remove.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {void}
+         */
+        remove(item: T, callback?: (item: T) => boolean): void;
+        /**
+         * Removes all the item from the list.
+         * @param item {*} The item to remove.
+         * @param [callback (item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {void}
+         */
+        removeAll(item: T, callback?: (item: T) => boolean): void;
+        /**
+         * Removes all the items stored from the from position to the to position.
+         * If from > to, the method will remove all the items up to the end.
+         * @param from {number} The position where start to remove the items. The from position is included.
+         * @param to {number} The position where stop to remove the items. The to position is included.
+         * @return {Array<*>} The items removed.
+         */
+        removeSegment(from: number, to: number): (T | undefined)[];
+        /**
+         * Change the item stored in the index position. If the index is out of bound, the node won't be updated.
+         * @param index {number} The position of the node to modify.
+         * @param item {*} The new item stored in the node.
+         * @return {void}
+         */
+        modifyAt(index: number, item: any): void;
+        /**
+         * Removes all the items stored in the list.
+         * @return {void}
+         */
+        clear(): void;
+        /**
+         * Checks if the list contains an item that satisfy the condition represented by the callback function.
+         * @param item {*} The item to find.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {boolean} True if the list contains the item that satisfy the condition, false otherwise.
+         */
+        contains(item: T, callback?: (item: T) => boolean): boolean;
+        /**
+         * Executes the callback function for each item of the stack.
+         * This method modifies the list so if you don't need to modify it you must return the same item of the array.
+         * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+         * @return {void}
+         */
+        execute(callback: (item: T) => any): void;
+        /**
+         * Returns the node at the position index.
+         * @param index {number} The position of the node.
+         * @return {LLNode} The node stored at the position index. It's undefined if index isn't in the list bounds.
+         */
+        getNode(index: number): LLNode<T> | undefined;
+        /**
+         * Returns the item at the position index.
+         * @param index {number} The position of the item.
+         * @return {*} The item stored at the position index. It's undefined if index isn't in the list bounds.
+         */
+        getItem(index: number): T | undefined;
+        /**
+         * Transforms the list into an array.
+         * @return {Array<*>} The array built.
+         */
+        toArray(): T[];
+        /**
+         * Returns the length of the list.
+         * @return {Number} The length of the list.
+         */
+        getLength(): number;
+        /**
+         * Builds the list from the array.
+         * @param array {Array<*>} The array from which build the list.
+         * @return {void}
+         */
+        fromArray(array: T[]): void;
+        /**
+         * Returns the items that satisfy the condition determined by the callback.
+         * @param callback {function} The function that implements the condition.
+         * @return {Array<*>} The array that contains the items that satisfy the condition.
+         */
+        filter(callback: (item: T) => boolean): T[];
+        /**
+         * Checks if the list is empty.
+         * @return {boolean} True if the list is empty, false otherwise.
+         */
+        isEmpty(): boolean;
+        /**
+         * Returns the first position of the item in the list.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The first position of the item.
+         */
+        indexOf(item: T, callback?: (item: T) => boolean): number;
+        /**
+         * Returns the last position of the item in the list.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The last position of the item.
+         */
+        lastIndexOf(item: T, callback?: (item: T) => boolean): number;
+        /**
+         * Returns all the position in which the item has been found in the list.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {Array<number>} The positions in which the item has been found.
+         */
+        allIndexesOf(item: T, callback?: (item: T) => boolean): number[];
+        /**
+         * Add the list at the end of this list.
+         * @param list {LinkedList} The list to join.
+         * @return {void}
+         */
+        join(list: LinkedList<T>): void;
+        /**
+         * Divides the list at the index position. The node at the index position is the first new node of the list.
+         * @param index {number} The position where to divide the list.
+         * @return {LinkedList} The list formed by the nodes from the index position then. If the index is out of bound, the list will be empty.
+         */
+        divide(index: number): LinkedList<T>;
+        /**
+         * Clones the list into a new list.
+         * @return {LinkedList} The list cloned from this list.
+         */
+        clone(): LinkedList<T>;
+        /**
+         * Clones the list into a new list without cloning duplicated items.
+         * @return {LinkedList} The list cloned from this list.
+         */
+        cloneDistinct(): LinkedList<T>;
+        /**
+         * Splits the list into lists of desired size.
+         * @param size {number} The size of the lists.
+         * @return {Array<LinkedList>} The lists created by splitting the list.
+         */
+        split(size: number): LinkedList<T>[];
+        /**
+         * Returns the number of items that satisfy the represented by the callback function.
+         * @param callback {function} The condition to satisfy.
+         * @return {number} The number of items that satisfy the condition.
+         */
+        count(callback: (item: T) => boolean): number;
+    }
+}
+/**
+ * Created by Stefano on 04/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+declare namespace ds {
+    class LinkedListIterator<T> implements Iterator {
+        /**
+         * The aggregate relates to this iterator.
+         * @type {LinkedList}
+         */
+        aggregate: LinkedList<T>;
+        /**
+         * The pointer to the position.
+         * @type {Node|null}
+         */
+        pointer: LLNode<T>;
+        /**
+         * Class that implements the iterator for a linked list.
+         * @param aggregate {LinkedList} The aggregate to scan.
+         * @constructor
+         */
+        constructor(aggregate: LinkedList<T>);
+        /**
+         * @inheritDoc
+         */
+        first(): LLNode<T>;
+        /**
+         * @inheritDoc
+         */
+        next(): void;
+        /**
+         * @inheritDoc
+         */
+        last(): void;
+        /**
+         * @inheritDoc
+         */
+        previous(): void;
+        /**
+         * @inheritDoc
+         */
+        isDone(): boolean;
+        /**
+         * @inheritDoc
+         */
+        getItem(): T;
+        /**
+         * Return the node stored at the position pointed by the iterator.
+         * @abstract
+         * @return {Node|null} The node stored or null if it's out of the bounds.
+         */
+        getNode(): LLNode<T>;
+    }
+}
+/**
+ * Created by Stefano on 31/03/14.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+declare namespace ds {
+    class PriorityQueue<T> extends Aggregate {
+        /**
+         * The list of the items in the queue.
+         * @type {RBTreeList}
+         */
+        items: RBTreeList<Queue<T>>;
+        /**
+         * The length of the queue.
+         * @type {number}
+         */
+        length: number;
+        /**
+         * Class for managing a priority queue.
+         * @constructor
+         */
+        constructor();
+        /**
+         * @inheritDoc
+         */
+        getIterator(): PriorityQueueIterator<T>;
+        /**
+         * Add the item at the tail of the queue.
+         * @param priority {number} The priority of the item.
+         * @param item {*} The item to add.
+         * @return {void}
+         */
+        enqueue(priority: number, item: T): void;
+        /**
+         * Adds the items with the same priority at the tail of the queue.
+         * @param priority {number} The priority of the items.
+         * @param items {Array<*>} The items to add.
+         * @return {void}
+         */
+        multiEnqueue(priority: number, items: any[]): void;
+        /**
+         * Remove the item at the head of the queue.
+         * @return {*} The item at the head of the queue. It's undefined if the queue is empty.
+         */
+        dequeue(): T | undefined;
+        /**
+         * Removes the items at the head of the queue.
+         * @param times {number} The number of times to repeat the dequeue method.
+         * @return {Array<*>} The items at the head of the queue.
+         */
+        multiDequeue(times: number): (T | undefined)[];
+        /**
+         * Removes the first length items from the position index.
+         * @param index {number} The position where to start to remove the items.
+         * @param [length = 1] {number} The number of items to remove.
+         * @return {void}
+         */
+        remove(index: number, length?: number): void;
+        /**
+         * Return the item at the position index.
+         * @param index {number} The index of the item.
+         * @return {*} The item found. It's undefined if the position index is out of bounds.
+         */
+        getItem(index: number): T;
+        /**
+         * Return the items relatives to the priority.
+         * @param priority {number} The priority of the items.
+         * @return {Array<*>} The items found.
+         */
+        getItems(priority: number): T[];
+        /**
+         * Return the first item in the queue. The item is not removed.
+         * @return {*} The first item. It's undefined if the queue is empty.
+         */
+        peek(): T | undefined;
+        /**
+         * Return the length of the queue.
+         * @return {number} The length of the queue.
+         */
+        getLength(): number;
+        /**
+         * Checks if the queue is empty.
+         * @return {boolean} True if the queue is empty, false otherwise.
+         */
+        isEmpty(): boolean;
+        /**
+         * Removes all the items stored in the queue.
+         * @return {void}
+         */
+        clear(): void;
+        /**
+         * Checks if the queue contains a priority that satisfy the condition represented by the callback function.
+         * @param priority {number} The priority to find.
+         * @param [callback = function(p){return(p===priority);}] The condition to satisfy. The callback must accept the current priority to check.
+         * @return {boolean} True if the queue contains the priority that satisfy the condition, false otherwise.
+         */
+        containsPriority(priority: number, callback?: (key: number) => boolean): boolean;
+        /**
+         * Return the queue created by the priority queue with the items in the same order but without the priority.
+         * @return {Queue} The queue created.
+         */
+        toQueue(): Queue<T>;
+        /**
+         * Executes the callback function for each item of the queue.
+         * This method modifies the queue so if you don't need to modify it you must return the same item of the array.
+         * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+         * @return {void}
+         */
+        execute(callback: (item: any) => any): void;
+        /**
+         * Change the priority of the item at the position index.
+         * @param index {number} The position of the item of which increase the priority.
+         * @param newPriority {number} The new priority.
+         * @return {void}
+         */
+        changePriority(index: number, newPriority: number): void;
+        /**
+         * Returns the items that satisfy the condition determined by the callback.
+         * @param callback {function} The function that implements the condition.
+         * @return {Array<*>} The array that contains the items that satisfy the condition.
+         */
+        filter(callback: (item: any) => any): T[];
+        /**
+         * Clones the queue into a new queue.
+         * @return {PriorityQueue} The queue cloned from this queue.
+         */
+        clone(): PriorityQueue<T>;
+        /**
+         * Clones the queue into a new queue without cloning duplicated items.
+         * @return {PriorityQueue} The queue cloned from this queue.
+         */
+        cloneDistinct(): PriorityQueue<T>;
+    }
+}
+/**
+ * Created by Stefano on 04/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+declare namespace ds {
+    class PriorityQueueIterator<T> implements Iterator {
+        /**
+         * The aggregate relates to this iterator.
+         * @type {PriorityQueue}
+         */
+        aggregate: PriorityQueue<T>;
+        /**
+         * The pointer to the position of the node.
+         * @type {RBLNode|null}
+         */
+        pointerNode: RBLNode<Queue<T>>;
+        /**
+         * The pointer to the position in the node.
+         * @type {number}
+         */
+        pointerPosition: number;
+        /**
+         * Class that implements the iterator for a priority queue.
+         * @param aggregate {PriorityQueue} The aggregate to scan.
+         * @constructor
+         */
+        constructor(aggregate: PriorityQueue<T>);
+        /**
+         * @inheritDoc
+         */
+        first(): void;
+        /**
+         * @inheritDoc
+         */
+        next(): void;
+        /**
+         * @inheritDoc
+         */
+        last(): void;
+        /**
+         * @inheritDoc
+         */
+        previous(): void;
+        /**
+         * @inheritDoc
+         */
+        isDone(): boolean;
+        /**
+         * @inheritDoc
+         */
+        getItem(): T;
+    }
+}
+/**
+ * Created by Stefano on 31/03/14.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+declare namespace ds {
+    class Queue<T> extends Aggregate {
+        /**
+         * The list of the items in the queue.
+         * @type {Array<*>}
+         */
+        items: T[];
+        /**
+         * Decreases dequeue big O complexity by shifting starting indexs
+         * for each dequeue, instead of splicing.
+         * @type {int}
+         */
+        offsetIndex: number;
+        /**
+         * Class for managing a queue.
+         * @param {...*} [args] The items for initializing the queue.
+         * @constructor
+         */
+        constructor(...args: any[]);
+        /**
+         * @inheritDoc
+         */
+        getIterator(): QueueIterator<T>;
+        /**
+         * Adds the item at the tail of the queue.
+         * @param item {*} The item to add.
+         * @return {void}
+         */
+        enqueue(item: T): void;
+        /**
+         * Adds the items at the tail of the queue.
+         * @param items {Array<*>} The items to add.
+         * @return {void}
+         */
+        multiEnqueue(items: T[]): void;
+        /**
+         * Removes the item at the head of the queue.
+         * @return {*} The item at the head of the queue. It's undefined if the queue is empty.
+         */
+        dequeue(): T | undefined;
+        /**
+         * Removes the items at the head of the queue.
+         * @param times {number} The number of times to repeat the dequeue method.
+         * @return {Array<*>} The items at the head of the queue.
+         */
+        multiDequeue(times: number): (T | undefined)[];
+        /**
+         * Clears array indexs hidden by offset. To free up memory
+         * @return {void}
+         */
+        purge(): void;
+        /**
+         * Removes the first length items from the position index.
+         * @param index {number} The position where to start to remove the items.
+         * @param [length = 1] {number} The number of items to remove.
+         * @return {void}
+         */
+        remove(index: number, length?: number): void;
+        /**
+         * Returns the item at the position index.
+         * @param index {number} The position of the item.
+         * @return {*} The item at the position. It's undefined if index isn't in the queue bounds.
+         */
+        getItem(index: number): T;
+        /**
+         * Returns the first item in the queue. The item is not removed.
+         * @return {*} The first item. It's undefined if the queue is empty.
+         */
+        peek(): T | undefined;
+        /**
+         * Removes all the items stored in the queue.
+         * @return {void}
+         */
+        clear(): void;
+        /**
+         * Checks if the queue contains an item that satisfy the condition represented by the callback function.
+         * @param item {*} The item to find.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {boolean} True if the queue contains the item that satisfy the condition, false otherwise.
+         */
+        contains(item: T, callback?: (item: T) => boolean): boolean;
+        /**
+         * Executes the callback function for each item of the queue.
+         * This method modifies the queue so if you don't need to modify it you must return the same item of the array.
+         * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+         * @return {void}
+         */
+        execute(callback: (item: T) => T): void;
+        /**
+         * Returns the length of the queue.
+         * @return {number} The length of the queue.
+         */
+        getLength(): number;
+        /**
+         * Checks if the queue is empty.
+         * @return {boolean} True if the queue is empty, false otherwise.
+         */
+        isEmpty(): boolean;
+        /**
+         * Returns the items that satisfy the condition determined by the callback.
+         * @param callback {function} The function that implements the condition.
+         * @return {Array<*>} The array that contains the items that satisfy the condition.
+         */
+        filter(callback: (item: T) => boolean): T[];
+        /**
+         * Returns the first position of the item in the queue.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The first position of the item.
+         */
+        indexOf(item: T, callback?: (item: T) => boolean): number;
+        /**
+         * Returns the last position of the item in the queue.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The last position of the item.
+         */
+        lastIndexOf(item: T, callback?: (item: T) => boolean): number;
+        /**
+         * Returns all the position in which the item has been found in the queue.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {Array<number>} The positions in which the item has been found.
+         */
+        allIndexesOf(item: T, callback?: (item: T) => boolean): number[];
+        /**
+         * Clones the queue into a new queue.
+         * @return {Queue} The queue cloned from this queue.
+         */
+        clone(): Queue<T>;
+        /**
+         * Clones the queue into a new queue without cloning duplicated items.
+         * @return {Queue} The queue cloned from this queue.
+         */
+        cloneDistinct(): Queue<T>;
+    }
+}
+/**
+ * Created by Stefano on 04/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+declare namespace ds {
+    class QueueIterator<T> implements Iterator {
+        /**
+         * The aggregate relates to this iterator.
+         * @type {Queue}
+         */
+        aggregate: Queue<T>;
+        /**
+         * The pointer to the position.
+         * @type {number}
+         */
+        pointer: number;
+        /**
+         * Class that implements the iterator for a linked list.
+         * @param aggregate {Queue} The aggregate to scan.
+         * @constructor
+         */
+        constructor(aggregate: Queue<T>);
+        /**
+         * @inheritDoc
+         */
+        first(): void;
+        /**
+         * @inheritDoc
+         */
+        next(): void;
+        /**
+         * @inheritDoc
+         */
+        last(): void;
+        /**
+         * @inheritDoc
+         */
+        previous(): void;
+        /**
+         * @inheritDoc
+         */
+        isDone(): boolean;
+        /**
+         * @inheritDoc
+         */
+        getItem(): T;
+    }
+}
+/**
+ * Created by Stefano on 01/02/2015.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+declare namespace ds {
+    /**
+     * Create an array containing the value of the range
+     * @param from {number} The inclusive start value of the range.
+     * @param to {number} The inclusive end value of the range.
+     * @param [step=1] The step to sample the values
+     * @return {Array<number>} The array containing the value of the range.
+     */
+    function Range(from: number, to: number, step?: number): number[];
+}
+declare namespace ds {
+    class RBNode<T> {
+        /**
+         * The item stored.
+         * @type {*}
+         */
+        item: T;
+        /**
+         * The key of the node.
+         * @type {number}
+         */
+        key: number;
+        /**
+         * The parent node. It's null if there's no a parent node.
+         * @type {RBNode|null}
+         */
+        parent: RBNode<T>;
+        /**
+         * The left node. It's null if there's no a left node.
+         * @type {RBNode|null}
+         */
+        left: RBNode<T>;
+        /**
+         * The right node. It's null if there's no a right node.
+         * @type {RBNode|null}
+         */
+        right: RBNode<T>;
+        /**
+         * The type of the node. It's or red or black.
+         * @type {string}
+         */
+        type: string;
+        /**
+         * The single node of the tree.
+         * @param key {number} The key of the node.
+         * @param item {*} The item to store in the node.
+         * @constructor
+         */
+        constructor(key: number, item: T);
+    }
+    class RBTree<T> extends Aggregate {
+        /**
+         * The root of the tree.
+         * @type {RBNode|null}
+         */
+        root: RBNode<T>;
+        /**
+         * The number of items stored in the tree.
+         * @type {number}
+         */
+        size: number;
+        /**
+         * Class for managing a red-black tree.
+         * @constructor
+         */
+        constructor();
+        /**
+         * @inheritDoc
+         */
+        getIterator(): RBTreeIterator<T>;
+        /**
+         * Insert the item relatives to the key value in the tree.
+         * @param key {number} The key to store.
+         * @param item {*} The item to store.
+         * @return {void}
+         */
+        insert(key: number, item: T): void;
+        /**
+         * Preserve the properties of the tree after an insert.
+         * @param node {RBNode} The node to insert.
+         * @return {void}
+         */
+        insertFixUp(node: RBNode<T>): void;
+        /**
+         * Delete the node from the tree.
+         * @param node {RBNode} The node to delete.
+         * @return {void}
+         */
+        deleteNode(node: RBNode<T>): void;
+        /**
+         * Preserve the properties of the tree after a deletion.
+         * @param node {RBNode} The node to delete.
+         * @param parent {RBNode} The parent of the node.
+         * @return {void}
+         */
+        deleteFixUp(node: RBNode<T>, parent: RBNode<T>): void;
+        /**
+         * Get the node with the key next to the param node key.
+         * @param node {RBNode} The node of which search the successor.
+         * @return {RBNode} The node found.
+         */
+        successor(node: RBNode<T>): RBNode<T>;
+        /**
+         * Get the node with the key previous to the param node key.
+         * @param node {RBNode} The node of which search the predecessor.
+         * @return {RBNode} The node found.
+         */
+        predecessor(node: RBNode<T>): RBNode<T>;
+        /**
+         * Search the item relatives to the key and to the nodes that satisfy the condition represented by the callback function.
+         * @param key {number} The key to find.
+         * @param [node = root] {RBNode} The node from which start the search.
+         * @param [callback = function(node){return(node.key===key);}] The condition to satisfy. The callback must accept the current node to check.
+         * @return {*} The item found or undefined if there isn't the key in the tree.
+         */
+        search(key: number, node?: RBNode<T>, callback?: (node: RBNode<T>) => boolean): T | undefined;
+        /**
+         * Checks if the tree contains a key or a node that satisfy the condition represented by the callback function.
+         * This method avoid to search in branches where the key won't be found.
+         * @param key {*} The key to find.
+         * @param [callback = function(node){return(node.key===key);}] The condition to satisfy. The callback must accept the current node to check.
+         * @return {boolean} True if the tree contains the key or a node that satisfy the condition, false otherwise.
+         */
+        contains(key: number, callback?: (node: RBNode<T>) => boolean): boolean;
+        /**
+         * Checks if the tree contains a node that satisfy the condition represented by the callback function.
+         * This method check all the tree avoiding the binary search.
+         * @param callback {function} The condition to satisfy. The callback must accept the current node to check.
+         * @return {boolean} True if the tree contains the node that satisfy the condition, false otherwise.
+         */
+        fullContains(callback: (key: number) => boolean): boolean;
+        /**
+         * Get the item relatives to the minimum key stored in the tree.
+         * @param [node = root] {Node} The node from which start the search.
+         * @return {RBNode} The node found.
+         */
+        minimum(node?: RBNode<T>): RBNode<T>;
+        /**
+         * Get the item relatives to the maximum key stored in the tree.
+         * @param [node = root] {Node} The node from which start the search.
+         * @return {RBNode} The node found.
+         */
+        maximum(node?: RBNode<T>): RBNode<T>;
+        /**
+         * Rotate the node with its right child.
+         * @param node {RBNode} The node to rotate.
+         * @return {void}
+         */
+        leftRotate(node: RBNode<T>): void;
+        /**
+         * Rotate the node with its left child.
+         * @param node {RBNode} The node to rotate.
+         * @return {void}
+         */
+        rightRotate(node: RBNode<T>): void;
+        /**
+         * Returns the size of the tree.
+         * @return {number} The size of the tree.
+         */
+        getSize(): number;
+        /**
+         * Clones the queue into a new queue.
+         * @return {RBTree} The tree cloned from this queue.
+         */
+        clone(): RBTree<T>;
+        /**
+         * Clones the tree into a new tree without cloning duplicated items.
+         * @return {RBTree} The tree cloned from this tree.
+         */
+        cloneDistinct(): RBTree<T>;
+        /**
+         * Transform the tree into an array without preserving keys.
+         * @return {Array<*>} The array that represents the tree.
+         */
+        toArray(): T[];
+        /**
+         * Removes all the items stored in the tree.
+         * @return {void}
+         */
+        clear(): void;
+        /**
+         * Checks if the tree is empty.
+         * @return {boolean} True if the tree is empty, false otherwise.
+         */
+        isEmpty(): boolean;
+        /**
+         * Executes the callback function for each item of the tree.
+         * This method modifies the tree so if you don't need to modify it you must return the same item stored.
+         * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+         * @return {void}
+         */
+        execute(callback: (item: T) => T): void;
+        /**
+         * Returns the items that satisfy the condition determined by the callback.
+         * @param callback {function} The function that implements the condition.
+         * @return {Array<*>} The array that contains the items that satisfy the condition.
+         */
+        filter(callback: (item: T) => boolean): T[];
+        /**
+         * Returns the first position of the item in the tree.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The first position of the item.
+         */
+        indexOf(item: T, callback?: (item: T) => boolean): number;
+        /**
+         * Returns the last position of the item in the tree.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The last position of the item.
+         */
+        lastIndexOf(item: T, callback?: (item: T) => boolean): number;
+        /**
+         * Returns all the position in which the item has been found in the tree.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {Array<number>} The positions in which the item has been found.
+         */
+        allIndexesOf(item: T, callback?: (item: T) => boolean): number[];
+        /**
+         * Returns the item at the position index.
+         * @param index {number} The position of the item.
+         * @return {*} The item at the position. It's undefined if index isn't in the tree bounds.
+         */
+        getItem(index: number): T | undefined;
+    }
+}
+/**
+ * Created by Stefano on 06/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+declare namespace ds {
+    class RBTreeIterator<T> implements Iterator {
+        /**
+         * The aggregate relates to this iterator.
+         * @type {RBTree}
+         */
+        aggregate: RBTree<T>;
+        /**
+         * The pointer to the position.
+         * @type {RBNode|null}
+         */
+        pointer: RBNode<T>;
+        /**
+         * Class that implements the iterator for a red-black tree.
+         * @param aggregate {RBTree} The aggregate to scan.
+         * @constructor
+         */
+        constructor(aggregate: RBTree<T>);
+        /**
+         * @inheritDoc
+         */
+        first(): void;
+        /**
+         * @inheritDoc
+         */
+        next(): void;
+        /**
+         * @inheritDoc
+         */
+        last(): void;
+        /**
+         * @inheritDoc
+         */
+        previous(): void;
+        /**
+         * @inheritDoc
+         */
+        isDone(): boolean;
+        /**
+         * @inheritDoc
+         */
+        getItem(): T;
+        /**
+         * Return the node stored at the position pointed by the iterator.
+         * @abstract
+         * @return {RBNode|null} The node stored or null if it's out of the bounds.
+         */
+        getNode(): RBNode<T>;
+    }
+}
+declare namespace ds {
+    class RBLNode<T> {
+        /**
+         * The item stored.
+         * @type {*}
+         */
+        item: T;
+        /**
+         * The key of the node.
+         * @type {number}
+         */
+        key: number;
+        /**
+         * The parent node. It's null if there's no a parent node.
+         * @type {RBLNode|null}
+         */
+        parent: RBLNode<T>;
+        /**
+         * The left node. It's null if there's no a left node.
+         * @type {RBLNode|null}
+         */
+        left: RBLNode<T>;
+        /**
+         * The right node. It's null if there's no a right node.
+         * @type {RBLNode|null}
+         */
+        right: RBLNode<T>;
+        /**
+         * The next node. It's null if there's no a next node.
+         * @type {RBLNode|null}
+         */
+        next: RBLNode<T>;
+        /**
+         * The previous node. It's null if there's no a previous node.
+         * @type {RBLNode|null}
+         */
+        previous: RBLNode<T>;
+        /**
+         * The type of the node. It's or red or black.
+         * @type {string}
+         */
+        type: string;
+        /**
+         * The single node of the tree.
+         * @param key {number} The key of the node.
+         * @param item {*} The item to store in the node.
+         * @constructor
+         */
+        constructor(key: number, item: T);
+    }
+    class RBTreeList<T> extends Aggregate {
+        /**
+         * The root of the tree.
+         * @type {RBLNode|null}
+         */
+        root: RBLNode<T>;
+        /**
+         * The first node of the tree.
+         * @type {RBLNode|null}
+         */
+        first: RBLNode<T>;
+        /**
+         * The last node of the tree.
+         * @type {RBLNode|null}
+         */
+        last: RBLNode<T>;
+        /**
+         * The size of the tree.
+         * @type {number}
+         */
+        size: number;
+        constructor();
+        /**
+         * @inheritDoc
+         */
+        getIterator(): RBTreeListIterator<T>;
+        /**
+         * Insert the item relatives to the key value in the tree.
+         * @param key {number} The key to store.
+         * @param item {*} The item to store.
+         * @return {void}
+         */
+        insert(key: number, item: T): void;
+        /**
+         * Preserve the properties of the tree after an insert.
+         * @param node {RBLNode} The node to insert.
+         * @return {void}
+         */
+        insertFixUp(node: RBLNode<T>): void;
+        /**
+         * Delete the node from the tree.
+         * @param node {RBLNode} The node to delete.
+         * @return {void}
+         */
+        deleteNode(node: RBLNode<T>): void;
+        /**
+         * Preserve the properties of the tree after a deletion.
+         * @param node {RBLNode} The node to delete.
+         * @param parent {RBLNode} The parent of the node.
+         * @return {void}
+         */
+        deleteFixUp(node: RBLNode<T>, parent: RBLNode<T>): void;
+        /**
+         * Get the node with the key next to the param node key.
+         * @param node {RBLNode} The node of which search the successor.
+         * @return {RBLNode} The node found.
+         */
+        successor(node: RBLNode<T>): RBLNode<T>;
+        /**
+         * Get the node with the key previous to the param node key.
+         * @param node {RBLNode} The node of which search the predecessor.
+         * @return {RBLNode} The node found.
+         */
+        predecessor(node: RBLNode<T>): RBLNode<T>;
+        /**
+         * Search the item relatives to the key that satisfy the condition represented by the callback function.
+         * @param key {number} The key to find.
+         * @param [node = root] {RBNode} The node from which start the search.
+         * @param [callback = function(k){return(k===key);}] The condition to satisfy. The callback must accept the current key to check.
+         * @return {*} The item found or undefined if there isn't the key in the tree.
+         */
+        search(key: number, node?: RBLNode<T>, callback?: (node: RBLNode<T>) => boolean): T | undefined;
+        /**
+         * Checks if the tree contains a key or a node that satisfy the condition represented by the callback function.
+         * This method avoid to search in branches where the key won't be found.
+         * @param key {*} The key to find.
+         * @param [callback = function(node){return(node.key===key);}] The condition to satisfy. The callback must accept the current node to check.
+         * @return {boolean} True if the tree contains the key or a node that satisfy the condition, false otherwise.
+         */
+        contains(key: number, callback?: (node: RBLNode<T>) => boolean): boolean;
+        /**
+         * Checks if the tree contains a node that satisfy the condition represented by the callback function.
+         * This method check all the tree avoiding the binary search.
+         * @param callback {function} The condition to satisfy. The callback must accept the current node to check.
+         * @return {boolean} True if the tree contains the node that satisfy the condition, false otherwise.
+         */
+        fullContains(callback: (key: number) => boolean): boolean;
+        /**
+         * Get the item relatives to the minimum key stored in the tree.
+         * @param [node = root] {Node} The node from which start the search.
+         * @return {RBLNode} The node found.
+         */
+        minimum(node?: RBLNode<T>): RBLNode<T>;
+        /**
+         * Get the item relatives to the maximum key stored in the tree.
+         * @param [node = root] {Node} The node from which start the search.
+         * @return {RBLNode} The node found.
+         */
+        maximum(node?: RBLNode<T>): RBLNode<T>;
+        /**
+         * Rotate the node with its right child.
+         * @param node {RBLNode} The node to rotate.
+         * @return {void}
+         */
+        leftRotate(node: RBLNode<T>): void;
+        /**
+         * Rotate the node with its left child.
+         * @param node {RBLNode} The node to rotate.
+         * @return {void}
+         */
+        rightRotate(node: RBLNode<T>): void;
+        /**
+         * Returns the size of the tree.
+         * @return {number} The size of the tree.
+         */
+        getSize(): number;
+        /**
+         * Clones the tree into a new tree.
+         * @return {RBTreeList} The tree cloned from this tree.
+         */
+        clone(): RBTreeList<T>;
+        /**
+         * Clones the tree into a new tree without cloning duplicated items.
+         * @return {RBTreeList} The tree cloned from this tree.
+         */
+        cloneDistinct(): RBTreeList<T>;
+        /**
+         * Transform the tree into an array without preserving keys.
+         * @return {Array<*>} The array that represents the tree.
+         */
+        toArray(): T[];
+        /**
+         * Removes all the items stored in the tree.
+         * @return {void}
+         */
+        clear(): void;
+        /**
+         * Checks if the tree is empty.
+         * @return {boolean} True if the tree is empty, false otherwise.
+         */
+        isEmpty(): boolean;
+        /**
+         * Executes the callback function for each item of the tree.
+         * This method modifies the tree so if you don't need to modify it you must return the same item stored.
+         * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+         * @return {void}
+         */
+        execute(callback: (item: T) => T): void;
+        /**
+         * Returns the items that satisfy the condition determined by the callback.
+         * @param callback {function} The function that implements the condition.
+         * @return {Array<*>} The array that contains the items that satisfy the condition.
+         */
+        filter(callback: (item: T) => boolean): T[];
+        /**
+         * Returns the first position of the item in the tree.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The first position of the item.
+         */
+        indexOf(item: T, callback?: (item: T) => boolean): number;
+        /**
+         * Returns the last position of the item in the tree.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The last position of the item.
+         */
+        lastIndexOf(item: any, callback?: (item: any) => boolean): number;
+        /**
+         * Returns all the position in which the item has been found in the tree.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {Array<number>} The positions in which the item has been found.
+         */
+        allIndexesOf(item: any, callback?: (item: any) => boolean): number[];
+        /**
+         * Returns the item at the position index.
+         * @param index {number} The position of the item.
+         * @return {*} The item at the position. It's undefined if index isn't in the tree bounds.
+         */
+        getItem(index: number): T | undefined;
+    }
+}
+/**
+ * Created by Stefano on 06/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+declare namespace ds {
+    class RBTreeListIterator<T> implements Iterator {
+        /**
+         * The aggregate relates to this iterator.
+         * @type {RBTreeList}
+         */
+        aggregate: RBTreeList<T>;
+        /**
+         * The pointer to the position.
+         * @type {RBLNode|null}
+         */
+        pointer: RBLNode<T>;
+        /**
+         * Class that implements the iterator for a red-black tree.
+         * @param aggregate {RBTreeList} The aggregate to scan.
+         * @constructor
+         */
+        constructor(aggregate: RBTreeList<T>);
+        /**
+         * @inheritDoc
+         */
+        first(): void;
+        /**
+         * @inheritDoc
+         */
+        next(): void;
+        /**
+         * @inheritDoc
+         */
+        last(): void;
+        /**
+         * @inheritDoc
+         */
+        previous(): void;
+        /**
+         * @inheritDoc
+         */
+        isDone(): boolean;
+        /**
+         * @inheritDoc
+         */
+        getItem(): T;
+        /**
+         * Return the node stored at the position pointed by the iterator.
+         * @abstract
+         * @return {RBNode|null} The node stored or null if it's out of the bounds.
+         */
+        getNode(): RBLNode<T>;
+    }
+}
+/**
+ * Created by Stefano on 12/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+declare namespace ds {
+    class Element<T> {
+        parents: DoubleLinkedList<Set<T>>;
+        item: T;
+        /**
+         * Class for representing an element of a set.
+         * @param item {*} The item to store in the element.
+         * @constructor
+         */
+        constructor(item: T);
+    }
+    class Set<T> {
+        /**
+         * The parents of the set.
+         * @type {DoubleLinkedList}
+         */
+        parents: DoubleLinkedList<Set<T>>;
+        /**
+         * The elements stored.
+         * @type {DoubleLinkedList}
+         */
+        elements: DoubleLinkedList<Element<T>>;
+        /**
+         * The subsets of this set.
+         * @type {DoubleLinkedList}
+         */
+        sets: DoubleLinkedList<Set<T>>;
+        /**
+         * The size of the set. It's equal to his cardinality.
+         * @type {number}
+         */
+        size: number;
+        /**
+         * Class for managing a set.
+         * @constructor
+         */
+        constructor();
+        /**
+         * Add the element to the set.
+         * @param element {Element} The element to add.
+         * @return {void}
+         */
+        insert(element: Element<T>): void;
+        /**
+         * Add the elements to the set.
+         * @param elements {Array<Element>} The elements to add.
+         * @return {void}
+         */
+        multiInsert(elements: Element<T>[]): void;
+        /**
+         * Returns the set that represents the union of two sets.
+         * @param set {Set} The set with make the union.
+         * @return {Set} The set that represents the union.
+         */
+        union(set: Set<T>): Set<T>;
+        /**
+         * Returns the set that represents the intersection of two sets.
+         * @param set {Set} The set to intersect with this.
+         * @return {Set} The set that represents the intersection.
+         */
+        intersect(set: Set<T>): Set<T>;
+        /**
+         * Returns the set that represents the difference of two sets.
+         * @param set {Set} The set to difference with this.
+         * @return {Set} The set that represents the difference.
+         */
+        difference(set: Set<T>): Set<T>;
+        /**
+         * Returns the set that represents the cartesian product of two sets.
+         * @param set {Set} The set to make the cartesian product with this.
+         * @return {Set} The set that represents the cartesian product .
+         */
+        cartesianProduct(set: Set<T>): Set<{}>;
+        /**
+         * Add the subset.
+         * @param set {Set} The subset.
+         */
+        addSubset(set: Set<T>): void;
+        /**
+         * Add the subsets.
+         * @param sets {Array<Set>} The subsets.
+         */
+        addSubsets(sets: Set<T>[]): void;
+        /**
+         * Returns the items that are stored in the set.
+         * @return {Array} The items stored.
+         */
+        getItems(): T[];
+        /**
+         * Returns the cardinality of the set.
+         * @return {number} The cardinality of the set.
+         */
+        getCardinality(): number;
+        /**
+         * Checks if the set is empty.
+         * @return {boolean} True if the set is empty, false otherwise.
+         */
+        isEmpty(): boolean;
+        /**
+         * Clones the set into a new set.
+         * @return {Set} The set cloned from this set.
+         */
+        clone(): Set<T>;
+    }
+}
+/**
+ * Created by Battistella Stefano on 31/03/14.
+ */
+declare namespace ds {
+    class Stack<T> extends Aggregate {
+        /**
+         * The list of the items in the stack.
+         * @type {Array<*>}
+         */
+        items: T[];
+        /**
+         * Class for managing a stack.
+         * @param {...*} [args] The items for initializing the stack.
+         * @constructor
+         */
+        constructor(...args: any[]);
+        /**
+         * @inheritDoc
+         */
+        getIterator(): StackIterator<T>;
+        /**
+         * Adds the item at the top of the stack.
+         * @param item {*} The item to add.
+         * return {void}
+         */
+        push(item: T): void;
+        /**
+         * Adds the items at the top of the stack.
+         * @param items {Array<*>} The items to add.
+         * @return {void}
+         */
+        multiPush(items: T[]): void;
+        /**
+         * Removes the item at the top of the stack.
+         * @return {*} The item at the top of the stack. It's undefined if the stack is empty.
+         */
+        pop(): T | undefined;
+        /**
+         * Removes the more item at the top of the stack.
+         * @param times {number} The number of times to repeat the pop method.
+         * @return {Array<*>} The items at the top of the stack.
+         */
+        multiPop(times: number): (T | undefined)[];
+        /**
+         * Returns the item at the top of the stack without remove it.
+         * @return {*} The item at the top of the stack. It's undefined if the stack is empty.
+         */
+        peek(): T | undefined;
+        /**
+         * Removes all the items stored in the stack.
+         * @return {void}
+         */
+        clear(): void;
+        /**
+         * Checks if the stack contains an item that satisfy the condition represented by the callback function.
+         * @param item {*} The item to find.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {boolean} True if the stack contains the item that satisfy the condition, false otherwise.
+         */
+        contains(item: T, callback?: (item: T) => boolean): boolean;
+        /**
+         * Executes the callback function for each item of the stack.
+         * This method modifies the stack so if you don't need to modify it you must return the same item of the array.
+         * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+         * @return {void}
+         */
+        execute(callback: (item: T) => T): void;
+        /**
+         * Returns the item at the position index.
+         * @param index The position of the item.
+         * @return {*} The item at the position. It's undefined if index isn't in the stack bounds.
+         */
+        getItem(index: number): T | undefined;
+        /**
+         * Returns the length of the stack.
+         * @return {Number} The length of the stack.
+         */
+        getLength(): number;
+        /**
+         * Checks if the stack is empty.
+         * @return {boolean} True if the stack is empty, false otherwise.
+         */
+        isEmpty(): boolean;
+        /**
+         * Returns the items that satisfy the condition determined by the callback.
+         * @param callback {function} The function that implements the condition.
+         * @return {Array<*>} The array that contains the items that satisfy the condition.
+         */
+        filter(callback: (item: T) => boolean): T[];
+        /**
+         * Returns the first position of the item in the stack.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The first position of the item.
+         */
+        indexOf(item: T, callback?: (item: T) => boolean): number;
+        /**
+         * Returns the last position of the item in the stack.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The last position of the item.
+         */
+        lastIndexOf(item: T, callback?: (item: T) => boolean): number;
+        /**
+         * Returns all the position in which the item has been found in the stack.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {Array<number>} The positions in which the item has been found.
+         */
+        allIndexesOf(item: T, callback?: (item: T) => boolean): number[];
+        /**
+         * Clones the stack into a new stack.
+         * @return {Stack} The stack cloned from this stack.
+         */
+        clone(): Stack<T>;
+        /**
+         * Clones the stack into a new stack without cloning duplicated items.
+         * @return {Stack} The stack cloned from this stack.
+         */
+        cloneDistinct(): Stack<T>;
+    }
+}
+/**
+ * Created by Stefano on 04/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+declare namespace ds {
+    class StackIterator<T> implements Iterator {
+        /**
+         * The aggregate relates to this iterator.
+         * @type {Stack}
+         */
+        aggregate: Stack<T>;
+        /**
+         * The pointer to the position.
+         * @type {number}
+         */
+        pointer: number;
+        /**
+         * Class that implements the iterator for a linked list.
+         * @param aggregate {Stack} The aggregate to scan.
+         * @constructor
+         */
+        constructor(aggregate: Stack<T>);
+        /**
+         * @inheritDoc
+         */
+        first(): void;
+        /**
+         * @inheritDoc
+         */
+        next(): void;
+        /**
+         * @inheritDoc
+         */
+        last(): void;
+        /**
+         * @inheritDoc
+         */
+        previous(): void;
+        /**
+         * @inheritDoc
+         */
+        isDone(): boolean;
+        /**
+         * @inheritDoc
+         */
+        getItem(): T;
+    }
+}
+/**
+ * Created by Stefano on 02/02/2015.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+declare namespace ds {
+    class TNode<T> {
+        /**
+         * The item stored.
+         * @type {*|null}
+         */
+        item: T;
+        /**
+         * The key of the node.
+         * @type {string|null}
+         */
+        string: string;
+        /**
+         * The parent node. It's null if there's no a parent node.
+         * @type {TNode|null}
+         */
+        parent: TNode<any>;
+        /**
+         * The children of the node.
+         * @type {Array<TNode>}
+         */
+        childs: TNode<T>[];
+        /**
+         * The single node of the tree.
+         * @param [string = null] The string of the node.
+         * @param [item = null] The item to store in the node.
+         * @constructor
+         */
+        constructor(string?: string, item?: T);
+    }
+    class Trie<T> extends Aggregate {
+        /**
+         * The root of the trie.
+         * @type {TNode}
+         */
+        root: TNode<T>;
+        /**
+         * The size of the trie
+         * @type {number}
+         */
+        size: number;
+        /**
+         * Class for managing a trie
+         * @constructor
+         */
+        constructor();
+        /**
+         * @inheritDoc
+         */
+        getIterator(): TrieIterator<T>;
+        /**
+         * Insert the string in the tree creating the relative path to it.
+         * If the string already exists then the values are updated
+         * @param string {string} The string to store.
+         * @param [item = null] The item to store.
+         * @return {void}
+         */
+        insert(string: string, item?: T): void;
+        /**
+         * Suggest the possible conclusion for the string.
+         * @param string {string} The start of the string.
+         * @return {Array<string>} The array of possible string conclusion to fill.
+         */
+        suggest(string: string): string[];
+        /**
+         * Return all the string saved under the node in the array.
+         * @param result {Array<string>} The array to fill.
+         * @param [node {TNode|null} = null] The node from which start searching the strings.
+         * @return {void}
+         */
+        stringsToArray(result: string[], node?: TNode<T>): void;
+        /**
+         * Update the item related to the string searched.
+         * @param string {string} The string for finding the item.
+         * @param callback {function} The function to execute to update the item. It should accept the item the iteration is working on.
+         * @return {void}
+         */
+        updateItem(string: string, callback: (item: T) => T): void;
+        /**
+         * Return the item related to the string searched.
+         * @param string {string} The string for finding the item.
+         * @returns {*} The item found. Undefined if the string is not in the trie
+         */
+        getItem(string: string): T | undefined;
+        /**
+         * Return the size of the trie.
+         * @returns {number} The size of the tree.
+         */
+        getSize(): number;
+        /**
+         * Get the minimum string stored in the tree.
+         * @param [node = root] {Node} The node from which start the search.
+         * @return {string} The string found.
+         */
+        minimum(node?: TNode<T>): string;
+        /**
+         * Get the maximum string stored in the tree.
+         * @param [node = root] {Node} The node from which start the search.
+         * @return {string} The string found.
+         */
+        maximum(node?: TNode<T>): string;
+    }
+}
+/**
+ * Created by Stefano on 06/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+declare namespace ds {
+    class TrieIterator<T> implements Iterator {
+        /**
+         * The aggregate relates to this iterator.
+         * @type {Trie}
+         */
+        aggregate: Trie<T>;
+        /**
+         * The pointer to the position.
+         * @type {TNode|null}
+         */
+        pointer: string;
+        /**
+         * Class that implements the iterator for a trie.
+         * @param aggregate {Trie} The aggregate to scan.
+         * @constructor
+         */
+        constructor(aggregate: Trie<T>);
+        /**
+         * @inheritDoc
+         */
+        first(): void;
+        /**
+         * @inheritDoc
+         */
+        next(): void;
+        /**
+         * @inheritDoc
+         */
+        last(): void;
+        /**
+         * @inheritDoc
+         */
+        previous(): void;
+        /**
+         * @inheritDoc
+         */
+        isDone(): boolean;
+        /**
+         * @inheritDoc
+         */
+        getItem(): any;
+    }
+}
diff --git a/out/ds.js b/out/ds.js
new file mode 100644
index 0000000..641b909
--- /dev/null
+++ b/out/ds.js
@@ -0,0 +1,6006 @@
+"use strict";
+var __extends = (this && this.__extends) || (function () {
+    var extendStatics = Object.setPrototypeOf ||
+        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
+        function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };
+    return function (d, b) {
+        extendStatics(d, b);
+        function __() { this.constructor = d; }
+        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
+    };
+})();
+/**
+ * Created by Stefano on 04/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+var ds;
+(function (ds) {
+    /**
+     * 集合
+     */
+    var Aggregate = /** @class */ (function () {
+        function Aggregate() {
+        }
+        return Aggregate;
+    }());
+    ds.Aggregate = Aggregate;
+})(ds || (ds = {}));
+/**
+ * Created by Stefano on 08/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+var ds;
+(function (ds) {
+    var BNode = /** @class */ (function () {
+        /**
+         * The single node of the tree.
+         * @constructor
+         */
+        function BNode() {
+            /**
+             * The keys stored it the node.
+             * @type {Array<*>}
+             */
+            this.keys = [];
+            /**
+             * The items stored in the node.
+             * @type {Array<*>}
+             */
+            this.items = [];
+            /**
+             * The nodes child of the node.
+             * @type {Array<BNode>}
+             */
+            this.childs = [];
+        }
+        return BNode;
+    }());
+    ds.BNode = BNode;
+    var BTree = /** @class */ (function (_super) {
+        __extends(BTree, _super);
+        /**
+         * Class for managing a B-Tree.
+         * @param minimumDegree {number} The minimum number of keys of a node.
+         * @constructor
+         */
+        function BTree(minimumDegree) {
+            if (minimumDegree === void 0) { minimumDegree = 0; }
+            var _this = _super.call(this) || this;
+            /**
+             * The root of the tree.
+             * @type {BNode}
+             */
+            _this.root = new BNode();
+            /**
+             * The number of items stored in the tree.
+             * @type {number}
+             */
+            _this.size = 0;
+            _this.t = minimumDegree;
+            return _this;
+        }
+        /**
+         * @inheritDoc
+         */
+        BTree.prototype.getIterator = function () {
+            return new ds.BTreeIterator(this);
+        };
+        ;
+        /**
+         * Insert the item relatives to the key value in the tree.
+         * @param key {number} The key to store.
+         * @param item {*} The item to store.
+         * @return {void}
+         */
+        BTree.prototype.insert = function (key, item) {
+            var node = this.root;
+            if (node.keys.length === 2 * this.t - 1) {
+                var newNode = new BNode();
+                newNode.childs.push(node);
+                this.root = newNode;
+                this.splitChild(newNode, 0);
+                node = newNode;
+            }
+            this.size++;
+            this.insertNonFull(node, key, item);
+        };
+        ;
+        /**
+         * Insert the new node in the right position if the node is not full.
+         * @param node {BNode} The node from which start to check the insertion.
+         * @param key {number} The key to store.
+         * @param item {*} The item to store.
+         * @return {void}
+         */
+        BTree.prototype.insertNonFull = function (node, key, item) {
+            while (node) {
+                var i = node.keys.length - 1;
+                if (!node.childs.length) {
+                    for (; i > -1 && key < node.keys[i]; i--) {
+                        node.keys[i + 1] = node.keys[i];
+                        node.items[i + 1] = node.items[i];
+                    }
+                    node.keys[i + 1] = key;
+                    node.items[i + 1] = item;
+                    return;
+                }
+                else {
+                    var j = 0;
+                    i++;
+                    while (j < i) {
+                        var m = Math.floor((j + i) / 2);
+                        if (key <= node.keys[m])
+                            i = m;
+                        else
+                            j = m + 1;
+                    }
+                    if (node.childs[j].keys.length === 2 * this.t - 1) {
+                        this.splitChild(node, j);
+                        if (key > node.keys[j])
+                            j++;
+                    }
+                    node = node.childs[j];
+                }
+            }
+        };
+        ;
+        /**
+         * Search the item relatives to the key that satisfy the condition represented by the callback function.
+         * @param key {Number} The key to find.
+         * @param [node = root] {RBNode} The node from which start the search.
+         * @param [callback = function(node,index){return(node.keys[index]===key);}] The condition to satisfy. The callback must accept the current node to check and optionally the position of the key.
+         * @return {*} The item found or undefined if there isn't the key in the tree.
+         */
+        BTree.prototype.search = function (key, node, callback) {
+            node = node || this.root;
+            callback = callback || function (node, index) {
+                return node.keys[index] === key;
+            };
+            while (node) {
+                var n = node.keys.length;
+                var i = 0, j = n;
+                while (i < j) {
+                    var m = Math.floor((i + j) / 2);
+                    if (key <= node.keys[m])
+                        j = m;
+                    else
+                        i = m + 1;
+                }
+                if (i < n && callback(node, i))
+                    return node.items[i];
+                else if (!node.childs.length)
+                    return undefined;
+                else
+                    node = node.childs[i];
+            }
+            return undefined;
+        };
+        ;
+        /**
+         * Split the child of the node at the position index.
+         * @param node {BNode} The parent of the child to split.
+         * @param index {number} The position of the child to split.
+         * @return {void}
+         */
+        BTree.prototype.splitChild = function (node, index) {
+            var newNode = new BNode();
+            var child = node.childs[index];
+            //copy of the last t - 1 keys and items in the new node
+            for (var i = 0; i < this.t - 1; i++) {
+                newNode.keys[i] = child.keys[i + this.t];
+                newNode.items[i] = child.items[i + this.t];
+            }
+            if (child.childs.length)
+                //copy of the last t child in the new node
+                for (var j = 0; j < this.t; j++)
+                    newNode.childs[j] = child.childs[j + this.t];
+            //shift the children from index + 1 position
+            for (var l = node.keys.length; l > index; l--)
+                node.childs[l + 1] = node.childs[l];
+            //set the index position as the position t of the child
+            node.childs[index + 1] = newNode;
+            //shift the keys and the items from index position
+            for (var k = node.keys.length - 1; k > index - 1; k--) {
+                node.keys[k + 1] = node.keys[k];
+                node.items[k + 1] = node.items[k];
+            }
+            node.keys[index] = child.keys[this.t - 1];
+            node.items[index] = child.items[this.t - 1];
+            //remove keys, items and child in the old node.
+            child.keys.splice(child.keys.length - this.t);
+            child.items.splice(child.items.length - this.t);
+            child.childs.splice(child.childs.length - this.t);
+        };
+        ;
+        /**
+         * Delete the key from the tree.
+         * @param key {*} The key to delete.
+         * @return {void}
+         */
+        BTree.prototype.deleteKey = function (key) {
+            if (this.root.keys.length) {
+                this.deleteNonMin(this.root, key);
+                if (!this.root.keys.length && this.root.childs.length)
+                    this.root = this.root.childs[0];
+                this.size--;
+            }
+        };
+        ;
+        /**
+         * Deletes a node that's a number of keys greater than the minimum for a node.
+         * @param node {BNode} The node to delete.
+         * @param key {number} The key to delete.
+         * @return {void}
+         */
+        BTree.prototype.deleteNonMin = function (node, key) {
+            var i = 0, j = node.keys.length;
+            while (i < j) {
+                var m = Math.floor((i + j) / 2);
+                if (key <= node.keys[m])
+                    j = m;
+                else
+                    i = m + 1;
+            }
+            //key is in the node
+            if (i < node.keys.length && key === node.keys[i]) {
+                //the node is a leaf
+                if (!node.childs.length) {
+                    //remove the key
+                    for (j = i + 1; j < node.keys.length; j++) {
+                        node.keys[j - 1] = node.keys[j];
+                        node.items[j - 1] = node.items[j];
+                    }
+                    node.keys.pop();
+                    node.items.pop();
+                }
+                else {
+                    //the node is not a leaf
+                    //the node has the minimum number of keys
+                    if (node.childs[i].length === this.t - 1) {
+                        //increase the number of the keys of the node
+                        this.augmentChild(node, i);
+                        if (i === node.keys.length + 1)
+                            i--;
+                    }
+                    //check if the key is moved in the child
+                    if (node.keys[i] !== key)
+                        this.deleteNonMin(node.childs[i], key);
+                    else
+                        this.deleteMax(node, i);
+                }
+                //the key is not in the node
+            }
+            else {
+                //check if the child i has the minimum number of keys
+                if (node.childs[i].keys.length === this.t - 1) {
+                    this.augmentChild(node, i);
+                    if (i === node.keys.length + 2)
+                        i--;
+                }
+                this.deleteNonMin(node.childs[i], key);
+            }
+        };
+        ;
+        /**
+         * Deletes a node that have the maximum number of keys for node.
+         * @param node {BNode} The node to delete.
+         * @param index {number} The key to delete in the node.
+         * @return {void}
+         */
+        BTree.prototype.deleteMax = function (node, index) {
+            var child = node.childs[index];
+            var goAhead = true;
+            while (goAhead) {
+                if (!child.childs.length) {
+                    node.keys[index] = child.keys[child.keys.length - 1];
+                    node.items[index] = child.items[child.items.length - 1];
+                    child.keys.pop();
+                    child.items.pop();
+                    goAhead = false;
+                }
+                else {
+                    var last = child.childs[child.keys.length];
+                    if (last.keys.length === this.t - 1)
+                        this.augmentChild(child, child.keys.length);
+                    child = child.childs[child.keys.length];
+                }
+            }
+        };
+        ;
+        /**
+         * Augments the number of keys stored in the node preserving the order.
+         * @param node {BNode} The node to delete.
+         * @param index {number} The index of the position to augment.
+         * @return {void}
+         */
+        BTree.prototype.augmentChild = function (node, index) {
+            var child = node.childs[index];
+            var brother = null;
+            if (index)
+                brother = node.childs[index - 1];
+            if (index && brother.keys.length > this.t - 1) {
+                if (child.childs.length) {
+                    for (var j = this.keys.length + 1; j > 0; j--)
+                        child.childs[j] = child.childs[j - 1];
+                    child.childs[0] = brother.childs[brother.keys.length];
+                    for (var i = child.keys.length; i > 0; i--) {
+                        child.keys[i] = child.keys[i - 1];
+                        child.items[i] = child.items[i - 1];
+                    }
+                    child.keys[0] = node.keys[index - 1];
+                    child.items[0] = node.items[index - 1];
+                    node.keys[index - 1] = brother.keys[brother.keys.length - 1];
+                    node.items[index - 1] = brother.items[brother.items.length - 1];
+                }
+            }
+            else {
+                if (index < node.keys.length)
+                    brother = node.childs[index + 1];
+                if (index < node.keys.length && brother.keys.length > this.t - 1) {
+                    if (brother.childs.length) {
+                        child.childs[child.keys.length + 1] = brother.childs[0];
+                        for (var l = 1; l < brother.keys.length + 1; l++)
+                            brother.childs[l - 1] = brother.childs[l];
+                        brother.childs.pop();
+                    }
+                    child.keys[child.keys.length] = node.keys[index];
+                    child.items[child.items.length] = node.items[index];
+                    node.keys[index] = brother.keys[0];
+                    node.items[index] = brother.items[0];
+                    for (var k = 1; k < brother.keys.length; k++) {
+                        brother.keys[k - 1] = brother.keys[k];
+                        brother.items[k - 1] = brother.items[k];
+                    }
+                    brother.keys.pop();
+                    brother.items.pop();
+                }
+                else {
+                    if (index < node.keys.length) {
+                        child.keys[this.t - 1] = node.keys[index];
+                        child.items[this.t - 1] = node.items[index];
+                        for (var m = index + 2; m < node.keys.length + 1; m++)
+                            node.childs[m - 1] = node.childs[m];
+                        node.childs.pop();
+                        for (var n = index + 1; n < node.keys.length; n++) {
+                            node.keys[n - 1] = node.keys[n];
+                            node.items[n - 1] = node.items[n];
+                        }
+                        node.keys.pop();
+                        node.items.pop();
+                        if (brother.childs.length)
+                            for (var y = 0; y < brother.keys.length + 1; y++)
+                                child.childs[this.t + y] = brother.childs[y];
+                        for (var x = 0; x < brother.keys.length; x++) {
+                            child.keys[x + this.t] = brother.keys[x];
+                            child.items[x + this.t] = brother.items[x];
+                        }
+                    }
+                    else {
+                        if (brother.childs.length)
+                            for (var w = 0; w < child.keys.length + 1; w++)
+                                brother.childs[this.t + w] = child.childs[w];
+                        brother.keys[this.t - 1] = node.keys[node.keys.length - 1];
+                        brother.items[this.t - 1] = node.items[node.keys.length - 1];
+                        for (var z = 0; z < child.keys.length; z++) {
+                            brother.keys[z + this.t] = child.keys[z];
+                            brother.items[z + this.t] = child.items[z];
+                        }
+                    }
+                }
+            }
+        };
+        ;
+        /**
+         * Checks if the tree contains the key.
+         * @param key {number} The key to find.
+         * @param [callback = function(node,index){return(node.keys[index]===key);}] The condition to satisfy. The callback must accept the current node to check and optionally the position of the key.
+         * @return {boolean} True if the tree contains the key.
+         */
+        BTree.prototype.contains = function (key, callback) {
+            return this.search(key, null, callback) !== undefined;
+        };
+        ;
+        /**
+         * Checks if the tree contains a node that satisfy the condition represented by the callback function.
+         * This method check all the tree avoiding the binary search.
+         * @param callback {function} The condition to satisfy. The callback must accept the current node to check.
+         * @return {boolean} True if the tree contains the node that satisfy the condition, false otherwise.
+         */
+        BTree.prototype.fullContains = function (callback) {
+            var key = this.minimumKey();
+            while (key !== -1 && !callback(this.search(key)))
+                key = this.successor(key);
+            return key !== -1;
+        };
+        ;
+        /**
+         * Get the key next to the param node key.
+         * @param key {number} The key of which search the successor.
+         * @param [node = root] The node from start the search of the successor.
+         * @return {number} The key found.
+         */
+        BTree.prototype.successor = function (key, node) {
+            node = node || this.root;
+            var i = 0, j = node.keys.length;
+            //search the key in the node
+            while (i < j) {
+                var m = Math.floor((i + j) / 2);
+                if (key <= node.keys[m])
+                    j = m;
+                else
+                    i = m + 1;
+            }
+            //check if the key has been found
+            if (node.keys[i] === key)
+                //in this case the successor is the next key
+                i++;
+            //if it's a leaf
+            if (!node.childs.length) {
+                //check if the key hasn't been found
+                if (i > node.keys.length - 1)
+                    return -1;
+                else
+                    return node.keys[i];
+            }
+            //if it's not a leaf check if the successor is in the i-child
+            var successor = this.successor(key, node.childs[i]);
+            //if it's not in the child and has been found a key then return it
+            if (successor === -1 && i < node.keys.length)
+                return node.keys[i];
+            //return the value of the successor even if it's null
+            return successor;
+        };
+        ;
+        /**
+         * Get the key previous to the param key.
+         * @param key {number} The key of which search the predecessor.
+         * @param [node = root] The node from start the search of the predecessor.
+         * @return {number} The key found.
+         */
+        BTree.prototype.predecessor = function (key, node) {
+            node = node || this.root;
+            var i = 0, j = node.keys.length;
+            //search the key in the node
+            while (i < j) {
+                var m = Math.floor((i + j) / 2);
+                if (key <= node.keys[m])
+                    j = m;
+                else
+                    i = m + 1;
+            }
+            i--;
+            //check if the node is a leaf
+            if (!node.childs.length) {
+                //check if a predecessor has been found
+                if (i < 0)
+                    return -1;
+                else
+                    return node.keys[i];
+            }
+            var predecessor = this.predecessor(key, node.childs[i + 1]);
+            if (predecessor === -1 && key > node.keys[0]) {
+                return node.keys[i];
+            }
+            return predecessor;
+        };
+        ;
+        /**
+         * Gets the minimum key stored in the tree.
+         * @return {number} The key found.
+         */
+        BTree.prototype.minimumKey = function () {
+            var node = this.root;
+            while (node.childs.length)
+                node = node.childs[0];
+            if (node)
+                return node.keys[0];
+            return -1;
+        };
+        ;
+        /**
+         * Gets the maximum key stored in the tree.
+         * @return {number} The key found.
+         */
+        BTree.prototype.maximumKey = function () {
+            var node = this.root;
+            while (node.childs.length)
+                node = node.childs[node.childs.length - 1];
+            if (node)
+                return node.keys[node.keys.length - 1];
+            return -1;
+        };
+        ;
+        /**
+         * Gets the item relatives to the minimum key stored in the tree.
+         * @return {number} The item found.
+         */
+        BTree.prototype.minimum = function () {
+            var node = this.root;
+            while (node.childs.length)
+                node = node.childs[0];
+            return node.items[0];
+        };
+        ;
+        /**
+         * Gets the item relatives to the maximum key stored in the tree.
+         * @return {node} The item found.
+         */
+        BTree.prototype.maximum = function () {
+            var node = this.root;
+            while (node.childs.length)
+                node = node.childs[node.childs.length - 1];
+            return node.items[node.items.length - 1];
+        };
+        ;
+        /**
+         * Returns the size of the tree.
+         * @return {number} The size of the tree.
+         */
+        BTree.prototype.getSize = function () {
+            return this.size;
+        };
+        ;
+        /**
+         * Checks if the tree is empty.
+         * @return {boolean} True if the tree is empty, false otherwise.
+         */
+        BTree.prototype.isEmpty = function () {
+            return !this.size;
+        };
+        ;
+        /**
+         * Executes the callback function for each item of the tree.
+         * This method modifies the tree so if you don't need to modify it you must return the same item of the array.
+         * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+         * @return {void}
+         */
+        BTree.prototype.execute = function (callback, node) {
+            node = node || this.root;
+            for (var i = 0; i < node.items.length; i++)
+                node.items[i] = callback(node.items[i]);
+            for (var j = 0; j < node.childs.length; j++)
+                this.execute(callback, node.childs[j]);
+        };
+        ;
+        /**
+         * Removes all the items stored in the tree.
+         * @return {void}
+         */
+        BTree.prototype.clear = function () {
+            this.root = null;
+            this.size = 0;
+        };
+        ;
+        /**
+         * Returns the items that satisfy the condition determined by the callback.
+         * @param callback {function} The function that implements the condition.
+         * @return {Array<*>} The array that contains the items that satisfy the condition.
+         */
+        BTree.prototype.filter = function (callback, node) {
+            var result = [];
+            node = node || this.root;
+            for (var i = 0; i < node.items.length; i++) {
+                if (node.childs.length)
+                    result = result.concat(this.filter(callback, node.childs[i]));
+                if (callback(node.items[i]))
+                    result.push(node.items[i]);
+            }
+            if (node.childs.length)
+                result = result.concat(this.filter(callback, node.childs[node.childs.length - 1]));
+            return result;
+        };
+        ;
+        /**
+         * Clones the tree into a new tree.
+         * @return {BTree} The tree cloned from this tree.
+         */
+        BTree.prototype.clone = function () {
+            var tree = new BTree(this.t);
+            var it = this.getIterator();
+            for (it.first(); !it.isDone(); it.next()) {
+                var item = it.getItem();
+                if (item["clone"])
+                    item = item["clone"]();
+                tree.insert(it.getKey(), item);
+            }
+            return tree;
+        };
+        ;
+        /**
+         * Clones the tree into a new tree without cloning duplicated items.
+         * @return {BTree} The tree cloned from this tree.
+         */
+        BTree.prototype.cloneDistinct = function () {
+            var tree = new BTree(this.t);
+            var it = this.getIterator();
+            for (it.first(); !it.isDone(); it.next()) {
+                var callback = function (item) {
+                    return item === it.getItem();
+                };
+                if (!tree.fullContains(callback)) {
+                    var item = it.getItem();
+                    if (item.cloneDistinct)
+                        tree.insert(it.getKey(), item.cloneDistinct());
+                    else if (item.clone)
+                        tree.insert(it.getKey(), item.clone());
+                    else
+                        tree.insert(it.getKey(), item);
+                }
+            }
+            return tree;
+        };
+        ;
+        /**
+         * Transform the tree into an array without preserving keys.
+         * @return {Array<*>} The array that represents the tree.
+         */
+        BTree.prototype.toArray = function () {
+            var result = [];
+            var it = this.getIterator();
+            for (it.first(); !it.isDone(); it.next())
+                result.push(it.getItem());
+            return result;
+        };
+        ;
+        /**
+         * Returns the first position of the item in the tree.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The first position of the item.
+         */
+        BTree.prototype.indexOf = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var i = 0, key = this.minimumKey();
+            while (key !== -1) {
+                if (callback(this.search(key)))
+                    return i;
+                key = this.successor(key);
+                i++;
+            }
+            return -1;
+        };
+        ;
+        /**
+         * Returns the last position of the item in the tree.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The last position of the item.
+         */
+        BTree.prototype.lastIndexOf = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var i = this.size - 1, key = this.maximumKey();
+            while (key !== -1) {
+                if (callback(this.search(key)))
+                    return i;
+                i--;
+                key = this.predecessor(key);
+            }
+            return -1;
+        };
+        ;
+        /**
+         * Returns all the position in which the item has been found in the tree.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {Array<number>} The positions in which the item has been found.
+         */
+        BTree.prototype.allIndexesOf = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var i = 0, key = this.minimumKey();
+            var indexes = [];
+            while (key !== -1) {
+                if (callback(this.search(key)))
+                    indexes.push(i);
+                i++;
+                key = this.successor(key);
+            }
+            return indexes;
+        };
+        ;
+        /**
+         * Returns the item at the position index.
+         * @param index {number} The position of the item.
+         * @return {*} The item at the position. It's undefined if index isn't in the tree bounds.
+         */
+        BTree.prototype.getItem = function (index) {
+            if (index < 0 || index > this.size - 1)
+                return undefined;
+            var key = this.minimum();
+            for (var i = 0; i < index; i++)
+                key = this.successor(key);
+            return this.search(key);
+        };
+        ;
+        return BTree;
+    }(ds.Aggregate));
+    ds.BTree = BTree;
+})(ds || (ds = {}));
+/**
+ * Created by Stefano on 06/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+var ds;
+(function (ds) {
+    var BTreeIterator = /** @class */ (function () {
+        /**
+         * Class that implements the iterator for a binary search tree.
+         * @param aggregate {BTree} The aggregate to scan.
+         * @constructor
+         */
+        function BTreeIterator(aggregate) {
+            /**
+             * The pointer to the position.
+             * @type {number}
+             */
+            this.pointer = -1;
+            this.aggregate = aggregate;
+        }
+        /**
+         * @inheritDoc
+         */
+        BTreeIterator.prototype.first = function () {
+            this.pointer = this.aggregate.minimumKey();
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        BTreeIterator.prototype.next = function () {
+            this.pointer = this.aggregate.successor(this.pointer);
+        };
+        /**
+         * @inheritDoc
+         */
+        BTreeIterator.prototype.last = function () {
+            this.pointer = this.aggregate.maximumKey();
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        BTreeIterator.prototype.previous = function () {
+            this.pointer = this.aggregate.predecessor(this.pointer);
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        BTreeIterator.prototype.isDone = function () {
+            return this.pointer === -1;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        BTreeIterator.prototype.getItem = function () {
+            return this.aggregate.search(this.pointer);
+        };
+        ;
+        /**
+         * Return the key stored at the position pointed by the iterator.
+         * @abstract
+         * @return {number} The key stored or null if it's out of the bounds.
+         */
+        BTreeIterator.prototype.getKey = function () {
+            return this.pointer;
+        };
+        ;
+        return BTreeIterator;
+    }());
+    ds.BTreeIterator = BTreeIterator;
+})(ds || (ds = {}));
+/**
+ * Created by Stefano on 05/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+var ds;
+(function (ds) {
+    var BSNode = /** @class */ (function () {
+        /**
+         * The single node of the tree.
+         * @param key {number} The key of the node.
+         * @param item {*} The item to store in the node.
+         * @constructor
+         */
+        function BSNode(key, item) {
+            this.item = item;
+            this.key = key;
+            this.parent = null;
+            this.left = null;
+            this.right = null;
+        }
+        return BSNode;
+    }());
+    ds.BSNode = BSNode;
+    var BSTree = /** @class */ (function (_super) {
+        __extends(BSTree, _super);
+        function BSTree() {
+            var _this = _super.call(this) || this;
+            _this.root = null;
+            return _this;
+        }
+        /**
+         * @inheritDoc
+         */
+        BSTree.prototype.getIterator = function () {
+            return new ds.BSTreeIterator(this);
+        };
+        /**
+         * Insert the item relatives to the key value in the tree.
+         * @param key {number} The key to store.
+         * @param item {*} The item to store.
+         * @return {void}
+         */
+        BSTree.prototype.insert = function (key, item) {
+            var node = new BSNode(key, item);
+            var p = this.root;
+            for (var n = this.root; n;) {
+                p = n;
+                if (key < n.key)
+                    n = n.left;
+                else
+                    n = n.right;
+            }
+            node.parent = p;
+            if (!p)
+                this.root = node;
+            else if (key < p.key)
+                p.left = node;
+            else
+                p.right = node;
+        };
+        /**
+         * Search the item relatives to the key.
+         * @param key {Number} The key to find.
+         * @param [node = root] {BSNode} The node from which start the search.
+         * @return {*} The item found or undefined if there isn't the key in the tree.
+         */
+        BSTree.prototype.search = function (key, node) {
+            if (node === void 0) { node = null; }
+            node = node || this.root;
+            while (node && key !== node.key)
+                if (key < node.key)
+                    node = node.left;
+                else
+                    node = node.right;
+            if (node)
+                return node.item;
+            return undefined;
+        };
+        /**
+         * Get the item relatives to the minimum key stored in the tree.
+         * @param [node = root] {Node} The node from which start the search.
+         * @return {BSNode} The node found.
+         */
+        BSTree.prototype.minimum = function (node) {
+            if (node === void 0) { node = null; }
+            node = node || this.root;
+            while (node && node.left)
+                node = node.left;
+            return node;
+        };
+        /**
+         * Get the item relatives to the maximum key stored in the tree.
+         * @param [node = root] {Node} The node from which start the search.
+         * @return {BSNode} The node found.
+         */
+        BSTree.prototype.maximum = function (node) {
+            if (node === void 0) { node = null; }
+            node = node || this.root;
+            while (node && node.right)
+                node = node.right;
+            return node;
+        };
+        /**
+         * Get the node with the key next to the param node key.
+         * @param node {BSNode} The node of which search the successor.
+         * @return {BSNode} The node found.
+         */
+        BSTree.prototype.successor = function (node) {
+            if (node.right)
+                return this.minimum(node.right);
+            var parent = node.parent;
+            while (parent && node === parent.right) {
+                node = parent;
+                parent = parent.parent;
+            }
+            return parent;
+        };
+        /**
+         * Get the node with the key previous to the param node key.
+         * @param node {BSNode} The node of which search the predecessor.
+         * @return {BSNode} The node found.
+         */
+        BSTree.prototype.predecessor = function (node) {
+            if (node.left)
+                return this.maximum(node.left);
+            var parent = node.parent;
+            while (parent && node === parent.left) {
+                node = parent;
+                parent = parent.parent;
+            }
+            return parent;
+        };
+        /**
+         * Delete the node from the tree.
+         * @param node {BSNode} The node to delete.
+         * @return {void}
+         */
+        BSTree.prototype.deleteNode = function (node) {
+            if (!node.left && !node.right) {
+                if (node === this.root)
+                    this.root = null;
+                else if (node.parent.left === node)
+                    node.parent.left = null;
+                else
+                    node.parent.right = null;
+            }
+            else if (node.left && node.right) {
+                var next = this.successor(node);
+                node.key = next.key;
+                node.item = next.item;
+                if (next.parent.left === next)
+                    next.parent.left = null;
+                else
+                    next.parent.right = null;
+            }
+            else {
+                if (node.right) {
+                    if (node === this.root) {
+                        this.root = node.right;
+                        node.right.parent = null;
+                    }
+                    else {
+                        node.parent.right = node.right;
+                        node.right.parent = node.parent;
+                    }
+                }
+                else {
+                    if (node === this.root) {
+                        this.root = node.left;
+                        node.left.parent = null;
+                    }
+                    else {
+                        node.parent.left = node.left;
+                        node.left.parent = node.parent;
+                    }
+                }
+            }
+        };
+        return BSTree;
+    }(ds.Aggregate));
+    ds.BSTree = BSTree;
+})(ds || (ds = {}));
+/**
+ * Created by Stefano on 06/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+var ds;
+(function (ds) {
+    var BSTreeIterator = /** @class */ (function () {
+        /**
+         * Class that implements the iterator for a binary search tree.
+         * @param aggregate {BSTree} The aggregate to scan.
+         * @constructor
+         */
+        function BSTreeIterator(aggregate) {
+            this.aggregate = aggregate;
+            this.pointer = null;
+        }
+        /**
+         * @inheritDoc
+         */
+        BSTreeIterator.prototype.first = function () {
+            this.pointer = this.aggregate.minimum();
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        BSTreeIterator.prototype.next = function () {
+            this.pointer = this.aggregate.successor(this.pointer);
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        BSTreeIterator.prototype.last = function () {
+            this.pointer = this.aggregate.maximum();
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        BSTreeIterator.prototype.previous = function () {
+            this.pointer = this.aggregate.predecessor(this.pointer);
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        BSTreeIterator.prototype.isDone = function () {
+            return !this.pointer;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        BSTreeIterator.prototype.getItem = function () {
+            return this.pointer.item;
+        };
+        ;
+        /**
+         * Return the node stored at the position pointed by the iterator.
+         * @abstract
+         * @return {BSNode|null} The node stored or null if it's out of the bounds.
+         */
+        BSTreeIterator.prototype.getNode = function () {
+            return this.pointer;
+        };
+        ;
+        return BSTreeIterator;
+    }());
+    ds.BSTreeIterator = BSTreeIterator;
+})(ds || (ds = {}));
+/**
+ * Created by Stefano on 31/03/14.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+var ds;
+(function (ds) {
+    var CircularBuffer = /** @class */ (function (_super) {
+        __extends(CircularBuffer, _super);
+        /**
+         * Class for managing a circular buffer.
+         * @param size {Number} The size of the buffer.
+         * @constructor
+         */
+        function CircularBuffer(size) {
+            var _this = _super.call(this) || this;
+            /**
+             * The index of the position of the head of the buffer.
+             * @type {number}
+             */
+            _this.head = 0;
+            /**
+             * The index of the position of the tail of the buffer.
+             * @type {number}
+             */
+            _this.tail = 0;
+            /**
+             * The items stored in the buffer.
+             * @type {Array<*>}
+             */
+            _this.items = [];
+            /**
+             * Is true if buffer is empty, false otherwise.
+             * @type {boolean}
+             */
+            _this.empty = true;
+            /**
+             * Is false if buffer is full, false otherwise.
+             * @type {boolean}
+             */
+            _this.full = false;
+            _this.size = size;
+            _this.items.length = size;
+            return _this;
+        }
+        /**
+         * @inheritDoc
+         */
+        CircularBuffer.prototype.getIterator = function () {
+            return new ds.CircularBufferIterator(this);
+        };
+        ;
+        /**
+         * Write the item at the head of the buffer.
+         * @param item {*} The item to write.
+         * @return {void}
+         */
+        CircularBuffer.prototype.write = function (item) {
+            this.empty = false;
+            if (this.full)
+                //if buffer is full tail must be set forward
+                this.tail = (this.tail + 1) % this.size;
+            this.items[this.head] = item;
+            //head is set forward
+            this.head = (this.head + 1) % this.size;
+            if (this.tail === this.head)
+                this.full = true;
+        };
+        ;
+        /**
+         * Free the buffer between indexes from and to.
+         * If from > to, positions between from and the end of the buffer and between the start and to will be free.
+         * @param from {Number} The index from which start to free (inclusive index)
+         * @param to {Number} The index where stop to free (exclusive index)
+         * @return {void}
+         */
+        CircularBuffer.prototype.free = function (from, to) {
+            if (from < 0)
+                from = 0;
+            if (from > this.size - 1)
+                from = this.size - 1;
+            if (to < 0)
+                to = 0;
+            if (to > this.size - 1)
+                to = this.size - 1;
+            //if from < to then will be free allocation between from and to
+            //otherwise will be free allocations between from and the end and between the start and to
+            for (var i = from; i < to; i = (i + 1) % this.size)
+                delete this.items[i];
+            //adjust the position of the tail and of the head
+            if (this.tail > from - 1 || this.tail < to)
+                if (this.tail < this.head) {
+                    this.tail = (from - 1) % this.size;
+                }
+                else {
+                    this.tail = to;
+                }
+            if (this.head > from || this.head < to)
+                if (this.tail < this.head) {
+                    this.head = to;
+                }
+                else {
+                    this.head = from;
+                }
+            //check if something is free
+            if (from !== to)
+                this.full = false;
+            //free could make buffer empty
+            for (var j = 0; j < this.size; j++)
+                if (this.items[j] !== undefined) {
+                    this.empty = false;
+                    return;
+                }
+            this.empty = true;
+        };
+        ;
+        /**
+         * Free all the buffer.
+         * @return {void}
+         */
+        CircularBuffer.prototype.freeAll = function () {
+            for (var i = 0; i < this.size; i++)
+                delete this.items[i];
+            this.empty = true;
+            this.head = 0;
+            this.tail = 0;
+        };
+        ;
+        /**
+         * Read the item stored at the position index.
+         * @param index {Number} The position of the item to read.
+         * @return {*} The item read.
+         */
+        CircularBuffer.prototype.read = function (index) {
+            return this.items[index % this.size];
+        };
+        ;
+        /**
+         * Return true if the buffer is empty, false otherwise.
+         * @return {boolean}
+         */
+        CircularBuffer.prototype.isEmpty = function () {
+            return this.empty;
+        };
+        ;
+        /**
+         * Return true if the buffer is full, false otherwise.
+         * @return {boolean}
+         */
+        CircularBuffer.prototype.isFull = function () {
+            return this.full;
+        };
+        ;
+        /**
+         * Clones the circular buffer into a new circular buffer.
+         * @return {CircularBuffer} The circular buffer cloned from this circular buffer.
+         */
+        CircularBuffer.prototype.clone = function () {
+            var buffer = new CircularBuffer(this.size);
+            buffer.head = this.head;
+            buffer.tail = this.tail;
+            for (var i = 0; i < this.items.length; i++)
+                buffer.items[i] = this.items[i];
+            buffer.empty = this.empty;
+            buffer.full = this.full;
+            return buffer;
+        };
+        ;
+        /**
+         * Resize the buffer.
+         * @param size {number} The new size of the buffer.
+         * @return {void}
+         */
+        CircularBuffer.prototype.resize = function (size) {
+            if (this.size < size) {
+                if (this.head < this.tail + 1) {
+                    for (var i = 0; i < this.head; i++) {
+                        this.items[(i + this.size) % size] = this.items[i];
+                        delete this.items[i];
+                    }
+                    this.head = (this.head + this.size) % size;
+                }
+            }
+            else if (this.size > size) {
+                if (this.head < this.tail + 1) {
+                    //check if the tail is after the size
+                    var start = size;
+                    if (this.tail > size - 1) {
+                        start = this.tail;
+                        this.tail = 0;
+                    }
+                    //the items stored must be shift to a valid position
+                    var step = this.size - start;
+                    for (var j = this.head - step - 1; j > start - 1 || j < this.head - step; j--) {
+                        this.items[(j + step) % this.size] = this.items[j];
+                        if (!j)
+                            j = this.size;
+                    }
+                    this.head = (this.head + step) % this.size;
+                }
+            }
+            this.size = size;
+        };
+        ;
+        return CircularBuffer;
+    }(ds.Aggregate));
+    ds.CircularBuffer = CircularBuffer;
+})(ds || (ds = {}));
+/**
+ * Created by Stefano on 06/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+var ds;
+(function (ds) {
+    var CircularBufferIterator = /** @class */ (function () {
+        /**
+         * Class that implements the iterator for a circular buffer.
+         * @param aggregate {CircularBuffer} The aggregate to scan.
+         * @constructor
+         */
+        function CircularBufferIterator(aggregate) {
+            /**
+             * The pointer to the position.
+             * @type {number}
+             */
+            this.pointer = -1;
+            /**
+             * Discriminator for full buffer
+             * @type {bool}
+             */
+            this.start = true;
+            this.aggregate = aggregate;
+        }
+        /**
+         * @inheritDoc
+         */
+        CircularBufferIterator.prototype.first = function () {
+            this.pointer = this.aggregate.tail;
+            this.start = true;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        CircularBufferIterator.prototype.next = function () {
+            this.pointer = (this.pointer + 1) % this.aggregate.size;
+            this.start = false;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        CircularBufferIterator.prototype.last = function () {
+            this.pointer = (this.aggregate.head - 1) % this.aggregate.size;
+            this.start = true;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        CircularBufferIterator.prototype.previous = function () {
+            this.pointer = (this.pointer - 1) % this.aggregate.size;
+            this.start = false;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        CircularBufferIterator.prototype.isDone = function () {
+            var bl = (this.pointer === this.aggregate.head && !this.start) || (this.pointer === this.aggregate.tail - 1) || this.aggregate.isEmpty();
+            return bl;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        CircularBufferIterator.prototype.getItem = function () {
+            return this.aggregate.read(this.pointer);
+        };
+        ;
+        return CircularBufferIterator;
+    }());
+    ds.CircularBufferIterator = CircularBufferIterator;
+})(ds || (ds = {}));
+/**
+ * Created by Stefano on 31/03/14.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+var ds;
+(function (ds) {
+    var DLLNode = /** @class */ (function () {
+        /**
+         * The single node of the list.
+         * @param item {*} The item to store in the node.
+         * @constructor
+         */
+        function DLLNode(item) {
+            /**
+             * The next node. It's null if there's no a next node.
+             * @type {DLLNode|null}
+             */
+            this.next = null;
+            /**
+             * The previous node. It's null if there's no a previous node.
+             * @type {DLLNode|null}
+             */
+            this.previous = null;
+            this.item = item;
+        }
+        return DLLNode;
+    }());
+    ds.DLLNode = DLLNode;
+    var DoubleLinkedList = /** @class */ (function (_super) {
+        __extends(DoubleLinkedList, _super);
+        /**
+         * Class for managing a double linked list.
+         * @param {...*} [args] The items for initializing the list.
+         * @constructor
+         */
+        function DoubleLinkedList() {
+            var args = [];
+            for (var _i = 0; _i < arguments.length; _i++) {
+                args[_i] = arguments[_i];
+            }
+            var _this = _super.call(this) || this;
+            /**
+             * The first node of the list.
+             * @type {DLLNode|null}
+             */
+            _this.first = null;
+            /**
+             * The last node of the list.
+             * @type {DLLNode|null}
+             */
+            _this.last = null;
+            /**
+             * The length of the list.
+             * @type {number}
+             */
+            _this.length = 0;
+            if (args && args.length == 1 && args[0] instanceof Array) {
+                //builds the list from the range passed from the constructor
+                _this.fromArray(args[0]);
+            }
+            else {
+                //builds the list from the parameters of the constructor
+                _this.fromArray(args);
+            }
+            return _this;
+        }
+        /**
+         * @inheritDoc
+         */
+        DoubleLinkedList.prototype.getIterator = function () {
+            return new ds.DoubleLinkedListIterator(this);
+        };
+        ;
+        /**
+         * Add an item at the head of the list.
+         * @param item {*} The item to add.
+         * @return {void}
+         */
+        DoubleLinkedList.prototype.pushFront = function (item) {
+            var node = new DLLNode(item);
+            node.next = this.first;
+            this.first = node;
+            //link the next node to the new node
+            if (node.next)
+                node.next.previous = node;
+            else
+                this.last = node;
+            this.length++;
+        };
+        ;
+        /**
+         * Add an item at the tail of the list.
+         * @param item {*} The item to add.
+         * @return {void}
+         */
+        DoubleLinkedList.prototype.pushBack = function (item) {
+            var node = new DLLNode(item);
+            node.previous = this.last;
+            this.last = node;
+            //link the previous node to the new node
+            if (node.previous)
+                node.previous.next = node;
+            else
+                this.first = node;
+            this.length++;
+        };
+        ;
+        /**
+         * Remove the first item of the list.
+         * @return {*} The item removed. It's undefined if the list is empty.
+         */
+        DoubleLinkedList.prototype.popFront = function () {
+            if (this.length) {
+                var node = this.first;
+                this.first = node.next;
+                if (node.next)
+                    node.next.previous = null;
+                this.length--;
+                node.next = null;
+                return node.item;
+            }
+            return undefined;
+        };
+        ;
+        /**
+         * Remove the last item of the list.
+         * @return {*} The item removed. It's undefined if the list is empty.
+         */
+        DoubleLinkedList.prototype.popBack = function () {
+            if (this.length) {
+                var node = this.last;
+                this.last = node.previous;
+                if (node.previous)
+                    node.previous.next = null;
+                this.length--;
+                node.previous = null;
+                return node.item;
+            }
+            return undefined;
+        };
+        ;
+        /**
+         * Removes the first times items of the list.
+         * @param times {number} The number of times to repeat the popFront method.
+         * @return {*} The item removed. It's undefined if the list is empty.
+         */
+        DoubleLinkedList.prototype.multiPopFront = function (times) {
+            var result = [];
+            for (var i = 0; i < times && this.length; i++)
+                result.push(this.popFront());
+            return result;
+        };
+        ;
+        /**
+         * Removes the last times items of the list.
+         * @param times {number} The number of times to repeat the popBack method.
+         * @return {*} The items removed.
+         */
+        DoubleLinkedList.prototype.multiPopBack = function (times) {
+            var result = [];
+            for (var i = 0; i < times && this.length; i++)
+                result.push(this.popBack());
+            return result;
+        };
+        ;
+        /**
+         * Returns the first item of the list without remove it.
+         * @return {*} The item at the top of the list. It's undefined if the list is empty.
+         */
+        DoubleLinkedList.prototype.peek = function () {
+            if (!this.length)
+                return undefined;
+            return this.first.item;
+        };
+        ;
+        /**
+         * Add the item at the index position.
+         * @param item {*} The item to add.
+         * @param index {number} The position where to add the item. If index is negative, the item won't be added.
+         * @return {void}
+         */
+        DoubleLinkedList.prototype.addAt = function (item, index) {
+            if (index < 0)
+                return;
+            if (!index) {
+                this.pushFront(item);
+                return;
+            }
+            if (index === this.length) {
+                this.pushBack(item);
+                return;
+            }
+            var node = this.first;
+            if (!node && index > 0)
+                this.pushBack(undefined);
+            for (var i = 0; i < index - 1; i++, node = node.next) {
+                if (node === this.last)
+                    this.pushBack(undefined);
+            }
+            if (node === this.last)
+                this.pushBack(item);
+            else if (node === this.first)
+                this.pushFront(item);
+            else {
+                var newNode = new DLLNode(item);
+                newNode.next = node.next;
+                newNode.previous = node;
+                node.next = newNode;
+                if (newNode.next)
+                    newNode.next.previous = newNode;
+                this.length++;
+            }
+        };
+        ;
+        /**
+         * Remove the item at the position index.
+         * @param index {Number} The position of the item to remove.
+         * @return {*} The item stored at the position index. It's undefined if the index is out of bounds.
+         */
+        DoubleLinkedList.prototype.removeAt = function (index) {
+            if (index < 0 || index > this.length - 1)
+                return undefined;
+            if (index === 0)
+                return this.popFront();
+            if (index === this.length - 1)
+                return this.popBack();
+            var node = this.first;
+            for (; index > 0; index--)
+                node = node.next;
+            //now node is the node to remove
+            node.previous.next = node.next;
+            node.next.previous = node.previous;
+            node.next = null;
+            node.previous = null;
+            this.length--;
+            return node.item;
+        };
+        ;
+        /**
+         * Removes the item from the list.
+         * @param item {*} The item to remove.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {void}
+         */
+        DoubleLinkedList.prototype.remove = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var node = this.first;
+            var previous = null;
+            while (node) {
+                if (callback(node.item)) {
+                    if (node === this.first)
+                        this.first = node.next;
+                    if (node === this.last)
+                        this.last = previous;
+                    if (previous) {
+                        previous.next = node.next;
+                        if (node.next)
+                            node.next.previous = previous;
+                    }
+                    return;
+                }
+                previous = node;
+                node = node.next;
+            }
+        };
+        ;
+        /**
+         * Removes all the item from the list.
+         * @param item {*} The item to remove.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {void}
+         */
+        DoubleLinkedList.prototype.removeAll = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var node = this.first;
+            var previous = null;
+            while (node) {
+                if (callback(node.item)) {
+                    if (node === this.first)
+                        this.first = node.next;
+                    if (node === this.last)
+                        this.last = previous;
+                    if (previous) {
+                        previous.next = node.next;
+                        if (node.next)
+                            node.next.previous = previous;
+                    }
+                }
+                else
+                    previous = node;
+                node = node.next;
+            }
+        };
+        ;
+        /**
+         * Removes all the items stored from the from position to the to position.
+         * If from > to, the method will remove all the items up to the end.
+         * @param from {number} The position where start to remove the items. The from position is included.
+         * @param to {number} The position where stop to remove the items. The to position is included.
+         * @return {Array<*>} The items removed.
+         */
+        DoubleLinkedList.prototype.removeSegment = function (from, to) {
+            var result = [];
+            if (to > -1 && from < this.length) {
+                if (from === 0)
+                    return this.multiPopFront(to + 1);
+                if (to === this.length - 1 || from > to)
+                    return this.multiPopBack(Math.max(to - from, this.length - from)).reverse();
+                var node = this.first;
+                for (var i = 0; i < from - 1; i++)
+                    node = node.next;
+                //now node is the node before the node to remove
+                //node to remove
+                var next = node.next;
+                for (var j = from; j < to + 1 && j < this.length; j++) {
+                    result.push(next.item);
+                    next = next.next;
+                }
+                this.length -= Math.min(to - from + 1, this.length - from);
+                node.next = next;
+                next.previous = node;
+            }
+            return result;
+        };
+        ;
+        /**
+         * Change the item stored in the index position. If the index is out of bound, the node won't be updated.
+         * @param index {number} The position of the node to modify.
+         * @param item {*} The new item stored in the node.
+         * @return {void}
+         */
+        DoubleLinkedList.prototype.modifyAt = function (index, item) {
+            var node = this.getNode(index);
+            if (node)
+                node.item = item;
+        };
+        ;
+        /**
+         * Removes all the items stored in the list.
+         * @return {void}
+         */
+        DoubleLinkedList.prototype.clear = function () {
+            this.first = null;
+            this.last = null;
+            this.length = 0;
+        };
+        ;
+        /**
+         * Checks if the list contains an item that satisfy the condition represented by the callback function.
+         * @param item {*} The item to find.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {boolean} True if the list contains the item that satisfy the condition, false otherwise.
+         */
+        DoubleLinkedList.prototype.contains = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var i = 0;
+            var node = this.first;
+            while (i < this.length && !callback(node.item)) {
+                i++;
+                node = node.next;
+            }
+            return i < this.length;
+        };
+        ;
+        /**
+         * Executes the callback function for each item of the stack.
+         * This method modifies the list so if you don't need to modify it you must return the same item of the array.
+         * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+         * @return {void}
+         */
+        DoubleLinkedList.prototype.execute = function (callback) {
+            var node = this.first;
+            while (node) {
+                node.item = callback(node.item);
+                node = node.next;
+            }
+        };
+        ;
+        /**
+         * Delete the node from the list.
+         * @param node {DLLNode} The node to delete.
+         * @return {void}
+         */
+        DoubleLinkedList.prototype.deleteNode = function (node) {
+            if (node === this.first) {
+                this.popFront();
+                return;
+            }
+            if (node === this.last) {
+                this.popBack();
+                return;
+            }
+            node.previous.next = node.next;
+            node.next.previous = node.previous;
+            this.length--;
+        };
+        ;
+        /**
+         * Get the node at the position index relative from the node.
+         * @param index {Number} The index, relative to the node, of the node to return.
+         * @param [node = first] {DLLNode} The node from which start the search.
+         * @return {DLLNode} The node at the position index.
+         */
+        DoubleLinkedList.prototype.getNode = function (index, node) {
+            if (index < 0 || index > this.length - 1)
+                return undefined;
+            var m = Math.floor(this.length / 2);
+            //if the index is less than the middle, the search start from the head of the list, otherwise from the tail of the list
+            if (index < m || node) {
+                node = node || this.first;
+                for (; index > 0; index--)
+                    node = node.next;
+            }
+            else
+                for (index = this.length - index - 1, node = this.last; index > 0; index--)
+                    node = node.previous;
+            return node;
+        };
+        ;
+        /**
+         * Get the item at the position index.
+         * @param index {Number} The position of the item.
+         * @return {*}. It's undefined if index isn't in the queue bounds.
+         */
+        DoubleLinkedList.prototype.getItem = function (index) {
+            if (index < 0 || index > this.length - 1)
+                return undefined;
+            var node;
+            var m = Math.floor(this.length / 2);
+            if (index < m)
+                for (node = this.first; index > 0; index--)
+                    node = node.next;
+            else
+                for (index = this.length - index - 1, node = this.last; index > 0; index--)
+                    node = node.previous;
+            return node.item;
+        };
+        ;
+        /**
+         * Sort the list.
+         * @param [callback = function(item){return(item);}] {function} The function invoked in order to get the value for the evaluation of the sort criteria.
+         * @example
+         * callback = function(item) {return -item.key;}
+         * This function callback will return the opposite of the attribute key of the item. In this case the list will be sorted in descending order.
+         * @return {void}
+         */
+        DoubleLinkedList.prototype.sort = function (callback) {
+            if (!callback)
+                callback = function (item) {
+                    return item;
+                };
+            var outerThis = this;
+            function partialSort(from, to, fromNode, toNode, callback) {
+                if (from < to) {
+                    var m = Math.floor((from + to) / 2);
+                    var mNode = outerThis.getNode(m - from, fromNode);
+                    partialSort(from, m, fromNode, mNode, callback);
+                    partialSort(m + 1, to, mNode.next, toNode, callback);
+                    merge(from, m, to, fromNode, callback);
+                }
+            }
+            function merge(from, m, to, fromNode, callback) {
+                var left = [];
+                var right = [];
+                var node = fromNode;
+                for (var i = 0; i < m - from + 1; i++, node = node.next)
+                    left[i] = node.item;
+                for (var j = 0; j < to - m; j++, node = node.next)
+                    right[j] = node.item;
+                var x = 0, y = 0;
+                for (var k = from; k < to + 1; k++, fromNode = fromNode.next) {
+                    if (y > to - m - 1 || (callback(left[x]) <= callback(right[y]) && x < m - from + 1)) {
+                        fromNode.item = left[x];
+                        x++;
+                    }
+                    else {
+                        fromNode.item = right[y];
+                        y++;
+                    }
+                }
+            }
+            partialSort(0, this.length - 1, this.first, this.last, callback);
+        };
+        ;
+        /**
+         * Transform the list into an array.
+         * @return {Array<*>} The array built.
+         */
+        DoubleLinkedList.prototype.toArray = function () {
+            var array = [];
+            for (var node = this.first, i = 0; node; node = node.next, i++)
+                array[i] = node.item;
+            return array;
+        };
+        ;
+        /**
+         * Returns the length of the list.
+         * @return {Number} The length of the list.
+         */
+        DoubleLinkedList.prototype.getLength = function () {
+            return this.length;
+        };
+        ;
+        /**
+         * Build the list from the array.
+         * @param array {Array<*>} The array from which build the list.
+         * @return {void}
+         */
+        DoubleLinkedList.prototype.fromArray = function (array) {
+            var node = this.first;
+            for (var i = 0; i < Math.min(this.length, array.length); i++, node = node.next)
+                node.item = array[i];
+            if (this.length < array.length)
+                for (var j = this.length; j < array.length; j++)
+                    this.pushBack(array[j]);
+            else
+                for (var k = array.length; k < this.length;)
+                    this.popBack();
+        };
+        ;
+        /**
+         * Return the items that satisfy the condition determined by the callback.
+         * @param callback {function} The function that implements the condition.
+         * @return {Array<Object>} The array that contains the items that satisfy the condition.
+         */
+        DoubleLinkedList.prototype.filter = function (callback) {
+            var result = [];
+            for (var node = this.first; node; node = node.next) {
+                if (callback(node.item))
+                    result.push(node.item);
+            }
+            return result;
+        };
+        ;
+        /**
+         * Reverse the list. This method reverses only the items, not the nodes.
+         * @return {void}
+         */
+        DoubleLinkedList.prototype.reverse = function () {
+            for (var start = this.first, end = this.last; start !== end && start.previous !== end; start = start.next, end = end.previous) {
+                var item = start.item;
+                start.item = end.item;
+                end.item = item;
+            }
+        };
+        ;
+        /**
+         * Checks if the list is empty.
+         * @return {boolean} True if the list is empty, false otherwise.
+         */
+        DoubleLinkedList.prototype.isEmpty = function () {
+            return !this.length;
+        };
+        ;
+        /**
+         * Returns the first position of the item in the list.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The first position of the item.
+         */
+        DoubleLinkedList.prototype.indexOf = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var i = 0;
+            var node = this.first;
+            while (node) {
+                if (callback(node.item))
+                    return i;
+                i++;
+                node = node.next;
+            }
+            return -1;
+        };
+        ;
+        /**
+         * Returns the last position of the item in the list.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The last position of the item.
+         */
+        DoubleLinkedList.prototype.lastIndexOf = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var i = this.length - 1;
+            var node = this.last;
+            while (node) {
+                if (callback(node.item))
+                    return i;
+                i--;
+                node = node.previous;
+            }
+            return -1;
+        };
+        ;
+        /**
+         * Returns all the position in which the item has been found in the list.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {Array<number>} The positions in which the item has been found.
+         */
+        DoubleLinkedList.prototype.allIndexesOf = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var i = 0;
+            var node = this.first;
+            var indexes = [];
+            while (node) {
+                if (callback(node.item))
+                    indexes.push(i);
+                i++;
+                node = node.next;
+            }
+            return indexes;
+        };
+        ;
+        /**
+         * Add the list at the end of this list.
+         * @param list {DoubleLinkedList} The list to join.
+         * @return {void}
+         */
+        DoubleLinkedList.prototype.join = function (list) {
+            if (this.last)
+                this.last.next = list.first;
+            else
+                this.first = list.first;
+            if (list.first)
+                list.first.previous = this.last;
+            this.last = list.last;
+            this.length += list.length;
+        };
+        ;
+        /**
+         * Divides the list at the index position. The node at the index position is the first new node of the list.
+         * @param index {number} The position where to divide the list.
+         * @return {DoubleLinkedList} The list formed by the nodes from the index position then. If the index is out of bound, the list will be empty.
+         */
+        DoubleLinkedList.prototype.divide = function (index) {
+            var list = new DoubleLinkedList();
+            if (index > -1 && index < this.length) {
+                var node = this.first;
+                var previous = null;
+                for (var i = 0; i < index; i++) {
+                    previous = node;
+                    node = node.next;
+                }
+                if (node === this.first) {
+                    list.first = this.first;
+                    list.last = this.last;
+                    this.first = null;
+                    this.last = null;
+                }
+                else {
+                    list.first = node;
+                    list.last = this.last;
+                    this.last = previous;
+                    previous.next = null;
+                    node.previous = null;
+                }
+                list.length = this.length - index;
+                this.length = index;
+            }
+            return list;
+        };
+        ;
+        /**
+         * Clones the list into a new list.
+         * @return {DoubleLinkedList} The list cloned from this list.
+         */
+        DoubleLinkedList.prototype.clone = function () {
+            var list = new DoubleLinkedList();
+            var node = this.first;
+            for (var i = 0; i < this.length; i++, node = node.next) {
+                var item = node.item;
+                if (item.clone)
+                    list.pushBack(item.clone());
+                else
+                    list.pushBack(item);
+            }
+            return list;
+        };
+        ;
+        /**
+         * Clones the list into a new list without cloning duplicated items.
+         * @return {DoubleLinkedList} The list cloned from this list.
+         */
+        DoubleLinkedList.prototype.cloneDistinct = function () {
+            var list = new DoubleLinkedList();
+            var node = this.first;
+            for (var i = 0; i < this.length; i++, node = node.next)
+                if (!list.contains(node.item)) {
+                    var item = node.item;
+                    if (item.cloneDistinct)
+                        list.pushBack(item.cloneDistinct());
+                    else if (item.clone)
+                        list.pushBack(item.clone());
+                    else
+                        list.pushBack(item);
+                }
+            return list;
+        };
+        ;
+        /**
+         * Splits the list into lists of desired size.
+         * @param size {number} The size of the lists.
+         * @return {Array<DoubleLinkedList>} The lists created by splitting the list.
+         */
+        DoubleLinkedList.prototype.split = function (size) {
+            var length = this.length;
+            var lists = [this];
+            for (var i = size; i < length; i += size)
+                lists.push(lists[lists.length - 1].divide(size));
+            return lists;
+        };
+        ;
+        /**
+         * Returns the number of items that satisfy the represented by the callback function.
+         * @param callback {function} The condition to satisfy.
+         * @return {number} The number of items that satisfy the condition.
+         */
+        DoubleLinkedList.prototype.count = function (callback) {
+            var count = 0;
+            var node = this.first;
+            while (node) {
+                if (callback(node.item))
+                    count++;
+                node = node.next;
+            }
+            return count;
+        };
+        ;
+        return DoubleLinkedList;
+    }(ds.Aggregate));
+    ds.DoubleLinkedList = DoubleLinkedList;
+})(ds || (ds = {}));
+/**
+ * Created by Stefano on 04/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+var ds;
+(function (ds) {
+    var DoubleLinkedListIterator = /** @class */ (function () {
+        /**
+         * Class that implements the iterator for a double linked list.
+         * @param aggregate {DoubleLinkedList} The aggregate to scan.
+         * @constructor
+         */
+        function DoubleLinkedListIterator(aggregate) {
+            /**
+             * The pointer to the position.
+             * @type {Node|null}
+             */
+            this.pointer = null;
+            this.aggregate = aggregate;
+        }
+        /**
+         * @inheritDoc
+         */
+        DoubleLinkedListIterator.prototype.first = function () {
+            this.pointer = this.aggregate.first;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        DoubleLinkedListIterator.prototype.next = function () {
+            this.pointer = this.pointer.next;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        DoubleLinkedListIterator.prototype.last = function () {
+            this.pointer = this.aggregate.last;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        DoubleLinkedListIterator.prototype.previous = function () {
+            this.pointer = this.pointer.previous;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        DoubleLinkedListIterator.prototype.isDone = function () {
+            return !this.pointer;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        DoubleLinkedListIterator.prototype.getItem = function () {
+            return this.pointer.item;
+        };
+        ;
+        /**
+         * Return the node stored at the position pointed by the iterator.
+         * @abstract
+         * @return {Node|null} The node stored or null if it's out of the bounds.
+         */
+        DoubleLinkedListIterator.prototype.getNode = function () {
+            return this.pointer;
+        };
+        ;
+        return DoubleLinkedListIterator;
+    }());
+    ds.DoubleLinkedListIterator = DoubleLinkedListIterator;
+})(ds || (ds = {}));
+/**
+ * Created by Stefano on 05/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+var ds;
+(function (ds) {
+    var HashTable = /** @class */ (function () {
+        /**
+         * Class for managing an hash table.
+         * @param size {number} The size of the table.
+         * @constructor
+         */
+        function HashTable(size) {
+            this.p = 1000;
+            this.a = Math.floor(Math.random() * this.p);
+            this.b = Math.floor(Math.random() * this.p);
+            /**
+             * The items stored in the hash table.
+             * @type {Array<DoubleLinkedList>}
+             */
+            this.items = [];
+            /**
+             * The number of keys stored in the hash table.
+             * @type {number}
+             */
+            this.keyLength = 0;
+            this.size = size;
+            this.p = 1000;
+            this.a = Math.floor(Math.random() * this.p);
+            this.b = Math.floor(Math.random() * this.p);
+            this.hash = function (key) {
+                return ((this.a * key + this.b) % this.p) % this.size;
+            };
+            this.items = [];
+            this.keyLength = 0;
+            this.clear();
+        }
+        /**
+         * Stores the item with its key.
+         * @param key {number} The key relatives to the item.
+         * @param item {*} The item to store.
+         */
+        HashTable.prototype.insert = function (key, item) {
+            this.keyLength++;
+            this.items[this.hash(key)].pushBack({ key: key, item: item });
+        };
+        ;
+        /**
+         * Deletes the first item relatives to the key value.
+         * @param key {number} The key to delete.
+         * @return {void}
+         */
+        HashTable.prototype.deleteKey = function (key) {
+            var list = this.items[this.hash(key)];
+            var it = list.getIterator();
+            for (it.first(); !it.isDone() && it.getItem().key !== key;)
+                it.next();
+            if (!it.isDone()) {
+                list.deleteNode(it.getNode());
+                this.keyLength--;
+            }
+        };
+        ;
+        /**
+         * Deletes all the items relative to the key value.
+         * @param key {number} The key to delete.
+         * @return {void}
+         */
+        HashTable.prototype.deleteAllKey = function (key) {
+            var list = this.items[this.hash(key)];
+            var it = list.getIterator();
+            var keysRemoved = 0;
+            for (it.first(); !it.isDone(); it.next())
+                if (it.getItem().key === key) {
+                    list.deleteNode(it.getNode());
+                    keysRemoved++;
+                }
+            this.keyLength -= keysRemoved;
+        };
+        ;
+        /**
+         * Searches the item relative to the key value.
+         * @param key {number} The key of the item to search.
+         * @return {*|undefined} The item found or undefined if the key does not exist.
+         */
+        HashTable.prototype.search = function (key) {
+            var list = this.items[this.hash(key)];
+            var it = list.getIterator();
+            for (it.first(); !it.isDone(); it.next())
+                if (it.getItem().key === key)
+                    return it.getItem().item;
+            return undefined;
+        };
+        ;
+        /**
+         * Checks if the hash table contains a key that satisfy the condition represented by the callback function.
+         * @param key {number} The key to find.
+         * @param [callback = function(k){return(k===key);}] The condition to satisfy. The callback must accept the current key to check.
+         * @return {boolean} True if the hash table contains the key that satisfy the condition, false otherwise.
+         */
+        HashTable.prototype.containsKey = function (key, callback) {
+            callback = callback || function (k) {
+                return k === key;
+            };
+            var list = this.items[this.hash(key)];
+            var it = list.getIterator();
+            for (it.first(); !it.isDone(); it.next())
+                if (callback(it.getItem().key))
+                    return true;
+            return false;
+        };
+        ;
+        /**
+         * Searches all the items relative to the key value.
+         * @param key {number} The key of the items to search.
+         * @return {Array.<*>} An array with the items found.
+         */
+        HashTable.prototype.searchAll = function (key) {
+            var list = this.items[this.hash(key)];
+            var it = list.getIterator();
+            var array = [];
+            for (it.first(); !it.isDone(); it.next())
+                if (it.getItem().key === key)
+                    array.push(it.getItem().item);
+            return array;
+        };
+        ;
+        /**
+         * Returns the keys stored in the hash table.
+         * @return {Array<number>} The keys stored in the table.
+         */
+        HashTable.prototype.getKeys = function () {
+            var keys = [];
+            for (var i = 0; i < this.size; i++) {
+                var it = this.items[i].getIterator();
+                for (it.first(); !it.isDone(); it.next())
+                    keys.push(it.getItem().key);
+            }
+            return keys;
+        };
+        ;
+        /**
+         * Returns the items stored in the hash table.
+         * @return {Array<*>} The items stored in the table.
+         */
+        HashTable.prototype.getItems = function () {
+            var items = [];
+            for (var i = 0; i < this.size; i++) {
+                var it = this.items[i].getIterator();
+                for (it.first(); !it.isDone(); it.next())
+                    items.push(it.getItem().item);
+            }
+            return items;
+        };
+        ;
+        /**
+         * Removes all the keys and the items stored in the hash table.
+         * @return {void}
+         */
+        HashTable.prototype.clear = function () {
+            this.items = [];
+            for (var i = 0; i < this.size; i++)
+                this.items[i] = new ds.DoubleLinkedList();
+            this.keyLength = 0;
+        };
+        ;
+        /**
+         * Returns the number of keys stored in the hash table.
+         * @return {number} The number of keys stored.
+         */
+        HashTable.prototype.getNumberOfKeys = function () {
+            return this.keyLength;
+        };
+        ;
+        /**
+         * Checks if the hash table is empty.
+         * @return {boolean} True if the hash table is empty, false otherwise.
+         */
+        HashTable.prototype.isEmpty = function () {
+            return !this.keyLength;
+        };
+        ;
+        /**
+         * Executes the callback function for each item of the hash table.
+         * This method modifies the hash table so if you don't need to modify it you must return the same item stored.
+         * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+         * @return {void}
+         */
+        HashTable.prototype.execute = function (callback) {
+            for (var i = 0; i < this.size; i++)
+                this.items[i].execute(callback);
+        };
+        ;
+        /**
+         * Returns the items that satisfy the condition determined by the callback.
+         * @param callback {function} The function that implements the condition.
+         * @return {Array<*>} The array that contains the items that satisfy the condition.
+         */
+        HashTable.prototype.filter = function (callback) {
+            var result = [];
+            for (var i = 0; i < this.size; i++)
+                result.concat(this.items[i].filter(callback));
+            return result;
+        };
+        ;
+        /**
+         * Returns the size of the hash table.
+         * @return {number} The size of the hash table.
+         */
+        HashTable.prototype.getSize = function () {
+            return this.size;
+        };
+        ;
+        /**
+         * Clones the hash table into a new hash table.
+         * @return {HashTable} The hash table cloned from this hash table.
+         */
+        HashTable.prototype.clone = function () {
+            var table = new HashTable(this.size);
+            for (var i = 0; i < this.size; i++)
+                for (var node = this.items[i].first; node; node = node.next)
+                    table.insert(node.key, node.item);
+            return table;
+        };
+        ;
+        return HashTable;
+    }());
+    ds.HashTable = HashTable;
+})(ds || (ds = {}));
+/**
+ * Created by Stefano on 31/03/14.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+var ds;
+(function (ds) {
+    var LLNode = /** @class */ (function () {
+        /**
+         * The single node of the list.
+         * @param item {*} The item to store in the node.
+         * @constructor
+         */
+        function LLNode(item) {
+            /**
+             * The next node. It's null if there's no a next node.
+             * @type {LLNode|null}
+             */
+            this.next = null;
+            this.item = item;
+        }
+        return LLNode;
+    }());
+    ds.LLNode = LLNode;
+    var LinkedList = /** @class */ (function (_super) {
+        __extends(LinkedList, _super);
+        /**
+         * Class for managing a linked list.
+         * @param {...*} [args] The items for initializing the list.
+         * @constructor
+         */
+        function LinkedList() {
+            var args = [];
+            for (var _i = 0; _i < arguments.length; _i++) {
+                args[_i] = arguments[_i];
+            }
+            var _this = _super.call(this) || this;
+            /**
+             * The first node of the list.
+             * @type {LLNode|null}
+             */
+            _this.first = null;
+            /**
+             * The last node of the list.
+             * @type {LLNode|null}
+             */
+            _this.last = null;
+            /**
+             * The length of the list.
+             * @type {number}
+             */
+            _this.length = 0;
+            _this.first = null;
+            _this.last = null;
+            _this.length = 0;
+            if (args && args.length == 1 && args[0] instanceof Array) {
+                //builds the list from the range passed from the constructor
+                _this.fromArray(args[0]);
+            }
+            else {
+                //builds the list from the parameters of the constructor
+                _this.fromArray(args);
+            }
+            return _this;
+        }
+        /**
+         * @inheritDoc
+         */
+        LinkedList.prototype.getIterator = function () {
+            return new ds.LinkedListIterator(this);
+        };
+        ;
+        /**
+         * Adds an item at the head of the list.
+         * @param item {*} The item to add.
+         * @return {void}
+         */
+        LinkedList.prototype.pushFront = function (item) {
+            var node = new LLNode(item);
+            node.next = this.first;
+            this.first = node;
+            if (!this.last)
+                this.last = node;
+            this.length++;
+        };
+        ;
+        /**
+         * Adds an item at the tail of the list.
+         * @param item {*} The item to add.
+         * @return {void}
+         */
+        LinkedList.prototype.pushBack = function (item) {
+            var node = new LLNode(item);
+            if (this.last)
+                this.last.next = node;
+            else
+                this.first = node;
+            this.last = node;
+            this.length++;
+        };
+        ;
+        /**
+         * Removes the first item of the list.
+         * @return {*} The item removed. It's undefined if the list is empty.
+         */
+        LinkedList.prototype.popFront = function () {
+            if (this.length) {
+                var node = this.first;
+                this.first = this.first.next;
+                this.length--;
+                node.next = null;
+                return node.item;
+            }
+            return undefined;
+        };
+        ;
+        /**
+         * Removes the last item of the list.
+         * @return {*} The item removed. It's undefined if the list is empty.
+         */
+        LinkedList.prototype.popBack = function () {
+            if (this.length) {
+                var node = this.last;
+                var next = this.first;
+                while (next.next && next.next.next) {
+                    next = next.next;
+                }
+                if (node === next)
+                    this.last = null;
+                else
+                    this.last = next;
+                next.next = null;
+                this.length--;
+                return node.item;
+            }
+            return undefined;
+        };
+        ;
+        /**
+         * Removes the first times items of the list.
+         * @param times {number} The number of times to repeat the popFront method.
+         * @return {*} The item removed. It's undefined if the list is empty.
+         */
+        LinkedList.prototype.multiPopFront = function (times) {
+            var result = [];
+            for (var i = 0; i < times && this.length; i++)
+                result.push(this.popFront());
+            return result;
+        };
+        ;
+        /**
+         * Removes the last times items of the list.
+         * @param times {number} The number of times to repeat the popBack method.
+         * @return {*} The items removed.
+         */
+        LinkedList.prototype.multiPopBack = function (times) {
+            var result = [];
+            for (var i = 0; i < times && this.length; i++)
+                result.push(this.popBack());
+            return result;
+        };
+        ;
+        /**
+         * Returns the first item of the list without remove it.
+         * @return {*} The item at the top of the list. It's undefined if the list is empty.
+         */
+        LinkedList.prototype.peek = function () {
+            if (!this.length)
+                return undefined;
+            return this.first.item;
+        };
+        ;
+        /**
+         * Add the item at the index position.
+         * @param item {*} The item to add.
+         * @param index {number} The position where to add the item. If index is negative, the item won't be added.
+         * @return {void}
+         */
+        LinkedList.prototype.addAt = function (item, index) {
+            if (index < 0)
+                return;
+            if (!index) {
+                this.pushFront(item);
+                return;
+            }
+            if (index === this.length) {
+                this.pushBack(item);
+                return;
+            }
+            var node = this.first;
+            if (!node && index > 0)
+                this.pushBack(undefined);
+            for (var i = 0; i < index - 1; i++, node = node.next) {
+                if (node === this.last)
+                    this.pushBack(undefined);
+            }
+            if (node === this.last)
+                this.pushBack(item);
+            else if (node === this.first)
+                this.pushFront(item);
+            else {
+                var newNode = new LLNode(item);
+                newNode.next = node.next;
+                node.next = newNode;
+                this.length++;
+            }
+        };
+        ;
+        /**
+         * Removes the item at the index position.
+         * @param index {number} The position of the item to remove.
+         * @return {*} The item stored at the position index. It's undefined if the index is out of bounds.
+         */
+        LinkedList.prototype.removeAt = function (index) {
+            if (index < 0 || index > this.length - 1)
+                return undefined;
+            if (index === 0)
+                return this.popFront();
+            if (index === this.length - 1)
+                return this.popBack();
+            var node = this.first;
+            for (; index > 1; index--)
+                node = node.next;
+            //now node is the node before the node to remove
+            //node to remove
+            var next = node.next;
+            node.next = next.next;
+            this.length--;
+            return next.item;
+        };
+        ;
+        /**
+         * Removes the item from the list.
+         * @param item {*} The item to remove.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {void}
+         */
+        LinkedList.prototype.remove = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var node = this.first;
+            var previous = null;
+            while (node) {
+                if (callback(node.item)) {
+                    if (node === this.first)
+                        this.first = node.next;
+                    if (node === this.last)
+                        this.last = previous;
+                    if (previous)
+                        previous.next = node.next;
+                    return;
+                }
+                previous = node;
+                node = node.next;
+            }
+        };
+        ;
+        /**
+         * Removes all the item from the list.
+         * @param item {*} The item to remove.
+         * @param [callback (item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {void}
+         */
+        LinkedList.prototype.removeAll = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var node = this.first;
+            var previous = null;
+            while (node) {
+                if (callback(node.item)) {
+                    if (node === this.first)
+                        this.first = node.next;
+                    if (node === this.last)
+                        this.last = previous;
+                    if (previous)
+                        previous.next = node.next;
+                }
+                else
+                    previous = node;
+                node = node.next;
+            }
+        };
+        ;
+        /**
+         * Removes all the items stored from the from position to the to position.
+         * If from > to, the method will remove all the items up to the end.
+         * @param from {number} The position where start to remove the items. The from position is included.
+         * @param to {number} The position where stop to remove the items. The to position is included.
+         * @return {Array<*>} The items removed.
+         */
+        LinkedList.prototype.removeSegment = function (from, to) {
+            var result = [];
+            if (to > -1 && from < this.length) {
+                if (from === 0)
+                    return this.multiPopFront(to + 1);
+                if (to === this.length - 1 || from > to)
+                    return this.multiPopBack(Math.max(to - from, this.length - from)).reverse();
+                var node = this.first;
+                for (var i = 0; i < from - 1; i++)
+                    node = node.next;
+                //now node is the node before the node to remove
+                //node to remove
+                var next = node.next;
+                for (var j = from; j < to + 1 && j < this.length; j++) {
+                    result.push(next.item);
+                    next = next.next;
+                }
+                this.length -= Math.min(to - from + 1, this.length - from);
+                node.next = next;
+            }
+            return result;
+        };
+        ;
+        /**
+         * Change the item stored in the index position. If the index is out of bound, the node won't be updated.
+         * @param index {number} The position of the node to modify.
+         * @param item {*} The new item stored in the node.
+         * @return {void}
+         */
+        LinkedList.prototype.modifyAt = function (index, item) {
+            var node = this.getNode(index);
+            if (node)
+                node.item = item;
+        };
+        ;
+        /**
+         * Removes all the items stored in the list.
+         * @return {void}
+         */
+        LinkedList.prototype.clear = function () {
+            this.first = null;
+            this.last = null;
+            this.length = 0;
+        };
+        ;
+        /**
+         * Checks if the list contains an item that satisfy the condition represented by the callback function.
+         * @param item {*} The item to find.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {boolean} True if the list contains the item that satisfy the condition, false otherwise.
+         */
+        LinkedList.prototype.contains = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var i = 0;
+            var node = this.first;
+            while (i < this.length && !callback(node.item)) {
+                i++;
+                node = node.next;
+            }
+            return i < this.length;
+        };
+        ;
+        /**
+         * Executes the callback function for each item of the stack.
+         * This method modifies the list so if you don't need to modify it you must return the same item of the array.
+         * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+         * @return {void}
+         */
+        LinkedList.prototype.execute = function (callback) {
+            var node = this.first;
+            while (node) {
+                node.item = callback(node.item);
+                node = node.next;
+            }
+        };
+        ;
+        /**
+         * Returns the node at the position index.
+         * @param index {number} The position of the node.
+         * @return {LLNode} The node stored at the position index. It's undefined if index isn't in the list bounds.
+         */
+        LinkedList.prototype.getNode = function (index) {
+            if (index < 0 || index > this.length - 1)
+                return undefined;
+            var node = this.first;
+            for (; index > 0; index--)
+                node = node.next;
+            return node;
+        };
+        ;
+        /**
+         * Returns the item at the position index.
+         * @param index {number} The position of the item.
+         * @return {*} The item stored at the position index. It's undefined if index isn't in the list bounds.
+         */
+        LinkedList.prototype.getItem = function (index) {
+            if (index < 0 || index > this.length - 1)
+                return undefined;
+            var node = this.first;
+            for (; index > 0; index--)
+                node = node.next;
+            return node.item;
+        };
+        ;
+        /**
+         * Transforms the list into an array.
+         * @return {Array<*>} The array built.
+         */
+        LinkedList.prototype.toArray = function () {
+            var array = [];
+            for (var node = this.first, i = 0; node; node = node.next, i++)
+                array[i] = node.item;
+            return array;
+        };
+        ;
+        /**
+         * Returns the length of the list.
+         * @return {Number} The length of the list.
+         */
+        LinkedList.prototype.getLength = function () {
+            return this.length;
+        };
+        ;
+        /**
+         * Builds the list from the array.
+         * @param array {Array<*>} The array from which build the list.
+         * @return {void}
+         */
+        LinkedList.prototype.fromArray = function (array) {
+            var node = this.first;
+            for (var i = 0; i < Math.min(this.length, array.length); i++, node = node.next)
+                node.item = array[i];
+            if (this.length < array.length)
+                for (var j = this.length; j < array.length; j++)
+                    this.pushBack(array[j]);
+            else
+                for (var k = array.length; k < this.length;)
+                    this.popBack();
+        };
+        ;
+        /**
+         * Returns the items that satisfy the condition determined by the callback.
+         * @param callback {function} The function that implements the condition.
+         * @return {Array<*>} The array that contains the items that satisfy the condition.
+         */
+        LinkedList.prototype.filter = function (callback) {
+            var result = [];
+            for (var node = this.first; node; node = node.next) {
+                if (callback(node.item))
+                    result.push(node.item);
+            }
+            return result;
+        };
+        ;
+        /**
+         * Checks if the list is empty.
+         * @return {boolean} True if the list is empty, false otherwise.
+         */
+        LinkedList.prototype.isEmpty = function () {
+            return !this.length;
+        };
+        ;
+        /**
+         * Returns the first position of the item in the list.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The first position of the item.
+         */
+        LinkedList.prototype.indexOf = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var i = 0;
+            var node = this.first;
+            while (node) {
+                if (callback(node.item))
+                    return i;
+                i++;
+                node = node.next;
+            }
+            return -1;
+        };
+        ;
+        /**
+         * Returns the last position of the item in the list.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The last position of the item.
+         */
+        LinkedList.prototype.lastIndexOf = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var i = 0;
+            var node = this.first;
+            var index = -1;
+            while (node) {
+                if (callback(node.item))
+                    index = i;
+                i++;
+                node = node.next;
+            }
+            return index;
+        };
+        ;
+        /**
+         * Returns all the position in which the item has been found in the list.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {Array<number>} The positions in which the item has been found.
+         */
+        LinkedList.prototype.allIndexesOf = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var i = 0;
+            var node = this.first;
+            var indexes = [];
+            while (node) {
+                if (callback(node.item))
+                    indexes.push(i);
+                i++;
+                node = node.next;
+            }
+            return indexes;
+        };
+        ;
+        /**
+         * Add the list at the end of this list.
+         * @param list {LinkedList} The list to join.
+         * @return {void}
+         */
+        LinkedList.prototype.join = function (list) {
+            if (this.last)
+                this.last.next = list.first;
+            else
+                this.first = list.first;
+            this.last = list.last;
+            this.length += list.length;
+        };
+        ;
+        /**
+         * Divides the list at the index position. The node at the index position is the first new node of the list.
+         * @param index {number} The position where to divide the list.
+         * @return {LinkedList} The list formed by the nodes from the index position then. If the index is out of bound, the list will be empty.
+         */
+        LinkedList.prototype.divide = function (index) {
+            var list = new LinkedList();
+            if (index > -1 && index < this.length) {
+                var node = this.first;
+                var previous = null;
+                for (var i = 0; i < index; i++) {
+                    previous = node;
+                    node = node.next;
+                }
+                if (node === this.first) {
+                    list.first = this.first;
+                    list.last = this.last;
+                    this.first = null;
+                    this.last = null;
+                }
+                else {
+                    list.first = node;
+                    list.last = this.last;
+                    this.last = previous;
+                    previous.next = null;
+                }
+                list.length = this.length - index;
+                this.length = index;
+            }
+            return list;
+        };
+        ;
+        /**
+         * Clones the list into a new list.
+         * @return {LinkedList} The list cloned from this list.
+         */
+        LinkedList.prototype.clone = function () {
+            var list = new LinkedList();
+            var node = this.first;
+            for (var i = 0; i < this.length; i++, node = node.next) {
+                var item = node.item;
+                if (item.clone)
+                    list.pushBack(item.clone());
+                else
+                    list.pushBack(item);
+            }
+            return list;
+        };
+        ;
+        /**
+         * Clones the list into a new list without cloning duplicated items.
+         * @return {LinkedList} The list cloned from this list.
+         */
+        LinkedList.prototype.cloneDistinct = function () {
+            var list = new LinkedList();
+            var node = this.first;
+            for (var i = 0; i < this.length; i++, node = node.next)
+                if (!list.contains(node.item)) {
+                    var item = node.item;
+                    if (item.cloneDistinct)
+                        list.pushBack(item.cloneDistinct());
+                    else if (item.clone)
+                        list.pushBack(item.clone());
+                    else
+                        list.pushBack(item);
+                }
+            return list;
+        };
+        ;
+        /**
+         * Splits the list into lists of desired size.
+         * @param size {number} The size of the lists.
+         * @return {Array<LinkedList>} The lists created by splitting the list.
+         */
+        LinkedList.prototype.split = function (size) {
+            var length = this.length;
+            var lists = [this];
+            for (var i = size; i < length; i += size)
+                lists.push(lists[lists.length - 1].divide(size));
+            return lists;
+        };
+        ;
+        /**
+         * Returns the number of items that satisfy the represented by the callback function.
+         * @param callback {function} The condition to satisfy.
+         * @return {number} The number of items that satisfy the condition.
+         */
+        LinkedList.prototype.count = function (callback) {
+            var count = 0;
+            var node = this.first;
+            while (node) {
+                if (callback(node.item))
+                    count++;
+                node = node.next;
+            }
+            return count;
+        };
+        ;
+        return LinkedList;
+    }(ds.Aggregate));
+    ds.LinkedList = LinkedList;
+})(ds || (ds = {}));
+/**
+ * Created by Stefano on 04/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+var ds;
+(function (ds) {
+    var LinkedListIterator = /** @class */ (function () {
+        /**
+         * Class that implements the iterator for a linked list.
+         * @param aggregate {LinkedList} The aggregate to scan.
+         * @constructor
+         */
+        function LinkedListIterator(aggregate) {
+            /**
+             * The pointer to the position.
+             * @type {Node|null}
+             */
+            this.pointer = null;
+            this.aggregate = aggregate;
+            this.pointer = null;
+        }
+        /**
+         * @inheritDoc
+         */
+        LinkedListIterator.prototype.first = function () {
+            return this.pointer = this.aggregate.first;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        LinkedListIterator.prototype.next = function () {
+            this.pointer = this.pointer.next;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        LinkedListIterator.prototype.last = function () {
+            this.pointer = this.aggregate.last;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        LinkedListIterator.prototype.previous = function () {
+            var node = this.pointer;
+            for (this.pointer = this.first(); this.pointer.next !== node;)
+                this.next();
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        LinkedListIterator.prototype.isDone = function () {
+            return !this.pointer;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        LinkedListIterator.prototype.getItem = function () {
+            return this.pointer.item;
+        };
+        ;
+        /**
+         * Return the node stored at the position pointed by the iterator.
+         * @abstract
+         * @return {Node|null} The node stored or null if it's out of the bounds.
+         */
+        LinkedListIterator.prototype.getNode = function () {
+            return this.pointer;
+        };
+        ;
+        return LinkedListIterator;
+    }());
+    ds.LinkedListIterator = LinkedListIterator;
+})(ds || (ds = {}));
+/**
+ * Created by Stefano on 31/03/14.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+var ds;
+(function (ds) {
+    var PriorityQueue = /** @class */ (function (_super) {
+        __extends(PriorityQueue, _super);
+        /**
+         * Class for managing a priority queue.
+         * @constructor
+         */
+        function PriorityQueue() {
+            var _this = _super.call(this) || this;
+            /**
+             * The length of the queue.
+             * @type {number}
+             */
+            _this.length = 0;
+            _this.items = new ds.RBTreeList();
+            _this.length = 0;
+            return _this;
+        }
+        /**
+         * @inheritDoc
+         */
+        PriorityQueue.prototype.getIterator = function () {
+            return new ds.PriorityQueueIterator(this);
+        };
+        ;
+        /**
+         * Add the item at the tail of the queue.
+         * @param priority {number} The priority of the item.
+         * @param item {*} The item to add.
+         * @return {void}
+         */
+        PriorityQueue.prototype.enqueue = function (priority, item) {
+            var queue = this.items.search(priority);
+            if (!queue) {
+                queue = new ds.Queue();
+                this.items.insert(priority, queue);
+            }
+            queue.enqueue(item);
+            this.length++;
+        };
+        ;
+        /**
+         * Adds the items with the same priority at the tail of the queue.
+         * @param priority {number} The priority of the items.
+         * @param items {Array<*>} The items to add.
+         * @return {void}
+         */
+        PriorityQueue.prototype.multiEnqueue = function (priority, items) {
+            for (var i = 0; i < items.length; i++)
+                this.enqueue(priority, items[i]);
+        };
+        ;
+        /**
+         * Remove the item at the head of the queue.
+         * @return {*} The item at the head of the queue. It's undefined if the queue is empty.
+         */
+        PriorityQueue.prototype.dequeue = function () {
+            var node = this.items.maximum();
+            var item = undefined;
+            if (node) {
+                var queue = node.item;
+                item = queue.dequeue();
+                if (queue.isEmpty())
+                    this.items.deleteNode(node);
+                this.length--;
+            }
+            return item;
+        };
+        ;
+        /**
+         * Removes the items at the head of the queue.
+         * @param times {number} The number of times to repeat the dequeue method.
+         * @return {Array<*>} The items at the head of the queue.
+         */
+        PriorityQueue.prototype.multiDequeue = function (times) {
+            var items = [];
+            for (var i = 0; i < times && this.length; i++)
+                items.push(this.dequeue());
+            return items;
+        };
+        ;
+        /**
+         * Removes the first length items from the position index.
+         * @param index {number} The position where to start to remove the items.
+         * @param [length = 1] {number} The number of items to remove.
+         * @return {void}
+         */
+        PriorityQueue.prototype.remove = function (index, length) {
+            length = length || 1;
+            var it = this.items.getIterator();
+            for (it.last(); !it.isDone() && length > 0; it.previous()) {
+                var queue = it.getItem();
+                if (index > -1 && index < queue.getLength()) {
+                    var oldLength = queue.getLength();
+                    queue.remove(index, length);
+                    length -= oldLength - index;
+                    index = 0;
+                    if (!queue.getLength())
+                        this.items.deleteNode(it.getNode());
+                }
+                else
+                    index = index - queue.getLength();
+            }
+        };
+        ;
+        /**
+         * Return the item at the position index.
+         * @param index {number} The index of the item.
+         * @return {*} The item found. It's undefined if the position index is out of bounds.
+         */
+        PriorityQueue.prototype.getItem = function (index) {
+            var it = this.items.getIterator();
+            for (it.last(); !it.isDone(); it.previous()) {
+                var queue = it.getItem();
+                if (index > -1 && index < queue.getLength())
+                    return queue.getItem(index);
+                index = index - queue.getLength();
+            }
+            return undefined;
+        };
+        ;
+        /**
+         * Return the items relatives to the priority.
+         * @param priority {number} The priority of the items.
+         * @return {Array<*>} The items found.
+         */
+        PriorityQueue.prototype.getItems = function (priority) {
+            var items = this.items.search(priority);
+            if (items)
+                return items.items;
+            return [];
+        };
+        ;
+        /**
+         * Return the first item in the queue. The item is not removed.
+         * @return {*} The first item. It's undefined if the queue is empty.
+         */
+        PriorityQueue.prototype.peek = function () {
+            return this.items.maximum().item.peek();
+        };
+        ;
+        /**
+         * Return the length of the queue.
+         * @return {number} The length of the queue.
+         */
+        PriorityQueue.prototype.getLength = function () {
+            return this.length;
+        };
+        ;
+        /**
+         * Checks if the queue is empty.
+         * @return {boolean} True if the queue is empty, false otherwise.
+         */
+        PriorityQueue.prototype.isEmpty = function () {
+            return !this.length;
+        };
+        ;
+        /**
+         * Removes all the items stored in the queue.
+         * @return {void}
+         */
+        PriorityQueue.prototype.clear = function () {
+            this.items = new ds.RBTreeList();
+            this.length = 0;
+        };
+        ;
+        /**
+         * Checks if the queue contains a priority that satisfy the condition represented by the callback function.
+         * @param priority {number} The priority to find.
+         * @param [callback = function(p){return(p===priority);}] The condition to satisfy. The callback must accept the current priority to check.
+         * @return {boolean} True if the queue contains the priority that satisfy the condition, false otherwise.
+         */
+        PriorityQueue.prototype.containsPriority = function (priority, callback) {
+            if (callback)
+                return this.items.fullContains(callback);
+            else
+                return this.items.contains(priority);
+        };
+        ;
+        /**
+         * Return the queue created by the priority queue with the items in the same order but without the priority.
+         * @return {Queue} The queue created.
+         */
+        PriorityQueue.prototype.toQueue = function () {
+            var queue = new ds.Queue();
+            var it = this.items.getIterator();
+            for (it.last(); !it.isDone(); it.previous()) {
+                var item = it.getItem();
+                var itQ = item.getIterator();
+                for (itQ.first(); !itQ.isDone(); itQ.next())
+                    queue.enqueue(itQ.getItem());
+            }
+            return queue;
+        };
+        ;
+        /**
+         * Executes the callback function for each item of the queue.
+         * This method modifies the queue so if you don't need to modify it you must return the same item of the array.
+         * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+         * @return {void}
+         */
+        PriorityQueue.prototype.execute = function (callback) {
+            var it = this.items.getIterator();
+            for (it.last(); !it.isDone(); it.previous())
+                it.getItem().execute(callback);
+        };
+        ;
+        /**
+         * Change the priority of the item at the position index.
+         * @param index {number} The position of the item of which increase the priority.
+         * @param newPriority {number} The new priority.
+         * @return {void}
+         */
+        PriorityQueue.prototype.changePriority = function (index, newPriority) {
+            var item = this.getItem(index);
+            this.remove(index);
+            this.enqueue(newPriority, item);
+        };
+        ;
+        /**
+         * Returns the items that satisfy the condition determined by the callback.
+         * @param callback {function} The function that implements the condition.
+         * @return {Array<*>} The array that contains the items that satisfy the condition.
+         */
+        PriorityQueue.prototype.filter = function (callback) {
+            var result = [];
+            var it = this.items.getIterator();
+            for (it.last(); !it.isDone(); it.previous()) {
+                var itQ = it.getItem().getIterator();
+                for (itQ.first(); !itQ.isDone(); itQ.next()) {
+                    if (callback(itQ.getItem()))
+                        result.push(itQ.getItem());
+                }
+            }
+            return result;
+        };
+        ;
+        /**
+         * Clones the queue into a new queue.
+         * @return {PriorityQueue} The queue cloned from this queue.
+         */
+        PriorityQueue.prototype.clone = function () {
+            var queue = new PriorityQueue();
+            queue.items = this.items.clone();
+            queue.length = this.length;
+            return queue;
+        };
+        ;
+        /**
+         * Clones the queue into a new queue without cloning duplicated items.
+         * @return {PriorityQueue} The queue cloned from this queue.
+         */
+        PriorityQueue.prototype.cloneDistinct = function () {
+            var queue = new PriorityQueue();
+            queue.items = this.items.cloneDistinct();
+            queue.length = queue.items.getSize();
+            return queue;
+        };
+        ;
+        return PriorityQueue;
+    }(ds.Aggregate));
+    ds.PriorityQueue = PriorityQueue;
+})(ds || (ds = {}));
+/**
+ * Created by Stefano on 04/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+var ds;
+(function (ds) {
+    var PriorityQueueIterator = /** @class */ (function () {
+        /**
+         * Class that implements the iterator for a priority queue.
+         * @param aggregate {PriorityQueue} The aggregate to scan.
+         * @constructor
+         */
+        function PriorityQueueIterator(aggregate) {
+            /**
+             * The pointer to the position of the node.
+             * @type {RBLNode|null}
+             */
+            this.pointerNode = null;
+            /**
+             * The pointer to the position in the node.
+             * @type {number}
+             */
+            this.pointerPosition = -1;
+            this.aggregate = aggregate;
+            this.pointerNode = null;
+            this.pointerPosition = -1;
+        }
+        /**
+         * @inheritDoc
+         */
+        PriorityQueueIterator.prototype.first = function () {
+            this.pointerNode = this.aggregate.items.maximum();
+            this.pointerPosition = 0;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        PriorityQueueIterator.prototype.next = function () {
+            this.pointerPosition++;
+            if (this.pointerPosition > this.pointerNode.item.getLength() - 1) {
+                this.pointerNode = this.pointerNode.previous;
+                this.pointerPosition = 0;
+            }
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        PriorityQueueIterator.prototype.last = function () {
+            this.pointerNode = this.aggregate.items.minimum();
+            this.pointerPosition = this.pointerNode.item.getLength() - 1;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        PriorityQueueIterator.prototype.previous = function () {
+            this.pointerPosition--;
+            if (this.pointerPosition < 0) {
+                this.pointerNode = this.pointerNode.next;
+                if (this.pointerNode)
+                    this.pointerPosition = this.pointerNode.item.getLength() - 1;
+            }
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        PriorityQueueIterator.prototype.isDone = function () {
+            return !this.pointerNode;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        PriorityQueueIterator.prototype.getItem = function () {
+            return this.pointerNode.item.items[this.pointerPosition];
+        };
+        ;
+        return PriorityQueueIterator;
+    }());
+    ds.PriorityQueueIterator = PriorityQueueIterator;
+})(ds || (ds = {}));
+/**
+ * Created by Stefano on 31/03/14.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+var ds;
+(function (ds) {
+    var Queue = /** @class */ (function (_super) {
+        __extends(Queue, _super);
+        /**
+         * Class for managing a queue.
+         * @param {...*} [args] The items for initializing the queue.
+         * @constructor
+         */
+        function Queue() {
+            var args = [];
+            for (var _i = 0; _i < arguments.length; _i++) {
+                args[_i] = arguments[_i];
+            }
+            var _this = _super.call(this) || this;
+            /**
+             * The list of the items in the queue.
+             * @type {Array<*>}
+             */
+            _this.items = [];
+            /**
+             * Decreases dequeue big O complexity by shifting starting indexs
+             * for each dequeue, instead of splicing.
+             * @type {int}
+             */
+            _this.offsetIndex = 0;
+            _this.items = [];
+            _this.offsetIndex = 0;
+            if (args && args.length == 1 && args[0] instanceof Array) {
+                //builds the list from the range passed from the constructor
+                _this.multiEnqueue(args[0]);
+            }
+            else {
+                //builds the list from the parameters of the constructor
+                _this.multiEnqueue(args);
+            }
+            return _this;
+        }
+        /**
+         * @inheritDoc
+         */
+        Queue.prototype.getIterator = function () {
+            return new ds.QueueIterator(this);
+        };
+        ;
+        /**
+         * Adds the item at the tail of the queue.
+         * @param item {*} The item to add.
+         * @return {void}
+         */
+        Queue.prototype.enqueue = function (item) {
+            this.items.push(item);
+        };
+        ;
+        /**
+         * Adds the items at the tail of the queue.
+         * @param items {Array<*>} The items to add.
+         * @return {void}
+         */
+        Queue.prototype.multiEnqueue = function (items) {
+            for (var i = 0; i < items.length; i++)
+                this.items.push(items[i]);
+        };
+        ;
+        /**
+         * Removes the item at the head of the queue.
+         * @return {*} The item at the head of the queue. It's undefined if the queue is empty.
+         */
+        Queue.prototype.dequeue = function () {
+            if (!(this.items.length - this.offsetIndex))
+                return undefined;
+            var dequeued = this.items[this.offsetIndex]; // holds the value, for cases that purge occurs
+            this.offsetIndex++;
+            /**
+             * Automatically purge unneeded (already dequeued)
+             * indexs from the array when they take up
+             * more than one half the array
+             */
+            if (this.offsetIndex >= this.items.length / 2) {
+                this.purge();
+            }
+            return dequeued; //return dequeued item
+        };
+        ;
+        /**
+         * Removes the items at the head of the queue.
+         * @param times {number} The number of times to repeat the dequeue method.
+         * @return {Array<*>} The items at the head of the queue.
+         */
+        Queue.prototype.multiDequeue = function (times) {
+            var dequeued = []; // Holds variables that have been removed from the array
+            // Dequeue the desired number of items
+            console.log('items', this.items);
+            for (var i = 0; (i < times && this.items.length - this.offsetIndex > 0); i++) {
+                console.log('calleds');
+                dequeued.push(this.dequeue());
+            }
+            return dequeued; //removes the last times item and returns the array
+        };
+        ;
+        /**
+         * Clears array indexs hidden by offset. To free up memory
+         * @return {void}
+         */
+        Queue.prototype.purge = function () {
+            this.items.splice(0, this.offsetIndex);
+            this.offsetIndex = 0;
+        };
+        /**
+         * Removes the first length items from the position index.
+         * @param index {number} The position where to start to remove the items.
+         * @param [length = 1] {number} The number of items to remove.
+         * @return {void}
+         */
+        Queue.prototype.remove = function (index, length) {
+            length = length || 1;
+            this.items.splice(index, length);
+        };
+        ;
+        /**
+         * Returns the item at the position index.
+         * @param index {number} The position of the item.
+         * @return {*} The item at the position. It's undefined if index isn't in the queue bounds.
+         */
+        Queue.prototype.getItem = function (index) {
+            // take offsetIndex into account
+            var index = index + this.offsetIndex;
+            if (index < 0 || index > this.items.length - 1 - this.offsetIndex)
+                return undefined;
+            return this.items[index];
+        };
+        ;
+        /**
+         * Returns the first item in the queue. The item is not removed.
+         * @return {*} The first item. It's undefined if the queue is empty.
+         */
+        Queue.prototype.peek = function () {
+            if (this.items.length - this.offsetIndex)
+                return this.items[this.offsetIndex];
+            return undefined;
+        };
+        ;
+        /**
+         * Removes all the items stored in the queue.
+         * @return {void}
+         */
+        Queue.prototype.clear = function () {
+            this.items = [];
+        };
+        ;
+        /**
+         * Checks if the queue contains an item that satisfy the condition represented by the callback function.
+         * @param item {*} The item to find.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {boolean} True if the queue contains the item that satisfy the condition, false otherwise.
+         */
+        Queue.prototype.contains = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var i = this.offsetIndex;
+            while (i < this.items.length && !callback(this.items[i]))
+                i++;
+            return i < this.items.length;
+        };
+        ;
+        /**
+         * Executes the callback function for each item of the queue.
+         * This method modifies the queue so if you don't need to modify it you must return the same item of the array.
+         * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+         * @return {void}
+         */
+        Queue.prototype.execute = function (callback) {
+            for (var i = this.offsetIndex; i < this.items.length; i++)
+                this.items[i] = callback(this.items[i]);
+        };
+        ;
+        /**
+         * Returns the length of the queue.
+         * @return {number} The length of the queue.
+         */
+        Queue.prototype.getLength = function () {
+            return this.items.length - this.offsetIndex;
+        };
+        ;
+        /**
+         * Checks if the queue is empty.
+         * @return {boolean} True if the queue is empty, false otherwise.
+         */
+        Queue.prototype.isEmpty = function () {
+            return !(this.items.length - this.offsetIndex);
+        };
+        ;
+        /**
+         * Returns the items that satisfy the condition determined by the callback.
+         * @param callback {function} The function that implements the condition.
+         * @return {Array<*>} The array that contains the items that satisfy the condition.
+         */
+        Queue.prototype.filter = function (callback) {
+            var result = [];
+            for (var i = this.offsetIndex; i < this.items.length; i++)
+                if (callback(this.items[i]))
+                    result.push(this.items[i]);
+            return result;
+        };
+        ;
+        /**
+         * Returns the first position of the item in the queue.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The first position of the item.
+         */
+        Queue.prototype.indexOf = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var i = this.offsetIndex;
+            while (i < this.items.length) {
+                if (callback(this.items[i]))
+                    return i - this.offsetIndex;
+                i++;
+            }
+            return -1;
+        };
+        ;
+        /**
+         * Returns the last position of the item in the queue.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The last position of the item.
+         */
+        Queue.prototype.lastIndexOf = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var i = this.items.length - 1;
+            while (i > this.offsetIndex - 1) {
+                console.log('l', this.offsetIndex);
+                if (callback(this.items[i]))
+                    return i - this.offsetIndex;
+                i--;
+            }
+            return -1;
+        };
+        ;
+        /**
+         * Returns all the position in which the item has been found in the queue.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {Array<number>} The positions in which the item has been found.
+         */
+        Queue.prototype.allIndexesOf = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var i = this.offsetIndex;
+            var indexes = [];
+            while (i < this.items.length) {
+                if (callback(this.items[i]))
+                    indexes.push(i - this.offsetIndex);
+                i++;
+            }
+            return indexes;
+        };
+        ;
+        /**
+         * Clones the queue into a new queue.
+         * @return {Queue} The queue cloned from this queue.
+         */
+        Queue.prototype.clone = function () {
+            var queue = new Queue();
+            for (var i = this.offsetIndex; i < this.items.length; i++) {
+                var item = this.items[i];
+                if (item.clone)
+                    queue.enqueue(item.clone());
+                else
+                    queue.enqueue(item);
+            }
+            return queue;
+        };
+        ;
+        /**
+         * Clones the queue into a new queue without cloning duplicated items.
+         * @return {Queue} The queue cloned from this queue.
+         */
+        Queue.prototype.cloneDistinct = function () {
+            var queue = new Queue();
+            for (var i = this.offsetIndex; i < this.items.length; i++)
+                if (!queue.contains(this.items[i])) {
+                    var item = this.items[i];
+                    if (item.cloneDistinct)
+                        queue.enqueue(item.cloneDistinct());
+                    else if (item.clone)
+                        queue.enqueue(item.clone());
+                    else
+                        queue.enqueue(item);
+                }
+            return queue;
+        };
+        ;
+        return Queue;
+    }(ds.Aggregate));
+    ds.Queue = Queue;
+})(ds || (ds = {}));
+/**
+ * Created by Stefano on 04/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+var ds;
+(function (ds) {
+    var QueueIterator = /** @class */ (function () {
+        /**
+         * Class that implements the iterator for a linked list.
+         * @param aggregate {Queue} The aggregate to scan.
+         * @constructor
+         */
+        function QueueIterator(aggregate) {
+            /**
+             * The pointer to the position.
+             * @type {number}
+             */
+            this.pointer = -1;
+            this.aggregate = aggregate;
+            this.pointer = -1;
+        }
+        /**
+         * @inheritDoc
+         */
+        QueueIterator.prototype.first = function () {
+            this.pointer = 0;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        QueueIterator.prototype.next = function () {
+            this.pointer++;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        QueueIterator.prototype.last = function () {
+            this.pointer = this.aggregate.items.length - 1;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        QueueIterator.prototype.previous = function () {
+            this.pointer--;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        QueueIterator.prototype.isDone = function () {
+            return this.pointer < 0 || this.pointer > this.aggregate.items.length - 1;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        QueueIterator.prototype.getItem = function () {
+            return this.aggregate.getItem(this.pointer);
+        };
+        ;
+        return QueueIterator;
+    }());
+    ds.QueueIterator = QueueIterator;
+})(ds || (ds = {}));
+/**
+ * Created by Stefano on 01/02/2015.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+var ds;
+(function (ds) {
+    /**
+     * Create an array containing the value of the range
+     * @param from {number} The inclusive start value of the range.
+     * @param to {number} The inclusive end value of the range.
+     * @param [step=1] The step to sample the values
+     * @return {Array<number>} The array containing the value of the range.
+     */
+    function Range(from, to, step) {
+        var range = [];
+        step = step || 1;
+        var sign = (step > 0 ? 1 : -1);
+        for (var i = 0; from * sign <= to * sign; from += step, ++i)
+            range[i] = from;
+        return range;
+    }
+    ds.Range = Range;
+})(ds || (ds = {}));
+var ds;
+(function (ds) {
+    var RBNode = /** @class */ (function () {
+        /**
+         * The single node of the tree.
+         * @param key {number} The key of the node.
+         * @param item {*} The item to store in the node.
+         * @constructor
+         */
+        function RBNode(key, item) {
+            /**
+             * The parent node. It's null if there's no a parent node.
+             * @type {RBNode|null}
+             */
+            this.parent = null;
+            /**
+             * The left node. It's null if there's no a left node.
+             * @type {RBNode|null}
+             */
+            this.left = null;
+            /**
+             * The right node. It's null if there's no a right node.
+             * @type {RBNode|null}
+             */
+            this.right = null;
+            /**
+             * The type of the node. It's or red or black.
+             * @type {string}
+             */
+            this.type = 'r';
+            this.item = item;
+            this.key = key;
+            this.parent = null;
+            this.left = null;
+            this.right = null;
+            this.type = 'r';
+        }
+        return RBNode;
+    }());
+    ds.RBNode = RBNode;
+    var RBTree = /** @class */ (function (_super) {
+        __extends(RBTree, _super);
+        /**
+         * Class for managing a red-black tree.
+         * @constructor
+         */
+        function RBTree() {
+            var _this = _super.call(this) || this;
+            /**
+             * The root of the tree.
+             * @type {RBNode|null}
+             */
+            _this.root = null;
+            /**
+             * The number of items stored in the tree.
+             * @type {number}
+             */
+            _this.size = 0;
+            _this.root = null;
+            _this.size = 0;
+            return _this;
+        }
+        /**
+         * @inheritDoc
+         */
+        RBTree.prototype.getIterator = function () {
+            return new ds.RBTreeIterator(this);
+        };
+        ;
+        /**
+         * Insert the item relatives to the key value in the tree.
+         * @param key {number} The key to store.
+         * @param item {*} The item to store.
+         * @return {void}
+         */
+        RBTree.prototype.insert = function (key, item) {
+            var node = new RBNode(key, item);
+            this.size++;
+            if (!this.root) {
+                this.root = node;
+                node.type = 'b';
+                return;
+            }
+            var p = this.root;
+            for (var n = this.root; n;) {
+                p = n;
+                if (key < n.key)
+                    n = n.left;
+                else
+                    n = n.right;
+            }
+            node.parent = p;
+            if (!p)
+                this.root = node;
+            else if (key < p.key)
+                p.left = node;
+            else
+                p.right = node;
+            this.insertFixUp(node);
+        };
+        ;
+        /**
+         * Preserve the properties of the tree after an insert.
+         * @param node {RBNode} The node to insert.
+         * @return {void}
+         */
+        RBTree.prototype.insertFixUp = function (node) {
+            for (var parent = node.parent; parent && parent.type === 'r'; parent = node.parent) {
+                if (parent === parent.parent.left) {
+                    var uncle = parent.parent.right;
+                    if (uncle && uncle.type === 'r') {
+                        parent.type = 'b';
+                        uncle.type = 'b';
+                        parent.parent.type = 'r';
+                        node = parent.parent;
+                    }
+                    else if (node === parent.right) {
+                        node = parent;
+                        this.leftRotate(node);
+                    }
+                    else {
+                        parent.type = 'b';
+                        parent.parent.type = 'r';
+                        this.rightRotate(parent.parent);
+                    }
+                }
+                else {
+                    var uncle = parent.parent.left;
+                    if (uncle && uncle.type === 'r') {
+                        parent.type = 'b';
+                        uncle.type = 'b';
+                        parent.parent.type = 'r';
+                        node = parent.parent;
+                    }
+                    else if (node === parent.left) {
+                        node = parent;
+                        this.rightRotate(node);
+                    }
+                    else {
+                        parent.type = 'b';
+                        parent.parent.type = 'r';
+                        this.leftRotate(parent.parent);
+                    }
+                }
+            }
+            this.root.type = 'b';
+        };
+        ;
+        /**
+         * Delete the node from the tree.
+         * @param node {RBNode} The node to delete.
+         * @return {void}
+         */
+        RBTree.prototype.deleteNode = function (node) {
+            var successor;
+            this.size--;
+            if (!node.left || !node.right)
+                successor = node;
+            else {
+                successor = this.successor(node);
+                node.key = successor.key;
+                node.item = successor.item;
+            }
+            var child;
+            if (!successor.left)
+                child = successor.right;
+            else
+                child = successor.left;
+            if (child)
+                child.parent = successor.parent;
+            if (!successor.parent)
+                this.root = child;
+            else if (successor === successor.parent.left)
+                successor.parent.left = child;
+            else
+                successor.parent.right = child;
+            if (successor.type === 'b')
+                this.deleteFixUp(child, successor.parent);
+        };
+        ;
+        /**
+         * Preserve the properties of the tree after a deletion.
+         * @param node {RBNode} The node to delete.
+         * @param parent {RBNode} The parent of the node.
+         * @return {void}
+         */
+        RBTree.prototype.deleteFixUp = function (node, parent) {
+            while (node !== this.root && (!node || node.type === 'b')) {
+                if (node === parent.left) {
+                    var brother = parent.right;
+                    if (brother && brother.type === 'r') {
+                        brother.type = 'b';
+                        parent.type = 'r';
+                        this.leftRotate(parent);
+                        brother = parent.right;
+                    }
+                    if (brother && (!brother.left || brother.left.type === 'b') && (!brother.right || brother.right.type === 'b')) {
+                        brother.type = 'r';
+                        node = parent;
+                    }
+                    else {
+                        if (!brother.right || brother.right.type === 'b') {
+                            brother.left.type = 'b';
+                            brother.type = 'r';
+                            this.rightRotate(brother);
+                            brother = parent.right;
+                        }
+                        brother.type = parent.type;
+                        parent.type = 'b';
+                        brother.right.type = 'b';
+                        this.leftRotate(parent);
+                        node = this.root;
+                    }
+                }
+                else {
+                    var brother = parent.left;
+                    if (brother && brother.type === 'r') {
+                        brother.type = 'b';
+                        parent.type = 'r';
+                        this.rightRotate(parent);
+                        brother = parent.left;
+                    }
+                    if (brother && (!brother.left || brother.left.type === 'b') && (!brother.right || brother.right.type === 'b')) {
+                        brother.type = 'r';
+                        node = parent;
+                    }
+                    else {
+                        if (!brother.left || brother.left.type === 'b') {
+                            brother.right.type = 'b';
+                            brother.type = 'r';
+                            this.leftRotate(brother);
+                            brother = parent.left;
+                        }
+                        brother.type = parent.type;
+                        parent.type = 'b';
+                        brother.left.type = 'b';
+                        this.rightRotate(parent);
+                        node = this.root;
+                    }
+                }
+                parent = node.parent;
+            }
+            if (node)
+                node.type = 'b';
+        };
+        ;
+        /**
+         * Get the node with the key next to the param node key.
+         * @param node {RBNode} The node of which search the successor.
+         * @return {RBNode} The node found.
+         */
+        RBTree.prototype.successor = function (node) {
+            if (node.right)
+                return this.minimum(node.right);
+            var parent = node.parent;
+            while (parent && node === parent.right) {
+                node = parent;
+                parent = parent.parent;
+            }
+            return parent;
+        };
+        ;
+        /**
+         * Get the node with the key previous to the param node key.
+         * @param node {RBNode} The node of which search the predecessor.
+         * @return {RBNode} The node found.
+         */
+        RBTree.prototype.predecessor = function (node) {
+            if (node.left)
+                return this.maximum(node.left);
+            var parent = node.parent;
+            while (parent && node === parent.left) {
+                node = parent;
+                parent = parent.parent;
+            }
+            return parent;
+        };
+        ;
+        /**
+         * Search the item relatives to the key and to the nodes that satisfy the condition represented by the callback function.
+         * @param key {number} The key to find.
+         * @param [node = root] {RBNode} The node from which start the search.
+         * @param [callback = function(node){return(node.key===key);}] The condition to satisfy. The callback must accept the current node to check.
+         * @return {*} The item found or undefined if there isn't the key in the tree.
+         */
+        RBTree.prototype.search = function (key, node, callback) {
+            node = node || this.root;
+            callback = callback || function (node) {
+                return node.key === key;
+            };
+            while (node && !callback(node))
+                if (key < node.key)
+                    node = node.left;
+                else
+                    node = node.right;
+            if (node)
+                return node.item;
+            return undefined;
+        };
+        ;
+        /**
+         * Checks if the tree contains a key or a node that satisfy the condition represented by the callback function.
+         * This method avoid to search in branches where the key won't be found.
+         * @param key {*} The key to find.
+         * @param [callback = function(node){return(node.key===key);}] The condition to satisfy. The callback must accept the current node to check.
+         * @return {boolean} True if the tree contains the key or a node that satisfy the condition, false otherwise.
+         */
+        RBTree.prototype.contains = function (key, callback) {
+            return this.search(key, null, callback) !== undefined;
+        };
+        ;
+        /**
+         * Checks if the tree contains a node that satisfy the condition represented by the callback function.
+         * This method check all the tree avoiding the binary search.
+         * @param callback {function} The condition to satisfy. The callback must accept the current node to check.
+         * @return {boolean} True if the tree contains the node that satisfy the condition, false otherwise.
+         */
+        RBTree.prototype.fullContains = function (callback) {
+            var node = this.minimum();
+            while (node && !callback(node.key))
+                node = this.successor(node);
+            return node !== null;
+        };
+        ;
+        /**
+         * Get the item relatives to the minimum key stored in the tree.
+         * @param [node = root] {Node} The node from which start the search.
+         * @return {RBNode} The node found.
+         */
+        RBTree.prototype.minimum = function (node) {
+            node = node || this.root;
+            while (node && node.left)
+                node = node.left;
+            return node;
+        };
+        ;
+        /**
+         * Get the item relatives to the maximum key stored in the tree.
+         * @param [node = root] {Node} The node from which start the search.
+         * @return {RBNode} The node found.
+         */
+        RBTree.prototype.maximum = function (node) {
+            node = node || this.root;
+            while (node && node.right)
+                node = node.right;
+            return node;
+        };
+        ;
+        /**
+         * Rotate the node with its right child.
+         * @param node {RBNode} The node to rotate.
+         * @return {void}
+         */
+        RBTree.prototype.leftRotate = function (node) {
+            var child = node.right;
+            node.right = child.left;
+            if (child.left !== null)
+                child.left.parent = node;
+            child.parent = node.parent;
+            if (node.parent === null)
+                this.root = child;
+            else if (node === node.parent.left)
+                node.parent.left = child;
+            else
+                node.parent.right = child;
+            node.parent = child;
+            child.left = node;
+        };
+        ;
+        /**
+         * Rotate the node with its left child.
+         * @param node {RBNode} The node to rotate.
+         * @return {void}
+         */
+        RBTree.prototype.rightRotate = function (node) {
+            var child = node.left;
+            node.left = child.right;
+            if (child.right !== null)
+                child.right.parent = node;
+            child.parent = node.parent;
+            if (node.parent === null)
+                this.root = child;
+            else if (node === node.parent.left)
+                node.parent.left = child;
+            else
+                node.parent.right = child;
+            node.parent = child;
+            child.right = node;
+        };
+        ;
+        /**
+         * Returns the size of the tree.
+         * @return {number} The size of the tree.
+         */
+        RBTree.prototype.getSize = function () {
+            return this.size;
+        };
+        ;
+        /**
+         * Clones the queue into a new queue.
+         * @return {RBTree} The tree cloned from this queue.
+         */
+        RBTree.prototype.clone = function () {
+            var tree = new RBTree();
+            var it = this.getIterator();
+            for (it.first(); !it.isDone(); it.next()) {
+                var item = it.getNode().item;
+                if (item.clone)
+                    tree.insert(it.getNode().key, item.clone());
+                else
+                    tree.insert(it.getNode().key, item);
+            }
+            return tree;
+        };
+        ;
+        /**
+         * Clones the tree into a new tree without cloning duplicated items.
+         * @return {RBTree} The tree cloned from this tree.
+         */
+        RBTree.prototype.cloneDistinct = function () {
+            var tree = new RBTree();
+            var it = this.getIterator();
+            for (it.first(); !it.isDone(); it.next()) {
+                var callback = function (node) {
+                    return node.key === it.getNode().key && node.item === it.getNode().item;
+                };
+                if (!tree.contains(it.getNode().key, callback)) {
+                    var item = it.getNode().item;
+                    if (item.cloneDistinct)
+                        tree.insert(it.getNode().key, item.cloneDistinct());
+                    else if (item.clone)
+                        tree.insert(it.getNode().key, item.clone());
+                    else
+                        tree.insert(it.getNode().key, item);
+                }
+            }
+            return tree;
+        };
+        ;
+        /**
+         * Transform the tree into an array without preserving keys.
+         * @return {Array<*>} The array that represents the tree.
+         */
+        RBTree.prototype.toArray = function () {
+            var result = [];
+            for (var node = this.minimum(); node; node = this.successor(node))
+                result.push(node.item);
+            return result;
+        };
+        ;
+        /**
+         * Removes all the items stored in the tree.
+         * @return {void}
+         */
+        RBTree.prototype.clear = function () {
+            this.root = null;
+            this.size = 0;
+        };
+        ;
+        /**
+         * Checks if the tree is empty.
+         * @return {boolean} True if the tree is empty, false otherwise.
+         */
+        RBTree.prototype.isEmpty = function () {
+            return !this.size;
+        };
+        ;
+        /**
+         * Executes the callback function for each item of the tree.
+         * This method modifies the tree so if you don't need to modify it you must return the same item stored.
+         * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+         * @return {void}
+         */
+        RBTree.prototype.execute = function (callback) {
+            for (var node = this.minimum(); node; node = this.successor(node))
+                node.item = callback(node.item);
+        };
+        ;
+        /**
+         * Returns the items that satisfy the condition determined by the callback.
+         * @param callback {function} The function that implements the condition.
+         * @return {Array<*>} The array that contains the items that satisfy the condition.
+         */
+        RBTree.prototype.filter = function (callback) {
+            var result = [];
+            for (var node = this.minimum(); node; node = this.successor(node))
+                if (callback(node.item))
+                    result.push(node.item);
+            return result;
+        };
+        ;
+        /**
+         * Returns the first position of the item in the tree.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The first position of the item.
+         */
+        RBTree.prototype.indexOf = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var i = 0, node = this.minimum();
+            while (node) {
+                if (callback(node.item))
+                    return i;
+                node = this.successor(node);
+                i++;
+            }
+            return -1;
+        };
+        ;
+        /**
+         * Returns the last position of the item in the tree.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The last position of the item.
+         */
+        RBTree.prototype.lastIndexOf = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var i = this.size - 1, node = this.maximum();
+            while (node) {
+                if (callback(node.item))
+                    return i;
+                i--;
+                node = this.predecessor(node);
+            }
+            return -1;
+        };
+        ;
+        /**
+         * Returns all the position in which the item has been found in the tree.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {Array<number>} The positions in which the item has been found.
+         */
+        RBTree.prototype.allIndexesOf = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var i = 0, node = this.minimum();
+            var indexes = [];
+            while (node) {
+                if (callback(node.item))
+                    indexes.push(i);
+                i++;
+                node = this.successor(node);
+            }
+            return indexes;
+        };
+        ;
+        /**
+         * Returns the item at the position index.
+         * @param index {number} The position of the item.
+         * @return {*} The item at the position. It's undefined if index isn't in the tree bounds.
+         */
+        RBTree.prototype.getItem = function (index) {
+            if (index < 0 || index > this.size - 1)
+                return undefined;
+            for (var node = this.minimum(), i = 0; i < index; node = this.successor(node))
+                i++;
+            return node.item;
+        };
+        ;
+        return RBTree;
+    }(ds.Aggregate));
+    ds.RBTree = RBTree;
+})(ds || (ds = {}));
+/**
+ * Created by Stefano on 06/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+var ds;
+(function (ds) {
+    var RBTreeIterator = /** @class */ (function () {
+        /**
+         * Class that implements the iterator for a red-black tree.
+         * @param aggregate {RBTree} The aggregate to scan.
+         * @constructor
+         */
+        function RBTreeIterator(aggregate) {
+            /**
+             * The pointer to the position.
+             * @type {RBNode|null}
+             */
+            this.pointer = null;
+            this.aggregate = aggregate;
+            this.pointer = null;
+        }
+        /**
+         * @inheritDoc
+         */
+        RBTreeIterator.prototype.first = function () {
+            this.pointer = this.aggregate.minimum();
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        RBTreeIterator.prototype.next = function () {
+            this.pointer = this.aggregate.successor(this.pointer);
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        RBTreeIterator.prototype.last = function () {
+            this.pointer = this.aggregate.maximum();
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        RBTreeIterator.prototype.previous = function () {
+            this.pointer = this.aggregate.predecessor(this.pointer);
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        RBTreeIterator.prototype.isDone = function () {
+            return !this.pointer;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        RBTreeIterator.prototype.getItem = function () {
+            return this.pointer.item;
+        };
+        ;
+        /**
+         * Return the node stored at the position pointed by the iterator.
+         * @abstract
+         * @return {RBNode|null} The node stored or null if it's out of the bounds.
+         */
+        RBTreeIterator.prototype.getNode = function () {
+            return this.pointer;
+        };
+        ;
+        return RBTreeIterator;
+    }());
+    ds.RBTreeIterator = RBTreeIterator;
+})(ds || (ds = {}));
+var ds;
+(function (ds) {
+    var RBLNode = /** @class */ (function () {
+        /**
+         * The single node of the tree.
+         * @param key {number} The key of the node.
+         * @param item {*} The item to store in the node.
+         * @constructor
+         */
+        function RBLNode(key, item) {
+            /**
+             * The parent node. It's null if there's no a parent node.
+             * @type {RBLNode|null}
+             */
+            this.parent = null;
+            /**
+             * The left node. It's null if there's no a left node.
+             * @type {RBLNode|null}
+             */
+            this.left = null;
+            /**
+             * The right node. It's null if there's no a right node.
+             * @type {RBLNode|null}
+             */
+            this.right = null;
+            /**
+             * The next node. It's null if there's no a next node.
+             * @type {RBLNode|null}
+             */
+            this.next = null;
+            /**
+             * The previous node. It's null if there's no a previous node.
+             * @type {RBLNode|null}
+             */
+            this.previous = null;
+            /**
+             * The type of the node. It's or red or black.
+             * @type {string}
+             */
+            this.type = 'r';
+            this.item = item;
+            this.key = key;
+            this.parent = null;
+            this.left = null;
+            this.right = null;
+            this.next = null;
+            this.previous = null;
+            this.type = 'r';
+        }
+        return RBLNode;
+    }());
+    ds.RBLNode = RBLNode;
+    var RBTreeList = /** @class */ (function (_super) {
+        __extends(RBTreeList, _super);
+        function RBTreeList() {
+            var _this = _super.call(this) || this;
+            /**
+             * The root of the tree.
+             * @type {RBLNode|null}
+             */
+            _this.root = null;
+            /**
+             * The first node of the tree.
+             * @type {RBLNode|null}
+             */
+            _this.first = null;
+            /**
+             * The last node of the tree.
+             * @type {RBLNode|null}
+             */
+            _this.last = null;
+            /**
+             * The size of the tree.
+             * @type {number}
+             */
+            _this.size = 0;
+            _this.root = null;
+            _this.first = null;
+            _this.last = null;
+            _this.size = 0;
+            return _this;
+        }
+        /**
+         * @inheritDoc
+         */
+        RBTreeList.prototype.getIterator = function () {
+            return new ds.RBTreeListIterator(this);
+        };
+        ;
+        /**
+         * Insert the item relatives to the key value in the tree.
+         * @param key {number} The key to store.
+         * @param item {*} The item to store.
+         * @return {void}
+         */
+        RBTreeList.prototype.insert = function (key, item) {
+            var node = new RBLNode(key, item);
+            this.size++;
+            if (!this.root) {
+                this.root = node;
+                this.first = node;
+                this.last = node;
+                node.type = 'b';
+                return;
+            }
+            var p = this.root;
+            for (var n = this.root; n;) {
+                p = n;
+                if (key < n.key)
+                    n = n.left;
+                else
+                    n = n.right;
+            }
+            node.parent = p;
+            if (!p)
+                this.root = node;
+            else if (key < p.key)
+                p.left = node;
+            else
+                p.right = node;
+            node.next = this.successor(node);
+            if (node.next) {
+                if (node.next.previous)
+                    node.next.previous.next = node;
+                else
+                    this.first = node;
+                node.previous = node.next.previous;
+                node.next.previous = node;
+            }
+            else {
+                this.last = node;
+                node.previous = this.predecessor(node);
+                if (node.previous)
+                    node.previous.next = node;
+                else
+                    this.first = node;
+            }
+            this.insertFixUp(node);
+        };
+        ;
+        /**
+         * Preserve the properties of the tree after an insert.
+         * @param node {RBLNode} The node to insert.
+         * @return {void}
+         */
+        RBTreeList.prototype.insertFixUp = function (node) {
+            for (var parent = node.parent; parent && parent.type === 'r'; parent = node.parent) {
+                if (parent === parent.parent.left) {
+                    var uncle = parent.parent.right;
+                    if (uncle && uncle.type === 'r') {
+                        parent.type = 'b';
+                        uncle.type = 'b';
+                        parent.parent.type = 'r';
+                        node = parent.parent;
+                    }
+                    else if (node === parent.right) {
+                        node = parent;
+                        this.leftRotate(node);
+                    }
+                    else {
+                        parent.type = 'b';
+                        parent.parent.type = 'r';
+                        this.rightRotate(parent.parent);
+                    }
+                }
+                else {
+                    var uncle = parent.parent.left;
+                    if (uncle && uncle.type === 'r') {
+                        parent.type = 'b';
+                        uncle.type = 'b';
+                        parent.parent.type = 'r';
+                        node = parent.parent;
+                    }
+                    else if (node === parent.left) {
+                        node = parent;
+                        this.rightRotate(node);
+                    }
+                    else {
+                        parent.type = 'b';
+                        parent.parent.type = 'r';
+                        this.leftRotate(parent.parent);
+                    }
+                }
+            }
+            this.root.type = 'b';
+        };
+        ;
+        /**
+         * Delete the node from the tree.
+         * @param node {RBLNode} The node to delete.
+         * @return {void}
+         */
+        RBTreeList.prototype.deleteNode = function (node) {
+            this.size--;
+            var successor;
+            if (!node.left || !node.right)
+                successor = node;
+            else {
+                successor = this.successor(node);
+                node.key = successor.key;
+                node.item = successor.item;
+            }
+            var child;
+            if (!successor.left)
+                child = successor.right;
+            else
+                child = successor.left;
+            if (child)
+                child.parent = successor.parent;
+            if (!successor.parent)
+                this.root = child;
+            else if (successor === successor.parent.left)
+                successor.parent.left = child;
+            else
+                successor.parent.right = child;
+            if (successor.next)
+                successor.next.previous = successor.previous;
+            else
+                this.last = successor.previous;
+            if (successor.previous)
+                successor.previous.next = successor.next;
+            else
+                this.first = successor.next;
+            if (successor.type === 'b')
+                this.deleteFixUp(child, successor.parent);
+        };
+        ;
+        /**
+         * Preserve the properties of the tree after a deletion.
+         * @param node {RBLNode} The node to delete.
+         * @param parent {RBLNode} The parent of the node.
+         * @return {void}
+         */
+        RBTreeList.prototype.deleteFixUp = function (node, parent) {
+            while (node !== this.root && (!node || node.type === 'b')) {
+                if (node === parent.left) {
+                    var brother = parent.right;
+                    if (brother && brother.type === 'r') {
+                        brother.type = 'b';
+                        parent.type = 'r';
+                        this.leftRotate(parent);
+                        brother = parent.right;
+                    }
+                    if (brother && (!brother.left || brother.left.type === 'b') && (!brother.right || brother.right.type === 'b')) {
+                        brother.type = 'r';
+                        node = parent;
+                    }
+                    else {
+                        if (!brother.right || brother.right.type === 'b') {
+                            brother.left.type = 'b';
+                            brother.type = 'r';
+                            this.rightRotate(brother);
+                            brother = parent.right;
+                        }
+                        brother.type = parent.type;
+                        parent.type = 'b';
+                        brother.right.type = 'b';
+                        this.leftRotate(parent);
+                        node = this.root;
+                    }
+                }
+                else {
+                    var brother = parent.left;
+                    if (brother && brother.type === 'r') {
+                        brother.type = 'b';
+                        parent.type = 'r';
+                        this.rightRotate(parent);
+                        brother = parent.left;
+                    }
+                    if (brother && (!brother.left || brother.left.type === 'b') && (!brother.right || brother.right.type === 'b')) {
+                        brother.type = 'r';
+                        node = parent;
+                    }
+                    else {
+                        if (!brother.left || brother.left.type === 'b') {
+                            brother.right.type = 'b';
+                            brother.type = 'r';
+                            this.leftRotate(brother);
+                            brother = parent.left;
+                        }
+                        brother.type = parent.type;
+                        parent.type = 'b';
+                        brother.left.type = 'b';
+                        this.rightRotate(parent);
+                        node = this.root;
+                    }
+                }
+                parent = node.parent;
+            }
+            if (node)
+                node.type = 'b';
+        };
+        ;
+        /**
+         * Get the node with the key next to the param node key.
+         * @param node {RBLNode} The node of which search the successor.
+         * @return {RBLNode} The node found.
+         */
+        RBTreeList.prototype.successor = function (node) {
+            if (node.next || node === this.last)
+                return node.next;
+            if (node.right)
+                return this.minimum(node.right);
+            var parent = node.parent;
+            while (parent && node === parent.right) {
+                node = parent;
+                parent = parent.parent;
+            }
+            return parent;
+        };
+        ;
+        /**
+         * Get the node with the key previous to the param node key.
+         * @param node {RBLNode} The node of which search the predecessor.
+         * @return {RBLNode} The node found.
+         */
+        RBTreeList.prototype.predecessor = function (node) {
+            if (node.previous || node === this.first)
+                return node.previous;
+            if (node.left)
+                return this.maximum(node.left);
+            var parent = node.parent;
+            while (parent && node === parent.left) {
+                node = parent;
+                parent = parent.parent;
+            }
+            return parent;
+        };
+        ;
+        /**
+         * Search the item relatives to the key that satisfy the condition represented by the callback function.
+         * @param key {number} The key to find.
+         * @param [node = root] {RBNode} The node from which start the search.
+         * @param [callback = function(k){return(k===key);}] The condition to satisfy. The callback must accept the current key to check.
+         * @return {*} The item found or undefined if there isn't the key in the tree.
+         */
+        RBTreeList.prototype.search = function (key, node, callback) {
+            node = node || this.root;
+            callback = callback || function (node) {
+                return node.key === key;
+            };
+            while (node && !callback(node))
+                if (key < node.key)
+                    node = node.left;
+                else
+                    node = node.right;
+            if (node)
+                return node.item;
+            return undefined;
+        };
+        ;
+        /**
+         * Checks if the tree contains a key or a node that satisfy the condition represented by the callback function.
+         * This method avoid to search in branches where the key won't be found.
+         * @param key {*} The key to find.
+         * @param [callback = function(node){return(node.key===key);}] The condition to satisfy. The callback must accept the current node to check.
+         * @return {boolean} True if the tree contains the key or a node that satisfy the condition, false otherwise.
+         */
+        RBTreeList.prototype.contains = function (key, callback) {
+            return this.search(key, null, callback) !== undefined;
+        };
+        ;
+        /**
+         * Checks if the tree contains a node that satisfy the condition represented by the callback function.
+         * This method check all the tree avoiding the binary search.
+         * @param callback {function} The condition to satisfy. The callback must accept the current node to check.
+         * @return {boolean} True if the tree contains the node that satisfy the condition, false otherwise.
+         */
+        RBTreeList.prototype.fullContains = function (callback) {
+            var node = this.first;
+            while (node && !callback(node.key))
+                node = node.next;
+            return node !== null;
+        };
+        ;
+        /**
+         * Get the item relatives to the minimum key stored in the tree.
+         * @param [node = root] {Node} The node from which start the search.
+         * @return {RBLNode} The node found.
+         */
+        RBTreeList.prototype.minimum = function (node) {
+            if (node)
+                while (node && node.left)
+                    node = node.left;
+            else
+                return this.first;
+            return node;
+        };
+        ;
+        /**
+         * Get the item relatives to the maximum key stored in the tree.
+         * @param [node = root] {Node} The node from which start the search.
+         * @return {RBLNode} The node found.
+         */
+        RBTreeList.prototype.maximum = function (node) {
+            if (node)
+                while (node && node.right)
+                    node = node.right;
+            else
+                return this.last;
+            return node;
+        };
+        ;
+        /**
+         * Rotate the node with its right child.
+         * @param node {RBLNode} The node to rotate.
+         * @return {void}
+         */
+        RBTreeList.prototype.leftRotate = function (node) {
+            var child = node.right;
+            node.right = child.left;
+            if (child.left !== null)
+                child.left.parent = node;
+            child.parent = node.parent;
+            if (node.parent === null)
+                this.root = child;
+            else if (node === node.parent.left)
+                node.parent.left = child;
+            else
+                node.parent.right = child;
+            node.parent = child;
+            child.left = node;
+        };
+        ;
+        /**
+         * Rotate the node with its left child.
+         * @param node {RBLNode} The node to rotate.
+         * @return {void}
+         */
+        RBTreeList.prototype.rightRotate = function (node) {
+            var child = node.left;
+            node.left = child.right;
+            if (child.right !== null)
+                child.right.parent = node;
+            child.parent = node.parent;
+            if (node.parent === null)
+                this.root = child;
+            else if (node === node.parent.left)
+                node.parent.left = child;
+            else
+                node.parent.right = child;
+            node.parent = child;
+            child.right = node;
+        };
+        ;
+        /**
+         * Returns the size of the tree.
+         * @return {number} The size of the tree.
+         */
+        RBTreeList.prototype.getSize = function () {
+            return this.size;
+        };
+        ;
+        /**
+         * Clones the tree into a new tree.
+         * @return {RBTreeList} The tree cloned from this tree.
+         */
+        RBTreeList.prototype.clone = function () {
+            var tree = new RBTreeList();
+            var it = this.getIterator();
+            for (it.first(); !it.isDone(); it.next())
+                tree.insert(it.getNode().key, it.getNode().item);
+            return tree;
+        };
+        ;
+        /**
+         * Clones the tree into a new tree without cloning duplicated items.
+         * @return {RBTreeList} The tree cloned from this tree.
+         */
+        RBTreeList.prototype.cloneDistinct = function () {
+            var tree = new RBTreeList();
+            var it = this.getIterator();
+            for (it.first(); !it.isDone(); it.next()) {
+                var callback = function (node) {
+                    return node.key === it.getNode().key && node.item === it.getNode().item;
+                };
+                if (!tree.contains(it.getNode().key, callback)) {
+                    var item = it.getNode().item;
+                    if (item.cloneDistinct)
+                        tree.insert(it.getNode().key, item.cloneDistinct());
+                    else if (item.clone)
+                        tree.insert(it.getNode().key, item.clone());
+                    else
+                        tree.insert(it.getNode().key, item);
+                }
+            }
+            return tree;
+        };
+        ;
+        /**
+         * Transform the tree into an array without preserving keys.
+         * @return {Array<*>} The array that represents the tree.
+         */
+        RBTreeList.prototype.toArray = function () {
+            var result = [];
+            for (var node = this.first; node; node = node.next)
+                result.push(node.item);
+            return result;
+        };
+        ;
+        /**
+         * Removes all the items stored in the tree.
+         * @return {void}
+         */
+        RBTreeList.prototype.clear = function () {
+            this.root = null;
+            this.first = null;
+            this.last = null;
+            this.size = 0;
+        };
+        ;
+        /**
+         * Checks if the tree is empty.
+         * @return {boolean} True if the tree is empty, false otherwise.
+         */
+        RBTreeList.prototype.isEmpty = function () {
+            return !this.size;
+        };
+        ;
+        /**
+         * Executes the callback function for each item of the tree.
+         * This method modifies the tree so if you don't need to modify it you must return the same item stored.
+         * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+         * @return {void}
+         */
+        RBTreeList.prototype.execute = function (callback) {
+            for (var node = this.first; node; node = node.next)
+                node.item = callback(node.item);
+        };
+        ;
+        /**
+         * Returns the items that satisfy the condition determined by the callback.
+         * @param callback {function} The function that implements the condition.
+         * @return {Array<*>} The array that contains the items that satisfy the condition.
+         */
+        RBTreeList.prototype.filter = function (callback) {
+            var result = [];
+            for (var node = this.first; node; node = node.next)
+                if (callback(node.item))
+                    result.push(node.item);
+            return result;
+        };
+        ;
+        /**
+         * Returns the first position of the item in the tree.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The first position of the item.
+         */
+        RBTreeList.prototype.indexOf = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var i = 0, node = this.first;
+            while (node) {
+                if (callback(node.item))
+                    return i;
+                node = node.next;
+                i++;
+            }
+            return -1;
+        };
+        ;
+        /**
+         * Returns the last position of the item in the tree.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The last position of the item.
+         */
+        RBTreeList.prototype.lastIndexOf = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var i = this.size - 1, node = this.last;
+            while (node) {
+                if (callback(node.item))
+                    return i;
+                i--;
+                node = node.previous;
+            }
+            return -1;
+        };
+        ;
+        /**
+         * Returns all the position in which the item has been found in the tree.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {Array<number>} The positions in which the item has been found.
+         */
+        RBTreeList.prototype.allIndexesOf = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var i = 0, node = this.first;
+            var indexes = [];
+            while (node) {
+                if (callback(node.item))
+                    indexes.push(i);
+                i++;
+                node = node.next;
+            }
+            return indexes;
+        };
+        ;
+        /**
+         * Returns the item at the position index.
+         * @param index {number} The position of the item.
+         * @return {*} The item at the position. It's undefined if index isn't in the tree bounds.
+         */
+        RBTreeList.prototype.getItem = function (index) {
+            if (index < 0 || index > this.size - 1)
+                return undefined;
+            for (var node = this.first, i = 0; i < index; node = node.next)
+                i++;
+            return node.item;
+        };
+        ;
+        return RBTreeList;
+    }(ds.Aggregate));
+    ds.RBTreeList = RBTreeList;
+})(ds || (ds = {}));
+/**
+ * Created by Stefano on 06/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+var ds;
+(function (ds) {
+    var RBTreeListIterator = /** @class */ (function () {
+        /**
+         * Class that implements the iterator for a red-black tree.
+         * @param aggregate {RBTreeList} The aggregate to scan.
+         * @constructor
+         */
+        function RBTreeListIterator(aggregate) {
+            /**
+             * The pointer to the position.
+             * @type {RBLNode|null}
+             */
+            this.pointer = null;
+            this.aggregate = aggregate;
+            this.pointer = null;
+        }
+        /**
+         * @inheritDoc
+         */
+        RBTreeListIterator.prototype.first = function () {
+            this.pointer = this.aggregate.first;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        RBTreeListIterator.prototype.next = function () {
+            this.pointer = this.pointer.next;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        RBTreeListIterator.prototype.last = function () {
+            this.pointer = this.aggregate.last;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        RBTreeListIterator.prototype.previous = function () {
+            this.pointer = this.pointer.previous;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        RBTreeListIterator.prototype.isDone = function () {
+            return !this.pointer;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        RBTreeListIterator.prototype.getItem = function () {
+            return this.pointer.item;
+        };
+        ;
+        /**
+         * Return the node stored at the position pointed by the iterator.
+         * @abstract
+         * @return {RBNode|null} The node stored or null if it's out of the bounds.
+         */
+        RBTreeListIterator.prototype.getNode = function () {
+            return this.pointer;
+        };
+        ;
+        return RBTreeListIterator;
+    }());
+    ds.RBTreeListIterator = RBTreeListIterator;
+})(ds || (ds = {}));
+/**
+ * Created by Stefano on 12/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+var ds;
+(function (ds) {
+    var Element = /** @class */ (function () {
+        /**
+         * Class for representing an element of a set.
+         * @param item {*} The item to store in the element.
+         * @constructor
+         */
+        function Element(item) {
+            this.parents = new ds.DoubleLinkedList();
+            this.item = item;
+        }
+        return Element;
+    }());
+    ds.Element = Element;
+    var Set = /** @class */ (function () {
+        /**
+         * Class for managing a set.
+         * @constructor
+         */
+        function Set() {
+            /**
+             * The size of the set. It's equal to his cardinality.
+             * @type {number}
+             */
+            this.size = 0;
+            this.parents = new ds.DoubleLinkedList();
+            this.elements = new ds.DoubleLinkedList();
+            this.sets = new ds.DoubleLinkedList();
+            this.size = 0;
+        }
+        /**
+         * Add the element to the set.
+         * @param element {Element} The element to add.
+         * @return {void}
+         */
+        Set.prototype.insert = function (element) {
+            this.elements.pushBack(element);
+            element.parents.pushBack(this);
+            this.size++;
+        };
+        ;
+        /**
+         * Add the elements to the set.
+         * @param elements {Array<Element>} The elements to add.
+         * @return {void}
+         */
+        Set.prototype.multiInsert = function (elements) {
+            for (var i = 0; i < elements.length; i++) {
+                this.elements.pushBack(elements[i]);
+                elements[i].parents.pushBack(this);
+            }
+            this.size += elements.length;
+        };
+        ;
+        /**
+         * Returns the set that represents the union of two sets.
+         * @param set {Set} The set with make the union.
+         * @return {Set} The set that represents the union.
+         */
+        Set.prototype.union = function (set) {
+            var parent = new Set();
+            parent.addSubsets([this, set]);
+            this.parents.pushBack(parent);
+            set.parents.pushBack(parent);
+            //change the parent of the subset
+            var that = this;
+            var f = function (item) {
+                if (item === that)
+                    return parent;
+                return undefined;
+            };
+            var it = this.sets.getIterator();
+            for (it.first(); !it.isDone(); it.next())
+                it.getItem().parents.execute(f);
+            f = function (item) {
+                if (item === set)
+                    return parent;
+                return undefined;
+            };
+            it = set.sets.getIterator();
+            for (it.first(); !it.isDone(); it.next())
+                it.getItem().parents.execute(f);
+            return parent;
+        };
+        ;
+        /**
+         * Returns the set that represents the intersection of two sets.
+         * @param set {Set} The set to intersect with this.
+         * @return {Set} The set that represents the intersection.
+         */
+        Set.prototype.intersect = function (set) {
+            var intersection = new Set();
+            //intersect this set with the set
+            var el = this.elements.getIterator();
+            for (el.first(); !el.isDone(); el.next())
+                if (el.getItem().parents.contains(set))
+                    intersection.insert(el.getItem());
+            //intersect the subsets with the set
+            var it = this.sets.getIterator();
+            for (it.first(); !it.isDone(); it.next()) {
+                el = it.getItem().getIterator();
+                for (el.first(); !el.isDone(); el.next())
+                    if (el.getItem().parents.contains(set))
+                        intersection.insert(el.getItem());
+            }
+            return intersection;
+        };
+        ;
+        /**
+         * Returns the set that represents the difference of two sets.
+         * @param set {Set} The set to difference with this.
+         * @return {Set} The set that represents the difference.
+         */
+        Set.prototype.difference = function (set) {
+            var diff = new Set();
+            //intersect this set with the set
+            var el = this.elements.getIterator();
+            for (el.first(); !el.isDone(); el.next())
+                if (!el.getItem().parents.contains(set))
+                    diff.insert(el.getItem());
+            //intersect the subsets with the set
+            var it = this.sets.getIterator();
+            for (it.first(); !it.isDone(); it.next()) {
+                el = it.getItem().getIterator();
+                for (el.first(); !el.isDone(); el.next())
+                    if (!el.getItem().parents.contains(set))
+                        diff.insert(el.getItem());
+            }
+            return diff;
+        };
+        ;
+        /**
+         * Returns the set that represents the cartesian product of two sets.
+         * @param set {Set} The set to make the cartesian product with this.
+         * @return {Set} The set that represents the cartesian product .
+         */
+        Set.prototype.cartesianProduct = function (set) {
+            var el1 = this.getItems();
+            var el2 = set.getItems();
+            var product = new Set();
+            for (var i = 0; i < el1.length; i++)
+                for (var j = 0; j < el2.length; j++)
+                    product.insert(new Element([el1[i], el2[j]]));
+            return product;
+        };
+        ;
+        /**
+         * Add the subset.
+         * @param set {Set} The subset.
+         */
+        Set.prototype.addSubset = function (set) {
+            this.sets.pushBack(set);
+            this.size += set.size;
+        };
+        ;
+        /**
+         * Add the subsets.
+         * @param sets {Array<Set>} The subsets.
+         */
+        Set.prototype.addSubsets = function (sets) {
+            for (var i = 0; i < sets.length; i++)
+                this.addSubset(sets[i]);
+        };
+        ;
+        /**
+         * Returns the items that are stored in the set.
+         * @return {Array} The items stored.
+         */
+        Set.prototype.getItems = function () {
+            var array = [];
+            //get the items stored in the set
+            var el = this.elements.getIterator();
+            for (el.first(); !el.isDone(); el.next())
+                array.push(el.getItem().item);
+            //get the items stored in the subsets
+            var it = this.sets.getIterator();
+            for (it.first(); !it.isDone(); it.next()) {
+                el = it.getItem().getIterator();
+                for (el.first(); !el.isDone(); el.next())
+                    array.push(el.getItem().item);
+            }
+            return array;
+        };
+        ;
+        /**
+         * Returns the cardinality of the set.
+         * @return {number} The cardinality of the set.
+         */
+        Set.prototype.getCardinality = function () {
+            return this.size;
+        };
+        ;
+        /**
+         * Checks if the set is empty.
+         * @return {boolean} True if the set is empty, false otherwise.
+         */
+        Set.prototype.isEmpty = function () {
+            return !this.size;
+        };
+        ;
+        /**
+         * Clones the set into a new set.
+         * @return {Set} The set cloned from this set.
+         */
+        Set.prototype.clone = function () {
+            var s = new Set();
+            s.parents = this.parents.clone();
+            s.elements = this.elements.clone();
+            s.sets = this.sets.clone();
+            s.size = this.size;
+            return s;
+        };
+        ;
+        return Set;
+    }());
+    ds.Set = Set;
+})(ds || (ds = {}));
+/**
+ * Created by Battistella Stefano on 31/03/14.
+ */
+var ds;
+(function (ds) {
+    var Stack = /** @class */ (function (_super) {
+        __extends(Stack, _super);
+        /**
+         * Class for managing a stack.
+         * @param {...*} [args] The items for initializing the stack.
+         * @constructor
+         */
+        function Stack() {
+            var args = [];
+            for (var _i = 0; _i < arguments.length; _i++) {
+                args[_i] = arguments[_i];
+            }
+            var _this = _super.call(this) || this;
+            /**
+             * The list of the items in the stack.
+             * @type {Array<*>}
+             */
+            _this.items = [];
+            _this.items = [];
+            if (args && args.length == 1 && args[0] instanceof Array) {
+                //builds the stack from the range passed from the constructor
+                _this.multiPush(args[0]);
+            }
+            else {
+                //builds the stack from the parameters of the constructor
+                _this.multiPush(args);
+            }
+            return _this;
+        }
+        /**
+         * @inheritDoc
+         */
+        Stack.prototype.getIterator = function () {
+            return new ds.StackIterator(this);
+        };
+        ;
+        /**
+         * Adds the item at the top of the stack.
+         * @param item {*} The item to add.
+         * return {void}
+         */
+        Stack.prototype.push = function (item) {
+            this.items.push(item);
+        };
+        ;
+        /**
+         * Adds the items at the top of the stack.
+         * @param items {Array<*>} The items to add.
+         * @return {void}
+         */
+        Stack.prototype.multiPush = function (items) {
+            for (var i = 0; i < items.length; i++)
+                this.push(items[i]);
+        };
+        ;
+        /**
+         * Removes the item at the top of the stack.
+         * @return {*} The item at the top of the stack. It's undefined if the stack is empty.
+         */
+        Stack.prototype.pop = function () {
+            if (!this.items.length)
+                return undefined;
+            return this.items.pop();
+        };
+        ;
+        /**
+         * Removes the more item at the top of the stack.
+         * @param times {number} The number of times to repeat the pop method.
+         * @return {Array<*>} The items at the top of the stack.
+         */
+        Stack.prototype.multiPop = function (times) {
+            var result = [];
+            for (var i = 0; i < times && this.items.length; i++)
+                result.push(this.pop());
+            return result;
+        };
+        ;
+        /**
+         * Returns the item at the top of the stack without remove it.
+         * @return {*} The item at the top of the stack. It's undefined if the stack is empty.
+         */
+        Stack.prototype.peek = function () {
+            if (!this.items.length)
+                return undefined;
+            return this.items[this.items.length - 1];
+        };
+        ;
+        /**
+         * Removes all the items stored in the stack.
+         * @return {void}
+         */
+        Stack.prototype.clear = function () {
+            this.items = [];
+        };
+        ;
+        /**
+         * Checks if the stack contains an item that satisfy the condition represented by the callback function.
+         * @param item {*} The item to find.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {boolean} True if the stack contains the item that satisfy the condition, false otherwise.
+         */
+        Stack.prototype.contains = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var i = 0;
+            while (i < this.items.length && !callback(this.items[i]))
+                i++;
+            return i < this.items.length;
+        };
+        ;
+        /**
+         * Executes the callback function for each item of the stack.
+         * This method modifies the stack so if you don't need to modify it you must return the same item of the array.
+         * @param callback {function} The function to execute for each item. The function must accept the current item on which execute the function.
+         * @return {void}
+         */
+        Stack.prototype.execute = function (callback) {
+            for (var i = this.items.length - 1; i > -1; i--)
+                this.items[i] = callback(this.items[i]);
+        };
+        ;
+        /**
+         * Returns the item at the position index.
+         * @param index The position of the item.
+         * @return {*} The item at the position. It's undefined if index isn't in the stack bounds.
+         */
+        Stack.prototype.getItem = function (index) {
+            if (index < 0 || index > this.items.length - 1)
+                return undefined;
+            return this.items[this.items.length - index - 1];
+        };
+        ;
+        /**
+         * Returns the length of the stack.
+         * @return {Number} The length of the stack.
+         */
+        Stack.prototype.getLength = function () {
+            return this.items.length;
+        };
+        ;
+        /**
+         * Checks if the stack is empty.
+         * @return {boolean} True if the stack is empty, false otherwise.
+         */
+        Stack.prototype.isEmpty = function () {
+            return !this.items.length;
+        };
+        ;
+        /**
+         * Returns the items that satisfy the condition determined by the callback.
+         * @param callback {function} The function that implements the condition.
+         * @return {Array<*>} The array that contains the items that satisfy the condition.
+         */
+        Stack.prototype.filter = function (callback) {
+            var result = [];
+            for (var i = this.items.length - 1; i > -1; i--) {
+                if (callback(this.items[i]))
+                    result.push(this.items[i]);
+            }
+            return result;
+        };
+        ;
+        /**
+         * Returns the first position of the item in the stack.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The first position of the item.
+         */
+        Stack.prototype.indexOf = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var i = this.items.length - 1;
+            while (i > -1) {
+                if (callback(this.items[i]))
+                    return i;
+                i--;
+            }
+            return -1;
+        };
+        ;
+        /**
+         * Returns the last position of the item in the stack.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {number} The last position of the item.
+         */
+        Stack.prototype.lastIndexOf = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var i = 0;
+            while (i < this.items.length) {
+                if (callback(this.items[i]))
+                    return i;
+                i++;
+            }
+            return -1;
+        };
+        ;
+        /**
+         * Returns all the position in which the item has been found in the stack.
+         * @param item {*} The item to search.
+         * @param [callback = function(item){return(it===item);}] The condition to satisfy. The callback must accept the current item to check.
+         * @return {Array<number>} The positions in which the item has been found.
+         */
+        Stack.prototype.allIndexesOf = function (item, callback) {
+            callback = callback || function (it) {
+                return it === item;
+            };
+            var i = this.items.length - 1;
+            var indexes = [];
+            while (i > -1) {
+                if (callback(this.items[i]))
+                    indexes.push(i);
+                i--;
+            }
+            return indexes;
+        };
+        ;
+        /**
+         * Clones the stack into a new stack.
+         * @return {Stack} The stack cloned from this stack.
+         */
+        Stack.prototype.clone = function () {
+            var stack = new Stack();
+            for (var i = 0; i < this.items.length; i++) {
+                var item = this.items[i];
+                if (item.clone)
+                    stack.push(item.clone());
+                else
+                    stack.push(item);
+            }
+            return stack;
+        };
+        ;
+        /**
+         * Clones the stack into a new stack without cloning duplicated items.
+         * @return {Stack} The stack cloned from this stack.
+         */
+        Stack.prototype.cloneDistinct = function () {
+            var stack = new Stack();
+            for (var i = 0; i < this.items.length; i++)
+                if (!stack.contains(this.items[i])) {
+                    var item = this.items[i];
+                    if (item.cloneDistinct)
+                        stack.push(item.cloneDistinct());
+                    else if (item.clone)
+                        stack.push(item.clone());
+                    else
+                        stack.push(item);
+                }
+            return stack;
+        };
+        ;
+        return Stack;
+    }(ds.Aggregate));
+    ds.Stack = Stack;
+})(ds || (ds = {}));
+/**
+ * Created by Stefano on 04/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+var ds;
+(function (ds) {
+    var StackIterator = /** @class */ (function () {
+        /**
+         * Class that implements the iterator for a linked list.
+         * @param aggregate {Stack} The aggregate to scan.
+         * @constructor
+         */
+        function StackIterator(aggregate) {
+            /**
+             * The pointer to the position.
+             * @type {number}
+             */
+            this.pointer = -1;
+            this.aggregate = aggregate;
+            this.pointer = -1;
+        }
+        /**
+         * @inheritDoc
+         */
+        StackIterator.prototype.first = function () {
+            this.pointer = this.aggregate.items.length - 1;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        StackIterator.prototype.next = function () {
+            this.pointer--;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        StackIterator.prototype.last = function () {
+            this.pointer = 0;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        StackIterator.prototype.previous = function () {
+            this.pointer++;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        StackIterator.prototype.isDone = function () {
+            return this.pointer < 0 || this.pointer > this.aggregate.items.length - 1;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        StackIterator.prototype.getItem = function () {
+            return this.aggregate.items[this.pointer];
+        };
+        ;
+        return StackIterator;
+    }());
+    ds.StackIterator = StackIterator;
+})(ds || (ds = {}));
+/**
+ * Created by Stefano on 02/02/2015.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+var ds;
+(function (ds) {
+    var TNode = /** @class */ (function () {
+        /**
+         * The single node of the tree.
+         * @param [string = null] The string of the node.
+         * @param [item = null] The item to store in the node.
+         * @constructor
+         */
+        function TNode(string, item) {
+            /**
+             * The item stored.
+             * @type {*|null}
+             */
+            this.item = null;
+            /**
+             * The key of the node.
+             * @type {string|null}
+             */
+            this.string = null;
+            /**
+             * The parent node. It's null if there's no a parent node.
+             * @type {TNode|null}
+             */
+            this.parent = null;
+            /**
+             * The children of the node.
+             * @type {Array<TNode>}
+             */
+            this.childs = [];
+            this.item = item || null;
+            this.string = string || null;
+            this.parent = null;
+            this.childs = [];
+        }
+        return TNode;
+    }());
+    ds.TNode = TNode;
+    var Trie = /** @class */ (function (_super) {
+        __extends(Trie, _super);
+        /**
+         * Class for managing a trie
+         * @constructor
+         */
+        function Trie() {
+            var _this = _super.call(this) || this;
+            /**
+             * The size of the trie
+             * @type {number}
+             */
+            _this.size = 0;
+            _this.root = new TNode('');
+            _this.size = 0;
+            return _this;
+        }
+        /**
+         * @inheritDoc
+         */
+        Trie.prototype.getIterator = function () {
+            return new ds.TrieIterator(this);
+        };
+        ;
+        /**
+         * Insert the string in the tree creating the relative path to it.
+         * If the string already exists then the values are updated
+         * @param string {string} The string to store.
+         * @param [item = null] The item to store.
+         * @return {void}
+         */
+        Trie.prototype.insert = function (string, item) {
+            var node = this.root;
+            var i = 0;
+            while (i < string.length && node.childs[string.charCodeAt(i)]) {
+                node = node.childs[string.charCodeAt(i)];
+                ++i;
+            }
+            while (i < string.length) {
+                node.childs[string.charCodeAt(i)] = new TNode();
+                node = node.childs[string.charCodeAt(i)];
+                ++i;
+            }
+            if (node.string != string)
+                ++this.size;
+            node.string = string;
+            node.item = item;
+        };
+        ;
+        /**
+         * Suggest the possible conclusion for the string.
+         * @param string {string} The start of the string.
+         * @return {Array<string>} The array of possible string conclusion to fill.
+         */
+        Trie.prototype.suggest = function (string) {
+            var node = this.root;
+            for (var i = 0; i < string.length && node; ++i) {
+                node = node.childs[string.charCodeAt(i)];
+            }
+            var results = [];
+            if (node) {
+                this.stringsToArray(results, node);
+            }
+            return results;
+        };
+        ;
+        /**
+         * Return all the string saved under the node in the array.
+         * @param result {Array<string>} The array to fill.
+         * @param [node {TNode|null} = null] The node from which start searching the strings.
+         * @return {void}
+         */
+        Trie.prototype.stringsToArray = function (result, node) {
+            node = node || this.root;
+            if (node.string) {
+                result.push(node.string);
+            }
+            for (var key in node.childs) {
+                if (key !== 'length' && node.childs.hasOwnProperty(key)) {
+                    this.stringsToArray(result, node.childs[key]);
+                }
+            }
+        };
+        ;
+        /**
+         * Update the item related to the string searched.
+         * @param string {string} The string for finding the item.
+         * @param callback {function} The function to execute to update the item. It should accept the item the iteration is working on.
+         * @return {void}
+         */
+        Trie.prototype.updateItem = function (string, callback) {
+            var node = this.root;
+            var i = 0;
+            while (i < string.length && node.childs[string.charCodeAt(i)]) {
+                node = node.childs[string.charCodeAt(i)];
+                ++i;
+            }
+            // Update the value only if the node reached correspond to the string
+            if (node && node.string == string) {
+                node.item = callback(node.item);
+            }
+        };
+        ;
+        /**
+         * Return the item related to the string searched.
+         * @param string {string} The string for finding the item.
+         * @returns {*} The item found. Undefined if the string is not in the trie
+         */
+        Trie.prototype.getItem = function (string) {
+            var node = this.root;
+            var i = 0;
+            while (i < string.length && node.childs[string.charCodeAt(i)]) {
+                node = node.childs[string.charCodeAt(i)];
+                ++i;
+            }
+            // Return the value only if the node reached correspond to the string
+            if (node && node.string == string) {
+                return node.item;
+            }
+            return undefined;
+        };
+        ;
+        /**
+         * Return the size of the trie.
+         * @returns {number} The size of the tree.
+         */
+        Trie.prototype.getSize = function () {
+            return this.size;
+        };
+        ;
+        /**
+         * Get the minimum string stored in the tree.
+         * @param [node = root] {Node} The node from which start the search.
+         * @return {string} The string found.
+         */
+        Trie.prototype.minimum = function (node) {
+            node = node || this.root;
+            return node.string;
+        };
+        ;
+        /**
+         * Get the maximum string stored in the tree.
+         * @param [node = root] {Node} The node from which start the search.
+         * @return {string} The string found.
+         */
+        Trie.prototype.maximum = function (node) {
+            node = node || this.root;
+            while (node && node.childs[node.childs.length - 1])
+                node = node.childs[node.childs.length - 1];
+            return node.string;
+        };
+        ;
+        return Trie;
+    }(ds.Aggregate));
+    ds.Trie = Trie;
+})(ds || (ds = {}));
+/**
+ * Created by Stefano on 06/04/2014.
+ * Modified by feng(http://feng3d.com) on 28/05/2018
+ */
+var ds;
+(function (ds) {
+    var TrieIterator = /** @class */ (function () {
+        /**
+         * Class that implements the iterator for a trie.
+         * @param aggregate {Trie} The aggregate to scan.
+         * @constructor
+         */
+        function TrieIterator(aggregate) {
+            /**
+             * The pointer to the position.
+             * @type {TNode|null}
+             */
+            this.pointer = null;
+            this.aggregate = aggregate;
+            this.pointer = null;
+        }
+        /**
+         * @inheritDoc
+         */
+        TrieIterator.prototype.first = function () {
+            this.pointer = this.aggregate.minimum();
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        TrieIterator.prototype.next = function () {
+            this.pointer = this.aggregate.successor(this.pointer);
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        TrieIterator.prototype.last = function () {
+            this.pointer = this.aggregate.maximum();
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        TrieIterator.prototype.previous = function () {
+            this.pointer = this.aggregate.predecessor(this.pointer);
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        TrieIterator.prototype.isDone = function () {
+            return !this.pointer;
+        };
+        ;
+        /**
+         * @inheritDoc
+         */
+        TrieIterator.prototype.getItem = function () {
+            return this.pointer.item;
+        };
+        ;
+        return TrieIterator;
+    }());
+    ds.TrieIterator = TrieIterator;
+})(ds || (ds = {}));
+//# sourceMappingURL=ds.js.map
\ No newline at end of file
diff --git a/out/ds.js.map b/out/ds.js.map
new file mode 100644
index 0000000..c8fe3c5
--- /dev/null
+++ b/out/ds.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"ds.js","sourceRoot":"","sources":["../lib/Aggregate/Aggregate.ts","../lib/Aggregate/Iterator.ts","../lib/BTree/BTree.ts","../lib/BTree/BTreeIterator.ts","../lib/BSTree/BSTree.ts","../lib/BSTree/BSTreeIterator.ts","../lib/CircularBuffer/CircularBuffer.ts","../lib/CircularBuffer/CircularBufferIterator.ts","../lib/DoubleLinkedList/DoubleLinkedList.ts","../lib/DoubleLinkedList/DoubleLinkedListIterator.ts","../lib/HashTable/HashTable.ts","../lib/LinkedList/LinkedList.ts","../lib/LinkedList/LinkedListIterator.ts","../lib/PriorityQueue/PriorityQueue.ts","../lib/PriorityQueue/PriorityQueueIterator.ts","../lib/Queue/Queue.ts","../lib/Queue/QueueIterator.ts","../lib/Range/Range.ts","../lib/RBTree/RBTree.ts","../lib/RBTree/RBTreeIterator.ts","../lib/RBTreeList/RBTreeList.ts","../lib/RBTreeList/RBTreeListIterator.ts","../lib/Set/Set.ts","../lib/Stack/Stack.ts","../lib/Stack/StackIterator.ts","../lib/Trie/Trie.ts","../lib/Trie/TrieIterator.ts"],"names":[],"mappings":";;;;;;;;;;;AAAA;;;GAGG;AACH,IAAU,EAAE,CAcX;AAdD,WAAU,EAAE;IAER;;OAEG;IACH;QAAA;QAQA,CAAC;QAAD,gBAAC;IAAD,CAAC,AARD,IAQC;IARqB,YAAS,YAQ9B,CAAA;AACL,CAAC,EAdS,EAAE,KAAF,EAAE,QAcX;AEjBD;;;GAGG;AACH,IAAU,EAAE,CAqwBX;AArwBD,WAAU,EAAE;IAEX;QAiBC;;;WAGG;QACH;YAnBA;;;eAGG;YACH,SAAI,GAAa,EAAE,CAAC;YACpB;;;eAGG;YACH,UAAK,GAAQ,EAAE,CAAC;YAChB;;;eAGG;YACH,WAAM,GAAe,EAAE,CAAC;QAOxB,CAAC;QACF,YAAC;IAAD,CAAC,AAxBD,IAwBC;IAxBY,QAAK,QAwBjB,CAAA;IAED;QAA8B,yBAAS;QAoBtC;;;;WAIG;QACH,eAAY,aAAyB;YAAzB,8BAAA,EAAA,iBAAyB;YAArC,YAEC,iBAAO,SAGP;YA5BD;;;eAGG;YACH,UAAI,GAAG,IAAI,KAAK,EAAK,CAAC;YAQtB;;;eAGG;YACH,UAAI,GAAG,CAAC,CAAC;YAWR,KAAI,CAAC,CAAC,GAAG,aAAa,CAAC;;QACxB,CAAC;QAED;;WAEG;QACH,2BAAW,GAAX;YAEC,MAAM,CAAC,IAAI,GAAA,aAAa,CAAI,IAAI,CAAC,CAAC;QACnC,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,sBAAM,GAAN,UAAO,GAAW,EAAE,IAAO;YAE1B,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACrB,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CACxC,CAAC;gBACA,IAAI,OAAO,GAAG,IAAI,KAAK,EAAK,CAAC;gBAC7B,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC1B,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;gBACpB,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;gBAC5B,IAAI,GAAG,OAAO,CAAC;YAChB,CAAC;YACD,IAAI,CAAC,IAAI,EAAE,CAAC;YACZ,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;QACrC,CAAC;QAAA,CAAC;QAEF;;;;;;WAMG;QACH,6BAAa,GAAb,UAAc,IAAc,EAAE,GAAW,EAAE,IAAO;YAEjD,OAAO,IAAI,EACX,CAAC;gBACA,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;gBAC7B,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CACxB,CAAC;oBACA,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EACxC,CAAC;wBACA,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;wBAChC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBACnC,CAAC;oBACD,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;oBACvB,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;oBACzB,MAAM,CAAC;gBACR,CAAC;gBAAC,IAAI,CACN,CAAC;oBACA,IAAI,CAAC,GAAG,CAAC,CAAC;oBACV,CAAC,EAAE,CAAC;oBACJ,OAAO,CAAC,GAAG,CAAC,EACZ,CAAC;wBACA,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;wBAChC,EAAE,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;4BACvB,CAAC,GAAG,CAAC,CAAC;wBACP,IAAI;4BACH,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACZ,CAAC;oBACD,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAClD,CAAC;wBACA,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;wBACzB,EAAE,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;4BACtB,CAAC,EAAE,CAAC;oBACN,CAAC;oBACD,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACvB,CAAC;YACF,CAAC;QACF,CAAC;QAAA,CAAC;QAEF;;;;;;WAMG;QACH,sBAAM,GAAN,UAAO,GAAW,EAAE,IAAe,EAAE,QAAqD;YAEzF,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC;YACzB,QAAQ,GAAG,QAAQ,IAAI,UAAU,IAAI,EAAE,KAAK;gBAE3C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC;YACjC,CAAC,CAAC;YACF,OAAO,IAAI,EACX,CAAC;gBACA,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;gBACzB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;gBACjB,OAAO,CAAC,GAAG,CAAC,EACZ,CAAC;oBACA,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBAChC,EAAE,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;wBACvB,CAAC,GAAG,CAAC,CAAC;oBACP,IAAI;wBACH,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACZ,CAAC;gBACD,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;oBAC9B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACtB,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;oBAC5B,MAAM,CAAM,SAAS,CAAC;gBACvB,IAAI;oBACH,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC;YACD,MAAM,CAAM,SAAS,CAAC;QACvB,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,0BAAU,GAAV,UAAW,IAAc,EAAE,KAAa;YAEvC,IAAI,OAAO,GAAG,IAAI,KAAK,EAAK,CAAC;YAC7B,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC/B,uDAAuD;YACvD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EACnC,CAAC;gBACA,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBACzC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5C,CAAC;YACD,EAAE,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC;gBACvB,0CAA0C;gBAC1C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE;oBAC9B,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAC/C,4CAA4C;YAC5C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;gBAC5C,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACrC,uDAAuD;YACvD,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC;YACjC,kDAAkD;YAClD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,EAAE,EACrD,CAAC;gBACA,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAChC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACnC,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1C,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5C,+CAA+C;YAC/C,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9C,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAChD,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnD,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,yBAAS,GAAT,UAAU,GAAW;YAEpB,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAC1B,CAAC;gBACA,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBAClC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;oBACrD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACjC,IAAI,CAAC,IAAI,EAAE,CAAC;YACb,CAAC;QACF,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,4BAAY,GAAZ,UAAa,IAAc,EAAE,GAAW;YAEvC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;YAChC,OAAO,CAAC,GAAG,CAAC,EACZ,CAAC;gBACA,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAChC,EAAE,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACvB,CAAC,GAAG,CAAC,CAAC;gBACP,IAAI;oBACH,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACZ,CAAC;YACD,oBAAoB;YACpB,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,GAAG,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CACjD,CAAC;gBACA,oBAAoB;gBACpB,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CACxB,CAAC;oBACA,gBAAgB;oBAChB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EACzC,CAAC;wBACA,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;wBAChC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBACnC,CAAC;oBACD,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;oBAChB,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;gBAClB,CAAC;gBAAC,IAAI,CACN,CAAC;oBACA,wBAAwB;oBACxB,yCAAyC;oBACzC,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CACzC,CAAC;wBACA,6CAA6C;wBAC7C,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;wBAC3B,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;4BAC9B,CAAC,EAAE,CAAC;oBACN,CAAC;oBACD,wCAAwC;oBACxC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC;wBACxB,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;oBACxC,IAAI;wBACH,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;gBAC1B,CAAC;gBACD,4BAA4B;YAC7B,CAAC;YAAC,IAAI,CACN,CAAC;gBACA,qDAAqD;gBACrD,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAC9C,CAAC;oBACA,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;oBAC3B,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;wBAC9B,CAAC,EAAE,CAAC;gBACN,CAAC;gBACD,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YACxC,CAAC;QACF,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,yBAAS,GAAT,UAAU,IAAc,EAAE,KAAa;YAEtC,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC/B,IAAI,OAAO,GAAG,IAAI,CAAC;YACnB,OAAO,OAAO,EACd,CAAC;gBACA,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CACzB,CAAC;oBACA,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;oBACrD,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;oBACxD,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;oBACjB,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;oBAClB,OAAO,GAAG,KAAK,CAAC;gBACjB,CAAC;gBAAC,IAAI,CACN,CAAC;oBACA,IAAI,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAC3C,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;wBACnC,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAC7C,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACzC,CAAC;YACF,CAAC;QACF,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,4BAAY,GAAZ,UAAa,IAAc,EAAE,KAAa;YAEzC,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC/B,IAAI,OAAO,GAAkB,IAAI,CAAC;YAClC,EAAE,CAAC,CAAC,KAAK,CAAC;gBACT,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YAClC,EAAE,CAAC,CAAC,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAC9C,CAAC;gBACA,EAAE,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CACxB,CAAC;oBACA,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;wBAC5C,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACvC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBACtD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAC1C,CAAC;wBACA,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;wBAClC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACrC,CAAC;oBACD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;oBACrC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;oBACvC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;oBAC7D,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBACjE,CAAC;YACF,CAAC;YAAC,IAAI,CACN,CAAC;gBACA,EAAE,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;oBAC5B,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAClC,EAAE,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CACjE,CAAC;oBACA,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAC1B,CAAC;wBACA,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;wBACxD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE;4BAC/C,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;wBAC3C,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;oBACtB,CAAC;oBACD,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACjD,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;oBACpD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACnC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBACrC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAC5C,CAAC;wBACA,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;wBACtC,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBACzC,CAAC;oBACD,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;oBACnB,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;gBACrB,CAAC;gBAAC,IAAI,CACN,CAAC;oBACA,EAAE,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAC7B,CAAC;wBACA,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;wBAC1C,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;wBAC5C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE;4BACpD,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;wBACrC,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;wBAClB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EACjD,CAAC;4BACA,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;4BAChC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;wBACnC,CAAC;wBACD,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;wBAChB,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;wBACjB,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC;4BACzB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE;gCAC/C,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;wBAC/C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAC5C,CAAC;4BACA,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;4BACzC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;wBAC5C,CAAC;oBACF,CAAC;oBAAC,IAAI,CACN,CAAC;wBACA,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC;4BACzB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE;gCAC7C,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;wBAC/C,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;wBAC3D,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;wBAC7D,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAC1C,CAAC;4BACA,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;4BACzC,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;wBAC5C,CAAC;oBACF,CAAC;gBACF,CAAC;YACF,CAAC;QACF,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,wBAAQ,GAAR,UAAS,GAAW,EAAE,QAAqD;YAE1E,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,EAAO,IAAI,EAAE,QAAQ,CAAC,KAAK,SAAS,CAAC;QAC5D,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,4BAAY,GAAZ,UAAa,QAA8B;YAE1C,IAAI,GAAG,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;YAC5B,OAAO,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBAC/C,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YAC3B,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACnB,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,yBAAS,GAAT,UAAU,GAAW,EAAE,IAAe;YAErC,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC;YACzB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;YAChC,4BAA4B;YAC5B,OAAO,CAAC,GAAG,CAAC,EACZ,CAAC;gBACA,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAChC,EAAE,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACvB,CAAC,GAAG,CAAC,CAAC;gBACP,IAAI;oBACH,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACZ,CAAC;YACD,iCAAiC;YACjC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC;gBACxB,4CAA4C;gBAC5C,CAAC,EAAE,CAAC;YACL,gBAAgB;YAChB,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CACxB,CAAC;gBACA,oCAAoC;gBACpC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;oBAC5B,MAAM,CAAC,CAAC,CAAC,CAAC;gBACX,IAAI;oBACH,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACtB,CAAC;YACD,6DAA6D;YAC7D,IAAI,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACpD,kEAAkE;YAClE,EAAE,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;gBAC5C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,qDAAqD;YACrD,MAAM,CAAC,SAAS,CAAC;QAClB,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,2BAAW,GAAX,UAAY,GAAW,EAAE,IAAe;YAEvC,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC;YACzB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;YAChC,4BAA4B;YAC5B,OAAO,CAAC,GAAG,CAAC,EACZ,CAAC;gBACA,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAChC,EAAE,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACvB,CAAC,GAAG,CAAC,CAAC;gBACP,IAAI;oBACH,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACZ,CAAC;YACD,CAAC,EAAE,CAAC;YACJ,6BAA6B;YAC7B,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CACxB,CAAC;gBACA,uCAAuC;gBACvC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBACT,MAAM,CAAC,CAAC,CAAC,CAAC;gBACX,IAAI;oBACH,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACtB,CAAC;YACD,IAAI,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC5D,EAAE,CAAC,CAAC,WAAW,KAAK,CAAC,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAC7C,CAAC;gBACA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,CAAC;YACD,MAAM,CAAC,WAAW,CAAC;QACpB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,0BAAU,GAAV;YAEC,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACrB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM;gBACxB,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACvB,EAAE,CAAC,CAAC,IAAI,CAAC;gBACR,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,MAAM,CAAC,CAAC,CAAC,CAAC;QACX,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,0BAAU,GAAV;YAEC,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACrB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM;gBACxB,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC5C,EAAE,CAAC,CAAC,IAAI,CAAC;gBACR,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACxC,MAAM,CAAC,CAAC,CAAC,CAAC;QACX,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,uBAAO,GAAP;YAEC,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACrB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM;gBACxB,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,uBAAO,GAAP;YAEC,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACrB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM;gBACxB,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC1C,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,uBAAO,GAAP;YAEC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;QAClB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,uBAAO,GAAP;YAEC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,uBAAO,GAAP,UAAQ,QAAwB,EAAE,IAAe;YAEhD,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC;YACzB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;gBACzC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACzC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE;gBAC1C,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,qBAAK,GAAL;YAEC,IAAI,CAAC,IAAI,GAAQ,IAAI,CAAC;YACtB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,sBAAM,GAAN,UAAO,QAA8B,EAAE,IAAe;YAErD,IAAI,MAAM,GAAQ,EAAE,CAAC;YACrB,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC;YACzB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAC1C,CAAC;gBACA,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;oBACtB,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/D,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC3B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7B,CAAC;YACD,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;gBACtB,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACpF,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,qBAAK,GAAL;YAEC,IAAI,IAAI,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YAC5B,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EACxC,CAAC;gBACA,IAAI,IAAI,GAAQ,EAAE,CAAC,OAAO,EAAE,CAAC;gBAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;oBACjB,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;gBACxB,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,IAAI,CAAC,CAAC;YAChC,CAAC;YACD,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,6BAAa,GAAb;YAEC,IAAI,IAAI,GAAG,IAAI,KAAK,CAAI,IAAI,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YAC5B,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EACxC,CAAC;gBACA,IAAI,QAAQ,GAAG,UAAU,IAAO;oBAE/B,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC;gBAC9B,CAAC,CAAC;gBACF,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,CACjC,CAAC;oBACA,IAAI,IAAI,GAAQ,EAAE,CAAC,OAAO,EAAE,CAAC;oBAC7B,EAAE,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC;wBACtB,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;oBAChD,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;wBACnB,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;oBACxC,IAAI;wBACH,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,IAAI,CAAC,CAAC;gBACjC,CAAC;YACF,CAAC;YACD,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,uBAAO,GAAP;YAEC,IAAI,MAAM,GAAG,EAAE,CAAC;YAChB,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YAC5B,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;YAC3B,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,uBAAO,GAAP,UAAQ,IAAO,EAAE,QAA+B;YAE/C,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;YACnC,OAAO,GAAG,KAAK,CAAC,CAAC,EACjB,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC9B,MAAM,CAAC,CAAC,CAAC;gBACV,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;gBAC1B,CAAC,EAAE,CAAC;YACL,CAAC;YACD,MAAM,CAAC,CAAC,CAAC,CAAC;QACX,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,2BAAW,GAAX,UAAY,IAAO,EAAE,QAA+B;YAEnD,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;YAC/C,OAAO,GAAG,KAAK,CAAC,CAAC,EACjB,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC9B,MAAM,CAAC,CAAC,CAAC;gBACV,CAAC,EAAE,CAAC;gBACJ,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;YAC7B,CAAC;YACD,MAAM,CAAC,CAAC,CAAC,CAAC;QACX,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,4BAAY,GAAZ,UAAa,IAAO,EAAE,QAA+B;YAEpD,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;YACnC,IAAI,OAAO,GAAG,EAAE,CAAC;YACjB,OAAO,GAAG,KAAK,CAAC,CAAC,EACjB,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC9B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACjB,CAAC,EAAE,CAAC;gBACJ,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YAC3B,CAAC;YACD,MAAM,CAAC,OAAO,CAAC;QAChB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,uBAAO,GAAP,UAAQ,KAAa;YAEpB,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;gBACtC,MAAM,CAAC,SAAS,CAAC;YAClB,IAAI,GAAG,GAAgB,IAAI,CAAC,OAAO,EAAE,CAAC;YACtC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;gBAC7B,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACzB,CAAC;QAAA,CAAC;QACH,YAAC;IAAD,CAAC,AAxuBD,CAA8B,GAAA,SAAS,GAwuBtC;IAxuBY,QAAK,QAwuBjB,CAAA;AACF,CAAC,EArwBS,EAAE,KAAF,EAAE,QAqwBX;AC1wBD;;;GAGG;AACH,IAAU,EAAE,CAoFX;AApFD,WAAU,EAAE;IAEX;QAcC;;;;WAIG;QACH,uBAAY,SAAmB;YAX/B;;;eAGG;YACH,YAAO,GAAW,CAAC,CAAC,CAAC;YASpB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC5B,CAAC;QAED;;WAEG;QACH,6BAAK,GAAL;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC;QAC5C,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,4BAAI,GAAJ;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC;QAED;;WAEG;QACH,4BAAI,GAAJ;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC;QAC5C,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,gCAAQ,GAAR;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzD,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,8BAAM,GAAN;YAEC,MAAM,CAAC,IAAI,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC;QAC5B,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,+BAAO,GAAP;YAEC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC5C,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,8BAAM,GAAN;YAEC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC;QACrB,CAAC;QAAA,CAAC;QACH,oBAAC;IAAD,CAAC,AAjFD,IAiFC;IAjFY,gBAAa,gBAiFzB,CAAA;AACF,CAAC,EApFS,EAAE,KAAF,EAAE,QAoFX;ACxFD;;;GAGG;AACH,IAAU,EAAE,CAoOX;AApOD,WAAU,EAAE;IAGX;QA4BC;;;;;WAKG;QACH,gBAAY,GAAW,EAAE,IAAO;YAE/B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;YACf,IAAI,CAAC,MAAM,GAAQ,IAAI,CAAC;YACxB,IAAI,CAAC,IAAI,GAAQ,IAAI,CAAC;YACtB,IAAI,CAAC,KAAK,GAAQ,IAAI,CAAC;QACxB,CAAC;QACF,aAAC;IAAD,CAAC,AA1CD,IA0CC;IA1CY,SAAM,SA0ClB,CAAA;IAED;QAA+B,0BAAS;QAOvC;YAAA,YAEC,iBAAO,SAEP;YADA,KAAI,CAAC,IAAI,GAAQ,IAAI,CAAC;;QACvB,CAAC;QAED;;WAEG;QACH,4BAAW,GAAX;YAEC,MAAM,CAAC,IAAI,GAAA,cAAc,CAAI,IAAI,CAAC,CAAC;QACpC,CAAC;QAED;;;;;WAKG;QACH,uBAAM,GAAN,UAAO,GAAW,EAAE,IAAO;YAE1B,IAAI,IAAI,GAAG,IAAI,MAAM,CAAI,GAAG,EAAE,IAAI,CAAC,CAAC;YACpC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,GACzB,CAAC;gBACA,CAAC,GAAG,CAAC,CAAC;gBACN,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC;oBACf,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;gBACZ,IAAI;oBACH,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;YACd,CAAC;YACD,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YAChB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBACN,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YAClB,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC;gBACpB,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC;YACf,IAAI;gBACH,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC;QACjB,CAAC;QAED;;;;;WAKG;QACH,uBAAM,GAAN,UAAO,GAAW,EAAE,IAA6B;YAA7B,qBAAA,EAAA,WAA6B;YAEhD,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC;YACzB,OAAO,IAAI,IAAI,GAAG,KAAK,IAAI,CAAC,GAAG;gBAC9B,EAAE,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;oBAClB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBAClB,IAAI;oBACH,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACpB,EAAE,CAAC,CAAC,IAAI,CAAC;gBACR,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;YAClB,MAAM,CAAC,SAAS,CAAC;QAClB,CAAC;QAED;;;;WAIG;QACH,wBAAO,GAAP,UAAQ,IAA6B;YAA7B,qBAAA,EAAA,WAA6B;YAEpC,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC;YACzB,OAAO,IAAI,IAAI,IAAI,CAAC,IAAI;gBACvB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAED;;;;WAIG;QACH,wBAAO,GAAP,UAAQ,IAA6B;YAA7B,qBAAA,EAAA,WAA6B;YAEpC,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC;YACzB,OAAO,IAAI,IAAI,IAAI,CAAC,KAAK;gBACxB,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAED;;;;WAIG;QACH,0BAAS,GAAT,UAAU,IAAe;YAExB,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;gBACd,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACjC,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YACzB,OAAO,MAAM,IAAI,IAAI,KAAK,MAAM,CAAC,KAAK,EACtC,CAAC;gBACA,IAAI,GAAG,MAAM,CAAC;gBACd,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;YACxB,CAAC;YACD,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAED;;;;WAIG;QACH,4BAAW,GAAX,UAAY,IAAe;YAE1B,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;gBACb,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChC,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YACzB,OAAO,MAAM,IAAI,IAAI,KAAK,MAAM,CAAC,IAAI,EACrC,CAAC;gBACA,IAAI,GAAG,MAAM,CAAC;gBACd,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;YACxB,CAAC;YACD,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAED;;;;WAIG;QACH,2BAAU,GAAV,UAAW,IAAe;YAEzB,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAC9B,CAAC;gBACA,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;oBACtB,IAAI,CAAC,IAAI,GAAQ,IAAI,CAAC;gBACvB,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,IAAI,CAAC;oBAClC,IAAI,CAAC,MAAM,CAAC,IAAI,GAAQ,IAAI,CAAC;gBAC9B,IAAI;oBACH,IAAI,CAAC,MAAM,CAAC,KAAK,GAAQ,IAAI,CAAC;YAChC,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,CACnC,CAAC;gBACA,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;gBAChC,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;gBACpB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBACtB,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,IAAI,CAAC;oBAC7B,IAAI,CAAC,MAAM,CAAC,IAAI,GAAQ,IAAI,CAAC;gBAC9B,IAAI;oBACH,IAAI,CAAC,MAAM,CAAC,KAAK,GAAQ,IAAI,CAAC;YAChC,CAAC;YAAC,IAAI,CACN,CAAC;gBACA,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CACf,CAAC;oBACA,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,CACvB,CAAC;wBACA,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;wBACvB,IAAI,CAAC,KAAK,CAAC,MAAM,GAAQ,IAAI,CAAC;oBAC/B,CAAC;oBAAC,IAAI,CACN,CAAC;wBACA,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;wBAC/B,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;oBACjC,CAAC;gBACF,CAAC;gBAAC,IAAI,CACN,CAAC;oBACA,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,CACvB,CAAC;wBACA,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;wBACtB,IAAI,CAAC,IAAI,CAAC,MAAM,GAAQ,IAAI,CAAC;oBAC9B,CAAC;oBAAC,IAAI,CACN,CAAC;wBACA,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;wBAC7B,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;oBAChC,CAAC;gBACF,CAAC;YACF,CAAC;QACF,CAAC;QACF,aAAC;IAAD,CAAC,AApLD,CAA+B,GAAA,SAAS,GAoLvC;IApLY,SAAM,SAoLlB,CAAA;AACF,CAAC,EApOS,EAAE,KAAF,EAAE,QAoOX;ACxOD;;;GAGG;AACH,IAAU,EAAE,CAqFX;AArFD,WAAU,EAAE;IAEX;QAcC;;;;WAIG;QACH,wBAAY,SAAoB;YAE/B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;YAC3B,IAAI,CAAC,OAAO,GAAQ,IAAI,CAAC;QAC1B,CAAC;QAED;;WAEG;QACH,8BAAK,GAAL;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;QACzC,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,6BAAI,GAAJ;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,6BAAI,GAAJ;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;QACzC,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,iCAAQ,GAAR;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzD,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,+BAAM,GAAN;YAEC,MAAM,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;QACtB,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,gCAAO,GAAP;YAEC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;QAC1B,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,gCAAO,GAAP;YAEC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC;QACrB,CAAC;QAAA,CAAC;QACH,qBAAC;IAAD,CAAC,AAlFD,IAkFC;IAlFY,iBAAc,iBAkF1B,CAAA;AACF,CAAC,EArFS,EAAE,KAAF,EAAE,QAqFX;ACzFD;;;GAGG;AACH,IAAU,EAAE,CAmOX;AAnOD,WAAU,EAAE;IAEX;QAAuC,kCAAS;QAkC/C;;;;WAIG;QACH,wBAAY,IAAY;YAAxB,YAEC,iBAAO,SAGP;YAzCD;;;eAGG;YACH,UAAI,GAAG,CAAC,CAAC;YACT;;;eAGG;YACH,UAAI,GAAG,CAAC,CAAC;YACT;;;eAGG;YACH,WAAK,GAAQ,EAAE,CAAC;YAChB;;;eAGG;YACH,WAAK,GAAG,IAAI,CAAC;YACb;;;eAGG;YACH,UAAI,GAAG,KAAK,CAAC;YAeZ,KAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,KAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC;;QAC1B,CAAC;QAED;;WAEG;QACH,oCAAW,GAAX;YAEC,MAAM,CAAC,IAAI,GAAA,sBAAsB,CAAI,IAAI,CAAC,CAAC;QAC5C,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,8BAAK,GAAL,UAAM,IAAO;YAEZ,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;YACnB,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;gBACb,4CAA4C;gBAC5C,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;YACzC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;YAC7B,qBAAqB;YACrB,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;YACxC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;gBAC3B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACnB,CAAC;QAAA,CAAC;QAEF;;;;;;WAMG;QACH,6BAAI,GAAJ,UAAK,IAAY,EAAE,EAAU;YAE5B,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;gBACZ,IAAI,GAAG,CAAC,CAAC;YACV,EAAE,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;gBACxB,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;YACtB,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;gBACV,EAAE,GAAG,CAAC,CAAC;YACR,EAAE,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;gBACtB,EAAE,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;YACpB,+DAA+D;YAC/D,0FAA0F;YAC1F,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI;gBACjD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAEtB,iDAAiD;YACjD,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;gBAC1C,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAC1B,CAAC;oBACA,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;gBACpC,CAAC;gBAAC,IAAI,CACN,CAAC;oBACA,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;gBAChB,CAAC;YACF,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;gBACtC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAC1B,CAAC;oBACA,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;gBAChB,CAAC;gBAAC,IAAI,CACN,CAAC;oBACA,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;gBAClB,CAAC;YACF,4BAA4B;YAC5B,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;gBACf,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;YACnB,8BAA8B;YAC9B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE;gBACjC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAChC,CAAC;oBACA,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;oBACnB,MAAM,CAAC;gBACR,CAAC;YACF,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QACnB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,gCAAO,GAAP;YAEC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE;gBACjC,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;YAClB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;YACd,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,6BAAI,GAAJ,UAAK,KAAa;YAEjB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;QACtC,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,gCAAO,GAAP;YAEC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;QACnB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,+BAAM,GAAN;YAEC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;QAClB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,8BAAK,GAAL;YAEC,IAAI,MAAM,GAAG,IAAI,cAAc,CAAI,IAAI,CAAC,IAAI,CAAC,CAAC;YAC9C,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACxB,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACxB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;gBACzC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;YAC1B,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACxB,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,+BAAM,GAAN,UAAO,IAAY;YAElB,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,CACrB,CAAC;gBACA,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAC9B,CAAC;oBACA,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,EAClC,CAAC;wBACA,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;wBACnD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBACtB,CAAC;oBACD,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;gBAC5C,CAAC;YACF,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,CAC5B,CAAC;gBACA,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAC9B,CAAC;oBACA,qCAAqC;oBACrC,IAAI,KAAK,GAAG,IAAI,CAAC;oBACjB,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CACzB,CAAC;wBACA,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;wBAClB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;oBACf,CAAC;oBACD,oDAAoD;oBACpD,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;oBAC7B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,EAAE,CAAC,EAAE,EAC7E,CAAC;wBACA,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;wBACnD,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;4BACN,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;oBAChB,CAAC;oBACD,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;gBAC5C,CAAC;YACF,CAAC;YACD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QAClB,CAAC;QAAA,CAAC;QAEH,qBAAC;IAAD,CAAC,AAhOD,CAAuC,GAAA,SAAS,GAgO/C;IAhOY,iBAAc,iBAgO1B,CAAA;AACF,CAAC,EAnOS,EAAE,KAAF,EAAE,QAmOX;ACvOD;;;GAGG;AACH,IAAU,EAAE,CAsFX;AAtFD,WAAU,EAAE;IAGX;QAmBC;;;;WAIG;QACH,gCAAY,SAA4B;YAhBxC;;;eAGG;YACH,YAAO,GAAW,CAAC,CAAC,CAAC;YACrB;;;eAGG;YACH,UAAK,GAAG,IAAI,CAAC;YASZ,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC5B,CAAC;QAED;;WAEG;QACH,sCAAK,GAAL;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;YACnC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QACnB,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,qCAAI,GAAJ;YAEC,IAAI,CAAC,OAAO,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;YACxD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACpB,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,qCAAI,GAAJ;YAEC,IAAI,CAAC,OAAO,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;YAC/D,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QACnB,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,yCAAQ,GAAR;YAEC,IAAI,CAAC,OAAO,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;YACxD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACpB,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,uCAAM,GAAN;YAEC,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,SAAS,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;YACzI,MAAM,CAAC,EAAE,CAAC;QACX,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,wCAAO,GAAP;YAEC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC1C,CAAC;QAAA,CAAC;QACH,6BAAC;IAAD,CAAC,AAjFD,IAiFC;IAjFY,yBAAsB,yBAiFlC,CAAA;AAEF,CAAC,EAtFS,EAAE,KAAF,EAAE,QAsFX;AC1FD;;;GAGG;AACH,IAAU,EAAE,CAwzBX;AAxzBD,WAAU,EAAE;IAEX;QAkBC;;;;WAIG;QACH,iBAAY,IAAO;YAhBnB;;;eAGG;YACH,SAAI,GAAoB,IAAI,CAAC;YAC7B;;;eAGG;YACH,aAAQ,GAAoB,IAAI,CAAC;YAShC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QAClB,CAAC;QAEF,cAAC;IAAD,CAAC,AA5BD,IA4BC;IA5BY,UAAO,UA4BnB,CAAA;IAED;QAAyC,oCAAS;QAkBjD;;;;WAIG;QACH;YAAY,cAAc;iBAAd,UAAc,EAAd,qBAAc,EAAd,IAAc;gBAAd,yBAAc;;YAA1B,YAEC,iBAAO,SAWP;YAlCD;;;eAGG;YACH,WAAK,GAAoB,IAAI,CAAC;YAC9B;;;eAGG;YACH,UAAI,GAAoB,IAAI,CAAC;YAC7B;;;eAGG;YACH,YAAM,GAAG,CAAC,CAAC;YAWV,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,YAAY,KAAK,CAAC,CACzD,CAAC;gBACA,4DAA4D;gBAC5D,KAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,CAAC;YAAC,IAAI,CACN,CAAC;gBACA,wDAAwD;gBACxD,KAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACtB,CAAC;;QACF,CAAC;QAED;;WAEG;QACH,sCAAW,GAAX;YAEC,MAAM,CAAC,IAAI,GAAA,wBAAwB,CAAI,IAAI,CAAC,CAAC;QAC9C,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,oCAAS,GAAT,UAAU,IAAS;YAElB,IAAI,IAAI,GAAG,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;YAC7B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;YAClB,oCAAoC;YACpC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;gBACb,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;YAC3B,IAAI;gBACH,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YAClB,IAAI,CAAC,MAAM,EAAE,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,mCAAQ,GAAR,UAAS,IAAO;YAEf,IAAI,IAAI,GAAG,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;YAC7B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC;YAC1B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,wCAAwC;YACxC,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;gBACjB,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC;YAC3B,IAAI;gBACH,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;YACnB,IAAI,CAAC,MAAM,EAAE,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,mCAAQ,GAAR;YAEC,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAChB,CAAC;gBACA,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;gBACtB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;gBACvB,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;oBACb,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAQ,IAAI,CAAC;gBAChC,IAAI,CAAC,MAAM,EAAE,CAAC;gBACd,IAAI,CAAC,IAAI,GAAQ,IAAI,CAAC;gBACtB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;YAClB,CAAC;YACD,MAAM,CAAC,SAAS,CAAC;QAClB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,kCAAO,GAAP;YAEC,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAChB,CAAC;gBACA,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBACrB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;gBAC1B,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;oBACjB,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAQ,IAAI,CAAC;gBAChC,IAAI,CAAC,MAAM,EAAE,CAAC;gBACd,IAAI,CAAC,QAAQ,GAAQ,IAAI,CAAC;gBAC1B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;YAClB,CAAC;YACD,MAAM,CAAC,SAAS,CAAC;QAClB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,wCAAa,GAAb,UAAc,KAAa;YAE1B,IAAI,MAAM,GAAG,EAAE,CAAC;YAChB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;gBAC5C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;YAC9B,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,uCAAY,GAAZ,UAAa,KAAa;YAEzB,IAAI,MAAM,GAAG,EAAE,CAAC;YAChB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;gBAC5C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;YAC7B,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,+BAAI,GAAJ;YAEC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAChB,MAAM,CAAC,SAAS,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;QACxB,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,gCAAK,GAAL,UAAM,IAAO,EAAE,KAAa;YAE3B,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;gBACb,MAAM,CAAC;YACR,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CACX,CAAC;gBACA,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;gBACrB,MAAM,CAAC;YACR,CAAC;YACD,EAAE,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,MAAM,CAAC,CAC1B,CAAC;gBACA,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBACpB,MAAM,CAAC;YACR,CAAC;YACD,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,KAAK,GAAG,CAAC,CAAC;gBACtB,IAAI,CAAC,QAAQ,CAAM,SAAS,CAAC,CAAC;YAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,EAAE,EAAG,IAAI,GAAG,IAAI,CAAC,IAAI,EACrD,CAAC;gBACA,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;oBACtB,IAAI,CAAC,QAAQ,CAAM,SAAS,CAAC,CAAC;YAChC,CAAC;YACD,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;gBACtB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACrB,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC;gBAC5B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACtB,IAAI,CACJ,CAAC;gBACA,IAAI,OAAO,GAAG,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;gBAChC,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBACzB,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC;gBACxB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;gBACpB,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC;oBAChB,OAAO,CAAC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;gBACjC,IAAI,CAAC,MAAM,EAAE,CAAC;YACf,CAAC;QACF,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,mCAAQ,GAAR,UAAS,KAAa;YAErB,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;gBACxC,MAAM,CAAC,SAAS,CAAC;YAClB,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC;gBACf,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACxB,EAAE,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;gBAC7B,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;YACvB,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE;gBACxB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,gCAAgC;YAChC,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAC/B,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;YACnC,IAAI,CAAC,IAAI,GAAQ,IAAI,CAAC;YACtB,IAAI,CAAC,QAAQ,GAAQ,IAAI,CAAC;YAC1B,IAAI,CAAC,MAAM,EAAE,CAAC;YACd,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;QAClB,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,iCAAM,GAAN,UAAO,IAAO,EAAE,QAA+B;YAE9C,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,IAAI,QAAQ,GAAG,IAAI,CAAC;YACpB,OAAO,IAAI,EACX,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CACxB,CAAC;oBACA,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC;wBACvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;oBACxB,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;wBACtB,IAAI,CAAC,IAAI,GAAQ,QAAQ,CAAC;oBAC3B,EAAE,CAAC,CAAC,QAAQ,CAAC,CACb,CAAC;wBACA,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;wBAC1B,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;4BACb,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;oBAChC,CAAC;oBACD,MAAM,CAAC;gBACR,CAAC;gBACD,QAAQ,GAAG,IAAI,CAAC;gBAChB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,CAAC;QACF,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,oCAAS,GAAT,UAAU,IAAO,EAAE,QAA+B;YAEjD,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,IAAI,QAAQ,GAAG,IAAI,CAAC;YACpB,OAAO,IAAI,EACX,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CACxB,CAAC;oBACA,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC;wBACvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;oBACxB,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;wBACtB,IAAI,CAAC,IAAI,GAAQ,QAAQ,CAAC;oBAC3B,EAAE,CAAC,CAAC,QAAQ,CAAC,CACb,CAAC;wBACA,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;wBAC1B,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;4BACb,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;oBAChC,CAAC;gBACF,CAAC;gBAAC,IAAI;oBACL,QAAQ,GAAG,IAAI,CAAC;gBACjB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,CAAC;QACF,CAAC;QAAA,CAAC;QAEF;;;;;;WAMG;QACH,wCAAa,GAAb,UAAc,IAAY,EAAE,EAAU;YAErC,IAAI,MAAM,GAAG,EAAE,CAAC;YAChB,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAClC,CAAC;gBACA,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC;oBACd,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;gBACnC,EAAE,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;oBACvC,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,IAAI,EAAE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;gBAC7E,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;gBACtB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE;oBAChC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBAClB,gDAAgD;gBAChD,gBAAgB;gBAChB,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBACrB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EACrD,CAAC;oBACA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBAClB,CAAC;gBACD,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,IAAI,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;gBAC3D,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;gBACjB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;YACtB,CAAC;YACD,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,mCAAQ,GAAR,UAAS,KAAa,EAAE,IAAO;YAE9B,IAAI,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAC/B,EAAE,CAAC,CAAC,IAAI,CAAC;gBACR,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACnB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,gCAAK,GAAL;YAEC,IAAI,CAAC,KAAK,GAAQ,IAAI,CAAC;YACvB,IAAI,CAAC,IAAI,GAAQ,IAAI,CAAC;YACtB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QACjB,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,mCAAQ,GAAR,UAAS,IAAO,EAAE,QAA+B;YAEhD,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAC9C,CAAC;gBACA,CAAC,EAAE,CAAC;gBACJ,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,CAAC;YACD,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,kCAAO,GAAP,UAAQ,QAAwB;YAE/B,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,OAAO,IAAI,EACX,CAAC;gBACA,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAChC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,CAAC;QACF,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,qCAAU,GAAV,UAAW,IAAgB;YAE1B,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,CACxB,CAAC;gBACA,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAChB,MAAM,CAAC;YACR,CAAC;YACD,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,CACvB,CAAC;gBACA,IAAI,CAAC,OAAO,EAAE,CAAC;gBACf,MAAM,CAAC;YACR,CAAC;YACD,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAC/B,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;YACnC,IAAI,CAAC,MAAM,EAAE,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,kCAAO,GAAP,UAAQ,KAAa,EAAE,IAAiB;YAEvC,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;gBACxC,MAAM,CAAC,SAAS,CAAC;YAClB,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACpC,uHAAuH;YACvH,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,CACtB,CAAC;gBACA,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC;gBAC1B,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE;oBACxB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACnB,CAAC;YAAC,IAAI;gBACL,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,KAAK,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE;oBACzE,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,kCAAO,GAAP,UAAQ,KAAa;YAEpB,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;gBACxC,MAAM,CAAC,SAAS,CAAC;YAClB,IAAI,IAAI,CAAC;YACT,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACpC,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;gBACb,GAAG,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE;oBACzC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACnB,IAAI;gBACH,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,KAAK,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE;oBACzE,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;QAClB,CAAC;QAAA,CAAC;QAEF;;;;;;;WAOG;QACH,+BAAI,GAAJ,UAAK,QAA8B;YAElC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;gBACb,QAAQ,GAAG,UAAU,IAAO;oBAE3B,MAAM,CAAM,IAAI,CAAC;gBAClB,CAAC,CAAC;YAEH,IAAI,SAAS,GAAG,IAAI,CAAC;YAErB,qBAAqB,IAAY,EAAE,EAAU,EAAE,QAAoB,EAAE,MAAkB,EAAE,QAA6B;gBAErH,EAAE,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,CACd,CAAC;oBACA,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;oBACpC,IAAI,KAAK,GAAoB,SAAS,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,EAAE,QAAQ,CAAC,CAAC;oBACnE,WAAW,CAAC,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;oBAChD,WAAW,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;oBACrD,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;gBACxC,CAAC;YACF,CAAC;YAED,eAAe,IAAY,EAAE,CAAS,EAAE,EAAU,EAAE,QAAoB,EAAE,QAA6B;gBAEtG,IAAI,IAAI,GAAG,EAAE,CAAC;gBACd,IAAI,KAAK,GAAG,EAAE,CAAC;gBACf,IAAI,IAAI,GAAG,QAAQ,CAAC;gBACpB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,EAAG,IAAI,GAAG,IAAI,CAAC,IAAI;oBACvD,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;gBACrB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,EAAG,IAAI,GAAG,IAAI,CAAC,IAAI;oBACjD,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;gBACtB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;gBACjB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,EAAG,QAAQ,GAAG,QAAQ,CAAC,IAAI,EAC7D,CAAC;oBACA,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CACpF,CAAC;wBACA,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;wBACxB,CAAC,EAAE,CAAC;oBACL,CAAC;oBAAC,IAAI,CACN,CAAC;wBACA,QAAQ,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;wBACzB,CAAC,EAAE,CAAC;oBACL,CAAC;gBACF,CAAC;YACF,CAAC;YAED,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAClE,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,kCAAO,GAAP;YAEC,IAAI,KAAK,GAAG,EAAE,CAAC;YACf,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE;gBAC7D,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;YACtB,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,oCAAS,GAAT;YAEC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;QACpB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,oCAAS,GAAT,UAAU,KAAU;YAEnB,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAG,IAAI,GAAG,IAAI,CAAC,IAAI;gBAC9E,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;gBAC9B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;oBAC9C,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI;gBACH,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM;oBACzC,IAAI,CAAC,OAAO,EAAE,CAAC;QAClB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,iCAAM,GAAN,UAAO,QAA8B;YAEpC,IAAI,MAAM,GAAG,EAAE,CAAC;YAChB,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI,EAClD,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzB,CAAC;YACD,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,kCAAO,GAAP;YAEC,GAAG,CAAC,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,GAAG,GAAG,IAAI,CAAC,IAAI,EAAE,KAAK,KAAK,GAAG,IAAI,KAAK,CAAC,QAAQ,KAAK,GAAG,EAAE,KAAK,GAAG,KAAK,CAAC,IAAI,EAAE,GAAG,GAAG,GAAG,CAAC,QAAQ,EAC7H,CAAC;gBACA,IAAI,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;gBACtB,KAAK,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC;gBACtB,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,CAAC;QACF,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,kCAAO,GAAP;YAEC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,kCAAO,GAAP,UAAQ,IAAO,EAAE,QAA+B;YAE/C,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,OAAO,IAAI,EACX,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvB,MAAM,CAAC,CAAC,CAAC;gBACV,CAAC,EAAE,CAAC;gBACJ,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,CAAC;YACD,MAAM,CAAC,CAAC,CAAC,CAAC;QACX,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,sCAAW,GAAX,UAAY,IAAO,EAAE,QAA+B;YAEnD,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YACxB,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACrB,OAAO,IAAI,EACX,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvB,MAAM,CAAC,CAAC,CAAC;gBACV,CAAC,EAAE,CAAC;gBACJ,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;YACtB,CAAC;YACD,MAAM,CAAC,CAAC,CAAC,CAAC;QACX,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,uCAAY,GAAZ,UAAa,IAAO,EAAE,QAA+B;YAEpD,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,IAAI,OAAO,GAAG,EAAE,CAAC;YACjB,OAAO,IAAI,EACX,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACjB,CAAC,EAAE,CAAC;gBACJ,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,CAAC;YACD,MAAM,CAAC,OAAO,CAAC;QAChB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,+BAAI,GAAJ,UAAK,IAAyB;YAE7B,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;gBACb,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YAC7B,IAAI;gBACH,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;YACzB,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;gBACd,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC;YACjC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACtB,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC;QAC5B,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,iCAAM,GAAN,UAAO,KAAa;YAEnB,IAAI,IAAI,GAAG,IAAI,gBAAgB,EAAK,CAAC;YACrC,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CACtC,CAAC;gBACA,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;gBACtB,IAAI,QAAQ,GAAoB,IAAI,CAAC;gBACrC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAC9B,CAAC;oBACA,QAAQ,GAAG,IAAI,CAAC;oBAChB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBAClB,CAAC;gBACD,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,CACxB,CAAC;oBACA,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;oBACxB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;oBACtB,IAAI,CAAC,KAAK,GAAQ,IAAI,CAAC;oBACvB,IAAI,CAAC,IAAI,GAAQ,IAAI,CAAC;gBACvB,CAAC;gBAAC,IAAI,CACN,CAAC;oBACA,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;oBAClB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;oBACtB,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC;oBACrB,QAAQ,CAAC,IAAI,GAAQ,IAAI,CAAC;oBAC1B,IAAI,CAAC,QAAQ,GAAQ,IAAI,CAAC;gBAC3B,CAAC;gBACD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;gBAClC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;YACrB,CAAC;YACD,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,gCAAK,GAAL;YAEC,IAAI,IAAI,GAAG,IAAI,gBAAgB,EAAK,CAAC;YACrC,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAG,IAAI,GAAG,IAAI,CAAC,IAAI,EACvD,CAAC;gBACA,IAAI,IAAI,GAAQ,IAAI,CAAC,IAAI,CAAC;gBAC1B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;oBACd,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;gBAC7B,IAAI;oBACH,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACtB,CAAC;YACD,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,wCAAa,GAAb;YAEC,IAAI,IAAI,GAAG,IAAI,gBAAgB,EAAK,CAAC;YACrC,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAG,IAAI,GAAG,IAAI,CAAC,IAAI;gBACtD,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAC9B,CAAC;oBACA,IAAI,IAAI,GAAQ,IAAI,CAAC,IAAI,CAAC;oBAC1B,EAAE,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC;wBACtB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;oBACrC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;wBACnB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;oBAC7B,IAAI;wBACH,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBACtB,CAAC;YACF,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,gCAAK,GAAL,UAAM,IAAY;YAEjB,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YACzB,IAAI,KAAK,GAA0B,CAAC,IAAI,CAAC,CAAC;YAC1C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,IAAI;gBACvC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YAClD,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,gCAAK,GAAL,UAAM,QAA8B;YAEnC,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,OAAO,IAAI,EACX,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvB,KAAK,EAAE,CAAC;gBACT,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,CAAC;YACD,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAAA,CAAC;QAEH,uBAAC;IAAD,CAAC,AAvxBD,CAAyC,GAAA,SAAS,GAuxBjD;IAvxBY,mBAAgB,mBAuxB5B,CAAA;AACF,CAAC,EAxzBS,EAAE,KAAF,EAAE,QAwzBX;AC5zBD;;;GAGG;AACH,IAAU,EAAE,CAqFX;AArFD,WAAU,EAAE;IAEX;QAcC;;;;WAIG;QACH,kCAAY,SAA8B;YAX1C;;;eAGG;YACH,YAAO,GAAoB,IAAI,CAAC;YAS/B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC5B,CAAC;QAED;;WAEG;QACH,wCAAK,GAAL;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC;QACrC,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,uCAAI,GAAJ;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;QAClC,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,uCAAI,GAAJ;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;QACpC,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,2CAAQ,GAAR;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;QACtC,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,yCAAM,GAAN;YAEC,MAAM,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;QACtB,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,0CAAO,GAAP;YAEC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;QAC1B,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,0CAAO,GAAP;YAEC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC;QACrB,CAAC;QAAA,CAAC;QACH,+BAAC;IAAD,CAAC,AAjFD,IAiFC;IAjFY,2BAAwB,2BAiFpC,CAAA;AAEF,CAAC,EArFS,EAAE,KAAF,EAAE,QAqFX;ACzFD;;;GAGG;AACH,IAAU,EAAE,CA4QX;AA5QD,WAAU,EAAE;IAEX;QAkCC;;;;WAIG;QACH,mBAAY,IAAY;YA9BxB,MAAC,GAAG,IAAI,CAAC;YAET,MAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAEvC,MAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YASvC;;;eAGG;YACH,UAAK,GAAiD,EAAE,CAAC;YAEzD;;;eAGG;YACH,cAAS,GAAG,CAAC,CAAC;YASb,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;YACd,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5C,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAE5C,IAAI,CAAC,IAAI,GAAG,UAAU,GAAG;gBAExB,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;YACvD,CAAC,CAAC;YACF,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YAEhB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;YAEnB,IAAI,CAAC,KAAK,EAAE,CAAC;QACd,CAAC;QAED;;;;WAIG;QACH,0BAAM,GAAN,UAAO,GAAW,EAAE,IAAO;YAE1B,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;QAC/D,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,6BAAS,GAAT,UAAU,GAAW;YAEpB,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YACtC,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YAC5B,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,KAAK,GAAG;gBACxD,EAAE,CAAC,IAAI,EAAE,CAAC;YACX,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,CACjB,CAAC;gBACA,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;gBAC9B,IAAI,CAAC,SAAS,EAAE,CAAC;YAClB,CAAC;QACF,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,gCAAY,GAAZ,UAAa,GAAW;YAEvB,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YACtC,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YAC5B,IAAI,WAAW,GAAG,CAAC,CAAC;YACpB,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE;gBACvC,EAAE,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,KAAK,GAAG,CAAC,CAC7B,CAAC;oBACA,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;oBAC9B,WAAW,EAAE,CAAC;gBACf,CAAC;YACF,IAAI,CAAC,SAAS,IAAI,WAAW,CAAC;QAC/B,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,0BAAM,GAAN,UAAO,GAAW;YAEjB,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YACtC,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YAC5B,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE;gBACvC,EAAE,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,KAAK,GAAG,CAAC;oBAC5B,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC;YAC3B,MAAM,CAAC,SAAS,CAAC;QAClB,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,+BAAW,GAAX,UAAY,GAAW,EAAE,QAAmC;YAE3D,QAAQ,GAAG,QAAQ,IAAI,UAAU,CAAC;gBAEjC,MAAM,CAAC,CAAC,KAAK,GAAG,CAAC;YAClB,CAAC,CAAC;YACF,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YACtC,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YAC5B,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE;gBACvC,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC;oBAC9B,MAAM,CAAC,IAAI,CAAC;YACd,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,6BAAS,GAAT,UAAU,GAAW;YAEpB,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YACtC,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YAC5B,IAAI,KAAK,GAAG,EAAE,CAAC;YACf,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE;gBACvC,EAAE,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,KAAK,GAAG,CAAC;oBAC5B,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC;YAChC,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,2BAAO,GAAP;YAEC,IAAI,IAAI,GAAG,EAAE,CAAC;YACd,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,EAClC,CAAC;gBACA,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;gBACrC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE;oBACvC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC;YAC9B,CAAC;YACD,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,4BAAQ,GAAR;YAEC,IAAI,KAAK,GAAG,EAAE,CAAC;YACf,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,EAClC,CAAC;gBACA,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;gBACrC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE;oBACvC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC;YAChC,CAAC;YACD,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,yBAAK,GAAL;YAEC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YAChB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE;gBACjC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,GAAA,gBAAgB,EAAE,CAAC;YACxC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACpB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,mCAAe,GAAf;YAEC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC;QACvB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,2BAAO,GAAP;YAEC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC;QACxB,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,2BAAO,GAAP,UAAQ,QAAwE;YAE/E,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE;gBACjC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAClC,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,0BAAM,GAAN,UAAO,QAAsD;YAE5D,IAAI,MAAM,GAAU,EAAE,CAAC;YACvB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE;gBACjC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAC/C,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,2BAAO,GAAP;YAEC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;QAClB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,yBAAK,GAAL;YAEC,IAAI,KAAK,GAAG,IAAI,SAAS,CAAI,IAAI,CAAC,IAAI,CAAC,CAAC;YACxC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE;gBACjC,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI;oBAC1D,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAAA,CAAC;QACH,gBAAC;IAAD,CAAC,AAxQD,IAwQC;IAxQY,YAAS,YAwQrB,CAAA;AAEF,CAAC,EA5QS,EAAE,KAAF,EAAE,QA4QX;AChRD;;;GAGG;AACH,IAAU,EAAE,CA4rBX;AA5rBD,WAAU,EAAE;IAEX;QAaC;;;;WAIG;QACH,gBAAY,IAAO;YAXnB;;;eAGG;YACH,SAAI,GAAmB,IAAI,CAAC;YAS3B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QAClB,CAAC;QACF,aAAC;IAAD,CAAC,AAtBD,IAsBC;IAtBY,SAAM,SAsBlB,CAAA;IAED;QAAmC,8BAAS;QAmB3C;;;;WAIG;QACH;YAAY,cAAc;iBAAd,UAAc,EAAd,qBAAc,EAAd,IAAc;gBAAd,yBAAc;;YAA1B,YAEC,iBAAO,SAcP;YArCD;;;eAGG;YACH,WAAK,GAAmB,IAAI,CAAC;YAC7B;;;eAGG;YACH,UAAI,GAAmB,IAAI,CAAC;YAC5B;;;eAGG;YACH,YAAM,GAAG,CAAC,CAAC;YAUV,KAAI,CAAC,KAAK,GAAQ,IAAI,CAAC;YACvB,KAAI,CAAC,IAAI,GAAQ,IAAI,CAAC;YACtB,KAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YAEhB,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,YAAY,KAAK,CAAC,CACzD,CAAC;gBACA,4DAA4D;gBAC5D,KAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,CAAC;YAAC,IAAI,CACN,CAAC;gBACA,wDAAwD;gBACxD,KAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACtB,CAAC;;QACF,CAAC;QAED;;WAEG;QACH,gCAAW,GAAX;YAEC,MAAM,CAAC,IAAI,GAAA,kBAAkB,CAAI,IAAI,CAAC,CAAC;QACxC,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,8BAAS,GAAT,UAAU,IAAO;YAEhB,IAAI,IAAI,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC;YAC5B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;YAClB,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;gBACd,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YAClB,IAAI,CAAC,MAAM,EAAE,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,6BAAQ,GAAR,UAAS,IAAO;YAEf,IAAI,IAAI,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC;YAC5B,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;gBACb,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACvB,IAAI;gBACH,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;YACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,IAAI,CAAC,MAAM,EAAE,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,6BAAQ,GAAR;YAEC,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAChB,CAAC;gBACA,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;gBACtB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;gBAC7B,IAAI,CAAC,MAAM,EAAE,CAAC;gBACd,IAAI,CAAC,IAAI,GAAQ,IAAI,CAAC;gBACtB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;YAClB,CAAC;YACD,MAAM,CAAC,SAAS,CAAC;QAClB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,4BAAO,GAAP;YAEC,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAChB,CAAC;gBACA,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBACrB,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;gBACtB,OAAO,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,EAClC,CAAC;oBACA,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBAClB,CAAC;gBACD,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC;oBACjB,IAAI,CAAC,IAAI,GAAQ,IAAI,CAAC;gBACvB,IAAI;oBACH,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;gBAClB,IAAI,CAAC,IAAI,GAAQ,IAAI,CAAC;gBACtB,IAAI,CAAC,MAAM,EAAE,CAAC;gBACd,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;YAClB,CAAC;YACD,MAAM,CAAC,SAAS,CAAC;QAClB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,kCAAa,GAAb,UAAc,KAAa;YAE1B,IAAI,MAAM,GAAG,EAAE,CAAC;YAChB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;gBAC5C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;YAC9B,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,iCAAY,GAAZ,UAAa,KAAa;YAEzB,IAAI,MAAM,GAAG,EAAE,CAAC;YAChB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;gBAC5C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;YAC7B,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,yBAAI,GAAJ;YAEC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAChB,MAAM,CAAC,SAAS,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;QACxB,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,0BAAK,GAAL,UAAM,IAAO,EAAE,KAAa;YAE3B,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;gBACb,MAAM,CAAC;YACR,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CACX,CAAC;gBACA,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;gBACrB,MAAM,CAAC;YACR,CAAC;YACD,EAAE,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,MAAM,CAAC,CAC1B,CAAC;gBACA,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBACpB,MAAM,CAAC;YACR,CAAC;YACD,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,KAAK,GAAG,CAAC,CAAC;gBACtB,IAAI,CAAC,QAAQ,CAAM,SAAS,CAAC,CAAC;YAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,EAAE,EAAG,IAAI,GAAG,IAAI,CAAC,IAAI,EACrD,CAAC;gBACA,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;oBACtB,IAAI,CAAC,QAAQ,CAAM,SAAS,CAAC,CAAC;YAChC,CAAC;YACD,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;gBACtB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACrB,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC;gBAC5B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACtB,IAAI,CACJ,CAAC;gBACA,IAAI,OAAO,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC/B,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBACzB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;gBACpB,IAAI,CAAC,MAAM,EAAE,CAAC;YACf,CAAC;QACF,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,6BAAQ,GAAR,UAAS,KAAa;YAErB,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;gBACxC,MAAM,CAAC,SAAS,CAAC;YAClB,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC;gBACf,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACxB,EAAE,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;gBAC7B,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;YACvB,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE;gBACxB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,gDAAgD;YAChD,gBAAgB;YAChB,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACrB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACtB,IAAI,CAAC,MAAM,EAAE,CAAC;YACd,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;QAClB,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,2BAAM,GAAN,UAAO,IAAO,EAAE,QAA+B;YAE9C,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,IAAI,QAAQ,GAAmB,IAAI,CAAC;YACpC,OAAO,IAAI,EACX,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CACxB,CAAC;oBACA,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC;wBACvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;oBACxB,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;wBACtB,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC;oBACtB,EAAE,CAAC,CAAC,QAAQ,CAAC;wBACZ,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;oBAC3B,MAAM,CAAC;gBACR,CAAC;gBACD,QAAQ,GAAG,IAAI,CAAC;gBAChB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,CAAC;QACF,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,8BAAS,GAAT,UAAU,IAAO,EAAE,QAA+B;YAEjD,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,IAAI,QAAQ,GAAmB,IAAI,CAAC;YACpC,OAAO,IAAI,EACX,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CACxB,CAAC;oBACA,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC;wBACvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;oBACxB,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;wBACtB,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC;oBACtB,EAAE,CAAC,CAAC,QAAQ,CAAC;wBACZ,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBAC5B,CAAC;gBAAC,IAAI;oBACL,QAAQ,GAAG,IAAI,CAAC;gBACjB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,CAAC;QACF,CAAC;QAAA,CAAC;QAEF;;;;;;WAMG;QACH,kCAAa,GAAb,UAAc,IAAY,EAAE,EAAU;YAErC,IAAI,MAAM,GAAG,EAAE,CAAC;YAChB,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAClC,CAAC;gBACA,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC;oBACd,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;gBACnC,EAAE,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;oBACvC,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,IAAI,EAAE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;gBAC7E,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;gBACtB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE;oBAChC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBAClB,gDAAgD;gBAChD,gBAAgB;gBAChB,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBACrB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EACrD,CAAC;oBACA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBAClB,CAAC;gBACD,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,IAAI,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;gBAC3D,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YAClB,CAAC;YACD,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,6BAAQ,GAAR,UAAS,KAAa,EAAE,IAAS;YAEhC,IAAI,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAC/B,EAAE,CAAC,CAAC,IAAI,CAAC;gBACR,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACnB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,0BAAK,GAAL;YAEC,IAAI,CAAC,KAAK,GAAQ,IAAI,CAAC;YACvB,IAAI,CAAC,IAAI,GAAQ,IAAI,CAAC;YACtB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QACjB,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,6BAAQ,GAAR,UAAS,IAAO,EAAE,QAA+B;YAEhD,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAC9C,CAAC;gBACA,CAAC,EAAE,CAAC;gBACJ,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,CAAC;YACD,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,4BAAO,GAAP,UAAQ,QAA0B;YAEjC,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,OAAO,IAAI,EACX,CAAC;gBACA,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAChC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,CAAC;QACF,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,4BAAO,GAAP,UAAQ,KAAa;YAEpB,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;gBACxC,MAAM,CAAC,SAAS,CAAC;YAClB,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE;gBACxB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,4BAAO,GAAP,UAAQ,KAAa;YAEpB,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;gBACxC,MAAM,CAAC,SAAS,CAAC;YAClB,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE;gBACxB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;QAClB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,4BAAO,GAAP;YAEC,IAAI,KAAK,GAAG,EAAE,CAAC;YACf,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE;gBAC7D,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;YACtB,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,8BAAS,GAAT;YAEC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;QACpB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,8BAAS,GAAT,UAAU,KAAU;YAEnB,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAG,IAAI,GAAG,IAAI,CAAC,IAAI;gBAC9E,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;gBAC9B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;oBAC9C,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI;gBACH,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM;oBACzC,IAAI,CAAC,OAAO,EAAE,CAAC;QAClB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,2BAAM,GAAN,UAAO,QAA8B;YAEpC,IAAI,MAAM,GAAG,EAAE,CAAC;YAChB,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI,EAClD,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzB,CAAC;YACD,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,4BAAO,GAAP;YAEC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,4BAAO,GAAP,UAAQ,IAAO,EAAE,QAA+B;YAE/C,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,OAAO,IAAI,EACX,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvB,MAAM,CAAC,CAAC,CAAC;gBACV,CAAC,EAAE,CAAC;gBACJ,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,CAAC;YACD,MAAM,CAAC,CAAC,CAAC,CAAC;QACX,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,gCAAW,GAAX,UAAY,IAAO,EAAE,QAA+B;YAEnD,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;YACf,OAAO,IAAI,EACX,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvB,KAAK,GAAG,CAAC,CAAC;gBACX,CAAC,EAAE,CAAC;gBACJ,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,CAAC;YACD,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,iCAAY,GAAZ,UAAa,IAAO,EAAE,QAA+B;YAEpD,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,IAAI,OAAO,GAAG,EAAE,CAAC;YACjB,OAAO,IAAI,EACX,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACjB,CAAC,EAAE,CAAC;gBACJ,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,CAAC;YACD,MAAM,CAAC,OAAO,CAAC;QAChB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,yBAAI,GAAJ,UAAK,IAAmB;YAEvB,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;gBACb,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YAC7B,IAAI;gBACH,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;YACzB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACtB,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC;QAC5B,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,2BAAM,GAAN,UAAO,KAAa;YAEnB,IAAI,IAAI,GAAG,IAAI,UAAU,EAAK,CAAC;YAC/B,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CACtC,CAAC;gBACA,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;gBACtB,IAAI,QAAQ,GAAmB,IAAI,CAAC;gBACpC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAC9B,CAAC;oBACA,QAAQ,GAAG,IAAI,CAAC;oBAChB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBAClB,CAAC;gBACD,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,CACxB,CAAC;oBACA,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;oBACxB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;oBACtB,IAAI,CAAC,KAAK,GAAQ,IAAI,CAAC;oBACvB,IAAI,CAAC,IAAI,GAAQ,IAAI,CAAC;gBACvB,CAAC;gBAAC,IAAI,CACN,CAAC;oBACA,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;oBAClB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;oBACtB,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC;oBACrB,QAAQ,CAAC,IAAI,GAAQ,IAAI,CAAC;gBAC3B,CAAC;gBACD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;gBAClC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;YACrB,CAAC;YACD,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,0BAAK,GAAL;YAEC,IAAI,IAAI,GAAG,IAAI,UAAU,EAAK,CAAC;YAC/B,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAG,IAAI,GAAG,IAAI,CAAC,IAAI,EACvD,CAAC;gBACA,IAAI,IAAI,GAAQ,IAAI,CAAC,IAAI,CAAC;gBAC1B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;oBACd,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;gBAC7B,IAAI;oBACH,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACtB,CAAC;YACD,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,kCAAa,GAAb;YAEC,IAAI,IAAI,GAAG,IAAI,UAAU,EAAK,CAAC;YAC/B,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAG,IAAI,GAAG,IAAI,CAAC,IAAI;gBACtD,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAC9B,CAAC;oBACA,IAAI,IAAI,GAAQ,IAAI,CAAC,IAAI,CAAC;oBAC1B,EAAE,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC;wBACtB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;oBACrC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;wBACnB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;oBAC7B,IAAI;wBACH,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBACtB,CAAC;YACF,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,0BAAK,GAAL,UAAM,IAAY;YAEjB,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YACzB,IAAI,KAAK,GAAoB,CAAC,IAAI,CAAC,CAAC;YACpC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,IAAI;gBACvC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YAClD,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,0BAAK,GAAL,UAAM,QAA8B;YAEnC,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,OAAO,IAAI,EACX,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvB,KAAK,EAAE,CAAC;gBACT,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,CAAC;YACD,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAAA,CAAC;QAEH,iBAAC;IAAD,CAAC,AAjqBD,CAAmC,GAAA,SAAS,GAiqB3C;IAjqBY,aAAU,aAiqBtB,CAAA;AACF,CAAC,EA5rBS,EAAE,KAAF,EAAE,QA4rBX;AChsBD;;;GAGG;AACH,IAAU,EAAE,CAwFX;AAxFD,WAAU,EAAE;IAEX;QAcC;;;;WAIG;QACH,4BAAY,SAAwB;YAXpC;;;eAGG;YACH,YAAO,GAAmB,IAAI,CAAC;YAS9B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;YAC3B,IAAI,CAAC,OAAO,GAAQ,IAAI,CAAC;QAC1B,CAAC;QAED;;WAEG;QACH,kCAAK,GAAL;YAEC,MAAM,CAAC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC;QAC5C,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,iCAAI,GAAJ;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;QAClC,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,iCAAI,GAAJ;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;QACpC,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,qCAAQ,GAAR;YAEC,IAAI,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC;YACxB,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,IAAI;gBAC3D,IAAI,CAAC,IAAI,EAAE,CAAC;QACd,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,mCAAM,GAAN;YAEC,MAAM,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;QACtB,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,oCAAO,GAAP;YAEC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;QAC1B,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,oCAAO,GAAP;YAEC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC;QACrB,CAAC;QAAA,CAAC;QAEH,yBAAC;IAAD,CAAC,AArFD,IAqFC;IArFY,qBAAkB,qBAqF9B,CAAA;AACF,CAAC,EAxFS,EAAE,KAAF,EAAE,QAwFX;AC5FD;;;GAGG;AACH,IAAU,EAAE,CAsSX;AAtSD,WAAU,EAAE;IAEX;QAAsC,iCAAS;QAa9C;;;WAGG;QACH;YAAA,YAEC,iBAAO,SAGP;YAfD;;;eAGG;YACH,YAAM,GAAG,CAAC,CAAC;YASV,KAAI,CAAC,KAAK,GAAG,IAAI,GAAA,UAAU,EAAY,CAAC;YACxC,KAAI,CAAC,MAAM,GAAG,CAAC,CAAC;;QACjB,CAAC;QAED;;WAEG;QACH,mCAAW,GAAX;YAEC,MAAM,CAAC,IAAI,GAAA,qBAAqB,CAAI,IAAI,CAAC,CAAC;QAC3C,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,+BAAO,GAAP,UAAQ,QAAgB,EAAE,IAAO;YAEhC,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YACxC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CACX,CAAC;gBACA,KAAK,GAAG,IAAI,GAAA,KAAK,EAAK,CAAC;gBACvB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YACpC,CAAC;YACD,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACpB,IAAI,CAAC,MAAM,EAAE,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,oCAAY,GAAZ,UAAa,QAAgB,EAAE,KAAY;YAE1C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;gBACpC,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,+BAAO,GAAP;YAEC,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;YAChC,IAAI,IAAI,GAAG,SAAS,CAAC;YACrB,EAAE,CAAC,CAAC,IAAI,CAAC,CACT,CAAC;gBACA,IAAI,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;gBACtB,IAAI,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;gBACvB,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;oBACnB,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;gBAC7B,IAAI,CAAC,MAAM,EAAE,CAAC;YACf,CAAC;YACD,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,oCAAY,GAAZ,UAAa,KAAa;YAEzB,IAAI,KAAK,GAAG,EAAE,CAAC;YACf,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;gBAC5C,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;YAC5B,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,8BAAM,GAAN,UAAO,KAAa,EAAE,MAAe;YAEpC,MAAM,GAAG,MAAM,IAAI,CAAC,CAAC;YACrB,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;YAClC,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,IAAI,MAAM,GAAG,CAAC,EAAE,EAAE,CAAC,QAAQ,EAAE,EACzD,CAAC;gBACA,IAAI,KAAK,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC;gBACzB,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,KAAK,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC,CAC5C,CAAC;oBACA,IAAI,SAAS,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;oBAClC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;oBAC5B,MAAM,IAAI,SAAS,GAAG,KAAK,CAAC;oBAC5B,KAAK,GAAG,CAAC,CAAC;oBACV,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC;wBACtB,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;gBACtC,CAAC;gBAAC,IAAI;oBACL,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;YACpC,CAAC;QACF,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,+BAAO,GAAP,UAAQ,KAAa;YAEpB,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;YAClC,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,QAAQ,EAAE,EAC3C,CAAC;gBACA,IAAI,KAAK,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC;gBACzB,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,KAAK,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;oBAC3C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBAC7B,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;YACnC,CAAC;YACD,MAAM,CAAM,SAAS,CAAC;QACvB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,gCAAQ,GAAR,UAAS,QAAgB;YAExB,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YACxC,EAAE,CAAC,CAAC,KAAK,CAAC;gBACT,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC;YACpB,MAAM,CAAC,EAAE,CAAC;QACX,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,4BAAI,GAAJ;YAEC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QACzC,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,iCAAS,GAAT;YAEC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;QACpB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,+BAAO,GAAP;YAEC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,6BAAK,GAAL;YAEC,IAAI,CAAC,KAAK,GAAG,IAAI,GAAA,UAAU,EAAE,CAAC;YAC9B,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QACjB,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,wCAAgB,GAAhB,UAAiB,QAAgB,EAAE,QAAmC;YAErE,EAAE,CAAC,CAAC,QAAQ,CAAC;gBACZ,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;YAC1C,IAAI;gBACH,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACvC,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,+BAAO,GAAP;YAEC,IAAI,KAAK,GAAG,IAAI,GAAA,KAAK,EAAK,CAAC;YAC3B,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;YAClC,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,QAAQ,EAAE,EAC3C,CAAC;gBACA,IAAI,IAAI,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC;gBACxB,IAAI,GAAG,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;gBAC7B,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,GAAG,CAAC,IAAI,EAAE;oBAC1C,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;YAC/B,CAAC;YACD,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,+BAAO,GAAP,UAAQ,QAA4B;YAEnC,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;YAClC,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,QAAQ,EAAE;gBAC1C,EAAE,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACjC,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,sCAAc,GAAd,UAAe,KAAa,EAAE,WAAmB;YAEhD,IAAI,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAC/B,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACnB,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;QACjC,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,8BAAM,GAAN,UAAO,QAA4B;YAElC,IAAI,MAAM,GAAG,EAAE,CAAC;YAChB,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;YAClC,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,QAAQ,EAAE,EAC3C,CAAC;gBACA,IAAI,GAAG,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC,WAAW,EAAE,CAAC;gBACrC,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,GAAG,CAAC,IAAI,EAAE,EAC3C,CAAC;oBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;wBAC3B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;gBAC7B,CAAC;YACF,CAAC;YACD,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,6BAAK,GAAL;YAEC,IAAI,KAAK,GAAG,IAAI,aAAa,EAAK,CAAC;YACnC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;YACjC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YAC3B,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,qCAAa,GAAb;YAEC,IAAI,KAAK,GAAG,IAAI,aAAa,EAAK,CAAC;YACnC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC;YACzC,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;YACrC,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAAA,CAAC;QAEH,oBAAC;IAAD,CAAC,AAnSD,CAAsC,GAAA,SAAS,GAmS9C;IAnSY,gBAAa,gBAmSzB,CAAA;AACF,CAAC,EAtSS,EAAE,KAAF,EAAE,QAsSX;AC1SD;;;GAGG;AACH,IAAU,EAAE,CA8FX;AA9FD,WAAU,EAAE;IAEX;QAmBC;;;;WAIG;QACH,+BAAY,SAA2B;YAhBvC;;;eAGG;YACH,gBAAW,GAA2B,IAAI,CAAC;YAC3C;;;eAGG;YACH,oBAAe,GAAG,CAAC,CAAC,CAAC;YASpB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;YAC3B,IAAI,CAAC,WAAW,GAAQ,IAAI,CAAC;YAC7B,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC;QAC3B,CAAC;QAED;;WAEG;QACH,qCAAK,GAAL;YAEC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;YAClD,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC;QAC1B,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,oCAAI,GAAJ;YAEC,IAAI,CAAC,eAAe,EAAE,CAAC;YACvB,EAAE,CAAC,CAAC,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CACjE,CAAC;gBACA,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC;gBAC7C,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC;YAC1B,CAAC;QACF,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,oCAAI,GAAJ;YAEC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;YAClD,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QAC9D,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,wCAAQ,GAAR;YAEC,IAAI,CAAC,eAAe,EAAE,CAAC;YACvB,EAAE,CAAC,CAAC,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC,CAC7B,CAAC;gBACA,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC;gBACzC,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC;oBACpB,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;YAC/D,CAAC;QACF,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,sCAAM,GAAN;YAEC,MAAM,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC;QAC1B,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,uCAAO,GAAP;YAEC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QAC1D,CAAC;QAAA,CAAC;QACH,4BAAC;IAAD,CAAC,AA3FD,IA2FC;IA3FY,wBAAqB,wBA2FjC,CAAA;AACF,CAAC,EA9FS,EAAE,KAAF,EAAE,QA8FX;AClGD;;;GAGG;AACH,IAAU,EAAE,CAoVX;AApVD,WAAU,EAAE;IAEX;QAA8B,yBAAS;QAetC;;;;WAIG;QACH;YAAY,cAAc;iBAAd,UAAc,EAAd,qBAAc,EAAd,IAAc;gBAAd,yBAAc;;YAA1B,YAEC,iBAAO,SAcP;YAlCD;;;eAGG;YACH,WAAK,GAAQ,EAAE,CAAC;YAEhB;;;;eAIG;YACH,iBAAW,GAAG,CAAC,CAAC;YAUf,KAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YAEhB,KAAI,CAAC,WAAW,GAAG,CAAC,CAAC;YAErB,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,YAAY,KAAK,CAAC,CACzD,CAAC;gBACA,4DAA4D;gBAC5D,KAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5B,CAAC;YAAC,IAAI,CACN,CAAC;gBACA,wDAAwD;gBACxD,KAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YACzB,CAAC;;QACF,CAAC;QAED;;WAEG;QACH,2BAAW,GAAX;YAEC,MAAM,CAAC,IAAI,GAAA,aAAa,CAAI,IAAI,CAAC,CAAC;QACnC,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,uBAAO,GAAP,UAAQ,IAAO;YAEd,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,4BAAY,GAAZ,UAAa,KAAU;YAEtB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;gBACpC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,uBAAO,GAAP;YAEC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;gBAC3C,MAAM,CAAC,SAAS,CAAC;YAElB,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,+CAA+C;YAC5F,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB;;;;eAIG;YACH,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAC9C,CAAC;gBACA,IAAI,CAAC,KAAK,EAAE,CAAC;YACd,CAAC;YAED,MAAM,CAAC,QAAQ,CAAC,CAAC,sBAAsB;QACxC,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,4BAAY,GAAZ,UAAa,KAAa;YAEzB,IAAI,QAAQ,GAAG,EAAE,CAAC,CAAC,wDAAwD;YAC3E,sCAAsC;YACtC,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YACjC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAC5E,CAAC;gBACA,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBACvB,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;YAC/B,CAAC;YAED,MAAM,CAAC,QAAQ,CAAC,CAAC,mDAAmD;QACrE,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,qBAAK,GAAL;YAEC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YACvC,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;QACtB,CAAC;QAED;;;;;WAKG;QACH,sBAAM,GAAN,UAAO,KAAa,EAAE,MAAe;YAEpC,MAAM,GAAG,MAAM,IAAI,CAAC,CAAC;YACrB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAClC,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,uBAAO,GAAP,UAAQ,KAAa;YAEpB,gCAAgC;YAChC,IAAI,KAAK,GAAG,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC;YACrC,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;gBACjE,MAAM,CAAM,SAAS,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC1B,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,oBAAI,GAAJ;YAEC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC;gBACxC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACrC,MAAM,CAAC,SAAS,CAAA;QACjB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,qBAAK,GAAL;YAEC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QACjB,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,wBAAQ,GAAR,UAAS,IAAO,EAAE,QAA+B;YAEhD,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;YACzB,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACvD,CAAC,EAAE,CAAC;YACL,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC9B,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,uBAAO,GAAP,UAAQ,QAAwB;YAE/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;gBACxD,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,yBAAS,GAAT;YAEC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC;QAC7C,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,uBAAO,GAAP;YAEC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;QAChD,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,sBAAM,GAAN,UAAO,QAA8B;YAEpC,IAAI,MAAM,GAAG,EAAE,CAAC;YAChB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;gBACxD,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC3B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,uBAAO,GAAP,UAAQ,IAAO,EAAE,QAA+B;YAE/C,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;YACzB,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAC5B,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC3B,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;gBAC7B,CAAC,EAAE,CAAC;YACL,CAAC;YACD,MAAM,CAAC,CAAC,CAAC,CAAC;QACX,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,2BAAW,GAAX,UAAY,IAAO,EAAE,QAA+B;YAEnD,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;YAC9B,OAAO,CAAC,GAAG,IAAI,CAAC,WAAW,GAAG,CAAC,EAC/B,CAAC;gBACA,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;gBACnC,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC3B,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;gBAC7B,CAAC,EAAE,CAAC;YACL,CAAC;YACD,MAAM,CAAC,CAAC,CAAC,CAAC;QACX,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,4BAAY,GAAZ,UAAa,IAAO,EAAE,QAA+B;YAEpD,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;YACzB,IAAI,OAAO,GAAG,EAAE,CAAC;YACjB,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAC5B,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC3B,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;gBACpC,CAAC,EAAE,CAAC;YACL,CAAC;YACD,MAAM,CAAC,OAAO,CAAC;QAChB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,qBAAK,GAAL;YAEC,IAAI,KAAK,GAAG,IAAI,KAAK,EAAK,CAAC;YAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EACzD,CAAC;gBACA,IAAI,IAAI,GAAQ,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC9B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;oBACd,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;gBAC7B,IAAI;oBACH,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACtB,CAAC;YAED,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,6BAAa,GAAb;YAEC,IAAI,KAAK,GAAG,IAAI,KAAK,EAAK,CAAC;YAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;gBACxD,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CACnC,CAAC;oBACA,IAAI,IAAI,GAAQ,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBAC9B,EAAE,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC;wBACtB,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;oBACrC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;wBACnB,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;oBAC7B,IAAI;wBACH,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBACtB,CAAC;YAEF,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAAA,CAAC;QACH,YAAC;IAAD,CAAC,AAhVD,CAA8B,GAAA,SAAS,GAgVtC;IAhVY,QAAK,QAgVjB,CAAA;AAEF,CAAC,EApVS,EAAE,KAAF,EAAE,QAoVX;ACxVD;;;GAGG;AACH,IAAU,EAAE,CA0EX;AA1ED,WAAU,EAAE;IAEX;QAaC;;;;WAIG;QACH,uBAAY,SAAmB;YAV/B;;;eAGG;YACH,YAAO,GAAG,CAAC,CAAC,CAAC;YAQZ,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;YAC3B,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;QACnB,CAAC;QAED;;WAEG;QACH,6BAAK,GAAL;YAEC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;QAClB,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,4BAAI,GAAJ;YAEC,IAAI,CAAC,OAAO,EAAE,CAAC;QAChB,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,4BAAI,GAAJ;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QAChD,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,gCAAQ,GAAR;YAEC,IAAI,CAAC,OAAO,EAAE,CAAC;QAChB,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,8BAAM,GAAN;YAEC,MAAM,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,IAAI,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3E,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,+BAAO,GAAP;YAEC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC7C,CAAC;QAAA,CAAC;QACH,oBAAC;IAAD,CAAC,AAvED,IAuEC;IAvEY,gBAAa,gBAuEzB,CAAA;AACF,CAAC,EA1ES,EAAE,KAAF,EAAE,QA0EX;AC9ED;;;GAGG;AACH,IAAU,EAAE,CAoBX;AApBD,WAAU,EAAE;IAER;;;;;;OAMG;IACH,eAAsB,IAAY,EAAE,EAAU,EAAE,IAAa;QAEzD,IAAI,KAAK,GAAG,EAAE,CAAC;QACf,IAAI,GAAG,IAAI,IAAI,CAAC,CAAC;QACjB,IAAI,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG,IAAI,EAAE,IAAI,IAAI,IAAI,EAAE,EAAE,CAAC;YACvD,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QAEpB,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAVe,QAAK,QAUpB,CAAA;AACL,CAAC,EApBS,EAAE,KAAF,EAAE,QAoBX;ACxBD,IAAU,EAAE,CA8nBX;AA9nBD,WAAU,EAAE;IAEX;QAiCC;;;;;WAKG;QACH,gBAAY,GAAW,EAAE,IAAO;YA3BhC;;;eAGG;YACH,WAAM,GAAmB,IAAI,CAAC;YAC9B;;;eAGG;YACH,SAAI,GAAmB,IAAI,CAAC;YAC5B;;;eAGG;YACH,UAAK,GAAmB,IAAI,CAAC;YAC7B;;;eAGG;YACH,SAAI,GAAG,GAAG,CAAC;YAUV,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;YACf,IAAI,CAAC,MAAM,GAAQ,IAAI,CAAC;YACxB,IAAI,CAAC,IAAI,GAAQ,IAAI,CAAC;YACtB,IAAI,CAAC,KAAK,GAAQ,IAAI,CAAC;YACvB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;QACjB,CAAC;QAEF,aAAC;IAAD,CAAC,AAjDD,IAiDC;IAjDY,SAAM,SAiDlB,CAAA;IAED;QAA+B,0BAAS;QAavC;;;WAGG;QACH;YAAA,YAEC,iBAAO,SAGP;YApBD;;;eAGG;YACH,UAAI,GAAmB,IAAI,CAAC;YAC5B;;;eAGG;YACH,UAAI,GAAG,CAAC,CAAC;YASR,KAAI,CAAC,IAAI,GAAQ,IAAI,CAAC;YACtB,KAAI,CAAC,IAAI,GAAG,CAAC,CAAC;;QACf,CAAC;QAED;;WAEG;QACH,4BAAW,GAAX;YAEC,MAAM,CAAC,IAAI,GAAA,cAAc,CAAI,IAAI,CAAC,CAAC;QACpC,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,uBAAM,GAAN,UAAO,GAAW,EAAE,IAAO;YAE1B,IAAI,IAAI,GAAG,IAAI,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YACjC,IAAI,CAAC,IAAI,EAAE,CAAC;YACZ,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CACf,CAAC;gBACA,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;gBACjB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;gBAChB,MAAM,CAAC;YACR,CAAC;YACD,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,GACzB,CAAC;gBACA,CAAC,GAAG,CAAC,CAAC;gBACN,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC;oBACf,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;gBACZ,IAAI;oBACH,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;YACd,CAAC;YACD,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YAChB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBACN,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YAClB,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC;gBACpB,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC;YACf,IAAI;gBACH,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC;YAEhB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,4BAAW,GAAX,UAAY,IAAe;YAE1B,GAAG,CAAC,CAAC,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC,MAAM,EAClF,CAAC;gBACA,EAAE,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAClC,CAAC;oBACA,IAAI,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;oBAChC,EAAE,CAAC,CAAC,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,CAChC,CAAC;wBACA,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;wBAClB,KAAK,CAAC,IAAI,GAAG,GAAG,CAAC;wBACjB,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;wBACzB,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;oBACtB,CAAC;oBAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,KAAK,CAAC,CACjC,CAAC;wBACA,IAAI,GAAG,MAAM,CAAC;wBACd,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;oBACvB,CAAC;oBAAC,IAAI,CACN,CAAC;wBACA,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;wBAClB,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;wBACzB,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;oBACjC,CAAC;gBACF,CAAC;gBAAC,IAAI,CACN,CAAC;oBACA,IAAI,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC;oBAC/B,EAAE,CAAC,CAAC,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,CAChC,CAAC;wBACA,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;wBAClB,KAAK,CAAC,IAAI,GAAG,GAAG,CAAC;wBACjB,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;wBACzB,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;oBACtB,CAAC;oBAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,CAAC,CAChC,CAAC;wBACA,IAAI,GAAG,MAAM,CAAC;wBACd,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;oBACxB,CAAC;oBAAC,IAAI,CACN,CAAC;wBACA,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;wBAClB,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;wBACzB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;oBAChC,CAAC;gBACF,CAAC;YACF,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;QACtB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,2BAAU,GAAV,UAAW,IAAe;YAEzB,IAAI,SAAS,CAAC;YACd,IAAI,CAAC,IAAI,EAAE,CAAC;YACZ,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;gBAC7B,SAAS,GAAG,IAAI,CAAC;YAClB,IAAI,CACJ,CAAC;gBACA,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;gBACjC,IAAI,CAAC,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC;gBACzB,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC;YAC5B,CAAC;YACD,IAAI,KAAK,CAAC;YACV,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC;gBACnB,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC;YACzB,IAAI;gBACH,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC;YACxB,EAAE,CAAC,CAAC,KAAK,CAAC;gBACT,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;YACjC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC;gBACrB,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;YACnB,IAAI,CAAC,EAAE,CAAC,CAAC,SAAS,KAAK,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC;gBAC5C,SAAS,CAAC,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC;YAC/B,IAAI;gBACH,SAAS,CAAC,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;YAEhC,EAAE,CAAC,CAAC,SAAS,CAAC,IAAI,KAAK,GAAG,CAAC;gBAC1B,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;QAC5C,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,4BAAW,GAAX,UAAY,IAAe,EAAE,MAAiB;YAE7C,OAAO,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC,EACzD,CAAC;gBACA,EAAE,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,CAAC,CACzB,CAAC;oBACA,IAAI,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC;oBAC3B,EAAE,CAAC,CAAC,OAAO,IAAI,OAAO,CAAC,IAAI,KAAK,GAAG,CAAC,CACpC,CAAC;wBACA,OAAO,CAAC,IAAI,GAAG,GAAG,CAAC;wBACnB,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;wBAClB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;wBACxB,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC;oBACxB,CAAC;oBACD,EAAE,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAC9G,CAAC;wBACA,OAAO,CAAC,IAAI,GAAG,GAAG,CAAC;wBACnB,IAAI,GAAG,MAAM,CAAC;oBACf,CAAC;oBAAC,IAAI,CACN,CAAC;wBACA,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,CACjD,CAAC;4BACA,OAAO,CAAC,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;4BACxB,OAAO,CAAC,IAAI,GAAG,GAAG,CAAC;4BACnB,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;4BAC1B,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC;wBACxB,CAAC;wBACD,OAAO,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;wBAC3B,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;wBAClB,OAAO,CAAC,KAAK,CAAC,IAAI,GAAG,GAAG,CAAC;wBACzB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;wBACxB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;oBAClB,CAAC;gBACF,CAAC;gBAAC,IAAI,CACN,CAAC;oBACA,IAAI,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC;oBAC1B,EAAE,CAAC,CAAC,OAAO,IAAI,OAAO,CAAC,IAAI,KAAK,GAAG,CAAC,CACpC,CAAC;wBACA,OAAO,CAAC,IAAI,GAAG,GAAG,CAAC;wBACnB,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;wBAClB,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;wBACzB,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC;oBACvB,CAAC;oBACD,EAAE,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAC9G,CAAC;wBACA,OAAO,CAAC,IAAI,GAAG,GAAG,CAAC;wBACnB,IAAI,GAAG,MAAM,CAAC;oBACf,CAAC;oBAAC,IAAI,CACN,CAAC;wBACA,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC,CAC/C,CAAC;4BACA,OAAO,CAAC,KAAK,CAAC,IAAI,GAAG,GAAG,CAAC;4BACzB,OAAO,CAAC,IAAI,GAAG,GAAG,CAAC;4BACnB,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;4BACzB,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC;wBACvB,CAAC;wBACD,OAAO,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;wBAC3B,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;wBAClB,OAAO,CAAC,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;wBACxB,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;wBACzB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;oBAClB,CAAC;gBACF,CAAC;gBACD,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YACtB,CAAC;YACD,EAAE,CAAC,CAAC,IAAI,CAAC;gBACR,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;QAClB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,0BAAS,GAAT,UAAU,IAAe;YAExB,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;gBACd,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACjC,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YACzB,OAAO,MAAM,IAAI,IAAI,KAAK,MAAM,CAAC,KAAK,EACtC,CAAC;gBACA,IAAI,GAAG,MAAM,CAAC;gBACd,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;YACxB,CAAC;YACD,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,4BAAW,GAAX,UAAY,IAAe;YAE1B,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;gBACb,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChC,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YACzB,OAAO,MAAM,IAAI,IAAI,KAAK,MAAM,CAAC,IAAI,EACrC,CAAC;gBACA,IAAI,GAAG,MAAM,CAAC;gBACd,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;YACxB,CAAC;YACD,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;;;;WAMG;QACH,uBAAM,GAAN,UAAO,GAAW,EAAE,IAAgB,EAAE,QAAuC;YAE5E,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC;YACzB,QAAQ,GAAG,QAAQ,IAAI,UAAU,IAAI;gBAEpC,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC;YACzB,CAAC,CAAC;YACF,OAAO,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAC7B,EAAE,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;oBAClB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBAClB,IAAI;oBACH,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACpB,EAAE,CAAC,CAAC,IAAI,CAAC;gBACR,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;YAClB,MAAM,CAAC,SAAS,CAAC;QAClB,CAAC;QAAA,CAAC;QAEF;;;;;;WAMG;QACH,yBAAQ,GAAR,UAAS,GAAW,EAAE,QAAuC;YAE5D,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,EAAO,IAAI,EAAE,QAAQ,CAAC,KAAK,SAAS,CAAC;QAC5D,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,6BAAY,GAAZ,UAAa,QAAkC;YAE9C,IAAI,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;YAC1B,OAAO,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC;gBACjC,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YAC7B,MAAM,CAAC,IAAI,KAAK,IAAI,CAAC;QACtB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,wBAAO,GAAP,UAAQ,IAAgB;YAEvB,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC;YACzB,OAAO,IAAI,IAAI,IAAI,CAAC,IAAI;gBACvB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,wBAAO,GAAP,UAAQ,IAAgB;YAEvB,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC;YACzB,OAAO,IAAI,IAAI,IAAI,CAAC,KAAK;gBACxB,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,2BAAU,GAAV,UAAW,IAAe;YAEzB,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;YACvB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC;YACxB,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC;gBACvB,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;YAC1B,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YAC3B,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC;gBACxB,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;YACnB,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;gBAClC,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC;YAC1B,IAAI;gBACH,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;YAC3B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;YACpB,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;QACnB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,4BAAW,GAAX,UAAY,IAAe;YAE1B,IAAI,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;YACtB,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC;YACxB,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,KAAK,IAAI,CAAC;gBACxB,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC;YAC3B,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YAC3B,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC;gBACxB,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;YACnB,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;gBAClC,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC;YAC1B,IAAI;gBACH,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;YAC3B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;YACpB,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC;QACpB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,wBAAO,GAAP;YAEC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;QAClB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,sBAAK,GAAL;YAEC,IAAI,IAAI,GAAG,IAAI,MAAM,EAAK,CAAC;YAC3B,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YAC5B,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EACxC,CAAC;gBACA,IAAI,IAAI,GAAQ,EAAE,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC;gBAClC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;oBACd,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;gBAC7C,IAAI;oBACH,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YACtC,CAAC;YAED,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,8BAAa,GAAb;YAEC,IAAI,IAAI,GAAG,IAAI,MAAM,EAAK,CAAC;YAC3B,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YAC5B,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EACxC,CAAC;gBACA,IAAI,QAAQ,GAAG,UAAU,IAAe;oBAEvC,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC;gBACzE,CAAC,CAAC;gBACF,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC,CAC/C,CAAC;oBACA,IAAI,IAAI,GAAQ,EAAE,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC;oBAClC,EAAE,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC;wBACtB,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;oBACrD,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;wBACnB,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;oBAC7C,IAAI;wBACH,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;gBACtC,CAAC;YACF,CAAC;YACD,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,wBAAO,GAAP;YAEC,IAAI,MAAM,GAAG,EAAE,CAAC;YAChB,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;gBAChE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxB,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,sBAAK,GAAL;YAEC,IAAI,CAAC,IAAI,GAAQ,IAAI,CAAC;YACtB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,wBAAO,GAAP;YAEC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,wBAAO,GAAP,UAAQ,QAAwB;YAE/B,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;gBAChE,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,uBAAM,GAAN,UAAO,QAA8B;YAEpC,IAAI,MAAM,GAAG,EAAE,CAAC;YAChB,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;gBAChE,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzB,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,wBAAO,GAAP,UAAQ,IAAO,EAAE,QAA+B;YAE/C,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,OAAO,IAAI,EACX,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvB,MAAM,CAAC,CAAC,CAAC;gBACV,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;gBAC5B,CAAC,EAAE,CAAC;YACL,CAAC;YACD,MAAM,CAAC,CAAC,CAAC,CAAC;QACX,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,4BAAW,GAAX,UAAY,IAAO,EAAE,QAA+B;YAEnD,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;YAC7C,OAAO,IAAI,EACX,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvB,MAAM,CAAC,CAAC,CAAC;gBACV,CAAC,EAAE,CAAC;gBACJ,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YAC/B,CAAC;YACD,MAAM,CAAC,CAAC,CAAC,CAAC;QACX,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,6BAAY,GAAZ,UAAa,IAAO,EAAE,QAA+B;YAEpD,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,IAAI,OAAO,GAAG,EAAE,CAAC;YACjB,OAAO,IAAI,EACX,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACjB,CAAC,EAAE,CAAC;gBACJ,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YAC7B,CAAC;YACD,MAAM,CAAC,OAAO,CAAC;QAChB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,wBAAO,GAAP,UAAQ,KAAa;YAEpB,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;gBACtC,MAAM,CAAC,SAAS,CAAC;YAClB,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;gBAC5E,CAAC,EAAE,CAAC;YACL,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;QAClB,CAAC;QAAA,CAAC;QACH,aAAC;IAAD,CAAC,AAvkBD,CAA+B,GAAA,SAAS,GAukBvC;IAvkBY,SAAM,SAukBlB,CAAA;AAEF,CAAC,EA9nBS,EAAE,KAAF,EAAE,QA8nBX;AC9nBD;;;GAGG;AACH,IAAU,EAAE,CAoFX;AApFD,WAAU,EAAE;IAEX;QAaC;;;;WAIG;QACH,wBAAY,SAAoB;YAVhC;;;eAGG;YACH,YAAO,GAAmB,IAAI,CAAC;YAQ9B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;YAC3B,IAAI,CAAC,OAAO,GAAQ,IAAI,CAAC;QAC1B,CAAC;QAED;;WAEG;QACH,8BAAK,GAAL;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;QACzC,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,6BAAI,GAAJ;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,6BAAI,GAAJ;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;QACzC,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,iCAAQ,GAAR;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzD,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,+BAAM,GAAN;YAEC,MAAM,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;QACtB,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,gCAAO,GAAP;YAEC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;QAC1B,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,gCAAO,GAAP;YAEC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC;QACrB,CAAC;QAAA,CAAC;QACH,qBAAC;IAAD,CAAC,AAjFD,IAiFC;IAjFY,iBAAc,iBAiF1B,CAAA;AACF,CAAC,EApFS,EAAE,KAAF,EAAE,QAoFX;ACxFD,IAAU,EAAE,CAirBX;AAjrBD,WAAU,EAAE;IAEX;QA2CC;;;;;WAKG;QACH,iBAAY,GAAW,EAAE,IAAO;YArChC;;;eAGG;YACH,WAAM,GAAoB,IAAI,CAAC;YAC/B;;;eAGG;YACH,SAAI,GAAoB,IAAI,CAAC;YAC7B;;;eAGG;YACH,UAAK,GAAoB,IAAI,CAAC;YAC9B;;;eAGG;YACH,SAAI,GAAoB,IAAI,CAAC;YAC7B;;;eAGG;YACH,aAAQ,GAAoB,IAAI,CAAC;YACjC;;;eAGG;YACH,SAAI,GAAG,GAAG,CAAC;YAUV,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;YACf,IAAI,CAAC,MAAM,GAAQ,IAAI,CAAC;YACxB,IAAI,CAAC,IAAI,GAAQ,IAAI,CAAC;YACtB,IAAI,CAAC,KAAK,GAAQ,IAAI,CAAC;YACvB,IAAI,CAAC,IAAI,GAAQ,IAAI,CAAC;YACtB,IAAI,CAAC,QAAQ,GAAQ,IAAI,CAAC;YAC1B,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;QACjB,CAAC;QACF,cAAC;IAAD,CAAC,AA5DD,IA4DC;IA5DY,UAAO,UA4DnB,CAAA;IAED;QAAmC,8BAAS;QAuB3C;YAAA,YAEC,iBAAO,SAKP;YA5BD;;;eAGG;YACH,UAAI,GAAoB,IAAI,CAAC;YAC7B;;;eAGG;YACH,WAAK,GAAoB,IAAI,CAAC;YAC9B;;;eAGG;YACH,UAAI,GAAoB,IAAI,CAAC;YAC7B;;;eAGG;YACH,UAAI,GAAG,CAAC,CAAC;YAKR,KAAI,CAAC,IAAI,GAAQ,IAAI,CAAC;YACtB,KAAI,CAAC,KAAK,GAAQ,IAAI,CAAC;YACvB,KAAI,CAAC,IAAI,GAAQ,IAAI,CAAC;YACtB,KAAI,CAAC,IAAI,GAAG,CAAC,CAAC;;QACf,CAAC;QAED;;WAEG;QACH,gCAAW,GAAX;YAEC,MAAM,CAAC,IAAI,GAAA,kBAAkB,CAAI,IAAI,CAAC,CAAC;QACxC,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,2BAAM,GAAN,UAAO,GAAW,EAAE,IAAO;YAE1B,IAAI,IAAI,GAAG,IAAI,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAClC,IAAI,CAAC,IAAI,EAAE,CAAC;YACZ,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CACf,CAAC;gBACA,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;gBACjB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;gBAClB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;gBACjB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;gBAChB,MAAM,CAAC;YACR,CAAC;YACD,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,GACzB,CAAC;gBACA,CAAC,GAAG,CAAC,CAAC;gBACN,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC;oBACf,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;gBACZ,IAAI;oBACH,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;YACd,CAAC;YACD,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YAChB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBACN,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YAClB,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC;gBACpB,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC;YACf,IAAI;gBACH,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC;YAEhB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACjC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CACd,CAAC;gBACA,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC;oBACtB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC;gBAChC,IAAI;oBACH,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;gBACnB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC;gBACnC,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;YAC3B,CAAC;YAAC,IAAI,CACN,CAAC;gBACA,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;gBACjB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;gBACvC,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;oBACjB,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC;gBAC3B,IAAI;oBACH,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;YACpB,CAAC;YAED,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,gCAAW,GAAX,UAAY,IAAgB;YAE3B,GAAG,CAAC,CAAC,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC,MAAM,EAClF,CAAC;gBACA,EAAE,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAClC,CAAC;oBACA,IAAI,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;oBAChC,EAAE,CAAC,CAAC,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,CAChC,CAAC;wBACA,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;wBAClB,KAAK,CAAC,IAAI,GAAG,GAAG,CAAC;wBACjB,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;wBACzB,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;oBACtB,CAAC;oBAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,KAAK,CAAC,CACjC,CAAC;wBACA,IAAI,GAAG,MAAM,CAAC;wBACd,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;oBACvB,CAAC;oBAAC,IAAI,CACN,CAAC;wBACA,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;wBAClB,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;wBACzB,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;oBACjC,CAAC;gBACF,CAAC;gBAAC,IAAI,CACN,CAAC;oBACA,IAAI,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC;oBAC/B,EAAE,CAAC,CAAC,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,CAChC,CAAC;wBACA,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;wBAClB,KAAK,CAAC,IAAI,GAAG,GAAG,CAAC;wBACjB,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;wBACzB,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;oBACtB,CAAC;oBAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,CAAC,CAChC,CAAC;wBACA,IAAI,GAAG,MAAM,CAAC;wBACd,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;oBACxB,CAAC;oBAAC,IAAI,CACN,CAAC;wBACA,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;wBAClB,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;wBACzB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;oBAChC,CAAC;gBACF,CAAC;YACF,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;QACtB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,+BAAU,GAAV,UAAW,IAAgB;YAE1B,IAAI,CAAC,IAAI,EAAE,CAAC;YACZ,IAAI,SAAS,CAAC;YACd,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;gBAC7B,SAAS,GAAG,IAAI,CAAC;YAClB,IAAI,CACJ,CAAC;gBACA,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;gBACjC,IAAI,CAAC,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC;gBACzB,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC;YAC5B,CAAC;YACD,IAAI,KAAK,CAAC;YACV,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC;gBACnB,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC;YACzB,IAAI;gBACH,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC;YACxB,EAAE,CAAC,CAAC,KAAK,CAAC;gBACT,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;YACjC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC;gBACrB,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;YACnB,IAAI,CAAC,EAAE,CAAC,CAAC,SAAS,KAAK,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC;gBAC5C,SAAS,CAAC,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC;YAC/B,IAAI;gBACH,SAAS,CAAC,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;YAEhC,EAAE,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC;gBAClB,SAAS,CAAC,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC;YAC9C,IAAI;gBACH,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC,QAAQ,CAAC;YAChC,EAAE,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC;gBACtB,SAAS,CAAC,QAAQ,CAAC,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC;YAC1C,IAAI;gBACH,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC;YAE7B,EAAE,CAAC,CAAC,SAAS,CAAC,IAAI,KAAK,GAAG,CAAC;gBAC1B,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;QAC5C,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,gCAAW,GAAX,UAAY,IAAgB,EAAE,MAAkB;YAE/C,OAAO,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC,EACzD,CAAC;gBACA,EAAE,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,CAAC,CACzB,CAAC;oBACA,IAAI,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC;oBAC3B,EAAE,CAAC,CAAC,OAAO,IAAI,OAAO,CAAC,IAAI,KAAK,GAAG,CAAC,CACpC,CAAC;wBACA,OAAO,CAAC,IAAI,GAAG,GAAG,CAAC;wBACnB,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;wBAClB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;wBACxB,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC;oBACxB,CAAC;oBACD,EAAE,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAC9G,CAAC;wBACA,OAAO,CAAC,IAAI,GAAG,GAAG,CAAC;wBACnB,IAAI,GAAG,MAAM,CAAC;oBACf,CAAC;oBAAC,IAAI,CACN,CAAC;wBACA,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,CACjD,CAAC;4BACA,OAAO,CAAC,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;4BACxB,OAAO,CAAC,IAAI,GAAG,GAAG,CAAC;4BACnB,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;4BAC1B,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC;wBACxB,CAAC;wBACD,OAAO,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;wBAC3B,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;wBAClB,OAAO,CAAC,KAAK,CAAC,IAAI,GAAG,GAAG,CAAC;wBACzB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;wBACxB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;oBAClB,CAAC;gBACF,CAAC;gBAAC,IAAI,CACN,CAAC;oBACA,IAAI,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC;oBAC1B,EAAE,CAAC,CAAC,OAAO,IAAI,OAAO,CAAC,IAAI,KAAK,GAAG,CAAC,CACpC,CAAC;wBACA,OAAO,CAAC,IAAI,GAAG,GAAG,CAAC;wBACnB,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;wBAClB,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;wBACzB,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC;oBACvB,CAAC;oBACD,EAAE,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAC9G,CAAC;wBACA,OAAO,CAAC,IAAI,GAAG,GAAG,CAAC;wBACnB,IAAI,GAAG,MAAM,CAAC;oBACf,CAAC;oBAAC,IAAI,CACN,CAAC;wBACA,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC,CAC/C,CAAC;4BACA,OAAO,CAAC,KAAK,CAAC,IAAI,GAAG,GAAG,CAAC;4BACzB,OAAO,CAAC,IAAI,GAAG,GAAG,CAAC;4BACnB,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;4BACzB,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC;wBACvB,CAAC;wBACD,OAAO,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;wBAC3B,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;wBAClB,OAAO,CAAC,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;wBACxB,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;wBACzB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;oBAClB,CAAC;gBACF,CAAC;gBACD,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YACtB,CAAC;YACD,EAAE,CAAC,CAAC,IAAI,CAAC;gBACR,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;QAClB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,8BAAS,GAAT,UAAU,IAAgB;YAEzB,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;gBACnC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;YAClB,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;gBACd,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACjC,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YACzB,OAAO,MAAM,IAAI,IAAI,KAAK,MAAM,CAAC,KAAK,EACtC,CAAC;gBACA,IAAI,GAAG,MAAM,CAAC;gBACd,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;YACxB,CAAC;YACD,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,gCAAW,GAAX,UAAY,IAAgB;YAE3B,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC;gBACxC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC;YACtB,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;gBACb,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChC,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YACzB,OAAO,MAAM,IAAI,IAAI,KAAK,MAAM,CAAC,IAAI,EACrC,CAAC;gBACA,IAAI,GAAG,MAAM,CAAC;gBACd,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;YACxB,CAAC;YACD,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;;;;WAMG;QACH,2BAAM,GAAN,UAAO,GAAW,EAAE,IAAiB,EAAE,QAAwC;YAE9E,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC;YACzB,QAAQ,GAAG,QAAQ,IAAI,UAAU,IAAI;gBAEpC,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC;YACzB,CAAC,CAAC;YACF,OAAO,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAC7B,EAAE,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;oBAClB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBAClB,IAAI;oBACH,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACpB,EAAE,CAAC,CAAC,IAAI,CAAC;gBACR,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;YAClB,MAAM,CAAC,SAAS,CAAC;QAClB,CAAC;QAAA,CAAC;QAEF;;;;;;WAMG;QACH,6BAAQ,GAAR,UAAS,GAAW,EAAE,QAAwC;YAE7D,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,EAAO,IAAI,EAAE,QAAQ,CAAC,KAAK,SAAS,CAAC;QAC5D,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,iCAAY,GAAZ,UAAa,QAAkC;YAE9C,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACtB,OAAO,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC;gBACjC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,MAAM,CAAC,IAAI,KAAK,IAAI,CAAC;QACtB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,4BAAO,GAAP,UAAQ,IAAiB;YAExB,EAAE,CAAC,CAAC,IAAI,CAAC;gBACR,OAAO,IAAI,IAAI,IAAI,CAAC,IAAI;oBACvB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACnB,IAAI;gBACH,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,4BAAO,GAAP,UAAQ,IAAiB;YAExB,EAAE,CAAC,CAAC,IAAI,CAAC;gBACR,OAAO,IAAI,IAAI,IAAI,CAAC,KAAK;oBACxB,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACpB,IAAI;gBACH,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,+BAAU,GAAV,UAAW,IAAgB;YAE1B,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;YACvB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC;YACxB,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC;gBACvB,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;YAC1B,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YAC3B,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC;gBACxB,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;YACnB,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;gBAClC,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC;YAC1B,IAAI;gBACH,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;YAC3B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;YACpB,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;QACnB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,gCAAW,GAAX,UAAY,IAAgB;YAE3B,IAAI,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;YACtB,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC;YACxB,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,KAAK,IAAI,CAAC;gBACxB,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC;YAC3B,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YAC3B,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC;gBACxB,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;YACnB,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;gBAClC,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC;YAC1B,IAAI;gBACH,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;YAC3B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;YACpB,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC;QACpB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,4BAAO,GAAP;YAEC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;QAClB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,0BAAK,GAAL;YAEC,IAAI,IAAI,GAAG,IAAI,UAAU,EAAK,CAAC;YAC/B,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YAC5B,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE;gBACvC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC;YAClD,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,kCAAa,GAAb;YAEC,IAAI,IAAI,GAAG,IAAI,UAAU,EAAK,CAAC;YAC/B,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YAC5B,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EACxC,CAAC;gBACA,IAAI,QAAQ,GAAG,UAAU,IAAgB;oBAExC,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC;gBACzE,CAAC,CAAC;gBACF,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC,CAC/C,CAAC;oBACA,IAAI,IAAI,GAAQ,EAAE,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC;oBAClC,EAAE,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC;wBACtB,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;oBACrD,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;wBACnB,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;oBAC7C,IAAI;wBACH,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;gBACtC,CAAC;YACF,CAAC;YACD,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,4BAAO,GAAP;YAEC,IAAI,MAAM,GAAG,EAAE,CAAC;YAChB,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI;gBACjD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxB,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,0BAAK,GAAL;YAEC,IAAI,CAAC,IAAI,GAAQ,IAAI,CAAC;YACtB,IAAI,CAAC,KAAK,GAAQ,IAAI,CAAC;YACvB,IAAI,CAAC,IAAI,GAAQ,IAAI,CAAC;YACtB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,4BAAO,GAAP;YAEC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,4BAAO,GAAP,UAAQ,QAAwB;YAE/B,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI;gBACjD,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,2BAAM,GAAN,UAAO,QAA8B;YAEpC,IAAI,MAAM,GAAG,EAAE,CAAC;YAChB,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI;gBACjD,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzB,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,4BAAO,GAAP,UAAQ,IAAO,EAAE,QAA+B;YAE/C,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YAC7B,OAAO,IAAI,EACX,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvB,MAAM,CAAC,CAAC,CAAC;gBACV,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBACjB,CAAC,EAAE,CAAC;YACL,CAAC;YACD,MAAM,CAAC,CAAC,CAAC,CAAC;QACX,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,gCAAW,GAAX,UAAY,IAAS,EAAE,QAAiC;YAEvD,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACxC,OAAO,IAAI,EACX,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvB,MAAM,CAAC,CAAC,CAAC;gBACV,CAAC,EAAE,CAAC;gBACJ,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;YACtB,CAAC;YACD,MAAM,CAAC,CAAC,CAAC,CAAC;QACX,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,iCAAY,GAAZ,UAAa,IAAS,EAAE,QAAiC;YAExD,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YAC7B,IAAI,OAAO,GAAG,EAAE,CAAC;YACjB,OAAO,IAAI,EACX,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACjB,CAAC,EAAE,CAAC;gBACJ,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,CAAC;YACD,MAAM,CAAC,OAAO,CAAC;QAChB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,4BAAO,GAAP,UAAQ,KAAa;YAEpB,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;gBACtC,MAAM,CAAC,SAAS,CAAC;YAClB,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI;gBAC7D,CAAC,EAAE,CAAC;YACL,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;QAClB,CAAC;QAAA,CAAC;QACH,iBAAC;IAAD,CAAC,AAhnBD,CAAmC,GAAA,SAAS,GAgnB3C;IAhnBY,aAAU,aAgnBtB,CAAA;AACF,CAAC,EAjrBS,EAAE,KAAF,EAAE,QAirBX;ACjrBD;;;GAGG;AACH,IAAU,EAAE,CAoFX;AApFD,WAAU,EAAE;IAEX;QAaC;;;;WAIG;QACH,4BAAY,SAAwB;YAXpC;;;eAGG;YACH,YAAO,GAAoB,IAAI,CAAC;YAS/B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;YAC3B,IAAI,CAAC,OAAO,GAAQ,IAAI,CAAC;QAC1B,CAAC;QAED;;WAEG;QACH,kCAAK,GAAL;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC;QACrC,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,iCAAI,GAAJ;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;QAClC,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,iCAAI,GAAJ;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;QACpC,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,qCAAQ,GAAR;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;QACtC,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,mCAAM,GAAN;YAEC,MAAM,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;QACtB,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,oCAAO,GAAP;YAEC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;QAC1B,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,oCAAO,GAAP;YAEC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC;QACrB,CAAC;QAAA,CAAC;QACH,yBAAC;IAAD,CAAC,AAjFD,IAiFC;IAjFY,qBAAkB,qBAiF9B,CAAA;AACF,CAAC,EApFS,EAAE,KAAF,EAAE,QAoFX;ACxFD;;;GAGG;AACH,IAAU,EAAE,CAiQX;AAjQD,WAAU,EAAE;IAEX;QAIC;;;;WAIG;QACH,iBAAY,IAAO;YAElB,IAAI,CAAC,OAAO,GAAG,IAAI,GAAA,gBAAgB,EAAU,CAAC;YAC9C,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QAClB,CAAC;QACF,cAAC;IAAD,CAAC,AAdD,IAcC;IAdY,UAAO,UAcnB,CAAA;IAED;QAuBC;;;WAGG;QACH;YAVA;;;eAGG;YACH,SAAI,GAAG,CAAC,CAAC;YAQR,IAAI,CAAC,OAAO,GAAG,IAAI,GAAA,gBAAgB,EAAE,CAAC;YACtC,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAA,gBAAgB,EAAE,CAAC;YACvC,IAAI,CAAC,IAAI,GAAG,IAAI,GAAA,gBAAgB,EAAE,CAAC;YACnC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACf,CAAC;QAED;;;;WAIG;QACH,oBAAM,GAAN,UAAO,OAAmB;YAEzB,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YAChC,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,CAAC,IAAI,EAAE,CAAC;QACb,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,yBAAW,GAAX,UAAY,QAAsB;YAEjC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EACxC,CAAC;gBACA,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpC,QAAQ,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACpC,CAAC;YACD,IAAI,CAAC,IAAI,IAAI,QAAQ,CAAC,MAAM,CAAC;QAC9B,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,mBAAK,GAAL,UAAM,GAAW;YAEhB,IAAI,MAAM,GAAG,IAAI,GAAG,EAAK,CAAC;YAC1B,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;YAC/B,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC9B,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC7B,iCAAiC;YACjC,IAAI,IAAI,GAAG,IAAI,CAAC;YAChB,IAAI,CAAC,GAAG,UAAU,IAAY;gBAE7B,EAAE,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC;oBACjB,MAAM,CAAC,MAAM,CAAC;gBACf,MAAM,CAAM,SAAS,CAAC;YACvB,CAAC,CAAC;YACF,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACjC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE;gBACvC,EAAE,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACjC,CAAC,GAAG,UAAU,IAAI;gBAEjB,EAAE,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC;oBAChB,MAAM,CAAC,MAAM,CAAC;gBACf,MAAM,CAAM,SAAS,CAAC;YACvB,CAAC,CAAC;YACF,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YAC5B,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE;gBACvC,EAAE,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,uBAAS,GAAT,UAAU,GAAW;YAEpB,IAAI,YAAY,GAAG,IAAI,GAAG,EAAK,CAAC;YAChC,iCAAiC;YACjC,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC;YACrC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE;gBACvC,EAAE,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;oBACtC,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;YAEpC,oCAAoC;YACpC,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACjC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EACxC,CAAC;gBACA,EAAE,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC,WAAW,EAAE,CAAC;gBAChC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE;oBACvC,EAAE,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;wBACtC,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;YACrC,CAAC;YACD,MAAM,CAAC,YAAY,CAAC;QACrB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,wBAAU,GAAV,UAAW,GAAW;YAErB,IAAI,IAAI,GAAG,IAAI,GAAG,EAAK,CAAC;YACxB,iCAAiC;YACjC,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC;YACrC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE;gBACvC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;oBACvC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;YAE5B,oCAAoC;YACpC,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACjC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EACxC,CAAC;gBACA,EAAE,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC,WAAW,EAAE,CAAC;gBAChC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE;oBACvC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;wBACvC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;YAC7B,CAAC;YACD,MAAM,CAAC,IAAI,CAAC;QACb,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,8BAAgB,GAAhB,UAAiB,GAAW;YAE3B,IAAI,GAAG,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC1B,IAAI,GAAG,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC;YACzB,IAAI,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;YACxB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE;gBAClC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE;oBAClC,OAAO,CAAC,MAAM,CAAC,IAAI,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAChD,MAAM,CAAC,OAAO,CAAC;QAChB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,uBAAS,GAAT,UAAU,GAAW;YAEpB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YACxB,IAAI,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC;QACvB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,wBAAU,GAAV,UAAW,IAAc;YAExB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;gBACnC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,sBAAQ,GAAR;YAEC,IAAI,KAAK,GAAG,EAAE,CAAC;YACf,iCAAiC;YACjC,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC;YACrC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE;gBACvC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC;YAE/B,qCAAqC;YACrC,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACjC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EACxC,CAAC;gBACA,EAAE,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC,WAAW,EAAE,CAAC;gBAChC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE;oBACvC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC;YAChC,CAAC;YACD,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,4BAAc,GAAd;YAEC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;QAClB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,qBAAO,GAAP;YAEC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,mBAAK,GAAL;YAEC,IAAI,CAAC,GAAG,IAAI,GAAG,EAAK,CAAC;YACrB,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;YACjC,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;YACnC,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YAC3B,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACnB,MAAM,CAAC,CAAC,CAAC;QACV,CAAC;QAAA,CAAC;QACH,UAAC;IAAD,CAAC,AA9OD,IA8OC;IA9OY,MAAG,MA8Of,CAAA;AACF,CAAC,EAjQS,EAAE,KAAF,EAAE,QAiQX;ACrQD;;GAEG;AACH,IAAU,EAAE,CA8RX;AA9RD,WAAU,EAAE;IAEX;QAA8B,yBAAS;QAOtC;;;;WAIG;QACH;YAAY,cAAc;iBAAd,UAAc,EAAd,qBAAc,EAAd,IAAc;gBAAd,yBAAc;;YAA1B,YAEC,iBAAO,SAYP;YAxBD;;;eAGG;YACH,WAAK,GAAQ,EAAE,CAAC;YASf,KAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YAEhB,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,YAAY,KAAK,CAAC,CACzD,CAAC;gBACA,6DAA6D;gBAC7D,KAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,CAAC;YAAC,IAAI,CACN,CAAC;gBACA,yDAAyD;gBACzD,KAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACtB,CAAC;;QACF,CAAC;QAED;;WAEG;QACH,2BAAW,GAAX;YAEC,MAAM,CAAC,IAAI,GAAA,aAAa,CAAI,IAAI,CAAC,CAAC;QACnC,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,oBAAI,GAAJ,UAAK,IAAO;YAEX,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,yBAAS,GAAT,UAAU,KAAU;YAEnB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;gBACpC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,mBAAG,GAAH;YAEC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;gBACtB,MAAM,CAAC,SAAS,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;QACzB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,wBAAQ,GAAR,UAAS,KAAa;YAErB,IAAI,MAAM,GAAG,EAAE,CAAC;YAChB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;gBAClD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;YACzB,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,oBAAI,GAAJ;YAEC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;gBACtB,MAAM,CAAC,SAAS,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC1C,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,qBAAK,GAAL;YAEC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QACjB,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,wBAAQ,GAAR,UAAS,IAAO,EAAE,QAA+B;YAEhD,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACvD,CAAC,EAAE,CAAC;YACL,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC9B,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,uBAAO,GAAP,UAAQ,QAAwB;YAE/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE;gBAC9C,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,uBAAO,GAAP,UAAQ,KAAa;YAEpB,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;gBAC9C,MAAM,CAAC,SAAS,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC;QAClD,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,yBAAS,GAAT;YAEC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC1B,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,uBAAO,GAAP;YAEC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC3B,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,sBAAM,GAAN,UAAO,QAA8B;YAEpC,IAAI,MAAM,GAAG,EAAE,CAAC;YAChB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAC/C,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC3B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7B,CAAC;YACD,MAAM,CAAC,MAAM,CAAC;QACf,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,uBAAO,GAAP,UAAQ,IAAO,EAAE,QAA+B;YAE/C,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;YAC9B,OAAO,CAAC,GAAG,CAAC,CAAC,EACb,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC3B,MAAM,CAAC,CAAC,CAAC;gBACV,CAAC,EAAE,CAAC;YACL,CAAC;YACD,MAAM,CAAC,CAAC,CAAC,CAAC;QACX,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,2BAAW,GAAX,UAAY,IAAO,EAAE,QAA+B;YAEnD,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAC5B,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC3B,MAAM,CAAC,CAAC,CAAC;gBACV,CAAC,EAAE,CAAC;YACL,CAAC;YACD,MAAM,CAAC,CAAC,CAAC,CAAC;QACX,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,4BAAY,GAAZ,UAAa,IAAO,EAAE,QAA+B;YAEpD,QAAQ,GAAG,QAAQ,IAAI,UAAU,EAAE;gBAElC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC;YACpB,CAAC,CAAC;YACF,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;YAC9B,IAAI,OAAO,GAAG,EAAE,CAAC;YACjB,OAAO,CAAC,GAAG,CAAC,CAAC,EACb,CAAC;gBACA,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC3B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACjB,CAAC,EAAE,CAAC;YACL,CAAC;YACD,MAAM,CAAC,OAAO,CAAC;QAChB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,qBAAK,GAAL;YAEC,IAAI,KAAK,GAAG,IAAI,KAAK,EAAK,CAAC;YAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAC1C,CAAC;gBACA,IAAI,IAAI,GAAQ,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC9B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;oBACd,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;gBAC1B,IAAI;oBACH,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;YAED,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,6BAAa,GAAb;YAEC,IAAI,KAAK,GAAG,IAAI,KAAK,EAAK,CAAC;YAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;gBACzC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CACnC,CAAC;oBACA,IAAI,IAAI,GAAQ,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBAC9B,EAAE,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC;wBACtB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;oBAClC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;wBACnB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;oBAC1B,IAAI;wBACH,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACnB,CAAC;YACF,MAAM,CAAC,KAAK,CAAC;QACd,CAAC;QAAA,CAAC;QACH,YAAC;IAAD,CAAC,AA3RD,CAA8B,GAAA,SAAS,GA2RtC;IA3RY,QAAK,QA2RjB,CAAA;AACF,CAAC,EA9RS,EAAE,KAAF,EAAE,QA8RX;ACjSD;;;GAGG;AACH,IAAU,EAAE,CA0EX;AA1ED,WAAU,EAAE;IAEX;QAaC;;;;WAIG;QACH,uBAAY,SAAmB;YAV/B;;;eAGG;YACH,YAAO,GAAG,CAAC,CAAC,CAAC;YAQZ,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;YAC3B,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;QACnB,CAAC;QAED;;WAEG;QACH,6BAAK,GAAL;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QAChD,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,4BAAI,GAAJ;YAEC,IAAI,CAAC,OAAO,EAAE,CAAC;QAChB,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,4BAAI,GAAJ;YAEC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;QAClB,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,gCAAQ,GAAR;YAEC,IAAI,CAAC,OAAO,EAAE,CAAC;QAChB,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,8BAAM,GAAN;YAEC,MAAM,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,IAAI,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3E,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,+BAAO,GAAP;YAEC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC3C,CAAC;QAAA,CAAC;QACH,oBAAC;IAAD,CAAC,AAvED,IAuEC;IAvEY,gBAAa,gBAuEzB,CAAA;AACF,CAAC,EA1ES,EAAE,KAAF,EAAE,QA0EX;AC9ED;;;GAGG;AACH,IAAU,EAAE,CA0OX;AA1OD,WAAU,EAAE;IAER;QAuBI;;;;;WAKG;QACH,eAAY,MAAe,EAAE,IAAQ;YA3BrC;;;eAGG;YACH,SAAI,GAAW,IAAI,CAAC;YACpB;;;eAGG;YACH,WAAM,GAAgB,IAAI,CAAC;YAC3B;;;eAGG;YACH,WAAM,GAAoB,IAAI,CAAC;YAC/B;;;eAGG;YACH,WAAM,GAAe,EAAE,CAAC;YAUpB,IAAI,CAAC,IAAI,GAAG,IAAI,IAAS,IAAI,CAAC;YAC9B,IAAI,CAAC,MAAM,GAAG,MAAM,IAAS,IAAI,CAAC;YAClC,IAAI,CAAC,MAAM,GAAQ,IAAI,CAAC;YACxB,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACrB,CAAC;QAEL,YAAC;IAAD,CAAC,AArCD,IAqCC;IArCY,QAAK,QAqCjB,CAAA;IAED;QAA6B,wBAAS;QAclC;;;WAGG;QACH;YAAA,YAEI,iBAAO,SAGV;YAfD;;;eAGG;YACH,UAAI,GAAG,CAAC,CAAC;YASL,KAAI,CAAC,IAAI,GAAG,IAAI,KAAK,CAAI,EAAE,CAAC,CAAC;YAC7B,KAAI,CAAC,IAAI,GAAG,CAAC,CAAC;;QAClB,CAAC;QAED;;WAEG;QACH,0BAAW,GAAX;YAEI,MAAM,CAAC,IAAI,GAAA,YAAY,CAAI,IAAI,CAAC,CAAC;QACrC,CAAC;QAAA,CAAC;QAEF;;;;;;WAMG;QACH,qBAAM,GAAN,UAAO,MAAc,EAAE,IAAQ;YAE3B,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAErB,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAC7D,CAAC;gBACG,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzC,EAAE,CAAC,CAAC;YACR,CAAC;YAED,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EACxB,CAAC;gBACG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,KAAK,EAAE,CAAC;gBAChD,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzC,EAAE,CAAC,CAAC;YACR,CAAC;YAED,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC;gBACtB,EAAE,IAAI,CAAC,IAAI,CAAC;YAEhB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;YACrB,IAAI,CAAC,IAAI,GAAQ,IAAI,CAAC;QAC1B,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,sBAAO,GAAP,UAAQ,MAAc;YAElB,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAErB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,IAAI,IAAI,EAAE,EAAE,CAAC,EAC9C,CAAC;gBACG,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7C,CAAC;YAED,IAAI,OAAO,GAAa,EAAE,CAAC;YAC3B,EAAE,CAAC,CAAC,IAAI,CAAC,CACT,CAAC;gBACG,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YACvC,CAAC;YACD,MAAM,CAAC,OAAO,CAAC;QACnB,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,6BAAc,GAAd,UAAe,MAAgB,EAAE,IAAe;YAE5C,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC;YAEzB,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAChB,CAAC;gBACG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC7B,CAAC;YAED,GAAG,CAAC,CAAC,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,CAC5B,CAAC;gBACG,EAAE,CAAC,CAAC,GAAG,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CACxD,CAAC;oBACG,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;gBAClD,CAAC;YACL,CAAC;QACL,CAAC;QAAA,CAAC;QAEF;;;;;WAKG;QACH,yBAAU,GAAV,UAAW,MAAc,EAAE,QAAwB;YAE/C,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAErB,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAC7D,CAAC;gBACG,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzC,EAAE,CAAC,CAAC;YACR,CAAC;YAED,qEAAqE;YACrE,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,CAClC,CAAC;gBACG,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,CAAC;QACL,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,sBAAO,GAAP,UAAQ,MAAc;YAElB,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAErB,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAC7D,CAAC;gBACG,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzC,EAAE,CAAC,CAAC;YACR,CAAC;YAED,qEAAqE;YACrE,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,CAClC,CAAC;gBACG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;YACrB,CAAC;YAED,MAAM,CAAC,SAAS,CAAC;QACrB,CAAC;QAAA,CAAC;QAEF;;;WAGG;QACH,sBAAO,GAAP;YAEI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;QACrB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,sBAAO,GAAP,UAAQ,IAAe;YAEnB,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC;YACzB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;QACvB,CAAC;QAAA,CAAC;QAEF;;;;WAIG;QACH,sBAAO,GAAP,UAAQ,IAAe;YAEnB,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC;YACzB,OAAO,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;gBAC9C,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC/C,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;QACvB,CAAC;QAAA,CAAC;QACN,WAAC;IAAD,CAAC,AAhMD,CAA6B,GAAA,SAAS,GAgMrC;IAhMY,OAAI,OAgMhB,CAAA;AACL,CAAC,EA1OS,EAAE,KAAF,EAAE,QA0OX;AC9OD;;;GAGG;AACH,IAAU,EAAE,CA2EX;AA3ED,WAAU,EAAE;IAEX;QAcC;;;;WAIG;QACH,sBAAY,SAAkB;YAX9B;;;eAGG;YACH,YAAO,GAAgB,IAAI,CAAC;YAS3B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;YAC3B,IAAI,CAAC,OAAO,GAAQ,IAAI,CAAC;QAC1B,CAAC;QAED;;WAEG;QACH,4BAAK,GAAL;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;QACzC,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,2BAAI,GAAJ;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,2BAAI,GAAJ;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;QACzC,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,+BAAQ,GAAR;YAEC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzD,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,6BAAM,GAAN;YAEC,MAAM,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;QACtB,CAAC;QAAA,CAAC;QAEF;;WAEG;QACH,8BAAO,GAAP;YAEC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;QAC1B,CAAC;QAAA,CAAC;QACH,mBAAC;IAAD,CAAC,AAxED,IAwEC;IAxEY,eAAY,eAwExB,CAAA;AACF,CAAC,EA3ES,EAAE,KAAF,EAAE,QA2EX"}
\ No newline at end of file
diff --git a/out/tests.js b/out/tests.js
new file mode 100644
index 0000000..d0446cc
--- /dev/null
+++ b/out/tests.js
@@ -0,0 +1,2265 @@
+/**
+ * Created by Stefano on 06/04/14.
+ */
+QUnit.test("BSTree - Insert test", function (assert) {
+    var tree = new ds.BSTree();
+    var keys = [];
+    for (var i = 0; i < 20; i++) {
+        keys.push(Math.random());
+        tree.insert(keys[i], i);
+    }
+    for (var j = 0; j < 20; j++)
+        assert.deepEqual(tree.search(keys[j]), j, "Insert node");
+});
+QUnit.test("BSTree - Minimum test", function (assert) {
+    var tree = new ds.BSTree();
+    var keys = [];
+    var min = 10;
+    for (var i = 0; i < 20; i++) {
+        keys.push(Math.random());
+        tree.insert(keys[i], i);
+        if (keys[i] < min)
+            min = keys[i];
+    }
+    assert.deepEqual(tree.minimum().item, tree.search(min), "Minimum");
+});
+QUnit.test("BSTree - Maximum test", function (assert) {
+    var tree = new ds.BSTree();
+    var keys = [];
+    var max = -1;
+    for (var i = 0; i < 20; i++) {
+        keys.push(Math.random());
+        tree.insert(keys[i], i);
+        if (keys[i] > max)
+            max = keys[i];
+    }
+    assert.deepEqual(tree.maximum().item, tree.search(max), "Maximum");
+});
+QUnit.test("BSTree - Successor test", function (assert) {
+    var tree = new ds.BSTree();
+    for (var i = 0; i < 20; i++)
+        tree.insert(i, i);
+    var it = tree.getIterator();
+    var j = 1;
+    for (it.first(); !it.isDone(); it.next(), j++) {
+        var successor = tree.successor(it.getNode());
+        if (successor)
+            assert.deepEqual(successor.item, j, "Successor");
+        else
+            assert.deepEqual(successor, null, "No successor");
+    }
+});
+QUnit.test("BSTree - Predecessor test", function (assert) {
+    var tree = new ds.BSTree();
+    for (var i = 0; i < 20; i++)
+        tree.insert(i, i);
+    var it = tree.getIterator();
+    var j = 18;
+    for (it.last(); !it.isDone(); it.previous(), j--) {
+        var predecessor = tree.predecessor(it.getNode());
+        if (predecessor)
+            assert.deepEqual(predecessor.item, j, "Predecessor");
+        else
+            assert.deepEqual(predecessor, null, "No predecessor");
+    }
+});
+QUnit.test("BSTree - Delete node test", function (assert) {
+    var tree = new ds.BSTree();
+    for (var i = 0; i < 20; i++)
+        tree.insert(i, i);
+    var j = 0;
+    while (tree.minimum()) {
+        assert.deepEqual(tree.minimum().item, j, "Deletion");
+        tree.deleteNode(tree.minimum());
+        j++;
+    }
+});
+/**
+ * Created by Stefano on 06/04/14.
+ */
+QUnit.test("BTree - Insert test", function (assert) {
+    var tree = new ds.BTree(100);
+    for (var i = 0; i < 100; i++)
+        tree.insert(i, i);
+    for (var j = 0; j < 100; j++) {
+        assert.deepEqual(tree.search(j), j, "Insert node");
+        assert.deepEqual(tree.getItem(j), j, "Insert node");
+    }
+});
+QUnit.test("BTree - Delete node test", function (assert) {
+    var tree = new ds.BTree(3);
+    for (var i = 0; i < 20; i++)
+        tree.insert(i, i);
+    tree.deleteKey(6);
+    assert.deepEqual(tree.search(6), undefined, "Delete node 6");
+});
+QUnit.test("BTree - Successor test", function (assert) {
+    var tree = new ds.BTree(3);
+    for (var i = 0; i < 20; i++)
+        tree.insert(i, i);
+    for (var j = -1; j < 19; j++)
+        assert.deepEqual(tree.successor(j), j + 1, "Successor found");
+    assert.deepEqual(tree.successor(19), -1, "Successor not found");
+});
+QUnit.test("BTree - Predecessor test", function (assert) {
+    var tree = new ds.BTree(4);
+    for (var i = 0; i < 40; i++)
+        tree.insert(i, i);
+    for (var j = 40; j > 0; j--)
+        assert.deepEqual(tree.predecessor(j), j - 1, "Predecessor");
+    assert.deepEqual(tree.predecessor(0), -1, "Predecessor not found");
+});
+QUnit.test("BTree - Minimum test", function (assert) {
+    var tree = new ds.BTree(3);
+    var keys = [];
+    var min = 10;
+    for (var i = 0; i < 20; i++) {
+        keys.push(Math.random());
+        tree.insert(keys[i], i);
+        if (keys[i] < min)
+            min = keys[i];
+    }
+    assert.deepEqual(tree.minimum(), tree.search(min), "Minimum item");
+    assert.deepEqual(tree.minimumKey(), min, "Minimum key");
+});
+QUnit.test("BTree - Maximum test", function (assert) {
+    var tree = new ds.BTree(3);
+    var keys = [];
+    var max = -1;
+    for (var i = 0; i < 20; i++) {
+        keys.push(Math.random());
+        tree.insert(keys[i], i);
+        if (keys[i] > max)
+            max = keys[i];
+    }
+    assert.deepEqual(tree.maximum(), tree.search(max), "Maximum item");
+    assert.deepEqual(tree.maximumKey(), max, "Maximum key");
+});
+QUnit.test("BTree - To array test", function (assert) {
+    var tree = new ds.BTree(3);
+    for (var i = 0; i < 5; i++)
+        tree.insert(i, i);
+    assert.deepEqual(tree.toArray(), [0, 1, 2, 3, 4], "To array");
+});
+QUnit.test("BTree - Filter test", function (assert) {
+    var tree = new ds.BTree(3);
+    for (var i = 0; i < 10; i++)
+        tree.insert(i, i);
+    var result = tree.filter(function (item) {
+        return Boolean(1 - item % 2);
+    });
+    assert.deepEqual(result, [0, 2, 4, 6, 8], "Filter on the even values");
+});
+QUnit.test("BTree - Clear test", function (assert) {
+    var tree = new ds.BTree(3);
+    tree.insert(0, 0);
+    tree.insert(2, 2);
+    tree.clear();
+    assert.deepEqual(tree.isEmpty(), true, "Clear tree");
+});
+QUnit.test("BTree - Is empty test", function (assert) {
+    var tree = new ds.BTree(3);
+    tree.insert(0, 0);
+    tree.insert(2, 2);
+    assert.deepEqual(tree.isEmpty(), false, "Is not empty");
+    tree.clear();
+    assert.deepEqual(tree.isEmpty(), true, "Is empty");
+});
+QUnit.test("BTree - Contains test", function (assert) {
+    var tree = new ds.BTree(3);
+    tree.insert(0, 0);
+    tree.insert(2, 2);
+    assert.deepEqual(tree.contains(0), true, "Contains 0");
+    assert.deepEqual(tree.contains(2), true, "Contains 2");
+    assert.deepEqual(tree.contains(1), false, "Not contains 1");
+    var callback = function (item) {
+        return item > 0;
+    };
+    assert.deepEqual(tree.fullContains(callback), true, "Contains a value > 0");
+    callback = function (item) {
+        return item < 0;
+    };
+    assert.deepEqual(tree.fullContains(callback), false, "Contains a value < 0");
+});
+QUnit.test("BTree - Execute test", function (assert) {
+    var tree = new ds.BTree();
+    tree.insert(0, 0);
+    tree.insert(2, 2);
+    var callback = function (item) {
+        return item * 2;
+    };
+    tree.execute(callback);
+    assert.deepEqual(tree.search(0), 0, "Execute for key 0");
+    assert.deepEqual(tree.search(2), 4, "Execute for key 1");
+});
+QUnit.test("BTree - Index of test", function (assert) {
+    var tree = new ds.BTree(3);
+    for (var i = 0; i < 10; i++)
+        tree.insert(i, i);
+    var callback = function (item) {
+        return !(item % 2) && item > 5;
+    };
+    assert.deepEqual(tree.indexOf(0), 0, "Index of 0");
+    assert.deepEqual(tree.indexOf(15), -1, "Index of 15");
+    assert.deepEqual(tree.indexOf(5), 5, "Index of 5");
+    assert.deepEqual(tree.indexOf(null, callback), 6, "Index of the first even number greater than 5");
+});
+QUnit.test("BTree - Last index of test", function (assert) {
+    var tree = new ds.BTree(3);
+    for (var i = 0; i < 10; i++)
+        tree.insert(i, i);
+    var callback = function (item) {
+        return !(item % 2) && item > 5;
+    };
+    assert.deepEqual(tree.lastIndexOf(0), 0, "Last index of 0");
+    assert.deepEqual(tree.lastIndexOf(15), -1, "Last index of 15");
+    assert.deepEqual(tree.lastIndexOf(5), 5, "Last index of 5");
+    assert.deepEqual(tree.lastIndexOf(null, callback), 8, "Index of the last even number greater than 5");
+});
+QUnit.test("BTree - Indexes of test", function (assert) {
+    var tree = new ds.BTree(3);
+    for (var i = 0; i < 30; i++)
+        tree.insert(i, i % 10);
+    var callback = function (item) {
+        return !(item % 2) && item > 5;
+    };
+    assert.deepEqual(tree.allIndexesOf(0), [0, 10, 20], "Indexes of 0");
+    assert.deepEqual(tree.allIndexesOf(15), [], "Indexes of 15");
+    assert.deepEqual(tree.allIndexesOf(5), [5, 15, 25], "Indexes of 5");
+    assert.deepEqual(tree.allIndexesOf(null, callback), [6, 8, 16, 18, 26, 28], "Indexes of the even numbers greater than 5");
+});
+QUnit.test("BTree - Clone test", function (assert) {
+    var tree = new ds.BTree(3);
+    for (var i = 0; i < 10; i++)
+        tree.insert(i, i);
+    var clone = tree.clone();
+    var it = clone.getIterator();
+    var j = 0;
+    for (it.first(); !it.isDone(); it.next(), j++)
+        assert.deepEqual(it.getItem(), j, "Clone of the tree");
+});
+QUnit.test("BTree - Clone distinct test", function (assert) {
+    var tree = new ds.BTree(3);
+    for (var i = 0; i < 20; i++)
+        tree.insert(i, i % 10);
+    var clone = tree.cloneDistinct();
+    assert.deepEqual(clone.allIndexesOf(2), [2], "Clone of the tree");
+});
+/**
+ * Created by Battistella Stefano on 31/03/14.
+ */
+QUnit.test("CircularBuffer - Write test", function (assert) {
+    var buffer = new ds.CircularBuffer(10);
+    buffer.write(0);
+    buffer.write(0);
+    buffer.write(0);
+    buffer.write(0);
+    for (var i = 0; i < 4; i++)
+        assert.deepEqual(buffer.read(i), 0, "Write 0");
+    for (var j = 4; j < 10; j++)
+        assert.deepEqual(buffer.read(j), undefined, "Write 0");
+    buffer.write(1);
+    buffer.write(1);
+    buffer.write(1);
+    buffer.write(1);
+    buffer.write(1);
+    buffer.write(1);
+    buffer.write(1);
+    buffer.write(1);
+    for (var m = 4; m < 12; m++)
+        assert.deepEqual(buffer.read(m), 1, "Write 1");
+    for (var n = 2; n < 4; n++)
+        assert.deepEqual(buffer.read(n), 0, "Write 1");
+    assert.deepEqual(buffer.isFull(), true, "Is full");
+});
+QUnit.test("CircularBuffer - Free test", function (assert) {
+    var buffer = new ds.CircularBuffer(10);
+    for (var k = 0; k < 12; k++)
+        buffer.write(k);
+    buffer.free(2, 8);
+    for (var i = 2; i < 8; i++)
+        assert.deepEqual(buffer.read(i), undefined, "Free 2...8");
+    assert.deepEqual(buffer.head, 2, "Free 2...8");
+    assert.deepEqual(buffer.tail, 8, "Free 2...8");
+    for (var l = 0; l < 12; l++)
+        buffer.write(l);
+    assert.deepEqual(buffer.head, 4, "Write 12 items");
+    assert.deepEqual(buffer.tail, 4, "Write 12 items");
+    buffer.free(8, 6);
+    for (var m = 8; m < 6; m = (m + 1) % 10)
+        assert.deepEqual(buffer.read(m), undefined, "Free 8...6");
+    assert.deepEqual(buffer.head, 8, "Free 8...6");
+    assert.deepEqual(buffer.tail, 6, "Free 8...6");
+    buffer.freeAll();
+    for (var j = 0; j < 10; j++)
+        assert.deepEqual(buffer.read(j), undefined, "Free all");
+    assert.deepEqual(buffer.isEmpty(), true, "Is empty");
+});
+QUnit.test("CircularBuffer - Empty test", function (assert) {
+    var buffer = new ds.CircularBuffer(10);
+    buffer.write(0);
+    buffer.write(0);
+    buffer.write(0);
+    assert.deepEqual(buffer.isEmpty(), false, "Is not empty");
+    buffer.free(0, 8);
+    assert.deepEqual(buffer.isEmpty(), true, "Is empty");
+});
+QUnit.test("CircularBuffer - Clone test", function (assert) {
+    var buffer = new ds.CircularBuffer(10);
+    for (var i = 0; i < 15; i++)
+        buffer.write(i);
+    var clone = buffer.clone();
+    for (var j = 0; j < 9; j++)
+        assert.deepEqual(clone.read(j), buffer.read(j), "Check items");
+    assert.deepEqual(clone.head, buffer.head, "Check head position");
+    assert.deepEqual(clone.tail, buffer.tail, "Check tail position");
+    assert.deepEqual(clone.isEmpty(), buffer.isEmpty(), "Check empty");
+    assert.deepEqual(clone.isFull(), buffer.isFull(), "Check empty");
+});
+QUnit.test("CircularBuffer - Resize test", function (assert) {
+    var buffer = new ds.CircularBuffer(5);
+    for (var i = 0; i < 8; i++)
+        buffer.write(i);
+    var clone = buffer.clone();
+    buffer.resize(10);
+    assert.deepEqual(buffer.head, 8, "Check head position");
+    assert.deepEqual(buffer.tail, 3, "Check tail position");
+    for (var j = 0; j < 10; j++)
+        if (j < 3 || j > 7)
+            assert.deepEqual(buffer.read(j), undefined, "Increase size");
+        else
+            assert.deepEqual(buffer.read(j), j, "Augment resize");
+    buffer = clone;
+    buffer.resize(3);
+    assert.deepEqual(buffer.head, 0, "Check head position");
+    assert.deepEqual(buffer.tail, 0, "Check tail position");
+    for (var k = 0; k < 3; k++)
+        assert.deepEqual(buffer.read(k), k + 3, "Decrease size");
+});
+QUnit.test("CircularBuffer - Iterator test", function (assert) {
+    var buffer = new ds.CircularBuffer(10);
+    var it = buffer.getIterator();
+    it.first();
+    assert.deepEqual(it.isDone(), true, "Check empty buffer iterator");
+    buffer.write(0);
+    buffer.write(0);
+    buffer.write(0);
+    buffer.write(0);
+    buffer.write(1);
+    buffer.write(1);
+    buffer.write(1);
+    buffer.write(1);
+    buffer.write(1);
+    buffer.write(1);
+    buffer.write(1);
+    buffer.write(1);
+    var result = [0, 0, 1, 1, 1, 1, 1, 1, 1, 1];
+    var i = 0;
+    for (it.first(); !it.isDone(); it.next(), i++)
+        assert.deepEqual(it.getItem(), result[i], "Check iterator");
+});
+/**
+ * Created by Stefano on 31/03/14.
+ */
+QUnit.test("DoubleLinkedList - Init test", function (assert) {
+    var list = new ds.DoubleLinkedList(0, 1, 2);
+    assert.deepEqual(list.toArray(), [0, 1, 2], "Init list");
+    list = new ds.DoubleLinkedList(2);
+    assert.deepEqual(list.toArray(), [2], "Init list");
+});
+QUnit.test("DoubleLinkedList - Init range test", function (assert) {
+    var list = new ds.DoubleLinkedList(ds.Range(0, 2));
+    assert.deepEqual(list.toArray(), [0, 1, 2], "Init list");
+    list = new ds.DoubleLinkedList(ds.Range(2, -2, -0.5));
+    assert.deepEqual(list.toArray(), [2, 1.5, 1, 0.5, 0, -0.5, -1, -1.5, -2], "Init list");
+});
+QUnit.test("DoubleLinkedList - Push test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    list.pushFront(0);
+    list.pushFront(1);
+    list.pushBack(2);
+    list.pushBack(3);
+    assert.deepEqual(list.getItem(0), 1, "Push front 1");
+    assert.deepEqual(list.getItem(1), 0, "Push front 0");
+    assert.deepEqual(list.getItem(2), 2, "Push back 2");
+    assert.deepEqual(list.getItem(3), 3, "Push back 3");
+});
+QUnit.test("DoubleLinkedList - Pop test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    list.pushFront(0);
+    list.pushFront(1);
+    list.pushBack(2);
+    list.pushBack(3);
+    assert.deepEqual(list.popBack(), 3, "Pop back 3");
+    assert.deepEqual(list.popFront(), 1, "Pop front 1");
+    assert.deepEqual(list.popBack(), 2, "Pop back 2");
+    assert.deepEqual(list.popFront(), 0, "Pop front 0");
+});
+QUnit.test("DoubleLinkedList - Remove at test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    list.pushFront(0);
+    list.pushFront(1);
+    list.pushBack(2);
+    list.pushBack(3);
+    assert.deepEqual(list.removeAt(1), 0, "Remove at 1");
+    assert.deepEqual(list.removeAt(1), 2, "Remove at 1");
+    assert.deepEqual(list.removeAt(1), 3, "Remove at 1");
+    assert.deepEqual(list.removeAt(0), 1, "Remove at 0");
+});
+QUnit.test("DoubleLinkedList - Remove test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    for (var i = 0; i < 30; i++)
+        list.pushBack(i % 10);
+    list.pushBack(15);
+    var callback = function (item) {
+        return !(item % 2) && item > 5;
+    };
+    list.remove(0);
+    assert.deepEqual(list.indexOf(0), 9, "Remove 0");
+    list.remove(15);
+    assert.deepEqual(list.indexOf(15), -1, "Remove 15");
+    list.remove(9);
+    list.remove(9);
+    list.remove(9);
+    assert.deepEqual(list.indexOf(9), -1, "Remove 9");
+    list.remove(0, callback);
+    assert.deepEqual(list.indexOf(6), 13, "Remove the first even numbers greater than 5");
+});
+QUnit.test("DoubleLinkedList - Remove all test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    for (var i = 0; i < 30; i++)
+        list.pushBack(i % 10);
+    var callback = function (item) {
+        return !(item % 2) && item > 5;
+    };
+    list.removeAll(0);
+    assert.deepEqual(list.indexOf(0), -1, "Remove all 0");
+    list.removeAll(9);
+    assert.deepEqual(list.indexOf(9), -1, "Remove all 9");
+    list.removeAll(0, callback);
+    assert.deepEqual(list.indexOf(8), -1, "Remove all the even numbers greater than 5");
+});
+QUnit.test("DoubleLinkedList - Remove segment test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    for (var i = 0; i < 10; i++)
+        list.pushBack(i);
+    assert.deepEqual(list.removeSegment(2, 6), [2, 3, 4, 5, 6], "Remove the segment from the list");
+    assert.deepEqual(list.toArray(), [0, 1, 7, 8, 9], "Remove the segment from the list");
+    assert.deepEqual(list.getLength(), 5, "Remove the segment from the list");
+    assert.deepEqual(list.removeSegment(2, 1), [7, 8, 9], "Remove the segment from the list");
+    assert.deepEqual(list.toArray(), [0, 1], "Remove the segment from the list");
+    assert.deepEqual(list.getLength(), 2, "Remove the segment from the list");
+});
+QUnit.test("DoubleLinkedList - Modify at test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    for (var i = 0; i < 4; i++)
+        list.pushBack(i);
+    list.modifyAt(2, 6);
+    assert.deepEqual(list.toArray(), [0, 1, 6, 3], "Change at valid position");
+    list.modifyAt(5, 5);
+    assert.deepEqual(list.toArray(), [0, 1, 6, 3], "Change at non valid position");
+});
+QUnit.test("DoubleLinkedList - Delete node test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    list.pushFront(0);
+    list.pushFront(1);
+    list.pushBack(2);
+    list.pushBack(3);
+    var it = list.getIterator();
+    for (it.first(); !it.isDone(); it.next())
+        if (it.getItem())
+            list.deleteNode(it.getNode());
+    assert.deepEqual(list.getItem(0), 0, "Delete node");
+});
+QUnit.test("DoubleLinkedList - Sort test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    var length = 100;
+    for (var i = 0; i < length; i++)
+        list.pushFront(i);
+    list.sort();
+    assert.deepEqual(list.getItem(0), 0, "Sort");
+    assert.deepEqual(list.getItem(length - 1), length - 1, "Sort");
+});
+QUnit.test("DoubleLinkedList - Sort with callback test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    var length = 100;
+    for (var i = 0; i < length; i++)
+        list.pushFront(i);
+    list.sort(function (item) {
+        return -item;
+    });
+    assert.deepEqual(list.getItem(0), length - 1, "Sort with callback");
+    assert.deepEqual(list.getItem(length - 1), 0, "Sort with callback");
+});
+QUnit.test("DoubleLinkedList - Filter test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    var length = 100;
+    for (var i = 0; i < length; i++)
+        list.pushFront(i);
+    var result = list.filter(function (item) {
+        return Boolean(1 - item % 2);
+    });
+    assert.deepEqual(result[0], 98, "Filter of the even values");
+    assert.deepEqual(result[result.length - 1], 0, "Filter on the even values");
+});
+QUnit.test("DoubleLinkedList - Reverse test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    var length = 100;
+    for (var i = 0; i < length; i++)
+        list.pushFront(i);
+    list.reverse();
+    assert.deepEqual(list.getItem(0), 0, "Reverse");
+    assert.deepEqual(list.getItem(length - 1), 99, "Reverse");
+});
+QUnit.test("DoubleLinkedList - Iterator test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    for (var i = 0; i < 100; i++)
+        list.pushBack(i);
+    var it = list.getIterator();
+    var j = 0;
+    for (it.first(); !it.isDone(); it.next(), j++) {
+        assert.deepEqual(it.getItem(), j, "Check iterator position");
+    }
+    for (it.last(); !it.isDone(); it.previous(), j--) {
+        assert.deepEqual(it.getItem(), j - 1, "Check iterator position");
+    }
+});
+QUnit.test("DoubleLinkedList - Add at test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    list.addAt(5, 0);
+    assert.deepEqual(list.peek(), 5, "Add at 0");
+    list.addAt(2, 1);
+    assert.deepEqual(list.getItem(1), 2, "Add at 1");
+    list.addAt(15, 6);
+    assert.deepEqual(list.getItem(2), undefined, "Add at 6");
+    assert.deepEqual(list.getItem(5), undefined, "Add at 6");
+    assert.deepEqual(list.getItem(6), 15, "Add at 6");
+    list.addAt(30, 6);
+    assert.deepEqual(list.getItem(6), 30, "Add at 6");
+    assert.deepEqual(list.getItem(7), 15, "Add at 6");
+    list.addAt(6, 0);
+    assert.deepEqual(list.peek(), 6, "Add at 0");
+});
+QUnit.test("DoubleLinkedList - MultiPop test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    list.pushFront(0);
+    list.pushFront(1);
+    list.pushBack(2);
+    list.pushBack(3);
+    assert.deepEqual(list.multiPopBack(2), [3, 2], "Multi pop back");
+    assert.deepEqual(list.multiPopFront(2), [1, 0], "Multi pop front");
+});
+QUnit.test("DoubleLinkedList - Get length test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    assert.deepEqual(list.getLength(), 0, "Get length empty");
+    list.pushFront(0);
+    list.pushFront(1);
+    list.pushBack(2);
+    list.pushBack(3);
+    assert.deepEqual(list.getLength(), 4, "Get length");
+    list.multiPopBack(2);
+    assert.deepEqual(list.getLength(), 2, "Get length");
+});
+QUnit.test("DoubleLinkedList - Peek test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    list.pushFront(0);
+    assert.deepEqual(list.peek(), 0, "Peek");
+    list.pushFront(1);
+    list.pushBack(2);
+    assert.deepEqual(list.peek(), 1, "Peek");
+    list.pushBack(3);
+    assert.deepEqual(list.peek(), 1, "Peek");
+});
+QUnit.test("DoubleLinkedList - Clear test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    list.pushFront(0);
+    list.pushFront(1);
+    list.pushBack(2);
+    list.pushBack(3);
+    list.clear();
+    assert.deepEqual(list.getLength(), 0, "Clear the list");
+});
+QUnit.test("DoubleLinkedList - Is empty test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    assert.deepEqual(list.isEmpty(), true, "Is empty");
+    list.pushFront(0);
+    list.pushFront(1);
+    list.pushBack(2);
+    list.pushBack(3);
+    assert.deepEqual(list.isEmpty(), false, "Is not empty");
+    list.clear();
+    assert.deepEqual(list.isEmpty(), true, "Is empty");
+});
+QUnit.test("DoubleLinkedList - contains", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    list.pushBack(0);
+    list.pushBack(2);
+    assert.deepEqual(list.contains(0), true, "Contains 0");
+    assert.deepEqual(list.contains(2), true, "Contains 2");
+    assert.deepEqual(list.contains(1), false, "Not contains 1");
+    var callback = function (item) {
+        return item > 0;
+    };
+    assert.deepEqual(list.contains(null, callback), true, "Contains a value > 0");
+    callback = function (item) {
+        return item < 0;
+    };
+    assert.deepEqual(list.contains(null, callback), false, "Contains a value < 0");
+});
+QUnit.test("DoubleLinkedList - execute", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    list.pushBack(0);
+    list.pushBack(2);
+    var callback = function (item) {
+        return item * 2;
+    };
+    list.execute(callback);
+    assert.deepEqual(list.getItem(0), 0, "Execute for item 0");
+    assert.deepEqual(list.getItem(1), 4, "Execute for item 1");
+});
+QUnit.test("DoubleLinkedList - Index of test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    for (var i = 0; i < 10; i++)
+        list.pushBack(i);
+    var callback = function (item) {
+        return !(item % 2) && item > 5;
+    };
+    assert.deepEqual(list.indexOf(0), 0, "Index of 0");
+    assert.deepEqual(list.indexOf(15), -1, "Index of 15");
+    assert.deepEqual(list.indexOf(5), 5, "Index of 5");
+    list.removeAt(5);
+    assert.deepEqual(list.indexOf(6), 5, "Index of 6");
+    assert.deepEqual(list.indexOf(null, callback), 5, "Index of the first even number greater than 5");
+});
+QUnit.test("DoubleLinkedList - Last index of test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    for (var i = 0; i < 10; i++)
+        list.pushBack(i);
+    var callback = function (item) {
+        return !(item % 2) && item > 5;
+    };
+    assert.deepEqual(list.lastIndexOf(0), 0, "Last index of 0");
+    assert.deepEqual(list.lastIndexOf(15), -1, "Last index of 15");
+    assert.deepEqual(list.lastIndexOf(5), 5, "Last index of 5");
+    list.removeAt(5);
+    assert.deepEqual(list.lastIndexOf(6), 5, "Last index of 6");
+    assert.deepEqual(list.lastIndexOf(null, callback), 7, "Index of the last even number greater than 5");
+});
+QUnit.test("DoubleLinkedList - Indexes of test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    for (var i = 0; i < 30; i++)
+        list.pushBack(i % 10);
+    var callback = function (item) {
+        return !(item % 2) && item > 5;
+    };
+    assert.deepEqual(list.allIndexesOf(0), [0, 10, 20], "Indexes of 0");
+    assert.deepEqual(list.allIndexesOf(15), [], "Indexes of 15");
+    assert.deepEqual(list.allIndexesOf(5), [5, 15, 25], "Indexes of 5");
+    list.removeAt(5);
+    assert.deepEqual(list.allIndexesOf(5), [14, 24], "Indexes of 5");
+    assert.deepEqual(list.allIndexesOf(6), [5, 15, 25], "Indexes of 6");
+    assert.deepEqual(list.allIndexesOf(null, callback), [5, 7, 15, 17, 25, 27], "Indexes of the even numbers greater than 5");
+});
+QUnit.test("DoubleLinkedList - Join test", function (assert) {
+    var listA = new ds.DoubleLinkedList();
+    var listB = new ds.DoubleLinkedList();
+    for (var i = 0; i < 5; i++) {
+        listA.pushBack(i);
+        listB.pushBack(i);
+    }
+    listA.join(listB);
+    assert.deepEqual(listA.allIndexesOf(3), [3, 8], "Join of the lists");
+    assert.deepEqual(listA.getLength(), 10, "Check the length of the list");
+});
+QUnit.test("DoubleLinkedList - Divide test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    for (var i = 0; i < 10; i++)
+        list.pushBack(i);
+    var listA = list.divide(-1);
+    assert.deepEqual(listA.isEmpty(), true, "Divide before start");
+    var listB = list.divide(10);
+    assert.deepEqual(listB.isEmpty(), true, "Divide after end");
+    var listC = list.divide(8);
+    assert.deepEqual(listC.getItem(0), 8, "Divide at valid position");
+    assert.deepEqual(listC.getItem(1), 9, "Divide at valid position");
+    assert.deepEqual(listC.getLength(), 2, "Divide at valid position");
+    assert.deepEqual(list.getItem(8), undefined, "Divide at valid position");
+    assert.deepEqual(list.getLength(), 8, "Divide at valid position");
+    var listD = list.divide(0);
+    assert.deepEqual(listD.getLength(), 8, "Divide at the first position");
+    assert.deepEqual(listD.getItem(0), 0, "Divide at the first position");
+    assert.deepEqual(listD.getItem(8), undefined, "Divide at the first position");
+    assert.deepEqual(listD.getItem(7), 7, "Divide at the first position");
+    assert.deepEqual(list.getLength(), 0, "Divide at the first position");
+    assert.deepEqual(list.getItem(0), undefined, "Divide at the first position");
+});
+QUnit.test("DoubleLinkedList - Clone test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    for (var i = 0; i < 10; i++)
+        list.pushBack(i);
+    var clone = list.clone();
+    var it = clone.getIterator();
+    var j = 0;
+    for (it.first(); !it.isDone(); it.next(), j++)
+        assert.deepEqual(it.getItem(), j, "Clone of the list");
+});
+QUnit.test("DoubleLinkedList - Clone distinct test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    for (var i = 0; i < 20; i++)
+        list.pushBack(i % 10);
+    var clone = list.cloneDistinct();
+    assert.deepEqual(clone.allIndexesOf(2), [2], "Clone of the list");
+});
+QUnit.test("DoubleLinkedList - Split test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    for (var i = 0; i < 7; i++)
+        list.pushBack(i);
+    var lists = list.split(3);
+    assert.deepEqual(lists.length, 3, "Check the number of lists created");
+    assert.deepEqual(lists[0].toArray(), [0, 1, 2], "Check the items in the lists created");
+    assert.deepEqual(lists[1].toArray(), [3, 4, 5], "Check the items in the lists created");
+    assert.deepEqual(lists[2].toArray(), [6], "Check the items in the lists created");
+});
+QUnit.test("DoubleLinkedList - Count test", function (assert) {
+    var list = new ds.DoubleLinkedList();
+    for (var i = 0; i < 10; i++)
+        list.pushBack(i);
+    var callback = function (item) {
+        return item > 4;
+    };
+    assert.deepEqual(list.count(callback), 5, "Count the items that are greater than 4");
+});
+/**
+ * Created by Stefano on 31/03/14.
+ */
+QUnit.test("HashTable - Insert test", function (assert) {
+    var table = new ds.HashTable(4);
+    for (var i = 0; i < 20; i++)
+        table.insert(i, "Insert # " + i);
+    for (var j = 0; j < 20; j++)
+        assert.deepEqual(table.search(j), "Insert # " + j, "Insert " + j);
+});
+QUnit.test("HashTable - Delete key test", function (assert) {
+    var table = new ds.HashTable(4);
+    for (var i = 0; i < 20; i++)
+        table.insert(i, i);
+    table.deleteKey(6);
+    assert.deepEqual(table.search(6), undefined, "Delete key");
+});
+QUnit.test("HashTable - Delete all key test", function (assert) {
+    var table = new ds.HashTable(4);
+    for (var i = 0; i < 100; i++)
+        table.insert(i % 20, { value: i % 20 });
+    table.deleteAllKey(13);
+    assert.deepEqual(table.searchAll(13).length, 0, "Delete all key");
+});
+QUnit.test("HashTable - Get keys test", function (assert) {
+    var table = new ds.HashTable(50);
+    var keys = [];
+    for (var i = 0; i < 100; i++) {
+        table.insert(i, { value: i % 20 });
+        keys.push(i);
+    }
+    keys.sort();
+    var storedKeys = table.getKeys().sort();
+    assert.deepEqual(storedKeys, keys, "Get stored keys");
+});
+QUnit.test("HashTable - Get items test", function (assert) {
+    var table = new ds.HashTable(50);
+    var items = [];
+    for (var i = 0; i < 100; i++) {
+        table.insert(i, i % 20);
+        items.push(i % 20);
+    }
+    items.sort();
+    var storedKeys = table.getItems().sort();
+    assert.deepEqual(storedKeys, items, "Get stored items");
+});
+QUnit.test("HashTable - Contains key test", function (assert) {
+    var table = new ds.HashTable(50);
+    for (var i = 0; i < 100; i++)
+        table.insert(i, i % 20);
+    assert.deepEqual(table.containsKey(4), true, "Contains key");
+    assert.deepEqual(table.containsKey(200), false, "Not contains key");
+    var callback = function (k) {
+        return k > 20;
+    };
+    assert.deepEqual(table.containsKey(0, callback), true, "Contains key greater than 20");
+    callback = function (k) {
+        return k < 0;
+    };
+    assert.deepEqual(table.containsKey(0, callback), false, "Not contains negative key");
+});
+QUnit.test("HashTable - Clear test", function (assert) {
+    var table = new ds.HashTable(50);
+    for (var i = 0; i < 100; i++)
+        table.insert(i, i % 20);
+    assert.deepEqual(table.isEmpty(), false, "Before clear");
+    table.clear();
+    assert.deepEqual(table.isEmpty(), true, "After clear");
+});
+QUnit.test("HashTable - Get number of keys test", function (assert) {
+    var table = new ds.HashTable(50);
+    assert.deepEqual(table.getNumberOfKeys(), 0, "Before insertion");
+    for (var i = 0; i < 100; i++)
+        table.insert(i, i % 20);
+    assert.deepEqual(table.getNumberOfKeys(), 100, "After insertion");
+});
+QUnit.test("HashTable - Is empty test", function (assert) {
+    var table = new ds.HashTable(50);
+    assert.deepEqual(table.isEmpty(), true, "Before insertion");
+    for (var i = 0; i < 100; i++)
+        table.insert(i, i % 20);
+    assert.deepEqual(table.isEmpty(), false, "Before clear");
+    table.clear();
+    assert.deepEqual(table.isEmpty(), true, "After clear");
+});
+/**
+ * Created by Stefano on 31/03/14.
+ */
+QUnit.test("LinkedList - Init test", function (assert) {
+    var list = new ds.LinkedList(0, 1, 2);
+    assert.deepEqual(list.toArray(), [0, 1, 2], "Init list");
+    list = new ds.LinkedList(0);
+    assert.deepEqual(list.toArray(), [0], "Init list");
+});
+QUnit.test("LinkedList - Init test with range", function (assert) {
+    var list = new ds.LinkedList(ds.Range(0, 5));
+    assert.deepEqual(list.toArray(), [0, 1, 2, 3, 4, 5], "Init list with range");
+});
+QUnit.test("LinkedList - Push test", function (assert) {
+    var list = new ds.LinkedList();
+    list.pushFront(0);
+    list.pushFront(1);
+    list.pushBack(2);
+    list.pushBack(3);
+    assert.deepEqual(list.getItem(0), 1, "Push front 1");
+    assert.deepEqual(list.getItem(1), 0, "Push front 0");
+    assert.deepEqual(list.getItem(2), 2, "Push back 2");
+    assert.deepEqual(list.getItem(3), 3, "Push back 3");
+});
+QUnit.test("LinkedList - Pop test", function (assert) {
+    var list = new ds.LinkedList();
+    list.pushFront(0);
+    list.pushFront(1);
+    list.pushBack(2);
+    list.pushBack(3);
+    assert.deepEqual(list.popBack(), 3, "Pop back 3");
+    assert.deepEqual(list.popFront(), 1, "Pop front 1");
+    assert.deepEqual(list.popBack(), 2, "Pop back 2");
+    assert.deepEqual(list.popFront(), 0, "Pop front 0");
+});
+QUnit.test("LinkedList - Remove at test", function (assert) {
+    var list = new ds.LinkedList();
+    list.pushFront(0);
+    list.pushFront(1);
+    list.pushBack(2);
+    list.pushBack(3);
+    assert.deepEqual(list.removeAt(1), 0, "Remove at 1");
+    assert.deepEqual(list.removeAt(1), 2, "Remove at 1");
+    assert.deepEqual(list.removeAt(1), 3, "Remove at 1");
+    assert.deepEqual(list.removeAt(0), 1, "Remove at 0");
+});
+QUnit.test("LinkedList - Remove test", function (assert) {
+    var list = new ds.LinkedList();
+    for (var i = 0; i < 30; i++)
+        list.pushBack(i % 10);
+    list.pushBack(15);
+    var callback = function (item) {
+        return !(item % 2) && item > 5;
+    };
+    list.remove(0);
+    assert.deepEqual(list.indexOf(0), 9, "Remove 0");
+    list.remove(15);
+    assert.deepEqual(list.indexOf(15), -1, "Remove 15");
+    list.remove(9);
+    list.remove(9);
+    list.remove(9);
+    assert.deepEqual(list.indexOf(9), -1, "Remove 9");
+    list.remove(0, callback);
+    assert.deepEqual(list.indexOf(6), 13, "Remove the first even numbers greater than 5");
+});
+QUnit.test("LinkedList - Remove all test", function (assert) {
+    var list = new ds.LinkedList();
+    for (var i = 0; i < 30; i++)
+        list.pushBack(i % 10);
+    var callback = function (item) {
+        return !(item % 2) && item > 5;
+    };
+    list.removeAll(0);
+    assert.deepEqual(list.indexOf(0), -1, "Remove all 0");
+    list.removeAll(9);
+    assert.deepEqual(list.indexOf(9), -1, "Remove all 9");
+    list.removeAll(0, callback);
+    assert.deepEqual(list.indexOf(8), -1, "Remove all the even numbers greater than 5");
+});
+QUnit.test("LinkedList - Remove segment test", function (assert) {
+    var list = new ds.LinkedList();
+    for (var i = 0; i < 10; i++)
+        list.pushBack(i);
+    assert.deepEqual(list.removeSegment(2, 6), [2, 3, 4, 5, 6], "Remove the segment from the list");
+    assert.deepEqual(list.toArray(), [0, 1, 7, 8, 9], "Remove the segment from the list");
+    assert.deepEqual(list.getLength(), 5, "Remove the segment from the list");
+    assert.deepEqual(list.removeSegment(2, 1), [7, 8, 9], "Remove the segment from the list");
+    assert.deepEqual(list.toArray(), [0, 1], "Remove the segment from the list");
+    assert.deepEqual(list.getLength(), 2, "Remove the segment from the list");
+});
+QUnit.test("LinkedList - Modify at test", function (assert) {
+    var list = new ds.LinkedList();
+    for (var i = 0; i < 4; i++)
+        list.pushBack(i);
+    list.modifyAt(2, 6);
+    assert.deepEqual(list.toArray(), [0, 1, 6, 3], "Change at valid position");
+    list.modifyAt(5, 5);
+    assert.deepEqual(list.toArray(), [0, 1, 6, 3], "Change at non valid position");
+});
+QUnit.test("LinkedList - To array test", function (assert) {
+    var list = new ds.LinkedList();
+    list.pushFront(0);
+    list.pushFront(1);
+    list.pushBack(2);
+    list.pushBack(3);
+    var array = list.toArray();
+    assert.deepEqual(array[0], 1, "To array");
+    assert.deepEqual(array[1], 0, "To array");
+    assert.deepEqual(array[2], 2, "To array");
+    assert.deepEqual(array[3], 3, "To array");
+});
+QUnit.test("LinkedList - From array test", function (assert) {
+    var array = [5, 2, 6, 4];
+    var list = new ds.LinkedList();
+    list.fromArray(array);
+    assert.deepEqual(list.getItem(0), 5, "From array");
+    assert.deepEqual(list.getItem(1), 2, "From array");
+    assert.deepEqual(list.getItem(2), 6, "From array");
+    assert.deepEqual(list.getItem(3), 4, "From array");
+});
+QUnit.test("LinkedList - Filter test", function (assert) {
+    var list = new ds.LinkedList();
+    var length = 100;
+    for (var i = 0; i < length; i++)
+        list.pushFront(i);
+    var result = list.filter(function (item) {
+        return Boolean(1 - item % 2);
+    });
+    assert.deepEqual(result[0], 98, "Filter of the even values");
+    assert.deepEqual(result[result.length - 1], 0, "Filter on the even values");
+});
+QUnit.test("LinkedList - Iterator test", function (assert) {
+    var list = new ds.LinkedList();
+    for (var i = 0; i < 100; i++)
+        list.pushBack(i);
+    var it = list.getIterator();
+    var j = 0;
+    for (it.first(); !it.isDone(); it.next(), j++) {
+        assert.deepEqual(it.getItem(), j, "Check iterator position");
+    }
+});
+QUnit.test("LinkedList - Add at test", function (assert) {
+    var list = new ds.LinkedList();
+    list.addAt(5, 0);
+    assert.deepEqual(list.peek(), 5, "Add at 0");
+    list.addAt(2, 1);
+    assert.deepEqual(list.getItem(1), 2, "Add at 1");
+    list.addAt(15, 6);
+    assert.deepEqual(list.getItem(2), undefined, "Add at 6");
+    assert.deepEqual(list.getItem(5), undefined, "Add at 6");
+    assert.deepEqual(list.getItem(6), 15, "Add at 6");
+    list.addAt(30, 6);
+    assert.deepEqual(list.getItem(6), 30, "Add at 6");
+    assert.deepEqual(list.getItem(7), 15, "Add at 6");
+    list.addAt(6, 0);
+    assert.deepEqual(list.peek(), 6, "Add at 0");
+});
+QUnit.test("LinkedList - MultiPop test", function (assert) {
+    var list = new ds.LinkedList();
+    list.pushFront(0);
+    list.pushFront(1);
+    list.pushBack(2);
+    list.pushBack(3);
+    assert.deepEqual(list.multiPopBack(2), [3, 2], "Multi pop back");
+    assert.deepEqual(list.multiPopFront(2), [1, 0], "Multi pop front");
+});
+QUnit.test("LinkedList - Get length test", function (assert) {
+    var list = new ds.LinkedList();
+    assert.deepEqual(list.getLength(), 0, "Get length empty");
+    list.pushFront(0);
+    list.pushFront(1);
+    list.pushBack(2);
+    list.pushBack(3);
+    assert.deepEqual(list.getLength(), 4, "Get length");
+    list.multiPopBack(2);
+    assert.deepEqual(list.getLength(), 2, "Get length");
+});
+QUnit.test("LinkedList - Peek test", function (assert) {
+    var list = new ds.LinkedList();
+    list.pushFront(0);
+    assert.deepEqual(list.peek(), 0, "Peek");
+    list.pushFront(1);
+    list.pushBack(2);
+    assert.deepEqual(list.peek(), 1, "Peek");
+    list.pushBack(3);
+    assert.deepEqual(list.peek(), 1, "Peek");
+});
+QUnit.test("LinkedList - Clear test", function (assert) {
+    var list = new ds.LinkedList();
+    list.pushFront(0);
+    list.pushFront(1);
+    list.pushBack(2);
+    list.pushBack(3);
+    list.clear();
+    assert.deepEqual(list.getLength(), 0, "Clear the list");
+});
+QUnit.test("LinkedList - Is empty test", function (assert) {
+    var list = new ds.LinkedList();
+    assert.deepEqual(list.isEmpty(), true, "Is empty");
+    list.pushFront(0);
+    list.pushFront(1);
+    list.pushBack(2);
+    list.pushBack(3);
+    assert.deepEqual(list.isEmpty(), false, "Is not empty");
+    list.clear();
+    assert.deepEqual(list.isEmpty(), true, "Is empty");
+});
+QUnit.test("LinkedList - Contains test", function (assert) {
+    var list = new ds.LinkedList();
+    list.pushBack(0);
+    list.pushBack(2);
+    assert.deepEqual(list.contains(0), true, "Contains 0");
+    assert.deepEqual(list.contains(2), true, "Contains 2");
+    assert.deepEqual(list.contains(1), false, "Not contains 1");
+    var callback = function (item) {
+        return item > 0;
+    };
+    assert.deepEqual(list.contains(null, callback), true, "Contains a value > 0");
+    callback = function (item) {
+        return item < 0;
+    };
+    assert.deepEqual(list.contains(null, callback), false, "Contains a value < 0");
+});
+QUnit.test("LinkedList - Execute test", function (assert) {
+    var list = new ds.LinkedList();
+    list.pushBack(0);
+    list.pushBack(2);
+    var callback = function (item) {
+        return item * 2;
+    };
+    list.execute(callback);
+    assert.deepEqual(list.getItem(0), 0, "Execute for item 0");
+    assert.deepEqual(list.getItem(1), 4, "Execute for item 1");
+});
+QUnit.test("LinkedList - Index of test", function (assert) {
+    var list = new ds.LinkedList();
+    for (var i = 0; i < 10; i++)
+        list.pushBack(i);
+    var callback = function (item) {
+        return !(item % 2) && item > 5;
+    };
+    assert.deepEqual(list.indexOf(0), 0, "Index of 0");
+    assert.deepEqual(list.indexOf(15), -1, "Index of 15");
+    assert.deepEqual(list.indexOf(5), 5, "Index of 5");
+    list.removeAt(5);
+    assert.deepEqual(list.indexOf(6), 5, "Index of 6");
+    assert.deepEqual(list.indexOf(null, callback), 5, "Index of the first even number greater than 5");
+});
+QUnit.test("LinkedList - Last index of test", function (assert) {
+    var list = new ds.LinkedList();
+    for (var i = 0; i < 10; i++)
+        list.pushBack(i);
+    var callback = function (item) {
+        return !(item % 2) && item > 5;
+    };
+    assert.deepEqual(list.lastIndexOf(0), 0, "Last index of 0");
+    assert.deepEqual(list.lastIndexOf(15), -1, "Last index of 15");
+    assert.deepEqual(list.lastIndexOf(5), 5, "Last index of 5");
+    list.removeAt(5);
+    assert.deepEqual(list.lastIndexOf(6), 5, "Last index of 6");
+    assert.deepEqual(list.lastIndexOf(null, callback), 7, "Index of the last even number greater than 5");
+});
+QUnit.test("LinkedList - Indexes of test", function (assert) {
+    var list = new ds.LinkedList();
+    for (var i = 0; i < 30; i++)
+        list.pushBack(i % 10);
+    var callback = function (item) {
+        return !(item % 2) && item > 5;
+    };
+    assert.deepEqual(list.allIndexesOf(0), [0, 10, 20], "Indexes of 0");
+    assert.deepEqual(list.allIndexesOf(15), [], "Indexes of 15");
+    assert.deepEqual(list.allIndexesOf(5), [5, 15, 25], "Indexes of 5");
+    list.removeAt(5);
+    assert.deepEqual(list.allIndexesOf(5), [14, 24], "Indexes of 5");
+    assert.deepEqual(list.allIndexesOf(6), [5, 15, 25], "Indexes of 6");
+    assert.deepEqual(list.allIndexesOf(null, callback), [5, 7, 15, 17, 25, 27], "Indexes of the even numbers greater than 5");
+});
+QUnit.test("LinkedList - Join test", function (assert) {
+    var listA = new ds.LinkedList();
+    var listB = new ds.LinkedList();
+    for (var i = 0; i < 5; i++) {
+        listA.pushBack(i);
+        listB.pushBack(i);
+    }
+    listA.join(listB);
+    assert.deepEqual(listA.allIndexesOf(3), [3, 8], "Join of the lists");
+    assert.deepEqual(listA.getLength(), 10, "Check the length of the list");
+});
+QUnit.test("LinkedList - Divide test", function (assert) {
+    var list = new ds.LinkedList();
+    for (var i = 0; i < 10; i++)
+        list.pushBack(i);
+    var listA = list.divide(-1);
+    assert.deepEqual(listA.isEmpty(), true, "Divide before start");
+    var listB = list.divide(10);
+    assert.deepEqual(listB.isEmpty(), true, "Divide after end");
+    var listC = list.divide(8);
+    assert.deepEqual(listC.getItem(0), 8, "Divide at valid position");
+    assert.deepEqual(listC.getItem(1), 9, "Divide at valid position");
+    assert.deepEqual(listC.getLength(), 2, "Divide at valid position");
+    assert.deepEqual(list.getItem(8), undefined, "Divide at valid position");
+    assert.deepEqual(list.getLength(), 8, "Divide at valid position");
+    var listD = list.divide(0);
+    assert.deepEqual(listD.getLength(), 8, "Divide at the first position");
+    assert.deepEqual(listD.getItem(0), 0, "Divide at the first position");
+    assert.deepEqual(listD.getItem(8), undefined, "Divide at the first position");
+    assert.deepEqual(listD.getItem(7), 7, "Divide at the first position");
+    assert.deepEqual(list.getLength(), 0, "Divide at the first position");
+    assert.deepEqual(list.getItem(0), undefined, "Divide at the first position");
+});
+QUnit.test("LinkedList - Clone test", function (assert) {
+    var list = new ds.LinkedList();
+    for (var i = 0; i < 10; i++)
+        list.pushBack(i);
+    var clone = list.clone();
+    var it = clone.getIterator();
+    var j = 0;
+    for (it.first(); !it.isDone(); it.next(), j++)
+        assert.deepEqual(it.getItem(), j, "Clone of the list");
+});
+QUnit.test("LinkedList - Clone distinct test", function (assert) {
+    var list = new ds.LinkedList();
+    for (var i = 0; i < 20; i++)
+        list.pushBack(i % 10);
+    var clone = list.cloneDistinct();
+    assert.deepEqual(clone.allIndexesOf(2), [2], "Clone of the list");
+});
+QUnit.test("LinkedList - Split test", function (assert) {
+    var list = new ds.LinkedList();
+    for (var i = 0; i < 7; i++)
+        list.pushBack(i);
+    var lists = list.split(3);
+    assert.deepEqual(lists.length, 3, "Check the number of lists created");
+    assert.deepEqual(lists[0].toArray(), [0, 1, 2], "Check the items in the lists created");
+    assert.deepEqual(lists[1].toArray(), [3, 4, 5], "Check the items in the lists created");
+    assert.deepEqual(lists[2].toArray(), [6], "Check the items in the lists created");
+});
+QUnit.test("LinkedList - Count test", function (assert) {
+    var list = new ds.LinkedList();
+    for (var i = 0; i < 10; i++)
+        list.pushBack(i);
+    var callback = function (item) {
+        return item > 4;
+    };
+    assert.deepEqual(list.count(callback), 5, "Count the items that are greater than 4");
+});
+/**
+ * Created by Battistella Stefano on 31/03/14.
+ */
+QUnit.test("PriorityQueue - Enqueue test", function (assert) {
+    var queue = new ds.PriorityQueue();
+    queue.enqueue(5, 0);
+    assert.deepEqual(queue.peek(), 0, "Enqueue 0");
+    queue.enqueue(2, 6);
+    assert.deepEqual(queue.getItem(0), 0, "Enqueue 6");
+    assert.deepEqual(queue.getItem(1), 6, "Enqueue 6");
+});
+QUnit.test("PriorityQueue - MultiEnqueue test", function (assert) {
+    var queue = new ds.PriorityQueue();
+    queue.multiEnqueue(3, [0, 2]);
+    assert.deepEqual(queue.multiDequeue(2), [0, 2], "MultiEnqueue 2 items");
+    queue.multiEnqueue(4, [2]);
+    queue.multiEnqueue(5, [4, 5, 8]);
+    assert.deepEqual(queue.multiDequeue(4), [4, 5, 8, 2], "MultiDequeue 4 items");
+    queue.multiEnqueue(0, []);
+    assert.deepEqual(queue.multiDequeue(1), [], "MultiEnqueue 0 items");
+});
+QUnit.test("PriorityQueue - Dequeue test", function (assert) {
+    var queue = new ds.PriorityQueue();
+    queue.enqueue(5, 0);
+    queue.enqueue(2, 2);
+    assert.deepEqual(queue.dequeue(), 0, "Dequeue");
+    assert.deepEqual(queue.dequeue(), 2, "Dequeue");
+    assert.deepEqual(queue.dequeue(), undefined, "Check length if too much dequeue");
+});
+QUnit.test("PriorityQueue - MultiDequeue test", function (assert) {
+    var queue = new ds.PriorityQueue();
+    queue.enqueue(10, 0);
+    queue.enqueue(8, 2);
+    assert.deepEqual(queue.multiDequeue(1), [0], "MultiDequeue 1 time");
+    assert.deepEqual(queue.getLength(), 1, "MultiDequeue 1 time check length");
+    queue.enqueue(9, 4);
+    queue.enqueue(4, 5);
+    queue.enqueue(6, 8);
+    assert.deepEqual(queue.multiDequeue(7), [4, 2, 8, 5], "MultiDequeue 7 times");
+    assert.deepEqual(queue.getLength(), 0, "MultiDequeue 7 time check length");
+    assert.deepEqual(queue.multiDequeue(1), [], "MultiDequeue 1 time with queue empty");
+});
+QUnit.test("PriorityQueue - Remove test", function (assert) {
+    var queue = new ds.PriorityQueue();
+    queue.enqueue(4, 0);
+    queue.enqueue(3, 2);
+    queue.enqueue(2, 4);
+    queue.enqueue(1, 5);
+    queue.enqueue(0, 8);
+    queue.remove(2, 2);
+    assert.deepEqual(queue.multiDequeue(3), [0, 2, 8], "Remove from position 2 for 2");
+});
+QUnit.test("PriorityQueue - Is empty test", function (assert) {
+    var queue = new ds.PriorityQueue();
+    queue.enqueue(5, 0);
+    queue.enqueue(2, 2);
+    assert.deepEqual(queue.isEmpty(), false, "Is empty");
+    queue.clear();
+    assert.deepEqual(queue.isEmpty(), true, "Is empty");
+});
+QUnit.test("PriorityQueue - Clear test", function (assert) {
+    var queue = new ds.PriorityQueue();
+    queue.enqueue(5, 0);
+    queue.enqueue(5, 2);
+    queue.clear();
+    assert.deepEqual(queue.isEmpty(), true, "Clear queue");
+});
+QUnit.test("PriorityQueue - Iterator test", function (assert) {
+    var queue = new ds.PriorityQueue();
+    for (var i = 0; i < 10; i++)
+        queue.enqueue(10 - Math.floor(i / 2), i);
+    var j = 0;
+    var it = queue.getIterator();
+    for (it.first(); !it.isDone(); it.next(), j++)
+        assert.deepEqual(it.getItem(), j, "Get next item " + j);
+    j--;
+    for (it.last(); !it.isDone(); it.previous(), j--)
+        assert.deepEqual(it.getItem(), j, "Get previous item " + j);
+});
+QUnit.test("PriorityQueue - Contains priority test", function (assert) {
+    var queue = new ds.PriorityQueue();
+    queue.enqueue(5, 0);
+    queue.enqueue(2, 2);
+    assert.deepEqual(queue.containsPriority(5), true, "Contains priority 5");
+    assert.deepEqual(queue.containsPriority(2), true, "Contains priority 2");
+    assert.deepEqual(queue.containsPriority(1), false, "Not contains priority 1");
+    var callback = function (item) {
+        return item > 3;
+    };
+    assert.deepEqual(queue.containsPriority(null, callback), true, "Contains a priority > 3");
+    callback = function (item) {
+        return item < 2;
+    };
+    assert.deepEqual(queue.containsPriority(null, callback), false, "Contains a priority < 2");
+});
+QUnit.test("PriorityQueue - Get items test", function (assert) {
+    var queue = new ds.PriorityQueue();
+    queue.enqueue(5, 0);
+    queue.enqueue(5, 2);
+    queue.enqueue(5, 5);
+    assert.deepEqual(queue.getItems(5), [0, 2, 5], "Get items with priority 5");
+    assert.deepEqual(queue.getItems(1), [], "Get items with priority 1");
+});
+QUnit.test("PriorityQueue - To queue test", function (assert) {
+    var priorityQueue = new ds.PriorityQueue();
+    priorityQueue.enqueue(5, 0);
+    priorityQueue.enqueue(5, 2);
+    priorityQueue.enqueue(5, 5);
+    var queue = priorityQueue.toQueue();
+    assert.deepEqual(queue.items, [0, 2, 5], "Check the to queue method");
+});
+QUnit.test("PriorityQueue - Execute test", function (assert) {
+    var queue = new ds.PriorityQueue();
+    queue.enqueue(4, 0);
+    queue.enqueue(3, 2);
+    var callback = function (item) {
+        return item * 2;
+    };
+    queue.execute(callback);
+    assert.deepEqual(queue.getItem(0), 0, "Execute for item 0");
+    assert.deepEqual(queue.getItem(1), 4, "Execute for item 1");
+});
+QUnit.test("PriorityQueue - Remove test", function (assert) {
+    var queue = new ds.PriorityQueue();
+    queue.enqueue(4, 0);
+    queue.enqueue(3, 1);
+    queue.enqueue(2, 2);
+    queue.enqueue(1, 3);
+    queue.enqueue(0, 4);
+    for (var i = 0; i < 5; i++)
+        assert.deepEqual(queue.getItem(i), i, "Check queue correctness");
+    queue.changePriority(3, 8);
+    for (var j = 0; j < 5; j++) {
+        if (!j)
+            assert.deepEqual(queue.getItem(j), 3, "Check increase priority");
+        else if (j < 4)
+            assert.deepEqual(queue.getItem(j), j - 1, "Check increase priority");
+        else
+            assert.deepEqual(queue.getItem(j), j, "Check increase priority");
+    }
+    queue.changePriority(3, -4);
+    for (var k = 0; k < 5; k++) {
+        if (!k)
+            assert.deepEqual(queue.getItem(k), 3, "Check decrease priority");
+        else if (k < 3)
+            assert.deepEqual(queue.getItem(k), k - 1, "Check decrease priority");
+        else if (k === 3)
+            assert.deepEqual(queue.getItem(k), 4, "Check decrease priority");
+        else
+            assert.deepEqual(queue.getItem(k), 2, "Check decrease priority");
+    }
+});
+QUnit.test("PriorityQueue - Filter test", function (assert) {
+    var queue = new ds.PriorityQueue();
+    var length = 100;
+    for (var i = 0; i < length; i++)
+        queue.enqueue(i, i);
+    var result = queue.filter(function (item) {
+        return 1 - item % 2;
+    });
+    assert.deepEqual(result[0], 98, "Filter of the even values");
+    assert.deepEqual(result[result.length - 1], 0, "Filter on the even values");
+});
+QUnit.test("PriorityQueue - Clone test", function (assert) {
+    var queue = new ds.PriorityQueue();
+    for (var i = 0; i < 10; i++)
+        queue.enqueue(i, i);
+    var clone = queue.clone();
+    assert.deepEqual(clone.multiDequeue(10), [9, 8, 7, 6, 5, 4, 3, 2, 1, 0], "Clone of the queue");
+});
+QUnit.test("PriorityQueue - Clone distinct test", function (assert) {
+    var queue = new ds.PriorityQueue();
+    for (var i = 0; i < 40; i++)
+        queue.enqueue(i % 20, i % 10);
+    var clone = queue.cloneDistinct();
+    assert.deepEqual(clone.multiDequeue(10), [9, 8, 7, 6, 5, 4, 3, 2, 1, 0], "Clone of the queue");
+});
+/**
+ * Created by Battistella Stefano on 31/03/14.
+ */
+QUnit.test("Queue - Init test", function (assert) {
+    var queue = new ds.Queue(0, 2, 4, 6);
+    assert.deepEqual(queue.multiDequeue(4), [0, 2, 4, 6], "Initializing");
+    queue = new ds.Queue(0);
+    assert.deepEqual(queue.multiDequeue(4), [0], "Initializing");
+});
+QUnit.test("Queue - Init range test", function (assert) {
+    var queue = new ds.Queue(ds.Range(0, 6, 2));
+    assert.deepEqual(queue.multiDequeue(4), [0, 2, 4, 6], "Initializing");
+});
+QUnit.test("Queue - Enqueue test", function (assert) {
+    var queue = new ds.Queue();
+    queue.enqueue(0);
+    assert.deepEqual(queue.peek(), 0, "Enqueue 0");
+    queue.enqueue(2);
+    assert.deepEqual(queue.getItem(0), 0, "Enqueue 2");
+    assert.deepEqual(queue.getItem(1), 2, "Enqueue 2");
+});
+QUnit.test("Queue - MultiEnqueue test", function (assert) {
+    var queue = new ds.Queue();
+    queue.multiEnqueue([0, 2]);
+    assert.deepEqual(queue.multiDequeue(2), [0, 2], "MultiEnqueue 2 items");
+    queue.multiEnqueue([2]);
+    queue.multiEnqueue([4, 5, 8]);
+    assert.deepEqual(queue.multiDequeue(4), [2, 4, 5, 8], "MultiDequeue 4 items");
+    queue.multiEnqueue([]);
+    assert.deepEqual(queue.multiDequeue(1), [], "MultiEnqueue 0 items");
+});
+QUnit.test("Queue - Dequeue test", function (assert) {
+    var queue = new ds.Queue();
+    queue.enqueue(0);
+    queue.enqueue(2);
+    assert.deepEqual(queue.dequeue(), 0, "Dequeue");
+    assert.deepEqual(queue.dequeue(), 2, "Dequeue");
+    assert.deepEqual(queue.dequeue(), undefined, "Check length if too much dequeue");
+});
+QUnit.test("Queue - MultiDequeue test", function (assert) {
+    var queue = new ds.Queue();
+    queue.enqueue(0);
+    queue.enqueue(2);
+    assert.deepEqual(queue.multiDequeue(1), [0], "MultiDequeue 1 time");
+    queue.enqueue(4);
+    queue.enqueue(5);
+    queue.enqueue(8);
+    assert.deepEqual(queue.multiDequeue(7), [2, 4, 5, 8], "MultiDequeue 7 times");
+    assert.deepEqual(queue.multiDequeue(1), [], "MultiDequeue 1 time with queue empty");
+});
+QUnit.test("Queue - Remove test", function (assert) {
+    var queue = new ds.Queue();
+    queue.enqueue(0);
+    queue.enqueue(2);
+    queue.enqueue(4);
+    queue.enqueue(5);
+    queue.enqueue(8);
+    queue.remove(2, 2);
+    assert.deepEqual(queue.multiDequeue(3), [0, 2, 8], "Remove from position 2 for 2");
+});
+QUnit.test("Queue - Iterator test", function (assert) {
+    var queue = new ds.Queue();
+    for (var i = 0; i < 10; i++)
+        queue.enqueue(i);
+    var j = 0;
+    var it = queue.getIterator();
+    for (it.first(); !it.isDone(); it.next(), j++)
+        assert.deepEqual(it.getItem(), j, "Get next item " + j);
+    j--;
+    for (it.last(); !it.isDone(); it.previous(), j--)
+        assert.deepEqual(it.getItem(), j, "Get previous item " + j);
+});
+QUnit.test("Queue - Get length test", function (assert) {
+    var queue = new ds.Queue();
+    assert.deepEqual(queue.getLength(), 0, "Length 0");
+    queue.enqueue(0);
+    assert.deepEqual(queue.getLength(), 1, "Length 1");
+    queue.enqueue(2);
+    assert.deepEqual(queue.getLength(), 2, "Length 2");
+    queue.dequeue();
+    queue.dequeue();
+    assert.deepEqual(queue.getLength(), 0, "Length 0");
+});
+QUnit.test("Queue - Peek test", function (assert) {
+    var queue = new ds.Queue();
+    queue.enqueue(0);
+    assert.deepEqual(queue.peek(), 0, "Peek 0");
+    queue.enqueue(2);
+    assert.deepEqual(queue.peek(), 0, "Peek 0");
+});
+QUnit.test("Queue - Clear test", function (assert) {
+    var queue = new ds.Queue();
+    queue.enqueue(0);
+    queue.enqueue(2);
+    queue.clear();
+    assert.deepEqual(queue.isEmpty(), true, "Clear queue");
+});
+QUnit.test("Queue - Is empty test", function (assert) {
+    var queue = new ds.Queue();
+    queue.enqueue(0);
+    queue.enqueue(2);
+    assert.deepEqual(queue.isEmpty(), false, "Is not empty");
+    queue.clear();
+    assert.deepEqual(queue.isEmpty(), true, "Is empty");
+});
+QUnit.test("Queue - Contains test", function (assert) {
+    var queue = new ds.Queue();
+    queue.enqueue(0);
+    queue.enqueue(2);
+    assert.deepEqual(queue.contains(0), true, "Contains 0");
+    assert.deepEqual(queue.contains(2), true, "Contains 2");
+    assert.deepEqual(queue.contains(1), false, "Not contains 1");
+    var callback = function (item) {
+        return item > 0;
+    };
+    assert.deepEqual(queue.contains(null, callback), true, "Contains a value > 0");
+    callback = function (item) {
+        return item < 0;
+    };
+    assert.deepEqual(queue.contains(null, callback), false, "Contains a value < 0");
+});
+QUnit.test("Queue - Execute test", function (assert) {
+    var queue = new ds.Queue();
+    queue.enqueue(0);
+    queue.enqueue(2);
+    var callback = function (item) {
+        return item * 2;
+    };
+    queue.execute(callback);
+    assert.deepEqual(queue.getItem(0), 0, "Execute for item 0");
+    assert.deepEqual(queue.getItem(1), 4, "Execute for item 1");
+});
+QUnit.test("Queue - Index of test", function (assert) {
+    var queue = new ds.Queue();
+    for (var i = 0; i < 10; i++)
+        queue.enqueue(i);
+    var callback = function (item) {
+        return !(item % 2) && item > 5;
+    };
+    assert.deepEqual(queue.indexOf(0), 0, "Index of 0");
+    assert.deepEqual(queue.indexOf(15), -1, "Index of 15");
+    assert.deepEqual(queue.indexOf(5), 5, "Index of 5");
+    assert.deepEqual(queue.indexOf(null, callback), 6, "Index of the first even number greater than 5");
+});
+QUnit.test("Queue - Last index of test", function (assert) {
+    var queue = new ds.Queue();
+    for (var i = 0; i < 10; i++)
+        queue.enqueue(i);
+    var callback = function (item) {
+        return !(item % 2) && item > 5;
+    };
+    assert.deepEqual(queue.lastIndexOf(0), 0, "Last index of 0");
+    assert.deepEqual(queue.lastIndexOf(15), -1, "Last index of 15");
+    assert.deepEqual(queue.lastIndexOf(5), 5, "Last index of 5");
+    assert.deepEqual(queue.lastIndexOf(null, callback), 8, "Index of the last even number greater than 5");
+});
+QUnit.test("Queue - Indexes of test", function (assert) {
+    var queue = new ds.Queue();
+    for (var i = 0; i < 30; i++)
+        queue.enqueue(i % 10);
+    var callback = function (item) {
+        return !(item % 2) && item > 5;
+    };
+    assert.deepEqual(queue.allIndexesOf(0), [0, 10, 20], "Indexes of 0");
+    assert.deepEqual(queue.allIndexesOf(15), [], "Indexes of 15");
+    assert.deepEqual(queue.allIndexesOf(5), [5, 15, 25], "Indexes of 5");
+    assert.deepEqual(queue.allIndexesOf(null, callback), [6, 8, 16, 18, 26, 28], "Indexes of the even numbers greater than 5");
+});
+QUnit.test("Queue - Clone test", function (assert) {
+    var queue = new ds.Queue();
+    for (var i = 0; i < 10; i++)
+        queue.enqueue(i);
+    var clone = queue.clone();
+    var it = clone.getIterator();
+    var j = 0;
+    for (it.first(); !it.isDone(); it.next(), j++)
+        assert.deepEqual(it.getItem(), j, "Clone of the queue");
+});
+QUnit.test("Queue - Clone distinct test", function (assert) {
+    var queue = new ds.Queue();
+    for (var i = 0; i < 20; i++)
+        queue.enqueue(i % 10);
+    var clone = queue.cloneDistinct();
+    assert.deepEqual(clone.allIndexesOf(2), [2], "Clone of the queue");
+});
+QUnit.test("Queue - Filter test", function (assert) {
+    var queue = new ds.Queue();
+    var length = 100;
+    for (var i = 0; i < length; i++)
+        queue.enqueue(i);
+    var result = queue.filter(function (item) {
+        return Boolean(1 - item % 2);
+    });
+    assert.deepEqual(result[0], 0, "Filter of the even values");
+    assert.deepEqual(result[result.length - 1], 98, "Filter on the even values");
+});
+/**
+ * Created by Stefano on 06/04/14.
+ */
+QUnit.test("Range - Create linear test", function (assert) {
+    var range = ds.Range(0, 5);
+    for (var j = 0; j < range.length; j++) {
+        assert.deepEqual(range[j], j, "Check range values");
+    }
+});
+QUnit.test("Range - Create inverse test", function (assert) {
+    var range = ds.Range(5, 0, -1);
+    for (var j = 0; j < range.length; j++) {
+        assert.deepEqual(range[j], 5 - j, "Check range values");
+    }
+});
+QUnit.test("Range - Create step test", function (assert) {
+    var range = ds.Range(0, 15, 4);
+    for (var j = 0; j < range.length; j++) {
+        assert.deepEqual(range[j], j * 4, "Check range values");
+    }
+});
+QUnit.test("Range - Create inverse step test", function (assert) {
+    var range = ds.Range(15, 4, -2);
+    for (var j = 0; j < range.length; j++) {
+        assert.deepEqual(range[j], 15 - j * 2, "Check range values");
+    }
+});
+/**
+ * Created by Stefano on 06/04/14.
+ */
+QUnit.test("RBTree - Insert test", function (assert) {
+    var tree = new ds.RBTree();
+    var keys = [];
+    for (var i = 0; i < 20; i++) {
+        keys.push(Math.random());
+        tree.insert(keys[i], keys[i]);
+    }
+    for (var j = 0; j < 20; j++)
+        assert.deepEqual(tree.search(keys[j]), keys[j], "Insert node");
+    keys.sort();
+    for (var k = 0; k < 20; k++)
+        assert.deepEqual(tree.getItem(k), keys[k], "Insert node");
+});
+QUnit.test("RBTree - Minimum test", function (assert) {
+    var tree = new ds.RBTree();
+    var keys = [];
+    var min = 10;
+    for (var i = 0; i < 20; i++) {
+        keys.push(Math.random());
+        tree.insert(keys[i], i);
+        if (keys[i] < min)
+            min = keys[i];
+    }
+    assert.deepEqual(tree.minimum().item, tree.search(min), "Minimum");
+});
+QUnit.test("RBTree - Maximum test", function (assert) {
+    var tree = new ds.RBTree();
+    var keys = [];
+    var max = -1;
+    for (var i = 0; i < 20; i++) {
+        keys.push(Math.random());
+        tree.insert(keys[i], i);
+        if (keys[i] > max)
+            max = keys[i];
+    }
+    assert.deepEqual(tree.maximum().item, tree.search(max), "Maximum");
+});
+QUnit.test("RBTree - Successor test", function (assert) {
+    var tree = new ds.RBTree();
+    for (var i = 0; i < 20; i++)
+        tree.insert(i, i);
+    var it = tree.getIterator();
+    var j = 1;
+    for (it.first(); !it.isDone(); it.next(), j++) {
+        var successor = tree.successor(it.getNode());
+        if (successor)
+            assert.deepEqual(successor.item, j, "Successor");
+        else
+            assert.deepEqual(successor, null, "No successor");
+    }
+});
+QUnit.test("RBTree - Predecessor test", function (assert) {
+    var tree = new ds.RBTree();
+    for (var i = 0; i < 20; i++)
+        tree.insert(i, i);
+    var it = tree.getIterator();
+    var j = 18;
+    for (it.last(); !it.isDone(); it.previous(), j--) {
+        var predecessor = tree.predecessor(it.getNode());
+        if (predecessor)
+            assert.deepEqual(predecessor.item, j, "Predecessor");
+        else
+            assert.deepEqual(predecessor, null, "No predecessor");
+    }
+});
+QUnit.test("RBTree - Delete node test", function (assert) {
+    var tree = new ds.RBTree();
+    for (var i = 0; i < 20; i++)
+        tree.insert(i, i);
+    var j = 0;
+    while (tree.minimum()) {
+        assert.deepEqual(tree.minimum().item, j, "Deletion");
+        tree.deleteNode(tree.minimum());
+        j++;
+    }
+});
+QUnit.test("RBTree - To array test", function (assert) {
+    var tree = new ds.RBTree();
+    for (var i = 0; i < 5; i++)
+        tree.insert(i, i);
+    assert.deepEqual(tree.toArray(), [0, 1, 2, 3, 4], "To array");
+});
+QUnit.test("RBTree - Filter test", function (assert) {
+    var tree = new ds.RBTree();
+    var length = 100;
+    for (var i = 0; i < length; i++)
+        tree.insert(i, i);
+    var result = tree.filter(function (item) {
+        return Boolean(1 - item % 2);
+    });
+    assert.deepEqual(result[0], 0, "Filter of the even values");
+    assert.deepEqual(result[result.length - 1], 98, "Filter on the even values");
+});
+QUnit.test("RBTree - Clear test", function (assert) {
+    var tree = new ds.RBTreeList();
+    tree.insert(0, 0);
+    tree.insert(2, 2);
+    tree.clear();
+    assert.deepEqual(tree.isEmpty(), true, "Clear tree");
+});
+QUnit.test("RBTree - Is empty test", function (assert) {
+    var tree = new ds.RBTree();
+    tree.insert(0, 0);
+    tree.insert(2, 2);
+    assert.deepEqual(tree.isEmpty(), false, "Is not empty");
+    tree.clear();
+    assert.deepEqual(tree.isEmpty(), true, "Is empty");
+});
+QUnit.test("RBTree - Contains test", function (assert) {
+    var tree = new ds.RBTree();
+    tree.insert(0, 0);
+    tree.insert(2, 2);
+    assert.deepEqual(tree.contains(0), true, "Contains 0");
+    assert.deepEqual(tree.contains(2), true, "Contains 2");
+    assert.deepEqual(tree.contains(1), false, "Not contains 1");
+    var callback = function (item) {
+        return item > 0;
+    };
+    assert.deepEqual(tree.fullContains(callback), true, "Contains a value > 0");
+    callback = function (item) {
+        return item < 0;
+    };
+    assert.deepEqual(tree.fullContains(callback), false, "Contains a value < 0");
+});
+QUnit.test("RBTree - Execute test", function (assert) {
+    var tree = new ds.RBTree();
+    tree.insert(0, 0);
+    tree.insert(2, 2);
+    var callback = function (item) {
+        return item * 2;
+    };
+    tree.execute(callback);
+    assert.deepEqual(tree.search(0), 0, "Execute for key 0");
+    assert.deepEqual(tree.search(2), 4, "Execute for key 1");
+});
+QUnit.test("RBTree - Index of test", function (assert) {
+    var tree = new ds.RBTree();
+    for (var i = 0; i < 10; i++)
+        tree.insert(i, i);
+    var callback = function (item) {
+        return !(item % 2) && item > 5;
+    };
+    assert.deepEqual(tree.indexOf(0), 0, "Index of 0");
+    assert.deepEqual(tree.indexOf(15), -1, "Index of 15");
+    assert.deepEqual(tree.indexOf(5), 5, "Index of 5");
+    assert.deepEqual(tree.indexOf(null, callback), 6, "Index of the first even number greater than 5");
+});
+QUnit.test("RBTree - Last index of test", function (assert) {
+    var tree = new ds.RBTree();
+    for (var i = 0; i < 10; i++)
+        tree.insert(i, i);
+    var callback = function (item) {
+        return !(item % 2) && item > 5;
+    };
+    assert.deepEqual(tree.lastIndexOf(0), 0, "Last index of 0");
+    assert.deepEqual(tree.lastIndexOf(15), -1, "Last index of 15");
+    assert.deepEqual(tree.lastIndexOf(5), 5, "Last index of 5");
+    assert.deepEqual(tree.lastIndexOf(null, callback), 8, "Index of the last even number greater than 5");
+});
+QUnit.test("RBTree - Indexes of test", function (assert) {
+    var tree = new ds.RBTree();
+    for (var i = 0; i < 30; i++)
+        tree.insert(i, i % 10);
+    var callback = function (item) {
+        return !(item % 2) && item > 5;
+    };
+    assert.deepEqual(tree.allIndexesOf(0), [0, 10, 20], "Indexes of 0");
+    assert.deepEqual(tree.allIndexesOf(15), [], "Indexes of 15");
+    assert.deepEqual(tree.allIndexesOf(5), [5, 15, 25], "Indexes of 5");
+    assert.deepEqual(tree.allIndexesOf(null, callback), [6, 8, 16, 18, 26, 28], "Indexes of the even numbers greater than 5");
+});
+QUnit.test("RBTree - Clone test", function (assert) {
+    var tree = new ds.RBTree();
+    for (var i = 0; i < 10; i++)
+        tree.insert(i, i);
+    var clone = tree.clone();
+    var it = clone.getIterator();
+    var j = 0;
+    for (it.first(); !it.isDone(); it.next(), j++)
+        assert.deepEqual(it.getItem(), j, "Clone of the tree");
+});
+QUnit.test("RBTree - Clone distinct test", function (assert) {
+    var tree = new ds.RBTree();
+    for (var i = 0; i < 20; i++)
+        tree.insert(i % 10, i % 10);
+    var clone = tree.cloneDistinct();
+    assert.deepEqual(clone.allIndexesOf(2), [2], "Clone of the tree");
+});
+/**
+ * Created by Stefano on 06/04/14.
+ */
+QUnit.test("RBTreeList - Insert test", function (assert) {
+    var tree = new ds.RBTreeList();
+    var keys = [];
+    for (var i = 0; i < 20; i++) {
+        keys.push(Math.random());
+        tree.insert(keys[i], i);
+    }
+    for (var j = 0; j < 20; j++)
+        assert.deepEqual(tree.search(keys[j]), j, "Insert node");
+});
+QUnit.test("RBTreeList - Minimum test", function (assert) {
+    var tree = new ds.RBTreeList();
+    var keys = [];
+    var min = 10;
+    for (var i = 0; i < 20; i++) {
+        keys.push(Math.random());
+        tree.insert(keys[i], i);
+        if (keys[i] < min)
+            min = keys[i];
+    }
+    assert.deepEqual(tree.minimum().item, tree.search(min), "Minimum");
+});
+QUnit.test("RBTreeList - Maximum test", function (assert) {
+    var tree = new ds.RBTreeList();
+    var keys = [];
+    var max = -1;
+    for (var i = 0; i < 20; i++) {
+        keys.push(Math.random());
+        tree.insert(keys[i], i);
+        if (keys[i] > max)
+            max = keys[i];
+    }
+    assert.deepEqual(tree.maximum().item, tree.search(max), "Maximum");
+});
+QUnit.test("RBTreeList - Successor test", function (assert) {
+    var tree = new ds.RBTreeList();
+    for (var i = 0; i < 20; i++)
+        tree.insert(i, i);
+    var it = tree.getIterator();
+    var j = 1;
+    for (it.first(); !it.isDone(); it.next(), j++) {
+        var successor = tree.successor(it.getNode());
+        if (successor)
+            assert.deepEqual(successor.item, j, "Successor");
+        else
+            assert.deepEqual(successor, null, "No successor");
+    }
+});
+QUnit.test("RBTreeList - Predecessor test", function (assert) {
+    var tree = new ds.RBTreeList();
+    for (var i = 0; i < 20; i++)
+        tree.insert(i, i);
+    var it = tree.getIterator();
+    var j = 18;
+    for (it.last(); !it.isDone(); it.previous(), j--) {
+        var predecessor = tree.predecessor(it.getNode());
+        if (predecessor)
+            assert.deepEqual(predecessor.item, j, "Predecessor");
+        else
+            assert.deepEqual(predecessor, null, "No predecessor");
+    }
+});
+QUnit.test("RBTreeList - Delete node test", function (assert) {
+    var tree = new ds.RBTreeList();
+    for (var i = 0; i < 20; i++)
+        tree.insert(i, i);
+    var j = 0;
+    while (tree.minimum()) {
+        assert.deepEqual(tree.minimum().item, j, "Deletion");
+        tree.deleteNode(tree.minimum());
+        j++;
+    }
+});
+QUnit.test("RBTreeList - To array test", function (assert) {
+    var tree = new ds.RBTreeList();
+    for (var i = 0; i < 5; i++)
+        tree.insert(i, i);
+    assert.deepEqual(tree.toArray(), [0, 1, 2, 3, 4], "To array");
+});
+QUnit.test("RBTreeList - Filter test", function (assert) {
+    var tree = new ds.RBTreeList();
+    for (var i = 0; i < 100; i++)
+        tree.insert(i, i);
+    var result = tree.filter(function (item) {
+        return Boolean(1 - item % 2);
+    });
+    assert.deepEqual(result[0], 0, "Filter of the even values");
+    assert.deepEqual(result[result.length - 1], 98, "Filter on the even values");
+});
+QUnit.test("RBTreeList - Clear test", function (assert) {
+    var tree = new ds.RBTreeList();
+    tree.insert(0, 0);
+    tree.insert(2, 2);
+    tree.clear();
+    assert.deepEqual(tree.isEmpty(), true, "Clear tree");
+});
+QUnit.test("RBTreeList - Is empty test", function (assert) {
+    var tree = new ds.RBTreeList();
+    tree.insert(0, 0);
+    tree.insert(2, 2);
+    assert.deepEqual(tree.isEmpty(), false, "Is not empty");
+    tree.clear();
+    assert.deepEqual(tree.isEmpty(), true, "Is empty");
+});
+QUnit.test("RBTreeList - Contains test", function (assert) {
+    var tree = new ds.RBTreeList();
+    tree.insert(0, 0);
+    tree.insert(2, 2);
+    assert.deepEqual(tree.contains(0), true, "Contains 0");
+    assert.deepEqual(tree.contains(2), true, "Contains 2");
+    assert.deepEqual(tree.contains(1), false, "Not contains 1");
+    var callback = function (item) {
+        return item > 0;
+    };
+    assert.deepEqual(tree.fullContains(callback), true, "Contains a value > 0");
+    callback = function (item) {
+        return item < 0;
+    };
+    assert.deepEqual(tree.fullContains(callback), false, "Contains a value < 0");
+});
+QUnit.test("RBTreeList - Execute test", function (assert) {
+    var tree = new ds.RBTreeList();
+    tree.insert(0, 0);
+    tree.insert(2, 2);
+    var callback = function (item) {
+        return item * 2;
+    };
+    tree.execute(callback);
+    assert.deepEqual(tree.search(0), 0, "Execute for key 0");
+    assert.deepEqual(tree.search(2), 4, "Execute for key 1");
+});
+QUnit.test("RBTreeList - Index of test", function (assert) {
+    var tree = new ds.RBTreeList();
+    for (var i = 0; i < 10; i++)
+        tree.insert(i, i);
+    var callback = function (item) {
+        return !(item % 2) && item > 5;
+    };
+    assert.deepEqual(tree.indexOf(0), 0, "Index of 0");
+    assert.deepEqual(tree.indexOf(15), -1, "Index of 15");
+    assert.deepEqual(tree.indexOf(5), 5, "Index of 5");
+    assert.deepEqual(tree.indexOf(null, callback), 6, "Index of the first even number greater than 5");
+});
+QUnit.test("RBTreeList - Last index of test", function (assert) {
+    var tree = new ds.RBTreeList();
+    for (var i = 0; i < 10; i++)
+        tree.insert(i, i);
+    var callback = function (item) {
+        return !(item % 2) && item > 5;
+    };
+    assert.deepEqual(tree.lastIndexOf(0), 0, "Last index of 0");
+    assert.deepEqual(tree.lastIndexOf(15), -1, "Last index of 15");
+    assert.deepEqual(tree.lastIndexOf(5), 5, "Last index of 5");
+    assert.deepEqual(tree.lastIndexOf(null, callback), 8, "Index of the last even number greater than 5");
+});
+QUnit.test("RBTreeList - Indexes of test", function (assert) {
+    var tree = new ds.RBTreeList();
+    for (var i = 0; i < 30; i++)
+        tree.insert(i, i % 10);
+    var callback = function (item) {
+        return !(item % 2) && item > 5;
+    };
+    assert.deepEqual(tree.allIndexesOf(0), [0, 10, 20], "Indexes of 0");
+    assert.deepEqual(tree.allIndexesOf(15), [], "Indexes of 15");
+    assert.deepEqual(tree.allIndexesOf(5), [5, 15, 25], "Indexes of 5");
+    assert.deepEqual(tree.allIndexesOf(null, callback), [6, 8, 16, 18, 26, 28], "Indexes of the even numbers greater than 5");
+});
+QUnit.test("RBTreeList - Clone test", function (assert) {
+    var tree = new ds.RBTreeList();
+    for (var i = 0; i < 10; i++)
+        tree.insert(i, i);
+    var clone = tree.clone();
+    var it = clone.getIterator();
+    var j = 0;
+    for (it.first(); !it.isDone(); it.next(), j++)
+        assert.deepEqual(it.getItem(), j, "Clone of the tree");
+});
+QUnit.test("RBTreeList - Clone distinct test", function (assert) {
+    var tree = new ds.RBTreeList();
+    for (var i = 0; i < 20; i++)
+        tree.insert(i % 10, i % 10);
+    var clone = tree.cloneDistinct();
+    assert.deepEqual(clone.allIndexesOf(2), [2], "Clone of the tree");
+});
+/**
+ * Created by Stefano on 06/04/14.
+ */
+QUnit.test("Set - Insert test", function (assert) {
+    var setA = new ds.Set();
+    var e0 = new ds.Element(0);
+    var e1 = new ds.Element(1);
+    setA.multiInsert([e0, e1]);
+    assert.deepEqual(setA.getItems(), [0, 1], "Insert elements");
+    assert.deepEqual(setA.getCardinality(), 2, "Insert elements");
+});
+QUnit.test("Set - Union test", function (assert) {
+    var setA = new ds.Set();
+    var setB = new ds.Set();
+    var e0 = new ds.Element(0);
+    var e1 = new ds.Element(1);
+    var e2 = new ds.Element(2);
+    var e3 = new ds.Element(3);
+    setA.multiInsert([e0, e1]);
+    setA.multiInsert([e2, e3]);
+    var union = setA.union(setB);
+    assert.deepEqual(setA.parents.contains(union), true, "Union of sets");
+    assert.deepEqual(setB.parents.contains(union), true, "Union of sets");
+    assert.deepEqual(union.getCardinality(), 4, "Union of sets");
+});
+QUnit.test("Set - Intersection test", function (assert) {
+    var setA = new ds.Set();
+    var setB = new ds.Set();
+    var e = [];
+    for (var i = 0; i < 6; i++) {
+        e.push(new ds.Element(i));
+        if (i < 4)
+            setA.insert(e[i]);
+        if (i > 1)
+            setB.insert(e[i]);
+    }
+    var intersection = setA.intersect(setB);
+    for (var k = 0; k < 2; k++)
+        assert.deepEqual(intersection.elements.getItem(k).item, k + 2, "Intersection of sets");
+    assert.deepEqual(intersection.getCardinality(), 2, "Intersection of sets");
+});
+QUnit.test("Set - Difference test", function (assert) {
+    var setA = new ds.Set();
+    var setB = new ds.Set();
+    var e = [];
+    for (var i = 0; i < 6; i++) {
+        e.push(new ds.Element(i));
+        if (i < 4)
+            setA.insert(e[i]);
+        if (i > 1)
+            setB.insert(e[i]);
+    }
+    var diffA = setA.difference(setB);
+    var diffB = setB.difference(setA);
+    for (var j = 0; j < 2; j++)
+        assert.deepEqual(diffA.elements.getItem(j).item, j, "Difference of sets");
+    assert.deepEqual(diffA.getCardinality(), 2, "Difference of sets");
+    for (var k = 0; k < 2; k++)
+        assert.deepEqual(diffB.elements.getItem(k).item, k + 4, "Difference of sets");
+    assert.deepEqual(diffB.getCardinality(), 2, "Difference of sets");
+});
+QUnit.test("Set - Cartesian product test", function (assert) {
+    var setA = new ds.Set();
+    var setB = new ds.Set();
+    var e = [];
+    for (var i = 0; i < 6; i++) {
+        e.push(new ds.Element(i));
+        if (i < 3)
+            setA.insert(e[i]);
+        if (i > 2)
+            setB.insert(e[i]);
+    }
+    var productA = setA.cartesianProduct(setB);
+    var productB = setB.cartesianProduct(setA);
+    assert.deepEqual(productA.getItems(), [
+        [0, 3],
+        [0, 4],
+        [0, 5],
+        [1, 3],
+        [1, 4],
+        [1, 5],
+        [2, 3],
+        [2, 4],
+        [2, 5]
+    ], "Cartesian product of sets");
+    assert.deepEqual(productA.getCardinality(), 9, "Cartesian product of sets");
+    assert.deepEqual(productB.getItems(), [
+        [3, 0],
+        [3, 1],
+        [3, 2],
+        [4, 0],
+        [4, 1],
+        [4, 2],
+        [5, 0],
+        [5, 1],
+        [5, 2]
+    ], "Cartesian product of sets");
+    assert.deepEqual(productB.getCardinality(), 9, "Cartesian product of sets");
+});
+/**
+ * Created by Battistella Stefano on 31/03/14.
+ */
+QUnit.test("Stack - Init test", function (assert) {
+    var stack = new ds.Stack(0, 2, 4, 6);
+    assert.deepEqual(stack.multiPop(4), [6, 4, 2, 0], "Initializing");
+    stack = new ds.Stack(0);
+    assert.deepEqual(stack.multiPop(4), [0], "Initializing");
+});
+QUnit.test("Stack - Init range test", function (assert) {
+    var stack = new ds.Stack(ds.Range(0, 6, 2));
+    assert.deepEqual(stack.multiPop(4), [6, 4, 2, 0], "Initializing");
+});
+QUnit.test("Stack - Push test", function (assert) {
+    var stack = new ds.Stack();
+    stack.push(0);
+    assert.deepEqual(stack.getItem(0), 0, "Push 0");
+    stack.push(2);
+    assert.deepEqual(stack.getItem(0), 2, "Push 2");
+    assert.deepEqual(stack.getItem(1), 0, "Push 2");
+});
+QUnit.test("Stack - Pop test", function (assert) {
+    var stack = new ds.Stack();
+    stack.push(0);
+    stack.push(2);
+    assert.deepEqual(stack.pop(), 2, "Pop");
+    assert.deepEqual(stack.pop(), 0, "Check length");
+    assert.deepEqual(stack.pop(), undefined, "Check length if too much pop");
+});
+QUnit.test("Stack - MultiPop test", function (assert) {
+    var stack = new ds.Stack();
+    stack.push(0);
+    stack.push(2);
+    assert.deepEqual(stack.multiPop(1), [2], "MultiPop 1 time");
+    stack.push(4);
+    stack.push(5);
+    stack.push(8);
+    assert.deepEqual(stack.multiPop(7), [8, 5, 4, 0], "MultiPop 7 times");
+    assert.deepEqual(stack.multiPop(1), [], "MultiPop 1 time with stack empty");
+});
+QUnit.test("Stack - Iterator test", function (assert) {
+    var stack = new ds.Stack();
+    for (var i = 0; i < 10; i++)
+        stack.push(i);
+    var j = 9;
+    var it = stack.getIterator();
+    for (it.first(); !it.isDone(); it.next(), j--)
+        assert.deepEqual(it.getItem(), j, "Get next item " + (10 - j));
+    j++;
+    for (it.last(); !it.isDone(); it.previous(), j++)
+        assert.deepEqual(it.getItem(), j, "Get previous item " + (10 - j));
+});
+QUnit.test("Stack - Get length test", function (assert) {
+    var stack = new ds.Stack();
+    assert.deepEqual(stack.getLength(), 0, "Length 0");
+    stack.push(0);
+    assert.deepEqual(stack.getLength(), 1, "Length 1");
+    stack.push(2);
+    assert.deepEqual(stack.getLength(), 2, "Length 2");
+    stack.pop();
+    stack.pop();
+    assert.deepEqual(stack.getLength(), 0, "Length 0");
+});
+QUnit.test("Stack - Peek test", function (assert) {
+    var stack = new ds.Stack();
+    stack.push(0);
+    assert.deepEqual(stack.peek(), 0, "Peek 0");
+    stack.push(2);
+    assert.deepEqual(stack.peek(), 2, "Peek 2");
+});
+QUnit.test("Stack - Clear test", function (assert) {
+    var stack = new ds.Stack();
+    stack.push(0);
+    stack.push(2);
+    stack.clear();
+    assert.deepEqual(stack.isEmpty(), true, "Clear stack");
+});
+QUnit.test("Stack - Is empty test", function (assert) {
+    var stack = new ds.Stack();
+    stack.push(0);
+    stack.push(2);
+    assert.deepEqual(stack.isEmpty(), false, "Is empty");
+    stack.clear();
+    assert.deepEqual(stack.isEmpty(), true, "Is empty");
+});
+QUnit.test("Stack - contains", function (assert) {
+    var stack = new ds.Stack();
+    stack.push(0);
+    stack.push(2);
+    assert.deepEqual(stack.contains(0), true, "Contains 0");
+    assert.deepEqual(stack.contains(2), true, "Contains 2");
+    assert.deepEqual(stack.contains(1), false, "Not contains 1");
+    var callback = function (item) {
+        return item > 0;
+    };
+    assert.deepEqual(stack.contains(null, callback), true, "Contains a value > 0");
+    callback = function (item) {
+        return item < 0;
+    };
+    assert.deepEqual(stack.contains(null, callback), false, "Contains a value < 0");
+});
+QUnit.test("Stack - execute", function (assert) {
+    var stack = new ds.Stack();
+    stack.push(0);
+    stack.push(2);
+    var callback = function (item) {
+        return item * 2;
+    };
+    stack.execute(callback);
+    assert.deepEqual(stack.getItem(0), 4, "Execute for item 1");
+    assert.deepEqual(stack.getItem(1), 0, "Execute for item 0");
+});
+QUnit.test("Stack - Index of test", function (assert) {
+    var stack = new ds.Stack();
+    for (var i = 0; i < 10; i++)
+        stack.push(i);
+    var callback = function (item) {
+        return !(item % 2) && item > 5;
+    };
+    assert.deepEqual(stack.indexOf(0), 0, "Index of 0");
+    assert.deepEqual(stack.indexOf(15), -1, "Index of 15");
+    assert.deepEqual(stack.indexOf(5), 5, "Index of 5");
+    assert.deepEqual(stack.indexOf(null, callback), 8, "Index of the first even number greater than 5");
+});
+QUnit.test("Stack - Last index of test", function (assert) {
+    var stack = new ds.Stack();
+    for (var i = 0; i < 10; i++)
+        stack.push(i);
+    var callback = function (item) {
+        return !(item % 2) && item > 5;
+    };
+    assert.deepEqual(stack.lastIndexOf(0), 0, "Last index of 0");
+    assert.deepEqual(stack.lastIndexOf(15), -1, "Last index of 15");
+    assert.deepEqual(stack.lastIndexOf(5), 5, "Last index of 5");
+    assert.deepEqual(stack.lastIndexOf(null, callback), 6, "Index of the last even number greater than 5");
+});
+QUnit.test("Stack - Indexes of test", function (assert) {
+    var stack = new ds.Stack();
+    for (var i = 0; i < 30; i++)
+        stack.push(i % 10);
+    var callback = function (item) {
+        return !(item % 2) && item > 5;
+    };
+    assert.deepEqual(stack.allIndexesOf(0), [20, 10, 0], "Indexes of 0");
+    assert.deepEqual(stack.allIndexesOf(15), [], "Indexes of 15");
+    assert.deepEqual(stack.allIndexesOf(5), [25, 15, 5], "Indexes of 5");
+    assert.deepEqual(stack.allIndexesOf(null, callback), [28, 26, 18, 16, 8, 6], "Indexes of the even numbers greater than 5");
+});
+QUnit.test("Stack - Clone test", function (assert) {
+    var stack = new ds.Stack();
+    for (var i = 0; i < 10; i++)
+        stack.push(i);
+    var clone = stack.clone();
+    var it = clone.getIterator();
+    var j = 9;
+    for (it.first(); !it.isDone(); it.next(), j--)
+        assert.deepEqual(it.getItem(), j, "Clone of the list");
+});
+QUnit.test("Stack - Clone distinct test", function (assert) {
+    var stack = new ds.Stack();
+    for (var i = 0; i < 20; i++)
+        stack.push(i % 10);
+    var clone = stack.cloneDistinct();
+    assert.deepEqual(clone.allIndexesOf(2), [2], "Clone of the list");
+});
+QUnit.test("Stack - Filter test", function (assert) {
+    var stack = new ds.Stack();
+    var length = 100;
+    for (var i = 0; i < length; i++)
+        stack.push(i);
+    var result = stack.filter(function (item) {
+        return Boolean(1 - item % 2);
+    });
+    assert.deepEqual(result[0], 98, "Filter of the even values");
+    assert.deepEqual(result[result.length - 1], 0, "Filter on the even values");
+});
+/**
+ * Created by Stefano on 06/04/14.
+ */
+QUnit.test("Trie - Insert test", function (assert) {
+    var trie = new ds.Trie();
+    trie.insert("Blue");
+    trie.insert("Bleu");
+    var strings = [];
+    trie.stringsToArray(strings);
+    assert.deepEqual(strings, ["Bleu", "Blue"], "Insert node");
+    trie.insert("Abba", 0);
+    trie.insert("Hello", 0);
+    trie.insert("World", 0);
+    assert.deepEqual(trie.getItem("Abba"), 0, "Insert node");
+    assert.deepEqual(trie.getItem("Hello"), 0, "Insert node");
+    assert.deepEqual(trie.getItem("World"), 0, "Insert node");
+});
+QUnit.test("Trie - Suggest test", function (assert) {
+    var trie = new ds.Trie();
+    trie.insert("Blue");
+    trie.insert("Boing");
+    trie.insert("Yellow");
+    trie.insert("Hello");
+    trie.insert("He");
+    trie.insert("Hola");
+    assert.deepEqual(trie.suggest(""), ["Blue", "Boing", "He", "Hello", "Hola", "Yellow"], "Suggest empty string");
+    assert.deepEqual(trie.suggest("B"), ["Blue", "Boing"], "Suggest B string");
+    assert.deepEqual(trie.suggest("Bo"), ["Boing"], "Suggest Bo string");
+    assert.deepEqual(trie.suggest("Ho"), ["Hola"], "Suggest Ho string");
+    assert.deepEqual(trie.suggest("A"), [], "Suggest A string");
+    assert.deepEqual(trie.suggest("Ready"), [], "Suggest Ready string");
+});
+QUnit.test("Trie - Update Item test", function (assert) {
+    var trie = new ds.Trie();
+    trie.insert("Blue", 0);
+    trie.insert("Boing", 0);
+    trie.insert("Yellow", 0);
+    trie.insert("Hello", 0);
+    trie.insert("He", 0);
+    trie.insert("Hola", 0);
+    var callback = function (item) {
+        return item + 1;
+    };
+    var strings = trie.suggest("");
+    for (var i = 0; i < strings.length; ++i) {
+        trie.updateItem(strings[i], callback);
+        assert.deepEqual(trie.getItem(strings[i]), 1, "Value Updated");
+    }
+});
+//# sourceMappingURL=tests.js.map
\ No newline at end of file
diff --git a/out/tests.js.map b/out/tests.js.map
new file mode 100644
index 0000000..678b835
--- /dev/null
+++ b/out/tests.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"tests.js","sourceRoot":"","sources":["../Tests/BSTree_Test.ts","../Tests/BTree_Test.ts","../Tests/CircularBuffer_Test.ts","../Tests/DoubleLinkedList_Test.ts","../Tests/HashTable_Test.ts","../Tests/LinkedList_Test.ts","../Tests/PriorityQueue_Test.ts","../Tests/Queue_Test.ts","../Tests/Range_Test.ts","../Tests/RBTree_Test.ts","../Tests/RBTreeList_Test.ts","../Tests/Set_Test.ts","../Tests/Stack_Test.ts","../Tests/Trie_Test.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,KAAK,CAAC,IAAI,CAAC,sBAAsB,EAAE,UAAU,MAAM;IAElD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,MAAM,EAAU,CAAC;IACnC,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAC3B,CAAC;QACA,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACzB,CAAC;IACD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;AAC3D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,uBAAuB,EAAE,UAAU,MAAM;IAEnD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;IAC3B,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAC3B,CAAC;QACA,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YACjB,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC;IACD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC;AACpE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,uBAAuB,EAAE,UAAU,MAAM;IAEnD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;IAC3B,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC;IACb,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAC3B,CAAC;QACA,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YACjB,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC;IACD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC;AACpE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,yBAAyB,EAAE,UAAU,MAAM;IAErD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IAC5B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAC7C,CAAC;QACA,IAAI,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;QAC7C,EAAE,CAAC,CAAC,SAAS,CAAC;YACb,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC;QAClD,IAAI;YACH,MAAM,CAAC,SAAS,CAAC,SAAS,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC;IACpD,CAAC;AACF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,2BAA2B,EAAE,UAAU,MAAM;IAEvD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IAC5B,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,QAAQ,EAAE,EAAE,CAAC,EAAE,EAChD,CAAC;QACA,IAAI,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;QACjD,EAAE,CAAC,CAAC,WAAW,CAAC;YACf,MAAM,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;QACtD,IAAI;YACH,MAAM,CAAC,SAAS,CAAC,WAAW,EAAE,IAAI,EAAE,gBAAgB,CAAC,CAAC;IACxD,CAAC;AACF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,2BAA2B,EAAE,UAAU,MAAM;IAEvD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,IAAI,CAAC,OAAO,EAAE,EACrB,CAAC;QACA,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;QACrD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;QAChC,CAAC,EAAE,CAAC;IACL,CAAC;AACF,CAAC,CAAC,CAAC;AC7FH;;GAEG;AAEH,KAAK,CAAC,IAAI,CAAC,qBAAqB,EAAE,UAAU,MAAM;IAEjD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC7B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;QAC3B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAC5B,CAAC;QACA,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;QACnD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;IACrD,CAAC;AACF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,0BAA0B,EAAE,UAAU,MAAM;IAEtD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,eAAe,CAAC,CAAC;AAC9D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,wBAAwB,EAAE,UAAU,MAAM;IAEpD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC3B,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,iBAAiB,CAAC,CAAC;IAC/D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,qBAAqB,CAAC,CAAC;AACjE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,0BAA0B,EAAE,UAAU,MAAM;IAEtD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAC1B,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,aAAa,CAAC,CAAC;IAC7D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,uBAAuB,CAAC,CAAC;AACpE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,sBAAsB,EAAE,UAAU,MAAM;IAElD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAC3B,CAAC;QACA,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YACjB,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC;IACD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,cAAc,CAAC,CAAC;IACnE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC;AACzD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,sBAAsB,EAAE,UAAU,MAAM;IAElD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC;IACb,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAC3B,CAAC;QACA,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YACjB,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC;IACD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,cAAc,CAAC,CAAC;IACnE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC;AACzD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,uBAAuB,EAAE,UAAU,MAAM;IAEnD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QACzB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;AAC/D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,qBAAqB,EAAE,UAAU,MAAM;IAEjD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,KAAK,CAAS,CAAC,CAAC,CAAC;IAEnC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEnB,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,IAAI;QAEtC,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IACH,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,2BAA2B,CAAC,CAAC;AACxE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,oBAAoB,EAAE,UAAU,MAAM;IAEhD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,KAAK,EAAE,CAAC;IACb,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;AACtD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,uBAAuB,EAAE,UAAU,MAAM;IAEnD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC;IACxD,IAAI,CAAC,KAAK,EAAE,CAAC;IACb,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;AACpD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,uBAAuB,EAAE,UAAU,MAAM;IAEnD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;IACvD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;IACvD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;IAC5D,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACjB,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,sBAAsB,CAAC,CAAC;IAC5E,QAAQ,GAAG,UAAU,IAAI;QAExB,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACjB,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE,KAAK,EAAE,sBAAsB,CAAC,CAAC;AAC9E,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,sBAAsB,EAAE,UAAU,MAAM;IAElD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACjB,CAAC,CAAC;IACF,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACvB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,mBAAmB,CAAC,CAAC;IACzD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,mBAAmB,CAAC,CAAC;AAC1D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,uBAAuB,EAAE,UAAU,MAAM;IAEnD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IACnD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;IACtD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IACnD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,+CAA+C,CAAC,CAAC;AACpG,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,4BAA4B,EAAE,UAAU,MAAM;IAExD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;IAC5D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC;IAC/D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;IAC5D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,8CAA8C,CAAC,CAAC;AACvG,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,yBAAyB,EAAE,UAAU,MAAM;IAErD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;IACxB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IACpE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,eAAe,CAAC,CAAC;IAC7D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IACpE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,4CAA4C,CAAC,CAAC;AAC3H,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,oBAAoB,EAAE,UAAU,MAAM;IAEhD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;IACzB,IAAI,EAAE,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IAC7B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE;QAC5C,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,mBAAmB,CAAC,CAAC;AACzD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,6BAA6B,EAAE,UAAU,MAAM;IAEzD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;IACxB,IAAI,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;IACjC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;AACnE,CAAC,CAAC,CAAC;ACxNH;;GAEG;AAEH,KAAK,CAAC,IAAI,CAAC,6BAA6B,EAAE,UAAU,MAAM;IAEzD,IAAI,MAAM,GAAG,IAAI,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;IACvC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QACzB,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;IAChD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;IACxD,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;IAChD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QACzB,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;IAChD,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;AACpD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,4BAA4B,EAAE,UAAU,MAAM;IAExD,IAAI,MAAM,GAAG,IAAI,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;IACvC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QACzB,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;IAC3D,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IAC/C,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IAE/C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,gBAAgB,CAAC,CAAC;IACnD,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,gBAAgB,CAAC,CAAC;IAEnD,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE;QACtC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;IAC3D,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IAC/C,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IAE/C,MAAM,CAAC,OAAO,EAAE,CAAC;IACjB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;IACzD,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;AACtD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,6BAA6B,EAAE,UAAU,MAAM;IAEzD,IAAI,MAAM,GAAG,IAAI,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;IACvC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC;IAC1D,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;AACtD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,6BAA6B,EAAE,UAAU,MAAM;IAEzD,IAAI,MAAM,GAAG,IAAI,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;IACvC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QACzB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;IAChE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,qBAAqB,CAAC,CAAC;IACjE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,qBAAqB,CAAC,CAAC;IACjE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,MAAM,CAAC,OAAO,EAAE,EAAE,aAAa,CAAC,CAAC;IACnE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,MAAM,CAAC,MAAM,EAAE,EAAE,aAAa,CAAC,CAAC;AAClE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,8BAA8B,EAAE,UAAU,MAAM;IAE1D,IAAI,MAAM,GAAG,IAAI,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;IACtC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QACzB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;IAC3B,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAClB,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,qBAAqB,CAAC,CAAC;IACxD,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,qBAAqB,CAAC,CAAC;IACxD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClB,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,eAAe,CAAC,CAAC;QAC9D,IAAI;YACH,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,gBAAgB,CAAC,CAAC;IACxD,MAAM,GAAG,KAAK,CAAC;IACf,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,qBAAqB,CAAC,CAAC;IACxD,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,qBAAqB,CAAC,CAAC;IACxD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QACzB,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,eAAe,CAAC,CAAC;AAC3D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,gCAAgC,EAAE,UAAU,MAAM;IAE5D,IAAI,MAAM,GAAG,IAAI,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;IACvC,IAAI,EAAE,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;IAC9B,EAAE,CAAC,KAAK,EAAE,CAAC;IACX,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,6BAA6B,CAAC,CAAC;IACnE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChB,IAAI,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5C,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE;QAC5C,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;AAC9D,CAAC,CAAC,CAAC;AC/HH;;GAEG;AAEH,KAAK,CAAC,IAAI,CAAC,8BAA8B,EAAE,UAAU,MAAM;IAE1D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5C,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;IACzD,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;IAClC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;AACpD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,oCAAoC,EAAE,UAAU,MAAM;IAEhE,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACnD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;IACzD,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACtD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;AACxF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,8BAA8B,EAAE,UAAU,MAAM;IAE1D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IACrD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IACrD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;IACpD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;AACrD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,6BAA6B,EAAE,UAAU,MAAM;IAEzD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IAClD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;IACpD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IAClD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;AACrD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,mCAAmC,EAAE,UAAU,MAAM;IAE/D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;IACrD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;IACrD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;IACrD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;AACtD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,gCAAgC,EAAE,UAAU,MAAM;IAE5D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IACvB,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IAClB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC;IACF,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACf,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;IACjD,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAChB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;IACpD,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACf,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACf,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACf,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IAClD,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;IACzB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,8CAA8C,CAAC,CAAC;AACvF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,oCAAoC,EAAE,UAAU,MAAM;IAEhE,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IACvB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC;IACF,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;IACtD,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;IACtD,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;IAC5B,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,4CAA4C,CAAC,CAAC;AACrF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,wCAAwC,EAAE,UAAU,MAAM;IAEpE,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAClB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,kCAAkC,CAAC,CAAC;IAChG,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,kCAAkC,CAAC,CAAC;IACtF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,kCAAkC,CAAC,CAAC;IAC1E,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,kCAAkC,CAAC,CAAC;IAC1F,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,kCAAkC,CAAC,CAAC;IAC7E,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,kCAAkC,CAAC,CAAC;AAC3E,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,mCAAmC,EAAE,UAAU,MAAM;IAE/D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QACzB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,0BAA0B,CAAC,CAAC;IAC3E,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,8BAA8B,CAAC,CAAC;AAChF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,qCAAqC,EAAE,UAAU,MAAM;IAEjE,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IAC5B,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE;QACvC,EAAE,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC;YAChB,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;IAChC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;AACrD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,8BAA8B,EAAE,UAAU,MAAM;IAE1D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,IAAM,MAAM,GAAG,GAAG,CAAC;IACnB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE;QAC9B,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAEnB,IAAI,CAAC,IAAI,EAAE,CAAC;IACZ,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;IAC7C,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;AAChE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,4CAA4C,EAAE,UAAU,MAAM;IAExE,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,IAAM,MAAM,GAAG,GAAG,CAAC;IAEnB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE;QAC9B,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAEnB,IAAI,CAAC,IAAI,CACR,UAAU,IAAI;QAEb,MAAM,CAAC,CAAC,IAAI,CAAC;IACd,CAAC,CACD,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,oBAAoB,CAAC,CAAC;IACpE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,oBAAoB,CAAC,CAAC;AACrE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,gCAAgC,EAAE,UAAU,MAAM;IAE5D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAU,CAAC;IAC7C,IAAM,MAAM,GAAG,GAAG,CAAC;IAEnB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE;QAC9B,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAEnB,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,IAAI;QAEtC,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,2BAA2B,CAAC,CAAC;IAC7D,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,2BAA2B,CAAC,CAAC;AAC7E,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,iCAAiC,EAAE,UAAU,MAAM;IAE7D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,IAAM,MAAM,GAAG,GAAG,CAAC;IAEnB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE;QAC9B,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAEnB,IAAI,CAAC,OAAO,EAAE,CAAC;IAEf,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;IAChD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC;AAC3D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,kCAAkC,EAAE,UAAU,MAAM;IAE9D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IAErC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;QAC3B,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAElB,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IAE5B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAC7C,CAAC;QACA,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,yBAAyB,CAAC,CAAC;IAC9D,CAAC;IACD,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,QAAQ,EAAE,EAAE,CAAC,EAAE,EAChD,CAAC;QACA,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,yBAAyB,CAAC,CAAC;IAClE,CAAC;AAEF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,gCAAgC,EAAE,UAAU,MAAM;IAE5D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;IAC7C,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;IACjD,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAClB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;IACzD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;IACzD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC;IAClD,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAClB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC;IAClD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC;IAClD,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;AAC9C,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,kCAAkC,EAAE,UAAU,MAAM;IAE9D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;IACjE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC;AACpE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,oCAAoC,EAAE,UAAU,MAAM;IAEhE,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,kBAAkB,CAAC,CAAC;IAC1D,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IACpD,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACrB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;AAErD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,8BAA8B,EAAE,UAAU,MAAM;IAE1D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;IACzC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;IACzC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;AAC1C,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,+BAA+B,EAAE,UAAU,MAAM;IAE3D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,KAAK,EAAE,CAAC;IACb,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,gBAAgB,CAAC,CAAC;AAEzD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,kCAAkC,EAAE,UAAU,MAAM;IAE9D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;IACnD,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC;IACxD,IAAI,CAAC,KAAK,EAAE,CAAC;IACb,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;AACpD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,6BAA6B,EAAE,UAAU,MAAM;IAEzD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;IACvD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;IACvD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;IAC5D,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACjB,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,IAAI,EAAE,sBAAsB,CAAC,CAAC;IAC9E,QAAQ,GAAG,UAAU,IAAI;QAExB,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACjB,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,KAAK,EAAE,sBAAsB,CAAC,CAAC;AAChF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,4BAA4B,EAAE,UAAU,MAAM;IAExD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACjB,CAAC,CAAC;IACF,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACvB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,oBAAoB,CAAC,CAAC;IAC3D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,oBAAoB,CAAC,CAAC;AAC5D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,kCAAkC,EAAE,UAAU,MAAM;IAE9D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IACnD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;IACtD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IACnD,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IACnD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,+CAA+C,CAAC,CAAC;AACpG,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,uCAAuC,EAAE,UAAU,MAAM;IAEnE,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;IAC5D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC;IAC/D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;IAC5D,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;IAC5D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,8CAA8C,CAAC,CAAC;AACvG,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,oCAAoC,EAAE,UAAU,MAAM;IAEhE,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IACvB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IACpE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,eAAe,CAAC,CAAC;IAC7D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IACpE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IACjE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IACpE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,4CAA4C,CAAC,CAAC;AAC3H,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,8BAA8B,EAAE,UAAU,MAAM;IAE1D,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACtC,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACtC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAC1B,CAAC;QACA,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAClB,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;IACrE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,EAAE,EAAE,8BAA8B,CAAC,CAAC;AACzE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,gCAAgC,EAAE,UAAU,MAAM;IAE5D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5B,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,qBAAqB,CAAC,CAAC;IAC/D,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAC5B,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,kBAAkB,CAAC,CAAC;IAC5D,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC3B,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,0BAA0B,CAAC,CAAC;IAClE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,0BAA0B,CAAC,CAAC;IAClE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,0BAA0B,CAAC,CAAC;IACnE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,0BAA0B,CAAC,CAAC;IACzE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,0BAA0B,CAAC,CAAC;IAClE,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC3B,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,8BAA8B,CAAC,CAAC;IACvE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,8BAA8B,CAAC,CAAC;IACtE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,8BAA8B,CAAC,CAAC;IAC9E,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,8BAA8B,CAAC,CAAC;IACtE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,8BAA8B,CAAC,CAAC;IACtE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,8BAA8B,CAAC,CAAC;AAC9E,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,+BAA+B,EAAE,UAAU,MAAM;IAE3D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;IACzB,IAAI,EAAE,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IAC7B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE;QAC5C,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,mBAAmB,CAAC,CAAC;AACzD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,wCAAwC,EAAE,UAAU,MAAM;IAEpE,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IACvB,IAAI,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;IACjC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;AACnE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,+BAA+B,EAAE,UAAU,MAAM;IAE3D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QACzB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC1B,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,mCAAmC,CAAC,CAAC;IACvE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,sCAAsC,CAAC,CAAC;IACxF,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,sCAAsC,CAAC,CAAC;IACxF,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,sCAAsC,CAAC,CAAC;AACnF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,+BAA+B,EAAE,UAAU,MAAM;IAE3D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,gBAAgB,EAAE,CAAC;IACrC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACjB,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,yCAAyC,CAAC,CAAC;AACtF,CAAC,CAAC,CAAC;ACjdH;;GAEG;AAEH,KAAK,CAAC,IAAI,CAAC,yBAAyB,EAAE,UAAU,MAAM;IAErD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAChC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,WAAW,GAAG,CAAC,CAAC,CAAC;IAClC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,WAAW,GAAG,CAAC,EAAE,SAAS,GAAG,CAAC,CAAC,CAAC;AACpE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,6BAA6B,EAAE,UAAU,MAAM;IAEzD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAChC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACnB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;AAC5D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,iCAAiC,EAAE,UAAU,MAAM;IAE7D,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAChC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;QAC3B,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IACzC,KAAK,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;IACvB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,gBAAgB,CAAC,CAAC;AACnE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,2BAA2B,EAAE,UAAU,MAAM;IAEvD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;IACjC,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAC5B,CAAC;QACA,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACnC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;IACD,IAAI,CAAC,IAAI,EAAE,CAAC;IACZ,IAAI,UAAU,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC;IACxC,MAAM,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,EAAE,iBAAiB,CAAC,CAAC;AACvD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,4BAA4B,EAAE,UAAU,MAAM;IAExD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;IACjC,IAAI,KAAK,GAAG,EAAE,CAAC;IACf,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAC5B,CAAC;QACA,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;QACxB,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IACpB,CAAC;IACD,KAAK,CAAC,IAAI,EAAE,CAAC;IACb,IAAI,UAAU,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC;IACzC,MAAM,CAAC,SAAS,CAAC,UAAU,EAAE,KAAK,EAAE,kBAAkB,CAAC,CAAC;AACzD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,+BAA+B,EAAE,UAAU,MAAM;IAE3D,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;IACjC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;QAC3B,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;IACzB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC;IAC7D,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,kBAAkB,CAAC,CAAC;IACpE,IAAI,QAAQ,GAAG,UAAU,CAAC;QAEzB,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC;IACf,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,EAAE,QAAQ,CAAC,EAAE,IAAI,EAAE,8BAA8B,CAAC,CAAC;IACvF,QAAQ,GAAG,UAAU,CAAC;QAErB,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;IACd,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,EAAE,QAAQ,CAAC,EAAE,KAAK,EAAE,2BAA2B,CAAC,CAAC;AACtF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,wBAAwB,EAAE,UAAU,MAAM;IAEpD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;IACjC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;QAC3B,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;IACzB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC;IACzD,KAAK,CAAC,KAAK,EAAE,CAAC;IACd,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC;AACxD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,qCAAqC,EAAE,UAAU,MAAM;IAEjE,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;IACjC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,eAAe,EAAE,EAAE,CAAC,EAAE,kBAAkB,CAAC,CAAC;IACjE,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;QAC3B,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;IACzB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,eAAe,EAAE,EAAE,GAAG,EAAE,iBAAiB,CAAC,CAAC;AACnE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,2BAA2B,EAAE,UAAU,MAAM;IAEvD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;IACjC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,kBAAkB,CAAC,CAAC;IAC5D,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;QAC3B,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;IACzB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC;IACzD,KAAK,CAAC,KAAK,EAAE,CAAC;IACd,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC;AACxD,CAAC,CAAC,CAAC;AC1GH;;GAEG;AAEH,KAAK,CAAC,IAAI,CAAC,wBAAwB,EAAE,UAAU,MAAM;IAEpD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACtC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;IACzD,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAC5B,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;AACpD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,mCAAmC,EAAE,UAAU,MAAM;IAE/D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7C,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,sBAAsB,CAAC,CAAC;AAC9E,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,wBAAwB,EAAE,UAAU,MAAM;IAEpD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IACrD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IACrD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;IACpD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;AACrD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,uBAAuB,EAAE,UAAU,MAAM;IAEnD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IAClD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;IACpD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IAClD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;AACrD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,6BAA6B,EAAE,UAAU,MAAM;IAEzD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;IACrD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;IACrD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;IACrD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;AACtD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,0BAA0B,EAAE,UAAU,MAAM;IAEtD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IACvB,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IAClB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC;IACF,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACf,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;IACjD,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAChB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;IACpD,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACf,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACf,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACf,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IAClD,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;IACzB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,8CAA8C,CAAC,CAAC;AACvF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,8BAA8B,EAAE,UAAU,MAAM;IAE1D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IACvB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC;IACF,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;IACtD,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;IACtD,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;IAC5B,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,4CAA4C,CAAC,CAAC;AACrF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,kCAAkC,EAAE,UAAU,MAAM;IAE9D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAClB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,kCAAkC,CAAC,CAAC;IAChG,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,kCAAkC,CAAC,CAAC;IACtF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,kCAAkC,CAAC,CAAC;IAC1E,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,kCAAkC,CAAC,CAAC;IAC1F,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,kCAAkC,CAAC,CAAC;IAC7E,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,kCAAkC,CAAC,CAAC;AAC3E,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,6BAA6B,EAAE,UAAU,MAAM;IAEzD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QACzB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,0BAA0B,CAAC,CAAC;IAC3E,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,8BAA8B,CAAC,CAAC;AAChF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,4BAA4B,EAAE,UAAU,MAAM;IAExD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,KAAK,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;IAC3B,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;IAC1C,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;IAC1C,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;IAC1C,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;AAC3C,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,8BAA8B,EAAE,UAAU,MAAM;IAE1D,IAAI,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACzB,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IACtB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IACnD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IACnD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IACnD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;AACpD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,0BAA0B,EAAE,UAAU,MAAM;IAEtD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAU,CAAC;IACvC,IAAM,MAAM,GAAG,GAAG,CAAC;IAEnB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE;QAC9B,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAEnB,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,IAAI;QAEtC,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,2BAA2B,CAAC,CAAC;IAC7D,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,2BAA2B,CAAC,CAAC;AAC7E,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,4BAA4B,EAAE,UAAU,MAAM;IAExD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAE/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;QAC3B,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAElB,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IAE5B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAC7C,CAAC;QACA,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,yBAAyB,CAAC,CAAC;IAC9D,CAAC;AAEF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,0BAA0B,EAAE,UAAU,MAAM;IAEtD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;IAC7C,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;IACjD,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAClB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;IACzD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;IACzD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC;IAClD,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAClB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC;IAClD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC;IAClD,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;AAC9C,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,4BAA4B,EAAE,UAAU,MAAM;IAExD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;IACjE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC;AACpE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,8BAA8B,EAAE,UAAU,MAAM;IAE1D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,kBAAkB,CAAC,CAAC;IAC1D,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IACpD,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACrB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;AAErD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,wBAAwB,EAAE,UAAU,MAAM;IAEpD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;IACzC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;IACzC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;AAC1C,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,yBAAyB,EAAE,UAAU,MAAM;IAErD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,KAAK,EAAE,CAAC;IACb,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,gBAAgB,CAAC,CAAC;AAEzD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,4BAA4B,EAAE,UAAU,MAAM;IAExD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;IACnD,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC;IACxD,IAAI,CAAC,KAAK,EAAE,CAAC;IACb,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;AACpD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,4BAA4B,EAAE,UAAU,MAAM;IAExD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;IACvD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;IACvD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;IAC5D,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACjB,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,IAAI,EAAE,sBAAsB,CAAC,CAAC;IAC9E,QAAQ,GAAG,UAAU,IAAI;QAExB,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACjB,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,KAAK,EAAE,sBAAsB,CAAC,CAAC;AAChF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,2BAA2B,EAAE,UAAU,MAAM;IAEvD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACjB,CAAC,CAAC;IACF,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACvB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,oBAAoB,CAAC,CAAC;IAC3D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,oBAAoB,CAAC,CAAC;AAC5D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,4BAA4B,EAAE,UAAU,MAAM;IAExD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IACnD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;IACtD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IACnD,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IACnD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,+CAA+C,CAAC,CAAC;AACpG,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,iCAAiC,EAAE,UAAU,MAAM;IAE7D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;IAC5D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC;IAC/D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;IAC5D,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;IAC5D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,8CAA8C,CAAC,CAAC;AACvG,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,8BAA8B,EAAE,UAAU,MAAM;IAE1D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IACvB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IACpE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,eAAe,CAAC,CAAC;IAC7D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IACpE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IACjE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IACpE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,4CAA4C,CAAC,CAAC;AAC3H,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,wBAAwB,EAAE,UAAU,MAAM;IAEpD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAChC,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAChC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAC1B,CAAC;QACA,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAClB,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;IACrE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,EAAE,EAAE,8BAA8B,CAAC,CAAC;AACzE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,0BAA0B,EAAE,UAAU,MAAM;IAEtD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5B,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,qBAAqB,CAAC,CAAC;IAC/D,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAC5B,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,kBAAkB,CAAC,CAAC;IAC5D,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC3B,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,0BAA0B,CAAC,CAAC;IAClE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,0BAA0B,CAAC,CAAC;IAClE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,0BAA0B,CAAC,CAAC;IACnE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,0BAA0B,CAAC,CAAC;IACzE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,0BAA0B,CAAC,CAAC;IAClE,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC3B,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,8BAA8B,CAAC,CAAC;IACvE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,8BAA8B,CAAC,CAAC;IACtE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,8BAA8B,CAAC,CAAC;IAC9E,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,8BAA8B,CAAC,CAAC;IACtE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,8BAA8B,CAAC,CAAC;IACtE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,8BAA8B,CAAC,CAAC;AAC9E,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,yBAAyB,EAAE,UAAU,MAAM;IAErD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;IACzB,IAAI,EAAE,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IAC7B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE;QAC5C,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,mBAAmB,CAAC,CAAC;AACzD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,kCAAkC,EAAE,UAAU,MAAM;IAE9D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IACvB,IAAI,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;IACjC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;AACnE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,yBAAyB,EAAE,UAAU,MAAM;IAErD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QACzB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC1B,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,mCAAmC,CAAC,CAAC;IACvE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,sCAAsC,CAAC,CAAC;IACxF,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,sCAAsC,CAAC,CAAC;IACxF,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,sCAAsC,CAAC,CAAC;AACnF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,yBAAyB,EAAE,UAAU,MAAM;IAErD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACjB,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,yCAAyC,CAAC,CAAC;AACtF,CAAC,CAAC,CAAC;AC1aH;;GAEG;AAEH,KAAK,CAAC,IAAI,CAAC,8BAA8B,EAAE,UAAU,MAAM;IAE1D,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,aAAa,EAAE,CAAC;IACnC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC;IAC/C,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC;IACnD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC;AACpD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,mCAAmC,EAAE,UAAU,MAAM;IAE/D,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,aAAa,EAAE,CAAC;IACnC,KAAK,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,sBAAsB,CAAC,CAAC;IACxE,KAAK,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3B,KAAK,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACjC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,sBAAsB,CAAC,CAAC;IAC9E,KAAK,CAAC,YAAY,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAC1B,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,sBAAsB,CAAC,CAAC;AACrE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,8BAA8B,EAAE,UAAU,MAAM;IAE1D,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,aAAa,EAAE,CAAC;IACnC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;IAChD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;IAChD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,SAAS,EAAE,kCAAkC,CAAC,CAAC;AAClF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,mCAAmC,EAAE,UAAU,MAAM;IAE/D,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,aAAa,EAAE,CAAC;IACnC,KAAK,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACrB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,qBAAqB,CAAC,CAAC;IACpE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,kCAAkC,CAAC,CAAC;IAC3E,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,sBAAsB,CAAC,CAAC;IAC9E,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,kCAAkC,CAAC,CAAC;IAC3E,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,sCAAsC,CAAC,CAAC;AACrF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,6BAA6B,EAAE,UAAU,MAAM;IAEzD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,aAAa,EAAE,CAAC;IACnC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,8BAA8B,CAAC,CAAC;AACpF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,+BAA+B,EAAE,UAAU,MAAM;IAE3D,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,aAAa,EAAE,CAAC;IACnC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;IACrD,KAAK,CAAC,KAAK,EAAE,CAAC;IACd,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;AACrD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,4BAA4B,EAAE,UAAU,MAAM;IAExD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,aAAa,EAAU,CAAC;IAC3C,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,KAAK,CAAC,KAAK,EAAE,CAAC;IACd,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC;AACxD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,+BAA+B,EAAE,UAAU,MAAM;IAE3D,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,aAAa,EAAE,CAAC;IACnC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,KAAK,CAAC,OAAO,CAAC,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1C,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,EAAE,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IAC7B,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE;QAC5C,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,gBAAgB,GAAG,CAAC,CAAC,CAAC;IACzD,CAAC,EAAE,CAAC;IACJ,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,QAAQ,EAAE,EAAE,CAAC,EAAE;QAC/C,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,oBAAoB,GAAG,CAAC,CAAC,CAAC;AAC9D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,wCAAwC,EAAE,UAAU,MAAM;IAEpE,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,aAAa,EAAE,CAAC;IACnC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,qBAAqB,CAAC,CAAC;IACzE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,qBAAqB,CAAC,CAAC;IACzE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,yBAAyB,CAAC,CAAC;IAC9E,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACjB,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,gBAAgB,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,IAAI,EAAE,yBAAyB,CAAC,CAAC;IAC1F,QAAQ,GAAG,UAAU,IAAI;QAExB,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACjB,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,gBAAgB,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,KAAK,EAAE,yBAAyB,CAAC,CAAC;AAC5F,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,gCAAgC,EAAE,UAAU,MAAM;IAE5D,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,aAAa,EAAE,CAAC;IACnC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,2BAA2B,CAAC,CAAC;IAC5E,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,2BAA2B,CAAC,CAAC;AACtE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,+BAA+B,EAAE,UAAU,MAAM;IAE3D,IAAI,aAAa,GAAG,IAAI,EAAE,CAAC,aAAa,EAAE,CAAC;IAC3C,aAAa,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5B,aAAa,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5B,aAAa,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5B,IAAI,KAAK,GAAG,aAAa,CAAC,OAAO,EAAE,CAAC;IACpC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,2BAA2B,CAAC,CAAC;AACvE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,8BAA8B,EAAE,UAAU,MAAM;IAE1D,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,aAAa,EAAE,CAAC;IACnC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACjB,CAAC,CAAC;IACF,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACxB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,oBAAoB,CAAC,CAAC;IAC5D,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,oBAAoB,CAAC,CAAC;AAC7D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,6BAA6B,EAAE,UAAU,MAAM;IAEzD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,aAAa,EAAE,CAAC;IACnC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QACzB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,yBAAyB,CAAC,CAAC;IAClE,KAAK,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAC1B,CAAC;QACA,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACN,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,yBAAyB,CAAC,CAAC;QAClE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACd,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,yBAAyB,CAAC,CAAC;QACtE,IAAI;YACH,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,yBAAyB,CAAC,CAAC;IACnE,CAAC;IACD,KAAK,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC5B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAC1B,CAAC;QACA,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACN,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,yBAAyB,CAAC,CAAC;QAClE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACd,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,yBAAyB,CAAC,CAAC;QACtE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YAChB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,yBAAyB,CAAC,CAAC;QAClE,IAAI;YACH,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,yBAAyB,CAAC,CAAC;IACnE,CAAC;AAEF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,6BAA6B,EAAE,UAAU,MAAM;IAEzD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,aAAa,EAAE,CAAC;IACnC,IAAM,MAAM,GAAG,GAAG,CAAC;IAEnB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE;QAC9B,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAErB,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,IAAI;QAEvC,MAAM,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;IACrB,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,2BAA2B,CAAC,CAAC;IAC7D,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,2BAA2B,CAAC,CAAC;AAC7E,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,4BAA4B,EAAE,UAAU,MAAM;IAExD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,aAAa,EAAE,CAAC;IACnC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrB,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;IAC1B,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;AAChG,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,qCAAqC,EAAE,UAAU,MAAM;IAEjE,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,aAAa,EAAE,CAAC;IACnC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;IAC/B,IAAI,KAAK,GAAG,KAAK,CAAC,aAAa,EAAE,CAAC;IAClC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;AAChG,CAAC,CAAC,CAAC;AC1NH;;GAEG;AAEH,KAAK,CAAC,IAAI,CAAC,mBAAmB,EAAE,UAAU,MAAM;IAE/C,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACrC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;IACtE,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACxB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;AAC9D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,yBAAyB,EAAE,UAAU,MAAM;IAErD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC5C,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;AACvE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,sBAAsB,EAAE,UAAU,MAAM;IAElD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC;IAC/C,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC;IACnD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC;AACpD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,2BAA2B,EAAE,UAAU,MAAM;IAEvD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC3B,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,sBAAsB,CAAC,CAAC;IACxE,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxB,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,sBAAsB,CAAC,CAAC;IAC9E,KAAK,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;IACvB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,sBAAsB,CAAC,CAAC;AACrE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,sBAAsB,EAAE,UAAU,MAAM;IAElD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;IAChD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;IAChD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,SAAS,EAAE,kCAAkC,CAAC,CAAC;AAClF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,2BAA2B,EAAE,UAAU,MAAM;IAEvD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,qBAAqB,CAAC,CAAC;IACpE,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,sBAAsB,CAAC,CAAC;IAC9E,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,sCAAsC,CAAC,CAAC;AACrF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,qBAAqB,EAAE,UAAU,MAAM;IAEjD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,8BAA8B,CAAC,CAAC;AACpF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,uBAAuB,EAAE,UAAU,MAAM;IAEnD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,EAAE,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IAC7B,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE;QAC5C,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,gBAAgB,GAAG,CAAC,CAAC,CAAC;IACzD,CAAC,EAAE,CAAC;IACJ,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,QAAQ,EAAE,EAAE,CAAC,EAAE;QAC/C,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,oBAAoB,GAAG,CAAC,CAAC,CAAC;AAC9D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,yBAAyB,EAAE,UAAU,MAAM;IAErD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;IACnD,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;IACnD,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;IACnD,KAAK,CAAC,OAAO,EAAE,CAAC;IAChB,KAAK,CAAC,OAAO,EAAE,CAAC;IAChB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;AAEpD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,mBAAmB,EAAE,UAAU,MAAM;IAE/C,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;IAC5C,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;AAC7C,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,oBAAoB,EAAE,UAAU,MAAM;IAEhD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,KAAK,CAAC,KAAK,EAAE,CAAC;IACd,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC;AACxD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,uBAAuB,EAAE,UAAU,MAAM;IAEnD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC;IACzD,KAAK,CAAC,KAAK,EAAE,CAAC;IACd,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;AACrD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,uBAAuB,EAAE,UAAU,MAAM;IAEnD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;IACxD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;IACxD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;IAC7D,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACjB,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,IAAI,EAAE,sBAAsB,CAAC,CAAC;IAC/E,QAAQ,GAAG,UAAU,IAAI;QAExB,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACjB,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,KAAK,EAAE,sBAAsB,CAAC,CAAC;AACjF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,sBAAsB,EAAE,UAAU,MAAM;IAElD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACjB,CAAC,CAAC;IACF,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACxB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,oBAAoB,CAAC,CAAC;IAC5D,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,oBAAoB,CAAC,CAAC;AAC7D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,uBAAuB,EAAE,UAAU,MAAM;IAEnD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IACpD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;IACvD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IACpD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,+CAA+C,CAAC,CAAC;AACrG,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,4BAA4B,EAAE,UAAU,MAAM;IAExD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;IAC7D,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC;IAChE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;IAC7D,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,8CAA8C,CAAC,CAAC;AACxG,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,yBAAyB,EAAE,UAAU,MAAM;IAErD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IACvB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IACrE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,eAAe,CAAC,CAAC;IAC9D,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IACrE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,4CAA4C,CAAC,CAAC;AAC5H,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,oBAAoB,EAAE,UAAU,MAAM;IAEhD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;IAC1B,IAAI,EAAE,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IAC7B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE;QAC5C,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,oBAAoB,CAAC,CAAC;AAC1D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,6BAA6B,EAAE,UAAU,MAAM;IAEzD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IACvB,IAAI,KAAK,GAAG,KAAK,CAAC,aAAa,EAAE,CAAC;IAClC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;AACpE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,qBAAqB,EAAE,UAAU,MAAM;IAEjD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAU,CAAC;IACnC,IAAM,MAAM,GAAG,GAAG,CAAC;IAEnB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE;QAC9B,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAElB,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,IAAI;QAEvC,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,2BAA2B,CAAC,CAAC;IAC5D,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,2BAA2B,CAAC,CAAC;AAC9E,CAAC,CAAC,CAAC;ACtPH;;GAEG;AAEH,KAAK,CAAC,IAAI,CAAC,4BAA4B,EAAE,UAAU,MAAM;IAErD,IAAI,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EACrC,CAAC;QACG,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,oBAAoB,CAAC,CAAC;IACxD,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,6BAA6B,EAAE,UAAU,MAAM;IAEtD,IAAI,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EACrC,CAAC;QACG,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,oBAAoB,CAAC,CAAC;IAC5D,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,0BAA0B,EAAE,UAAU,MAAM;IAEnD,IAAI,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EACrC,CAAC;QACG,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,oBAAoB,CAAC,CAAC;IAC5D,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,kCAAkC,EAAE,UAAU,MAAM;IAE3D,IAAI,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAChC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EACrC,CAAC;QACG,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,oBAAoB,CAAC,CAAC;IACjE,CAAC;AACL,CAAC,CAAC,CAAC;ACtCH;;GAEG;AAEH,KAAK,CAAC,IAAI,CAAC,sBAAsB,EAAE,UAAU,MAAM;IAElD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;IAC3B,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAC3B,CAAC;QACA,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IACD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;IAChE,IAAI,CAAC,IAAI,EAAE,CAAC;IACZ,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;AAC5D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,uBAAuB,EAAE,UAAU,MAAM;IAEnD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;IAC3B,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAC3B,CAAC;QACA,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YACjB,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC;IACD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC;AACpE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,uBAAuB,EAAE,UAAU,MAAM;IAEnD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;IAC3B,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC;IACb,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAC3B,CAAC;QACA,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YACjB,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC;IACD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC;AACpE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,yBAAyB,EAAE,UAAU,MAAM;IAErD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IAC5B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAC7C,CAAC;QACA,IAAI,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;QAC7C,EAAE,CAAC,CAAC,SAAS,CAAC;YACb,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC;QAClD,IAAI;YACH,MAAM,CAAC,SAAS,CAAC,SAAS,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC;IACpD,CAAC;AACF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,2BAA2B,EAAE,UAAU,MAAM;IAEvD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IAC5B,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,QAAQ,EAAE,EAAE,CAAC,EAAE,EAChD,CAAC;QACA,IAAI,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;QACjD,EAAE,CAAC,CAAC,WAAW,CAAC;YACf,MAAM,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;QACtD,IAAI;YACH,MAAM,CAAC,SAAS,CAAC,WAAW,EAAE,IAAI,EAAE,gBAAgB,CAAC,CAAC;IACxD,CAAC;AACF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,2BAA2B,EAAE,UAAU,MAAM;IAEvD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,IAAI,CAAC,OAAO,EAAE,EACrB,CAAC;QACA,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;QACrD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;QAChC,CAAC,EAAE,CAAC;IACL,CAAC;AACF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,wBAAwB,EAAE,UAAU,MAAM;IAEpD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QACzB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;AAC/D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,sBAAsB,EAAE,UAAU,MAAM;IAElD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,MAAM,EAAU,CAAC;IACnC,IAAM,MAAM,GAAG,GAAG,CAAC;IAEnB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE;QAC9B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEnB,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,IAAI;QAEtC,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,2BAA2B,CAAC,CAAC;IAC5D,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,2BAA2B,CAAC,CAAC;AAC9E,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,qBAAqB,EAAE,UAAU,MAAM;IAEjD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,KAAK,EAAE,CAAC;IACb,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;AACtD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,wBAAwB,EAAE,UAAU,MAAM;IAEpD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;IAC3B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC;IACxD,IAAI,CAAC,KAAK,EAAE,CAAC;IACb,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;AACpD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,wBAAwB,EAAE,UAAU,MAAM;IAEpD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;IAC3B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;IACvD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;IACvD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;IAC5D,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACjB,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,sBAAsB,CAAC,CAAC;IAC5E,QAAQ,GAAG,UAAU,IAAI;QAExB,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACjB,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE,KAAK,EAAE,sBAAsB,CAAC,CAAC;AAC9E,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,uBAAuB,EAAE,UAAU,MAAM;IAEnD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;IAC3B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACjB,CAAC,CAAC;IACF,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACvB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,mBAAmB,CAAC,CAAC;IACzD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,mBAAmB,CAAC,CAAC;AAC1D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,wBAAwB,EAAE,UAAU,MAAM;IAEpD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IACnD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;IACtD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IACnD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,+CAA+C,CAAC,CAAC;AACpG,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,6BAA6B,EAAE,UAAU,MAAM;IAEzD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;IAC5D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC;IAC/D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;IAC5D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,8CAA8C,CAAC,CAAC;AACvG,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,0BAA0B,EAAE,UAAU,MAAM;IAEtD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;IACxB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IACpE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,eAAe,CAAC,CAAC;IAC7D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IACpE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,4CAA4C,CAAC,CAAC;AAC3H,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,qBAAqB,EAAE,UAAU,MAAM;IAEjD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;IACzB,IAAI,EAAE,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IAC7B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE;QAC5C,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,mBAAmB,CAAC,CAAC;AACzD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,8BAA8B,EAAE,UAAU,MAAM;IAE1D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;IAC7B,IAAI,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;IACjC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;AACnE,CAAC,CAAC,CAAC;AChPH;;GAEG;AAEH,KAAK,CAAC,IAAI,CAAC,0BAA0B,EAAE,UAAU,MAAM;IAEtD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAC3B,CAAC;QACA,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACzB,CAAC;IACD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;AAC3D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,2BAA2B,EAAE,UAAU,MAAM;IAEvD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAC3B,CAAC;QACA,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YACjB,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC;IACD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC;AACpE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,2BAA2B,EAAE,UAAU,MAAM;IAEvD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC;IACb,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAC3B,CAAC;QACA,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YACjB,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC;IACD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC;AACpE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,6BAA6B,EAAE,UAAU,MAAM;IAEzD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IAC5B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAC7C,CAAC;QACA,IAAI,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;QAC7C,EAAE,CAAC,CAAC,SAAS,CAAC;YACb,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC;QAClD,IAAI;YACH,MAAM,CAAC,SAAS,CAAC,SAAS,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC;IACpD,CAAC;AACF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,+BAA+B,EAAE,UAAU,MAAM;IAE3D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IAC5B,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,QAAQ,EAAE,EAAE,CAAC,EAAE,EAChD,CAAC;QACA,IAAI,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;QACjD,EAAE,CAAC,CAAC,WAAW,CAAC;YACf,MAAM,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;QACtD,IAAI;YACH,MAAM,CAAC,SAAS,CAAC,WAAW,EAAE,IAAI,EAAE,gBAAgB,CAAC,CAAC;IACxD,CAAC;AACF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,+BAA+B,EAAE,UAAU,MAAM;IAE3D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,IAAI,CAAC,OAAO,EAAE,EACrB,CAAC;QACA,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;QACrD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;QAChC,CAAC,EAAE,CAAC;IACL,CAAC;AACF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,4BAA4B,EAAE,UAAU,MAAM;IAExD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QACzB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;AAC/D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,0BAA0B,EAAE,UAAU,MAAM;IAEtD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAU,CAAC;IAEvC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;QAC3B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEnB,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,IAAI;QAEtC,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,2BAA2B,CAAC,CAAC;IAC5D,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,2BAA2B,CAAC,CAAC;AAC9E,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,yBAAyB,EAAE,UAAU,MAAM;IAErD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,KAAK,EAAE,CAAC;IACb,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;AACtD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,4BAA4B,EAAE,UAAU,MAAM;IAExD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC;IACxD,IAAI,CAAC,KAAK,EAAE,CAAC;IACb,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;AACpD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,4BAA4B,EAAE,UAAU,MAAM;IAExD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;IACvD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;IACvD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;IAC5D,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACjB,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,sBAAsB,CAAC,CAAC;IAC5E,QAAQ,GAAG,UAAU,IAAI;QAExB,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACjB,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE,KAAK,EAAE,sBAAsB,CAAC,CAAC;AAC9E,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,2BAA2B,EAAE,UAAU,MAAM;IAEvD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACjB,CAAC,CAAC;IACF,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACvB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,mBAAmB,CAAC,CAAC;IACzD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,mBAAmB,CAAC,CAAC;AAC1D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,4BAA4B,EAAE,UAAU,MAAM;IAExD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IACnD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;IACtD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IACnD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,+CAA+C,CAAC,CAAC;AACpG,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,iCAAiC,EAAE,UAAU,MAAM;IAE7D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;IAC5D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC;IAC/D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;IAC5D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,8CAA8C,CAAC,CAAC;AACvG,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,8BAA8B,EAAE,UAAU,MAAM;IAE1D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;IACxB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAE5B,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IACpE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,eAAe,CAAC,CAAC;IAC7D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IACpE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,4CAA4C,CAAC,CAAC;AAC3H,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,yBAAyB,EAAE,UAAU,MAAM;IAErD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;IACzB,IAAI,EAAE,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IAC7B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE;QAC5C,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,mBAAmB,CAAC,CAAC;AACzD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,kCAAkC,EAAE,UAAU,MAAM;IAE9D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,UAAU,EAAE,CAAC;IAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;IAC7B,IAAI,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;IACjC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;AACnE,CAAC,CAAC,CAAC;AC5OH;;GAEG;AAEH,KAAK,CAAC,IAAI,CAAC,mBAAmB,EAAE,UAAU,MAAM;IAE/C,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC;IACxB,IAAI,EAAE,GAAG,IAAI,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAI,EAAE,GAAG,IAAI,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IAC3B,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC;IAC7D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,cAAc,EAAE,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;AAC/D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,kBAAkB,EAAE,UAAU,MAAM;IAE9C,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC;IACxB,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC;IACxB,IAAI,EAAE,GAAG,IAAI,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAI,EAAE,GAAG,IAAI,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAI,EAAE,GAAG,IAAI,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAI,EAAE,GAAG,IAAI,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IAC3B,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IAC3B,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC7B,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC;IACtE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC;IACtE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,cAAc,EAAE,EAAE,CAAC,EAAE,eAAe,CAAC,CAAC;AAC9D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,yBAAyB,EAAE,UAAU,MAAM;IAErD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC;IACxB,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC;IACxB,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAC1B,CAAC;QACA,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACT,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnB,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACT,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC;IACD,IAAI,YAAY,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IACxC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QACzB,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,sBAAsB,CAAC,CAAC;IACxF,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,cAAc,EAAE,EAAE,CAAC,EAAE,sBAAsB,CAAC,CAAC;AAC5E,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,uBAAuB,EAAE,UAAU,MAAM;IAEnD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC;IACxB,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC;IACxB,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAC1B,CAAC;QACA,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACT,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnB,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACT,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC;IACD,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAClC,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAClC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QACzB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,oBAAoB,CAAC,CAAC;IAC3E,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,cAAc,EAAE,EAAE,CAAC,EAAE,oBAAoB,CAAC,CAAC;IAClE,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QACzB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,oBAAoB,CAAC,CAAC;IAC/E,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,cAAc,EAAE,EAAE,CAAC,EAAE,oBAAoB,CAAC,CAAC;AACnE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,8BAA8B,EAAE,UAAU,MAAM;IAE1D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC;IACxB,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC;IACxB,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAC1B,CAAC;QACA,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACT,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnB,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACT,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC;IACD,IAAI,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;IAC3C,IAAI,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;IAC3C,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,EAAE,EAAE;QACrC,CAAC,CAAC,EAAE,CAAC,CAAC;QACN,CAAC,CAAC,EAAE,CAAC,CAAC;QACN,CAAC,CAAC,EAAE,CAAC,CAAC;QACN,CAAC,CAAC,EAAE,CAAC,CAAC;QACN,CAAC,CAAC,EAAE,CAAC,CAAC;QACN,CAAC,CAAC,EAAE,CAAC,CAAC;QACN,CAAC,CAAC,EAAE,CAAC,CAAC;QACN,CAAC,CAAC,EAAE,CAAC,CAAC;QACN,CAAC,CAAC,EAAE,CAAC,CAAC;KACN,EAAE,2BAA2B,CAAC,CAAC;IAChC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,EAAE,CAAC,EAAE,2BAA2B,CAAC,CAAC;IAC5E,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,EAAE,EAAE;QACrC,CAAC,CAAC,EAAE,CAAC,CAAC;QACN,CAAC,CAAC,EAAE,CAAC,CAAC;QACN,CAAC,CAAC,EAAE,CAAC,CAAC;QACN,CAAC,CAAC,EAAE,CAAC,CAAC;QACN,CAAC,CAAC,EAAE,CAAC,CAAC;QACN,CAAC,CAAC,EAAE,CAAC,CAAC;QACN,CAAC,CAAC,EAAE,CAAC,CAAC;QACN,CAAC,CAAC,EAAE,CAAC,CAAC;QACN,CAAC,CAAC,EAAE,CAAC,CAAC;KACN,EAAE,2BAA2B,CAAC,CAAC;IAChC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,EAAE,CAAC,EAAE,2BAA2B,CAAC,CAAC;AAC7E,CAAC,CAAC,CAAC;AC/GH;;GAEG;AAEH,KAAK,CAAC,IAAI,CAAC,mBAAmB,EAAE,UAAU,MAAM;IAE5C,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACrC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;IAClE,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACxB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;AAC7D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,yBAAyB,EAAE,UAAU,MAAM;IAElD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC5C,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;AACtE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,mBAAmB,EAAE,UAAU,MAAM;IAE5C,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;IAChD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;IAChD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;AACpD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,kBAAkB,EAAE,UAAU,MAAM;IAE3C,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IACxC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IACjD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,8BAA8B,CAAC,CAAC;AAC7E,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,uBAAuB,EAAE,UAAU,MAAM;IAEhD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC;IAC5D,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC;IACtE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,kCAAkC,CAAC,CAAC;AAChF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,uBAAuB,EAAE,UAAU,MAAM;IAEhD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QACvB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,EAAE,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IAC7B,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE;QACzC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,gBAAgB,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IACnE,CAAC,EAAE,CAAC;IACJ,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,QAAQ,EAAE,EAAE,CAAC,EAAE;QAC5C,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,oBAAoB,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;AAC3E,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,yBAAyB,EAAE,UAAU,MAAM;IAElD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;IACnD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;IACnD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;IACnD,KAAK,CAAC,GAAG,EAAE,CAAC;IACZ,KAAK,CAAC,GAAG,EAAE,CAAC;IACZ,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;AAEvD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,mBAAmB,EAAE,UAAU,MAAM;IAE5C,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;IAC5C,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;AAChD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,oBAAoB,EAAE,UAAU,MAAM;IAE7C,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,KAAK,CAAC,KAAK,EAAE,CAAC;IACd,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC;AAC3D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,uBAAuB,EAAE,UAAU,MAAM;IAEhD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;IACrD,KAAK,CAAC,KAAK,EAAE,CAAC;IACd,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;AACxD,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,kBAAkB,EAAE,UAAU,MAAM;IAE3C,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;IACxD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;IACxD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;IAC7D,IAAI,QAAQ,GAAG,UAAU,IAAI;QAEzB,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACpB,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,IAAI,EAAE,sBAAsB,CAAC,CAAC;IAC/E,QAAQ,GAAG,UAAU,IAAI;QAErB,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACpB,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,KAAK,EAAE,sBAAsB,CAAC,CAAC;AACpF,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,iBAAiB,EAAE,UAAU,MAAM;IAE1C,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,IAAI,QAAQ,GAAG,UAAU,IAAI;QAEzB,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACpB,CAAC,CAAC;IACF,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACxB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,oBAAoB,CAAC,CAAC;IAC5D,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,oBAAoB,CAAC,CAAC;AAChE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,uBAAuB,EAAE,UAAU,MAAM;IAEhD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QACvB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAEzB,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;IACnC,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IACpD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;IACvD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IACpD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,+CAA+C,CAAC,CAAC;AACxG,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,4BAA4B,EAAE,UAAU,MAAM;IAErD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QACvB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAEzB,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;IACnC,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;IAC7D,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC;IAChE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;IAC7D,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,8CAA8C,CAAC,CAAC;AAC3G,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,yBAAyB,EAAE,UAAU,MAAM;IAElD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QACvB,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IACvB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAEzB,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;IACnC,CAAC,CAAC;IACF,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;IACrE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,eAAe,CAAC,CAAC;IAC9D,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;IACrE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,4CAA4C,CAAC,CAAC;AAC/H,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,oBAAoB,EAAE,UAAU,MAAM;IAE7C,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QACvB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;IAC1B,IAAI,EAAE,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IAC7B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE;QACzC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,mBAAmB,CAAC,CAAC;AAC/D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,6BAA6B,EAAE,UAAU,MAAM;IAEtD,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IAC3B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QACvB,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IACvB,IAAI,KAAK,GAAG,KAAK,CAAC,aAAa,EAAE,CAAC;IAClC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;AACtE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,qBAAqB,EAAE,UAAU,MAAM;IAE9C,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,KAAK,EAAU,CAAC;IACnC,IAAM,MAAM,GAAG,GAAG,CAAC;IAEnB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE;QAC3B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAElB,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,IAAI;QAEpC,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,2BAA2B,CAAC,CAAC;IAC7D,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,2BAA2B,CAAC,CAAC;AAChF,CAAC,CAAC,CAAC;AC9NH;;GAEG;AAEH,KAAK,CAAC,IAAI,CAAC,oBAAoB,EAAE,UAAU,MAAM;IAE7C,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;IACzB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACpB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACpB,IAAI,OAAO,GAAG,EAAE,CAAC;IACjB,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;IAC7B,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,aAAa,CAAC,CAAC;IAC3D,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACvB,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IACxB,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IACxB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;IACzD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;IAC1D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;AAC9D,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,qBAAqB,EAAE,UAAU,MAAM;IAE9C,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;IACzB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACpB,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACrB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IACtB,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACrB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAClB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACpB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,sBAAsB,CAAC,CAAC;IAC/G,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,kBAAkB,CAAC,CAAC;IAC3E,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,EAAE,mBAAmB,CAAC,CAAC;IACrE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,mBAAmB,CAAC,CAAC;IACpE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,kBAAkB,CAAC,CAAC;IAC5D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,sBAAsB,CAAC,CAAC;AACxE,CAAC,CAAC,CAAC;AAEH,KAAK,CAAC,IAAI,CAAC,yBAAyB,EAAE,UAAU,MAAM;IAElD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;IACzB,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACvB,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IACxB,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IACzB,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IACxB,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACrB,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACvB,IAAI,QAAQ,GAAG,UAAU,IAAI;QAEzB,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IACpB,CAAC,CAAC;IACF,IAAI,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC/B,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,EACvC,CAAC;QACG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QACtC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,eAAe,CAAC,CAAC;IACnE,CAAC;AACL,CAAC,CAAC,CAAC"}
\ No newline at end of file